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.
Let be a metric space (def-metric-space) and let be its metric topology (def-metric-topology). Call completely metrizable if some metric on is topologically equivalent to , that is (def-equivalent-metrics), and makes complete (def-complete-metric-space). Then: 1. Homeomorphism invariance. Let be a metric space and let be a bijection (def-injection-surjection-bijection) such that and are continuous (def-metric-continuity). If is completely metrizable then so is . 2. Closed subspaces. If is completely metrizable and is closed in , then is completely metrizable, being the subspace metric (def-isometry-and-metric-embedding). 3. The property is strictly weaker than completeness. Let (def-interval) carry (lem-real-line-is-a-metric-space). Then is not complete, while is a complete metric on with . So is completely metrizable although no completeness assumption holds for itself. Complete metrizability is a condition on the collection of open sets alone: the metric is quantified over and does not survive into the statement. That is exactly what completeness fails to be, and claim 3 shows the two conditions are genuinely different rather than merely stated differently. (Complete metrizability: admitting a topologically equivalent complete metric is preserved by homeomorphism and by closed subspaces, and has it without being complete).
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).
Let be a set and let be a binary relation on . Call entire on when The Axiom of Dependent Choice, written , is the following statement. The statement is: for every nonempty set , every relation entire on , and every , there is a sequence with and for every . (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
Let be a metric space (def-metric-space) and let with . Put . Then and Both sets are open (thm-metric-open-set-algebra) and contain respectively (def-metric-ball), so every metric space is Hausdorff: distinct points are separated by disjoint open sets (def-metric-topology). (Distinct points of a metric space have disjoint balls around them).
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 .
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 .
Hausdorff uniqueness puts the point back in the subspace.
The preceding construction and implications establish the assertion.
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
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 107 results over 16 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)