Resultant — Definition, Formula & Examples
The resultant is a single number computed from two polynomials that equals zero if and only if the polynomials share a common root. In the context of vectors, the resultant is the single vector obtained by adding two or more vectors together.
Given polynomials of degree and of degree , their resultant is the determinant of the Sylvester matrix formed from the coefficients of and . The resultant vanishes precisely when and have a common factor of positive degree.
Key Formula
Where:
- = Coefficients of polynomial f(x) of degree n
- = Coefficients of polynomial g(x) of degree m
How It Works
For polynomials, you arrange the coefficients of and into the Sylvester matrix: the first rows contain shifted copies of the coefficients of , and the next rows contain shifted copies of the coefficients of . Computing the determinant of this matrix gives the resultant. If , the two polynomials share at least one common root. If , they have no root in common.
Worked Example
Problem: Determine whether f(x) = x² − 5x + 6 and g(x) = x² − 4x + 4 share a common root by computing their resultant.
Step 1: Both polynomials have degree 2, so the Sylvester matrix is 4×4. Write the coefficients: f has (1, −5, 6) and g has (1, −4, 4).
Step 2: Compute the determinant of S by cofactor expansion or row reduction.
Step 3: Verify: f(x) = (x−2)(x−3) and g(x) = (x−2)², so they share the root x = 2.
Answer: The resultant is 0, confirming the polynomials share the common root .
Why It Matters
The resultant lets you detect common roots of two polynomials without actually solving either one. This technique appears in elimination theory, where you remove a variable from a system of polynomial equations, and it is used in computer algebra systems and engineering applications such as finding intersections of curves.
Common Mistakes
Mistake: Confusing the resultant (a scalar from the Sylvester determinant) with the GCD of two polynomials.
Correction: The resultant tells you whether a common factor exists (it equals zero when one does), but it does not tell you what that common factor is. Use the Euclidean algorithm to find the actual GCD.
