Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 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 uniformity generated by bounded uniformly continuous functions

Definition

Let (X,U) be a uniform space. Give [0,1] the subspace metric d[0,1](s,t):=∣s−t∣ obtained by restricting the usual real metric of The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, as licensed by Isometry, isometric embedding, and the subspace metric on a subset, and equip it with the uniformity generated by that metric (A metric on a nonempty set generates an entourage uniformity whose induced topology and uniformly continuous maps are the usual metric notions, and this uniformity is separated). Let FU be the family of all uniformly continuous maps f:X→[0,1] (Uniformly continuous map between uniform spaces). For f∈FU put pf(x,y):=∣f(x)−f(y)∣. The Samuel uniformity US is the uniformity generated by the gauge (pf)f∈FU in the sense of A gauge of pseudometrics and, on a nonempty set, the uniformity it generates. Thus a base consists of the sets E(F,ε)={(x,y):pf(x,y)<ε for every f∈F}, where F⊆FU is finite and ε>0.

The well-definedness of this gauge and its relation to U are proved in Samuel function pseudometrics generate a uniformity coarser than the original one ↗. The use of [0,1] rather than arbitrary bounded real-valued functions is equivalent by affine rescaling, also proved there.

Depends on

Used by

Dependency tree · two levels

27 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