Alexander Subbasis Theorem
The Alexander subbasis theorem provides a powerful shortcut for proving compactness: instead of checking all open covers, it suffices to check covers by subbasis elements. This dramatically simplifies the proof of Tychonoff's theorem and other compactness arguments.
Statement
Let be a topological space with a subbasis . If every cover of by elements of has a finite subcover, then is compact.
Proof
We prove the contrapositive: if is not compact, then some subbasis cover has no finite subcover.
Suppose is not compact. Let be the collection of all open covers of that have no finite subcover. By hypothesis, is nonempty.
Step 1: Zorn's lemma. We partially order by inclusion (of collections of open sets). If is a chain in , then is an open cover with no finite subcover (any finite subcover of would be a finite subcollection of some , giving a finite subcover of , contradicting ). So , and Zorn's lemma gives a maximal element .
Step 2: Properties of . The maximal cover has no finite subcover, but adding any open set to creates a cover with a finite subcover (by maximality). That is, has a finite subcover with .
This means , or equivalently: covers .
Step 3: Subbasis elements in . We claim that does not cover .
Suppose covers . Every is a union of finite intersections of elements of : .
Since covers , for each , there exists with , hence for some . So the sets that appear cover .
Now, pick any that appears in the decomposition of some . If , then by Step 2, there exist covering . But was needed with other subbasis elements to compose ; we can replace with . Iterating this process (finitely many times for each intersection), we eventually express as a finite subcover of , contradicting .
More precisely: take any and . Then for some . If all , we are fine. If some , by Step 2, finitely many cover . Then . But then... we need to be covered, which it is (by elements of ). This gives a finite subcover of , contradiction.
Therefore does not cover , and the subbasis cover formed by taking all subbasis elements that participate in fails to cover. Since does cover , some element of is not a subbasis element. The subbasis elements alone from do not suffice to cover, confirming our contrapositive.
Application to Tychonoff's Theorem
If are compact spaces, then is compact.
The product topology on has subbasis . By the Alexander subbasis theorem, it suffices to show every cover of by subbasis elements has a finite subcover.
Let be a cover of by subbasis elements. For each , let . If covers for some , then by compactness of , finitely many suffice, giving a finite subcover of .
If no covers , then for each , there exists . Then the point is not in any (since for each ). But is supposed to cover . Contradiction.
(Note: the step "for each , there exists " uses the axiom of choice.)
The Alexander subbasis theorem was proved by James Waddell Alexander II in 1939. It provides the cleanest path to Tychonoff's theorem and highlights the role of the axiom of choice (needed to select for each simultaneously).
The product (each factor with the discrete topology) is compact for any index set , by Tychonoff's theorem. This product is homeomorphic to the Cantor set when , and gives the Cantor cube for uncountable .
Using the Alexander subbasis theorem directly: a subbasis cover consists of sets and . If they cover, either the sets alone cover (impossible unless every coordinate is forced to be ) or finitely many from each type cover. The argument shows a finite subcover always exists.