Formal Derivative - Application To Finding Repeated Factors

Application To Finding Repeated Factors

As in calculus, the derivative detects multiple roots: if R is a field then R is a Euclidean domain, and in this situation we can define multiplicity of roots; namely, for every polynomial f(x) and every element r of R, there exists a nonnegative integer m_r and a polynomial g(x) such that

where g(r) is not equal to 0. m_r is the multiplicity of r as a root of f. It follows from the Leibniz rule that in this situation, m_r is also the number of differentiations that must be performed on f(x) before r is not a root of the resulting polynomial. The utility of this observation is that although in general not every polynomial of degree n in R has n roots counting multiplicity (this is the maximum, by the above theorem), we may pass to field extensions in which this is true (namely, algebraic closures). Once we do, we may uncover a multiple root that was not a root at all simply over R. For example, if R is the field with three elements, the polynomial

has no roots in R; however, its formal derivative is zero since 3 = 0 in R and in any extension of R, so when we pass to the algebraic closure it has a multiple root that could not have been detected by factorization in R itself. Thus, formal differentiation allows an effective notion of multiplicity. This is important in Galois theory, where the distinction is made between separable field extensions (defined by polynomials with no multiple roots) and inseparable ones.