Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13
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 localisation relation is an equivalence relation and fraction arithmetic is well defined

Statement

For every commutative ring R and multiplicative subset S, the relation ∼ in Multiplicative subsets and the localisation S−1R as equivalence classes of fractions is an equivalence relation. The displayed addition and multiplication are independent of representatives and make S−1R a commutative ring with zero 0/1 and identity 1/1. The map λS(r)=r/1 is a unital ring homomorphism, and every s/1 with s∈S is a unit with inverse 1/s.

Facts & Assumptions

Given: A commutative ring R and a multiplicative subset S⊆R.

[F1]

A multiplicative subset contains 1, is closed under products, and localisation uses (r,s)∼(r′,s′) exactly when some u∈S satisfies u(rs′−r′s)=0 (Multiplicative subsets and the localisation S−1R as equivalence classes of fractions).

Proof

technique · direct construction
1.1

Reflexivity has witness 1, and symmetry uses the same witness with the negative equation. If u(rs′−r′s)=0 and v(r′s′′−r′′s′)=0, then uvs′∈S and the identity s′(rs′′−r′′s)=s′′(rs′−r′s)+s(r′s′′−r′′s′) shows uvs′(rs′′−r′′s)=0; hence the relation is transitive.

F1algebra
2.1

Suppose (r,s)∼(ρ,σ) with witness u. For fixed (a,t), multiplying the relation by t2 shows (rt+as,st)∼(ρt+aσ,σt), and multiplying it by at shows (ra,st)∼(ρa,σt). Changing the second representative in the same way proves both operations are well defined.

F1step 1.1algebra
3.1

Associativity, commutativity, and distributivity follow by expanding the displayed fraction formulas over common denominators. The classes 0/1 and 1/1 satisfy the zero and identity laws, and additive inverses are (−r)/s.

step 2.1algebra
4.1

The formulas give λS(r+r′)=λS(r)+λS(r′), λS(rr′)=λS(r)λS(r′), and λS(1)=1/1. Finally (s/1)(1/s)=s/s=1/1, since (s,s)∼(1,1) with witness 1.

F1step 2.1algebra∎

Depends on

Used by

Dependency tree · two levels

4 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