Alexander subbase theorem
Let
Proof
The forward direction is trivially proven. For the converse, suppose towards contradiction that
is not compact but every subbasic open cover from π has a finite subcover. Let S denote the set of all open covers of π lacking a finite subcover partially ordered by inclusion. By Zornβs lemma, π has a maximal element π , which itself is an open cover of C admitting no finite subcover, By maximality, if π is an open set such that π then π β C has a finite subcover C βͺ { π } for some finite { π } βͺ C π . C π β C Now clearly
does not cover C β© S , for if it did it would have a finite subcover. Thus there exists some π not covered by π₯ β π . But since C β© S does cover C , there exists some π with π β C . Since π₯ β π is a subbasis, there must exist some finite collection S of subbasic open sets such that { π π } π π = 1 β S . Now π₯ β β π π = 1 π π β π , for otherwise { π π } π π = 1 β C would cover C β© S . Defining π₯ as above and C π π , it follows Λ C = β π π = 1 C π π is a finite subcover of { π π } βͺ Λ C for any { π π } βͺ C . Let π β β π and π = β Λ C . Now for any π = π β π , π΄ β π covers { π΄ } βͺ Λ C iff π , whence π β π΄ for each π β π π and thus π β β π , implying π β β π π = 1 π π β π β C is a finite subcover of { π } βͺ Λ C , contradicting C . Therefore C β π must be compact. π
This proof requires Zornβs lemma, and therefore depends on the Axiom of Choice, however it may be formulated to only require the weaker Ultrafilter lemma which is equivalent to the Boolean prime ideal theorem.