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.
Factor theorem over a commutative ring
Statement
Let be a commutative ring, , and . Then if and only if divides in .
More precisely, there is a unique such that .
Facts & Assumptions
Given: A commutative ring , an element , and a polynomial .
Division by the monic polynomial gives unique with and or (Division by a monic polynomial over a commutative ring).
Evaluation at is the finite coefficient sum defining (Evaluation and roots of a polynomial in a commutative target ring).
Evaluation at is a unital ring homomorphism and sends to (Universal property of : a coefficient homomorphism and the image of determine a unique ring homomorphism).
Proof
If is the zero ring then has one element, , and the conclusion holds with ; this case is separated because there, which has no leading coefficient and so is not monic, leaving [L1] inapplicable. Otherwise , so is monic of degree one. Apply [L1]; the remainder is zero or constant, and applying [L3] to gives , so .
If , step 1.1 gives ; conversely, if , applying [L3] gives , proving the biconditional.
Depends on
Used by
- A degree-four polynomial can be reducible over ℚ without having a rational root Counterexample
- Quadratics can have four roots over ℤ/6 and ℤ/8 Counterexample
- Repeated roots in extension fields and separable polynomials Definition
- A nonzero polynomial of degree n over an integral domain has at most n distinct roots Theorem
- A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field Theorem
- A root is repeated exactly when it is also a root of the formal derivative Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 26 results over 9 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.8 (standard reference, not scraped)
- Neil Donaldson, Math 120B Notes, Theorem 23.14 (standard reference, not scraped)