Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

R/Z is Hausdorff

Statement

R/Z is Hausdorff.

Facts & Assumptions

Given: Two distinct classes ξ,η∈R/Z.

[L1]

The quotient map is open, and every interval shorter than one embeds in R/Z (The quotient map is open, and every interval shorter than one embeds in R/Z).

[L2]

For every real x there is exactly one integer m with m≤x<m+1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

[L3]
[L4]

For the quotient projection, p(x)=p(y) exactly when x−y∈Z, and p(x+n)=p(x) for every real x and integer n (The circle as S1=R/Z with basepoint [0]).

Proof

technique · direct
1.1L2L4algebra

Choose representatives x,y∈R of ξ,η and put a=x−⌊x⌋, b=y−⌊y⌋. By [L2], a,b∈[0,1); by [L4], [a]=ξ and [b]=η. Distinctness gives a≠b, so d:=∣a−b∣ and e:=1−d are both positive.

2.1step 1.1L1algebra

Put r=13min⁡{d,e}>0, and let U=p[(a−r,a+r)] and V=p[(b−r,b+r)]. Both are open by [L1], and they contain ξ and η, respectively.

3.1step 1.1step 2.1L1L3L4algebra∎

Suppose U∩V≠∅. Then some u∈(a−r,a+r) and v∈(b−r,b+r) have p(u)=p(v), so k:=u−v∈Z by [L4] and ∣k−(a−b)∣<2r. But a−b∈(−1,1)∖{0}, and its distance from every integer is at least min⁡{∣a−b∣,1−∣a−b∣}=min⁡{d,e}>2r: the candidates 0 and the nearer of 1,−1 give those two distances, while every other integer is farther away. This is a contradiction. Thus U and V are disjoint open neighbourhoods, and [L3] proves the Hausdorff condition.

Depends on

Used by

Dependency tree · two levels

28 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