Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Every normalized factor of ppp is irreducible

Proved
PachDeZeeuw.Algebraic.normalized_factor_irreducible

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

factorizationpach-de-zeeuw-bezoutunique-factorization

Let ppp and hhh be bivariate real polynomials and let hhh_hhh​ witness that hhh belongs to the multiset normalizedFactors p\mathrm{normalizedFactors}\,pnormalizedFactorsp of normalized prime factors of ppp. Then hhh is irreducible:

Irreducible h.{\mathrm{Irreducible}\,h.}Irreducibleh.

This packages the unique-factorization-domain fact that normalized factors are (prime, hence) irreducible elements, licensing the application of all irreducible-case lemmas --- fiber bounds, pair-intersection bounds, nonzero-partial results --- to each factor when decomposing a reducible curve for the factorized Bezout 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.normalized_factor_irreducible {p h : MvPolynomial (Fin 2) ℝ}
    (hh : h ∈ UniqueFactorizationMonoid.normalizedFactors p) :
    Irreducible h := 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#L1413-L1418
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