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.

Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it

Statement

Every Cauchy filter F\mathcal F canonically determines a unique Cauchy filter m(F)Fm(\mathcal F)\subseteq\mathcal F that has no strictly coarser Cauchy filter. For every xXx\in X, the principal filter Px:={AX:xA}\mathcal P_x:=\{A\subseteq X:x\in A\} is Cauchy and therefore has an associated minimal Cauchy filter m(Px)m(\mathcal P_x).

Facts & Assumptions

Given: A Cauchy filter F\mathcal F on a uniform space.

[L1]

Cauchyness supplies arbitrarily small members of F\mathcal F (Cauchy filter in a uniform space).

[L3]

Symmetric entourages form a base and may be chosen with prescribed finite-composite control (Every uniformity has a base of symmetric entourages).

Proof

technique · constructive
1.1

Let B\mathcal B consist of all E[A]E[A] with AFA\in\mathcal F and symmetric entourage EE. Every such set contains the nonempty set AA. Given E[A],D[B]BE[A],D[B]\in\mathcal B, the symmetric entourage EDE\cap D and the member ABFA\cap B\in\mathcal F give (ED)[AB]E[A]D[B].(E\cap D)[A\cap B]\subseteq E[A]\cap D[B]. Thus B\mathcal B is a proper downward-directed filter base. Let m(F)m(\mathcal F) be the filter it generates.

L2L3construct
2.1

Since AE[A]A\subseteq E[A], every member of B\mathcal B belongs to F\mathcal F, so m(F)Fm(\mathcal F)\subseteq\mathcal F. To prove it Cauchy, let UU be an entourage and choose a symmetric EE with E3UE^{\circ3}\subseteq U. Choose AFA\in\mathcal F with A×AEA\times A\subseteq E. If y,zE[A]y,z\in E[A], take a,bAa,b\in A with aEyaEy and bEzbEz; symmetry gives yEaEbEzyEaEbEz, so (y,z)E3U(y,z)\in E^{\circ3}\subseteq U. Hence E[A]m(F)E[A]\in m(\mathcal F) is UU-small.

L1L3step 1.1
2.2

Let GF\mathcal G\subseteq\mathcal F be Cauchy, and fix E[A]BE[A]\in\mathcal B. Choose a symmetric DD with DED\subseteq E, and a DD-small BGB\in\mathcal G. Since A,BFA,B\in\mathcal F, choose cABc\in A\cap B. Then BD[c]E[A]B\subseteq D[c]\subseteq E[A], so E[A]GE[A]\in\mathcal G. Thus every Cauchy filter coarser than F\mathcal F contains m(F)m(\mathcal F).

L1L3step 1.1choose
3.1

If a Cauchy filter is coarser than m(F)m(\mathcal F), step 2.2 places m(F)m(\mathcal F) inside it, so equality holds; hence m(F)m(\mathcal F) is minimal. Any minimal Cauchy filter coarser than F\mathcal F contains m(F)m(\mathcal F) by step 2.2 and must equal it by minimality. This proves uniqueness.

step 2.1step 2.2
4.1

For xXx\in X, the set {x}\{x\} belongs to Px\mathcal P_x, and {x}×{x}ΔXE\{x\}\times\{x\}\subseteq\Delta_X\subseteq E for every entourage EE. Thus Px\mathcal P_x is Cauchy by [L1], and step 3.1 supplies its associated minimal Cauchy filter.

L1step 3.1discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

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