Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 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.

FALSE: every Baire space is completely metrizable

Statement

Assume the Axiom of Choice, which yields the Dependent Choice and Countable Choice instances used below. The false claim is: every Baire space is completely metrizable.

Facts & Assumptions

Given: The objects, hypotheses, and choice principles stated above.

[F1]

Assume the Axiom of Dependent Choice (def-dependent-choice). Let (X,T) be a locally compact Hausdorff space (def-locally-compact-space, def-hausdorff-space, def-topological-space). Then X is a Baire space (def-baire-space): for every sequence (Un)n∈N of dense open subsets of X (def-dense-top, def-sequence-convergence-top), the intersection ⋂n∈NUn is dense in X. Dependent choice is sufficient here and no claim of necessity is made. The several statements that go by the name "Baire category theorem" have different choice-theoretic statuses over ZF. The compact Hausdorff version is equivalent to dependent multiple choice; DC implies DMC in ZF, the reversal remains open in ZF, and DMC does not imply DC in ZFA. That account is rem-baire-category-choice-strength, which this library states and does not prove. Nothing below asserts that dependent choice is needed for the statement above. (Assuming dependent choice, every locally compact Hausdorff space is a Baire space).

[F2]

Assume the Axiom of Choice (def-axiom-of-choice). Let I be a set and let (Xi,Ti)i∈I be a family of compact topological spaces (def-compact-space, def-topological-space). Then the product P  :=  ∏i∈IXi with the product topology (def-product-topology) is compact. The Axiom of Choice is spent twice, and both uses are flagged below. Once inside thm-alexander-subbase-lemma, through Zorn's lemma (thm-zorn), and once directly at step 2.1, to produce a point of a product of nonempty sets. (Tychonoff's theorem: an arbitrary product of compact spaces is compact in the product topology, assuming the Axiom of Choice).

[F3]

A topological space (X,T) (def-topological-space) is first countable if every point of X has an at most countable neighbourhood base: for each x∈X there is a family Bx⊆N(x) that is at most countable (def-countable, def-equinumerous) and such that every neighbourhood of x contains a member of Bx (def-neighbourhood-top). (First countable space: a countable neighbourhood base at every point).

[F4]

Assume the Axiom of Countable Choice. Let (An)n∈N be a family of at most countable sets indexed by N. Then U=⋃n∈NAn is at most countable (Countable unions of at most countable sets, assuming ACω).

[F5]

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).

Refutation

technique · direct
1.1givenF4F1F5

Refute the claim with the Cantor cube {0,1}R.

2.1step 1.1F1F4F3F2

It is compact Hausdorff and therefore Baire under Dependent Choice, but a countable local base at a point mentions only countably many finite coordinate sets; changing an unmentioned coordinate contradicts that it is a base.

3.1step 2.1F5F3F4

Hence it is not first countable, not metrizable, and not completely metrizable.

4.1step 3.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

57 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