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, every metrizable Čech-complete space is completely metrizable

Statement

Assume the ultrafilter lemma, Dependent Choice and Countable Choice — the hypotheses carried by the compactification-independence theorem of [F2] and the completely-metrizable characterisation of [F5]. Every metrizable Čech-complete space is completely metrizable.

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]

Assume the ultrafilter lemma and Dependent Choice. 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).

[F3]

Let (X,d) be a metric space (def-metric-space) and let C be the set of all Cauchy sequences in X (def-cauchy-in-metric). Then: 1. For all x=(xn) and y=(yn) in C the real sequence (d(xn,yn))n converges, so ρ(x,y)  :=  limnd(xn,yn) is a single well-determined real (thm-cauchy-criterion-via-lub, lem-limit-unique). 2. The relation xy:ρ(x,y)=0 is an equivalence relation on C. Write X^:=C/ ⁣ for the set of its classes and [x] for the class of x. 3. d^([x],[y]):=ρ(x,y) does not depend on the chosen representatives, and d^ is a metric on X^. 4. The map ι:XX^ sending p to the class of the constant sequence at p is an isometric embedding with dense image (def-isometry-and-metric-embedding, def-metric-interior-closure-boundary). 5. (X^,d^) is complete. Consequently ((X^,d^),ι) is a completion of (X,d) (def-metric-completion), and every metric space has a completion. The notation is kept honest. A Cauchy sequence in X need not converge in X, so no symbol limnxn appears anywhere below; the only limits taken are limits of real sequences, and each is written only after its existence has been proved. The equivalence relation is defined and verified here rather than cited, as was done for def-integers, so that the construction is self-contained and its transitivity argument is visible at the point of use. (Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences).

[F4]

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

[F5]

Assume the Axiom of Countable Choice. If (X,d) is a complete metric space and YX is Gδ in X, then the subspace Y is completely metrizable. (Under the Axiom of Countable Choice, every Gδ subspace of a complete metric space is completely metrizable).

[F6]

Let (X,d) be a metric space with its metric topology. Then X is Tychonoff and perfectly normal; in particular every metric space is a Tychonoff space (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).

Proof

technique · direct
1.1

The empty space has its unique compatible complete metric.

givenF3F1F5
2.1

Otherwise embed the space densely in its metric completion. The completion is a metric space, so by [F6] it is Tychonoff, which is the hypothesis [F4] requires before a compactification may be formed; compactify it, and observe that the resulting compact space is also a compactification of the original dense subspace.

step 1.1F3F1F2F6
3.1

Compactification independence makes the original space Gδ there and hence in the completion.

step 2.1F1F3F2F4
4.1

Apply the Gδ-subspace theorem to the complete metric completion.

step 3.1F3F5F1
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: 156 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