Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Currys of nonassociated irreducibles are relatively prime

Proved
PachDeZeeuw.Algebraic.curry_isRelPrime_of_nonassociated_irreducibles

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

coprimalitypach-de-zeeuw-bezoutplane-curvesresultants

Let hhh and kkk be irreducible bivariate real polynomials that are not associated (¬ Associated h k\neg\,\mathrm{Associated}\,h\,k¬Associatedhk, i.e. they do not differ by a unit factor). Then their currys are relatively prime as univariate polynomials over the coefficient ring:

IsRelPrime(Curry0(h), Curry0(k)).\mathrm{IsRelPrime}(\mathrm{Curry}_0(h),\, \mathrm{Curry}_0(k)).IsRelPrime(Curry0​(h),Curry0​(k)).

This converts the geometric hypothesis 'distinct irreducible curves' into the algebraic coprimality hypothesis required for the resultant to be nonzero, and hence for the pair-intersection bound.

Preamble
import Mathlib
import Definitions.Def_PdzPrelim

open EuclideanGeometry
open scoped Topology
open PachDeZeeuw.Algebraic
open PachDeZeeuw.Algebraic.PlaneCurve
Formal statement
theorem PachDeZeeuw.Algebraic.curry_isRelPrime_of_nonassociated_irreducibles (h k : MvPolynomial (Fin 2) ℝ)
    (hh : Irreducible h) (hk : Irreducible k)
    (hnot : ¬ Associated h k) :
    IsRelPrime (Curry0 h) (Curry0 k) := 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#L1098-L1112
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