Math 2.0

General topology Proof

Proof of Tychonoff's theorem by maximal families with the finite intersection property

Builds on Compact spaceProduct topology on an arbitrary productSubbasisTopological spaceFinite intersection propertyZorn's lemmaAxiom of choiceClosureClosure is the smallest closed supersetClosed set

Proof

We use the finite intersection property and a maximal family given by Zorn's lemma.

  1. Let X=∏i∈IXiX = \prod_{i \in I} X_i with the product topology, and let πi ⁣:X→Xi\pi_i \colon X \to X_i be the projections. If XX is empty, each open cover of XX has the empty subcover, so XX is compact. From now on, X≠∅X \neq \varnothing.
  2. A family ℱ\mathcal{F} of subsets of XX has the finite intersection property (FIP) when each intersection of finitely many members is nonempty.
  3. By the finite intersection property criterion with K=XK = X, it suffices to show this. If 𝒜\mathcal{A} is a family of closed subsets of XX with FIP, then ⋂𝒜≠∅\bigcap \mathcal{A} \neq \varnothing. Fix such an 𝒜\mathcal{A}.
  4. Let PP be the set of families ℱ\mathcal{F} of subsets of XX with 𝒜⊆ℱ\mathcal{A} \subseteq \mathcal{F} and with FIP, ordered by inclusion. It contains 𝒜\mathcal{A}, so it is nonempty.
  5. Let 𝒦\mathcal{K} be a chain in PP. If 𝒦\mathcal{K} is empty, 𝒜\mathcal{A} is an upper bound. Otherwise let 𝒰\mathcal{U} be the union of the members of 𝒦\mathcal{K}. It contains 𝒜\mathcal{A}.
  6. The family 𝒰\mathcal{U} has FIP. Finitely many members D1,…,DnD_1, \ldots, D_n of 𝒰\mathcal{U} lie in members ℱ1,…,ℱn\mathcal{F}_1, \ldots, \mathcal{F}_n of the chain. The largest of these contains all DkD_k, and it has FIP, so D1∩⋯∩Dn≠∅D_1 \cap \cdots \cap D_n \neq \varnothing.
  7. So each chain of PP has an upper bound in PP. By Zorn's lemma, PP has a maximal element 𝒟\mathcal{D}.
  8. Claim: each intersection EE of finitely many members of 𝒟\mathcal{D} is in 𝒟\mathcal{D}. Indeed, 𝒟∪{E}\mathcal{D} \cup \{E\} contains 𝒜\mathcal{A} and has FIP, since a finite intersection of its members is a finite intersection of members of 𝒟\mathcal{D}. By maximality, E∈𝒟E \in \mathcal{D}.
  9. Claim: if S⊆XS \subseteq X meets each member of 𝒟\mathcal{D}, then S∈𝒟S \in \mathcal{D}. Take D1,…,Dn∈𝒟D_1, \ldots, D_n \in \mathcal{D}. By step 8, D1∩⋯∩Dn∈𝒟D_1 \cap \cdots \cap D_n \in \mathcal{D}, so SS meets it. Thus 𝒟∪{S}\mathcal{D} \cup \{S\} has FIP, and maximality gives S∈𝒟S \in \mathcal{D}.
  10. Fix i∈Ii \in I. Let T‾\overline{T} denote the closure of a set TT. The family {πi(D)‾:D∈𝒟}\{\overline{\pi_i(D)} : D \in \mathcal{D}\} consists of closed subsets of XiX_i, by this result.
  11. This family has FIP. For D1,…,Dn∈𝒟D_1, \ldots, D_n \in \mathcal{D}, we have πi(D1∩⋯∩Dn)⊆πi(D1)‾∩⋯∩πi(Dn)‾\pi_i(D_1 \cap \cdots \cap D_n) \subseteq \overline{\pi_i(D_1)} \cap \cdots \cap \overline{\pi_i(D_n)}, and the left side is nonempty by FIP of 𝒟\mathcal{D}.
  12. The space XiX_i is compact, so the finite intersection property criterion gives that the set Zi=⋂D∈𝒟πi(D)‾Z_i = \bigcap_{D \in \mathcal{D}} \overline{\pi_i(D)} is nonempty.
  13. By the axiom of choice, choose xi∈Zix_i \in Z_i for each i∈Ii \in I, and let x=(xi)i∈I∈Xx = (x_i)_{i \in I} \in X.
  14. Let i∈Ii \in I and let UU be open in XiX_i with xi∈Ux_i \in U. Claim: πi−1(U)∈𝒟\pi_i^{-1}(U) \in \mathcal{D}.
  15. Proof of step 14. Let D∈𝒟D \in \mathcal{D}. If U∩πi(D)=∅U \cap \pi_i(D) = \varnothing, then πi(D)⊆Xi∖U\pi_i(D) \subseteq X_i \setminus U, which is closed. Then πi(D)‾⊆Xi∖U\overline{\pi_i(D)} \subseteq X_i \setminus U by minimality of the closure, which contradicts xi∈πi(D)‾x_i \in \overline{\pi_i(D)}.
  16. So UU meets πi(D)\pi_i(D), and hence πi−1(U)\pi_i^{-1}(U) meets DD. This holds for each D∈𝒟D \in \mathcal{D}, so step 9 gives πi−1(U)∈𝒟\pi_i^{-1}(U) \in \mathcal{D}.
  17. Let 𝒮\mathcal{S} be the subbasis of sets πi−1(U)\pi_i^{-1}(U) with UU open in XiX_i. Let ℬ\mathcal{B} be the set of intersections of finitely many members of 𝒮\mathcal{S}, together with XX.
  18. Let 𝒯\mathcal{T} be the set of all unions of members of ℬ\mathcal{B}. It contains ∅\varnothing and XX, and it is closed under unions.
  19. The intersection of two unions ⋃jBj\bigcup_j B_j and ⋃kBk′\bigcup_k B'_k is ⋃j,k(Bj∩Bk′)\bigcup_{j, k} (B_j \cap B'_k), and each Bj∩Bk′B_j \cap B'_k is in ℬ\mathcal{B}. So 𝒯\mathcal{T} is a topology that contains 𝒮\mathcal{S}.
  20. The product topology is the smallest topology that contains 𝒮\mathcal{S}, so each open set of XX is in 𝒯\mathcal{T}. Thus, if OO is open and x∈Ox \in O, there is B∈ℬB \in \mathcal{B} with x∈B⊆Ox \in B \subseteq O.
  21. Each B∈ℬB \in \mathcal{B} with x∈Bx \in B lies in 𝒟\mathcal{D}. For B=XB = X, note that XX meets each member of 𝒟\mathcal{D} and use step 9. Otherwise BB is a finite intersection of sets as in step 14, and step 8 applies.
  22. Let D∈𝒟D \in \mathcal{D}. Claim: x∈D‾x \in \overline{D}. Suppose not. Then O=X∖D‾O = X \setminus \overline{D} is open and contains xx, so by step 20 there is B∈ℬB \in \mathcal{B} with x∈B⊆Ox \in B \subseteq O.
  23. By step 21, B∈𝒟B \in \mathcal{D}, so B∩D≠∅B \cap D \neq \varnothing by FIP. But B⊆OB \subseteq O and D⊆D‾D \subseteq \overline{D}, so B∩D=∅B \cap D = \varnothing. This contradiction proves the claim.
  24. Let A∈𝒜A \in \mathcal{A}. Then A∈𝒟A \in \mathcal{D}, so x∈A‾x \in \overline{A} by step 22. As AA is closed, A‾=A\overline{A} = A, by minimality of the closure. So x∈Ax \in A.
  25. Thus x∈⋂𝒜x \in \bigcap \mathcal{A}, which is nonempty. By step 3, XX is compact.

