Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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 Xω1, the space (X,τ[X]) is hereditarily Lindelöf.

Facts & Assumptions

Given: Xω1 and the Moore topology.

[F1]

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.

[F2]

Moore's clopen-generated topology gives a clopen base of finite Boolean conditions in the sets Wξ.

[F3]

Under choice, the uncountable Δ-system lemma for finite sets thins an uncountable family of finite supports to an uncountable Δ-system.

[F4]

The Moore colouring realizes finite binary patterns realizes any functional binary pattern on pairwise-disjoint fixed finite families.

[F5]

The Axiom of Choice supplies the transfinite cover selections and uncountable thinning.

Proof

technique · contradiction
1.1

Suppose some subspace ZX has an open cover U with no countable subcover. Recursively for α<ω1, after choosing UξU for ξ<α, choose xαZξ<αUξ and then UαU containing xα. 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 xα above all earlier xξ. Thus xα is strictly increasing and Uα contains no xβ for β>α.

F1F5givenassume-contra
2.1

By [F2], shrink each Uα around xα to a finite Boolean basic set Vα in the subspace Z. Intersect also with Wxα, so its finite support FαX contains xα. Apply [F3] and the finite pigeonhole principle to retain an uncountable index set on which the supports form a Δ-system with root F, have fixed root and petal positions and one fixed membership-bit string, and have nonempty petals of one size k. Pass to a tail so every root member is below every retained xα.

F2F3F5step 1.1
3.1

Let A={FαF:α retained} and B={{xβ}:β retained}. The family A is uncountable and pairwise disjoint by the Δ-system property; B 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 Vα. By [F4], choose a petal FαF and a singleton {xβ} with the petal below xβ realizing all those bits.

F4step 2.1
4.1

Since xα belongs to its petal, the inequality from step 3.1 gives xα<xβ, and strict increase gives α<β. The realized petal bits say that xβ meets every petal condition defining Vα. For a root coordinate η, the point xβ meets its required bit because xβVβ, the root bit string is uniform, and η<xβ lets [F2] read membership through c(η,xβ). Consequently xβVαUα.

F2step 1.1step 2.1step 3.1
5.1

Step 1.1 says that Uα contains no xβ with β>α, contradicting step 4.1. Therefore every subspace Z is Lindelöf, which is precisely hereditary Lindelöfness by [F1]. Empty and countable Z 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.

F1F5step 1.1step 4.1discharge-contradiction

Depends on

Used by

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