Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The tail of the Taylor series at 0 of an entire function bounded by M on the ball of radius R is at most M (r/R)^T / (1 − r/R) on the ball of radius r

Proved
Transcendence.taylor_tail_le

by carlok · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Let EEE be a complex normed space, let G:E→CG : E \to \mathbb{C}G:E→C be analytic at every point, with ∣G∣≤M|G| \le M∣G∣≤M on the closed ball of radius RRR about 000, and let 0<r<R0 < r < R0<r<R. For every z∈Ez \in Ez∈E with ∥z∥≤r\|z\| \le r∥z∥≤r and every T∈NT \in \mathbb{N}T∈N,

∣G(z)−∑k<T1k! DkG(0)(z,…,z)∣≤M (r/R)T1−r/R,\Bigl|G(z) - \sum_{k < T}\frac{1}{k!}\,D^kG(0)(z, \dots, z)\Bigr| \le \frac{M\,(r/R)^{T}}{1 - r/R},​G(z)−k<T∑​k!1​DkG(0)(z,…,z)​≤1−r/RM(r/R)T​,

where DkGD^kGDkG is the kkk-th Fréchet derivative.

In the proof of Proposition 4.10 (Transcendence.siegel_small_values_of_count) it bounds the tail of the Taylor expansion at the origin; on Cn\mathbb{C}^nCn with the sup norm, the balls are polydiscs.

It is one step of the proof of Baker's theorem formalised in this mission, which follows Chapter 4 of Waldschmidt's book: Baker's theorem from the criterion of Schneider–Lang for Cartesian products, as observed by Bertrand and Masser (1980).

Novelty. None: the bound for the tail in the proof of Lemma 4.13 of Waldschmidt's book (pp. 134–135), with the factor 1/(1−r/R)1/(1 - r/R)1/(1−r/R) in place of the book's 1+T1 + \sqrt{T}1+T​. The book bounds the tail by Schwarz's lemma and Parseval's formula; here Cauchy's inequality on the line through zzz bounds each term, and the terms are summed as a geometric series. The contribution of this node is the formal proof.

Preamble
import Mathlib
Formal statement
namespace Transcendence

/-- **The tail of a Taylor series** (Waldschmidt, *Diophantine Approximation on Linear Algebraic
Groups*, the tail half of Lemma 4.13, with Cauchy's inequality in place of Schwarz's lemma). Let `G` be an
entire function on a complex normed space `E`, bounded by `M` on the closed ball of radius `R`, and let
`0 < r < R`. For `‖z‖ ≤ r`, the Taylor polynomial of order `< T` of `G` at `0`, whose `k`-th term is
`D^k G(0)(z, …, z) / k!`, approximates `G z` within `M (r/R)^T / (1 - r/R)`. -/
theorem taylor_tail_le {E : Type*} [NormedAddCommGroup E] [NormedSpace ℂ E] {G : E → ℂ}
    (hG : AnalyticOnNhd ℂ G Set.univ) {r R M : ℝ} (hr : 0 < r) (hrR : r < R)
    (hM : ∀ x ∈ Metric.closedBall (0 : E) R, ‖G x‖ ≤ M) {z : E} (hz : ‖z‖ ≤ r) (T : ℕ) :
    ‖G z - ∑ k ∈ Finset.range T, (k.factorial : ℂ)⁻¹ * iteratedFDeriv ℂ k G 0 (fun _ => z)‖ ≤
      M * (r / R) ^ T / (1 - r / R) := by
  sorry

end Transcendence
Source
The tail bound in the proof of M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren 326, Springer, 2000, Lemma 4.13 (pp. 134–135), by Cauchy's inequality in place of Schwarz's lemma and Parseval's formula. Formal proof: Diaz modulus mission, 2 October 2026 (C. Perassi).

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