A monotone degree-uniform cutoff for both polynomial chart jets
ProvedWeierstrassEllipticZeta.elliptic_extension_degree_uniform_jet_cutoffFor complex parameters , consider the two polynomial derivations on four-variable polynomial rings over :
in variables , and
in variables .
For every fixed pair , there is a nondecreasing function with for every , such that for both charts, every polynomial (respectively ) of total degree at most , and every evaluation point ,
The same cutoff function works for all polynomial coefficients, both charts and all evaluation points. It may depend on the fixed parameters . The degree parameter is denoted here to distinguish it from the coordinate of the second chart. No cubic equation or nonzero denominator is required at the evaluation point; this is a theorem about polynomial derivations on the ambient affine coordinate rings.
The proof introduces formal coefficient variables for a finite basis of the vector space of polynomials of bounded degree. The resulting universal jet polynomials lie in a polynomial ring with finitely many variables. Noetherian stabilization yields a cutoff before specializing either the coefficients or the evaluation point. Taking a maximum over both charts and all smaller degrees makes the cutoff function nondecreasing.
Formalization Note The result is qualitative: it supplies a finite function of degree without claiming an explicit growth rate. Zero polynomials and degree zero are included. In Lean, chart indices 0 and 1 denote the homogeneous-coordinate charts 0 and 2.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveChartCalculus import Mathlib.Algebra.MvPolynomial.Degrees open WeierstrassEllipticZeta MvPolynomial
theorem WeierstrassEllipticZeta.elliptic_extension_degree_uniform_jet_cutoff (g₂ g₃ : ℂ) :
∃ B : ℕ → ℕ, Monotone B ∧ (∀ d : ℕ, 0 < B d) ∧
∀ (d : ℕ) (c : Fin 2) (p : MvPolynomial (Fin 4) ℂ), p.totalDegree ≤ d →
∀ v : Fin 4 → ℂ,
((∀ k < B d, eval v ((extensionChartDerivation g₂ g₃ c)^[k] p) = 0) ↔
∀ k : ℕ, eval v ((extensionChartDerivation g₂ g₃ c)^[k] p) = 0) := by sorry