Factorial-exponential coefficient bounds for polynomial derivations
ProvedTranscendenceTheory.polynomial_derivation_length_bounddifferential-equationspolynomialstranscendence
Let be a finite set, let be a -linear derivation of , and let be an integer. Write
for the sum of the absolute values of the integer coefficients of a polynomial. Suppose that for each variable,
For every polynomial and integer ,
Each individual coefficient satisfies the same absolute-value bound. The estimate controls the arithmetic growth of the derivative polynomials in the elliptic auxiliary construction. Zero and constant polynomials, derivative order zero, and an empty variable set are included; the total degree of the zero polynomial is taken as zero.
Preamble
import Mathlib.Algebra.MvPolynomial.PDeriv import Mathlib.Data.Nat.Choose.Bounds import Mathlib.Tactic.Ring open MvPolynomial
Formal statement
theorem TranscendenceTheory.polynomial_derivation_length_bound {σ : Type} [Fintype σ]
(D : Derivation ℤ (MvPolynomial σ ℤ) (MvPolynomial σ ℤ))
(hD : ∀ i, (D (X i)).totalDegree ≤ 2)
(H : ℕ) (hHpos : 1 ≤ H)
(hH : ∀ i, (∑ m ∈ (D (X i)).support, ((D (X i)).coeff m).natAbs) ≤ H)
(p : MvPolynomial σ ℤ) (n : ℕ) :
(D^[n] p).totalDegree ≤ p.totalDegree + n ∧
(∑ m ∈ (D^[n] p).support, ((D^[n] p).coeff m).natAbs) ≤
(∑ m ∈ p.support, (p.coeff m).natAbs) * n.factorial *
(2 * H) ^ (p.totalDegree + n) := by sorry
Source
Algebraic coefficient-growth estimate underlying Senthil Kumar K (2026), Section 4 Lemma 4, equations (7)-(10) and the following height estimates. This is an explicit general derivation formulation of the differentiation argument, not a verbatim theorem from the paper. The elliptic specialization has H=12. https://doi.org/10.1017/S001309152610145X