Schwarz's lemma for Cartesian products: vanishing on E₁×⋯×Eₙ makes an entire function small
ProvedTranscendence.cartesian_schwarzLet be an entire function of complex variables, and let be sets of points in the closed disc of radius . Suppose that every derivative of of total order less than vanishes at every point of , and that on the polydisc of radius . Then on the polydisc of radius
This is Proposition 4.7 of Waldschmidt's book in the form used for Baker's theorem. The book assumes vanishing of the partial derivatives with every exponent below , which the hypothesis here implies, and has in place of . Total order is the form the application needs: vanishing with every exponent below is not preserved by the linear change of variables in §4.6 of the book, while vanishing by total order is.
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).
Proof. One variable at a time: a one-dimensional Hermite division with explicit bounds (the book's step 2.4) and a telescoping over the coordinates, so only one-variable complex analysis is used.
Novelty. None for the statement (the book's Proposition 4.7, with a better constant). The contribution of this node is the formal proof.
import Mathlib
namespace Transcendence
/-- **Schwarz's lemma for Cartesian products** (Waldschmidt, *Diophantine Approximation on Linear Algebraic
Groups*, Prop. 4.7, in the form used for Baker's theorem). Let `f` be an entire function of `n ≥ 1` complex
variables, and let `E₁, …, Eₙ` be sets of `S₁` points in the closed disc of radius `r`. If every derivative of
`f` of total order `< n·S₀` vanishes at every point of `E₁ × ⋯ × Eₙ`, and `|f| ≤ M` on the polydisc of radius
`R ≥ 5r`, then `|f| ≤ n·(2·3ⁿ·r/R)^(S₀S₁)·M` on the polydisc of radius `r`. (The book assumes vanishing of the
partial derivatives with every exponent `< S₀`, which the hypothesis here implies, and has `18ⁿ` for `2·3ⁿ`.) -/
theorem cartesian_schwarz {n : ℕ} (hn : 0 < n) (f : (Fin n → ℂ) → ℂ) (hf : AnalyticOnNhd ℂ f Set.univ)
(E : Fin n → Finset ℂ) {S₀ S₁ : ℕ} (hE : ∀ i, (E i).card = S₁)
{r R M : ℝ} (hr : 0 < r) (hEr : ∀ i, ∀ ζ ∈ E i, ‖ζ‖ ≤ r) (hR : 5 * r ≤ R)
(hM : ∀ z ∈ Metric.closedBall (0 : Fin n → ℂ) R, ‖f z‖ ≤ M)
(hvan : ∀ ξ : Fin n → ℂ, (∀ i, ξ i ∈ E i) → ∀ k < n * S₀, iteratedFDeriv ℂ k f ξ = 0) :
∀ z ∈ Metric.closedBall (0 : Fin n → ℂ) r,
‖f z‖ ≤ n * (2 * 3 ^ n * r / R) ^ (S₀ * S₁) * M := by
sorry
end Transcendence