Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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^ of minimal Cauchy filters is complete.

Facts & Assumptions

Given: A Cauchy filter Φ on 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 X 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 A⊆X, put A#:={ M∈X^:A∈M }, and define F:={A⊆X:A#∈Φ}. Since X#=X^, ∅#=∅, (A∩B)#=A#∩B#, and A#⊆B# whenever A⊆B, [L4] shows that F is a filter on X.

L4construct
1.2

The filter F is Cauchy. Given an entourage U, choose a symmetric D with D∘3⊆U. Choose a D^-small S∈Φ, a filter M0∈S, and a D-small C∈M0. For every N∈S, the relation M0 D^ N has witnesses P∈M0 and Q∈N with P×Q⊆D. A point of C∩P shows Q⊆D[C], hence D[C]∈N. Thus S⊆(D[C])#, so D[C]∈F. Moreover D[C]×D[C]⊆D∘3⊆U, making this a U-small member of F.

L1L4choose
2.1

Let M=m(F). Given an entourage E, choose a symmetric D with D∘2⊆E, and choose a D-small A∈F. Then A#∈Φ. If N∈A#, the sets D[A]∈M and A∈N satisfy D[A]×A⊆D∘2⊆E, so N∈E^[M]. Hence A#⊆E^[M], and the ball E^[M] belongs to Φ. Therefore Φ→M.

step 1.1step 1.2L1L2L4
3.1

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

step 2.1L3discharge-construct∎

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