Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The chart change (X,Y)↦(1/Y,X)(X,Y)\mapsto(1/Y,X)(X,Y)↦(1/Y,X) maps the affine curve with Y≠0Y\ne0Y=0 onto the punctured mixed chart curve

Proved
CurveSymmetry.other_mixed_affine_points_image

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

algebraic-geometrycurve-symmetry-leaneuclidean-geometry

Let m≥0m\ge0m≥0 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) and Q(v,x)=αˉv+x+αvm+1xm+vmxm+1∈C[v,x]Q(v,x)=\bar\alpha v+x+\alpha v^{m+1}x^m+v^mx^{m+1}\in\mathbb C[v,x]Q(v,x)=αˉv+x+αvm+1xm+vmxm+1∈C[v,x]. For v≠0v\ne0v=0 one has Q(v,x)=vm+1Pα(x,1/v)Q(v,x)=v^{m+1}P_\alpha(x,1/v)Q(v,x)=vm+1Pα​(x,1/v), so QQQ is the equation of the curve Pα=0P_\alpha=0Pα​=0 in the chart v=1/Yv=1/Yv=1/Y, x=Xx=Xx=X around the boundary point (0,∞)(0,\infty)(0,∞) of P1×P1\mathbb P^1\times\mathbb P^1P1×P1.

Then the map (X,Y)↦(1/Y,X)(X,Y)\mapsto(1/Y,X)(X,Y)↦(1/Y,X) sends the points of the affine curve with Y≠0Y\ne0Y=0 exactly onto the points of the chart curve with v≠0v\ne0v=0:

{(1/Y, X): (X,Y)∈C2, Pα(X,Y)=0, Y≠0}={(v,x)∈C2: Q(v,x)=0, v≠0}.\bigl\{(1/Y,\,X):\ (X,Y)\in\mathbb C^2,\ P_\alpha(X,Y)=0,\ Y\ne0\bigr\}=\bigl\{(v,x)\in\mathbb C^2:\ Q(v,x)=0,\ v\ne0\bigr\}.{(1/Y,X): (X,Y)∈C2, Pα​(X,Y)=0, Y=0}={(v,x)∈C2: Q(v,x)=0, v=0}.

This is the explicit correspondence, in both directions, between the affine curve Pα=0P_\alpha=0Pα​=0 off the axis Y=0Y=0Y=0 and the second mixed chart curve off its axis v=0v=0v=0. The formalization uses it when the four standard charts are glued, to show that the zero set of the bihomogeneous equation lies in the closure of the curve (6) in P1×P1\mathbb P^1\times\mathbb P^1P1×P1.

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_affine_points_image (m : ℕ) (α : ℂ) :
    (fun z : Fin 2 → ℂ => ![(z 1)⁻¹, z 0]) ''
      {z | eval z (familyPolynomial m α) = 0 ∧ z 1 ≠ 0} =
      {w : Fin 2 → ℂ | eval w (familyMixedPolynomial m (star α) α) = 0 ∧
        w 0 ≠ 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