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.

On a nonempty set, entourage uniformities and uniform-cover structures determine one another

Statement

In ZF, on a nonempty set XX, an entourage uniformity determines a uniform-cover structure by the covers {E[x]:xX}\{E[x]:x\in X\}, and a uniform-cover structure determines an entourage uniformity by the sets VVV×V\bigcup_{V\in\mathcal V}V\times V. These constructions recover the same uniform structure.

Facts & Assumptions

Given: A nonempty set XX carrying either an entourage uniformity or a uniform-cover structure.

[L1]

Symmetric entourages form a base and have symmetric square roots (Every uniformity has a base of symmetric entourages, Uniform space in the entourage formulation).

[L2]

Uniform covers are upward closed under coarsening, have common refinements, and have star-refinements (Uniform space in the uniform-cover formulation).

Proof

technique · constructive
1.1

From an entourage EE, form CE={E[x]:xX}\mathcal C_E=\{E[x]:x\in X\}. Choose a symmetric entourage DD with D3ED^{\circ3}\subseteq E. If D[y]D[x]D[y]\cap D[x]\ne\varnothing and zD[y]z\in D[y], symmetry and a point in the intersection give (x,z)D3E(x,z)\in D^{\circ3}\subseteq E. Hence the star of D[x]D[x] in CD\mathcal C_D lies in E[x]E[x], so CD\mathcal C_D star-refines CE\mathcal C_E.

L1construct
1.2

From a uniform cover V\mathcal V, form EV=VVV×VE_{\mathcal V}=\bigcup_{V\in\mathcal V}V\times V. It contains the nonempty diagonal, so it is nonempty. A star-refinement W\mathcal W has EWEWEVE_{\mathcal W}\circ E_{\mathcal W}\subseteq E_{\mathcal V}, while common refinements and coarsenings give the remaining filter axioms.

L2construct
2.1

Declare a cover uniform when it is coarser than some CE\mathcal C_E. Intersections of entourages give common refinements, enlargement of an entourage gives coarsening, and step 1.1 gives star-refinements. Hence these covers satisfy the uniform-cover axioms.

step 1.1L1L2
2.2

Start with an entourage uniformity. For symmetric DD, DECDD1D=D2.D\subseteq E_{\mathcal C_D}\subseteq D^{-1}\circ D=D^{\circ2}. The first inclusion uses the diagonal, and the second follows because two points in one DD-ball are D1DD^{-1}\circ D-related. Taking a symmetric square root inside any prescribed entourage shows that the recovered entourage filter is exactly the original one.

L1step 1.1step 1.2
2.3

Start instead with a uniform-cover structure. The EVE_{\mathcal V}-ball at xx is EV[x]=St(x,V),E_{\mathcal V}[x]=\operatorname{St}(x,\mathcal V), the union of the members of V\mathcal V containing xx. Thus V\mathcal V refines CEV\mathcal C_{E_{\mathcal V}}, so the latter is uniform by coarsening. Conversely, if W\mathcal W star-refines V\mathcal V, then for any xx and any W0WW_0\in\mathcal W containing xx, St(x,W)St(W0,W)\operatorname{St}(x,\mathcal W)\subseteq\operatorname{St}(W_0,\mathcal W), which lies in some member of V\mathcal V. Therefore CEW\mathcal C_{E_{\mathcal W}} refines V\mathcal V. The recovered cover structure is exactly the original one.

L2step 1.2
3.1

Steps 2.2 and 2.3 prove that the two constructions are mutually inverse at the level of generated structures.

step 2.2step 2.3discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 24 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