Alphabeta Math
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.

✓ 5 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Complete Metrizability, Čech-Completeness, and Baire Category: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

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.

False statementConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-09-26 (gpt-6-sol)Open item page →

FALSE: the rational numbers form a Baire space

Statement

The false claim is: Q, with its usual subspace topology from R, is a Baire space.

Facts & Assumptions

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

[F1]

For a topological space X, the following are equivalent: every countable intersection of dense open sets is dense; every countable union of closed sets with empty interior has empty interior; no nonempty open subset is meagre in X; and every residual subset meets every nonempty open set. The equivalence includes the empty space. (Equivalent forms of the Baire property).

[F2]

Let X be a topological space and let A⊆X. The set A is nowhere dense when int⁡(A‾)=∅ (def-interior-closure-boundary-top). It is meagre when there is a sequence (Nn)n∈N of nowhere dense subsets of X with A⊆⋃nNn. It is residual, or comeagre, when X∖A is meagre. The empty union shows that ∅ is meagre, including when X=∅. (Nowhere dense, meagre, residual, and comeagre subsets of a topological space).

[F3]

Write QR for the image of Q in R under the canonical embedding q↦q^ (lem-rat-embeds-dense), the set usually written Q once the identification is made, and put X:=R∖QR 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σ).

[F4]

Q≈N (def-equinumerous): the rationals are countably infinite (def-countable). No choice principle is used. The one place where a reader expects a choice, "pick a representative a/b of each rational", is exactly where lem-rat-positive-denominator applies: every rational has a representative with positive denominator, so the map (a,b)↦[(a,b)] defined on Z×Z>0 is already surjective onto Q, and countability follows from a surjection without ever selecting a representative. The same device handles Z, which is a surjective image of N×N by construction (def-integers). (Q is countably infinite).

[F5]

Let (X,d) be a metric space (def-metric-space) and let p,q∈X with p≠q. Put r:=d(p,q)/2. Then r>0 and B(p,r)∩B(q,r)=∅. Both sets are open (thm-metric-open-set-algebra) and contain p respectively q (def-metric-ball), so every metric space is Hausdorff: distinct points are separated by disjoint open sets (def-metric-topology). (Distinct points of a metric space have disjoint balls around them).

[F6]

Let (X,T) be a topological space (def-topological-space). The following implications hold, and each is proved by an earlier item of this page. 1. Perfectly normal implies completely normal, assuming the Axiom of Countable Choice (def-countable-choice). 2. Completely normal implies normal, and perfectly normal implies normal. 3. Normal together with T1 implies T3, that is regular together with T1. 4. Completely regular implies regular, and Tychonoff implies T3. 5. Regular together with T1 implies Urysohn, which implies Hausdorff, which implies T1, which implies T0. 6. Metrizable implies every property named above: a metrizable space is perfectly normal, completely normal, normal, Tychonoff, completely regular, T3, regular, Urysohn, Hausdorff, T1 and T0, with no choice principle used. Reading the numbered axioms in order, clauses 1 to 5 give T6⇒T5⇒T4⇒T3⇒T212⇒T2⇒T1⇒T0, the first arrow under ACω, together with T312⇒T3. This is the whole of the classical chain that this page proves, and it is one arrow short of the classical chain. The implication T4⇒T312 — a normal T1 space is completely regular — is Urysohn's lemma and is not available at this point in the reading order. Its absence is recorded, with what would license it, in this page's conventions remark; it is deliberately not asserted here, and no clause above may be read as giving it. (The implications proved on this page: perfectly normal gives completely normal under countable choice, and completely normal gives normal; normal with T1 gives T3; completely regular gives regular; regular with T1 gives Urysohn, hence Hausdorff, hence T1, hence T0; and metrizable gives every one of them).

[F7]

