Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Factorized B\u00e9zout bound for curves with no common infinite factor

Proved
PachDeZeeuw.Algebraic.factorized_bezout_bound

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

bezoutfactorizationintersection-boundspach-de-zeeuw-bezout

Let ppp and qqq be nonzero plane polynomials (hp0:p≠0h_{p0} : p \neq 0hp0​:p=0, hq0:q≠0h_{q0} : q \neq 0hq0​:q=0) of total degrees at most d1d_1d1​ and d2d_2d2​, and assume they share no common irreducible factor with infinite real zero set (hnoinf:¬ HasCommonInfiniteIrreducibleFactor p qh_{\mathrm{noinf}} : \neg\,\mathrm{HasCommonInfiniteIrreducibleFactor}\,p\,qhnoinf​:¬HasCommonInfiniteIrreducibleFactorpq). Then their real zero sets meet in a finite set, with an explicit bound:

(Z(p)∩Z(q)).Finite  ∧  ∣Z(p)∩Z(q)∣≤(d1+d2+1)8.(Z(p) \cap Z(q)).\mathrm{Finite} \;\land\; |Z(p) \cap Z(q)| \le (d_1 + d_2 + 1)^8.(Z(p)∩Z(q)).Finite∧∣Z(p)∩Z(q)∣≤(d1​+d2​+1)8.

The proof covers Z(p)∩Z(q)Z(p) \cap Z(q)Z(p)∩Z(q) by the intersections Z(h)∩Z(k)Z(h) \cap Z(k)Z(h)∩Z(k) over pairs (h,k)(h, k)(h,k) of normalized factors of ppp and qqq, and bounds each pair by (d1+d2+1)5(d_1 + d_2 + 1)^5(d1​+d2​+1)5 in one of two branches. If hhh and kkk are associated (a shared irreducible factor, which the hypothesis allows when its real zero set is finite), then Z(h)=Z(k)Z(h) = Z(k)Z(h)=Z(k) and the bound comes from finite_real_zero_set_of_irreducible_factor_bound, that is, from the singularity count of hhh. If hhh and kkk are not associated, irreducible_pair_intersection_bound gives (d1+d2+1)4(d_1 + d_2 + 1)^4(d1​+d2​+1)4. The number of pairs is at most d1d2≤(d1+d2+1)2d_1 d_2 \le (d_1 + d_2 + 1)^2d1​d2​≤(d1​+d2​+1)2, which gives the eighth power. This lemma feeds directly into the existential bezout statement.

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.factorized_bezout_bound {d₁ : ℕ} {d₂ : ℕ} (p q : PlanePoly)
    (hp0 : p ≠ 0) (hq0 : q ≠ 0)
    (hpdeg : p.totalDegree ≤ d₁)
    (hqdeg : q.totalDegree ≤ d₂)
    (hnoinf : ¬ HasCommonInfiniteIrreducibleFactor p q) :
    (PlaneCurveZeroSet p ∩ PlaneCurveZeroSet q).Finite ∧
      (PlaneCurveZeroSet p ∩ PlaneCurveZeroSet q).ncard ≤
        (d₁ + d₂ + 1) ^ 8 := 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#L1179-L1319
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