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.
A ZFC L-space
Statement
ZFC proves that is a zero-dimensional regular Hausdorff, hereditarily Lindelöf, nonseparable space. In particular it is an L-space.
Facts & Assumptions
Given: ZFC and the fixed Moore minimal-walk construction.
Moore's clopen-generated topology makes every Moore space zero-dimensional regular Hausdorff.
Moore's topology is hereditarily Lindelof proves hereditary Lindelöfness for every .
Every uncountable Moore subspace is nonseparable proves nonseparability whenever is uncountable.
L-spaces, S-spaces, and strong S-spaces defines an L-space as regular Hausdorff, hereditarily Lindelöf, and not hereditarily separable.
Proof
Take . By [F1] its Moore topology is zero-dimensional, regular, and Hausdorff; by [F2] it is hereditarily Lindelöf.
The set is uncountable, so [F3] says the whole space is nonseparable. A hereditarily separable space must itself be separable, since the whole underlying set is one of its subspaces. Thus this space is not hereditarily separable.
The four conclusions in steps 1.1 and 2.1 meet [F4] exactly, proving that is an L-space. No new choice is made in this assembly; every choice-dependent construction or thinning belongs to the corresponding supplier under its own stated hypotheses. The empty and singleton cases of the topology are irrelevant to the witness because is uncountable.
Depends on
Used by
Dependency tree · two levels
12 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, Theorem 1.3 and Section 7, printed pp. 2 and 21–24 (standard reference, not scraped)