TheoremComplete

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

Theorem8.11Alexander Subbasis Theorem

Let XX be a topological space with a subbasis S\mathcal{S}. If every cover of XX by elements of S\mathcal{S} has a finite subcover, then XX is compact.


Proof

Proof

We prove the contrapositive: if XX is not compact, then some subbasis cover has no finite subcover.

Suppose XX is not compact. Let Ξ£\Sigma be the collection of all open covers of XX that have no finite subcover. By hypothesis, Ξ£\Sigma is nonempty.

Step 1: Zorn's lemma. We partially order Ξ£\Sigma by inclusion (of collections of open sets). If {CΞ²}Ξ²\{C_\beta\}_{\beta} is a chain in Ξ£\Sigma, then C=⋃βCΞ²C = \bigcup_\beta C_\beta is an open cover with no finite subcover (any finite subcover of CC would be a finite subcollection of some CΞ²C_\beta, giving a finite subcover of CΞ²C_\beta, contradicting Cβ∈ΣC_\beta \in \Sigma). So C∈ΣC \in \Sigma, and Zorn's lemma gives a maximal element M∈Σ\mathcal{M} \in \Sigma.

Step 2: Properties of M\mathcal{M}. The maximal cover M\mathcal{M} has no finite subcover, but adding any open set Uβˆ‰MU \notin \mathcal{M} to M\mathcal{M} creates a cover with a finite subcover (by maximality). That is, Mβˆͺ{U}\mathcal{M} \cup \{U\} has a finite subcover {U,V1,…,Vk}\{U, V_1, \ldots, V_k\} with Vi∈MV_i \in \mathcal{M}.

This means Xβˆ–UβŠ†V1βˆͺβ‹―βˆͺVkX \setminus U \subseteq V_1 \cup \cdots \cup V_k, or equivalently: {V1,…,Vk}\{V_1, \ldots, V_k\} covers Xβˆ–UX \setminus U.

Step 3: Subbasis elements in M\mathcal{M}. We claim that M∩S\mathcal{M} \cap \mathcal{S} does not cover XX.

Suppose M∩S\mathcal{M} \cap \mathcal{S} covers XX. Every V∈MV \in \mathcal{M} is a union of finite intersections of elements of S\mathcal{S}: V=⋃γ(SΞ³,1βˆ©β‹―βˆ©SΞ³,nΞ³)V = \bigcup_\gamma (S_{\gamma,1} \cap \cdots \cap S_{\gamma,n_\gamma}).

Since M\mathcal{M} covers XX, for each x∈Xx \in X, there exists V∈MV \in \mathcal{M} with x∈Vx \in V, hence x∈SΞ³,1βˆ©β‹―βˆ©SΞ³,nΞ³x \in S_{\gamma,1} \cap \cdots \cap S_{\gamma, n_\gamma} for some Ξ³\gamma. So the sets SΞ³,iS_{\gamma, i} that appear cover XX.

Now, pick any S∈SS \in \mathcal{S} that appears in the decomposition of some V∈MV \in \mathcal{M}. If Sβˆ‰MS \notin \mathcal{M}, then by Step 2, there exist V1,…,Vk∈MV_1, \ldots, V_k \in \mathcal{M} covering Xβˆ–SX \setminus S. But SS was needed with other subbasis elements to compose VV; we can replace SS with {V1,…,Vk}\{V_1, \ldots, V_k\}. Iterating this process (finitely many times for each intersection), we eventually express XX as a finite subcover of M\mathcal{M}, contradicting M∈Σ\mathcal{M} \in \Sigma.

More precisely: take any V∈MV \in \mathcal{M} and x∈Vx \in V. Then x∈S1βˆ©β‹―βˆ©SmβŠ†Vx \in S_1 \cap \cdots \cap S_m \subseteq V for some S1,…,Sm∈SS_1, \ldots, S_m \in \mathcal{S}. If all Si∈MS_i \in \mathcal{M}, we are fine. If some Sjβˆ‰MS_j \notin \mathcal{M}, by Step 2, finitely many W1,…,Wβ„“βˆˆMW_1, \ldots, W_\ell \in \mathcal{M} cover Xβˆ–SjX \setminus S_j. Then X=SjβˆͺW1βˆͺβ‹―βˆͺWβ„“βŠ‡Sjβˆͺ(Xβˆ–Sj)=XX = S_j \cup W_1 \cup \cdots \cup W_\ell \supseteq S_j \cup (X \setminus S_j) = X. But then... we need SjS_j to be covered, which it is (by elements of M\mathcal{M}). This gives a finite subcover of M\mathcal{M}, contradiction.

