Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Cauchy's inequalities on a polydisc, for mixed derivatives along a list of directions

Proved
Transcendence.polydisc_cauchy

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

diaz-modulus-leannumber-theorytranscendence

Let FFF be an entire function on Cι\mathbb{C}^\iotaCι with ∣F∣≤M|F| \le M∣F∣≤M on the closed polydisc of centre ppp and radius ρ>0\rho > 0ρ>0 (the closed ball for the sup norm). For a list of directions L:{0,…,k−1}→ιL : \{0, \dots, k-1\} \to \iotaL:{0,…,k−1}→ι, let σν\sigma_\nuσν​ be the number of times ν\nuν occurs in LLL. Then

∣DkF(p) (eL(0),…,eL(k−1))∣≤(∏νσν!) Mρk,\Bigl|D^{k}F(p)\,(e_{L(0)}, \dots, e_{L(k-1)})\Bigr| \le \Bigl(\prod_\nu \sigma_\nu!\Bigr)\,\frac{M}{\rho^{k}},​DkF(p)(eL(0)​,…,eL(k−1)​)​≤(ν∏​σν​!)ρkM​,

where DkFD^kFDkF is the kkk-th Fréchet derivative and eνe_\nueν​ the coordinate vectors; in multi-index notation, ∣DσF(p)∣≤σ! Mρ−∣σ∣|D^\sigma F(p)| \le \sigma!\,M\rho^{-|\sigma|}∣DσF(p)∣≤σ!Mρ−∣σ∣.

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 classical Cauchy inequalities, in the form recorded in Waldschmidt's book (p. XVII). The contribution of this node is the formal proof.

Preamble
import Mathlib
Formal statement
namespace Transcendence

/-- **Cauchy's inequalities on a polydisc** (Waldschmidt, *Diophantine Approximation on Linear Algebraic
Groups*, p. XVII). Let `F` be an entire function of the variables `z_ν` (`ν ∈ ι`), bounded by `M` on the closed
polydisc of centre `p` and radius `ρ > 0` (the sup-norm ball). The mixed partial derivative of `F` at `p` along
the coordinate directions `L 0, …, L (k-1)`, of multi-index `σ_ν = #{l | L l = ν}` and total order `k`, satisfies
`|D^σ F(p)| ≤ σ! · M / ρ^k`, where `σ! = ∏_ν σ_ν!`. -/
theorem polydisc_cauchy {ι : Type*} [Fintype ι] [DecidableEq ι] {F : (ι → ℂ) → ℂ}
    (hF : AnalyticOnNhd ℂ F Set.univ) (p : ι → ℂ) {ρ M : ℝ} (hρ : 0 < ρ)
    (hM : ∀ z ∈ Metric.closedBall p ρ, ‖F z‖ ≤ M) (k : ℕ) (L : Fin k → ι) :
    ‖iteratedFDeriv ℂ k F p (fun l => Pi.single (L l) 1)‖ ≤
      (∏ ν, ((Finset.univ.filter fun l => L l = ν).card.factorial : ℝ)) * M / ρ ^ k := by
  sorry

end Transcendence
Source
Classical; the form used here is in M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren 326, Springer, 2000, 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