Degree bound on the coefficient resultant
ProvedPachDeZeeuw.Algebraic.degreeOf_resultant_lebezoutdegree-boundspach-de-zeeuw-bezoutresultants
Let and be bivariate real polynomials of total degrees bounded by and respectively (, ). Then the coefficient-degree of their coefficient resultant satisfies
Here 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
Confirmed by the mission captain (proposal self-audit).