Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The Euclidean symmetry group of Cm,αC_{m,\alpha}Cm,α​ has exactly 2m2m2m elements

Proved
CurveSymmetry.family_isometry_card

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

algebraic-geometrycurve-symmetry-leanzariski-topology

Let m≥2m\ge 2m≥2 be an integer, let α∈C\alpha\in\mathbb{C}α∈C satisfy ∣α∣=1|\alpha|=1∣α∣=1 and α≠αˉ\alpha\ne\bar\alphaα=αˉ (so α\alphaα is not real), and 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}. Let Sym(Cm,α)\mathrm{Sym}(C_{m,\alpha})Sym(Cm,α​) be the group of all isometries TTT of the Euclidean plane C\mathbb{C}C, orientation-preserving or not, with T(z)∈Cm,α  ⟺  z∈Cm,αT(z)\in C_{m,\alpha}\iff z\in C_{m,\alpha}T(z)∈Cm,α​⟺z∈Cm,α​ for every z∈Cz\in\mathbb{C}z∈C.

Then Sym(Cm,α)\mathrm{Sym}(C_{m,\alpha})Sym(Cm,α​) is finite and

∣Sym(Cm,α)∣=2m.|\mathrm{Sym}(C_{m,\alpha})|=2m.∣Sym(Cm,α​)∣=2m.

This is the count of Euclidean symmetries in Theorem 2 of the note, where they are the 2m2m2m rotations z↦czz\mapsto czz↦cz, c2m=1c^{2m}=1c2m=1, of equation (3). It supports Theorem 1, whose rotation bound 2d−42d-42d−4 is attained by the curves Cd−2,iC_{d-2,i}Cd−2,i​ for d≥4d\ge4d≥4, and it is used to count the symmetries of the quintic (2).

Formalization Note: The group is the subgroup of the isometries ℂ ≃ᵢ ℂ preserving the set Cm,αC_{m,\alpha}Cm,α​, and the cardinality is Nat.card, so the statement includes finiteness.

Preamble
import Definitions.Def_CurveSymmetry_01_RealLoci
import Definitions.Def_CurveSymmetry_02_FamilyBasics
import Definitions.Def_CurveSymmetry_03_IsometriesAndCharts
import Definitions.Def_CurveSymmetry_04_ProjectiveClosure
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.Calculus.FDeriv.Analytic
import Mathlib.Analysis.Calculus.FDeriv.Equiv
import Mathlib.Analysis.Calculus.FDeriv.Mul
import Mathlib.Analysis.Calculus.FDeriv.Pi
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.Algebra.Module.FiniteDimension
import Mathlib.Topology.Compactification.OnePoint.ProjectiveLine

open CurveSymmetry
set_option autoImplicit false
open OnePoint
Formal statement
theorem CurveSymmetry.family_isometry_card {m : ℕ} (hm : 2 ≤ m) {α : ℂ}
    (ha : α ≠ star α) (hα : ‖α‖ = 1) :
    Nat.card (isometrySetGroup (extremalCurve m α)) = 2 * m := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, for Theorem 2, p. 2; proof of Theorem 2, p. 4, https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/sharp_symmetry_bounds.pdf. Lean: https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/lean/FamilyEuclidean.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