Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Intersection bound for an irreducible curve with a partial-derivative factor

Proved
PachDeZeeuw.Algebraic.factor_intersection_bound

by mysticflounder · Sep 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

bezoutintersection-boundspach-de-zeeuw-bezoutsingularities

Let hhh be an irreducible plane polynomial (hhh_hhh​) of total degree at most ddd, with a nonzero partial derivative hpi:pderiv i h≠0h_{pi} : \mathrm{pderiv}\,i\,h \ne 0hpi​:pderivih=0 for some i:Fin 2i : \mathrm{Fin}\,2i:Fin2, and let kkk be a normalized factor of that partial derivative (hk:k∈normalizedFactors (pderiv i h)h_k : k \in \mathrm{normalizedFactors}\,(\mathrm{pderiv}\,i\,h)hk​:k∈normalizedFactors(pderivih)) that is not associated to hhh (hnot:¬ Associated h kh_{\mathrm{not}} : \neg\,\mathrm{Associated}\,h\,khnot​:¬Associatedhk). Then the intersection of the two real zero sets is finite with an explicit bound:

(Z(h)∩Z(k)).Finite  ∧  ∣Z(h)∩Z(k)∣≤(d+1)4.(Z(h) \cap Z(k)).\mathrm{Finite} \;\land\; |Z(h) \cap Z(k)| \le (d+1)^4.(Z(h)∩Z(k)).Finite∧∣Z(h)∩Z(k)∣≤(d+1)4.

The factor kkk is irreducible with total degree at most ddd (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 d⋅dd \cdot dd⋅d), or both positive (primitive coprime curries, bound ((d+d)2+1)⋅d((d+d)^2+1) \cdot d((d+d)2+1)⋅d); each is at most (d+1)4(d+1)^4(d+1)4. The associated case is excluded by hnoth_{\mathrm{not}}hnot​, which partial_factor_not_associated supplies in the application. Every singular point of hhh lies in at least one such intersection Z(h)∩Z(k)Z(h) \cap Z(k)Z(h)∩Z(k) (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.

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.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
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#L1032-L1088
Human review
  • Endorsed by Shuze Chen · Sep 17, 2026

  • Endorsed by mysticflounder · Sep 17, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me