Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Iterated polynomial differentiation along a quadratic differential system

Proved
TranscendenceTheory.polynomial_ode_iterated_deriv

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

complex-analysisdifferential-equationspolynomials

Let III be a finite index set and let DDD be a Z\mathbb ZZ-linear derivation of Z[Xi:i∈I]\mathbb Z[X_i:i\in I]Z[Xi​:i∈I] such that

deg⁡(DXi)≤2(i∈I).\deg(DX_i)\le 2\qquad(i\in I).deg(DXi​)≤2(i∈I).

Let U⊆CU\subseteq\mathbb CU⊆C be open, and suppose fi:C→Cf_i:\mathbb C\to\mathbb Cfi​:C→C satisfies, at every z∈Uz\in Uz∈U,

fi′(z)=(DXi)(f(z)).f_i'(z)=(DX_i)(f(z)).fi′​(z)=(DXi​)(f(z)).

Here evaluation uses the canonical embedding of integer coefficients into C\mathbb CC, and existence of the displayed complex derivatives is part of the hypothesis. Then, for every integer polynomial ppp and every n≥0n\ge0n≥0,

deg⁡(Dnp)≤deg⁡p+n,dndznp(f(z))=(Dnp)(f(z))(z∈U).\deg(D^np)\le\deg p+n, \qquad \frac{d^n}{dz^n}p(f(z))=(D^np)(f(z))\quad(z\in U).deg(Dnp)≤degp+n,dzndn​p(f(z))=(Dnp)(f(z))(z∈U).

The total degree of the zero polynomial is taken to be zero. The statement includes constant polynomials, derivative order zero, an empty index set, and an empty open set. It gives the polynomial-presentation and degree step in the higher-derivative argument for Weierstrass elliptic and zeta functions; it makes no coefficient-height assertion.

Preamble
import Mathlib.Algebra.MvPolynomial.PDeriv
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.Calculus.IteratedDeriv.Lemmas
import Mathlib.Analysis.Calculus.Deriv.Mul
import Mathlib.Tactic.FinCases

noncomputable section

open MvPolynomial Filter
open scoped Topology

Formal statement
theorem TranscendenceTheory.polynomial_ode_iterated_deriv {σ : Type} [Fintype σ]
    (D : Derivation ℤ (MvPolynomial σ ℤ) (MvPolynomial σ ℤ))
    (hD : ∀ i, (D (X i)).totalDegree ≤ 2)
    (U : Set ℂ) (hU : IsOpen U) (f : σ → ℂ → ℂ)
    (hf : ∀ z ∈ U, ∀ i, HasDerivAt (f i)
      (eval₂ (Int.castRingHom ℂ) (fun i => f i z) (D (X i))) z)
    (p : MvPolynomial σ ℤ) (n : ℕ) :
    (D^[n] p).totalDegree ≤ p.totalDegree + n ∧
      ∀ z ∈ U, iteratedDeriv n
        (fun w => eval₂ (Int.castRingHom ℂ) (fun i => f i w) p) z =
          eval₂ (Int.castRingHom ℂ) (fun i => f i z) (D^[n] p) := by sorry
Source
Senthil Kumar K (2026), Section 4, Lemma 4, polynomial differentiation step in equations (8)-(10), used after the cleared addition expansion (7). This is the general quadratic polynomial differential-system lemma underlying that step, including constant coordinates; it isolates exact presentations and degree growth, not the coefficient-height part of Lemma 4. https://doi.org/10.1017/S001309152610145X

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