Coprime primitive curries never specialize both to zero
ProvedPachDeZeeuw.Algebraic.not_both_specializations_zero_of_isRelPrimeLet and be bivariate real polynomials, let be a coefficient coordinate, and assume the curried forms are relatively prime, . The statement also carries primitivity hypotheses on the curries (binders _hpprim and _hqprim ); they are present in the statement but not used by the proof. Then the two specialized univariate polynomials at do not both vanish:
The proof shows that if both specializations vanished, the line factor would divide both and , hence its curry would divide both curries and would be a unit by ; but that factor has a nonzero coefficient of positive degree, so it is not a unit. In the resultant/fiber-counting argument this guarantees that, over each coefficient value , the common zeros are roots of a nonzero univariate polynomial.
import Mathlib import Definitions.Def_PdzPrelim open EuclideanGeometry open scoped Topology open PachDeZeeuw.Algebraic open PachDeZeeuw.Algebraic.PlaneCurve
theorem PachDeZeeuw.Algebraic.not_both_specializations_zero_of_isRelPrime (p q : MvPolynomial (Fin 2) ℝ) (x : ℝ)
(_hpprim : (Curry0 p).IsPrimitive)
(_hqprim : (Curry0 q).IsPrimitive)
(hrel : IsRelPrime (Curry0 p) (Curry0 q)) :
Specialized0 x p ≠ 0 ∨ Specialized0 x q ≠ 0 := by sorry
Confirmed by the mission captain (proposal self-audit).