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.
Exact gcd squarefree decomposition preserves roots and multiplicities
Statement
Let be nonzero of degree , and put , so is monic. Set and, recursively, let be the monic greatest common divisor of and for , with . For , put and put . Then each is a monic polynomial in , the are squarefree and pairwise coprime, and
The complex roots of are exactly the roots of having multiplicity . In particular, is squarefree and has exactly the distinct roots of . For , the product is empty and has no roots.
Here a polynomial is called squarefree when each of its complex roots has multiplicity one.
Facts & Assumptions
Given: A nonzero rational polynomial , its degree , and the definitions in the Statement.
The rationals form a field (The rationals form a totally ordered field).
Division by a nonzero polynomial over a field has a unique quotient and remainder of smaller degree (Division algorithm for polynomials over a field).
Formal differentiation is linear and satisfies the product rule; the derivative of a degree- monomial is (Linearity, power rule, Leibniz rule and the degree bound for the formal derivative).
Every nonconstant complex polynomial has a complex root (Fundamental theorem of algebra by Liouville's theorem).
A polynomial vanishing at is divisible by (Factor theorem over a commutative ring).
Degrees add under products of nonzero polynomials over a field (Over an integral domain, degrees add under multiplication of nonzero polynomials).
The complex numbers form a field containing the rationals ( is a field, every element is uniquely , and every nonzero element has inverse ).
The monic gcd is the unique monic common divisor divisible by every common divisor; Euclidean division terminates at its nonzero scalar associate and yields a polynomial Bezout identity. The monic greatest common divisor of two polynomials over a field, Bézout identity and the Euclidean algorithm for polynomials over a field
For polynomials over a base field that are not both zero, their monic gcd is unchanged on extending the coefficient field. The monic gcd of two base-field polynomials is unchanged after extending the coefficient field
Proof
By [F8], the monic gcd is constructed by Euclidean division over , and the divisions terminate: each nonzero remainder has smaller nonnegative integer degree than the divisor by [F2]. The same argument defines ; if , then and has smaller degree by [F3] and characteristic zero, so . Thus , and each is a polynomial.
By [F4], repeated application of [F5] factors over : , where the finite list contains each distinct root once and . The induction is finite because each division by lowers degree by one by [F6].
Fix a current polynomial in the gcd chain and a root of multiplicity , so with . The product rule [F3] gives , whose parenthesized factor is nonzero at because the field has characteristic zero. Hence the gcd of and has multiplicity exactly at ; a root absent from is absent from their gcd. By [F9] for the field extension , the monic gcd computed over is exactly the monic gcd over . Thus this root-multiplicity computation applies to each .
Induction on now shows that the multiplicity of in is . Therefore occurs once in exactly when , and it occurs in exactly when . This root factorization proves divides over ; division over has the same zero remainder, so lies in .
Each complex root of occurs in exactly one , with exponent one there and exponent in . The factorization in step 1.2 therefore gives ; it also proves that each is squarefree and that distinct have no common root, hence are pairwise coprime. The degree-zero case has and an empty root list.
Depends on
- The monic greatest common divisor of two polynomials over a field
- Bézout identity and the Euclidean algorithm for polynomials over a field
- The monic gcd of two base-field polynomials is unchanged after extending the coefficient field
- The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution
- The formal derivative of a polynomial
- Division algorithm for polynomials over a field
- Over an integral domain, degrees add under multiplication of nonzero polynomials
- Fundamental theorem of algebra by Liouville's theorem
- Linearity, power rule, Leibniz rule and the degree bound for the formal derivative
- Factor theorem over a commutative ring
- The rationals form a totally ordered field
- $\mathbb C=\mathbb R[x]/(x^2+1)$ is a field, every element is uniquely $a+bi$, and every nonzero element has inverse $(a-bi)/(a^2+b^2)$
Used by
- Exact dyadic Sturm isolation of all real roots of a nonzero rational polynomial Algorithm
- A double polynomial root has no sign change Example
- An explicit root-separation bound for squarefree integer polynomials Lemma
- Exact Sturm bisection isolates every distinct real root of a nonzero rational polynomial Theorem
Dependency tree · two levels
42 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
- Colm Ó Dúnlaing, Mathematics 1263: Introduction to Numerical Analysis, §2 (standard reference, not scraped)
- Marc Moreno Maza, Tutorial on real root isolation of polynomial systems, §§2–3 (standard reference, not scraped)