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.
Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it
Statement
Every Cauchy filter canonically determines a unique Cauchy filter that has no strictly coarser Cauchy filter. For every , the principal filter is Cauchy and therefore has an associated minimal Cauchy filter .
Facts & Assumptions
Given: A Cauchy filter on a uniform space.
Cauchyness supplies arbitrarily small members of (Cauchy filter in a uniform space).
Filter bases generate the least filter containing them (Filter base and the filter it generates, The upward closure of a filter base is the smallest filter containing it).
Symmetric entourages form a base and may be chosen with prescribed finite-composite control (Every uniformity has a base of symmetric entourages).
Proof
Let consist of all with and symmetric entourage . Every such set contains the nonempty set . Given , the symmetric entourage and the member give Thus is a proper downward-directed filter base. Let be the filter it generates.
Since , every member of belongs to , so . To prove it Cauchy, let be an entourage and choose a symmetric with . Choose with . If , take with and ; symmetry gives , so . Hence is -small.
Let be Cauchy, and fix . Choose a symmetric with , and a -small . Since , choose . Then , so . Thus every Cauchy filter coarser than contains .
If a Cauchy filter is coarser than , step 2.2 places inside it, so equality holds; hence is minimal. Any minimal Cauchy filter coarser than contains by step 2.2 and must equal it by minimality. This proves uniqueness.
For , the set belongs to , and for every entourage . Thus is Cauchy by [L1], and step 3.1 supplies its associated minimal Cauchy filter.
Depends on
Used by
- The minimal Cauchy filters associated to points define a uniformly continuous dense canonical map Lemma
- The standard entourages on minimal Cauchy filters form a separated uniformity Lemma
- The uniform space of minimal Cauchy filters is complete Lemma
- Every uniformly continuous map into a complete Hausdorff uniform space extends uniquely across the Hausdorff completion; consequently completions are unique up to a unique uniform isomorphism Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 10 results over 5 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)
- J. H. V. Hunt, Boletín de la Sociedad Matemática Mexicana 34 (1989), 11–21 (standard reference, not scraped)