Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The boundary point (0,∞)(0,\infty)(0,∞) lies in the Zariski closure of Pα=0P_\alpha=0Pα​=0 in the chart (1/Y,X)(1/Y,X)(1/Y,X)

Proved
CurveSymmetry.other_mixed_corner_mem_affine_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 Y=∞Y=\inftyY=∞, use the chart of P1×P1\mathbb P^1\times\mathbb P^1P1×P1 with coordinates taken in the order (v,X)(v,X)(v,X), where v=1/Yv=1/Yv=1/Y: a point (X,Y)(X,Y)(X,Y) with Y≠0Y\ne0Y=0 has chart coordinates (1/Y,X)(1/Y,X)(1/Y,X), and the chart origin (0,0)(0,0)(0,0) represents the boundary point (X,Y)=(0,∞)(X,Y)=(0,\infty)(X,Y)=(0,∞). Let Spec⁡C[v,X]\operatorname{Spec}\mathbb C[v,X]SpecC[v,X] be the prime spectrum of the polynomial ring in the chart coordinates, with its Zariski topology, and for w∈C2w\in\mathbb C^2w∈C2 let mw\mathfrak m_wmw​ be the maximal ideal of the polynomials vanishing at www.

Then the chart origin lies in the closure of the points of the affine curve Pα=0P_\alpha=0Pα​=0 with Y≠0Y\ne0Y=0, written in the chart coordinates:

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

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 as a curve of bidegree (m+1,m+1)(m+1,m+1)(m+1,m+1). It places the boundary point (0,∞)(0,\infty)(0,∞) in the closure of the affine curve within this chart; 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, and the closure is taken in Mathlib's Zariski topology on the prime spectrum.

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.other_mixed_corner_mem_affine_closure {m : ℕ} (hm : 0 < m) (α : ℂ) :
    affineSpectrumPoint ![0, 0] ∈
      closure ((fun z : Fin 2 → ℂ => affineSpectrumPoint ![(z 1)⁻¹, z 0]) ''
        {z | eval z (familyPolynomial m α) = 0 ∧ z 1 ≠ 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/OtherMixedCornerClosure.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