PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (200)
Orphanage
Unclass'd
Unproven (511)
Corrections (9)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Very high Entry average rating: No information on entry rating
resultant (Definition)

If $ p$ and $ q$ are two polynomials over a commutative ring with identity which can be factored into linear factors

$\displaystyle p(x) = a_0 (x - r_1) (x - r_2) \cdots (x - r_m)$
$\displaystyle q(x) = b_0 (x - s_1) (x - s_2) \cdots (x - s_n)$
then the resultant $ R(f,g)$ of $ f$ and $ g$ is defined as
$\displaystyle R(p,q) = a_0^n b_0^m \prod_{i=1}^m \prod_{j=1}^n (r_i - s_j)$

From the definition, it is clear that the resultant will equal zero if and only if $ p$ and $ q$ have at least one common root. By grouping together factors, we may also rewrite the resultant as

$\displaystyle R(p,q) = a_0^n \prod_{i=1}^m q(r_i)$
or
$\displaystyle R(p,q) = (-1)^{mn} b_0^m \prod_{j=1}^n p(s_j)$

Since the resultant is a symmetric function of the roots of the polynomials $ p$ and $ q$, it can be expressed as a polynomial in the coefficients of $ p$ and $ q$. This allows one to extend the definition to the case where $ p$ and $ q$ do not factor. An explicit formula for the resultant as a determinant was given by Sylvester. Suppose that

$\displaystyle p(x) = a_0 x^m + a_1 x^{m-1} + \cdots + a_{m-1} x + a_m$
and
$\displaystyle q(x) = a_0 x^n + b_1 x^{n-1} + \cdots + b_{n-1} x + b_n$
Then $ R(p,q)$ can be expressd as an $ (m+n) \times (m+n)$ determinant:
$\displaystyle \left\vert \begin {matrix} a_0 & a_1 & a_2 & \ldots & a_m & 0 & \... .... & . \cr 0 & 0 & . & . & . & . & . & b_n \cr \end{matrix} \right\vert = R(p,q)$
To construct this determinant, one first lists the coefficients of $ p$, padded with zeros at the end, then constructs subsequent rows by shifting one column to the right each time until one runs out of zeros at the end, then one repeats the same procedure with $ q$.

Resultants are very useful for solving simultaneous systems of polynomial equations. Suppose that one has a system of two equations $ f(x,y) = 0, g(x,y) = 0$. Then $ f$ and $ g$ can be regarded as polynomials in $ x$ whose coefficients are functions of $ y$. One can then form the resultant by computing the determinant of a matrix as above. Since the coefficients were polynomials in $ y$, the resultant will be a polynomial in $ y$. In order for the two equations to have a solution, the resultant must equal zero; hence setting the resultant equal to zero gives an equation for the $ y$ values of solutions of the system. Once one solves for these $ y$ values, one can substitute them back in to the original equations and solve for the corresponding $ x$ values. In other words, the resultant allows one to eliminate a variable from a system of equations. For this reason, resultants are also known as eliminants.

By using resultants to eliminate variables repeatedly one variable at a time, one solve systems of equations in more than two unknowns.

References

S
SYLVESTER, J.J, A Method of Determining By Mere Inspection the Derivatives from Two Equations of Any Degree, Phil. Mag. 16 (1840) pp. 132-135.



"resultant" is owned by Mathprof. [ full author list (3) | owner history (3) ]
(view preamble)

View style:

Other names:  eliminant

Attachments:
example of resultant (1) (Example) by rspuzio
example of resultant (2) (Example) by rspuzio
derivation of Sylvester's matrix for the resultant (Derivation) by rspuzio
proof that Sylvester's matrix equals the resultant (Definition) by rspuzio
Log in to rate this entry.
(view current ratings)

Cross-references: variable, solution, matrix, equations, right, column, rows, determinant, coefficients, function, symmetric, root, clear, factors, identity, commutative ring, polynomials
There are 8 references to this entry.

This is version 14 of resultant, born on 2004-09-17, modified 2006-08-02.
Object id is 6181, canonical name is Resultant.
Accessed 7227 times total.

Classification:
AMS MSC: 13P10 (Commutative rings and algebras :: Computational aspects of commutative algebra :: Polynomial ideals, Gröbner bases)
Pending Errata and Addenda
None.
[ View all 5 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)