Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

A nonzero polynomial of degree nn over an integral domain has at most nn distinct roots

Statement

Let DD be an integral domain. A nonzero polynomial fD[x]f\in D[x] of degree nn has at most nn distinct roots in DD.

Facts & Assumptions

Given: An integral domain DD and a nonzero polynomial fD[x]f\in D[x] of degree nn.

[L1]

If aa is a root of ff, then f=(xa)qf=(x-a)q for some polynomial qq (Factor theorem over a commutative ring).

[L2]

Degrees add when nonzero polynomials over a domain are multiplied (Over an integral domain, degrees add under multiplication of nonzero polynomials).

[L3]

In an integral domain, a product is zero only if one factor is zero (Zero divisor, and integral domain: a commutative ring with 101 \ne 0 and no zero divisors).

[L4]

If a property holds at 00 and passes from nn to n+1n+1, it holds for every natural number (The principle of mathematical induction).

Proof

technique · induction
1.1

If n=0n=0, then ff is a nonzero constant and has no root, proving the base case.

basegiven
2.1

For n>0n>0, if ff has no root the claim is immediate; otherwise choose a root aa, use [L1] to write f=(xa)qf=(x-a)q, and use [L2] to obtain degq=n1\deg q=n-1.

step 1.1ihL1L2choose
3.1

If bab\ne a is another root, then 0=f(b)=(ba)q(b)0=f(b)=(b-a)q(b), and [L3] gives q(b)=0q(b)=0 because ba0b-a\ne0; the induction hypothesis bounds the roots other than aa by n1n-1, so ff has at most nn roots, and [L4] completes the induction.

step 2.1ihL3L4discharge-induction

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 37 results over 14 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