Math 2.0

General topology Proof

Proof that connected components are connected and closed

Builds on Connected setConnected spaceSubspace topologyUnion of a family of setsClosureClosure is the smallest closed supersetClosed set

Proof

We show that C(x)C(x) is connected, then that its closure is connected, so that the closure is not larger than C(x)C(x).

  1. Recall that S⊆XS \subseteq X is connected when it is a connected space in the subspace topology. The open sets of SS are the sets S∩US \cap U with UU open in XX.
  2. A set SS is not connected exactly when there are open U,V⊆XU, V \subseteq X with S∩US \cap U and S∩VS \cap V nonempty, S∩U∩V=∅S \cap U \cap V = \varnothing and S⊆U∪VS \subseteq U \cup V.
  3. The set {x}\{x\} is connected, since it has no two nonempty disjoint subsets. So x∈C(x)x \in C(x).
  4. C(x)C(x) is connected. Suppose not, and take U,VU, V as in step 2 for S=C(x)S = C(x). As x∈C(x)⊆U∪Vx \in C(x) \subseteq U \cup V, we may assume x∈Ux \in U, after swapping UU and VV.
  5. Let SS be a connected subset of XX with x∈Sx \in S. The sets S∩US \cap U and S∩VS \cap V are open in SS, disjoint, and cover SS, because S⊆C(x)S \subseteq C(x).
  6. As SS is connected, one of them is empty. It is not S∩US \cap U, which contains xx. So S∩V=∅S \cap V = \varnothing, and S⊆US \subseteq U.
  7. C(x)C(x) is the union of all such SS, so C(x)⊆UC(x) \subseteq U and C(x)∩V⊆C(x)∩U∩V=∅C(x) \cap V \subseteq C(x) \cap U \cap V = \varnothing. This contradicts step 2. So C(x)C(x) is connected.
  8. Let K=C(x)‾K = \overline{C(x)} be the closure. Then KK is closed and C(x)⊆KC(x) \subseteq K, by this result.
  9. KK is connected. Suppose not, and take U,VU, V as in step 2 for S=KS = K.
  10. Then C(x)∩UC(x) \cap U and C(x)∩VC(x) \cap V are open in C(x)C(x), disjoint, and cover C(x)C(x). As C(x)C(x) is connected, one of them is empty. Say C(x)∩V=∅C(x) \cap V = \varnothing; the other case is the same with UU and VV swapped.
  11. Then C(x)⊆X∖VC(x) \subseteq X \setminus V, which is closed. By the minimality of the closure in this result, K⊆X∖VK \subseteq X \setminus V.
  12. So K∩V=∅K \cap V = \varnothing, which contradicts step 2. Thus KK is connected.
  13. KK is connected and contains xx, so KK is one of the sets in the union that defines C(x)C(x). Thus K⊆C(x)K \subseteq C(x).
  14. With step 8, C(x)=KC(x) = K. So C(x)C(x) is closed, and by step 7 it is connected.

Idea

The union of connected sets through one point is connected, because any splitting would have to put each of them on the side of that point. The closure of a connected set is still connected. So the closure of the largest connected set through xx cannot be larger than it, which means that this set is closed.

Reading path

To understand this page from the ground up, read these 56 pages in order. The foundations come first. The path takes the proofs Proof of De Morgan's laws for sets, Proof of De Morgan's laws by truth tables, Proof that a union of open sets of a metric space is open, Proof that an intersection of closed sets of a metric space is closed, Proof that the closure is the smallest closed superset, Proof of the description of the open sets of a metric space, Proof that the closure is closed.

  1. Element definition
  2. Proposition concept
  3. Real numbers object
  4. Set definition
  5. Conjunction definition
  6. Disjunction definition
  7. Implication definition
  8. Negation definition
  9. Predicate definition
  10. Empty set object
  11. Family of sets definition
  12. Ordered pair definition
  13. Intersection definition
  14. Union definition
  15. Biconditional definition
  16. Truth table concept
  17. Existential quantifier definition
  18. Universal quantifier definition
  19. Cartesian product definition
  20. Propositional logic concept
  21. Subset definition
  22. Axiom of extensionality statement
  23. Intersection of a family of sets definition
  24. Union of a family of sets definition
  25. Uniqueness quantifier definition
  26. Binary relation definition
  27. Universal set definition
  28. Topological space definition
  29. Tautology definition
  30. Complement definition
  31. Subspace topology definition
  32. Function definition
  33. Logical equivalence definition
  34. Metric space definition
  35. Proof of De Morgan's laws by truth tables proof
  36. Open ball definition
  37. De Morgan's laws statement
  38. Metric topology definition
  39. Proof of De Morgan's laws for sets proof
  40. Open set definition
  41. De Morgan's laws for sets statement
  42. Proof of the description of the open sets of a metric space proof
  43. Closed set definition
  44. Open sets of a metric space statement
  45. Connected space definition
  46. Closure definition
  47. Connected set definition
  48. Proof that a union of open sets of a metric space is open proof
  49. Proof that the closure is closed proof
  50. Union of open sets is open statement
  51. Proof that an intersection of closed sets of a metric space is closed proof
  52. Intersection of closed sets is closed statement
  53. Closure is closed statement
  54. Proof that the closure is the smallest closed superset proof
  55. Closure is the smallest closed superset statement
  56. Proof that connected components are connected and closed proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Connected_space, Connected components
About this page
Tag3Y504JQAY2
URIm2://3Y504JQAY2
Kindproof
WritingW0 stub
MSC54D05
ProvesConnected components are closed
UsesConnected set, Connected space, Subspace topology, Union of a family of sets, Closure, Closure is the smallest closed superset, Closed set
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.