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.
Total boundedness passes to a uniform space with a dense uniformly continuous image
Statement
Let be uniformly continuous with dense image. If is totally bounded, then is totally bounded.
Facts & Assumptions
Given: A target entourage of , a uniformly continuous map with dense image, and a totally bounded source .
The uniformity square-root axiom gives with ; a symmetric-entourage base then gives symmetric , hence (Uniform space in the entourage formulation, Every uniformity has a base of symmetric entourages).
Uniform continuity supplies a source entourage whose -related pairs have -related images (Uniformly continuous map between uniform spaces).
Total boundedness supplies a finite with (Totally bounded uniform space).
Entourage balls are neighbourhoods, so density makes every nonempty target entourage ball meet (The sets containing an entourage ball about each of their points form a topology).
Proof
Choose and as in [L1] and [L2], and choose the finite -net from [L3].
For , density gives with ; choose with .
Step 1.2 gives and, by symmetry, , hence .
The finite set has -balls covering , proving total boundedness; if , the empty set is the required finite net.
Depends on
Used by
- Under dependent choice the Samuel completion of a separated totally bounded space is its uniform completion; under the ultrafilter lemma it is compact Corollary
- Under the ultrafilter lemma the Samuel completion is compact, and under dependent choice plus the ultrafilter lemma it compactifies every separated uniform space Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 28 results over 12 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
- J. Wodzicki, Uniform Structure (standard reference, not scraped)