In mathematics, Tychonoff's theorem states that the product of any collection of compact topological spaces is compact with respect to the product topology. The theorem is named after Andrey Nikolayevich Tikhonov (whose surname sometimes is transcribed Tychonoff), who proved it first in 1930 for powers of the closed unit interval and in 1935 stated the full theorem along with the remark that its proof was the same as for the special case. The earliest known published proof is contained in a 1935 article by Tychonoff, "Über einen Funktionenraum". Tychonoff's theorem is one of the most foundational results in general topology. The theorem is also valid for topological spaces based on fuzzy sets.
Statement Here is the statement of the theorem.
Strength The above theorem turns out to be equivalent to the axiom of choice. There is a special case of the theorem saying
A product of compact Hausdorff spaces X i {\displaystyle X_{i}} is compact Hausdorff. If, in addition, all the X i {\displaystyle X_{i}} are nonempty, then the product ∏ X i {\displaystyle \prod X_{i}} is nonempty. This Hausdorff version of the theorem is actually strictly weaker than the axiom of choice and is equivalent to the Boolean prime ideal theorem. (Note for an arbitrary product, the axiom of choice ensures the product is nonempty when each factor is nonempty. But in the Hausdorff case, the above version can ensure the nonempty-ness without Choice. In fact, it implies a version of the axiom of choice; see § Application: the Hahn–Banach theorem.) For a finite product of compact sets, the theorem is rather trivial (see § Tychonoff's theorem for finite products below) and does not depend on the axiom of choice or weaker variants.
Tychonoff's theorem for finite products For a finite product of compact spaces, the theorem is substantially easier. For example, it would follow from
if X {\displaystyle X} is a compact space and Y {\displaystyle Y} is any topological space, then the projection p : X × Y → Y {\displaystyle p:X\times Y\to Y} is proper; i.e., the pre-image of a compact set is compact. Alternatively, the tube lemma can be used to give a direct proof; see Tube lemma § Examples and properties.
Further remark For a metric space, compactness is equivalent to sequential compactness. Using Cantor's diagonal argument, it is straightforward to show a countable product of sequentially compact spaces is sequentially compact space; thus, for metric spaces at least, this gives the theorem for a countable product. However, for many applications, taking uncountable products is necessary. For example, taking L = C ( X , I ) {\displaystyle L=C(X,I)} to be the set of all continuous maps from a topological space X {\displaystyle X} to the unit I = [ 0 , 1 ] {\displaystyle I=[0,1]} , we have the natural map
X → ∏ L I , x ↦ ( f ( x ) ∣ f ) . {\displaystyle X\to \prod _{L}I,\,x\mapsto (f(x)\mid f).}
The closure of the image is exactly the Stone–Čech compactification β X {\displaystyle \beta X} of the space X {\displaystyle X} ; here, the compactness of β X {\displaystyle \beta X} is a consequence of Tychonoff's theorem.
Applications Tychonoff's theorem has been used to prove many other mathematical theorems. These include theorems about compactness of certain spaces such as the Banach–Alaoglu theorem on the weak-* compactness of the unit ball of the dual space of a normed vector space, and the Arzelà–Ascoli theorem characterizing the sequences of functions in which every subsequence has a uniformly convergent subsequence. They also include statements less obviously related to compactness, such as the De Bruijn–Erdős theorem stating that every minimal k-chromatic graph is finite, and the Curtis–Hedlund–Lyndon theorem providing a topological characterization of cellular automata. As a rule of thumb, any sort of construction that takes as input a fairly general object (often of an algebraic, or topological-algebraic nature) and outputs a compact space is likely to use Tychonoff: e.g., the Gelfand space of maximal ideals of a commutative C*-algebra, the Stone space of maximal ideals of a Boolean algebra, and the Berkovich spectrum of a commutative Banach ring. In logic, specifically model theory, Tychonoff’s theorem implies the compactness theorem, which says a theory (a set of sentences) has a model if and only if each finite subset of it does.
Proofs 1) Tychonoff's 1930 proof used the concept of a complete accumulation point. 2) The theorem is a quick corollary of the Alexander subbase theorem. 3) The theory of convergence via filters, due to Henri Cartan and developed by Bourbaki, leads to the following criterion: assuming the ultrafilter lemma, a space is compact if and only if each ultrafilter on the space converges. With this in hand, the proof becomes easy: the (filter generated by the) image of an ultrafilter on the product space under any projection map is an ultrafilter on the factor space, which therefore converges, to at least one xi. One then shows that the original ultrafilter converges to x = (xi). See Filters in topology § Tychonoff's theorem for the ingredients used here. In the above proof, the axiom of choice is used two times: (1) to construct ultrafilters to characterize compactness and (2) to pick limit points x i {\displaystyle x_{i}} . Conversely, Tychonoff's theorem implies the axiom of choice; see § Proof of the axiom of choice from Tychonoff's theorem below. Thus, the use of the axiom of choice in the proof is unavoidable in general. However, if each factor X i {\displaystyle X_{i}} is Hausdorff, each limit point x i {\displaystyle x_{i}} is unique and so the second use of Choice is unnecessary. Ultrafilters, on the other hand, can be constructed by the Boolean prime ideal theorem or BPI (in the form of ultrafilter lemma) and, conversely, the Hausdorff version of the theorem implies BPI; see the remark at the end of § Application: the Hahn–Banach theorem. (Studying the strength of Tychonoff's theorem for various restricted classes of spaces is a topic in set-theoretic topology.) 3)' Adapting the above proof, it is also possible to give a proof directly from Zorn's lemma; see Zorn's lemma § A proof of Tychonoff's theorem. (For example, in his textbook, Munkres gives such a proof.) 4) Similarly, the Moore–Smith theory of convergence via nets, as supplemented by Kelley's notion of a universal net, leads to the criterion that a space is compact if and only if each universal net on the space converges. This criterion leads to a proof of Tychonoff's theorem, which is, word for word, identical to the Cartan/Bourbaki proof using filters, save for the repeated substitution of "universal net" for "ultrafilter". A proof using nets but not universal nets was given in 1992 by Paul Chernoff; see just below. 5) For compact Hausdorff spaces, the theorem (a product of compact Hausdorff spaces is compact Hausdorff) can be deduced from a corresponding result for locales: namely, a product of compact locales is compact.
Proof using nets A proof here, due to P. Chernoff, is based on the following characterization of compactness in terms of nets:
A space is compact if and only if each net on it has a cluster point. Given a family of compact sets X a {\displaystyle X_{a}} indexed by a set A {\displaystyle A} , to show
∏ a ∈ A X a {\displaystyle \prod _{a\in A}X_{a}}
is compact, we can therefore show each net ⟨ x α ∣ α ∈ I ⟩ {\displaystyle \langle x_{\alpha }\mid \alpha \in I\rangle } on it has a cluster point. We shall identity the product ∏ a ∈ A X a {\displaystyle \prod _{a\in A}X_{a}} as thet set of all maps f : A → ∪ a ∈ A X a {\displaystyle f:A\to \cup _{a\in A}X_{a}} such that f ( a ) ∈ X a {\displaystyle f(a)\in X_{a}} ; in fact, this is the usual definition of a set-theoretic product. Then finding a required cluster point amounts to constructing such a map with the required property. For that, consider the set
E := { f : B → Y ∣ B ⊂ A , f ( b ) ∈ X b , f a cluster point of x i | B } {\displaystyle E:=\{f:B\to Y\mid B\subset A,f(b)\in X_{b},\,f\,{\text{ a cluster point of }}\,{x_{i}}|_{B}\}}
where Y = ∪ a ∈ A X a {\displaystyle Y=\cup _{a\in A}X_{a}} . We give this set the ordering by restriction; i.e., f ≤ g {\displaystyle f\leq g} if and only if f {\displaystyle f} is the restriction of g {\displaystyle g} . We now claim the hypothesis of Zorn's lemma is satisfied. For that, let f i : B i → Y {\displaystyle f_{i}:B_{i}\to Y} be a chain in the above E {\displaystyle E} and define f : B → Y {\displaystyle f:B\to Y} by B = ∪ i B i {\displaystyle B=\cup _{i}B_{i}} and f | B i = f i {\displaystyle f|_{B_{i}}=f_{i}} . To show f {\displaystyle f} is a cluster point of x i | B {\displaystyle {x_{i}}|_{B}} , let U {\displaystyle U} be a basic neighborhood of f {\displaystyle f} in ∏ a ∈ B X a . {\displaystyle \prod _{a\in B}X_{a}.} By definition, it can be written as U = ∏ c ∈ C U c × ∏ b ∈ B − C X b {\displaystyle U=\prod _{c\in C}U_{c}\times \prod _{b\in B-C}X_{b}} for some finite subset C ⊂ B {\displaystyle C\subset B} and open subsets U c ⊂ X c {\displaystyle U_{c}\subset X_{c}} . Now, since C {\displaystyle C} is finite, C ⊂ B i {\displaystyle C\subset B_{i}} for large enough i {\displaystyle i} . And since f | B i {\displaystyle f|_{B_{i}}} is a cluster point of the net x α | B i {\displaystyle x_{\alpha }|_{B_{i}}} , for each α ∈ I {\displaystyle \alpha \in I} , we can find a β ≥ α {\displaystyle \beta \geq \alpha } such that x β | B i ∈ ∏ c ∈ C U c × ∏ b ∈ B i − C X b {\displaystyle x_{\beta }|_{B_{i}}\in \prod _{c\in C}U_{c}\times \prod _{b\in B_{i}-C}X_{b}} and thus x β | B ∈ U {\displaystyle x_{\beta }|_{B}\in U} as required. Hence, by Zorn's lemma, we can find a maximal element f : B → Y {\displaystyle f:B\to Y} in E {\displaystyle E} . We shall show B = A {\displaystyle B=A} . Suppose otherwise; then there is an element a ∈ A − B {\displaystyle a\in A-B} . Now, f | B {\displaystyle f|_{B}} is a cluster point of ⟨ x α | B ∣ α ∈ I ⟩ {\displaystyle \langle x_{\alpha }|_{B}\mid \alpha \in I\rangle } and so we can find a subnet x ′ : J → I → x ∏ X a {\displaystyle x':J\to I{\overset {x}{\to }}\prod X_{a}} of the net x {\displaystyle x} such that x α ′ | B {\displaystyle x'_{\alpha }|_{B}} converges to f | B {\displaystyle f|_{B}} . Since X a {\displaystyle X_{a}} is compact, x α ′ | { a } {\displaystyle x'_{\alpha }|_{\{a\}}} has a cluster point, and so similarly we can find a subnet x ″ {\displaystyle x''} of x ′ {\displaystyle x'} that converges on { a } {\displaystyle \{a\}} , to some point of X a {\displaystyle X_{a}} . Thus, we can extend f {\displaystyle f} to g {\displaystyle g} that is a limit of x ″ | B ∪ { a } {\displaystyle x''|_{B\cup \{a\}}} , a contradiction to the maximality of f {\displaystyle f} . ◻ {\displaystyle \square }
Proof of the axiom of choice from Tychonoff's theorem To prove that Tychonoff's theorem in its general version implies the axiom of choice, we establish that every infinite cartesian product of non-empty sets is nonempty. The trickiest part of the proof is introducing the right topology. The right topology, as it turns out, is the cofinite topology with a small twist. It turns out that every set given this topology automatically becomes a compact space. Once we have this fact, Tychonoff's theorem can be applied; we then use the finite intersection property (FIP) definition of compactness. The proof itself (due to J. L. Kelley) follows: Let {Ai} be an indexed family of nonempty sets, for i ranging in I (where I is an arbitrary indexing set). We wish to show that the cartesian product of these sets is nonempty. Now, for each i, take Xi to be Ai with the index i itself tacked on (renaming the indices using the disjoint union if necessary, we may assume that i is not a member of Ai, so simply take Xi = Ai ∪ {i}). Now define the cartesian product
X = ∏ i ∈ I X i {\displaystyle X=\prod _{i\in I}X_{i}}
along with the natural projection maps πi which take a member of X to its ith term. We give each Xj the topology whose open sets are: the empty set, the singleton {i}, the set Xi. This makes Xi compact, and by Tychonoff's theorem, X is also compact (in the product topology). The projection maps are continuous; all the Ai's are closed, being complements of the singleton open set {i} in Xi. So the inverse images πi−1(Ai) are closed subsets of X. We note that
∏ i ∈ I A i = ⋂ i ∈ I π i − 1 ( A i ) {\displaystyle \prod _{i\in I}A_{i}=\bigcap _{i\in I}\pi _{i}^{-1}(A_{i})}
and prove that these inverse images have the FIP. Let i1, ..., iN be a finite collection of indices in I. Then the finite product Ai1 × ... × AiN is non-empty (only finitely many choices here, so AC is not needed); it merely consists of N-tuples. Let a = (a1, ..., aN) be such an N-tuple. We extend a to the whole index set: take a to the function f defined by f(j) = ak if j = ik, and f(j) = j otherwise. This step is where the addition of the extra point to each space is crucial, for it allows us to define f for everything outside of the N-tuple in a precise way without choices (we can already choose, by construction, j from Xj ). πik(f) = ak is obviously an element of each Aik so that f is in each inverse image; thus we have
⋂ k = 1 N π i k − 1 ( A i k ) ≠ ∅ . {\displaystyle \bigcap _{k=1}^{N}\pi _{i_{k}}^{-1}(A_{i_{k}})\neq \varnothing .}
By the FIP definition of compactness, the entire intersection over I must be nonempty, and the proof is complete.
Application: the Hahn–Banach theorem A standard proof of the Hahn-Banach theorem in functional analysis uses the axiom of choice in the form of Zorn's lemma. Tychonoff's theorem for compact Hausdorff spaces, which is strictly weaker than the axiom of choice and is equivalent to the Boolean prime ideal theorem, can be used to give an alternative proof. Specifically, Tychonoff's theorem in the Hausdorff case is used to deduce the following variant of the axiom of choice. Given a family of nonempty compact Hausdorff spaces K x , x ∈ X {\displaystyle K_{x},\,x\in X} parametrized by a set X {\displaystyle X} , by a choice function for it, we shall mean a function
c : X → U := ∪ x ∈ X K x {\displaystyle c:X\to U:=\cup _{x\in X}K_{x}}
such that c ( x ) ∈ K x {\displaystyle c(x)\in K_{x}} for each x {\displaystyle x} . Also, for a relation R {\displaystyle R} on U {\displaystyle U} ; i.e., a subset of U × U {\displaystyle U\times U} , we say such c {\displaystyle c} is R {\displaystyle R} -consistent on a set S ⊂ X {\displaystyle S\subset X} if ( c ( x ) , c ( y ) ) ∈ R {\displaystyle (c(x),c(y))\in R} for each x , y ∈ S {\displaystyle x,y\in S} .
Proof of lemma: let P = ∏ x ∈ X K x {\displaystyle P=\prod _{x\in X}K_{x}} , which is nonempty and compact (also Hausdorff). Consider the family P S {\displaystyle P^{S}} parametrized by finite subsets S ⊂ X {\displaystyle S\subset X} and given by
P S = {\displaystyle P^{S}=} the set of all c ∈ P {\displaystyle c\in P} that are R {\displaystyle R} -consistent on S {\displaystyle S} . Each P S {\displaystyle P^{S}} is the intersection of p x , y − 1 ( R ∩ ( K x × K y ) ) {\displaystyle p_{x,y}^{-1}(R\cap (K_{x}\times K_{y}))} over x , y ∈ S {\displaystyle x,y\in S} , where p x , y ( c ) = ( p x ( c ) , p y ( c ) ) {\displaystyle p_{x,y}(c)=(p_{x}(c),p_{y}(c))} . Thus, it is closed and nonempty by assumption. By compactness, the intersection ∩ S P S {\displaystyle \cap _{S}P^{S}} is nonempty and any element of it (which we can pick without the axiom of choice) is a required choice function. ◻ {\displaystyle \square }
Now, the Hahn-Banach theorem is proved as follows. Given a linear functional f {\displaystyle f} on a subspace V 0 ⊂ V {\displaystyle V_{0}\subset V} dominated by a seminorm p {\displaystyle p} , consider
X {\displaystyle X} = the set of all finite-dimensional subspaces of V {\displaystyle V} . For each W ∈ X {\displaystyle W\in X} , W ′ {\displaystyle W'} = its dual and K W = { g ∈ W ′ ∣ g | W ∩ V 0 = f | W ∩ V 0 , | g | ≤ p } . {\displaystyle K_{W}=\{g\in W'\mid g|_{W\cap V_{0}}=f|_{W\cap V_{0}},\,|g|\leq p\}.}
R = { ( g , h ) ∈ K W 1 × K W 2 ∣ W i ∈ X , g | W 1 ∩ W 2 = h | W 1 ∩ W 2 } {\displaystyle R=\{(g,h)\in K_{W_{1}}\times K_{W_{2}}\mid W_{i}\in X,\,g|_{W_{1}\cap W_{2}}=h|_{W_{1}\cap W_{2}}\}} . It is easy to see the assumptions of the lemma are satisfied and thus we find an R {\displaystyle R} -consistent choice function c {\displaystyle c} . Then the functional g ( x ) = c ( W ) ( x ) , W = span { x } {\displaystyle g(x)=c(W)(x),\,W=\operatorname {span} \{x\}} is a required extension. Incidentally, essentially the same proof can show that Tychonoff's theorem for compact Hausdorff spaces implies the Boolean prime ideal theorem. Indeed, on a Boolean algebra B {\displaystyle B} , like in ring theory, to give a prime ideal is to give a homomorphism B → 2 {\displaystyle B\to 2} . Then the idea in the above proof can be used to construct such a homomorphism, finishing the proof.
Notes
References Chernoff, Paul R. (1992), "A simple proof of Tychonoff's theorem via nets", American Mathematical Monthly, 99 (10): 932–934, doi:10.2307/2324485, JSTOR 2324485. Johnstone, Peter T. (1982), Stone spaces, Cambridge Studies in Advanced Mathematics, vol. 3, New York: Cambridge University Press, ISBN 0-521-23893-5. Munkres, James R. (2000), Topology (2nd ed.), Upper Saddle River, NJ: Prentice Hall, Inc, ISBN 978-0-13-181629-9, OCLC 42683260 (accessible to patrons with print disabilities) Tychonoff, Andrey N. (1930), "Über die topologische Erweiterung von Räumen", Mathematische Annalen (in German), 102 (1): 544–561, doi:10.1007/BF01782364. Wilansky, A. (1970), Topology for Analysis, Ginn and Company Willard, Stephen (2004) [1970], General Topology, Mineola, N.Y.: Dover Publications, ISBN 978-0-486-43479-7, OCLC 115240 Wright, David G. (1994), "Tychonoff's theorem.", Proc. Amer. Math. Soc., 120 (3): 985–987, doi:10.1090/s0002-9939-1994-1170549-2.
External links Mizar system proof: http://mizar.org/version/current/html/yellow17.html#T23