Let (X,T) be a topological space (def-topological-space) and let Tcof be the cofinite topology on the set X (def-standard-topologies). The following four conditions are equivalent. - (a) X is T1 (def-t0-and-t1-spaces). - (b) {x} is closed for every x∈X. - (c) F is closed for every finite F⊆X (def-countable). - (d) Tcof⊆T, that is, the topology of X is finer than the cofinite topology on the same set. Condition (d) says that the cofinite topology is the coarsest T1 topology on any set: it is T1 by the equivalence, and every T1 topology on that set contains it. (A space is T1 if and only if every singleton is closed, if and only if every finite subset is closed, if and only if its topology contains the cofinite topology).

[F8]

For every real ε>0, some natural n≥1 satisfies 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

Refutation

technique · direct
1.1givenF4F5F6F7F8algebra

Each rational singleton is closed in the subspace topology, since the usual metric topology is Hausdorff and hence T1. It has empty interior in Q: for any q∈Q and any ε>0, choose n from [F8]; then q+1/n is a rational point distinct from q inside the ε-neighbourhood of q. The rational numbers are countable.

2.1step 1.1F1F5F6

Thus the whole nonempty space is meagre in itself, contradicting the nonmeagre-open form of the Baire property.

3.1step 2.1F6F2F3

Cross-check with the published statement that the rationals are meagre and not Gδ in the real line.

4.1step 3.1∎

The preceding construction and implications establish the assertion.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Cylinder sets and continued fractions exhibit the homeomorphism NN≅R∖Q

Example

Under the homeomorphism NN≅R∖Q, a finite cylinder corresponds to the irrational points in the continued-fraction interval determined by the same finite prefix; extension of prefixes gives nested intervals.

Facts & Assumptions

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

[F1]

Baire sequence space NN is homeomorphic to the irrational subspace R∖Q. (Baire sequence space is homeomorphic to the irrational real numbers).

[F2]

For simple continued fractions with a0∈Z and an≥1 for n≥1, the convergents satisfy pn=anpn−1+pn−2 and qn=anqn−1+qn−2, with pnqn−1−pn−1qn=(−1)n−1. A code cylinder C(a0,…,an)⊆NN and the real interval J(a0,…,an) with endpoints pn/qn and (pn+pn−1)/(qn+qn−1) are different objects and are not identified; it is the intervals J that are nested as the prefix is extended, with diam⁡J(a0,…,an)=1/(qn(qn+qn−1))→0. (Continued-fraction convergents, determinant identities, and nested irrational cylinders).

[F3]

The continued-fraction coding of def-simple-continued-fraction-coding is a bijection from the sequences (a0,a1,…) with a0∈Z and an≥1 for n≥1 onto R∖Q, and both the coding map and its inverse are continuous for the cylinder and subspace topologies (Infinite simple continued fractions parametrise the irrational real numbers).

Verification

technique · direct
1.1givenF2F1

Work out the first continued-fraction cylinders and show how extending a finite sequence nests the corresponding irrational interval.

2.1step 1.1F2F1F3

The parametrisation used here is the specific continued-fraction bijection of [F3], not merely the existence of some homeomorphism, which is all [F1] asserts. By [F3] that bijection and its inverse are continuous for the cylinder and subspace topologies, so cylinder convergence corresponds to ordinary convergence of irrational values; the zero-th coordinate convention is the integer decoding fixed in [F2].

3.1step 2.1∎

The preceding construction and implications establish the assertion.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

Under the Axiom of Choice, the Hilbert cube is compact, Polish, and universal for separable metrizable spaces

Example

Assume the Axiom of Choice. The Hilbert cube [0,1]N is compact and Polish, and every separable metrizable space is homeomorphic to a subspace of it.

Facts & Assumptions

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

[F1]

Let ((Xn,dn))n∈N be complete metric spaces with dn≤1. On ∏nXn, the formula D(x,y)=∑n=0∞2−(n+1)dn(xn,yn) defines a complete metric inducing the product topology. The empty product is the one-point space. (The standard weighted metric on a countable product of bounded complete metric spaces is complete).

[F2]

