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

Multiplication is commutative

Statement

For all m,n∈N: m⋅n=n⋅m.

Facts & Assumptions

Given: multiplication (Multiplication of natural numbers).

[L1]

0⋅k=0 for all k∈N (Zero and one under multiplication).

[L2]

The successor-left law σ(n)⋅m=n⋅m+m (Distributivity and the successor law for multiplication).

[L3]

The induction principle (The principle of mathematical induction).

Proof

technique · induction on $n$, with $m$ fixed
1.1

Base n=0: m⋅0=0 and 0⋅m=0 by [L1], so m⋅0=0⋅m.

baseL1
1.2

Inductive hypothesis: m⋅n=n⋅m.

ih
2.1

Step: m⋅σ(n)=m⋅n+m=n⋅m+m=σ(n)⋅m, using the multiplication recursion, the hypothesis, then the successor-left law [L2].

step 1.2L2
3.1

By induction [L3], m⋅n=n⋅m for all n, hence for all m,n∈N.

step 1.1step 2.1discharge-induction∎

Depends on

Used by

Dependency tree · two levels

13 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