A scalar, often given as the determinant of a suitably constructed matrix (for two univariate polynomials the Sylvester matrix), that vanishes exactly when the input polynomials have a nontrivial common root in projective space. The resultant is an elimination object: it compresses the condition “exists x such that f(x)=g(x)=0” into a single polynomial expression in the coefficients.

Principle

Elimination by linear relations among shifted coefficient vectors: build a bilinear determinant whose vanishing is equivalent to the existence of a common root. Algebraically, the resultant is a polynomial in coefficients that encodes solvability of a polynomial system after eliminating the variable.

Demonstration

For two univariate polynomials f and g of degrees m and n, form the Sylvester matrix with m+n rows built from coefficient shifts; its determinant is the resultant Res(f,g). If g is linear, Res(f,g) reduces (up to a unit) to evaluating g at the roots of f, so the determinant vanishes precisely when the linear polynomial shares a root with f.

Misapplication

Using the resultant computed over a non-integral ring (for example a ring with zero divisors) without checking saturation can give false vanishing conclusions; treating numeric floating-point evaluation of a resultant as exact can lead to spurious common roots because of numerical instability and scale issues.

Consequence

A nonzero resultant certifies that the polynomials have no common root in an algebraic closure, while a zero resultant gives an algebraic condition to pursue (gcd computation, factor detection, or lifting of a root); resultants permit elimination-based algorithms for solving and deciding solvability.

Reversal

Instead of eliminating variables to obtain a scalar certificate of common roots, the inverse approach is to construct explicit common solutions or to compute a greatest common divisor: elimination gives existence information, whereas explicit factorization produces the actual shared root factors.

Boundary

Applies cleanly to univariate polynomials over integral domains and extends with care to multivariate resultants (Macaulay, sparse resultants). It does not directly give multiplicity structure without refinement and must be adapted when coefficients live in rings with torsion or are specialized.

Semantic Tension

Closely related to the gcd: both detect common factors, but the resultant is a single elimination polynomial in coefficients while the gcd is an explicit polynomial factor; one trades compressed existence information (resultant) for constructive factor data (gcd).

Synthesis

The resultant is an elimination determinant that encodes whether polynomials share roots: built from shifted coefficient relations (Sylvester-type constructions), it provides a single polynomial condition for solvability that complements gcd-based, factorization, and explicit-solution methods.