Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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.

Every uniform space has a Hausdorff completion with dense canonical image, and the canonical map is a uniform embedding exactly when the original uniformity is separated

Statement

Every uniform space XX has a Hausdorff completion η:XX^\eta:X\to\widehat X. The map has dense image, and it is a uniform embedding if and only if the original uniformity is separated.

Facts & Assumptions

Given: A uniform space XX.

[L1]
[L2]

Point filters define a uniformly continuous dense map η:XX^\eta:X\to\widehat X, and every member of η(x)\eta(x) contains xx (The minimal Cauchy filters associated to points define a uniformly continuous dense canonical map).

[L3]

A Hausdorff completion and a uniform embedding have the stated definitions (A Hausdorff completion of a uniform space and its canonical dense map, Uniform embedding and uniform isomorphism).

[L4]

Separatedness is equivalent to Hausdorffness of the induced topology (A uniformity is separated if and only if its induced topology is Hausdorff).

[L5]

Symmetric entourages form a base and may be chosen inside any prescribed entourage (Every uniformity has a base of symmetric entourages).

Proof

technique · constructive
1.1

Take X^\widehat X to be the uniform space of minimal Cauchy filters and take η\eta from [L2].

L1L2construct
2.1

It is complete and separated by [L1], and η\eta is uniformly continuous with dense image by [L2]. It remains to verify that the pullback uniformity is not strictly coarser than the original one. Given an entourage EE of XX, choose a symmetric DED\subseteq E. If (η(x),η(y))D^(\eta(x),\eta(y))\in\widehat D, witnesses Aη(x)A\in\eta(x) and Bη(y)B\in\eta(y) satisfy A×BDA\times B\subseteq D. Every member of the minimal point filter η(x)\eta(x) contains xx, and every member of η(y)\eta(y) contains yy; therefore (x,y)DE(x,y)\in D\subseteq E. Thus (η×η)1[D^]E(\eta\times\eta)^{-1}[\widehat D]\subseteq E. Together with uniform continuity, this is exactly the pullback condition in [L3], so η\eta is a Hausdorff completion.

step 1.1L1L2L3L5
3.1

If η(x)=η(y)\eta(x)=\eta(y), step 2.1 puts (x,y)(x,y) in every entourage of XX. Conversely, if (x,y)(x,y) belongs to every entourage of XX, uniform continuity puts (η(x),η(y))(\eta(x),\eta(y)) in every entourage of X^\widehat X; separatedness of X^\widehat X gives η(x)=η(y)\eta(x)=\eta(y).

step 2.1L1L2
4.1

Step 3.1 says that η\eta is injective exactly when U\mathcal U is separated. When injective, the two directions of the pullback condition in step 2.1 say precisely that the corestriction Xη[X]X\to\eta[X] and its inverse are uniformly continuous, so η\eta is a uniform embedding. Conversely every uniform embedding is injective.

step 2.1step 3.1L3L4
5.1

This proves the completion assertion and the exact embedding criterion.

step 2.1step 4.1discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

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