Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-31
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.

A Hausdorff completion of a uniform space and its canonical dense map

Definition

A Hausdorff completion of a uniform space (X,U)(X,\mathcal U) is a complete separated uniform space (X^,U^)(\widehat X,\widehat{\mathcal U}) together with a map η:XX^\eta:X\to\widehat X satisfying both of the following conditions.

  • The image η[X]\eta[X] is dense: η[X]=X^\overline{\eta[X]}=\widehat X (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).
  • The original uniformity is exactly the uniformity pulled back along η\eta: for every E^U^\widehat E\in\widehat{\mathcal U}, (η×η)1[E^]U(\eta\times\eta)^{-1}[\widehat E]\in\mathcal U, and for every EUE\in\mathcal U there is E^U^\widehat E\in\widehat{\mathcal U} with (η×η)1[E^]E(\eta\times\eta)^{-1}[\widehat E]\subseteq E.

The first half of the second condition is uniform continuity (Uniformly continuous map between uniform spaces); the second half prevents the completion map from discarding any of the original uniform structure. The map is not required to be injective. It is a uniform embedding (Uniform embedding and uniform isomorphism) exactly when it is injective, and this is the usual completion of a separated uniform space.

Depends on

Used by

Dependency tree · next 3 levels

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