Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Descent from an irreducible equation in z,zˉz,\bar zz,zˉ to a real Cartesian equation with the same curve and degree

Proved
CurveSymmetry.exists_cartesian_equation

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

curve-symmetry-leanpolynomialsreal-algebraic-geometry

Let P=∑pabXaYb∈C[X,Y]P=\sum p_{ab}X^aY^b\in\mathbb C[X,Y]P=∑pab​XaYb∈C[X,Y] be irreducible and of total degree at least 222, and suppose that its real locus {z∈C:P(z,zˉ)=0}\{z\in\mathbb C: P(z,\bar z)=0\}{z∈C:P(z,zˉ)=0}, the curve that PPP defines in the complex coordinates X=zX=zX=z, Y=zˉY=\bar zY=zˉ, is infinite. No condition is imposed on the coefficients of PPP; in particular the symmetry pba=pab‾p_{ba}=\overline{p_{ab}}pba​=pab​​ of a complexified real equation is not assumed.

Then there is a polynomial f∈R[x,y]f\in\mathbb R[x,y]f∈R[x,y], irreducible in C[x,y]\mathbb C[x,y]C[x,y], with deg⁡f=deg⁡P\deg f=\deg Pdegf=degP (total degrees), whose real zero set is that curve:

{z∈C:f(Re⁡z,Im⁡z)=0}={z∈C:P(z,zˉ)=0}.\{z\in\mathbb C: f(\operatorname{Re}z,\operatorname{Im}z)=0\}=\{z\in\mathbb C: P(z,\bar z)=0\}.{z∈C:f(Rez,Imz)=0}={z∈C:P(z,zˉ)=0}.

It lets curves constructed in the coordinates z,zˉz,\bar zz,zˉ be presented by real Cartesian equations, the setting of Theorem 1. It is used for the sharpness examples and the converse of the equality case in Theorem 1, and for the statement in Theorem 2 that Cm,αC_{m,\alpha}Cm,α​ is an infinite geometrically irreducible curve of degree m+2m+2m+2.

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.exists_cartesian_equation {P : BPoly} (hP : Irreducible P)
    (hd : 2 ≤ P.totalDegree) (hinf : (realLocus P).Infinite) :
    ∃ f : RPoly, GeometricallyIrreducible f ∧ f.totalDegree = P.totalDegree ∧
      cartesianLocus f = realLocus P := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, for proof of Theorem 1, sharpness examples, p. 3, https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/sharp_symmetry_bounds.pdf. Lean: https://github.com/carlok/curve-symmetry-lean/blob/d99bc17a1c397956c05d7417de50f9beed56580f/lean/CartesianDescent.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