Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (openai/gpt-5.4)audited 2026-07-24
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.

Integer multiplication is well defined

Statement

The operation [(a,b)]⋅[(c,d)]=[(ac+bd, ad+bc)] on Z (Arithmetic on the integers) is independent of the chosen representatives.

Facts & Assumptions

Given: Pairs with (a,b)∼(a′,b′) and (c,d)∼(c′,d′) in the sense of The integers as equivalence classes of pairs of naturals.

[A1]

Addition on N is commutative and associative.

[A2]

Multiplication on N is commutative.

[A3]

Distributivity in N: x(y+z)=xy+xz.

Proof

technique · direct
1.1given

By hypothesis a+b′=b+a′; write s for this common value.

1.2A1A2A3

Regrouping and factoring: (ac+bd)+(a′d+b′c)=c(a+b′)+d(b+a′).

1.3A1A2A3

Regrouping and factoring: (ad+bc)+(a′c+b′d)=d(a+b′)+c(b+a′).

2.1step 1.1step 1.2step 1.3

By step 1.1 both right-hand sides equal cs+ds, so (ac+bd)+(a′d+b′c)=(ad+bc)+(a′c+b′d).

3.1step 2.1

That equation is precisely the defining relation (ac+bd, ad+bc)∼(a′c+b′d, a′d+b′c): the product class is unchanged when the first factor's representative changes.

4.1step 3.1A1A2

The product formula is symmetric in its two arguments: swapping (a,b)↔(c,d) sends (ac+bd, ad+bc) to (ca+db, cb+da), the same pair. Hence, by the argument of steps 1.1–3.1 applied to the second factor, the product class is also unchanged when (c,d) is replaced by (c′,d′).

5.1step 3.1step 4.1∎

Replacing first (a,b) by (a′,b′) and then (c,d) by (c′,d′): [(a,b)]⋅[(c,d)]=[(a′,b′)]⋅[(c,d)]=[(a′,b′)]⋅[(c′,d′)]; multiplication is well defined.

Depends on

Dependency tree · 2 levels

Sources