Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Both-vertical non-associated pair has intersection below any bound

Proved
PachDeZeeuw.Algebraic.zeroCurry_zeroCurry_pair_intersection_bound

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

bezoutintersection-boundspach-de-zeeuw-bezoutvertical-lines

Let hhh and kkk be irreducible bivariate real polynomials (hhh_hhh​, hkh_khk​) that are not associated (hnoth_{not}hnot​), and suppose both are vertical: hdeg0:(Curry0 h).natDegree=0h_{deg0} : (\mathrm{Curry0}\,h).\mathrm{natDegree} = 0hdeg0​:(Curry0h).natDegree=0 and kdeg0:(Curry0 k).natDegree=0k_{deg0} : (\mathrm{Curry0}\,k).\mathrm{natDegree} = 0kdeg0​:(Curry0k).natDegree=0. Then for every natural number BBB (an arbitrary bound parameter) the intersection is finite and bounded by BBB:

(PlaneCurveZeroSet h∩PlaneCurveZeroSet k).Finite∧(PlaneCurveZeroSet h∩PlaneCurveZeroSet k).ncard≤B.{(\mathrm{PlaneCurveZeroSet}\,h \cap \mathrm{PlaneCurveZeroSet}\,k).\mathrm{Finite} \land (\mathrm{PlaneCurveZeroSet}\,h \cap \mathrm{PlaneCurveZeroSet}\,k).\mathrm{ncard} \leq B.}(PlaneCurveZeroSeth∩PlaneCurveZeroSetk).Finite∧(PlaneCurveZeroSeth∩PlaneCurveZeroSetk).ncard≤B.

Since each curve is a union of vertical lines and the two line families are disjoint (a shared line would make the irreducibles associated), the intersection is actually empty, hence below any BBB. This vacuous-but-uniform case closes the both-vertical branch of the irreducible pair-intersection case split with a bound that composes with the other branches.

Preamble
import Mathlib
import Definitions.Def_PdzPrelim

open EuclideanGeometry
open scoped Topology
open PachDeZeeuw.Algebraic
open PachDeZeeuw.Algebraic.PlaneCurve
Formal statement
theorem PachDeZeeuw.Algebraic.zeroCurry_zeroCurry_pair_intersection_bound (h k : MvPolynomial (Fin 2) ℝ)
    {B : ℕ}
    (hh : Irreducible h) (hk : Irreducible k)
    (hnot : ¬ Associated h k)
    (hdeg0 : (Curry0 h).natDegree = 0)
    (kdeg0 : (Curry0 k).natDegree = 0) :
    (PlaneCurveZeroSet h ∩ PlaneCurveZeroSet k).Finite ∧
      (PlaneCurveZeroSet h ∩ PlaneCurveZeroSet k).ncard ≤ B := 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#L1305-L1318
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