Polynomial chart jets, degree growth and analytic vanishing order
ProvedWeierstrassEllipticZeta.elliptic_extension_projective_chart_jetsFor complex parameters , consider the two polynomial derivations on four-variable polynomial rings over :
in variables , and
in variables . Their respective cubic polynomials are
Given five functions , the coordinate maps are
used on and , respectively. These are the affine coordinates for the zero and second homogeneous-coordinate charts of the elliptic-extension model.
Assume each is entire and that, on its domain , the coordinate map solves the displayed polynomial differential system: its coordinate derivatives equal the coefficients of evaluated at .
For , the derivation annihilates its cubic:
For every polynomial in the four coordinates and every integer ,
At each , the exact derivative identity is
and the vanishing-order criterion is
The analytic order is allowed to be infinite. These statements include 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 chart and index 1 denotes the chart. Complex parameters are fixed coefficients, so they contribute zero to total degree.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveChartCalculus import Mathlib.Analysis.Analytic.Order import Mathlib.Analysis.Calculus.IteratedDeriv.Lemmas open WeierstrassEllipticZeta
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