From Encyclopedia of Mathematics
Revision as of 17:14, 7 February 2011 by (talk) (Importing text file)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

of two polynomials and

The element of the field defined by the formula:


where is the splitting field of the polynomial (cf. Splitting field of a polynomial), and are the roots (cf. Root) of the polynomials


respectively. If , then the polynomials have a common root if and only if the resultant equals zero. The following equality holds:

The resultant can be written in either of the following ways:


The expressions (1)–(3) are inconvenient for computing the resultant, since they contain the roots of the polynomials. Using the coefficients of the polynomials, the resultant can be expressed in the form of the following determinant of order :


This determinant contains in the first rows the coefficients of the polynomial , and in the last rows the coefficients of the polynomial , and in the free spaces there are zeros.

The resultant of two polynomials and with numerical coefficients can be represented in the form of a determinant of order (or ). For this one has to find the remainders from the division of by , . Let these be


The discriminant of the polynomial

can be expressed by the resultant of the polynomial and its derivative in the following way:

Application to solving a system of equations.

Let there be given a system of two algebraic equations with coefficients from a field :


The polynomials and are written as polynomials in :

and according to formula (4) the resultant of these polynomials (as polynomials in ) is calculated. This yields a polynomial that depends only on :

One says that the polynomial is obtained by eliminating from the polynomials and . If and is a solution of the system (5), then , and, conversely, if , then either the polynomials or have a common root (which must be looked for among the roots of their greatest common divisor), or . Solving system (5) is thereby reduced to the computation of the roots of the polynomial and of the common roots of the polynomials and in one indeterminate.

By analogy, systems of equations with any number of unknowns can be solved; however, this problem leads to extremely cumbersome calculations (see also Elimination theory).


[1] A.G. Kurosh, "Higher algebra" , MIR (1972) (Translated from Russian)
[2] L.Ya. Okunev, "Higher algebra" , Moscow-Leningrad (1979) (In Russian)
[3] B.L. van der Waerden, "Algebra" , 1–2 , Springer (1967–1971) (Translated from German)
[4] W.V.D. Hodge, D. Pedoe, "Methods of algebraic geometry" , 1–3 , Cambridge Univ. Press (1947–1954)



[a1] S. Lang, "Algebra" , Addison-Wesley (1984)
How to Cite This Entry:
Resultant. Encyclopedia of Mathematics. URL:
This article was adapted from an original article by I.V. Proskuryakov (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article