Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

A uniformity is separated if and only if its induced topology is Hausdorff

Statement

The topology induced by a uniformity U\mathcal U is Hausdorff if and only if U\mathcal U is separated.

Facts & Assumptions

Given: A uniform space (X,U)(X,\mathcal U) with its induced topology.

[A1]

A uniformity is separated exactly when each distinct pair is excluded by an entourage (Separated uniformity: the intersection of all entourages is the diagonal).

Proof

technique · direct
1.1

Suppose U\mathcal U is separated and xyx\ne y. Choose EE with (x,y)E(x,y)\notin E, then a symmetric DD with DDED\circ D\subseteq E.

A1L1choose
1.2

Conversely, if the induced topology is Hausdorff and xyx\ne y, choose disjoint neighbourhoods of x,yx,y and refine the first by an entourage ball E[x]E[x]; then yE[x]y\notin E[x], so (x,y)E(x,y)\notin E.

L1L2choose
2.1

The neighbourhoods D[x]D[x] and D[y]D[y] are disjoint: if zz belonged to both, symmetry would give (x,z),(z,y)D(x,z),(z,y)\in D and hence (x,y)DDE(x,y)\in D\circ D\subseteq E.

step 1.1L1
3.1

Thus the induced topology is Hausdorff by [L2].

step 2.1L2
4.1

Every distinct pair is excluded by an entourage, so U\mathcal U is separated by [A1].

step 1.2A1

Depends on

Used by

Dependency tree · next 3 levels

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