MATH 5345H --- Week 7: Quotient spaces and connectedness

← Back to Lecture Notes

0.1  (§22) The quotient topology

  • •

    Rmk. Injections gave us subspaces and embeddings. Surjections will give quotients — the dual construction, with finest in place of coarsest.

  • •

    Def. An equivalence relation ∼ on X: reflexive, symmetric, transitive. Classes [x]={y∣x∼y}; they are nonempty, cover X, are mutually disjoint. X/∼={[x]}, canonical surjection π⁢(x)=[x].

  • •

    Lem. Any surjection f:X→Y arises this way: set x∼y⇔f⁢(x)=f⁢(y); then h⁢([x])=f⁢(x) is a bijection X/∼→Y with f=h∘π.

  • •

    ★ Def. Quotient topology on Y from a surjection f:X→Y: U⊂Y⁢ open⇔f−1⁢(U)⁢ open in ⁢X. A surjection carrying this topology is a quotient map.

    Proof. It is a topology because f−1 commutes with ∪ and ∩. Quotient maps are continuous by construction.

  • •

    Lem. The quotient topology is the finest topology on Y making f continuous.

  • •

    Lem. f surjective is a quotient map ⇔ (A⊂Y closed ⇔f−1⁢(A) closed).

  • •

    Lem. A bijective quotient map is a homeomorphism, and conversely.

  • •

    Def. f is an open map if f⁢(U) is open for all open U; a closed map if f⁢(A) is closed for all closed A.

  • •

    Lem. f open ⇔ f⁢(B) open for every basis element B.

  • •

    ★ Lem. A surjective open map is a quotient map. So is a surjective closed map.

    Proof. U=f⁢(f−1⁢(U)) by surjectivity; then apply openness (resp. closedness).

  • •

    ★ Ex. f:[0,1]→S1, f⁢(t)=(cos⁡2⁢π⁢t,sin⁡2⁢π⁢t): continuous, surjective, closed (compactness), hence a quotient map. Not open. With 0∼1: [0,1]/∼≅S1.

  • •

    ★ Ex. Torus. g=f×f:[0,1]2→S1×S1 is a quotient map; identify (s,0)∼(s,1) and (0,t)∼(1,t). Classes: the four corners; the paired edge points; the interior singletons. So T2≅[0,1]2/∼.

  • •

    Ex. ℝ→{n,z,p} by sign. Quotient topology {∅,{n},{p},{n,p},Y}: not Hausdorff; z is the only closed point.

  • •

    Ex. π1:ℝ2→ℝ is open (hence a quotient map) but not closed: the hyperbola C={x⁢y=1} is closed, π1⁢(C)=ℝ−{0} is not.

  • •

    Caution. Ex. Restricting a quotient map can destroy the property. With A=C∪{(0,0)}, the map π1|A:A→ℝ is a continuous surjection but not a quotient map: {0} is not open in ℝ, yet its preimage {(0,0)} is open in A.

  • •

    Thm. f:X→Y a quotient map, B⊂Y, A=f−1⁢(B) saturated, g=f|A:A→B. Then g is a quotient map if either (1) A is open, or A is closed; or (2) f is an open map, or a closed map.

    Proof. Two identities do the work: g−1⁢(V)=f−1⁢(V) for V⊂B, and g⁢(A∩U)=B∩f⁢(U). Both use A=f−1⁢(B).

  • •

    Rmk. Composites of quotient maps are quotient maps. Caution. Products of quotient maps need not be; some local compactness hypothesis is required. Quotients of Hausdorff spaces need not be Hausdorff.

  • •

    ★ Thm. (Universal property.) f:X→Y a quotient map, h:X→Z constant on the fibres of f. Then h factors uniquely as h=g∘f; moreover g is continuous ⇔h is, and g is a quotient map ⇔h is.

  • •

    Cor. h:X→Z a continuous surjection, x∼y⇔h⁢(x)=h⁢(y). Then h induces a continuous bijection g:X/∼→Z; g is a homeomorphism ⇔h is a quotient map; and if Z is Hausdorff so is X/∼.

1  Connectedness and Compactness

