Every normalized factor of is irreducible
ProvedPachDeZeeuw.Algebraic.normalized_factor_irreduciblefactorizationpach-de-zeeuw-bezoutunique-factorization
Let and be bivariate real polynomials and let witness that belongs to the multiset of normalized prime factors of . Then is irreducible:
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
Confirmed by the mission captain (proposal self-audit).