Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Equations vanishing on the infinitely many real points of an irreducible PPP cut out exactly the curve P=0P=0P=0

Proved
CurveSymmetry.real_diagonal_algebraic_closure

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

algebraic-geometrycurve-symmetry-leaneuclidean-geometry

Let P∈C[X,Y]P\in\mathbb C[X,Y]P∈C[X,Y] be irreducible. Writing points of the real plane as z∈Cz\in\mathbb Cz∈C, the real locus of PPP in the coordinates X=zX=zX=z, Y=zˉY=\bar zY=zˉ is Z(P)={z∈C:P(z,zˉ)=0}Z(P)=\{z\in\mathbb C:P(z,\bar z)=0\}Z(P)={z∈C:P(z,zˉ)=0}. Let ΔP={(z,zˉ):z∈Z(P)}⊆C2\Delta_P=\{(z,\bar z):z\in Z(P)\}\subseteq\mathbb C^2ΔP​={(z,zˉ):z∈Z(P)}⊆C2 be its image under z↦(z,zˉ)z\mapsto(z,\bar z)z↦(z,zˉ), and let I(ΔP)={Q∈C[X,Y]:Q(v)=0 for all v∈ΔP}I(\Delta_P)=\{Q\in\mathbb C[X,Y]:Q(v)=0\ \text{for all}\ v\in\Delta_P\}I(ΔP​)={Q∈C[X,Y]:Q(v)=0 for all v∈ΔP​} be the ideal of the polynomials vanishing on ΔP\Delta_PΔP​.

If Z(P)Z(P)Z(P) is infinite, then

{v∈C2: Q(v)=0 for all Q∈I(ΔP)}={v∈C2: P(v)=0}.\{v\in\mathbb C^2:\ Q(v)=0\ \text{for all}\ Q\in I(\Delta_P)\}=\{v\in\mathbb C^2:\ P(v)=0\}.{v∈C2: Q(v)=0 for all Q∈I(ΔP​)}={v∈C2: P(v)=0}.

In the classical Zariski topology of C2\mathbb C^2C2 this says that the closure of the real points ΔP\Delta_PΔP​ is the whole complex curve P=0P=0P=0: the Zariski density of an infinite real locus that the note invokes in the proofs of Lemma 3 and Theorem 2. For the polynomial PαP_\alphaPα​ of equation (6), with ∣α∣=1|\alpha|=1∣α∣=1 and α∉R\alpha\notin\mathbb Rα∈/R as in Lemma 4, the points (z,zˉ)(z,\bar z)(z,zˉ) with z∈Cm,αz\in C_{m,\alpha}z∈Cm,α​ are therefore Zariski dense in the complex affine curve Pα=0P_\alpha=0Pα​=0, the affine part of the curve Vα⊂P1×P1V_\alpha\subset\mathbb P^1\times\mathbb P^1Vα​⊂P1×P1 obtained by closing (6).

Formalization Note: the left side is Mathlib's MvPolynomial.zeroLocus ℂ of MvPolynomial.vanishingIdeal ℂ, with irreducibility taken in MvPolynomial (Fin 2) ℂ.

Preamble
import Definitions.Def_CurveSymmetry_01_RealLoci
import Definitions.Def_CurveSymmetry_02_FamilyBasics
import Definitions.Def_CurveSymmetry_03_IsometriesAndCharts
import Mathlib.Algebra.MvPolynomial.Nilpotent
import Mathlib.Algebra.MvPolynomial.NoZeroDivisors
import Mathlib.Algebra.Polynomial.FieldDivision
import Mathlib.Algebra.Polynomial.Reverse
import Mathlib.Analysis.Complex.Polynomial.Basic
import Mathlib.Data.Complex.Basic
import Mathlib.RingTheory.MvPolynomial.Homogeneous
import Mathlib.RingTheory.MvPolynomial.IrreducibleQuadratic
import Mathlib.RingTheory.Nullstellensatz
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.Prime.Topology
import Mathlib.Tactic

open CurveSymmetry
set_option autoImplicit false
open MvPolynomial
Formal statement
theorem CurveSymmetry.real_diagonal_algebraic_closure {P : BPoly} (hP : Irreducible P)
    (hinf : (realLocus P).Infinite) :
    zeroLocus ℂ (vanishingIdeal ℂ (affineRealDiagonal P)) =
      {v : Fin 2 → ℂ | eval v P = 0} := by sorry
Source
C. Perassi, Sharp symmetry bounds for real algebraic curves (note): lemma of the formalization, for Section 3, closure of equation (6), 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/AffineClosure.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