2.3 Multiple roots
Even when polynomials in have no common factor in , one might expect that they could acquire a common factor in for some . In fact, this doesn’t happen — greatest common divisors don’t change when the field is extended.
Let and be polynomials in , and let be an extension of . If is the gcd of and computed in , then it is also the gcd of and in . In particular, distinct monic irreducible polynomials in do not acquire a common root in any extension of
Let and be the greatest common divisors of and in and respectively. Certainly in , but Euclid’s algorithm (1.8) shows that there are polynomials and in such that
and so divides in .
For the second statement, note that the hypotheses imply that (in ), and so and can’t acquire a common factor in any extension field. □
The proposition allows us to speak of the greatest common divisor of and without reference to a field.
Let . Then splits into linear factors
in for some extension of (see 2.4). We say that is a root of of multiplicity in . If , then is said to be a multiple root of , and otherwise it is a simple root.
I claim that the unordered sequence of integers in (4) is independent of the extension chosen to split . Certainly, it is unchanged when is replaced with its subfield , and so we may suppose that is a splitting field for . Let and be splitting fields for , and suppose that in and in . Let be an -isomorphism, which exists by (2.7b), and extend it to an isomorphism by sending to . Then maps the factorization of in onto a factorization
in . By unique factorization, this coincides with the earlier factorization in up to a renumbering of the . Therefore , and
We say that has a multiple root when at least one of the , and that has only simple roots when all . Thus “ has a multiple root” means “ has a multiple root in one, hence every, extension of splitting ”, and similarly for has only simple roots”.
We wish to determine when a polynomial has a multiple root. If has a multiple factor in , say with some , then obviously it will have a multiple root. If with the distinct monic irreducible polynomials, then Proposition 2.10 shows that has a multiple root if and only if at least one of the has a multiple root. Thus, it suffices to determine when an irreducible polynomial has a multiple root.
Let be of characteristic , and assume that contains an element that is not a th-power, for example, in the field Then is irreducible in , but by 1.4 we have in its splitting field. Thus an irreducible polynomial can have multiple roots.
The derivative of a polynomial is defined to be . The usual rules for differentiating sums and products still hold, but note that in characteristic the derivative of is zero.
For a nonconstant irreducible polynomial in , the following statements are equivalent:
-
(a)
has a multiple root;
-
(b)
;
-
(c)
has nonzero characteristic and is a polynomial in ;
-
(d)
all the roots of are multiple.
(a) (b). Let be a multiple root of , and write , , in some extension field. Then
Hence and have as a common factor.
(b) (c). As is irreducible and ,
Let , . Then , which is the zero polynomial if only if has characteristic and for all not divisible by .
(c) (d). By hypothesis, with . Let in some extension field. Then each becomes a th power, say, , in some possibly larger extension field. Now
which shows that every root of has multiplicity at least .
(d) (a). Obvious. □
The following conditions on a nonzero polynomial are equivalent:
-
(a)
in ;
-
(b)
has only simple roots.
Let be an extension of splitting . From (5), p. 5, we see that a root of in is multiple if and only if it is also a root of .
If , then and have no common factor in (see 2.10). In particular, they have no common root, and so has only simple roots.
If has only simple roots, then must be the constant polynomial, because otherwise it would have a root in which would then be a common root of and . □
A polynomial is separable if it is nonzero and satisfies the equivalent conditions on (2.13).11 1 This is Bourbaki’s definition. Often (e.g., in the books of Jacobson and in earlier versions of these notes) a polynomial is said to be separable if each of its irreducible factors has only simple roots.
Thus a nonconstant irreducible polynomial is not separable if and only if has characteristic and is a polynomial in (see 2.12). Let with and the monic and the irreducible; then is separable if and only if the are distinct and separable. If is separable as a polynomial in , then it is separable as a polynomial in for every extension of .
A field is perfect if it has characteristic zero or it has characteristic and every every element of is a th power.
Thus, is perfect if and only if , where is the characteristic exponent of .
A field is perfect if and only if every irreducible polynomial in is separable.
If has characteristic zero, the statement is obvious, and so we may suppose has characteristic . If contains an element that is not a th power, then is irreducible in but not separable (see 2.11). Conversely, if every element of is a th power, then every polynomial in with coefficients in is a th power in ,
and so it is not irreducible. □
-
(a)
A finite field is perfect, because the Frobenius endomorphism is injective and therefore surjective (by counting).
-
(b)
A field that can be written as a union of perfect fields is perfect. Therefore, every field algebraic over is perfect.
-
(c)
Every algebraically closed field is perfect.
-
(d)
If has characteristic , then is not perfect, because is not a th power.
Let be a perfect field. We’ll see later (LABEL:ag1) that every finite extension is simple, i.e., with a root of a (separable) polynomial of degree . Thus it follows directly from (2.2b) that, for any extension of , the number of -homomorphisms is , with equality if and only if splits in . We can’t use this argument here because it would make the exposition circular.