How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Alexander's subbase lemma: if every cover by members of a fixed subbasis has a finite subcover then the space is compact; the proof is an application of Zorn's lemma
Statement
Assume the Axiom of Choice (The Axiom of Choice), in the form of Zorn's lemma (Zorn's lemma), the two being equivalent over ZF (The Axiom of Choice and Zorn's lemma are equivalent).
Let be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let be a subbasis for (Basis and subbasis for a topology, and the topology generated by a family of sets). Suppose that
every family with has a finite subfamily whose union is .
Then is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
The converse is immediate and is not the content: a compact space has a finite subcover for every open cover, subbasic or not. What the lemma says is that the subbasic covers alone already decide compactness, and that is what makes it usable — a product topology is presented by a subbasis, and the subbasic covers of a product are far easier to handle than its arbitrary open covers.
Facts & Assumptions
Given: A topological space , a subbasis for , and the Axiom of Choice.
Every family with has a finite subfamily whose union is .
A space is compact exactly when every family of open sets with union the space has a finite subfamily with union the space, a family being finite when it is empty or listable as for some ; the empty space is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
Inclusion is a partial order on any family of sets, and a chain in it is a subfamily any two of whose members are comparable under inclusion (Partial order and partially ordered set, Chain in a poset).
Of finitely many pairwise comparable sets one contains all the others: for pairwise comparable, induction on gives such a member, the successor step comparing the member found for with (Chain in a poset, The principle of mathematical induction).
A function with domain a natural number all of whose values are nonempty sets has a choice function, and this is a theorem of ZF (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).
An upper bound of a subset of a poset is an element above all of its members (Upper bound, least upper bound, and strict upper bound); a maximal element is one with nothing strictly above it (Maximal element and greatest element).
Zorn's lemma: a nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma).
The intersections of finitely many members of form a basis for , the intersection of none being ; and for a basis , every open and every admit with (A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis, claim 2; Basis and subbasis for a topology, and the topology generated by a family of sets).
Proof
Suppose is not compact. Then , the empty space being compact by [L1], and the family of those open covers of that have no finite subcover is a nonempty subfamily of the power set of , partially ordered by inclusion.
Every chain has an upper bound in . For any member of is an upper bound, and is nonempty by step 1.1. For take , a family of open sets whose union is because the union of any one member of already is; were to have a finite subcover , then for each the set of members of containing is nonempty, [L4] would supply with , and [L3] would put all of them inside one , which would then have the finite subcover and could not lie in . So , and it contains every member of .
By [L6] the poset has a maximal element : an open cover of with no finite subcover such that the only member of containing it is itself.
For every open there is a finite with . Indeed is an open cover strictly containing , so by maximality it is not in and has a finite subcover; that subcover must contain , since otherwise it would be a finite subcover of itself, and the members other than form the required finite .
Let . Since covers there is with , and by [L7] there are and with ; the remaining alternative of [L7], that no member of is taken and the basic set is itself, would give and so make a finite subcover of , which step 3.1 forbids.
Some lies in . For if none did, then by step 4.1 the set of finite with is nonempty for each , so [L4] supplies ; every either lies in or fails to lie in some and then lies in , so , exhibiting a finite subfamily of with union — a union of finitely many listable families being listed by concatenation — which step 3.1 forbids.
Hence covers : every lies in some of step 4.2 that belongs to by step 5.1, and .
By [A1] the cover of by members of has a finite subfamily with union ; that subfamily is a finite subfamily of with union , contradicting the choice of at step 3.1. So the supposition of step 1.1 is untenable and is compact.
Remarks
Where the Axiom of Choice is spent. Exactly once, at step 3.1, through Zorn's lemma. The finite selections at steps 2.1 and 5.1 are instances of Every natural-number-indexed list of nonempty sets has a choice function on its family of values and cost nothing. That single use is inherited by Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice, which is proved from this lemma, and it cannot be avoided there: Tychonoff's theorem implies the Axiom of Choice.
Why maximality is the right tool. A cover with no finite subcover that cannot be enlarged is very close to being a filter of complements, and step 4.1 is what that closeness amounts to: any open set outside already finishes the job when finitely many members of are added. Step 5.1 then says a basic set of cannot have all of its subbasic factors outside , which is the only place the subbasis hypothesis is used.
The hypothesis is about one fixed subbasis. A space may have many subbases, and the lemma is applied with whichever one presents the topology most conveniently. For a product that is the family of preimages of open sets under the projections (The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space), and it is exactly the fact that a subbasic cover of a product moves one coordinate at a time that makes Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice a short argument.
Depends on
- Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right
- Basis and subbasis for a topology, and the topology generated by a family of sets
- A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis
- Zorn's lemma
- The Axiom of Choice and Zorn's lemma are equivalent
- The Axiom of Choice
- Chain in a poset
- Maximal element and greatest element
- Partial order and partially ordered set
- Upper bound, least upper bound, and strict upper bound
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
- The principle of mathematical induction
Used by
- Assuming the Axiom of Choice, compactness of [0,1] derived from the subbase lemma alone, using only the rays as a subbasis and the least upper bound property Example
- The quasicompact convention, why compactness of a subset is read intrinsically here, and what each result on this page costs in choice Remark
- Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 54 results over 16 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Alexander subbase theorem (Wikipedia) (standard reference, not scraped)
- Zorn's lemma (Wikipedia) (standard reference, not scraped)
- Compact space (Wikipedia) (standard reference, not scraped)
- Stacks Project, Lemma 5.12.15: Alexander subbase theorem (standard reference, not scraped)