This scene is about connected sets. Move the cut point and check whether the set splits into two open pieces that never touch.
A set that cannot be split is connected. An interval never splits: wherever you cut, the cut point itself belongs to neither side. Two far-apart pieces, or the rationals with their dense gaps, split cleanly when the cut lands in a gap.
For example, look at one 🧩 jigsaw puzzle. While the pieces interlock, it is a single board. Lying in two completely separate piles, it is already split apart.
X=U∪V,U∩V=∅,U,V open in X,U,V=∅⟹X disconnected
Q∩[0,1]={q∈Q:q<2/2}∪{q∈Q:q>2/2}
Examples & Exercises
Prove completely that the interval [0,1] is connected.
That is, show that if U,V are disjoint sets, both open in [0,1], with [0,1]=U∪V, then at least one of U,V is empty.
[0,1]=U∪V,U∩V=∅,U,V open in [0,1]⟹U=∅ or V=∅
t=0.5: the cut point 0.5 itself belongs to neither side, so the pair does not cover — every cut of [0,1] fails this way.Show proof
Suppose [0,1]=U∪V is a separation, with U,V both nonempty.
Renaming if needed, assume 0∈U (0 lies in one of U,V, and the symmetry x↦1−x makes the two cases identical).
Put S={x∈[0,1]:[0,x]⊆U} and c=supS.
Since 0∈S, S=∅; it is bounded above by 1, so c∈[0,1] exists by completeness.
First, c∈U.
Since V is open in [0,1], its complement U=[0,1]∖V is closed in [0,1] — that is, U equals its own closure in the subspace: U∩[0,1]=U.
If c=0 then c=0∈U. If c>0, then for every ε>0 the definition of supremum gives x∈S with c−ε<x≤c.
That x satisfies x∈[0,x]⊆U, so the neighborhood (c−ε,c+ε) meets U, and hence c∈U.
Therefore c∈U∩[0,1]=U.
Next, [0,c]⊆U: if y<c then the definition of supremum gives x∈S with y<x≤c, so y∈[0,x]⊆U; and the endpoint c itself lies in U by the previous step.
Now c=1. Suppose instead c<1.
Since c∈U and U is open in [0,1], there is δ>0 with (c−δ,c+δ)∩[0,1]⊆U.
Put δ′=min(δ/2,(1−c)/2)>0 (positive since c<1). Then [0,c+δ′]=[0,c]∪(c,c+δ′]⊆U.
So c+δ′∈S, yet c+δ′>c=supS — a contradiction. Hence c=1.
Hence [0,1]=[0,c]⊆U.
But a separation requires V=∅, so some v∈V exists.
Then v∈[0,1]⊆U and v∈V, giving U∩V=∅ — contradicting disjointness.
Therefore no separation of [0,1] exists, and [0,1] is connected.
This is why every cut in the scene fails: a cut point t∈[0,1] can belong to neither open side, and this proof shows the same phenomenon defeats every open pair, not just interval cuts.
Prove completely that if X is path-connected then X is connected.
Path-connected means that for any a,b∈X there is a continuous γ:[0,1]→X with γ(0)=a and γ(1)=b.
You may use Problem 1 (connectedness of [0,1]).
γ:[0,1]→X continuous,A=γ−1(U),B=γ−1(V)
[0,1]=A∪B,A∩B=∅,A,B open in [0,1]
X=[0,1]∪[2,3], t=1.5: a space where a separation succeeds — no path can cross between the pieces, for its preimage would separate [0,1].Show proof
Let X be path-connected, and suppose for a contradiction that X=U∪V is a separation: U,V open in X, disjoint, and both nonempty.
Pick a∈U and b∈V.
By path-connectedness there is a continuous γ:[0,1]→X with γ(0)=a and γ(1)=b.
Put A=γ−1(U) and B=γ−1(V).
Since γ is continuous and U,V are open in X, both A and B are open in [0,1]: if t0∈A then γ(t0)∈U; openness of U gives ε>0 with U containing the ε-neighborhood of γ(t0); continuity then sends a whole δ-neighborhood of t0 into that ε-neighborhood, so the δ-neighborhood lies in A. The same argument works for B.
Check the four separation conditions in [0,1].
Cover: for every t∈[0,1], γ(t)∈X=U∪V, so t∈A∪B; that is, [0,1]=A∪B.
Disjoint: if t∈A∩B then γ(t)∈U∩V=∅, impossible; so A∩B=∅.
Nonempty: 0∈A (since γ(0)=a∈U) and 1∈B (since γ(1)=b∈V).
Thus [0,1]=A∪B is a separation of [0,1].
This contradicts Problem 1 — [0,1] is connected, so it admits no separation.
Hence no separation X=U∪V of X can exist, and X is connected.
The converse is false: the closure of the topologist's sine curve is connected but not path-connected.
Prove completely that every subset A⊆Q with at least two points is disconnected.
Conclude that Q is totally disconnected: its only connected subsets are singletons and ∅.
α=p+2q−p,2=α−pq−p∈/Q
A=(A∩(−∞,α))∪(A∩(α,∞))
The cut c=2/2≈0.7071: being irrational, it hits no rational point, so it covers and splits Q∩[0,1].Show proof
Let A⊆Q have at least two points, and pick p,q∈A with p<q.
Put α=p+2q−p.
Since 0<21<1 (that is, 1<2<2), α is a strict convex combination of p and q:
p<α<q.
The number α is irrational. Suppose α∈Q.
Then α−p∈Q, and α−p=2q−p>0, so it is nonzero; rearranging gives 2=α−pq−p.
Since q−p∈Q is nonzero, this ratio is rational — contradicting the irrationality of 2.
Hence α∈/Q; in particular, α equals no element of A.
Put U=A∩(−∞,α) and V=A∩(α,∞).
Open: (−∞,α) and (α,∞) are open rays in R, so U and V are open in the subspace A.
Disjoint: x<α and x>α are incompatible, so U∩V=∅.
Cover: if a∈A then a∈Q, so a=α, and therefore a<α (so a∈U) or a>α (so a∈V). That is, A=U∪V.
Nonempty: p∈U (as p<α) and q∈V (as α<q).
Thus A=U∪V is a separation of A, so A is disconnected.
Since A was an arbitrary subset of Q with at least two points, every connected subset of Q has at most one point — Q is totally disconnected.
The scene's cut 2/2 is exactly this α for p=0, q=1: α=21=22. Between any two rationals an irrational slips in and splits the set.