Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Extrapolation from the vanishing grid (Waldschmidt 1973, Lemma 5)

Proved
FourExp.extrapolation

by carlok · Sep 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

four-exponentialsnumber-theorytranscendence

Small derivatives on a larger grid. Let x1,x2∈Cx_1, x_2 \in \mathbb{C}x1​,x2​∈C and let y1,y2y_1, y_2y1​,y2​ be Q\mathbb{Q}Q-linearly independent. For every κ>0\kappa > 0κ>0 there are κ′>0\kappa' > 0κ′>0 and N0N_0N0​ such that for every N>N0N > N_0N>N0​ the following holds, with

S=⌊N2/log⁡N⌋,T=2N,t1=⌊N/log⁡N⌋,t2=⌊Nlog⁡N⌋,R1=14t1,R2=14t2,S′=⌊S/2⌋.S = \lfloor N^2/\sqrt{\log N}\rfloor,\quad T = 2N,\quad t_1 = \lfloor N/\sqrt{\log N}\rfloor,\quad t_2 = \lfloor N\sqrt{\log N}\rfloor,\quad R_1 = 14t_1,\quad R_2 = 14t_2,\quad S' = \lfloor S/2\rfloor.S=⌊N2/logN​⌋,T=2N,t1​=⌊N/logN​⌋,t2​=⌊NlogN​⌋,R1​=14t1​,R2​=14t2​,S′=⌊S/2⌋.

Suppose the coefficients satisfy ∣c(i,j,k′)∣≤eκN2log⁡N|c(i,j,k')| \le e^{\kappa N^2\sqrt{\log N}}∣c(i,j,k′)∣≤eκN2logN​ and F(m)(ay1+by2)=0F^{(m)}(ay_1+by_2) = 0F(m)(ay1​+by2​)=0 for a<t1a<t_1a<t1​, b<t2b<t_2b<t2​, m<Sm<Sm<S, where

F(z)=∑i<S ∑j,k′<2Nc(i,j,k′) zi e(jx1+k′x2)z.F(z) = \sum_{i<S}\ \sum_{j,k'<2N} c(i,j,k')\, z^i\, e^{(jx_1+k'x_2)z}.F(z)=i<S∑​ j,k′<2N∑​c(i,j,k′)zie(jx1​+k′x2​)z.

Then ∣F(s)(ay1+by2)∣≤exp⁡(−N4log⁡N/κ′)|F^{(s)}(ay_1+by_2)| \le \exp(-N^4\sqrt{\log N}/\kappa')∣F(s)(ay1​+by2​)∣≤exp(−N4logN​/κ′) for all s<S′s<S's<S′, a<R1a<R_1a<R1​, b<R2b<R_2b<R2​.

Proof sketch. For s<S/2s < S/2s<S/2, F(s)F^{(s)}F(s) vanishes to order at least S/2S/2S/2 at the t1t2≈N2t_1t_2 \approx N^2t1​t2​≈N2 points of the small grid. Apply FourExp.cauchy_estimate_with_zeros (Proved) on a disc of radius NSNSNS around the target point, bounding F(s)F^{(s)}F(s) there by Cauchy's estimate. The zeros gain ≈t1t2 (S/2)log⁡N2≈N4log⁡N\approx t_1t_2\,(S/2)\log N^2 \approx N^4\sqrt{\log N}≈t1​t2​(S/2)logN2≈N4logN​. The cost is Slog⁡S+O(N⋅NS)=O(N4/log⁡N)S\log S + O(N\cdot NS) = O(N^4/\sqrt{\log N})SlogS+O(N⋅NS)=O(N4/logN​).

A purely analytic lemma; x1,x2x_1, x_2x1​,x2​ are arbitrary.

Preamble
import Mathlib
Formal statement
namespace FourExp

theorem extrapolation
    (x₁ x₂ y₁ y₂ : ℂ) (hy : LinearIndependent ℚ ![y₁, y₂]) (κ : ℝ) (hκ : 0 < κ) :
    ∃ κ' : ℝ, 0 < κ' ∧ ∃ N₀ : ℕ, ∀ N : ℕ, N₀ < N →
      ∀ c : Fin ⌊(N : ℝ) ^ 2 / Real.sqrt (Real.log (N : ℝ))⌋₊ → Fin (2 * N) → Fin (2 * N) → ℂ,
      (∀ i j k', ‖c i j k'‖ ≤ Real.exp (κ * ((N : ℝ) ^ 2 * Real.sqrt (Real.log (N : ℝ))))) →
      (∀ a b m : ℕ, a < ⌊(N : ℝ) / Real.sqrt (Real.log (N : ℝ))⌋₊ → b < ⌊(N : ℝ) * Real.sqrt (Real.log (N : ℝ))⌋₊ → m < ⌊(N : ℝ) ^ 2 / Real.sqrt (Real.log (N : ℝ))⌋₊ →
        iteratedDeriv m (fun z : ℂ => ∑ i : Fin ⌊(N : ℝ) ^ 2 / Real.sqrt (Real.log (N : ℝ))⌋₊, ∑ j : Fin (2 * N), ∑ k' : Fin (2 * N),
              c i j k' * z ^ (i : ℕ) * Complex.exp ((((j : ℕ) : ℂ) * x₁ + ((k' : ℕ) : ℂ) * x₂) * z)) ((a : ℂ) * y₁ + (b : ℂ) * y₂) = 0) →
      ∀ s : ℕ, s < ⌊(N : ℝ) ^ 2 / Real.sqrt (Real.log (N : ℝ))⌋₊ / 2 → ∀ a b : ℕ, a < 14 * ⌊(N : ℝ) / Real.sqrt (Real.log (N : ℝ))⌋₊ → b < 14 * ⌊(N : ℝ) * Real.sqrt (Real.log (N : ℝ))⌋₊ →
        ‖iteratedDeriv s (fun z : ℂ => ∑ i : Fin ⌊(N : ℝ) ^ 2 / Real.sqrt (Real.log (N : ℝ))⌋₊, ∑ j : Fin (2 * N), ∑ k' : Fin (2 * N),
              c i j k' * z ^ (i : ℕ) * Complex.exp ((((j : ℕ) : ℂ) * x₁ + ((k' : ℕ) : ℂ) * x₂) * z)) ((a : ℂ) * y₁ + (b : ℂ) * y₂)‖
          ≤ Real.exp (-(((N : ℝ) ^ 4 * Real.sqrt (Real.log (N : ℝ))) / κ')) := by
  sorry

end FourExp
Source
M. Waldschmidt, Solution du huitième problème de Schneider, J. Number Theory 5 (1973), 191–202, Lemma 5.

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