Alphabeta MathHow 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.
For completely metrizable spaces, the separable and second-countable definitions of Polish space agree under countable choice
Statement
Assume the Axiom of Countable Choice. For a completely metrizable space, separability is equivalent to second countability. Thus either countability convention gives the same notion of Polish space.
Facts & Assumptions
Given: The objects, hypotheses, and choice principles stated above.
A topological space is Polish when it is separable (def-separable-space) and completely metrizable: its topology is induced by some complete metric (lem-complete-remetrisation). No particular compatible complete metric or countable dense subset is part of the structure. (Polish spaces are separable completely metrizable spaces).
Assuming , a metrizable space is second countable iff it is separable iff it is Lindelöf. (Assuming countable choice, a metrizable space is second countable if and only if it is separable if and only if it is Lindelöf).
Proof
A completely metrizable space is metrizable.
Apply the published metrizable-space equivalence between separability and second countability under countable choice, without strengthening the choice claim to ZF.
The preceding construction and implications establish the assertion.
Depends on
Used by
- Under the Axiom of Countable Choice, countable products and G_δ subspaces of Polish spaces are Polish Corollary
- Borel subspaces admit polish presentations Lemma
- C star state GNS construction, purity and Polish pure-state spaces Lemma
- Second-countable locally compact Hausdorff spaces are Polish, and homogeneous quotients are standard Borel Lemma
- Under Dependent Choice, a subspace of a Polish space is Polish exactly when it is G_δ Theorem
Dependency tree · two levels
11 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
- David Marker, Descriptive Set Theory, §§1–2 (standard reference, not scraped)
- Michael Kunzinger, General Topology, §§11.3–11.4 (standard reference, not scraped)
- MFF General Topology course summary, §4.3 (standard reference, not scraped)
- Jesse Peterson, Real Analysis, §§3.6–3.7 (standard reference, not scraped)