MATH 5345H --- Week 8: Components, local connectedness, and compactness

← Back to Lecture Notes

0.1  (§25) Components and local connectedness

  • •

    Def. x∼y iff some connected C⊂X contains both. An equivalence relation; classes are the components of X.

  • •

    Thm. Components are connected, disjoint, and cover X; every nonempty connected subset lies in exactly one.

    Proof. Connectedness of a component C: fix x0∈C, write C=⋃x∈CAx with each Ax connected containing x0; apply the common-point theorem.

  • •

    Thm. A finite product of connected spaces is connected.

    Proof. In X×Y: X×{y} then {x′}×Y links (x,y) to (x′,y′). Then induct.

    Rmk. True for arbitrary products too.

  • •

    Def. x≃y iff a path joins them; classes are the path components. Same statements as for components.

  • •

    Ex. S¯ (topologist’s sine curve): one component, two path components S and V. Note S is open but not closed in S¯; V is closed but not open.

  • •

    Def. X is locally connected at x if every neighborhood U of x contains a connected neighborhood V of x: x∈V⊂U. Likewise locally path connected.

  • •

    Ex. ℝ is locally (path) connected. S¯ is not: small neighborhoods of points of V are disconnected.

  • •

    Caution. Connected ≠ locally connected, in either direction.

  • •

    ★ Thm. X locally connected ⇒ every component is open. X locally path connected ⇒ every path component is open.

  • •

    ★ Thm. Each path component lies in a unique component. If X is locally path connected, components = path components.

    Proof. C=P⊔U with U a union of other path components; all are open, so P is clopen in the connected C, forcing P=C.

0.2  (§26) Compact spaces

  • •

    Def. 𝒜={Uα} covers X if ⋃Uα=X; an open cover if all Uα are open. A subcover is a subcollection that still covers.

  • •

    ★ Def. X is compact if every open cover of X has a finite subcover.

  • •

    Ex. Finite spaces are compact. ℝ is not: {(n−1,n+1)}n∈ℕ has no finite subcover. But ℝ with 𝒯triv is compact.

    Note. Compactness is a property of the topology, not of the set — worth saying out loud before students attach it to “bounded”.

  • •

    Rmk. Story break. Tell the Atiyah–Segal examination anecdote from S. G. Krantz, Mathematical Apocrypha: a nervous student, asked for an example of a compact set, answers “the real line” — and Segal rescues him with “in what topology?” The joke is exactly the previous two examples.

  • •

    Ex. X={0}∪{1/n∣n∈ℕ}⊂ℝ is compact: one U∋0 catches all but finitely many 1/n; cover those individually.

  • •

    Ex. Any X with 𝒯cof is compact: one nonempty Uβ leaves a finite complement.

  • •

    ★ Lem. Y⊂X is compact ⇔ every cover of Y by open subsets of X has a finite subcollection covering Y.

    Proof. Translate along Vα=Y∩Uα. Lets you work in X and forget the subspace topology.

  • •

    ★ Thm. A closed subspace of a compact space is compact.

  • •

    ★ Thm. A compact subspace of a Hausdorff space is closed.

    Proof. Fix p∉K. For each q∈K separate p,q by Uq,Vq. Finitely many Vqi cover K; then U=⋂Uqi misses K. Compact sets generalise finite sets here.

  • •

    Lem. (Extracted from that proof.) X Hausdorff, K compact, p∉K ⇒ there are disjoint open U∋p and V⊃K.

  • •

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

  • •

    ★ Thm. f:X→Y a map, X compact, Y Hausdorff. Then

    1. (1)

      f is a closed map;

    2. (2)

      f surjective ⇒ f is a quotient map;

    3. (3)

      f bijective ⇒ f is a homeomorphism;

    4. (4)

      f injective ⇒ f is an embedding.

    Proof. All from (1): A closed ⇒ A compact ⇒ f⁢(A) compact ⇒ f⁢(A) closed. This is the standard device for upgrading continuous bijections — contrast [0,1)→S1.

  • •

    Ex. ℝ→{0}: preimages of compact sets need not be compact. Def. f is proper if f−1⁢(K) is compact for every compact K.

  • •

    ★ Lem. (Tube lemma.) Y compact, N⊂X×Y open with {p}×Y⊂N ⇒ there is a neighborhood U∋p with U×Y⊂N.

    Proof. Cover {p}×Y by basis boxes Uq×Vq⊂N; finitely many Vqi suffice; take U=⋂Uqi.

  • •

    Caution. Fails without compactness of Y: take N={|x⁢y|<1}⊃{0}×ℝ.

  • •

    ★ Thm. X,Y compact ⇒X×Y compact. Cor. Finite products of compact spaces are compact.

    Proof. For each p, finitely many Wα cover {p}×Y; the tube lemma widens this to Up×Y. Then finitely many Up cover X. Union of finitely many finite collections.

  • •

    Def. 𝒞 has the finite intersection property if every finite subcollection has nonempty intersection.

  • •

    ★ Thm. X is compact ⇔ every collection 𝒞 of closed sets with the finite intersection property has ⋂C∈𝒞C≠∅.

    Proof. Purely the contrapositive of the definition, read through complements. Write the four successive rephrasings on the board.