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.
, with its usual subspace topology from , 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).
Assume Dependent Choice. Every Čech-complete space is a Baire space. (Under Dependent Choice, every Čech-complete space is Baire).
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).
Write for the image of in under the canonical embedding (lem-rat-embeds-dense), the set usually written once the identification is made, and put for the irrationals. Then: 1. is an set (def-f-sigma-g-delta) and is meager (def-nowhere-dense-meager); 2. is a set and is residual; 3. is not a set, and is not an 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 and are interchanged by complementation while and are, so any such argument would prove the same thing about both sets and about neither. ( is , meager and not , while the irrationals are , residual and not ).
Refutation
The rational line is metrizable but not Baire.
Since every Čech-complete space is Baire under the same stated Dependent Choice assumption, the rationals cannot be Čech-complete.
Equivalently, Alexandrov and the published non- result exclude complete metrizability.
The preceding construction and implications establish the assertion.
Depends on
- FALSE: the rational numbers form a Baire space
- Under Dependent Choice, every Čech-complete space is Baire
- Under the ultrafilter lemma and the Axiom of Choice, a metrizable space is Čech-complete exactly when it is completely metrizable
- $\mathbb{Q}$ is $F_\sigma$, meager and not $G_\delta$, while the irrationals are $G_\delta$, residual and not $F_\sigma$
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
- 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)