Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Under the ultrafilter lemma and the Axiom of Choice, every completely metrizable space is Čech-complete

Statement

Assume the ultrafilter lemma and the Axiom of Choice. Every completely metrizable space is Čech-complete.

Facts & Assumptions

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

[F1]

A Tychonoff space X is Čech-complete when there is a Hausdorff compactification (K,i) of X (def-compactification-of-a-tychonoff-space) for which i[X] is a Gδ subset of K (def-g-delta-and-f-sigma-in-a-topological-space). The definition asks for one compactification; thm-cech-completeness-is-independent-of-compactification proves the equivalent every-compactification form. (Čech-complete spaces as Gδ subspaces of Hausdorff compactifications).

[F2]

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:XY be a bijection (def-injection-surjection-bijection) such that h and h1 are continuous (def-metric-continuity). If Td is completely metrizable then so is Te. 2. Closed subspaces. If Td is completely metrizable and AX 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):=xy (lem-real-line-is-a-metric-space). Then (P,d) is not complete, while ρP(x,y)  :=  xy  +  1x1y 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).

[F3]

Assume the Axiom of Choice. Every metric space is paracompact. (Stone's theorem, under choice: every metric space is paracompact).

[F4]

Consequently every metrizable space (def-metrizable-space) is Tychonoff and perfectly normal, and hence T6, T5, T4, T312, T3, T212, T2, T1 and T0. (In a metric space every closed set is a zero set and a Gδ, and the distance function separates a point from a closed set, so every metrizable space is Tychonoff and perfectly normal).

[F5]

Assume the ultrafilter lemma. If X is Tychonoff, e:X[0,1]C(X,[0,1]) is its full evaluation map, and K=e[X], then (K,e) is a Hausdorff compactification of X. In particular every Tychonoff space has one. This statement uses the ultrafilter lemma only for compactness of the cube; it makes no assertion about dependent choice. (Assuming the ultrafilter lemma, every Tychonoff space has a Hausdorff compactification).

[F6]

Assume the ultrafilter lemma. A Tychonoff space is a Gδ subset of some Hausdorff compactification if and only if it is a Gδ subset of every Hausdorff compactification. (Under the ultrafilter lemma and Dependent Choice, a Tychonoff space is Gδ in some Hausdorff compactification exactly when it is Gδ in every one).

Proof

technique · direct
1.1

The empty space is Gδ in its empty compactification.

givenF1F6F2
2.1

Otherwise choose a compatible complete metric and locally finite refinements of the covers by balls of radius tending to zero.

step 1.1F2F1F3
3.1

In a Hausdorff compactification, extend the refined members to ambient open sets and use local finiteness to form open neighbourhoods whose intersection is exactly the original space: a point in every neighbourhood produces a Cauchy filter and hence a limit in the complete space.

step 2.1F1F2F6F4
4.1

Invoke compactification independence only after this construction is established.

step 3.1F1F6F5
5.1

The preceding construction and implications establish the assertion.

step 4.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 154 results over 23 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