Motivation
A discriminant can reveal whether a polynomial has repeated roots and, in a separable extension, whether the trace pairing degenerates. But the product of squared differences of roots is awkward to calculate when the roots themselves are unknown. A resultant replaces those roots by a determinant built from the coefficients.
We will construct that determinant as a linear map, prove its common-root criterion, and relate it to multiplication by a derivative in a quotient algebra. This gives explicit formulas for the discriminant of quadratic and cubic polynomials, including a characteristic-two warning. The companion trace-pairing chapter already proves the power-basis product-of-differences formula; the new bridge here computes that product directly from coefficients using a resultant and explains the role of the derivative.
Throughout is a field, is monic of degree , and is nonzero of degree . Repeated roots and positive characteristic are allowed unless a statement says otherwise. An algebraic closure is used to express roots; the determinants themselves lie in .
A coefficient-space determinant
Let denote the space of polynomials of degree less than , with ordered basis . For it is the zero space. Define the linear map
Both domain and codomain have dimension . We define as the determinant of this map in the stated ordered bases, with the block before the block. This fixes the sign convention. When , the space is zero and a nonzero constant gives determinant .
Theorem 1.9.1
(The common-root criterion)
With the convention above, if and only if and have a common root in an algebraic closure of . Equivalently, their gcd in is nonconstant.
Proof
(Short relations and the gcd)
The determinant vanishes exactly when a nonzero pair satisfies . If and are coprime, then implies . Since , this forces ; then because . Hence the map is injective and its determinant is nonzero.
If a monic gcd has positive degree, write and . The pair is nonzero, has and , and maps to zero. Thus the determinant vanishes. A nonconstant gcd has a root in an algebraic closure; conversely a shared root makes the gcd nonconstant by Bézout's identity. This includes the constant- case, where the polynomials are coprime.
Proof X-ray
Why the degree bounds matter
The identity exists for any two polynomials, so it cannot by itself prove they share a factor. The constrained coefficient spaces forbid that trivial pair when the gcd is one. Removing a genuine common factor produces a relation short enough to fit the prescribed spaces.
Worked example 1.9.2
(Two linear polynomials)
Let and . In the ordered output basis , the columns of are the coefficients of and , so its matrix is
Its determinant is . It vanishes exactly when the two roots coincide. Reversing the two input blocks would instead change the sign, which is why the convention was stated explicitly.
From the determinant to the root product
Put , an -dimensional -algebra. Multiplication by the class of is a linear map . Even when is reducible or inseparable, the quotient algebra is well-defined and its multiplication determinant can be calculated in the power basis.
Theorem 1.9.3
(Resultant as a quotient-algebra determinant)
If is monic, then
where are the roots of in an algebraic closure, listed with multiplicity. If is irreducible and is the class of , this determinant is the field norm .
Proof
(Change of output basis and triangularization)
Divide every output polynomial of degree below uniquely by the monic . The ordered list
is a basis of the output space. Relative to the standard power basis its change-of-basis matrix is triangular with diagonal entries one, so it has determinant one. In this new basis the map sends to the remainder of modulo followed by plus the quotient of by . Its block matrix is
so the two determinants are equal. This proof works unchanged when .
For the root product, extend scalars to an algebraic closure. The companion operator has characteristic polynomial : its power-basis matrix is the companion matrix, whose determinant calculation gives . It can be triangularized over the algebraic closure, with diagonal entries the roots , counted with multiplicity. Therefore is triangular with diagonal entries , and its determinant is their product. Extending scalars does not alter a determinant. If is irreducible, is the field , so the determinant is the defining field norm.
Worked example 1.9.4
(A determinant without finding roots)
Take and over . In , multiplication by sends to and to . The matrix is , with determinant . Thus , agreeing with without requiring those roots to be in the base field.
Concept lensAlgebraic
Resultants eliminate a variable
Working over the field and replacing by gives
the characteristic polynomial of . It is a polynomial in with coefficients in that vanishes at for every root of : the resultant eliminates . For and above, it is , which indeed vanishes at .
An alternative computation by Euclidean division
When both and are monic, their root products also show the reciprocity identity
Indeed, writing the roots as and gives a product of on the left and of the opposite differences on the right. There are sign changes, counted with multiplicity. This identity needs both polynomials to be monic under our definition; for a nonmonic first argument the definition and leading-coefficient factors require additional care.
Suppose and divide , where . If , evaluate at every root of and apply the root formula with as the monic first argument. We obtain
If , the polynomials share the nonconstant factor , so the resultant is zero. The new first polynomial is still monic, but the new second polynomial need not be; the quotient-algebra definition permits that. To continue another Euclidean step after exchanging arguments, one must account for its leading coefficient rather than silently treating it as monic.
For an explicit calculation take and . Both are monic and . Since ,
Alternatively , and the second use of the formula gives the resultant of the monic linear polynomial and the constant , again equal to three. At each stage the sign comes from the degrees in that stage. This short calculation avoids expanding a five-by-five determinant and still gives an exact answer over the rational field.
The discriminant and the derivative
For a monic polynomial with roots counted with multiplicity, define its polynomial discriminant by
The root-product theorem gives a coefficient formula. If , interpret separately: the original determinant definition used a nonzero . For use the ordinary resultant above.
Theorem 1.9.5
(Discriminant as a derivative resultant)
For every monic of degree ,
It vanishes exactly when has a repeated root in an algebraic closure. If is irreducible and separable, it equals the discriminant of the power basis for .
Proof
(Pairing the factors of )
Write over an algebraic closure. The product rule gives , including when roots repeat. Multiplying over groups each unordered pair into
There are pairs, giving the displayed sign. If , the root-product side is zero for , and the same identity holds with the stated convention. A squared difference vanishes exactly when two roots agree. The final assertion is the companion trace-pairing theorem for a separable irreducible polynomial; no claim that a reducible quotient is a field is needed.
Worked example 1.9.6
(The quadratic formula works in every characteristic)
For , the two roots have sum and product , so
In characteristic two this becomes . Thus over has discriminant one and is separable, while over has discriminant zero. In characteristic two it is wrong to infer that every quadratic has zero discriminant.
Worked example 1.9.7
(The cubic )
Over , let and . Eisenstein at two makes irreducible. Since , the norm formula gives
The sign is , so . The norm of is two because the constant term of its monic cubic minimal polynomial is .
Worked example 1.9.8
(An inseparable derivative)
Over , is irreducible by Eisenstein at , but . Its discriminant is zero. The quotient is a field despite the vanishing discriminant: it is the extension that is inseparable, not the minimal polynomial that is reducible over .
Multiplicativity and a useful computation
For fixed monic , multiplication maps satisfy , even in a quotient with zero divisors. Determinants therefore give
This includes zero factors under the zero-resultant convention. For example, if , then . When the characteristic does not divide , the root-product formula gives
because the product of the roots is .
If the characteristic divides , the derivative is zero and the discriminant is zero for . This computation shows why checking the characteristic before dividing by is essential.
The quadratic Sylvester matrix
For a concrete coefficient calculation, suppose the characteristic is not two and set , . The three columns, in the stated order, are the coefficient vectors of , and . The Sylvester matrix and its determinant are
The discriminant has the opposite sign because , giving . This matrix method shows directly how a symmetric root expression becomes a polynomial in coefficients. In characteristic two the derivative is the constant instead, so its degree changes: when the determinant is , and when the zero-derivative convention gives zero. Treating as a degree-one polynomial in that characteristic would use the wrong coefficient-space dimensions.
The determinant is a convenient computational witness, but the structural theorem does more: it identifies the same scalar as a field norm whenever the quotient is a field. This identification connects explicit coefficient arithmetic with the Galois-theoretic invariants studied earlier.
Common mistakes
Common mistake
(Signs depend on the ordering convention)
The resultant determinant depends on an ordering convention; its zero set does not, but a signed formula does.
Common mistake
(A zero discriminant does not mean reducible)
A resultant of with its derivative being zero means a repeated root over an algebraic closure, not necessarily reducibility over .
Counterexample mode
A zero resultant need not give a common root in the base field
Claim: if , then and have a common root in . Over take and . In the class of is zero, so and ; equally . Yet the only common roots are , neither rational. The repair is the criterion as stated: a common root in an algebraic closure, equivalently a nonconstant gcd in , here .
Common mistake
(Field quotients and roots outside )
The quotient is a field only for irreducible ; the determinant proof itself works for any monic . Finally, the product of squared root differences is symmetric and lies in , even if the individual roots do not.
Practice
Quick check
(Find with the stated convention.)
Solution · Answer
It is .
Quick check
(What is for a nonzero constant and monic of degree ?)
Solution · Answer
It is , the determinant of scalar multiplication by on an -dimensional space.
Quick check
(Why is equivalent to a nonconstant gcd?)
Solution · Answer
A common factor produces a nonzero short relation between and ; Bézout's identity shows no such relation exists when they are coprime.
Quick check
(Compute the resultant of and over .)
Solution · Answer
It is , the determinant of multiplication by in the quadratic quotient.
Quick check
(Compute the discriminant of .)
Solution · Answer
It is , with the operations interpreted in the given field.
Quick check
(Is over separable?)
Solution · Answer
Yes. Its derivative is one, so it has no repeated root; its discriminant is one.
Quick check
(Why can be irreducible and have zero discriminant?)
Solution · Answer
Eisenstein proves irreducibility over , but the derivative is zero in characteristic , so roots repeat in an algebraic closure.
Quick check
(What is the relationship between the resultant and the norm when is irreducible?)
Solution · Answer
It is for a root of the irreducible monic .
Quick check
(Compute over .)
Solution · Answer
The derivative resultant is and the sign is negative, giving .
Quick check
(What changes if the and input blocks in the Sylvester map are swapped?)
Solution · Answer
Swapping blocks of sizes and multiplies the determinant by .
Quick check
(Why does factor as a product?)
Solution · Answer
Multiplication by is the composition of multiplication by and by , and determinants multiply.
Quick check
(Is the product-of-differences discriminant defined only when all roots lie in ?)
Solution · Answer
No. The roots may be taken in an algebraic closure; the determinant formula proves that their symmetric product lies in .