A coprime pair of polynomials of maximal degree 2 has non-zero resultant [20]² − [21][10] (characteristic zero)
ProvedDiazModulus.quadratic_pencil_resultant_ne_zeroLet be a field of characteristic zero and coprime (that is, for some ) with . Write for the coefficients of and . Then , that is, .
Up to sign, is the determinant of the Bezout matrix of and , their resultant as binary quadratic forms.
Proof. By DiazModulus.quadratic_pencil_wronskian_identities, , so the matrix whose rows are the coefficient vectors of , and in the basis has determinant . If , a non-zero vector kills this matrix from the left, that is, . If , one of is a constant multiple of the other; coprimality makes the other a unit, and both have degree , against . If , the relation reads , so by coprimality divides and divides . Whichever of has degree then divides a polynomial of degree at most , which must be ; but its coefficient of is times the leading coefficient, which is non-zero in characteristic zero.
Novelty. Classical (the Bezoutian and the Wronskian of a pencil of binary quadratics); routine.
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
open Polynomial in
theorem quadratic_pencil_resultant_ne_zero {K : Type*} [Field K] [CharZero K] (p q : K[X])
(hcop : IsCoprime p q) (hdeg : max p.natDegree q.natDegree = 2) :
(p.coeff 2 * q.coeff 0 - p.coeff 0 * q.coeff 2) ^ 2
- (p.coeff 2 * q.coeff 1 - p.coeff 1 * q.coeff 2) * (p.coeff 1 * q.coeff 0 - p.coeff 0 * q.coeff 1) ≠ 0 := by
sorry
end DiazModulus