Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The Taylor polynomial of Σ c_λ φ_λ at 0 as linear forms in the c_λ, with coefficients bounded by Cauchy's inequalities

Proved
Transcendence.taylor_coeff_forms

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

diaz-modulus-leannumber-theorytranscendence

Let ι\iotaι and Λ\LambdaΛ be finite sets, let φλ\varphi_\lambdaφλ​ (λ∈Λ\lambda \in \Lambdaλ∈Λ) be entire functions on Cι\mathbb{C}^\iotaCι with ∣φλ∣≤Bλ|\varphi_\lambda| \le B_\lambda∣φλ​∣≤Bλ​ on the closed polydisc of radius r>0r > 0r>0 about 000, and let T∈NT \in \mathbb{N}T∈N. There are complex numbers uτλu_{\tau\lambda}uτλ​, for λ∈Λ\lambda \in \Lambdaλ∈Λ and multi-indices τ\tauτ in the box {0,…,T−1}ι\{0, \dots, T-1\}^\iota{0,…,T−1}ι, with ∣uτλ∣≤Bλ|u_{\tau\lambda}| \le B_\lambda∣uτλ​∣≤Bλ​, such that for all c∈CΛc \in \mathbb{C}^\Lambdac∈CΛ and z∈Cιz \in \mathbb{C}^\iotaz∈Cι the function F=∑λcλφλF = \sum_\lambda c_\lambda\varphi_\lambdaF=∑λ​cλ​φλ​ satisfies

∑k<T1k! DkF(0)(z,…,z)=∑τ(∑λuτλ cλ)∏ν∈ι(zνr)τν,\sum_{k < T}\frac{1}{k!}\,D^kF(0)(z, \dots, z) = \sum_{\tau}\Bigl(\sum_{\lambda} u_{\tau\lambda}\,c_\lambda\Bigr)\prod_{\nu \in \iota}\Bigl(\frac{z_\nu}{r}\Bigr)^{\tau_\nu},k<T∑​k!1​DkF(0)(z,…,z)=τ∑​(λ∑​uτλ​cλ​)ν∈ι∏​(rzν​​)τν​,

where DkFD^kFDkF is the kkk-th Fréchet derivative.

The TnT^nTn linear forms c↦∑λuτλcλc \mapsto \sum_\lambda u_{\tau\lambda}c_\lambdac↦∑λ​uτλ​cλ​ (n=∣ι∣n = |\iota|n=∣ι∣) are those to which Thue–Siegel's lemma is applied in the proof of Proposition 4.10 (Transcendence.siegel_small_values_of_count); when they are small, so is the Taylor polynomial of FFF on the polydisc of radius rrr.

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: a step of the proof of Proposition 4.10 of Waldschmidt's book (p. 135), where uτλu_{\tau\lambda}uτλ​ is Dτφλ(0) r∥τ∥/τ!D^\tau\varphi_\lambda(0)\,r^{\|\tau\|}/\tau!Dτφλ​(0)r∥τ∥/τ! times 2Tn2T^n2Tn, bounded by Cauchy's inequalities (p. XVII), here Transcendence.polydisc_cauchy. The forms are indexed by the box {0,…,T−1}ι\{0, \dots, T-1\}^\iota{0,…,T−1}ι, with TnT^nTn elements, the number that the book uses as a bound for the number of τ\tauτ with ∥τ∥<T\|\tau\| < T∥τ∥<T. The contribution of this node is the formal proof.

Preamble
import Mathlib
Formal statement
namespace Transcendence

/-- **Cauchy-bounded Taylor coefficients as linear forms** (Waldschmidt, *Diophantine Approximation on
Linear Algebraic Groups*, proof of Prop. 4.10 and Lemma 4.13; Cauchy's inequalities, p. XVII). Let `φ_λ`
(`λ ∈ Λ`) be entire functions on `ℂ^ι` with `|φ_λ| ≤ B_λ` on the closed polydisc of radius `r > 0` (the
sup-norm ball). There are complex numbers `u_{τλ}`, indexed by the multi-indices `τ` in the box
`{0, …, T-1}^ι`, with `|u_{τλ}| ≤ B_λ`, such that for every combination `Σ_λ c_λ φ_λ` the Taylor polynomial
of order `< T` at `0`, whose `k`-th term is `D^k F(0)(z, …, z) / k!`, equals
`Σ_τ (Σ_λ u_{τλ} c_λ) ∏_ν (z_ν / r)^{τ_ν}`. -/
theorem taylor_coeff_forms {ι Λ : Type*} [Fintype ι] [DecidableEq ι] [Fintype Λ]
    (φ : Λ → (ι → ℂ) → ℂ) (hφ : ∀ l, AnalyticOnNhd ℂ (φ l) Set.univ) {r : ℝ} (hr : 0 < r)
    (B : Λ → ℝ) (hB : ∀ l, ∀ z ∈ Metric.closedBall (0 : ι → ℂ) r, ‖φ l z‖ ≤ B l) (T : ℕ) :
    ∃ u : (ι → Fin T) → Λ → ℂ, (∀ τ l, ‖u τ l‖ ≤ B l) ∧
      ∀ (c : Λ → ℂ) (z : ι → ℂ),
        ∑ k ∈ Finset.range T, (k.factorial : ℂ)⁻¹ *
            iteratedFDeriv ℂ k (fun x => ∑ l, c l * φ l x) 0 (fun _ => z) =
          ∑ τ, (∏ ν, (z ν / r) ^ (τ ν : ℕ)) * ∑ l, u τ l * c l := by
  sorry

end Transcendence
Source
A step of the proof of M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren 326, Springer, 2000, Proposition 4.10 (p. 135), with Cauchy's inequalities (p. XVII). 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