Math 2.0

Commutative algebra Proof

Proof of the derivative test for repeated roots

Builds on Commutative ringFormal derivativeMultiplicity of a rootFactor theoremEvaluation homomorphismRoot of a polynomial

Proof

Let RR be a commutative ring, let f∈R[x]f \in R[x] with f≠0f \neq 0 and let c∈Rc \in R. For h∈R[x]h \in R[x], h′h' is the formal derivative.

  1. The formal derivative is additive, and (rh)′=rh′(r h)' = r h' for r∈Rr \in R. Both follow from the definition, since it acts on each coefficient separately.
  2. We show that ((x−c)g)′=g+(x−c)g′((x - c) g)' = g + (x - c) g' for every g∈R[x]g \in R[x]. Write g=∑k=0nbkxkg = \sum_{k=0}^{n} b_k x^k.
  3. Then (x−c)g=∑k=0nbkxk+1−∑k=0ncbkxk(x - c) g = \sum_{k=0}^{n} b_k x^{k+1} - \sum_{k=0}^{n} c b_k x^k. By the definition and step 1, its derivative is ∑k=0n(k+1)bkxk−∑k=1nkcbkxk−1\sum_{k=0}^{n} (k + 1) b_k x^k - \sum_{k=1}^{n} k c b_k x^{k-1}.
  4. Also g′=∑k=1nkbkxk−1g' = \sum_{k=1}^{n} k b_k x^{k-1}. So g+(x−c)g′=∑k=0nbkxk+∑k=1nkbkxk−∑k=1nckbkxk−1g + (x - c) g' = \sum_{k=0}^{n} b_k x^k + \sum_{k=1}^{n} k b_k x^k - \sum_{k=1}^{n} c k b_k x^{k-1}.
  5. The first two sums of step 4 add to ∑k=0n(k+1)bkxk\sum_{k=0}^{n} (k + 1) b_k x^k, since (k+1)bk=bk+kbk(k + 1) b_k = b_k + k b_k. Also c(kbk)=k(cbk)c (k b_k) = k (c b_k). So steps 3 and 4 give the same polynomial.
  6. The evaluation homomorphism at cc sends x−cx - c to 00. So step 2 gives ((x−c)g)′(c)=g(c)((x - c) g)'(c) = g(c) for every g∈R[x]g \in R[x].
  7. Suppose cc has multiplicity at least 22. Then (x−c)2(x - c)^2 divides ff, say f=(x−c)2hf = (x - c)^2 h with h∈R[x]h \in R[x].
  8. Evaluating at cc gives f(c)=0⋅h(c)=0f(c) = 0 \cdot h(c) = 0.
  9. Put g=(x−c)hg = (x - c) h, so that f=(x−c)gf = (x - c) g. By step 6, f′(c)=g(c)=(c−c)h(c)=0f'(c) = g(c) = (c - c) h(c) = 0.
  10. Conversely, suppose f(c)=0f(c) = 0 and f′(c)=0f'(c) = 0. By the factor theorem, f=(x−c)gf = (x - c) g with g∈R[x]g \in R[x].
  11. By step 6, g(c)=f′(c)=0g(c) = f'(c) = 0. By the factor theorem again, g=(x−c)hg = (x - c) h with h∈R[x]h \in R[x].
  12. So f=(x−c)2hf = (x - c)^2 h, and (x−c)2(x - c)^2 divides ff. Since the multiplicity is the largest mm with (x−c)m(x - c)^m dividing ff, it is at least 22.

Idea

If f=(x−c)gf = (x - c) g, the product rule gives f′=g+(x−c)g′f' = g + (x - c) g', so f′(c)=g(c)f'(c) = g(c). Thus f′(c)=0f'(c) = 0 says exactly that cc is also a root of the cofactor gg, which means that x−cx - c divides ff a second time.

Reading path

To understand this page from the ground up, read these 20 pages in order. The foundations come first. The path takes the proofs Proof of the remainder theorem, Proof of the factor theorem.

Show the path as a graph
Group, concept, no evidence levelGroupconceptRing, definition, no evidence levelRingdefinitionCommutative ring, definition, no evidence levelCommutative ringdefinitionPolynomial ring, definition, no evidence levelPolynomial ringdefinitionRing homomorphism, definition, no evidence levelRing homomorphismdefinitionDivisibility in a commutative ring, definition, no evidence levelDivisibility in a com…definitionDegree of a polynomial, definition, no evidence levelDegree of a polynomialdefinitionFormal derivative, definition, no evidence levelFormal derivativedefinitionPolynomial evaluation, definition, no evidence levelPolynomial evaluationdefinitionLeading coefficient, definition, no evidence levelLeading coefficientdefinitionEvaluation homomorphism, definition, no evidence levelEvaluation homomorphi…definitionRoot of a polynomial, definition, no evidence levelRoot of a polynomialdefinitionMonic polynomial, definition, no evidence levelMonic polynomialdefinitionProof of the remainder theorem, proof, no evidence levelProof of the remainde…proofMultiplicity of a root, definition, no evidence levelMultiplicity of a rootdefinitionDivision algorithm for polynomials, statement, no evidence levelDivision algorithm fo…statementRemainder theorem, statement, no evidence levelRemainder theoremstatementProof of the factor theorem, proof, no evidence levelProof of the factor t…proofFactor theorem, statement, no evidence levelFactor theoremstatementProof of the derivative test for repeated roots, proof, no evidence levelProof of the derivati…proof
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Group concept
  2. Ring definition
  3. Commutative ring definition
  4. Polynomial ring definition
  5. Ring homomorphism definition
  6. Divisibility in a commutative ring definition
  7. Degree of a polynomial definition
  8. Formal derivative definition
  9. Polynomial evaluation definition
  10. Leading coefficient definition
  11. Evaluation homomorphism definition
  12. Root of a polynomial definition
  13. Monic polynomial definition
  14. Proof of the remainder theorem proof
  15. Multiplicity of a root definition
  16. Division algorithm for polynomials statement
  17. Remainder theorem statement
  18. Proof of the factor theorem proof
  19. Factor theorem statement
  20. Proof of the derivative test for repeated roots proof

Where this leads

18 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Formal_derivative
About this page
TagTANAFVY929
URIm2://TANAFVY929
Kindproof
WritingW0 stub
MSC13F20
ProvesRepeated roots and the derivative
UsesCommutative ring, Formal derivative, Multiplicity of a root, Factor theorem, Evaluation homomorphism, Root of a polynomial
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.