Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Polynomial chart jets, degree growth and analytic vanishing order

Proved
WeierstrassEllipticZeta.elliptic_extension_projective_chart_jets

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.

Assume each SjS_jSj​ is entire and that, on its domain UcU_cUc​, the coordinate map fcf_cfc​ solves the displayed polynomial differential system: its coordinate derivatives equal the coefficients of Dc\mathcal D_cDc​ evaluated at fc(z)f_c(z)fc​(z).

For c∈{0,2}c\in\{0,2\}c∈{0,2}, the derivation annihilates its cubic:

DcGc=0.\mathcal D_cG_c=0.Dc​Gc​=0.

For every polynomial ppp in the four coordinates and every integer n≥0n\ge0n≥0,

deg⁡(Dcnp)≤deg⁡(p)+n.\deg(\mathcal D_c^n p)\le\deg(p)+n.deg(Dcn​p)≤deg(p)+n.

At each z∈Ucz\in U_cz∈Uc​, the exact derivative identity is

dndzn(p(fc(z)))=(Dcnp)(fc(z)),\frac{d^n}{dz^n}\big(p(f_c(z))\big)=(\mathcal D_c^n p)(f_c(z)),dzndn​(p(fc​(z)))=(Dcn​p)(fc​(z)),

and the vanishing-order criterion is

n≤ord⁡z(p∘fc)⟺(Dckp)(fc(z))=0for all 0≤k<n.n\le\operatorname{ord}_z(p\circ f_c) \quad\Longleftrightarrow\quad (\mathcal D_c^k p)(f_c(z))=0\quad\text{for all }0\le k<n.n≤ordz​(p∘fc​)⟺(Dck​p)(fc​(z))=0for all 0≤k<n.

The analytic order is allowed to be infinite. These statements include n=0n=0n=0 and the zero polynomial, using degree zero for the zero polynomial.

This supplies polynomial tests for all finite orders of vanishing in both projective charts, with controlled degree growth. No lattice point is excluded when its chart denominator is nonzero. The cubic identity permits differentiation modulo the cubic relation. The theorem concerns differential presentations and vanishing orders; the geometric multiplicity bound remains a separate obligation.

Formalization Note The two charts are indexed by Fin 2: index 0 denotes the X0X_0X0​ chart and index 1 denotes the X2X_2X2​ chart. Complex parameters are fixed coefficients, so they contribute zero to total degree.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveChartCalculus
import Mathlib.Analysis.Analytic.Order
import Mathlib.Analysis.Calculus.IteratedDeriv.Lemmas

open WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.elliptic_extension_projective_chart_jets
    (g₂ g₃ : ℂ) (S : Fin 5 → ℂ → ℂ)
    (hS : ∀ j, AnalyticOnNhd ℂ (S j) Set.univ)
    (hflow :
      (∀ z : ℂ, S 0 z ≠ 0 →
        HasDerivAt (fun w => S 1 w / S 0 w) (S 2 z / S 0 z) z ∧
        HasDerivAt (fun w => S 2 w / S 0 w) (6 * (S 1 z / S 0 z) ^ 2 - g₂ / 2) z ∧
        HasDerivAt (fun w => S 3 w / S 0 w) (-S 1 z / S 0 z) z) ∧
      (∀ z : ℂ, S 2 z ≠ 0 →
        HasDerivAt (fun w => S 0 w / S 2 w)
          (-6 * (S 1 z / S 2 z) ^ 2 + g₂ / 2 * (S 0 z / S 2 z) ^ 2) z ∧
        HasDerivAt (fun w => S 1 w / S 2 w)
          (-(1 / 2 : ℂ) - g₂ * (S 0 z / S 2 z) * (S 1 z / S 2 z) -
            3 * g₃ / 2 * (S 0 z / S 2 z) ^ 2) z ∧
        HasDerivAt (fun w => S 4 w / S 2 w)
          (-2 * g₂ * (S 1 z / S 2 z) ^ 2 -
            3 * g₃ * (S 0 z / S 2 z) * (S 1 z / S 2 z)) z)) :
    (∀ c : Fin 2, extensionChartDerivation g₂ g₃ c (extensionChartCubic g₂ g₃ c) = 0) ∧
    ∀ (c : Fin 2) (p : MvPolynomial (Fin 4) ℂ) (n : ℕ),
      ((extensionChartDerivation g₂ g₃ c)^[n] p).totalDegree ≤ p.totalDegree + n ∧
      ∀ z : ℂ, S (extensionChartDenominator c) z ≠ 0 →
        iteratedDeriv n (fun w => MvPolynomial.eval (extensionChartCoordinates S c w) p) z =
          MvPolynomial.eval (extensionChartCoordinates S c z)
            ((extensionChartDerivation g₂ g₃ c)^[n] p) ∧
        ((n : ℕ∞) ≤ analyticOrderAt
            (fun w => MvPolynomial.eval (extensionChartCoordinates S c w) p) z ↔
          ∀ k < n, MvPolynomial.eval (extensionChartCoordinates S c z)
            ((extensionChartDerivation g₂ g₃ c)^[k] p) = 0) := by sorry
Source
Derived from the polynomial differential equations of the one-parameter exponential curve in Senthil Kumar K (2026), Appendix A.2, the displays between (A.3) and (A.4), for the vanishing-along-the-curve hypotheses of Theorem A.2, https://doi.org/10.1017/S001309152610145X. The polynomial differentiation and degree argument generalizes the integer-coefficient platform theorem TranscendenceTheory.polynomial_ode_iterated_deriv (f33f6490-4860-4162-8a4e-3ab61a20213f), associated with Section 4, Lemma 4, equations (8)-(10), to complex coefficients. The exact vanishing criterion is Taylor theory, formalized by Mathlib natCast_le_analyticOrderAt_iff_iteratedDeriv_eq_zero. The chart-specific all-order assertion and cubic-annihilation identities are derived here, not quoted as a theorem of the source.

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