Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Remark 5 (degree four): Re⁡(z4)=1\operatorname{Re}(z^4)=1Re(z4)=1 has four rotations and is not similar to any C2,αC_{2,\alpha}C2,α​

Proved
CurveSymmetry.paper_degree_four_not_in_family

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

curve-symmetry-leanfunction-fieldsgenus

Identify the Euclidean plane with C\mathbb CC. For S⊆CS\subseteq\mathbb CS⊆C let Sym+(S)\mathrm{Sym}^+(S)Sym+(S) be the group of orientation-preserving Euclidean 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) with T(S)=ST(S)=ST(S)=S. Let C4={z∈C:Re⁡(z4)=1}C_4=\{z\in\mathbb C:\operatorname{Re}(z^4)=1\}C4​={z∈C:Re(z4)=1} and, for α∈C\alpha\in\mathbb Cα∈C, let C2,α={z∈C:Re⁡(z2(∣z∣2+α))=0}C_{2,\alpha}=\{z\in\mathbb C:\operatorname{Re}\bigl(z^2(|z|^2+\alpha)\bigr)=0\}C2,α​={z∈C:Re(z2(∣z∣2+α))=0}, the set of equation (1) of the note with m=2m=2m=2 (where the note takes ∣α∣=1|\alpha|=1∣α∣=1 and α∉R\alpha\notin\mathbb Rα∈/R). For a,b∈Ca,b\in\mathbb Ca,b∈C and S⊆CS\subseteq\mathbb CS⊆C write aS+b={az+b:z∈S}aS+b=\{az+b:z\in S\}aS+b={az+b:z∈S} and aS‾+b={azˉ+b:z∈S}a\overline S+b=\{a\bar z+b:z\in S\}aS+b={azˉ+b:z∈S}.

Then:

  1. Sym+(C4)\mathrm{Sym}^+(C_4)Sym+(C4​) has exactly four elements;
  2. no similarity of the plane, direct (z↦az+bz\mapsto az+bz↦az+b) or orientation-reversing (z↦azˉ+bz\mapsto a\bar z+bz↦azˉ+b), with a≠0a\ne0a=0, carries C4C_4C4​ onto a set C2,αC_{2,\alpha}C2,α​ with α\alphaα nonreal.

In formulas:

∣Sym+(C4)∣=4and∄ a,b,α∈C: a≠0, α≠αˉ, (aC4+b=C2,α or aC4‾+b=C2,α).|\mathrm{Sym}^+(C_4)|=4\qquad\text{and}\qquad\nexists\,a,b,\alpha\in\mathbb C:\ a\ne0,\ \alpha\ne\bar\alpha,\ \bigl(aC_4+b=C_{2,\alpha}\ \text{or}\ a\overline{C_4}+b=C_{2,\alpha}\bigr).∣Sym+(C4​)∣=4and∄a,b,α∈C: a=0, α=αˉ, (aC4​+b=C2,α​ or aC4​​+b=C2,α​).

This is the degree-four example of Remark 5 of the note: Re⁡(z4)=1\operatorname{Re}(z^4)=1Re(z4)=1 attains the rotation bound max⁡{d,2d−4}=4\max\{d,2d-4\}=4max{d,2d−4}=4 of Theorem 1 with d=4d=4d=4, yet it is not in the m=2m=2m=2 family; Remark 5 uses it to show that the restriction d≥5d\ge5d≥5 in the equality clause of Theorem 1 is necessary. Here the parameter α\alphaα is only required to be nonreal.

Formalization Note: Sym+(S)\mathrm{Sym}^+(S)Sym+(S) is a subgroup of the isometry group ℂ ≃ᵢ ℂ, and its size is Nat.card, which is 000 for an infinite group; the value 444 thus 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_05_FamilyFunctionField
import Definitions.Def_CurveSymmetry_06_QuadraticRing
import Definitions.Def_CurveSymmetry_07_Places
import Definitions.Def_CurveSymmetry_08_Differentials
import Definitions.Def_CurveSymmetry_09_Genus
import Definitions.Def_CurveSymmetry_10_KummerField
import Definitions.Def_CurveSymmetry_11_KummerLocal
import Definitions.Def_CurveSymmetry_12_FermatGenus
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.Algebra.Polynomial.SpecificDegree
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.RatFunc.Basic
import Mathlib.FieldTheory.Separable
import Mathlib.LinearAlgebra.Basis.Basic
import Mathlib.LinearAlgebra.Dimension.Finrank
import Mathlib.LinearAlgebra.FiniteDimensional.Defs
import Mathlib.LinearAlgebra.TensorProduct.Basis
import Mathlib.RingTheory.AdjoinRoot
import Mathlib.RingTheory.DedekindDomain.Dvr
import Mathlib.RingTheory.DiscreteValuationRing.TFAE
import Mathlib.RingTheory.Etale.Field
import Mathlib.RingTheory.Etale.Kaehler
import Mathlib.RingTheory.Kaehler.Basic
import Mathlib.RingTheory.Kaehler.Polynomial
import Mathlib.RingTheory.LocalRing.MaximalIdeal.Basic
import Mathlib.RingTheory.LocalRing.Module
import Mathlib.RingTheory.Localization.AsSubring
import Mathlib.RingTheory.MvPolynomial.Homogeneous
import Mathlib.RingTheory.MvPolynomial.IrreducibleQuadratic
import Mathlib.RingTheory.Nakayama
import Mathlib.RingTheory.Polynomial.Eisenstein.Criterion
import Mathlib.RingTheory.Polynomial.GaussLemma
import Mathlib.RingTheory.RootsOfUnity.Complex
import Mathlib.RingTheory.RootsOfUnity.PrimitiveRoots
import Mathlib.RingTheory.Spectrum.Maximal.Localization
import Mathlib.RingTheory.Valuation.ValuationSubring
import Mathlib.Tactic

open CurveSymmetry
set_option autoImplicit false
Formal statement
theorem CurveSymmetry.paper_degree_four_not_in_family :
    Nat.card (directIsometryGroup {z : ℂ | (z ^ 4).re = 1}) = 4 ∧
      ¬ ∃ a b α : ℂ, a ≠ 0 ∧ α ≠ star α ∧
        ((fun z : ℂ => a * z + b) '' {z : ℂ | (z ^ 4).re = 1} = extremalCurve 2 α ∨
          (fun z : ℂ => a * star z + b) '' {z : ℂ | (z ^ 4).re = 1} = extremalCurve 2 α) := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, for Remark 5, 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/PaperRemarks.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