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 space is Baire
Statement
Assume Dependent Choice. Every completely metrizable space is a Baire space.
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).
Assume the Axiom of Dependent Choice (). If a nonempty metric space is complete, then it is not the union of a sequence of closed sets each having empty interior. Equivalently, the intersection of countably many open dense subsets of is dense. (Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior).
A topological space (def-topological-space) is a Baire space when for every sequence of subsets of that are open and dense in (def-dense-top, def-sequence-convergence-top, def-natural-numbers), the intersection is dense in . (Baire space: a topological space in which every countable intersection of dense open subsets is dense).
Proof
Choose a compatible complete metric using the definition already established by complete remetrisation.
Apply the published complete-metric Baire category theorem [F2] to the whole space with the compatible complete metric of step 1.1, not to its open subspaces: restricting a complete metric to an open subspace need not leave it complete, as with the restricted Euclidean metric shows. [F2] already concludes that a countable intersection of dense open subsets of the whole space is dense, which is the Baire property; translate that conclusion back to the topology. The empty space is Baire vacuously.
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
- Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior
- Baire space: a topological space in which every countable intersection of dense open subsets is dense
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 85 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)