Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

At most max⁡{d,2d−4}\max\{d,2d-4\}max{d,2d−4} direct symmetries z↦az+bz\mapsto az+bz↦az+b for a real algebraic curve of degree ddd, not a circle

Proved
CurveSymmetry.cartesian_direct_bound

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

curve-symmetry-leanpolynomialsreal-algebraic-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≥2d\ge2d≥2. Identify (x,y)(x,y)(x,y) with x+iyx+iyx+iy 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 the real zero set of fff. Assume that CCC is infinite and that CCC is not a circle: there are no c∈Cc\in\mathbb Cc∈C and real R>0R>0R>0 with C={z∈C:∣z−c∣=R}C=\{z\in\mathbb C:|z-c|=R\}C={z∈C:∣z−c∣=R}. Let DDD be the set of pairs (a,b)∈C2(a,b)\in\mathbb C^2(a,b)∈C2 with ∣a∣=1|a|=1∣a∣=1 such that az+b∈C  ⟺  z∈Caz+b\in C\iff z\in Caz+b∈C⟺z∈C for every z∈Cz\in\mathbb Cz∈C, i.e. such that the orientation-preserving isometry z↦az+bz\mapsto az+bz↦az+b maps CCC onto itself.

Then DDD is finite and

∣D∣≤max⁡{d, 2d−4}.|D|\le\max\{d,\,2d-4\}.∣D∣≤max{d,2d−4}.

Distinct pairs give distinct maps, so DDD is in bijection with Sym+(C)\mathrm{Sym}^+(C)Sym+(C), and this is the rotation bound N≤max⁡{d,2d−4}N\le\max\{d,2d-4\}N≤max{d,2d−4} of Theorem 1, stated, as in the note, for a real Cartesian polynomial.

Formalization Note: the curve is a subset of C\mathbb CC, and DDD is a set of parameter pairs rather than a group of maps; irreducibility of fff in C[x,y]\mathbb C[x,y]C[x,y] is irreducibility of its image under the inclusion R[x,y]⊂C[x,y]\mathbb R[x,y]\subset\mathbb C[x,y]R[x,y]⊂C[x,y].

Preamble
import Definitions.Def_CurveSymmetry_01_RealLoci
import Definitions.Def_CurveSymmetry_02_FamilyBasics
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.cartesian_direct_bound {f : RPoly} (hf : GeometricallyIrreducible f)
    (hd : 2 ≤ f.totalDegree) (hinf : (cartesianLocus f).Infinite)
    (hnc : ¬ ∃ c : ℂ, ∃ R : ℝ, 0 < R ∧ cartesianLocus f = Metric.sphere c R) :
    Finite (CartesianDirectSymmetries f) ∧
      Nat.card (CartesianDirectSymmetries f) ≤ max f.totalDegree (2 * f.totalDegree - 4) := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, for Section 2, equation (4), p. 2, https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/sharp_symmetry_bounds.pdf. Lean: https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/lean/CartesianReal.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