Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

[F1]

Let (X,d) be a metric space (def-metric-space) and let Td be its metric topology (def-metric-topology). Call Td completely metrizable if some metric ρ on X is topologically equivalent to d, that is Tρ=Td (def-equivalent-metrics), and makes (X,ρ) complete (def-complete-metric-space). Then: 1. Homeomorphism invariance. Let (Y,e) be a metric space and let h:X→Y be a bijection (def-injection-surjection-bijection) such that h and h−1 are continuous (def-metric-continuity). If Td is completely metrizable then so is Te. 2. Closed subspaces. If Td is completely metrizable and A⊆X is closed in (X,d), then TdA is completely metrizable, dA being the subspace metric (def-isometry-and-metric-embedding). 3. The property is strictly weaker than completeness. Let P:=(0,∞)⊆R (def-interval) carry d(x,y):=∣x−y∣ (lem-real-line-is-a-metric-space). Then (P,d) is not complete, while ρP(x,y)  :=  ∣x−y∣  +  ∣1x−1y∣ is a complete metric on P with TρP=Td. So Td is completely metrizable although no completeness assumption holds for d 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 (0,∞) has it without being complete).

[F2]

Assume the Axiom of Dependent Choice (DC). If a nonempty metric space X 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 X is dense. (Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior).

[F3]

A topological space (X,T) (def-topological-space) is a Baire space when for every sequence (Un)n∈N of subsets of X that are open and dense in X (def-dense-top, def-sequence-convergence-top, def-natural-numbers), the intersection ⋂n∈NUn is dense in X. (Baire space: a topological space in which every countable intersection of dense open subsets is dense).

Proof

technique · direct
1.1givenF1F2

Choose a compatible complete metric using the definition already established by complete remetrisation.

2.1step 1.1F1F2F3

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 (0,1) 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.

3.1step 2.1∎

The preceding construction and implications establish the assertion.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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