Intersection bound for an irreducible curve with a partial-derivative factor
ProvedPachDeZeeuw.Algebraic.factor_intersection_boundLet be an irreducible plane polynomial () of total degree at most , with a nonzero partial derivative for some , and let be a normalized factor of that partial derivative () that is not associated to (). Then the intersection of the two real zero sets is finite with an explicit bound:
The factor is irreducible with total degree at most (via normalized_factor_degree_le and totalDegree_pderiv_le), and the proof is the same three-way case split as in irreducible_pair_intersection_bound: both curries of degree zero (empty intersection), exactly one of degree zero (bound ), or both positive (primitive coprime curries, bound ); each is at most . The associated case is excluded by , which partial_factor_not_associated supplies in the application. Every singular point of lies in at least one such intersection (singularPointSet_subset_partial_factor_union), so this lemma is the per-factor input to the finiteness and bound for the singular locus in finite_singularities_of_irreducible_bound.
import Mathlib import Definitions.Def_PdzBezout import Definitions.Def_PdzPrelim open EuclideanGeometry open scoped Topology open PachDeZeeuw.Algebraic open PachDeZeeuw.Algebraic.PlaneCurve
theorem PachDeZeeuw.Algebraic.factor_intersection_bound {d : ℕ} (h : PlanePoly)
(hh : Irreducible h)
(hdeg : h.totalDegree ≤ d)
{i : Fin 2}
(hpi : MvPolynomial.pderiv i h ≠ 0)
{k : PlanePoly}
(hk : k ∈ UniqueFactorizationMonoid.normalizedFactors (MvPolynomial.pderiv i h))
(hnot : ¬ Associated h k) :
(PlaneCurveZeroSet h ∩ PlaneCurveZeroSet k).Finite ∧
(PlaneCurveZeroSet h ∩ PlaneCurveZeroSet k).ncard ≤ (d + 1) ^ 4 := by sorry
Confirmed by the mission captain (proposal self-audit).