Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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^ of minimal Cauchy filters, the relations E^ declaring that two filters have E-close members form a separated uniformity.

Facts & Assumptions

Given: Minimal Cauchy filters F,G on X.

[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×X, its carrier X is nonempty. Choose x∈X; then [L1] gives a minimal Cauchy filter associated to the principal filter at x, so X^ is nonempty. For symmetric E, put (F,G)∈E^ when some A∈F and B∈G satisfy A×B⊆E.

L1L3constructchoose
2.1

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

step 1.1
2.2

Choose a symmetric entourage D with D∘2⊆E. If F D^ G via A×B⊆D and G D^ H via C×K⊆D, choose b∈B∩C. Then aDbDk for every a∈A,k∈K, so A×K⊆D∘2⊆E. Hence D^∘D^⊆E^.

step 1.1L2choose
2.3

Steps 2.1 and 2.2 show that the upward closure of the relations E^ is a uniformity. To prove separation, suppose F E^ G for every entourage E. Given A∈F, minimality gives F=m(F) by [L1], so some D[C]⊆A with C∈F and symmetric D. Choose an entourage E⊆D and witnesses P∈F,Q∈G with P×Q⊆E. Pick c∈C∩P. Then Q⊆E[c]⊆D[C]⊆A, so A∈G. Thus F⊆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 · two levels

9 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