Derivatives of an exponential polynomial at a grid point, presented when only e^{x₁y₂} and e^{x₂y₂} are algebraic
ProvedFourExp.exists_iteratedDeriv_presentation_columndiaz-modulus-leanexponential-polynomialsnumber-theorytranscendence
Let with and algebraic. Let and with and , , , where is evaluation at . Then there is such that for all there are with and polynomials (, ), of length (the sum of the absolute values of all integer coefficients) at most and of - and -degree at most , such that for all complex , with ,
This is FourExp.exists_iteratedDeriv_presentation with only one column of exponentials assumed algebraic, and a step in Lemmes 4 and 7 of Waldschmidt (1973); the degree bound becomes . At the exponential factor is . The powers of the algebraic column are reduced through integer relations and cost only height, while for costs degree in . FourExp.exists_iteratedDeriv_presentation_of_exp_factor gives the rest.
Preamble
import Mathlib
Formal statement
namespace FourExp
/-- Denominators and sizes of the derivatives of the auxiliary exponential polynomial at the
points `a y₁ + b y₂`, in the column case.
Write `φ(P) = P(ω, ω₁)` for `P ∈ ℤ[X][Y]` and `δ = φ(D) ≠ 0`, and suppose that `δ xᵢ`, `δ yⱼ`
and `δ e^(xᵢ yⱼ)` are values of integer polynomials under `φ`, with the column `e^(x₁ y₂)`,
`e^(x₂ y₂)` algebraic. For `F(z) = ∑_{i<S, j<T, k<T} f_{ijk} z^i e^((j x₁ + k x₂) z)` with
arbitrary complex coefficients, `Λ F⁽ᵐ⁾(a y₁ + b y₂) = ∑ f_{ijk} φ(P_{ijk})` with `Λ ≠ 0` and
`P_{ijk} ∈ ℤ[X][Y]` not depending on `f`.
At `ζ = a y₁ + b y₂` the exponential factor is
`e^(x₁y₁)^(ja) e^(x₂y₁)^(ka) e^(x₁y₂)^(jb) e^(x₂y₂)^(kb)`. The column powers are reduced through
integer annihilators, as in `FourExp.exists_iteratedDeriv_presentation`, and cost no degree. The
powers `n ≤ T a` of `e^(xᵢ y₁)` are presented as `δ^(T a) αⁿ = φ(Hᵢ₀ⁿ D^(T a - n))`, which adds
`c T a` to the degrees in `X` and in `Y`. The length and `Λ` bounds keep the shape of the
four-exponentials case. -/
theorem exists_iteratedDeriv_presentation_column
(x₁ x₂ y₁ y₂ : ℂ)
(hexp₂ : ∀ i : Fin 2, IsAlgebraic ℚ (Complex.exp (![x₁, x₂] i * y₂)))
(ω ω₁ : ℂ) (D : Polynomial (Polynomial ℤ)) (E G : Fin 2 → Polynomial (Polynomial ℤ))
(H : Fin 2 → Fin 2 → Polynomial (Polynomial ℤ))
(hD : Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ D ≠ 0)
(hE : ∀ i, ![x₁, x₂] i * Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ D =
Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ (E i))
(hG : ∀ j, ![y₁, y₂] j * Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ D =
Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ (G j))
(hH : ∀ i j, Complex.exp (![x₁, x₂] i * ![y₁, y₂] j) *
Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ D =
Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ (H i j)) :
∃ c : ℕ, ∀ S T a b m : ℕ, ∃ Λ : ℂ, Λ ≠ 0 ∧ ‖Λ‖ ≤ (c : ℝ) ^ (c * (1 + m + S + T * (a + b))) ∧
∃ P : Fin S → Fin T → Fin T → Polynomial (Polynomial ℤ),
(∀ i j k, ∑ r ∈ (P i j k).support, ∑ h ∈ ((P i j k).coeff r).support,
(((P i j k).coeff r).coeff h).natAbs ≤
c ^ (c * (1 + m + S + T * (a + b))) * (1 + m + S + T + a + b) ^ (c * (1 + m + S))) ∧
(∀ i j k r, ((P i j k).coeff r).natDegree ≤ c * (1 + m + S + T * a)) ∧
(∀ i j k, (P i j k).natDegree ≤ c * (1 + m + S + T * a)) ∧
∀ f : Fin S → Fin T → Fin T → ℂ,
Λ * iteratedDeriv m (fun z : ℂ => ∑ i : Fin S, ∑ j : Fin T, ∑ k : Fin T,
f i j k * z ^ (i : ℕ) * Complex.exp ((((j : ℕ) : ℂ) * x₁ + ((k : ℕ) : ℂ) * x₂) * z))
((a : ℂ) * y₁ + (b : ℂ) * y₂) =
∑ i : Fin S, ∑ j : Fin T, ∑ k : Fin T,
f i j k * Polynomial.eval₂ (Polynomial.eval₂RingHom (Int.castRingHom ℂ) ω) ω₁ (P i j k) := by
sorry
end FourExp
Source
A step in the proofs of Lemmes 4 and 7 of M. Waldschmidt, Solution du huitième problème de Schneider, J. Number Theory 5 (1973), 191–202 (pp. 197 and 200). Formal proof: Diaz modulus mission, 30 September 2026 (C. Perassi).