Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A coprime pair of polynomials of maximal degree 2 has non-zero resultant [20]² − [21][10] (characteristic zero)

Proved
DiazModulus.quadratic_pencil_resultant_ne_zero

by carlok · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Let KKK be a field of characteristic zero and p,q∈K[X]p, q \in K[X]p,q∈K[X] coprime (that is, ap+bq=1ap + bq = 1ap+bq=1 for some a,b∈K[X]a, b \in K[X]a,b∈K[X]) with max⁡(deg⁡p,deg⁡q)=2\max(\deg p, \deg q) = 2max(degp,degq)=2. Write pi,qip_i, q_ipi​,qi​ for the coefficients of XiX^iXi and [ij]=piqj−pjqi[ij] = p_iq_j - p_jq_i[ij]=pi​qj​−pj​qi​. Then Res=[20]2−[21][10]≠0\mathrm{Res} = [20]^2 - [21][10] \neq 0Res=[20]2−[21][10]=0, that is, (p2q0−p0q2)2−(p2q1−p1q2)(p1q0−p0q1)≠0(p_2q_0 - p_0q_2)^2 - (p_2q_1 - p_1q_2)(p_1q_0 - p_0q_1) \neq 0(p2​q0​−p0​q2​)2−(p2​q1​−p1​q2​)(p1​q0​−p0​q1​)=0.

Up to sign, Res\mathrm{Res}Res is the determinant of the Bezout matrix of ppp and qqq, their resultant as binary quadratic forms.

Proof. By DiazModulus.quadratic_pencil_wronskian_identities, J=p′q−pq′=[21]X2+2[20]X+[10]J = p'q - pq' = [21]X^2 + 2[20]X + [10]J=p′q−pq′=[21]X2+2[20]X+[10], so the matrix whose rows are the coefficient vectors of qqq, ppp and JJJ in the basis (1,X,X2)(1, X, X^2)(1,X,X2) has determinant −2 Res-2\,\mathrm{Res}−2Res. If Res=0\mathrm{Res} = 0Res=0, a non-zero vector (v0,v1,v2)(v_0, v_1, v_2)(v0​,v1​,v2​) kills this matrix from the left, that is, v0q+v1p+v2J=0v_0q + v_1p + v_2J = 0v0​q+v1​p+v2​J=0. If v2=0v_2 = 0v2​=0, one of p,qp, qp,q is a constant multiple of the other; coprimality makes the other a unit, and both have degree 000, against max⁡(deg⁡p,deg⁡q)=2\max(\deg p, \deg q) = 2max(degp,degq)=2. If v2≠0v_2 \neq 0v2​=0, the relation reads (v2p′+v0)q=p(v2q′−v1)(v_2p' + v_0)q = p(v_2q' - v_1)(v2​p′+v0​)q=p(v2​q′−v1​), so by coprimality ppp divides v2p′+v0v_2p' + v_0v2​p′+v0​ and qqq divides v2q′−v1v_2q' - v_1v2​q′−v1​. Whichever of p,qp, qp,q has degree 222 then divides a polynomial of degree at most 111, which must be 000; but its coefficient of XXX is 2v22v_22v2​ 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.

Preamble
import Definitions.Def_DiazModulus
Formal statement
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
Source
Classical: the resultant of two binary quadratics (up to sign the determinant of their Bezout matrix) vanishes only when they have a common factor. Uses DiazModulus.quadratic_pencil_wronskian_identities. R20 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 23 October 2026 (C. Perassi).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me