The Taylor polynomial of Σ c_λ φ_λ at 0 as linear forms in the c_λ, with coefficients bounded by Cauchy's inequalities
ProvedTranscendence.taylor_coeff_formsLet and be finite sets, let () be entire functions on with on the closed polydisc of radius about , and let . There are complex numbers , for and multi-indices in the box , with , such that for all and the function satisfies
where is the -th Fréchet derivative.
The linear forms () 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 on the polydisc of radius .
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 is times , bounded by Cauchy's inequalities (p. XVII), here Transcendence.polydisc_cauchy. The forms are indexed by the box , with elements, the number that the book uses as a bound for the number of with . The contribution of this node is the formal proof.
import Mathlib
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