Alexander's subbase lemma

In mathematics, specifically topology, Alexander's subbase lemma states that for a topological space to be a compact, it is necessary and sufficient that each open cover of the space consisting of sets in a (fixed) subbase has a finite subcover. Precisely,

given a topological space X and a subbase S for it, a subset K⊂X is compact if and only if for each cover of K consisting of sets in S, there exists a finite subcover of it.

The lemma, also often called Alexander's subbase theorem, is due to James Waddell Alexander II. The lemma is typically used to prove Tychonoff's theorem.

Proof

If K is compact, the existence of a finite cover holds by definition. So, we shall show the converse and without loss of generality, replace X by K.

Suppose for the sake of contradiction that the space X is not compact (so X is an infinite set), yet every subbasic cover from 𝒮 has a finite subcover. Let 𝕊 denote the set of all open covers of X that do not have any finite subcover of X. Partially order 𝕊 by subset inclusion and use Zorn's Lemma to find an element 𝒞∈𝕊 that is a maximal element of 𝕊. Observe that:

  1. Since 𝒞∈𝕊, by definition of 𝕊, 𝒞 is an open cover of X and there does not exist any finite subset of 𝒞 that covers X (so in particular, 𝒞 is infinite).
  2. The maximality of 𝒞 in 𝕊 implies that if V is an open set of X such that V∉𝒞 then 𝒞∪{V} has a finite subcover, which must necessarily be of the form {V}∪𝒞V for some finite subset 𝒞V of 𝒞 (this finite subset depends on the choice of V).

We will begin by showing that 𝒞∩𝒮 is not a cover of X. Suppose that 𝒞∩𝒮 was a cover of X, which in particular implies that 𝒞∩𝒮 is a cover of X by elements of 𝒮. The theorem's hypothesis on 𝒮 implies that there exists a finite subset of 𝒞∩𝒮 that covers X, which would simultaneously also be a finite subcover of X by elements of 𝒞 (since 𝒞∩𝒮⊆𝒞). But this contradicts 𝒞∈𝕊, which proves that 𝒞∩𝒮 does not cover X.

Since 𝒞∩𝒮 does not cover X, there exists some x∈X that is not covered by 𝒞∩𝒮 (that is, x is not contained in any element of 𝒞∩𝒮). But since 𝒞 does cover X, there also exists some U∈𝒞 such that x∈U. It follows that U≠X, because otherwise it would imply 𝒞 has a finite subcover of X, namely the subcover {U}={X}, contradicting 𝒞∈𝕊. Since U≠X, and 𝒮 is a subbasis generating X's topology (together with X), from the definition of the topology generated by 𝒮, there must exist a finite collection of subbasic open sets S1,…,Sn∈𝒮 with n≥1 such that x∈S1∩⋯∩Sn⊆U.

We will now show by contradiction that Si∉𝒞 for every i=1,…,n. If i was such that Si∈𝒞, then also Si∈𝒞∩𝒮 so the fact that x∈Si would then imply that x is covered by 𝒞∩𝒮, which contradicts how x was chosen (recall that x was chosen specifically so that it was not covered by 𝒞∩𝒮).

As mentioned earlier, the maximality of 𝒞 in 𝕊 implies that for every i=1,…,n, there exists a finite subset 𝒞Si of 𝒞 such that{Si}∪𝒞Si forms a finite cover of X. Define 𝒞F:=𝒞S1∪⋯∪𝒞Sn, which is a finite subset of 𝒞. Observe that for every i=1,…,n, {Si}∪𝒞F is a finite cover of X so let us replace every 𝒞Si with 𝒞F.

Let ∪𝒞F denote the union of all sets in 𝒞F (which is an open subset of X) and let Z denote the complement of ∪𝒞F in X. Observe that for any subset A⊆X, {A}∪𝒞F covers X if and only if Z⊆A. In particular, for every i=1,…,n, the fact that {Si}∪𝒞F covers X implies that Z⊆Si. Since i was arbitrary, we have Z⊆S1∩⋯∩Sn. Recalling that S1∩⋯∩Sn⊆U, we thus have Z⊆U, which is equivalent to {U}∪𝒞F being a cover of X. Moreover, {U}∪𝒞F is a finite cover of X with {U}∪𝒞F⊆𝒞. Thus 𝒞 has a finite subcover of X, which contradicts the fact that 𝒞∈𝕊. Therefore, the original assumption that X is not compact must be wrong, which proves that X is compact. ◼

Although this proof makes use of Zorn's Lemma, the proof does not need the full strength of choice. Instead, it relies on the intermediate Ultrafilter principle.

Application

Tychonoff's theorem, which states that the product of non-empty compact spaces is compact, has a short proof using the lemma.

The product topology on ∏iXi has, by definition, a subbase consisting of cylinder sets that are the inverse projections of an open set in one factor. Given a subbasic family C of the product that does not have a finite subset which covers X (we do not require C is a cover of X), we can partition C=∪iCi into subfamilies that consist of exactly those cylinder sets corresponding to a given factor space. By assumption, Ci does not have a finite cover of X. Being cylinder sets, this means their projections onto Xi have no finite cover of Xi. Since each Xi is compact, these projections do not cover Xi. Find a point xi∈Xi not contained in any of the projections of Ci onto Xi. Repeating this for all Ci yields a point (xi)i∈∏iXi which is not covered by C. ◼

Note, that in the last step we implicitly used the axiom of choice (which is actually equivalent to Zorn's lemma) to ensure the existence of (xi)i.