Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

The sets containing an entourage ball about each of their points form a topology

Statement

For a uniformity U on X, call O⊆X open when every x∈O has an entourage E with E[x]⊆O. These open sets form a topology on X. Its neighbourhood filter at x has {E[x]:E∈U} as a base.

Facts & Assumptions

Given: A uniform space (X,U).

[A1]

Entourages contain the diagonal, are closed under finite intersection, and have symmetric square roots (Uniform space in the entourage formulation, Every uniformity has a base of symmetric entourages).

[L1]

A topology contains ∅,X, is closed under arbitrary unions, and under binary intersections (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Proof

technique · direct
1.1

The sets ∅ and X are open: the first has no points to test, and for x∈X every entourage ball is contained in X.

A1
1.2

An arbitrary union of open sets is open, because a point in the union lies in one member and retains that member's entourage ball.

A1
1.3

If x∈O∩P, choose entourage balls E[x]⊆O and F[x]⊆P; then (E∩F)[x]⊆O∩P, so binary intersections are open.

A1
2.1

By steps 1.1 to 1.3, the open sets form a topology by [L1].

step 1.1step 1.2step 1.3L1
3.1

Let E be an entourage and define OE={y∈E[x]:F[y]⊆E[x] for some F∈U}. This set is open. Indeed, given y∈OE, choose F as displayed and then a symmetric G with G∘G⊆F. If z∈G[y], symmetry gives G[z]⊆(G∘G)[y]⊆F[y]⊆E[x], so z∈OE; hence G[y]⊆OE. Now choose a symmetric D with D∘D⊆E. If y∈D[x], then D[y]⊆E[x], so y∈OE. Thus x∈D[x]⊆OE⊆E[x], proving that E[x] is a neighbourhood of x.

A1step 2.1
4.1

Conversely, if N is a neighbourhood of x, it contains an open set O with x∈O; the definition of the topology supplies an entourage E with E[x]⊆O⊆N. Thus the entourage balls refine every neighbourhood, and by step 3.1 they are themselves neighbourhoods. They form a neighbourhood base by [L2].

step 2.1step 3.1L2∎

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