Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

An integer combination of exponential monomials with small derivatives at the lattice points (4.16), and its growth

Proved
Transcendence.exists_exp_monomials_small_on_grid

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

diaz-modulus-leannumber-theorytranscendence

Let ι\iotaι be a finite set, n=∣ι∣n = |\iota|n=∣ι∣, k0∈ιk_0 \in \iotak0​∈ι, d0≤1d_0 \le 1d0​≤1 and d=d0+d1d = d_0 + d_1d=d0​+d1​, and let x1,…,xd1x_1, \dots, x_{d_1}x1​,…,xd1​​ and yjy_jyj​ (j∈ιj \in \iotaj∈ι) be vectors in Cι\mathbb{C}^\iotaCι with ∑i,ν∣xiν∣≤cx\sum_{i,\nu}|x_{i\nu}| \le c_x∑i,ν​∣xiν​∣≤cx​ and ∑j∥yj∥≤cy\sum_j\|y_j\| \le c_y∑j​∥yj​∥≤cy​, where ∥⋅∥\|\cdot\|∥⋅∥ is the sup norm. Let S1,T≥1S_1, T \ge 1S1​,T≥1 be integers, U,N>0U, N > 0U,N>0 and EEE real numbers, and put r=(cy+2)S1r = (c_y + 2)S_1r=(cy​+2)S1​ and R=ErR = ErR=Er. Assume

12n2≤N+2U,e≤E≤e(N+2U)/6,(T+1)dRTecxTR≤eU,(2(N+2U))n+1≤(T+1)dN(log⁡E)n.12n^2 \le N + 2U, \qquad e \le E \le e^{(N + 2U)/6}, \qquad (T+1)^{d}R^{T}e^{c_xTR} \le e^{U}, \qquad \bigl(2(N + 2U)\bigr)^{n+1} \le (T+1)^{d}N(\log E)^{n}.12n2≤N+2U,e≤E≤e(N+2U)/6,(T+1)dRTecx​TR≤eU,(2(N+2U))n+1≤(T+1)dN(logE)n.

Then there are integers pτ,tp_{\tau,t}pτ,t​ (0≤τ≤d0T0 \le \tau \le d_0T0≤τ≤d0​T, t∈{0,…,T}d1t \in \{0, \dots, T\}^{d_1}t∈{0,…,T}d1​), not all zero, with ∣pτ,t∣≤eN|p_{\tau,t}| \le e^{N}∣pτ,t​∣≤eN, such that the function

F(z)=∑τ,tpτ,t zk0τ e⟨t1x1+⋯+td1xd1, z⟩,⟨w,z⟩=∑νwνzν,F(z) = \sum_{\tau, t} p_{\tau,t}\, z_{k_0}^{\tau}\, e^{\langle t_1x_1 + \dots + t_{d_1}x_{d_1},\, z\rangle}, \qquad \langle w, z\rangle = \sum_\nu w_\nu z_\nu,F(z)=τ,t∑​pτ,t​zk0​τ​e⟨t1​x1​+⋯+td1​​xd1​​,z⟩,⟨w,z⟩=ν∑​wν​zν​,

satisfies:

  • at every point ∑jsjyj\sum_j s_jy_j∑j​sj​yj​ with 0≤sj<S10 \le s_j < S_10≤sj​<S1​, every derivative of FFF along a list of kkk coordinate directions has modulus at most k! e−Uk!\,e^{-U}k!e−U;
  • ∣F(w)∣≤(T+1)deNρTecxTρ|F(w)| \le (T+1)^{d}e^{N}\rho^{T}e^{c_xT\rho}∣F(w)∣≤(T+1)deNρTecx​Tρ whenever ρ≥1\rho \ge 1ρ≥1 and ∥w∥≤ρ\|w\| \le \rho∥w∥≤ρ.

The assumptions are those of Proposition 4.10 (Transcendence.siegel_small_values) for these (T+1)d(T+1)^d(T+1)d monomials, with V=UV = UV=U and the radii rrr and RRR. The first conclusion is (4.16), and the second is the growth bound that the Schwarz step of Transcendence.schneider_lang_cartesian needs.

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 3 of §4.6 of Waldschmidt's book and (4.16) (pp. 138–139), with V=UV = UV=U and the book's radii r=c2S1r = c_2S_1r=c2​S1​, R=ErR = ErR=Er, where cy+2c_y + 2cy​+2 replaces c2=∣y1∣+⋯+∣yn∣+2c_2 = |y_1| + \dots + |y_n| + 2c2​=∣y1​∣+⋯+∣yn​∣+2. The bound has k!k!k! in place of the book's σ!\sigma!σ!, which is at most k!k!k!. The contribution of this node is the formal proof.

