Alexander's subbase lemma

From testwiki
Jump to navigation Jump to search

Template:Short description 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,[1][2]Template:Sfn

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 Template:Em 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.[2]

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 Template:Em 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 Template:Em 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.

References

Template:Reflist

Further reading