PolynomialTraits_d::Resultant

Definition

This AdaptableBinaryFunction computes the resultant of two polynomials $$f and $$g of type PolynomialTraits_d::Polynomial_d with respect to a certain variable.

Note that this functor operates on the polynomial in the univariate view, that is, the polynomial is considered as a univariate polynomial in one specific variable.

Let $$f and $$g be two univariate polynomials over some commutative ring $$A, where

$$f = f_mX^m + ...+ f₀

and

$$g = g_nXⁿ + ...+ g₀.

The resultant of $$f and $$g is defined as the determinant of the Sylvester matrix:

Note that this is a $$(n+m) × (n+m) matrix as there are $$n rows for $$f and $$m rows that are used for $$g. The blanc spaces are supposed to be filled with zeros.

advanced

Let $$L be the algebraic closure of $$A, and write $$f and $$g as

$$f := f_{m i=1}^m(x-_i), _i L

and

$$g := g_{n j=1}ⁿ(x-_j), _i L,

then the resultant of $$f and $$g is (up to leading coefficients) the product of all pairwise differences of the roots of $$f and $$g, namely

$$res(f,g) = f_mⁿ g_n^m _i=1^m _j=1ⁿ(_i-_j).

advanced

In particular, $$res(f,g) 0 iff $$f and $$g have a common factor with a positive degree in $$X.

There are various ways to compute the resultant. Naive options are the computation of the resultant as the determinant of the Sylvester Matrix or the Bezout Matrix as well as the so called subresultant algorithm, which is a variant of the Euclidean Algorithm. More sophisticated methods may use modular arithmetic and interpolation. For more information we refer to, e.g., [vzGG99].

Refines

Types

Operations

See Also

Polynomial_d
PolynomialTraits_d
PolynomialTraits_d::UnivariateContent