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 the Axiom of Countable Choice, every subspace of a complete metric space is completely metrizable
Statement
Assume the Axiom of Countable Choice. If is a complete metric space and is in , then the subspace is completely metrizable.
Facts & Assumptions
Given: The objects, hypotheses, and choice principles stated above.
Let be a topological space (def-topological-space) and let . is a set of when there is a sequence of open subsets of with , and an set of when there is a sequence of closed subsets of with . ( and subsets of a topological space, agreeing with the real-line notion).
If is completely metrizable and is open, then is completely metrizable in its subspace topology. (Every open subspace of a completely metrizable space is completely metrizable).
Assume the Axiom of Countable Choice. If is metrizable and is a sequence of completely metrizable subspaces of , then is completely metrizable. (Under the Axiom of Countable Choice, a countable intersection of completely metrizable subspaces is completely metrizable).
Proof
The empty subspace has its unique compatible complete metric.
Otherwise write the subspace as a countable intersection of open subspaces.
Each open subspace is completely metrizable by the reciprocal-distance lemma, and the countable-intersection metric then gives a compatible complete metric on the intersection.
The preceding construction and implications establish the assertion.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 88 results over 17 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)