Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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 left, right, upper and Roelcke uniformities of the additive topological group R all equal its metric uniformity

Example

Under addition, R is a topological group. Its left, right, upper, and Roelcke uniformities all equal the uniformity generated by ∣x−y∣<ε.

Facts & Assumptions

Given: The additive group R with its usual topology.

[L1]

The group formulas for the left and right entourages are x−1y∈U and yx−1∈U (The left and right uniformities of a topological group, Group and abelian group).

[L2]

The upper and Roelcke structures are respectively generated by intersections and composites of left and right entourages (The upper and Roelcke uniformities generated from the left and right uniformities of a topological group).

Verification

technique · direct
1.1L1L3

In additive notation, both left and right conditions are y−x∈U; for symmetric interval neighbourhoods U=(−ε,ε) this is ∣x−y∣<ε.

2.1step 1.1

Hence the left and right uniformities equal the metric uniformity.

3.1step 2.1L2∎

Their upper join and Roelcke meet equal that same uniformity because the two inputs already agree.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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