Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 metrizable space is Čech-complete

Statement

Assume the ultrafilter lemma and the Axiom of Choice, the hypotheses carried by the equivalence of [F3] that the refutation uses. The false claim is: every metrizable space is Čech-complete.

Facts & Assumptions

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

[F1]

Q, with its usual subspace topology from R, is not a Baire space. The cited item is a false-statement item: the sentence displayed under its Statement heading is the claim it refutes, and what it establishes is that negation (FALSE: the rational numbers form a Baire space).

[F2]

Assume Dependent Choice. Every Čech-complete space is a Baire space. (Under Dependent Choice, every Čech-complete space is Baire).

[F3]

Assume the ultrafilter lemma and the Axiom of Choice. A metrizable space is Čech-complete if and only if it is completely metrizable. (Under the ultrafilter lemma and the Axiom of Choice, a metrizable space is Čech-complete exactly when it is completely metrizable).

[F4]

Write QR for the image of Q in R under the canonical embedding qq^ (lem-rat-embeds-dense), the set usually written Q once the identification is made, and put X:=RQR for the irrationals. Then: 1. QR is an Fσ set (def-f-sigma-g-delta) and is meager (def-nowhere-dense-meager); 2. X is a Gδ set and is residual; 3. QR is not a Gδ set, and X is not an Fσ set. Claims 1 and 2 are bookkeeping. Claim 3 is the substance and is exactly where thm-baire-category-r is spent: no argument from the algebra of open and closed sets alone can reach it, since QR and X are interchanged by complementation while Fσ and Gδ are, so any such argument would prove the same thing about both sets and about neither. (Q is Fσ, meager and not Gδ, while the irrationals are Gδ, residual and not Fσ).

Refutation

technique · direct
1.1

The rational line is metrizable but not Baire.

givenF3F1F2
2.1

Since every Čech-complete space is Baire under the same stated Dependent Choice assumption, the rationals cannot be Čech-complete.

step 1.1F2F1F4
3.1

Equivalently, Alexandrov and the published non-Gδ result exclude complete metrizability.

step 2.1F4F2F3
4.1

The preceding construction and implications establish the assertion.

step 3.1

Depends on

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: 148 results over 22 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