Root count of nonzero bounded by r.\mathrm{totalDegree
ProvedPachDeZeeuw.Algebraic.ncard_coeff_roots_le_totalDegreepach-de-zeeuw-bezoutreal-algebraic-geometryunivariate-bounds
Let be a nonzero univariate coefficient polynomial, with hypothesis , and let be its set of real roots. Then the number of distinct real roots is bounded by the total degree:
This is the univariate root bound in coefficient-ring form: a nonzero polynomial over the integral domain has at most roots. It is the key quantitative input that turns finiteness of coefficient-root sets (e.g. roots of resultants) into explicit numerical bounds feeding the fiber-counting and pair-intersection estimates.
Preamble
import Mathlib import Definitions.Def_PdzPrelim open EuclideanGeometry open scoped Topology open PachDeZeeuw.Algebraic open PachDeZeeuw.Algebraic.PlaneCurve
Formal statement
theorem PachDeZeeuw.Algebraic.ncard_coeff_roots_le_totalDegree (r : XCoeff) (hr : r ≠ 0) :
(CoeffRootSet r).ncard ≤ r.totalDegree := 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/AlgebraicPrelim.lean#L800-L838
Human review
Confirmed by the mission captain (proposal self-audit).