The formal derivative of is ; it satisfies the usual rules , (checked on monomials and extended by linearity). A root of has multiplicity when but ; the root is simple if , multiple if .
Examples
Example 8.12 (Computing a multiplicity)
What is the multiplicity of the root in ? Evaluate the successive derivatives at :
(with , , ). Three vanishing values then a nonzero one: multiplicity exactly . Dividing, — which one checks by expanding and multiplying by . The insight: multiplicities are read off evaluations, no factorization needed — which is exactly how one detects them when the factorization is out of reach.
Example 8.13 (Detecting multiple roots with a gcd)
When no root is known, Proposition 8.11 still gives a global multiple-root detector: is a multiple root of iff it is a common root of and , so has a multiple root (in ) iff — computable by the Euclidean algorithm without solving anything. Sample: , . Testing the roots of inside : but , so
the root is multiple; dividing twice, . The gcd even reports the full set of multiple roots, each with multiplicity lowered by one — the fact every computer-algebra system exploits to “square-free factorize” before any root-hunting, and the polynomial twin of Exercise 8.9’s no-multiple-root arguments.
Example 8.17
was factored over in Exercise 3.5 by pairing the four complex roots : . Neither quadratic splits over (discriminants ). Note: an irreducible real polynomial has degree or — this is exactly what the factorization theorem says. The same conjugate-pairing run on , whose roots are and : each pair contributes , so
an identity invisible to naive factoring attempts over — the price of insisting on real (here even irrational) coefficients, and a standard input for integrating in Chapter 15.