Every separable metrizable space is homeomorphic to a subspace of the Hilbert cube [0,1]N. (Every separable metrizable space embeds in the Hilbert cube [0,1]N).

[F3]

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

[F4]

A topological space is Polish when it is separable (def-separable-space) and completely metrizable: its topology is induced by some complete metric (lem-complete-remetrisation). No particular compatible complete metric or countable dense subset is part of the structure. (Polish spaces are separable completely metrizable spaces).

Verification

technique · direct
1.1givenF1F4F3F2

Give [0,1]N the standard weighted complete product metric.

2.1step 1.1F4F1F3

Compactness follows from Tychonoff and second countability from the countable finite-coordinate basis; a countable rational grid is dense.

3.1step 2.1F3

Apply the embedding theorem for universality without citing an examples-page item.

4.1step 3.1∎

The preceding construction and implications establish the assertion.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)Open item page →

Under Dependent Choice, nowhere differentiable functions form a residual subset of C([0,1],R)

Statement

Assume Dependent Choice. The nowhere differentiable functions form a residual subset of C([0,1],R) with the uniform metric, where differentiability at an endpoint means the corresponding one-sided derivative.

Facts & Assumptions

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

[F1]

Let X be a topological space and let A⊆X. The set A is nowhere dense when int⁡(A‾)=∅ (def-interior-closure-boundary-top). It is meagre when there is a sequence (Nn)n∈N of nowhere dense subsets of X with A⊆⋃nNn. It is residual, or comeagre, when X∖A is meagre. The empty union shows that ∅ is meagre, including when X=∅. (Nowhere dense, meagre, residual, and comeagre subsets of a topological space).

[F2]

For p,q∈N>0, let Ep,q be the functions f∈C([0,1],R) for which some a∈[0,1] satisfies ∣f(t)−f(a)∣≤p∣t−a∣ whenever t∈[0,1] and ∣t−a∣<1/q. Then Ep,q is closed in the supremum metric. (Functions satisfying a fixed local Lipschitz bound somewhere form a closed subset of C([0,1])).

[F3]

For every f∈C([0,1],R), every ε>0, and every M>0, there is a piecewise-affine h with finitely many vertices such that ∥f−h∥∞<ε and every slope on a nonvertex affine piece has absolute value greater than M. (Polygonal functions with sufficiently steep nonvertex slopes are dense in C([0,1])).

[F4]

The pairs of natural numbers have a specified countable enumeration (N×N≈N).

Proof

technique · direct
1.1F2F3F1

Fix positive integers p,q. By the now choice-free proof of [F2], Ep,q is closed. Given any uniform open ball, [F3] supplies within it a polygonal function h whose slopes on all nonvertex pieces have absolute value greater than p. At any a∈[0,1], at least one side of a contains arbitrarily close points on one such affine piece; the corresponding difference quotients have absolute value greater than p. Hence h∉Ep,q. Every open ball meets the complement of Ep,q, so Ep,q has empty interior and is nowhere dense.

2.1step 1.1F1F2F4

Enumerate the positive-integer pairs (p,q) using [F4], and let M=⋃p,q≥1Ep,q. Step 1.1 and [F1] make M a countable union of nowhere dense sets. If f has a finite derivative at some a (one-sided at an endpoint), the difference quotient is bounded near a; choose positive integers p above that bound and q so that 1/q is within the neighborhood. Then f∈Ep,q. Thus the complement of the set N of nowhere differentiable functions is a subset of M, and this same explicitly given countable family witnesses that the complement of N is meagre. Hence N is residual.

3.1step 2.1∎

The preceding construction and implications establish the assertion.

False statementConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-08-16Open item page →

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 q↦q^ (lem-rat-embeds-dense), the set usually written Q once the identification is made, and put X:=R∖QR 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.1givenF3F1F2

The rational line is metrizable but not Baire.

2.1step 1.1F2F1F4

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

3.1step 2.1F4F2F3

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

4.1step 3.1∎

The preceding construction and implications establish the assertion.

Sources