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.
Under Dependent Choice, a subspace of a Polish space is Polish exactly when it is
Statement
Assume Dependent Choice, which yields the instances of Countable Choice used below. A subspace of a Polish space is Polish if and only if it is a subset.
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).
Assume Dependent Choice. For a subspace of a complete metric space , is completely metrizable if and only if is a subset of . (Alexandrov's theorem, under Dependent Choice: a subspace of a complete metric space is completely metrizable exactly when it is ).
Every subspace of a second countable space is second countable. (Second countability is hereditary).
Assuming , every second countable space is separable. (Assuming countable choice, every second countable space is separable).
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
Alexandrov gives the complete-metrizability equivalence.
A subspace of a second-countable space is second countable, hence separable under the stated choice hypothesis, while every subspace already inherits metrizability.
Combine these facts in both directions.
The preceding construction and implications establish the assertion.
Depends on
- Polish spaces are separable completely metrizable spaces
- Alexandrov's theorem, under Dependent Choice: a subspace of a complete metric space is completely metrizable exactly when it is $G_\delta$
- Second countability is hereditary
- Assuming countable choice, every second countable space is separable
- For completely metrizable spaces, the separable and second-countable definitions of Polish space agree under countable choice
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 61 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click 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)