A polynomial can vanish at a point more than once: this means a power of its linear factor divides the polynomial, not simply that two different substitutions give zero. The formal derivative provides an algebraic test that works without limits, even over a finite field. We first test roots in the stated field, then explain what the gcd detects about irreducible factors.
The formal derivative and a repeated root
Definition 7.1.1
(Formal derivative)
For , the formal derivative is
Here means repeated addition in , so in characteristic a coefficient divisible by becomes zero.
Distributivity and the coefficient formula for multiplication prove ; this is a polynomial identity, not a theorem about limits. A root has multiplicity at least two when .
Proposition 7.1.2
(Repeated-root criterion)
Let be nonzero and . Then if and only if .
Proof
(Product rule one way, factor theorem the other)
If , the product rule gives . Conversely, if , the factor theorem gives . Then , so . If also , the factor theorem gives , proving .
The same proof applies to roots in a field extension. The zero polynomial is excluded when speaking of a finite root multiplicity. In words, is a repeated root of exactly when .
Worked example 7.1.3
(A repeated root over the rationals)
Over , let . Its derivative is , and direct factorization gives
The monic gcd is : the repeated root is 1, while is a simple root because . The derivative helps locate repetition; it does not replace checking that a candidate is a root of .
Common mistake
(A zero derivative value is not a repeated root)
Over , take . Then and , but is not a root of at all, since . The criterion needs both conditions and ; the second alone says nothing about whether is a root.
Square-freeness over and
Definition 7.1.4
(Square-free polynomial)
A nonzero polynomial is square-free over if no nonconstant polynomial square divides it in .
Theorem 7.1.5
(Square-free if and only if the gcd with the derivative is 1)
Let or , and let be nonconstant. Then is square-free exactly when .
Proof
(A repeated factor divides ; a simple factor cannot)
Factor into distinct monic irreducibles over . If some , differentiating the product shows every term in contains ; thus divides both and . Conversely suppose each . For each ,
Here : in characteristic zero this follows from its positive degree; over , if , all nonzero exponents are multiples of , so for a positive-degree polynomial (coefficients in satisfy ), contradicting irreducibility. Since , the irreducible does not divide , and it divides none of the other distinct . Irreducibility makes it prime in , so it does not divide their product. Hence no irreducible factor of divides , and the gcd is 1.
Proof X-ray
Where the coefficient field enters
The direction from a repeated factor to a common divisor is a pure computation and holds in every field. The converse is where the hypothesis on is spent. Reducing modulo kills every term except the one that differentiates itself, so the whole argument reduces to the single claim . In characteristic zero, positive degree gives it. Over it needs two facts: forces to be a polynomial in , and the Frobenius identity on coefficients turns that into a th power , which irreducibility forbids. The degree comparison then finishes: a nonzero polynomial of smaller degree cannot be divisible by .
This proof states its coefficient fields deliberately. It does not claim the same square-free/gcd equivalence over every field of characteristic .
Counterexample mode
An irreducible polynomial with zero derivative
Claim: for every square-free over every field. Let be the field of rational functions in and take . It is irreducible over : a root would give with nonzero, but the left side has even degree and the right side odd degree. So is square-free. Yet , so . The proof above fails exactly at the claim : the coefficient field does not satisfy , and has no square root in it. Over a field containing , is not square-free.
Worked example 7.1.6
(A repeated factor found by the gcd over )
Over , let . Then , and indeed . The polynomial has no root in , hence is irreducible, and so is (its discriminant is not a square modulo 3), so the two quadratics are different irreducibles. Therefore : the repeated factor is , while is simple. Dividing by gives , a square-free polynomial with the same irreducible factors.
Characteristic changes the calculation
Worked example 7.1.7
(Zero derivative over a field of characteristic two)
Over , take . Its formal derivative is zero, because the coefficients 4 and 2 vanish in the field. Indeed
Thus is not square-free and is the monic polynomial itself. A zero derivative does not mean that is the zero polynomial: its coefficients at and are nonzero. In characteristic zero, by contrast, forces to be constant.
Quick check
(Is square-free over ?)
Compute the derivative and a gcd, or factor the polynomial.
Solution · Answer
No. It equals , and , so .
Quick check
(Show that is square-free over .)
Compute in characteristic 5.
Solution · Answer
in , a nonzero constant, so and is square-free by the theorem. Concretely, has five distinct roots.
Quick check
(Over , find for , and decide whether is square-free.)
Remember that in .
Solution · Answer
, a nonzero constant, so and is square-free.