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 , its Samuel uniformity is totally bounded.
Facts & Assumptions
Given: A basic Samuel entourage , where is finite and .
A uniform space is totally bounded when every entourage has a finite set of centres whose entourage balls cover it (Totally bounded uniform space).
The usual metric uniformity on induces its compact metric topology; by uniqueness of the compatible uniformity it is totally bounded (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, Heine-Borel by bisection: every closed bounded interval is compact, A nonempty compact Hausdorff space carries exactly one compatible uniformity, Every compact uniform space is totally bounded).
A finite set is equinumerous with a natural number; finite choice applies to a family explicitly indexed by such a natural number; finite products and subsets of finite sets are finite (The cardinality of a finite set, Every natural-number-indexed list of nonempty sets has a choice function on its family of values, The product rule: , and , A subset of a finite set is finite, with , and equality holds if and only if ).
The basic sets form a base for the Samuel uniformity (The Samuel uniformity generated by bounded uniformly continuous functions).
Proof
For each , [L2] supplies a finite set such that every value of is within of some member of .
The product is finite, and for let be the set of with for every .
The index set of nonempty cells is a finite subset of . Choose a natural and a bijection , form the explicitly -indexed family , and use [L3] to choose ; let be the set of chosen points.
If , choose with using step 1.1; then and for every , so .
Thus 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 , use the empty centre set if and any singleton centre otherwise. Hence is totally bounded.
Depends on
- The Samuel uniformity generated by bounded uniformly continuous functions
- Samuel function pseudometrics generate a uniformity coarser than the original one
- Totally bounded uniform space
- Every compact uniform space is totally bounded
- Heine-Borel by bisection: every closed bounded interval $[a,b]$ is compact
- A nonempty compact Hausdorff space carries exactly one compatible uniformity
- 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
- The cardinality $\lvert A\rvert$ of a finite set
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
- The product rule: $\lvert A \times B\rvert = \lvert A\rvert\,\lvert B\rvert$, and $\big\lvert\prod_{i<m} A_i\big\rvert = \prod_{i<m}\lvert A_i\rvert$
- A subset of a finite set is finite, with $\lvert B\rvert \le \lvert A\rvert$, and equality holds if and only if $B = A$
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
- Encyclopedia of Mathematics, Uniform space (standard reference, not scraped)
- J. Wodzicki, Uniform Structure (standard reference, not scraped)