1.1  (§23) Connected spaces

  • •

    Def. For disjoint spaces C,D: the disjoint union C⊔D carries the topology consisting of those W with C∩W open in C and D∩W open in D; the finest making both inclusions continuous.

  • •

    Rmk. C⊔D is also called the sum, or coproduct, of C and D; it has a universal property dual to that of the product C×D. Every X is trivially C⊔D with C=∅ or D=∅; if X≅C⊔D non-trivially, X is disconnected.

  • •

    ★ Def. A separation of X: a pair U,V of disjoint nonempty open sets with U∪V=X. X is connected if no separation exists.

  • •

    Rmk. Being connected is a topological property. The empty space needs care: some authors declare ∅ not connected, much as 1 has no proper factors yet is not counted as a prime.

  • •

    ★ Lem. X is connected ⇔ the only clopen subsets are ∅ and X.

    Proof. In a separation V=X−U, so “U,V both open” = “U clopen”, and “both nonempty” = “U≠∅,X”. Cleanest working form of the definition.

  • •

    Lem. U,V a separation ⇒X≅U⊔V; conversely X=C⊔D with both nonempty gives a separation.

  • •

    Lem. Equivalent formulation: a separation is a pair of disjoint nonempty sets A,B with A∪B=X, neither containing a limit point of the other (A¯∩B=∅=A∩B¯).

  • •

    Ex. One-point spaces are connected. Sierpiński {a,b} is connected ({a} open not closed, {b} closed not open). [−1,0)∪(0,1] is disconnected.

  • •

    Rmk. Coming in §24: ℝ is connected, as is every interval [a,b], [a,b), (a,b], (a,b) for −∞≤a≤b≤∞.

  • •

    Ex. Every X⊂ℚ with ≥2 points is disconnected: pick irrational a between p<q in X and cut at a.

  • •

    ★ Lem. U,V a separation of X, A⊂X connected ⇒A⊂U or A⊂V.

    Proof. A∩U is clopen in A. The single most-used lemma of the section.

  • •

    ★ Thm. A union of connected subspaces with a point in common is connected.

  • •

    ★ Thm. A⊂B⊂A¯, A connected ⇒B connected. (Adding limit points cannot disconnect.)

  • •

    ★ Thm. The continuous image of a connected space is connected.

1.2  (§24) Connected subspaces of the real line

  • •

    Def. C⊂ℝ is convex if a<b in C ⇒[a,b]⊂C.

  • •

    Ex. The convex subsets of ℝ: ∅; the intervals (a,b),[a,b),(a,b],[a,b]; the rays; and ℝ.

  • •

    ★ Thm. Every convex C⊂ℝ is connected. In particular ℝ is connected.

    Proof. Reduce to [a,b]. Given [a,b]=U⊔V with a∈U,b∈V, let c=supU. Then c∈U¯=U, so c≠b; but U open gives points >c in U — contradicting the supremum. Least upper bound property is doing all the work.

  • •

    ★ Thm. (Intermediate value theorem.) f:X→ℝ continuous, X connected, r between f⁢(a) and f⁢(b) ⇒∃c with f⁢(c)=r.

    Proof. Otherwise f−1⁢(−∞,r) and f−1⁢(r,∞) separate X.

  • •

    Def. A path from x to y: a map f:[a,b]→X, f⁢(a)=x, f⁢(b)=y. X is path connected if any two points are joined by a path.

  • •

    ★ Lem. Path connected ⇒ connected.

    Proof. A separation of X would pull back to a separation of [a,b].

  • •

    Lem. The continuous image of a path connected space is path connected.

  • •

    Def. C in a real vector space is convex if (1−t)⁢x+t⁢y∈C for x,y∈C, t∈[0,1].

  • •

    Ex. Convex subsets of ℝn are path connected — e.g. the unit ball Bn={‖x‖≤1}.

  • •

    Ex. ℝn−{0} is path connected for n≥2 (not for n=1). Hence Sn−1={‖x‖=1} is path connected for n≥2, being the image of x↦x/‖x‖. (S0={±1} is not.)

  • •

    ★ Ex. Topologist’s sine curve. S={(x,sin⁡(1/x))∣0<x≤1},   S¯=S∪V with V={0}×[−1,1]. S is connected (continuous image of (0,1]), hence so is S¯. But S¯ is not path connected.

    Proof. A path from V into S: reparametrise so f⁢(0)∈V, f⁢(t)∈S for t>0. Write f=(x,y). Construct tn→0 with y⁢(tn)=(−1)n via the IVT applied to x. Then y⁢(tn) does not converge — contradicting continuity.