Alphabeta Math
LemmaStatement: AI-adaptedProof: 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 uniformity is totally bounded

Statement

For every uniform space (X,U), its Samuel uniformity US is totally bounded.

Facts & Assumptions

Given: A basic Samuel entourage E(F,ε), where F is finite and ε>0.

[L1]

A uniform space is totally bounded when every entourage has a finite set of centres whose entourage balls cover it (Totally bounded uniform space).

[L4]

The basic sets E(F,ε) form a base for the Samuel uniformity (The Samuel uniformity generated by bounded uniformly continuous functions).

Proof

technique · constructive
1.1

For each f∈F, [L2] supplies a finite set Af⊆[0,1] such that every value of f is within ε/3 of some member of Af.

L2construct
1.2

The product A:=∏f∈FAf is finite, and for a∈A let Ca be the set of x∈X with ∣f(x)−af∣<ε/3 for every f∈F.

L3
2.1

The index set A′:={a∈A:Ca≠∅} of nonempty cells is a finite subset of A. Choose a natural n and a bijection e:n→A′, form the explicitly n-indexed family i↦Ce(i), and use [L3] to choose ce(i)∈Ce(i); let C be the set of chosen points.

L3step 1.2
3.1

If x∈X, choose a∈A with x∈Ca using step 1.1; then a∈A′ and ∣f(x)−f(ca)∣<2ε/3<ε for every f∈F, so x∈E(F,ε)[ca].

step 1.1step 1.2step 2.1
4.1

Thus C is a finite net for each basic Samuel entourage. Every Samuel entourage contains one of these basic entourages, so the same finite centres cover it; when F=∅, use the empty centre set if X=∅ and any singleton centre otherwise. Hence US is totally bounded.

L1L4step 3.1discharge-construct∎

Depends on

Used by

Dependency tree · two levels

66 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