Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 1 (converse of the equality case): ∣Sym+(Cm,α)∣=2m|\mathrm{Sym}^+(C_{m,\alpha})|=2m∣Sym+(Cm,α​)∣=2m for m≥3m\ge3m≥3 and every nonreal α\alphaα

Proved
CurveSymmetry.paper_family_converse

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

algebraic-geometrycurve-symmetry-leaneuclidean-geometry

Let m≥3m\ge3m≥3 be an integer and let α∈C\alpha\in\mathbb Cα∈C with α∉R\alpha\notin\mathbb Rα∈/R; no condition is imposed on ∣α∣|\alpha|∣α∣. Let Cm,α={z∈C:Re⁡(zm(∣z∣2+α))=0}C_{m,\alpha}=\{z\in\mathbb C:\operatorname{Re}\bigl(z^m(|z|^2+\alpha)\bigr)=0\}Cm,α​={z∈C:Re(zm(∣z∣2+α))=0} as in equation (1), and let Sym+(Cm,α)\mathrm{Sym}^+(C_{m,\alpha})Sym+(Cm,α​) be the group of orientation-preserving Euclidean isometries z↦az+bz\mapsto az+bz↦az+b, ∣a∣=1|a|=1∣a∣=1, mapping Cm,αC_{m,\alpha}Cm,α​ onto itself.

Then there is a polynomial f∈R[x,y]f\in\mathbb R[x,y]f∈R[x,y] with the following properties:

  1. fff is irreducible in C[x,y]\mathbb C[x,y]C[x,y] and has total degree m+2m+2m+2;
  2. the real zero set of fff is Cm,αC_{m,\alpha}Cm,α​, that is, {z∈C:f(Re⁡z,Im⁡z)=0}=Cm,α\{z\in\mathbb C: f(\operatorname{Re}z,\operatorname{Im}z)=0\}=C_{m,\alpha}{z∈C:f(Rez,Imz)=0}=Cm,α​;
  3. Cm,αC_{m,\alpha}Cm,α​ is infinite;
  4. Cm,αC_{m,\alpha}Cm,α​ is not a circle: there are no c∈Cc\in\mathbb Cc∈C and real R>0R>0R>0 with Cm,α={z:∣z−c∣=R}C_{m,\alpha}=\{z:|z-c|=R\}Cm,α​={z:∣z−c∣=R};
  5. the group Sym+(Cm,α)\mathrm{Sym}^+(C_{m,\alpha})Sym+(Cm,α​) has order 2m=2deg⁡f−42m=2\deg f-42m=2degf−4:
∣Sym+(Cm,α)∣=2m.|\mathrm{Sym}^+(C_{m,\alpha})|=2m.∣Sym+(Cm,α​)∣=2m.

This is the converse in Theorem 1: every curve of the family (1) with m≥3m\ge3m≥3 satisfies the hypotheses of that theorem in degree d=m+2d=m+2d=m+2 and attains the rotation bound 2d−42d-42d−4. The statement requires only α∉R\alpha\notin\mathbb Rα∈/R, while the family in the note also has ∣α∣=1|\alpha|=1∣α∣=1.

Formalization Note: the curve is a subset of C\mathbb CC and Sym+(Cm,α)\mathrm{Sym}^+(C_{m,\alpha})Sym+(Cm,α​) is a subgroup of the group ℂ ≃ᵢ ℂ of isometric bijections; its order is Nat.card, so with 2m>02m>02m>0 finiteness is part of the conclusion.

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.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.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
Formal statement
theorem CurveSymmetry.paper_family_converse {m : ℕ} (hm : 3 ≤ m) {α : ℂ} (ha : α ≠ star α) :
    ∃ f : RPoly, GeometricallyIrreducible f ∧ f.totalDegree = m + 2 ∧
      cartesianLocus f = extremalCurve m α ∧ (cartesianLocus f).Infinite ∧
      (¬ ∃ c : ℂ, ∃ R : ℝ, 0 < R ∧ cartesianLocus f = Metric.sphere c R) ∧
      Nat.card (directIsometryGroup (cartesianLocus f)) = 2 * m := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note), Theorem 1, p. 1, https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/sharp_symmetry_bounds.pdf. Lean: https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/lean/PaperBounds.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