Resultant nonzero for polynomials coprime over the fraction field
ProvedPachDeZeeuw.Algebraic.resultant_ne_zero_of_fraction_coprimefraction-fieldspach-de-zeeuw-bezoutresultants
Let and be univariate polynomials over the coefficient ring , and assume coprimality after base change to its fraction field, over . Then their resultant is nonzero:
This is the abstract resultant criterion: coprimality over a field (here the fraction field of the UFD ) forces a nonzero resultant, since the Sylvester determinant detects a common factor. It is the bridge from the fraction-field coprimality obtained via primitivity lemmas to the concrete nonvanishing of the resultant polynomial whose roots are then counted.
Preamble
import Mathlib import Definitions.Def_PdzPrelim open EuclideanGeometry open scoped Topology open PachDeZeeuw.Algebraic open PachDeZeeuw.Algebraic.PlaneCurve
Formal statement
theorem PachDeZeeuw.Algebraic.resultant_ne_zero_of_fraction_coprime (P Q : Polynomial XCoeff)
(hcop : IsCoprime (P.map (algebraMap XCoeff XFrac))
(Q.map (algebraMap XCoeff XFrac))) :
Polynomial.resultant P Q ≠ 0 := 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#L356-L380
Human review
Confirmed by the mission captain (proposal self-audit).