Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Zariski closure of the curve Pα=0P_\alpha=0Pα​=0 in the chart (1/X,Y)(1/X,Y)(1/X,Y) of P1×P1\mathbb P^1\times\mathbb P^1P1×P1

Proved
CurveSymmetry.mixed_affine_points_closure

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

algebraic-geometrycurve-symmetry-leaneuclidean-geometry

Let m≥1m\ge1m≥1 be an integer and let α∈C\alpha\in\mathbb Cα∈C be arbitrary. Let Pα(X,Y)=Xm(α+XY)+Ym(αˉ+XY)P_\alpha(X,Y)=X^m(\alpha+XY)+Y^m(\bar\alpha+XY)Pα​(X,Y)=Xm(α+XY)+Ym(αˉ+XY) be the polynomial of equation (6). Near X=∞X=\inftyX=∞, use the chart of P1×P1\mathbb P^1\times\mathbb P^1P1×P1 with coordinates (u,Y)(u,Y)(u,Y), where u=1/Xu=1/Xu=1/X, and put Mα(u,Y)=αu+Y+αˉ um+1Ym+umYm+1M_\alpha(u,Y)=\alpha u+Y+\bar\alpha\,u^{m+1}Y^m+u^mY^{m+1}Mα​(u,Y)=αu+Y+αˉum+1Ym+umYm+1, which equals um+1Pα(1/u,Y)u^{m+1}P_\alpha(1/u,Y)um+1Pα​(1/u,Y). Let Spec⁡C[u,Y]\operatorname{Spec}\mathbb C[u,Y]SpecC[u,Y] be the prime spectrum of the polynomial ring in the chart coordinates, with its Zariski topology; for w∈C2w\in\mathbb C^2w∈C2 let mw\mathfrak m_wmw​ be the maximal ideal of the polynomials vanishing at www, and let V(Mα)V(M_\alpha)V(Mα​) be the set of prime ideals containing MαM_\alphaMα​.

Then the closure of the points of the affine curve Pα=0P_\alpha=0Pα​=0 with X≠0X\ne0X=0, written in the chart coordinates, is the whole zero locus of MαM_\alphaMα​:

{m(1/X, Y) : (X,Y)∈C2, Pα(X,Y)=0, X≠0}‾=V(Mα).\overline{\bigl\{\mathfrak m_{(1/X,\,Y)}\ :\ (X,Y)\in\mathbb C^2,\ P_\alpha(X,Y)=0,\ X\ne0\bigr\}}=V(M_\alpha).{m(1/X,Y)​ : (X,Y)∈C2, Pα​(X,Y)=0, X=0}​=V(Mα​).

This is one of the chart computations behind VαV_\alphaVα​, the closure of the curve (6) in P1×P1\mathbb P^1\times\mathbb P^1P1×P1, which the note introduces before Lemma 4. In the chart around the boundary point (∞,0)(\infty,0)(∞,0), the closure of the affine curve is cut out by MαM_\alphaMα​, the local equation used at that point in the proof of Lemma 4. Gluing the charts into a global statement is a separate step.

Formalization Note: points of C2\mathbb C^2C2 are sent into the prime spectrum by w↦mww\mapsto\mathfrak m_ww↦mw​, the kernel of evaluation at www; the closure and the zero locus are taken in Mathlib's prime spectrum with its Zariski topology, non-closed points included.

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.MvPolynomial.PDeriv
import Mathlib.Algebra.Polynomial.FieldDivision
import Mathlib.Algebra.Polynomial.Reverse
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.Separable
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.Jacobson
import Mathlib.RingTheory.Spectrum.Prime.Topology
import Mathlib.Tactic

open CurveSymmetry
set_option autoImplicit false
open MvPolynomial
Formal statement
theorem CurveSymmetry.mixed_affine_points_closure {m : ℕ} (hm : 0 < m) (α : ℂ) :
    closure ((fun z : Fin 2 → ℂ => affineSpectrumPoint ![(z 0)⁻¹, z 1]) ''
      {z | eval z (familyPolynomial m α) = 0 ∧ z 0 ≠ 0}) =
      PrimeSpectrum.zeroLocus ({familyMixedPolynomial m α (star α)} : Set BPoly) := 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/AffineChartImages.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