Waldschmidt's parameters exceed the zero count
ProvedFourExp.construction_countfour-exponentialsnumber-theorytranscendence
The parameters of the construction beat the zero count.
For there is such that for every integer , with
and , one has
Why. , while . The second term is . The floors cost only lower-order terms. Numerically the ratio of the two sides tends to ; the threshold grows with and , for instance about for and about for .
What it is for. With and , this is the zero-count hypothesis of FourExp.nonvanishing_derivative for the parameters of FourExp.construction_core.
Preamble
import Mathlib
Formal statement
namespace FourExp
theorem construction_count (X Y₁ Y₂ : ℝ) (hX : 0 ≤ X) (hY₁ : 0 ≤ Y₁) (hY₂ : 0 ≤ Y₂) :
∃ N₀ : ℕ, ∀ N : ℕ, N₀ < N →
((((⌊(N : ℝ) ^ 2 * Real.sqrt (Real.log (N : ℝ))⌋₊) * (2 * N) * (2 * N) : ℕ) : ℝ) / (1 / 20 : ℝ)
+ 2 * (1 + (((⌊(N : ℝ) ^ 2 * Real.sqrt (Real.log (N : ℝ))⌋₊) * (2 * N) * (2 * N) : ℕ) : ℝ) ^ (1 / 20 : ℝ)) / ((1 / 20 : ℝ) * Real.log ((((⌊(N : ℝ) ^ 2 * Real.sqrt (Real.log (N : ℝ))⌋₊) * (2 * N) * (2 * N) : ℕ) : ℝ)))
* (1 + (((14 * ⌊(N : ℝ) / Real.sqrt (Real.log (N : ℝ))⌋₊) : ℕ) * Y₁ + ((14 * ⌊(N : ℝ) * Real.sqrt (Real.log (N : ℝ))⌋₊) : ℕ) * Y₂) * (((2 * N) : ℕ) * X))
≤ ((((14 * ⌊(N : ℝ) / Real.sqrt (Real.log (N : ℝ))⌋₊)) * ((14 * ⌊(N : ℝ) * Real.sqrt (Real.log (N : ℝ))⌋₊)) * (⌊(N : ℝ) ^ 2 * Real.sqrt (Real.log (N : ℝ))⌋₊ / 2) : ℕ) : ℝ)) := by
sorry
end FourExpSource
Asymptotic check of the parameters of M. Waldschmidt, Solution du huitième problème de Schneider, J. Number Theory 5 (1973), 191–202, formula (4) and Lemma 6, against the zero estimate of M. Waldschmidt, Bull. Soc. Math. France 99 (1971), §4, Lemma 3. Superseded: stated for S = floor(N^2 sqrt(log N)) rather than the 1973 text's S = floor(N^2 / sqrt(log N)). The inequality holds for both choices, but only the second is the one the construction needs. Replaced by FourExp.construction_count_1973, which is Proved.