Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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)(X,\mathcal U), its Samuel uniformity US\mathcal U_S is totally bounded.

Facts & Assumptions

Given: A basic Samuel entourage E(F,ε)E(F,\varepsilon), where FF is finite and ε>0\varepsilon>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,ε)E(F,\varepsilon) form a base for the Samuel uniformity (The Samuel uniformity generated by bounded uniformly continuous functions).

Proof

technique · constructive
1.1

For each fFf\in F, [L2] supplies a finite set Af[0,1]A_f\subseteq[0,1] such that every value of ff is within ε/3\varepsilon/3 of some member of AfA_f.

L2construct
1.2

The product A:=fFAfA:=\prod_{f\in F}A_f is finite, and for aAa\in A let CaC_a be the set of xXx\in X with f(x)af<ε/3|f(x)-a_f|<\varepsilon/3 for every fFf\in F.

L3
2.1

The index set A:={aA:Ca}A':=\{a\in A:C_a\ne\varnothing\} of nonempty cells is a finite subset of AA. Choose a natural nn and a bijection e:nAe:n\to A', form the explicitly nn-indexed family iCe(i)i\mapsto C_{e(i)}, and use [L3] to choose ce(i)Ce(i)c_{e(i)}\in C_{e(i)}; let CC be the set of chosen points.

L3step 1.2
3.1

If xXx\in X, choose aAa\in A with xCax\in C_a using step 1.1; then aAa\in A' and f(x)f(ca)<2ε/3<ε|f(x)-f(c_a)|<2\varepsilon/3<\varepsilon for every fFf\in F, so xE(F,ε)[ca]x\in E(F,\varepsilon)[c_a].

step 1.1step 1.2step 2.1
4.1

Thus CC 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=F=\varnothing, use the empty centre set if X=X=\varnothing and any singleton centre otherwise. Hence US\mathcal U_S is totally bounded.

L1L4step 3.1discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

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