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 over an integral domain has at most distinct roots
Statement
Let be an integral domain. A nonzero polynomial of degree has at most distinct roots in .
Facts & Assumptions
Given: An integral domain and a nonzero polynomial of degree .
If is a root of , then for some polynomial (Factor theorem over a commutative ring).
Degrees add when nonzero polynomials over a domain are multiplied (Over an integral domain, degrees add under multiplication of nonzero polynomials).
In an integral domain, a product is zero only if one factor is zero (Zero divisor, and integral domain: a commutative ring with and no zero divisors).
If a property holds at and passes from to , it holds for every natural number (The principle of mathematical induction).
Proof
If , then is a nonzero constant and has no root, proving the base case.
For , if has no root the claim is immediate; otherwise choose a root , use [L1] to write , and use [L2] to obtain .
If is another root, then , and [L3] gives because ; the induction hypothesis bounds the roots other than by , so has at most roots, and [L4] completes the induction.
Depends on
Used by
- Every finite subgroup of the unit group of an integral domain is cyclic Corollary
- Over an infinite integral domain, equal polynomial functions come from equal polynomials Corollary
- Quadratics can have four roots over ℤ/6 and ℤ/8 Counterexample
- Formal polynomials are not the functions they induce Remark
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
- Thomas W. Judson, Abstract Algebra: Theory and Applications, Corollary 17.9 (standard reference, not scraped)
- Neil Donaldson, Math 120B Notes, Theorem 23.14 (standard reference, not scraped)