Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two projective chart coordinate maps and polynomial derivations

Definition
WeierstrassEllipticZeta_ProjectiveChartCalculus

by tomasz · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

differential-equationselliptic-functionsprojective-geometrytranscendence

For complex parameters g2,g3g_2,g_3g2​,g3​, consider the two polynomial derivations on four-variable polynomial rings over C\mathbb CC:

D0=∂t+y∂x+(6x2−g2/2)∂y−x∂r\mathcal D_0=\partial_t+y\partial_x+(6x^2-g_2/2)\partial_y-x\partial_rD0​=∂t​+y∂x​+(6x2−g2​/2)∂y​−x∂r​

in variables (t,x,y,r)(t,x,y,r)(t,x,y,r), and

D2=∂t+(−6b2+g2a2/2)∂a+(−1/2−g2ab−3g3a2/2)∂b+(−2g2b2−3g3ab)∂d\mathcal D_2=\partial_t+(-6b^2+g_2a^2/2)\partial_a +(-1/2-g_2ab-3g_3a^2/2)\partial_b +(-2g_2b^2-3g_3ab)\partial_dD2​=∂t​+(−6b2+g2​a2/2)∂a​+(−1/2−g2​ab−3g3​a2/2)∂b​+(−2g2​b2−3g3​ab)∂d​

in variables (t,a,b,d)(t,a,b,d)(t,a,b,d). Their respective cubic polynomials are

G0=y2−4x3+g2x+g3,G2=a−4b3+g2a2b+g3a3.G_0=y^2-4x^3+g_2x+g_3,\qquad G_2=a-4b^3+g_2a^2b+g_3a^3.G0​=y2−4x3+g2​x+g3​,G2​=a−4b3+g2​a2b+g3​a3.

Given five functions Sj:C→CS_j:\mathbb C\to\mathbb CSj​:C→C, the coordinate maps are

f0(z)=(z,S1/S0,S2/S0,S3/S0)(z),f2(z)=(z,S0/S2,S1/S2,S4/S2)(z),f_0(z)=(z,S_1/S_0,S_2/S_0,S_3/S_0)(z),\qquad f_2(z)=(z,S_0/S_2,S_1/S_2,S_4/S_2)(z),f0​(z)=(z,S1​/S0​,S2​/S0​,S3​/S0​)(z),f2​(z)=(z,S0​/S2​,S1​/S2​,S4​/S2​)(z),

used on U0={S0≠0}U_0=\{S_0\ne0\}U0​={S0​=0} and U2={S2≠0}U_2=\{S_2\ne0\}U2​={S2​=0}, respectively. These are the affine coordinates for the zero and second homogeneous-coordinate charts of the elliptic-extension model.

This interface defines only the coordinate maps, derivations and cubic polynomials. Tangency, derivative identities, degree bounds and vanishing criteria are theorem obligations. Quotients are total functions; their chart interpretation is restricted to nonzero denominators. In Lean the chart indices 0 and 1 select homogeneous denominators S0S_0S0​ and S2S_2S2​, respectively.

Definition code
import Mathlib.Algebra.MvPolynomial.PDeriv
import Mathlib.Analysis.Complex.Basic

noncomputable section
namespace WeierstrassEllipticZeta
open MvPolynomial

/-- Chart index 0 selects X₀ ≠ 0; chart index 1 selects X₂ ≠ 0. -/
def extensionChartDenominator (c : Fin 2) : Fin 5 := if c = 0 then 0 else 2

/-- The additive coordinate and three affine coordinates in either projective chart. -/
def extensionChartCoordinates (S : Fin 5 → ℂ → ℂ) (c : Fin 2) (z : ℂ) : Fin 4 → ℂ :=
  if c = 0 then ![z, S 1 z / S 0 z, S 2 z / S 0 z, S 3 z / S 0 z]
  else ![z, S 0 z / S 2 z, S 1 z / S 2 z, S 4 z / S 2 z]

/-- Polynomial differentiation in the two affine charts. The differential
identities, degree bounds, tangency and jet interpretation are theorem obligations. -/
def extensionChartDerivation (g₂ g₃ : ℂ) (c : Fin 2) :
    Derivation ℂ (MvPolynomial (Fin 4) ℂ) (MvPolynomial (Fin 4) ℂ) :=
  mkDerivation ℂ (if c = 0 then
    ![1, X 2, C 6 * X 1 ^ 2 - C (g₂ / 2), -X 1]
  else
    ![1, C (-6) * X 2 ^ 2 + C (g₂ / 2) * X 1 ^ 2,
      C (-(1 / 2 : ℂ)) - C g₂ * X 1 * X 2 - C (3 * g₃ / 2) * X 1 ^ 2,
      C (-2 * g₂) * X 2 ^ 2 - C (3 * g₃) * X 1 * X 2])

/-- The affine Weierstrass cubic relation in each chart, with the first
variable reserved for the independent additive coordinate. -/
def extensionChartCubic (g₂ g₃ : ℂ) (c : Fin 2) : MvPolynomial (Fin 4) ℂ :=
  if c = 0 then X 2 ^ 2 - C 4 * X 1 ^ 3 + C g₂ * X 1 + C g₃
  else X 1 - C 4 * X 2 ^ 3 + C g₂ * X 1 ^ 2 * X 2 + C g₃ * X 1 ^ 3

end WeierstrassEllipticZeta
Source
Coordinate calculus derived from Senthil Kumar K (2026), Appendix A.2, the homogeneous and regular/lattice-point exponential-map and one-parameter-curve displays between (A.3) and (A.4), https://doi.org/10.1017/S001309152610145X. The derivation coefficients are those of the proved polynomial chart-flow lemma, obtained from DLMF 23.2.7, 23.3.10 and 23.3.12. Cubic equations are the dehomogenizations of the explicit Weierstrass cubic in the X0 and X2 charts.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me