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.
Moore's topology is hereditarily Lindelof
Statement
For every , the space is hereditarily Lindelöf.
Facts & Assumptions
Given: and the Moore topology.
Countably compact, Lindel"of, sequentially compact, limit point compact and -compact spaces, and relatively compact subsets defines Lindelöfness by the existence of an at-most-countable subcover for every open cover, and Hereditary, open-hereditary and closed-hereditary properties of topological spaces defines hereditary Lindelöfness by requiring that property of every subspace.
Moore's clopen-generated topology gives a clopen base of finite Boolean conditions in the sets .
Under choice, the uncountable -system lemma for finite sets thins an uncountable family of finite supports to an uncountable -system.
The Moore colouring realizes finite binary patterns realizes any functional binary pattern on pairwise-disjoint fixed finite families.
The Axiom of Choice supplies the transfinite cover selections and uncountable thinning.
Proof
Suppose some subspace has an open cover with no countable subcover. Recursively for , after choosing for , choose and then containing . The uncovered remainder is uncountable at every stage: if it were countable, one further cover member for each remaining point, together with the previous countable family, would be a countable subcover. Hence choose above all earlier . Thus is strictly increasing and contains no for .
By [F2], shrink each around to a finite Boolean basic set in the subspace . Intersect also with , so its finite support contains . Apply [F3] and the finite pigeonhole principle to retain an uncountable index set on which the supports form a -system with root , have fixed root and petal positions and one fixed membership-bit string, and have nonempty petals of one size . Pass to a tail so every root member is below every retained .
Let and . The family is uncountable and pairwise disjoint by the -system property; is uncountable and pairwise disjoint because the sequence is strictly increasing. Map each petal coordinate to the sole column and prescribe the corresponding fixed membership bit of . By [F4], choose a petal and a singleton with the petal below realizing all those bits.
Since belongs to its petal, the inequality from step 3.1 gives , and strict increase gives . The realized petal bits say that meets every petal condition defining . For a root coordinate , the point meets its required bit because , the root bit string is uniform, and lets [F2] read membership through . Consequently .
Step 1.1 says that contains no with , contradicting step 4.1. Therefore every subspace is Lindelöf, which is precisely hereditary Lindelöfness by [F1]. Empty and countable cause no problem: a countable space has a countable subcover by choosing one cover member per point, and the empty space uses the empty subcover.
Depends on
- The Moore colouring realizes finite binary patterns
- Moore's clopen-generated topology
- Countably compact, Lindel\"of, sequentially compact, limit point compact and $\sigma$-compact spaces, and relatively compact subsets
- Hereditary, open-hereditary and closed-hereditary properties of topological spaces
- Under choice, the uncountable $\Delta$-system lemma for finite sets
- The Axiom of Choice
Used by
- A ZFC L-space Theorem
Dependency tree · two levels
29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Moore, A solution to the L space problem, Section 7, Corollary 7.8, printed p. 24 (standard reference, not scraped)