Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Below degree 2m2m2m, a polynomial with P(ζX,ζ−1Y)=−P(X,Y)P(\zeta X,\zeta^{-1}Y)=-P(X,Y)P(ζX,ζ−1Y)=−P(X,Y) has the form XmA(XY)+YmB(XY)X^mA(XY)+Y^mB(XY)XmA(XY)+YmB(XY)

Proved
CurveSymmetry.anti_radial_form

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

algebraic-geometrycurve-symmetry-leanfunction-fields

Let m≥1m\ge 1m≥1 be an integer and let ζ∈C\zeta\in\mathbb Cζ∈C be a primitive 2m2m2m-th root of unity. Let P(X,Y)=∑a,b≥0pabXaYb∈C[X,Y]P(X,Y)=\sum_{a,b\ge 0}p_{ab}X^aY^b\in\mathbb C[X,Y]P(X,Y)=∑a,b≥0​pab​XaYb∈C[X,Y] be a polynomial of total degree d<2md<2md<2m that changes sign under the substitution (X,Y)↦(ζX,ζ−1Y)(X,Y)\mapsto(\zeta X,\zeta^{-1}Y)(X,Y)↦(ζX,ζ−1Y), that is, P(ζX,ζ−1Y)=−P(X,Y)P(\zeta X,\zeta^{-1}Y)=-P(X,Y)P(ζX,ζ−1Y)=−P(X,Y). Collect the coefficients of PPP of weight a−b=ma-b=ma−b=m and of weight a−b=−ma-b=-ma−b=−m into two polynomials in one variable sss: A(s)=∑k≥0pk+m, k skA(s)=\sum_{k\ge 0}p_{k+m,\,k}\,s^kA(s)=∑k≥0​pk+m,k​sk and B(s)=∑k≥0pk, k+m skB(s)=\sum_{k\ge 0}p_{k,\,k+m}\,s^kB(s)=∑k≥0​pk,k+m​sk.

Then

P(X,Y)=Xm A(XY)+Ym B(XY),P(X,Y)=X^m\,A(XY)+Y^m\,B(XY),P(X,Y)=XmA(XY)+YmB(XY),

and both degrees are bounded: deg⁡A≤⌊(d−m)/2⌋\deg A\le\lfloor (d-m)/2\rfloordegA≤⌊(d−m)/2⌋ and deg⁡B≤⌊(d−m)/2⌋\deg B\le\lfloor (d-m)/2\rfloordegB≤⌊(d−m)/2⌋.

This is the algebraic core of equation (5) of the note. In the coordinates X=zX=zX=z, Y=zˉY=\bar zY=zˉ the substitution is the rotation z↦ζzz\mapsto\zeta zz↦ζz; in the proof of Theorem 1, a rotation of order 2m2m2m larger than the degree satisfies equation (4) with sign −1-1−1, and the statement shows that only the weights a−b=±ma-b=\pm ma−b=±m can then occur. The refinement for irreducible polynomials with conjugate-symmetric coefficients, giving P=XmA(XY)+YmA‾(XY)P=X^mA(XY)+Y^m\overline{A}(XY)P=XmA(XY)+YmA(XY) with AAA nonconstant, is derived from it.

Formalization Note: degrees are natural numbers, with deg⁡0=0\deg 0=0deg0=0, and ⌊(d−m)/2⌋\lfloor (d-m)/2\rfloor⌊(d−m)/2⌋ is computed in N\mathbb NN, where d−md-md−m is truncated at 000.

Preamble
import Definitions.Def_CurveSymmetry_01_RealLoci
import Definitions.Def_CurveSymmetry_02_FamilyBasics
import Definitions.Def_CurveSymmetry_05_FamilyFunctionField
import Mathlib.Algebra.MvPolynomial.Nilpotent
import Mathlib.Algebra.MvPolynomial.NoZeroDivisors
import Mathlib.Algebra.Polynomial.FieldDivision
import Mathlib.Algebra.Polynomial.Reverse
import Mathlib.Analysis.Complex.Isometry
import Mathlib.Analysis.Complex.Polynomial.Basic
import Mathlib.Analysis.Normed.Affine.MazurUlam
import Mathlib.Data.Complex.Basic
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

open CurveSymmetry
set_option autoImplicit false
open MvPolynomial
Formal statement
theorem CurveSymmetry.anti_radial_form {m : ℕ} (hm : 0 < m) {ζ : ℂ} (hζ : IsPrimitiveRoot ζ (2 * m))
    {P : BPoly} (hdeg : P.totalDegree < 2 * m) (hanti : rotate ζ P = -P) :
    P = (X 0 : BPoly) ^ m * Polynomial.aeval ((X 0 : BPoly) * X 1) (weightPolynomial P m) +
        (X 1 : BPoly) ^ m *
          Polynomial.aeval ((X 0 : BPoly) * X 1) (oppositeWeightPolynomial P m) ∧
      (weightPolynomial P m).natDegree ≤ (P.totalDegree - m) / 2 ∧
      (oppositeWeightPolynomial P m).natDegree ≤ (P.totalDegree - m) / 2 := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, for proof of Theorem 1, equation (5), 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/RadialAntiForm.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