Preamble
import Mathlib
Formal statement
namespace Transcendence

/-- **An auxiliary function that is small on the grid** (Waldschmidt, *Diophantine Approximation on Linear
Algebraic Groups*, §4.6, step 3 and (4.16)). Let `n = |ι|`, `d₀ ≤ 1`, `d = d₀ + d₁`, `cx ≥ Σ_{i,ν} |x_{iν}|` and
`cy ≥ Σ_j ‖y_j‖`, and let `S₁, T ≥ 1`, `U, N > 0` and `E` satisfy the conditions of Prop. 4.10 for the radii
`r = (cy + 2) S₁` and `R = E r`: `12n² ≤ N + 2U`, `e ≤ E ≤ e^{(N + 2U)/6}`,
`(T+1)^d R^T e^{cx T R} ≤ e^U` and `(2(N + 2U))^{n+1} ≤ (T+1)^d N (log E)ⁿ`. Then there are integers `p_{τ,t}`
(`0 ≤ τ ≤ d₀T`, `t ∈ {0, …, T}^{d₁}`), not all zero, with `|p_{τ,t}| ≤ e^N`, such that the function
`F(z) = Σ p_{τ,t} · z_{k₀}^τ · exp ⟨t₁x₁ + ⋯ + t_{d₁}x_{d₁}, z⟩` has every mixed partial derivative of order `k`
at every lattice point `Σ_j s_j y_j` (`0 ≤ s_j < S₁`) bounded by `k! e^{-U}`, and
`|F(w)| ≤ (T+1)^d e^N ρ^T e^{cx T ρ}` whenever `‖w‖ ≤ ρ` and `ρ ≥ 1`. -/
theorem exists_exp_monomials_small_on_grid {ι : Type*} [Fintype ι] [DecidableEq ι] {d₁ : ℕ}
    (x : Fin d₁ → ι → ℂ) (y : ι → ι → ℂ) (k₀ : ι) {d₀ : ℕ} (hd₀ : d₀ ≤ 1) {cx cy : ℝ}
    (hcx : ∑ i, ∑ ν, ‖x i ν‖ ≤ cx) (hcy : ∑ j, ‖y j‖ ≤ cy) {S₁ T : ℕ} {E U N : ℝ}
    (hS₁ : 1 ≤ S₁) (hT : 1 ≤ T) (hU : 0 < U) (hN : 0 < N)
    (hSL : 12 * (Fintype.card ι : ℝ) ^ 2 ≤ N + U + U ∧ Real.exp 1 ≤ E ∧
      E ≤ Real.exp ((N + U + U) / 6) ∧
      ((T : ℝ) + 1) ^ (d₀ + d₁) * (E * ((cy + 2) * S₁)) ^ T *
        Real.exp (cx * T * (E * ((cy + 2) * S₁))) ≤ Real.exp U ∧
      (2 * (N + U + U)) ^ (Fintype.card ι + 1) ≤
        ((T : ℝ) + 1) ^ (d₀ + d₁) * N * Real.log E ^ Fintype.card ι) :
    ∃ p : Fin (d₀ * T + 1) × (Fin d₁ → Fin (T + 1)) → ℤ, p ≠ 0 ∧
      (∀ l, |(p l : ℝ)| ≤ Real.exp N) ∧
      (∀ (s : ι → Fin S₁) (k : ℕ) (L : Fin k → ι),
        ‖iteratedFDeriv ℂ k (fun z : ι → ℂ => ∑ l, (p l : ℂ) * (z k₀ ^ (l.1 : ℕ) *
          Complex.exp (∑ ν, (∑ i, ((l.2 i : ℕ) : ℂ) * x i ν) * z ν))) (∑ j, ((s j : ℕ) : ℂ) • y j)
          (fun l => Pi.single (L l) 1)‖ ≤ k.factorial * Real.exp (-U)) ∧
      ∀ ρ : ℝ, 1 ≤ ρ → ∀ w : ι → ℂ, ‖w‖ ≤ ρ →
        ‖∑ l, (p l : ℂ) * (w k₀ ^ (l.1 : ℕ) *
          Complex.exp (∑ ν, (∑ i, ((l.2 i : ℕ) : ℂ) * x i ν) * w ν))‖ ≤
          ((T : ℝ) + 1) ^ (d₀ + d₁) * Real.exp N * ρ ^ T * Real.exp (cx * T * ρ) := by
  sorry

end Transcendence
Source
M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren 326, Springer, 2000, §4.6, step 3 and (4.16) (pp. 138–139). 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