The choice of T, X and ℓ in the proof of Proposition 4.10 of Waldschmidt's book
ProvedTranscendence.siegel_small_values_parametersLet and be integers and real numbers with , , and
Then there are integers , and with , ,
These are the conditions under which Transcendence.siegel_small_values_of_count, with , gives Proposition 4.10 (Transcendence.siegel_small_values).
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 numerical part of the proof of Proposition 4.10 of Waldschmidt's book (pp. 135–136), with the book's , defined by , the book's , and an explicit number of cells for the box principle. It proves the book's inequality for , which is tight at , (). The contribution of this node is the formal proof.
import Mathlib
namespace Transcendence
/-- **The parameters of Prop. 4.10** (Waldschmidt, *Diophantine Approximation on Linear Algebraic Groups*,
proof of Prop. 4.10). Let `n ≥ 1` and `L` be integers and `N, U, V, r, R` reals with `r > 0`,
`W = N + U + V ≥ 12n²`, `e ≤ R/r ≤ e^{W/6}` and `(2W)^{n+1} ≤ L·N·(log(R/r))ⁿ`. Then there are integers
`T`, `X` and `ℓ ≥ 1` with `X ≤ e^N`, `ℓ^{2Tⁿ} < (X + 1)^L`, `Tⁿ · 2 e^U X / ℓ ≤ (3/4) e^{-V}` and
`X e^U (r/R)^T / (1 - r/R) ≤ (1/4) e^{-V}`. -/
theorem siegel_small_values_parameters {n L : ℕ} (hn : 0 < n) {N U V r R : ℝ} (hr : 0 < r)
(hW : 12 * (n : ℝ) ^ 2 ≤ N + U + V)
(hRe : Real.exp 1 * r ≤ R) (hRW : R ≤ r * Real.exp ((N + U + V) / 6))
(hmain : (2 * (N + U + V)) ^ (n + 1) ≤ L * N * Real.log (R / r) ^ n) :
∃ T X ℓ : ℕ, 0 < ℓ ∧ (X : ℝ) ≤ Real.exp N ∧ ℓ ^ (2 * T ^ n) < (X + 1) ^ L ∧
(T : ℝ) ^ n * (2 * (Real.exp U * X / ℓ)) ≤ 3 / 4 * Real.exp (-V) ∧
X * Real.exp U * (r / R) ^ T / (1 - r / R) ≤ 1 / 4 * Real.exp (-V) := by
sorry
end Transcendence