Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27
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 completion of a metric space: a complete metric space together with an isometric embedding onto a dense subspace

Definition

Let (X,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric). A completion of (X,d) is a pair ((X^,d^), ι) in which

The embedding is part of the data, not an afterthought. A completion is a pair, and two completions of the same space are compared through their embeddings (A completion is unique up to a unique isometry fixing the original space, and uniformly continuous maps into complete spaces extend through it); the underlying complete space alone carries no information about where X sits inside it. This is the same discipline as for the metric itself: a metric space is a pair, not a set.

ι identifies X with a subspace of X^, metric and topology included. An isometric embedding is injective, is an isometry onto its image, and carries the metric topology of X onto the subspace topology of ι[X] (An isometric embedding is injective and carries the metric topology of the source onto the subspace topology of its image). So "X is a dense subspace of a complete space" is an accurate reading of the definition, and the pedantic version with ι written out is used only where two completions have to be compared.

Existence and uniqueness are theorems, not part of the definition. Under Countable Choice, every metric space has a completion (Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences) and any two are isometric by a unique isometry commuting with the embeddings A completion is unique up to a unique isometry fixing the original space, and uniformly continuous maps into complete spaces extend through it. Until the first of those is proved, the phrase the completion is not licensed, and it is not used here.

Remarks

Depends on

Used by

Dependency tree · two levels

20 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources