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, every completely metrizable subspace of a metric space is
Statement
Assume Dependent Choice. If is a completely metrizable subspace of a metric space , then is a subset of .
Facts & Assumptions
Given: The objects, hypotheses, and choice principles stated above.
Complete metrizability means that has a complete metric inducing its given subspace topology. (Complete metrizability: admitting a topologically equivalent complete metric is preserved by homeomorphism and by closed subspaces, and has it without being complete)
A set is a countable intersection of open sets. ( and subsets of a topological space, agreeing with the real-line notion)
Dependent Choice gives a sequence of successive extensions whenever every finite admissible history has an extension. Apply its entire-relation form to the set of those histories, beginning with the empty history. (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain)
A metric space is Hausdorff. (Distinct points of a metric space have disjoint balls around them)
For each real there is an integer with . (For every in a complete ordered field there is a natural with )
Proof
The empty subspace is the constant countable intersection of the ambient open set .
Let be a compatible complete metric on the nonempty subspace and let be the ambient metric. For call an ambient open -small when , , and . Both conditions are imposed, and neither may be dropped: -smallness alone controls distances measured in but says nothing about ambient distances, so it cannot force a point of to be near a prescribed ambient point, while ambient smallness alone gives no -control and so cannot invoke completeness of . Every lies in some -small , because induces the subspace topology, so a -ball of radius below about contains for some , and may be shrunk below . Let be the union of all -small ambient open sets, an ambient open set containing .
Every lies in . [step 2.1, F5] Indeed, given , choose with . There is an -small open containing , and some . Then . Thus every ambient ball about meets . This uses only finitely many choices for each fixed , not a selected sequence.
Let . For each pick an -small with and put , an ambient open neighbourhood of with , so and ; the decrease. Then pick , which is nonempty because and is an ambient neighbourhood of . The selection over is a recursion whose th admissible set depends on the previous choices, so it is licensed by the Dependent Choice of [F3]. Since and , the points converge to in . For both and lie in , so and the sequence is -Cauchy; completeness of gives it a -limit in .
Let be the -limit from step 3.2. [step 3.2, F4, F1] The compatible topologies make converge to in the subspace -metric, hence in . It also converges to . If , disjoint open neighbourhoods from [F4] would both contain every sufficiently late , a contradiction. Hence .
Therefore . [step 2.1, step 3.1, step 4.1, F2] Reindexing by gives a sequence indexed from zero as in [F2], so is in . The only countable selection is the stated DC use in step 3.2; the empty case was handled in step 1.1. ∎
Depends on
- Complete metrizability: admitting a topologically equivalent complete metric is preserved by homeomorphism and by closed subspaces, and $(0,\infty)$ has it without being complete
- $G_\delta$ and $F_\sigma$ subsets of a topological space, agreeing with the real-line notion
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Distinct points of a metric space have disjoint balls around them
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
Used by
Dependency tree · two levels
50 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)