Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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 X^\widehat X of minimal Cauchy filters is complete.

Facts & Assumptions

Given: A Cauchy filter Φ\Phi on X^\widehat X.

[L1]

The standard relations form a uniformity on minimal Cauchy filters (The standard entourages on minimal Cauchy filters form a separated uniformity).

[L2]

Every Cauchy filter on XX has its associated minimal Cauchy filter (Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it).

[L3]

Completeness means convergence of every Cauchy filter (Complete uniform space: every Cauchy filter converges).

[L4]

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

technique · constructive
1.1

For AXA\subseteq X, put A#:={MX^:AM},A^\#:=\{\,\mathcal M\in\widehat X:A\in\mathcal M\,\}, and define F:={AX:A#Φ}\mathcal F:=\{A\subseteq X:A^\#\in\Phi\}. Since X#=X^X^\#=\widehat X, #=\varnothing^\#=\varnothing, (AB)#=A#B#(A\cap B)^\#=A^\#\cap B^\#, and A#B#A^\#\subseteq B^\# whenever ABA\subseteq B, [L4] shows that F\mathcal F is a filter on XX.

L4construct
1.2

The filter F\mathcal F is Cauchy. Given an entourage UU, choose a symmetric DD with D3UD^{\circ3}\subseteq U. Choose a D^\widehat D-small SΦS\in\Phi, a filter M0S\mathcal M_0\in S, and a DD-small CM0C\in\mathcal M_0. For every NS\mathcal N\in S, the relation M0D^N\mathcal M_0\,\widehat D\,\mathcal N has witnesses PM0P\in\mathcal M_0 and QNQ\in\mathcal N with P×QDP\times Q\subseteq D. A point of CPC\cap P shows QD[C]Q\subseteq D[C], hence D[C]ND[C]\in\mathcal N. Thus S(D[C])#S\subseteq(D[C])^\#, so D[C]FD[C]\in\mathcal F. Moreover D[C]×D[C]D3UD[C]\times D[C]\subseteq D^{\circ3}\subseteq U, making this a UU-small member of F\mathcal F.

L1L4choose
2.1

Let M=m(F)\mathcal M=m(\mathcal F). Given an entourage EE, choose a symmetric DD with D2ED^{\circ2}\subseteq E, and choose a DD-small AFA\in\mathcal F. Then A#ΦA^\#\in\Phi. If NA#\mathcal N\in A^\#, the sets D[A]MD[A]\in\mathcal M and ANA\in\mathcal N satisfy D[A]×AD2ED[A]\times A\subseteq D^{\circ2}\subseteq E, so NE^[M]\mathcal N\in\widehat E[\mathcal M]. Hence A#E^[M]A^\#\subseteq\widehat E[\mathcal M], and the ball E^[M]\widehat E[\mathcal M] belongs to Φ\Phi. Therefore ΦM\Phi\to\mathcal M.

step 1.1step 1.2L1L2L4
3.1

Since every Cauchy filter Φ\Phi converges, X^\widehat X is complete by [L3].

step 2.1L3discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

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