Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 3 (sign clause): f∘T=±ff\circ T=\pm ff∘T=±f for every T∈Sym(C)T\in\mathrm{Sym}(C)T∈Sym(C), and f∘T=ff\circ T=ff∘T=f if TTT reverses orientation

Proved
CurveSymmetry.paper_isometry_sign

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

algebraic-geometrycurve-symmetry-leanfunction-fields

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 at least 222. Identify R2\mathbb{R}^2R2 with C\mathbb{C}C and write f(z)=f(Re⁡z,Im⁡z)f(z)=f(\operatorname{Re}z,\operatorname{Im}z)f(z)=f(Rez,Imz) for z∈Cz\in\mathbb{C}z∈C. Let C={z∈C:f(z)=0}C=\{z\in\mathbb{C} : f(z)=0\}C={z∈C:f(z)=0} be the real zero set, assumed infinite, and let Sym(C)\mathrm{Sym}(C)Sym(C) be the group of isometries TTT of the Euclidean plane with T(z)∈C  ⟺  z∈CT(z)\in C\iff z\in CT(z)∈C⟺z∈C for every z∈Cz\in\mathbb{C}z∈C. Let T∈Sym(C)T\in\mathrm{Sym}(C)T∈Sym(C).

Then there is a real number ε∈{1,−1}\varepsilon\in\{1,-1\}ε∈{1,−1} such that

f(T(z))=ε f(z)for every z∈C,f\bigl(T(z)\bigr)=\varepsilon\,f(z)\qquad\text{for every } z\in\mathbb{C},f(T(z))=εf(z)for every z∈C,

and ε=1\varepsilon=1ε=1 whenever TTT reverses orientation, that is, whenever there are a,b∈Ca,b\in\mathbb{C}a,b∈C with T(z)=azˉ+bT(z)=a\bar z+bT(z)=azˉ+b for all zzz.

This is the sign clause of Lemma 3 of the note: f∘T=ε(T)ff\circ T=\varepsilon(T)ff∘T=ε(T)f with ε(T)∈{1,−1}\varepsilon(T)\in\{1,-1\}ε(T)∈{1,−1}, and ε(T)=1\varepsilon(T)=1ε(T)=1 if TTT is a reflection. Here the last condition is stated for every orientation-reversing symmetry; each of these fixes a point and is therefore a reflection in a line. The finiteness of Sym(C)\mathrm{Sym}(C)Sym(C) and the cyclicity of its direct subgroup, also in Lemma 3, are not part of this statement, and the note's standing assumption that CCC is not a circle is not needed.

Formalization Note: fff is a real polynomial evaluated at (Re⁡z,Im⁡z)(\operatorname{Re}z,\operatorname{Im}z)(Rez,Imz); irreducibility in C[x,y]\mathbb{C}[x,y]C[x,y] is irreducibility of the image of fff under R[x,y]→C[x,y]\mathbb{R}[x,y]\to\mathbb{C}[x,y]R[x,y]→C[x,y], and Sym(C)\mathrm{Sym}(C)Sym(C) is the subgroup of the isometries ℂ ≃ᵢ ℂ preserving CCC.

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.paper_isometry_sign {f : RPoly} (hf : GeometricallyIrreducible f)
    (hd : 2 ≤ f.totalDegree) (hinf : (cartesianLocus f).Infinite)
    (T : isometrySetGroup (cartesianLocus f)) :
    ∃ ε : ℝ, (ε = 1 ∨ ε = -1) ∧
      (∀ z : ℂ, eval (fun i : Fin 2 => if i = 0 then (T.val z).re else (T.val z).im) f =
        ε * eval (fun i : Fin 2 => if i = 0 then z.re else z.im) f) ∧
      ((∃ a b : ℂ, ∀ z : ℂ, T.val z = a * star z + b) → ε = 1) := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note), 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/IsometrySign.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