Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-02
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.

The Samuel reflection of a nonempty indiscrete uniform space is a singleton

Example

Let X≠∅ carry the indiscrete uniformity {X×X}. Its Samuel completion, equivalently its Hausdorff Samuel reflection, is a singleton. This is not called a compactification unless X itself is a singleton.

Facts & Assumptions

Verification

technique · direct
1.1

If f:X→[0,1] is uniformly continuous and x,y∈X, then for every ε>0 the sole source entourage forces ∣f(x)−f(y)∣<ε; hence f(x)=f(y).

L1
2.1

Every Samuel coordinate is constant by step 1.1, so every Samuel pseudometric vanishes and the Samuel uniformity is again indiscrete.

L1step 1.1
3.1

Let η:X→S(X) be a Hausdorff completion of the Samuel uniformity. If η(x)≠η(y), separatedness in [L2] gives a target entourage excluding that pair, while uniform continuity pulls it back to the sole source entourage X×X, a contradiction. Thus η[X] is a singleton.

L2step 2.1
4.1

The nonempty singleton η[X] is dense by [L2] and closed by [L2], so it is all of S(X). Thus the Samuel reflection is a singleton; if X has at least two points its canonical map is not injective.

L2step 3.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

42 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