Therefore M∩S\mathcal{M} \cap \mathcal{S} does not cover XX, and the subbasis cover Sβ€²βŠ†S\mathcal{S}' \subseteq \mathcal{S} formed by taking all subbasis elements that participate in M\mathcal{M} fails to cover. Since M\mathcal{M} does cover XX, some element of M\mathcal{M} is not a subbasis element. The subbasis elements alone from M\mathcal{M} do not suffice to cover, confirming our contrapositive.

β– 

Application to Tychonoff's Theorem

Theorem8.12Tychonoff via Alexander

If {Xα}α∈A\{X_\alpha\}_{\alpha \in A} are compact spaces, then ∏αXα\prod_\alpha X_\alpha is compact.

Proof

The product topology on P=∏αXΞ±P = \prod_\alpha X_\alpha has subbasis S={Ο€Ξ±βˆ’1(UΞ±):α∈A,UΞ±Β openΒ inΒ XΞ±}\mathcal{S} = \{\pi_\alpha^{-1}(U_\alpha) : \alpha \in A, U_\alpha \text{ open in } X_\alpha\}. By the Alexander subbasis theorem, it suffices to show every cover of PP by subbasis elements has a finite subcover.

Let {παiβˆ’1(Ui)}i∈I\{\pi_{\alpha_i}^{-1}(U_i)\}_{i \in I} be a cover of PP by subbasis elements. For each Ξ±\alpha, let UΞ±={Ui:Ξ±i=Ξ±}\mathcal{U}_\alpha = \{U_i : \alpha_i = \alpha\}. If UΞ±\mathcal{U}_\alpha covers XΞ±X_\alpha for some Ξ±\alpha, then by compactness of XΞ±X_\alpha, finitely many suffice, giving a finite subcover of PP.

If no UΞ±\mathcal{U}_\alpha covers XΞ±X_\alpha, then for each Ξ±\alpha, there exists xα∈XΞ±βˆ–β‹ƒUΞ±x_\alpha \in X_\alpha \setminus \bigcup \mathcal{U}_\alpha. Then the point (xΞ±)∈P(x_\alpha) \in P is not in any Ο€Ξ±βˆ’1(Ui)\pi_\alpha^{-1}(U_i) (since xΞ±iβˆ‰Uix_{\alpha_i} \notin U_i for each ii). But {παiβˆ’1(Ui)}\{\pi_{\alpha_i}^{-1}(U_i)\} is supposed to cover PP. Contradiction.

(Note: the step "for each Ξ±\alpha, there exists xΞ±x_\alpha" uses the axiom of choice.)

β– 
RemarkHistorical Note

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 xΞ±βˆ‰β‹ƒUΞ±x_\alpha \notin \bigcup \mathcal{U}_\alpha for each Ξ±\alpha simultaneously).

ExampleCompactness of $\{0, 1\}^I$

The product {0,1}I\{0, 1\}^I (each factor with the discrete topology) is compact for any index set II, by Tychonoff's theorem. This product is homeomorphic to the Cantor set when I=NI = \mathbb{N}, and gives the Cantor cube for uncountable II.

Using the Alexander subbasis theorem directly: a subbasis cover consists of sets Ο€Ξ±βˆ’1({0})\pi_\alpha^{-1}(\{0\}) and Ο€Ξ±βˆ’1({1})\pi_\alpha^{-1}(\{1\}). If they cover, either the sets Ο€Ξ±βˆ’1({0})\pi_\alpha^{-1}(\{0\}) alone cover (impossible unless every coordinate is forced to be 00) or finitely many from each type cover. The argument shows a finite subcover always exists.