Liouville's lower bound (4.14) for the non-zero derivatives of an integer combination of exponential monomials at lattice points
ProvedTranscendence.exp_monomials_liouville_lowerLet be a finite set, and , and let and () be vectors in such that every coordinate and every is algebraic and, if , every is algebraic; here . There is a constant with the following property. Let and be integers, , and
with integers . If the derivative of along a list of coordinate directions, at a point with , is not zero, then
The proof of Transcendence.schneider_lang_cartesian sets it against two upper bounds: (4.16) for the derivatives of order less than , and the Schwarz step for the first non-vanishing one.
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: this is (4.14) of Waldschmidt's book (§4.6, step 2, p. 137) with , , and a bracket of a slightly different shape from the book's . The number field , a common denominator and a bound for the houses are built inside, and Liouville's inequality is Transcendence.liouville_house. The book states that can be computed explicitly; here , with and . The field contains the coordinates of the , which step 1 of the book leaves out of it. The contribution of this node is the formal proof.
import Mathlib
namespace Transcendence
/-- **Liouville's lower bound (4.14) for exponential monomials at lattice points** (Waldschmidt, *Diophantine
Approximation on Linear Algebraic Groups*, §4.6). Let the coordinates of `x₁, …, x_{d₁} ∈ ℂ^ι` and the numbers
`exp ⟨xᵢ, y_j⟩` be algebraic, let `d₀ ≤ 1`, and if `d₀ = 1` let every `y_{j k₀}` be algebraic. There is a constant
`C ≥ 1` such that for all `T ≥ 1`, `S₁`, `N ≥ 0` and integers `p_{τ,t}` with `|p_{τ,t}| ≤ e^N` (`0 ≤ τ ≤ d₀T`,
`t ∈ {0, …, T}^{d₁}`), every non-zero mixed partial derivative `D` of order `k`, along the coordinate directions
`L 0, …, L (k-1)`, of `F(z) = Σ p_{τ,t} · z_{k₀}^τ · exp ⟨t₁x₁ + ⋯ + t_{d₁}x_{d₁}, z⟩` at a lattice point
`Σ_j s_j y_j` (`0 ≤ s_j < S₁`) satisfies `log |D| ≥ -C (N + k (1 + log T) + T (S₁ + log (1 + k)))`. -/
theorem exp_monomials_liouville_lower {ι : Type*} [Fintype ι] [DecidableEq ι] {d₁ : ℕ}
(x : Fin d₁ → ι → ℂ) (hxalg : ∀ i ν, IsAlgebraic ℚ (x i ν)) (y : ι → ι → ℂ)
(hexp : ∀ i j, IsAlgebraic ℚ (Complex.exp (∑ ν, x i ν * y j ν))) (k₀ : ι) {d₀ : ℕ}
(hd₀ : d₀ ≤ 1) (hy₀ : d₀ = 1 → ∀ j, IsAlgebraic ℚ (y j k₀)) :
∃ C : ℝ, 1 ≤ C ∧ ∀ (T S₁ : ℕ) (p : Fin (d₀ * T + 1) × (Fin d₁ → Fin (T + 1)) → ℤ) (N : ℝ)
(s : ι → Fin S₁) (k : ℕ) (L : Fin k → ι),
1 ≤ T → 0 ≤ N → (∀ l, |(p l : ℝ)| ≤ Real.exp N) →
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) ≠ 0 →
-(C * (N + k * (1 + Real.log T) + T * (S₁ + Real.log (1 + k)))) ≤
Real.log ‖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)‖ := by
sorry
end Transcendence