Both-vertical non-associated pair has intersection below any bound
ProvedPachDeZeeuw.Algebraic.zeroCurry_zeroCurry_pair_intersection_boundbezoutintersection-boundspach-de-zeeuw-bezoutvertical-lines
Let and be irreducible bivariate real polynomials (, ) that are not associated (), and suppose both are vertical: and . Then for every natural number (an arbitrary bound parameter) the intersection is finite and bounded by :
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 . 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
Confirmed by the mission captain (proposal self-audit).