Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Finiteness of Sym+(C)\mathrm{Sym}^+(C)Sym+(C) and the rotation bound ∣Sym+(C)∣≤max⁡{d,2d−4}|\mathrm{Sym}^+(C)|\le\max\{d,2d-4\}∣Sym+(C)∣≤max{d,2d−4} for irreducible curves

Proved
CurveSymmetry.direct_euclidean_bound

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

curve-symmetry-leaneuclidean-geometryreal-algebraic-geometry

Identify the Euclidean plane with C\mathbb CC and use the complex coordinates X=zX=zX=z, Y=zˉY=\bar zY=zˉ. Let P∈C[X,Y]P\in\mathbb C[X,Y]P∈C[X,Y] be irreducible in C[X,Y]\mathbb C[X,Y]C[X,Y], of total degree d=deg⁡P≥2d=\deg P\ge 2d=degP≥2, and assume that its real locus C={z∈C:P(z,zˉ)=0}C=\{z\in\mathbb C: P(z,\bar z)=0\}C={z∈C:P(z,zˉ)=0} is infinite and 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 Sym+(C)\mathrm{Sym}^+(C)Sym+(C) be the set of orientation-preserving isometries T(z)=az+bT(z)=az+bT(z)=az+b (a,b∈Ca,b\in\mathbb Ca,b∈C, ∣a∣=1|a|=1∣a∣=1) such that T(z)∈C  ⟺  z∈CT(z)\in C\iff z\in CT(z)∈C⟺z∈C for all z∈Cz\in\mathbb Cz∈C. Then Sym+(C)\mathrm{Sym}^+(C)Sym+(C) is finite and

∣Sym+(C)∣≤max⁡{d, 2d−4}.|\mathrm{Sym}^+(C)|\le\max\{d,\,2d-4\}.∣Sym+(C)∣≤max{d,2d−4}.

This is the rotation bound of Theorem 1, together with the finiteness of Sym+(C)\mathrm{Sym}^+(C)Sym+(C), for a curve given by an equation in zzz and zˉ\bar zzˉ; no fixed center and no action on the equation are assumed. The version for a real Cartesian equation and the exact counts for the sharpness examples are derived from it.

Formalization Note: an isometry T(z)=az+bT(z)=az+bT(z)=az+b is recorded by its pair (a,b)∈C×C(a,b)\in\mathbb C\times\mathbb C(a,b)∈C×C. The cardinality is the natural-number cardinality, which is 000 for an infinite set, so finiteness is stated separately.

Preamble
import Definitions.Def_CurveSymmetry_01_RealLoci
import Mathlib.Algebra.MvPolynomial.Nilpotent
import Mathlib.Algebra.MvPolynomial.NoZeroDivisors
import Mathlib.Algebra.Polynomial.FieldDivision
import Mathlib.Analysis.Complex.Polynomial.Basic
import Mathlib.Data.Complex.Basic
import Mathlib.RingTheory.MvPolynomial.Homogeneous
import Mathlib.RingTheory.MvPolynomial.IrreducibleQuadratic
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.direct_euclidean_bound {P : BPoly} (hP : Irreducible P)
    (hd : 2 ≤ P.totalDegree) (hinf : (realLocus P).Infinite) (hcircle : NotCircle P) :
    Finite (DirectSymmetries P) ∧
      Nat.card (DirectSymmetries P) ≤ max P.totalDegree (2 * P.totalDegree - 4) := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, used for Theorem 1 (p. 1), Theorem 2 (p. 2), Lemma 3 (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/DirectBound.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