Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 1 (equality case): if d≥5d\ge5d≥5 and ∣Sym+(C)∣=2d−4|\mathrm{Sym}^+(C)|=2d-4∣Sym+(C)∣=2d−4, a similarity maps CCC onto some Cd−2,αC_{d-2,\alpha}Cd−2,α​

Proved
CurveSymmetry.paper_equality_classification

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

algebraic-geometrycurve-symmetry-leaneuclidean-geometry

Let f∈R[x,y]f\in\mathbb R[x,y]f∈R[x,y] be irreducible in C[x,y]\mathbb C[x,y]C[x,y] and of total degree d≥5d\ge5d≥5, and let C={z∈C:f(Re⁡z,Im⁡z)=0}C=\{z\in\mathbb C: f(\operatorname{Re}z,\operatorname{Im}z)=0\}C={z∈C:f(Rez,Imz)=0} be its real zero set, identifying (x,y)(x,y)(x,y) with x+iyx+iyx+iy. Assume that CCC is infinite, that CCC is not a circle (there are no c∈Cc\in\mathbb Cc∈C and real R>0R>0R>0 with C={z:∣z−c∣=R}C=\{z:|z-c|=R\}C={z:∣z−c∣=R}), and that the group Sym+(C)\mathrm{Sym}^+(C)Sym+(C) of orientation-preserving isometries z↦az+bz\mapsto az+bz↦az+b, ∣a∣=1|a|=1∣a∣=1, mapping CCC onto itself has exactly 2d−42d-42d−4 elements. For an integer m≥0m\ge0m≥0 and α∈C\alpha\in\mathbb Cα∈C write Cm,α={w∈C:Re⁡(wm(∣w∣2+α))=0}C_{m,\alpha}=\{w\in\mathbb C:\operatorname{Re}\bigl(w^m(|w|^2+\alpha)\bigr)=0\}Cm,α​={w∈C:Re(wm(∣w∣2+α))=0}.

Then there exist a,b,α∈Ca,b,\alpha\in\mathbb Ca,b,α∈C with a≠0a\ne0a=0, ∣α∣=1|\alpha|=1∣α∣=1 and α∉R\alpha\notin\mathbb Rα∈/R such that the orientation-preserving similarity z↦az+bz\mapsto az+bz↦az+b carries CCC onto Cd−2,αC_{d-2,\alpha}Cd−2,α​:

{az+b:z∈C}=Cd−2,α.\{az+b: z\in C\}=C_{d-2,\alpha}.{az+b:z∈C}=Cd−2,α​.

This is the equality clause of Theorem 1: for d≥5d\ge5d≥5, a curve attaining the rotation bound 2d−42d-42d−4 is, up to an orientation-preserving similarity, a curve of the family (1) with m=d−2m=d-2m=d−2.

Formalization Note: the curve is a subset of C\mathbb CC and Sym+(C)\mathrm{Sym}^+(C)Sym+(C) is a subgroup of the group ℂ ≃ᵢ ℂ of isometric bijections; its order is Nat.card, so the hypothesis, with 2d−4>02d-4>02d−4>0, includes finiteness.

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_equality_classification {f : RPoly} (hf : GeometricallyIrreducible f)
    (hd : 5 ≤ f.totalDegree) (hinf : (cartesianLocus f).Infinite)
    (hnc : ¬ ∃ c : ℂ, ∃ R : ℝ, 0 < R ∧ cartesianLocus f = Metric.sphere c R)
    (hcard : Nat.card (directIsometryGroup (cartesianLocus f)) = 2 * f.totalDegree - 4) :
    ∃ a b α : ℂ, a ≠ 0 ∧ ‖α‖ = 1 ∧ α ≠ star α ∧
      (fun z : ℂ => a * z + b) '' cartesianLocus f = extremalCurve (f.totalDegree - 2) α := 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