Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

An exponential polynomial is controlled by its first derivatives at the origin

Proved
FourExp.expPoly_value_le_derivs

by carlok · Sep 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

complex-analysisexponential-polynomialstranscendence

Values of an exponential polynomial are bounded by its low-order derivatives at 000.

Let w1,…,wlw_1, \dots, w_lw1​,…,wl​ be distinct complex numbers with ∣wj∣≤W|w_j| \le W∣wj​∣≤W for some W≥0W \ge 0W≥0. For each jjj let PjP_jPj​ be a polynomial that is zero or has degree less than qjq_jqj​, and put

g(z)=∑jPj(z) ewjz,n=∑jqj.g(z) = \sum_j P_j(z)\,e^{w_j z}, \qquad n = \sum_j q_j .g(z)=j∑​Pj​(z)ewj​z,n=j∑​qj​.

If ∣g(s)(0)∣≤D|g^{(s)}(0)| \le D∣g(s)(0)∣≤D for every s<ns < ns<n, then for every uuu with ∣u∣≤R|u| \le R∣u∣≤R

∣g(u)∣  ≤  n (W+1)n+1 eR(W+1) D.|g(u)| \;\le\; n\,(W+1)^{n+1}\,e^{R(W+1)}\,D .∣g(u)∣≤n(W+1)n+1eR(W+1)D.

Proof idea (van der Poorten's method, as in Waldschmidt 1971).

  • The nnn numbers g(s)(0)g^{(s)}(0)g(s)(0), s<ns < ns<n, determine the coefficients of ggg. The system is a confluent Vandermonde determinant Δ≠0\Delta \ne 0Δ=0, so Cramer's rule gives Δ g(u)=∑sas(u) g(s)(0)\Delta\,g(u) = \sum_s a_s(u)\,g^{(s)}(0)Δg(u)=∑s​as​(u)g(s)(0).
  • The as(u)a_s(u)as​(u) are the coefficients of the Hermite interpolation polynomial of z↦euzz \mapsto e^{uz}z↦euz at the nodes wjw_jwj​, each with multiplicity qjq_jqj​.
  • Newton's form with divided differences, written as contour integrals over ∣γ∣=W+1|\gamma| = W + 1∣γ∣=W+1, gives ∑s∣as(u)∣≤n (W+1)n+1eR(W+1) ∣Δ∣\sum_s |a_s(u)| \le n\,(W+1)^{n+1} e^{R(W+1)}\,|\Delta|∑s​∣as​(u)∣≤n(W+1)n+1eR(W+1)∣Δ∣.

Why polynomial coefficients. Rescaling z↦c+z/tz \mapsto c + z/tz↦c+z/t keeps a function in this form (compose each PjP_jPj​ with an affine map), and FourExp.expPoly_zero_count_scaled needs exactly that.

What it is for. It is the second estimate behind FourExp.expPoly_zero_count_scaled.

Preamble
import Mathlib

open Finset
Formal statement
namespace FourExp

theorem expPoly_value_le_derivs
    {l : ℕ} (q : Fin l → ℕ) (w : Fin l → ℂ) (hw : Function.Injective w)
    (P : Fin l → Polynomial ℂ) (hP : ∀ j, P j = 0 ∨ (P j).natDegree < q j)
    (W R D : ℝ) (hW0 : 0 ≤ W) (hW : ∀ j, ‖w j‖ ≤ W) (hR : 0 ≤ R)
    (hD : ∀ s : ℕ, s < ∑ j, q j →
      ‖iteratedDeriv s (fun z : ℂ => ∑ j, (P j).eval z * Complex.exp (w j * z)) 0‖ ≤ D)
    (u : ℂ) (hu : ‖u‖ ≤ R) :
    ‖∑ j, (P j).eval u * Complex.exp (w j * u)‖
      ≤ ((∑ j, q j : ℕ) : ℝ) * (W + 1) ^ ((∑ j, q j) + 1) * Real.exp (R * (W + 1)) * D := by
  sorry

end FourExp
Source
M. Waldschmidt, Indépendance algébrique des valeurs de la fonction exponentielle, Bull. Soc. Math. France 99 (1971), 285–304, §4, (4.5)–(4.13).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me