Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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 standard entourages on minimal Cauchy filters form a separated uniformity

Statement

On the set X^\widehat X of minimal Cauchy filters, the relations E^\widehat E declaring that two filters have EE-close members form a separated uniformity.

Facts & Assumptions

Given: Minimal Cauchy filters F,G\mathcal F,\mathcal G on XX.

[L1]

Every Cauchy filter has a unique associated minimal Cauchy filter, and every principal filter is Cauchy and therefore has an associated minimal Cauchy filter (Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it).

[L2]

Symmetric entourages form a base and admit square roots (Every uniformity has a base of symmetric entourages).

Proof

technique · constructive
1.1

Because a uniformity is a proper filter on X×XX\times X, its carrier XX is nonempty. Choose xXx\in X; then [L1] gives a minimal Cauchy filter associated to the principal filter at xx, so X^\widehat X is nonempty. For symmetric EE, put (F,G)E^(\mathcal F,\mathcal G)\in\widehat E when some AFA\in\mathcal F and BGB\in\mathcal G satisfy A×BEA\times B\subseteq E.

L1L3constructchoose
2.1

Every F\mathcal F is E^\widehat E-close to itself: choose an EE-small member of the Cauchy filter and use it on both sides. Thus each E^\widehat E contains the nonempty diagonal of X^\widehat X. The relation E^\widehat E is symmetric. If E^\widehat E and D^\widehat D have respective witnesses A×BA\times B and C×KC\times K, then (AC)×(BK)ED(A\cap C)\times(B\cap K)\subseteq E\cap D, so finite intersections are refined by the corresponding hatted intersection.

step 1.1
2.2

Choose a symmetric entourage DD with D2ED^{\circ2}\subseteq E. If FD^G\mathcal F\,\widehat D\,\mathcal G via A×BDA\times B\subseteq D and GD^H\mathcal G\,\widehat D\,\mathcal H via C×KDC\times K\subseteq D, choose bBCb\in B\cap C. Then aDbDkaDbDk for every aA,kKa\in A,k\in K, so A×KD2EA\times K\subseteq D^{\circ2}\subseteq E. Hence D^D^E^\widehat D\circ\widehat D\subseteq\widehat E.

step 1.1L2choose
2.3

Steps 2.1 and 2.2 show that the upward closure of the relations E^\widehat E is a uniformity. To prove separation, suppose FE^G\mathcal F\,\widehat E\,\mathcal G for every entourage EE. Given AFA\in\mathcal F, minimality gives F=m(F)\mathcal F=m(\mathcal F) by [L1], so some D[C]AD[C]\subseteq A with CFC\in\mathcal F and symmetric DD. Choose an entourage EDE\subseteq D and witnesses PF,QGP\in\mathcal F,Q\in\mathcal G with P×QEP\times Q\subseteq E. Pick cCPc\in C\cap P. Then QE[c]D[C]AQ\subseteq E[c]\subseteq D[C]\subseteq A, so AGA\in\mathcal G. Thus FG\mathcal F\subseteq\mathcal G; symmetry gives equality.

step 1.1L1L2choose
3.1

Therefore the standard relations form the asserted separated uniformity.

step 2.3L3discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

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