Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Waldschmidt's parameters exceed the zero count

Proved
FourExp.construction_count

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

four-exponentialsnumber-theorytranscendence

The parameters of the construction beat the zero count.

For X,Y1,Y2≥0X, Y_1, Y_2 \ge 0X,Y1​,Y2​≥0 there is N0N_0N0​ such that for every integer N>N0N > N_0N>N0​, with

S=⌊N2log⁡N⌋,T=2N,R1=14⌊N/log⁡N⌋,R2=14⌊Nlog⁡N⌋,S′=⌊S/2⌋,λ=120,S = \lfloor N^2\sqrt{\log N}\rfloor,\quad T = 2N,\quad R_1 = 14\lfloor N/\sqrt{\log N}\rfloor,\quad R_2 = 14\lfloor N\sqrt{\log N}\rfloor,\quad S' = \lfloor S/2\rfloor,\quad \lambda = \tfrac1{20},S=⌊N2logN​⌋,T=2N,R1​=14⌊N/logN​⌋,R2​=14⌊NlogN​⌋,S′=⌊S/2⌋,λ=201​,

and n=ST2n = ST^2n=ST2, one has

nλ+2 1+nλλlog⁡n(1+(R1Y1+R2Y2) TX)  ≤  R1R2S′.\frac{n}{\lambda} + 2\,\frac{1 + n^{\lambda}}{\lambda\log n}\bigl(1 + (R_1Y_1 + R_2Y_2)\,T X\bigr) \;\le\; R_1R_2S' .λn​+2λlogn1+nλ​(1+(R1​Y1​+R2​Y2​)TX)≤R1​R2​S′.

Why. n/λ≈80 N4log⁡Nn/\lambda \approx 80\,N^4\sqrt{\log N}n/λ≈80N4logN​, while R1R2S′≈98 N4log⁡NR_1R_2S' \approx 98\,N^4\sqrt{\log N}R1​R2​S′≈98N4logN​. The second term is O(N2.2log⁡N)O\bigl(N^{2.2}\sqrt{\log N}\bigr)O(N2.2logN​). The floors cost only lower-order terms. Numerically the ratio of the two sides tends to 80/98≈0.81680/98 \approx 0.81680/98≈0.816; the threshold N0N_0N0​ grows with XXX and YiY_iYi​, for instance about 565656 for X=Yi=10X = Y_i = 10X=Yi​=10 and about 5 6005\,6005600 for X=Yi=1000X = Y_i = 1000X=Yi​=1000.

What it is for. With X=∣x1∣+∣x2∣X = |x_1| + |x_2|X=∣x1​∣+∣x2​∣ and Yi=∣yi∣Y_i = |y_i|Yi​=∣yi​∣, 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 FourExp
Source
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.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me