Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Pα=Xm(α+XY)+Ym(αˉ+XY)P_\alpha=X^m(\alpha+XY)+Y^m(\bar\alpha+XY)Pα​=Xm(α+XY)+Ym(αˉ+XY) has degree exactly m+1m+1m+1 in each variable

Proved
CurveSymmetry.family_degreeOf

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

algebraic-geometrycurve-symmetry-leaneuclidean-geometry

Let m≥1m\ge1m≥1 be an integer and let α∈C\alpha\in\mathbb Cα∈C be arbitrary. Consider the polynomial of equation (6), Pα(X,Y)=Xm(α+XY)+Ym(αˉ+XY)∈C[X,Y]P_\alpha(X,Y)=X^m(\alpha+XY)+Y^m(\bar\alpha+XY)\in\mathbb C[X,Y]Pα​(X,Y)=Xm(α+XY)+Ym(αˉ+XY)∈C[X,Y]; in the coordinates X=zX=zX=z, Y=zˉY=\bar zY=zˉ it satisfies Pα(z,zˉ)=2Re⁡(zm(∣z∣2+α))P_\alpha(z,\bar z)=2\operatorname{Re}\bigl(z^m(|z|^2+\alpha)\bigr)Pα​(z,zˉ)=2Re(zm(∣z∣2+α)).

Then the degree of PαP_\alphaPα​ in each of the two variables separately equals m+1m+1m+1:

deg⁡XPα=deg⁡YPα=m+1.\deg_X P_\alpha=\deg_Y P_\alpha=m+1.degX​Pα​=degY​Pα​=m+1.

This is the degree count behind the statement after equation (6) that the closure VαV_\alphaVα​ of the curve Pα=0P_\alpha=0Pα​=0 in P1×P1\mathbb P^1\times\mathbb P^1P1×P1 has bidegree (m+1,m+1)(m+1,m+1)(m+1,m+1). In the formalization these separate degree bounds, rather than a bound on the total degree, show that a nonzero polynomial divisible by PαP_\alphaPα​ and of degree at most m+1m+1m+1 in each variable is a scalar multiple of PαP_\alphaPα​; this gives the proportionality of Möbius pullbacks used in the proof of Theorem 2.

Formalization Note: the degree in one variable is Mathlib's MvPolynomial.degreeOf, and the statement is made for both variables of MvPolynomial (Fin 2) ℂ.

Preamble
import Definitions.Def_CurveSymmetry_01_RealLoci
import Definitions.Def_CurveSymmetry_02_FamilyBasics
import Definitions.Def_CurveSymmetry_03_IsometriesAndCharts
import Mathlib.Algebra.MvPolynomial.Nilpotent
import Mathlib.Algebra.MvPolynomial.NoZeroDivisors
import Mathlib.Algebra.MvPolynomial.PDeriv
import Mathlib.Algebra.Polynomial.FieldDivision
import Mathlib.Algebra.Polynomial.Reverse
import Mathlib.Analysis.Complex.Isometry
import Mathlib.Analysis.Complex.OperatorNorm
import Mathlib.Analysis.Complex.Polynomial.Basic
import Mathlib.Analysis.Normed.Affine.MazurUlam
import Mathlib.Data.Complex.Basic
import Mathlib.FieldTheory.Separable
import Mathlib.RingTheory.MvPolynomial.Homogeneous
import Mathlib.RingTheory.MvPolynomial.IrreducibleQuadratic
import Mathlib.RingTheory.Polynomial.Eisenstein.Criterion
import Mathlib.RingTheory.Polynomial.GaussLemma
import Mathlib.RingTheory.RootsOfUnity.Complex
import Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
import Mathlib.Tactic
import Mathlib.Topology.Compactification.OnePoint.ProjectiveLine

open CurveSymmetry
set_option autoImplicit false
open MvPolynomial
open OnePoint
Formal statement
theorem CurveSymmetry.family_degreeOf {m : ℕ} (hm : 0 < m) (α : ℂ) (i : Fin 2) :
    (familyPolynomial m α).degreeOf i = m + 1 := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note), Section 3, closure of equation (6), 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/FamilyBidegree.lean (C. Perassi)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by carlok · Oct 7, 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