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 uniform space of minimal Cauchy filters is complete
Statement
The separated uniform space of minimal Cauchy filters is complete.
Facts & Assumptions
Given: A Cauchy filter on .
The standard relations form a uniformity on minimal Cauchy filters (The standard entourages on minimal Cauchy filters form a separated uniformity).
Every Cauchy filter on has its associated minimal Cauchy filter (Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it).
Completeness means convergence of every Cauchy filter (Complete uniform space: every Cauchy filter converges).
A filter contains the whole set, omits the empty set, and is closed under finite intersections and supersets (Filter on a set); symmetric entourages with prescribed finite-composite control may be chosen inside any entourage (Every uniformity has a base of symmetric entourages).
Proof
For , put and define . Since , , , and whenever , [L4] shows that is a filter on .
The filter is Cauchy. Given an entourage , choose a symmetric with . Choose a -small , a filter , and a -small . For every , the relation has witnesses and with . A point of shows , hence . Thus , so . Moreover , making this a -small member of .
Let . Given an entourage , choose a symmetric with , and choose a -small . Then . If , the sets and satisfy , so . Hence , and the ball belongs to . Therefore .
Since every Cauchy filter converges, is complete by [L3].
Depends on
Used by
Dependency tree · two levels
14 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
- 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)