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.
Under the Axiom of Countable Choice, countable products and subspaces of Polish spaces are Polish
Statement
Assume the Axiom of Countable Choice. A countable product of Polish spaces is Polish, and every subspace of a Polish space is Polish.
Facts & Assumptions
Given: The objects, hypotheses, and choice principles stated above.
Assume the Axiom of Countable Choice. Every countable product of completely metrizable spaces is completely metrizable, including the empty product. (Under countable choice, a countable product of completely metrizable spaces is completely metrizable).
Assuming , a countable product of second countable spaces is second countable. (Assuming countable choice, a countable product of second countable spaces is second countable).
Assume the Axiom of Countable Choice. A subspace of a Polish space is Polish if and only if it is a subset. (Under Dependent Choice, a subspace of a Polish space is Polish exactly when it is ).
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. (For completely metrizable spaces, the separable and second-countable definitions of Polish space agree under countable choice).
Proof
Use the product theorem for complete metrizability and the published theorem that countable products of second-countable spaces are second countable.
For a subspace apply the Polish-subspace characterisation.
The preceding construction and implications establish the assertion.
Depends on
- Under countable choice, a countable product of completely metrizable spaces is completely metrizable
- Assuming countable choice, a countable product of second countable spaces is second countable
- Under Dependent Choice, a subspace of a Polish space is Polish exactly when it is $G_\delta$
- For completely metrizable spaces, the separable and second-countable definitions of Polish space agree under countable choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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)