Schwarz's lemma on the lattice grid {Σ s_j y_j}, then Cauchy's inequality: a bound for the derivatives of the first non-vanishing order
ProvedTranscendence.grid_schwarz_cauchyLet be a finite set with , and let be a basis of . There is a constant with the following property. Let be an entire function on , let , and be integers, and let and be real numbers. Suppose that every derivative of of total order less than vanishes at every point with , and that on the closed polydisc of radius about . Then at every such point, the derivative of along any list of coordinate directions has modulus at most
It is step 5 of §4.6 of Waldschmidt's book, for any entire function: Schwarz's lemma for Cartesian products (Transcendence.cartesian_schwarz) is applied to on the grid , and Cauchy's inequality (Transcendence.polydisc_cauchy) on the unit polydisc about the grid point; plays the role of the book's .
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: step 5 of §4.6 of the book (p. 140). The book applies Proposition 4.7 to under a vanishing hypothesis (every exponent below ) that this change of variables does not preserve; vanishing by total order, assumed here, is preserved. The contribution of this node is the formal proof.
import Mathlib
namespace Transcendence
/-- **Schwarz's lemma on a lattice grid, then Cauchy's inequality** (Waldschmidt, *Diophantine Approximation on
Linear Algebraic Groups*, Prop. 4.7, moved to the grid `{Σ_j s_j y_j : 0 ≤ s_j < S₁}` by `z ↦ Σ_j z_j y_j`). Let
`(y_j)` be a basis of `ℂ^ι`, `n = |ι| ≥ 1`. There is a constant `c ≥ 1` such that for every entire function `F`
on `ℂ^ι`: if every derivative of `F` of total order `< M` vanishes at every grid point, where `n S₀ ≤ M`, and
`|F| ≤ B` on the polydisc of radius `c S₁ ρ` (`S₁ ≥ 1`, `ρ ≥ 1`), then every mixed partial derivative of order
`M` of `F` at a grid point, along coordinate directions, is at most `M! · n ρ^{-S₀S₁} B`. -/
theorem grid_schwarz_cauchy {ι : Type*} [Fintype ι] [DecidableEq ι] (hn : 0 < Fintype.card ι)
(y : ι → ι → ℂ) (hy : LinearIndependent ℂ y) :
∃ c : ℝ, 1 ≤ c ∧ ∀ F : (ι → ℂ) → ℂ, AnalyticOnNhd ℂ F Set.univ →
∀ (S₀ S₁ M : ℕ) (ρ B : ℝ), 1 ≤ S₁ → 1 ≤ ρ → Fintype.card ι * S₀ ≤ M →
(∀ k < M, ∀ s : ι → Fin S₁, iteratedFDeriv ℂ k F (∑ j, ((s j : ℕ) : ℂ) • y j) = 0) →
(∀ w : ι → ℂ, ‖w‖ ≤ c * S₁ * ρ → ‖F w‖ ≤ B) →
∀ (s : ι → Fin S₁) (L : Fin M → ι),
‖iteratedFDeriv ℂ M F (∑ j, ((s j : ℕ) : ℂ) • y j) (fun l => Pi.single (L l) 1)‖ ≤
M.factorial * (Fintype.card ι * ρ⁻¹ ^ (S₀ * S₁) * B) := by
sorry
end Transcendence