Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

An irreducible polynomial in XYXYXY is a nonzero multiple of XY−rXY-rXY−r

Proved
CurveSymmetry.irreducible_radial_form

by carlok · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

curve-symmetry-leaneuclidean-geometryreal-algebraic-geometry

Let P=∑a,b≥0pabXaYb∈C[X,Y]P=\sum_{a,b\ge 0}p_{ab}X^aY^b\in\mathbb C[X,Y]P=∑a,b≥0​pab​XaYb∈C[X,Y] be irreducible in C[X,Y]\mathbb C[X,Y]C[X,Y] and radial, meaning that pab≠0p_{ab}\ne 0pab​=0 only when a=ba=ba=b, so that PPP is a polynomial in XYXYXY. Then there exist c,r∈Cc,r\in\mathbb Cc,r∈C with c≠0c\ne 0c=0 such that

P=c (XY−r).P=c\,(XY-r).P=c(XY−r).

In the proof of Theorem 1, when a rotation of order greater than the degree fixes the equation, every exponent has a=ba=ba=b and P=R(XY)P=R(XY)P=R(XY); this is the step at which irreducibility forces RRR to be linear.

Preamble
import Definitions.Def_CurveSymmetry_01_RealLoci
import Mathlib.Algebra.MvPolynomial.Nilpotent
import Mathlib.Algebra.MvPolynomial.NoZeroDivisors
import Mathlib.Analysis.Complex.Polynomial.Basic
import Mathlib.Data.Complex.Basic
import Mathlib.RingTheory.MvPolynomial.Homogeneous
import Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
import Mathlib.Tactic

open CurveSymmetry
set_option autoImplicit false
open MvPolynomial
Formal statement
theorem CurveSymmetry.irreducible_radial_form {P : BPoly} (hirr : Irreducible P)
    (hdiag : ∀ s ∈ P.support, s 0 = s 1) :
    ∃ a r : ℂ, a ≠ 0 ∧ P = C a * ((X 0 : BPoly) * X 1 - C r) := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, for proof of Theorem 1, p. 3, https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/sharp_symmetry_bounds.pdf. Lean: https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/lean/Irreducibility.lean (C. Perassi)

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