Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The origin of a mixed chart lies in the Zariski closure of the chart curve off the axis u=0u=0u=0

Proved
CurveSymmetry.mixed_corner_mem_chart_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, let a,b∈Ca,b\in\mathbb Ca,b∈C be arbitrary, and let Qa,b(u,y)=a u+y+b um+1ym+umym+1∈C[u,y]Q_{a,b}(u,y)=a\,u+y+b\,u^{m+1}y^m+u^my^{m+1}\in\mathbb C[u,y]Qa,b​(u,y)=au+y+bum+1ym+umym+1∈C[u,y]. With 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), the choice (a,b)=(α,αˉ)(a,b)=(\alpha,\bar\alpha)(a,b)=(α,αˉ) gives the polynomial equal to um+1Pα(1/u,y)u^{m+1}P_\alpha(1/u,y)um+1Pα​(1/u,y) for u≠0u\ne0u=0, the equation of the curve Pα=0P_\alpha=0Pα​=0 in the chart u=1/Xu=1/Xu=1/X near the boundary point (∞,0)(\infty,0)(∞,0) of P1×P1\mathbb P^1\times\mathbb P^1P1×P1; the choice (a,b)=(αˉ,α)(a,b)=(\bar\alpha,\alpha)(a,b)=(αˉ,α) gives the analogous equation near (0,∞)(0,\infty)(0,∞), with the two coordinates exchanged. In Spec⁡C[u,y]\operatorname{Spec}\mathbb C[u,y]SpecC[u,y] with its Zariski topology let V(Qa,b)V(Q_{a,b})V(Qa,b​) be the set of prime ideals containing Qa,bQ_{a,b}Qa,b​, let D(u)D(u)D(u) be the set of prime ideals not containing uuu, and let m(0,0)=(u,y)\mathfrak m_{(0,0)}=(u,y)m(0,0)​=(u,y) be the point of the origin.

Then

m(0,0)∈V(Qa,b)∩D(u)‾.\mathfrak m_{(0,0)}\in\overline{V(Q_{a,b})\cap D(u)}.m(0,0)​∈V(Qa,b​)∩D(u)​.

The origin of the chart represents a corner of P1×P1\mathbb P^1\times\mathbb P^1P1×P1, while D(u)D(u)D(u) is the part of the chart where X=1/uX=1/uX=1/u is finite. So the corner lies in the Zariski closure of the part of the chart curve over the affine plane, as needed for the description of the closure of the curve (6) in P1×P1\mathbb P^1\times\mathbb P^1P1×P1.

Formalization Note: points of Spec⁡C[u,y]\operatorname{Spec}\mathbb C[u,y]SpecC[u,y] are elements of PrimeSpectrum (MvPolynomial (Fin 2) ℂ) with Mathlib's Zariski topology, uuu and yyy are the variables X 0 and X 1, and mv\mathfrak m_vmv​ is the kernel of evaluation at vvv.

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_corner_mem_chart_closure {m : ℕ} (hm : 0 < m) (a b : ℂ) :
    affineSpectrumPoint ![0, 0] ∈
      closure (PrimeSpectrum.zeroLocus ({familyMixedPolynomial m a b} : Set BPoly) ∩
        {p : PrimeSpectrum BPoly | (X 0 : BPoly) ∉ p.asIdeal}) := 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/MixedCornerClosure.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