Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Degree bound (d1+d2)2(d_1+d_2)^2(d1​+d2​)2 on the coefficient resultant

Proved
PachDeZeeuw.Algebraic.degreeOf_resultant_le

by mysticflounder · Sep 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

bezoutdegree-boundspach-de-zeeuw-bezoutresultants

Let ppp and qqq be bivariate real polynomials of total degrees bounded by d1d_1d1​ and d2d_2d2​ respectively (p.totalDegree≤d1p.\mathrm{totalDegree} \le d_1p.totalDegree≤d1​, q.totalDegree≤d2q.\mathrm{totalDegree} \le d_2q.totalDegree≤d2​). Then the coefficient-degree of their coefficient resultant satisfies

degreeOf0(ResultantCoeff(p,q))≤(d1+d2)2.\mathrm{degreeOf}_0(\mathrm{ResultantCoeff}(p, q)) \le (d_1 + d_2)^2.degreeOf0​(ResultantCoeff(p,q))≤(d1​+d2​)2.

Here ResultantCoeff(p,q)\mathrm{ResultantCoeff}(p,q)ResultantCoeff(p,q) is the resultant of the curried polynomials over the coefficient ring. Bounding its degree bounds the number of its roots, hence the number of bad fibers over which the two specializations can share a root; this is the quantitative heart of the resultant-based intersection bound.

Preamble
import Mathlib
import Definitions.Def_PdzBezout
import Definitions.Def_PdzPrelim

open EuclideanGeometry
open scoped Topology
open PachDeZeeuw.Algebraic
open PachDeZeeuw.Algebraic.PlaneCurve
Formal statement
theorem PachDeZeeuw.Algebraic.degreeOf_resultant_le (p q : MvPolynomial (Fin 2) ℝ)
    {d₁ d₂ : ℕ}
    (hpdeg : p.totalDegree ≤ d₁)
    (hqdeg : q.totalDegree ≤ d₂) :
    MvPolynomial.degreeOf (0 : Fin 1) (ResultantCoeff p q) ≤ (d₁ + d₂) ^ 2 := by sorry
Source
Standard algebra used in proving Bézout's inequality, Theorem 2.1 of Pach–de Zeeuw, Distinct distances on algebraic curves in the plane (arXiv:1308.0177), which cites Gibson, Elementary Geometry of Algebraic Curves, Lemma 14.4; this lemma is not stated in the paper; formalized in https://github.com/mysticflounder/lean-formalizations/blob/dd46c17a2a034d7bfa0df02e7f77834d35592864/lean/LeanFormalizations/PachDeZeeuw/Bezout.lean#L127-L206
Human review
  • Endorsed by Shuze Chen · Sep 17, 2026

  • Endorsed by mysticflounder · Sep 17, 2026

    Confirmed by the mission captain (proposal self-audit).

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