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.

The minimal Cauchy filters associated to points define a uniformly continuous dense canonical map

Statement

The map η:XX^\eta:X\to\widehat X sending xx to the minimal Cauchy filter associated to its principal filter is uniformly continuous and has dense image. For every xXx\in X, every member of η(x)\eta(x) contains xx.

Facts & Assumptions

Given: A uniform space XX and its minimal-Cauchy-filter space X^\widehat X.

[L1]

Principal filters are Cauchy and have associated minimal Cauchy filters (Every Cauchy filter canonically determines a unique minimal Cauchy filter coarser than it).

[L2]

The standard relations are entourages on X^\widehat X (The standard entourages on minimal Cauchy filters form a separated uniformity).

[L4]

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

Define η(x)\eta(x) to be the minimal filter associated to the principal filter Px\mathcal P_x at xx. Since η(x)=m(Px)Px\eta(x)=m(\mathcal P_x)\subseteq\mathcal P_x, every member of η(x)\eta(x) contains xx.

L1construct
1.2

Let E^[F]\widehat E[\mathcal F] be a basic neighbourhood. Choose a symmetric DD with D2ED^{\circ2}\subseteq E, a DD-small AFA\in\mathcal F, and aAa\in A. The point filter η(a)\eta(a) contains D[a]D[a], and D[a]×AD2ED[a]\times A\subseteq D^{\circ2}\subseteq E, so η(a)E^[F]\eta(a)\in\widehat E[\mathcal F]. Thus every basic neighbourhood meets η[X]\eta[X].

L1L2L3L4choose
2.1

Given a target basic entourage E^\widehat E, choose a symmetric DD with D3ED^{\circ3}\subseteq E. If (x,y)D(x,y)\in D, then D[x]η(x)D[x]\in\eta(x) and D[y]η(y)D[y]\in\eta(y), while D[x]×D[y]D3ED[x]\times D[y]\subseteq D^{\circ3}\subseteq E. Hence (η(x),η(y))E^(\eta(x),\eta(y))\in\widehat E, which proves uniform continuity.

step 1.1L2L4
3.1

Thus every neighbourhood meets η[X]\eta[X], so its closure is all of X^\widehat X and the image is dense.

step 1.2L3discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

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