Idea

Compactness means that closed families with the finite intersection property have a common point. We enlarge the given family to a maximal one, which is so large that a point xx can be built coordinate by coordinate. In each factor, compactness gives a coordinate xix_i, and maximality forces each neighbourhood of xx into the family, so xx lies in the closure of every member.

Reading path

To understand this page from the ground up, read these 77 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 compactness of a subset can be tested with open sets of the ambient space, Proof of Zorn's lemma, Proof that the closure is closed, Proof of the finite intersection property characterisation of compactness.

  1. Element definition
  2. Proof of Zorn's lemma proof
  3. Proposition concept
  4. Real numbers object
  5. Set definition
  6. Conjunction definition
  7. Disjunction definition
  8. Implication definition
  9. Negation definition
  10. Predicate definition
  11. Empty set object
  12. Family of sets definition
  13. Ordered pair definition
  14. Intersection definition
  15. Union definition
  16. Biconditional definition
  17. Truth table concept
  18. Existential quantifier definition
  19. Universal quantifier definition
  20. Cartesian product definition
  21. Subset definition
  22. Propositional logic concept
  23. Axiom of extensionality statement
  24. Intersection of a family of sets definition
  25. Union of a family of sets definition
  26. Uniqueness quantifier definition
  27. Binary relation definition
  28. Universal set definition
  29. Topological space definition
  30. Tautology definition
  31. Antisymmetric relation definition
  32. Reflexive relation definition
  33. Transitive relation definition
  34. Complement definition
  35. Subspace topology definition
  36. Function definition
  37. Basis of a topology definition
  38. Logical equivalence definition
  39. Preorder definition
  40. Metric space definition
  41. Proof of De Morgan's laws by truth tables proof
  42. Subbasis definition
  43. Choice function definition
  44. Partial order definition
  45. Open ball definition
  46. Product topology on an arbitrary product definition
  47. De Morgan's laws statement
  48. Axiom of choice statement
  49. Maximal element definition
  50. Total order definition
  51. Upper bound definition
  52. Metric topology definition
  53. Proof of De Morgan's laws for sets proof
  54. Chain definition
  55. Open set definition
  56. De Morgan's laws for sets statement
  57. Zorn's lemma statement
  58. Proof of the description of the open sets of a metric space proof
  59. Closed set definition
  60. Open cover definition
  61. Open sets of a metric space statement
  62. Closure definition
  63. Compact space definition
  64. Proof that a union of open sets of a metric space is open proof
  65. Proof that the closure is closed proof
  66. Compact set definition
  67. Union of open sets is open statement
  68. Proof that compactness of a subset can be tested with open sets of the ambient space proof
  69. Compactness via open covers statement
  70. Proof that an intersection of closed sets of a metric space is closed proof
  71. Proof of the finite intersection property characterisation of compactness proof
  72. Intersection of closed sets is closed statement
  73. Closure is closed statement
  74. Finite intersection property statement
  75. Proof that the closure is the smallest closed superset proof
  76. Closure is the smallest closed superset statement
  77. Proof of Tychonoff's theorem by maximal families with the finite intersection property proof

Where this leads

7 pages build on this one.

Further reading

  1. Web https://proofwiki.org/wiki/Tychonoff%27s_Theorem, Proof 2
About this page
Tag15KC9T4MW5
URIm2://15KC9T4MW5
Kindproof
WritingW0 stub
MSC54D30
ProvesTychonoff's theorem
UsesCompact space, Product topology on an arbitrary product, Subbasis, Topological space, Finite intersection property, Zorn's lemma, Axiom of choice, 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.