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

Equality, vanishing, and the kernel of the localisation map

Statement

Let R be a commutative ring and SR multiplicative. For r,rR and s,sS, rs=rsu(rsrs)=0 for some uS, and rs=0ur=0 for some uS. Consequently kerλS={rR:ur=0 for some uS}. The map λS is injective if and only if every uS has trivial annihilator. If R is nonzero, this is equivalent to 0S and no member of S being a zero divisor. Moreover, S1R is the zero ring if and only if 0S.

Facts & Assumptions

Given: A commutative ring R, a multiplicative subset S, and its localisation map λS.

[F1]

Fractions are precisely equivalence classes for the relation u(rsrs)=0 for some uS, and 0=0/1 (The localisation relation is an equivalence relation and fraction arithmetic is well defined).

[F2]

In a nonzero commutative ring, a zero divisor is a nonzero element annihilating some nonzero element; by convention, 0 itself is not called a zero divisor (Zero divisor, and integral domain: a commutative ring with 10 and no zero divisors).

Proof

technique · direct
1.1

The equality criterion is the definition of equality of equivalence classes. Taking (r,s)=(0,1) gives r/s=0/1 exactly when u(r10s)=ur=0 for some uS.

F1
2.1

If 0S, step 1.1 makes every fraction zero by using u=0. Conversely, if S1R is the zero ring, then 1/1=0, so step 1.1 gives uS with u1=0, whence u=0 and 0S.

step 1.1
2.2

Since λS(r)=r/1, step 1.1 gives the displayed kernel. Thus λS is injective exactly when ur=0 with uS always forces r=0, which says precisely that every member of S has trivial annihilator.

step 1.1
3.1

Assume R is nonzero. If every member of S has trivial annihilator, then 0S, because 01=0 and 10, and no uS is a zero divisor by [F2]. Conversely, if 0S and S contains no zero divisor, then uS is nonzero and ur=0 forces r=0 by [F2].

F2step 2.2

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 17 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