Mathematics · Glossary

What is Derivative, multiplicity?

Also known as: multiplicity of a root

Definition 8.10 University Mathematics — Year 1 · Chapter 8 — Polynomials

The formal derivative of P=akXkP = \sum a_k X^k is P=k1kakXk1P' = \sum_{k \geq 1} k\,a_k X^{k-1}; it satisfies the usual rules (P+Q)=P+Q(P+Q)' = P' + Q', (PQ)=PQ+PQ(PQ)' = P'Q + PQ' (checked on monomials and extended by linearity). A root aa of PP has multiplicity m1m \geq 1 when (Xa)mP(X-a)^m \mid P but (Xa)m+1P(X-a)^{m+1} \nmid P; the root is simple if m=1m = 1, multiple if m2m \geq 2.

Examples

Example 8.12 (Computing a multiplicity)

What is the multiplicity of the root 22 in P=X45X3+6X2+4X8P = X^4 - 5X^3 + 6X^2 + 4X - 8? Evaluate the successive derivatives at 22:

P(2)=1640+24+88=0,P(2)=3260+24+4=0,P(2) = 16 - 40 + 24 + 8 - 8 = 0, \qquad P'(2) = 32 - 60 + 24 + 4 = 0,
P(2)=4860+12=0,P(2)=4830=180P''(2) = 48 - 60 + 12 = 0, \qquad P'''(2) = 48 - 30 = 18 \neq 0

(with P=4X315X2+12X+4P' = 4X^3 - 15X^2 + 12X + 4, P=12X230X+12P'' = 12X^2 - 30X + 12, P=24X30P''' = 24X - 30). Three vanishing values then a nonzero one: multiplicity exactly 33. Dividing, P=(X2)3(X+1)P = (X - 2)^3(X + 1) — which one checks by expanding (X2)3=X36X2+12X8(X-2)^3 = X^3 - 6X^2 + 12X - 8 and multiplying by X+1X + 1. 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: aa is a multiple root of PP iff it is a common root of PP and PP', so PP has a multiple root (in C\C) iff gcd(P,P)1\gcd(P, P') \neq 1 — computable by the Euclidean algorithm without solving anything. Sample: P=X33X+2P = X^3 - 3X + 2, P=3X23=3(X1)(X+1)P' = 3X^2 - 3 = 3(X - 1)(X + 1). Testing the roots ±1\pm1 of PP' inside PP: P(1)=0P(1) = 0 but P(1)=4P(-1) = 4, so

gcd(P,P)=X1:\gcd(P, P') = X - 1 :

the root 11 is multiple; dividing twice, P=(X1)2(X+2)P = (X - 1)^2(X + 2). 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

X4+4X^4 + 4 was factored over R\R in Exercise 3.5 by pairing the four complex roots ±1±i\pm 1 \pm \iu: X4+4=(X22X+2)(X2+2X+2)X^4 + 4 = (X^2 - 2X + 2)(X^2 + 2X + 2). Neither quadratic splits over R\R (discriminants 4-4). Note: an irreducible real polynomial has degree 11 or 22 — this is exactly what the factorization theorem says. The same conjugate-pairing run on X4+1X^4 + 1, whose roots are e±iπ/4\eu^{\pm\iu\pi/4} and e±3iπ/4\eu^{\pm3\iu\pi/4}: each pair contributes X22cosθX+1X^2 - 2\cos\theta\,X + 1, so

X4+1=(X22X+1)(X2+2X+1),X^4 + 1 = \bigl(X^2 - \sqrt2\,X + 1\bigr) \bigl(X^2 + \sqrt2\,X + 1\bigr) ,

an identity invisible to naive factoring attempts over Q\Q — the price of insisting on real (here even irrational) coefficients, and a standard input for integrating 1x4+1\frac1{x^4 + 1} in Chapter 15.

Read in context →