Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Th. 11.21 Step 7a: with S0=⌊S1μ(log⁡S1)ν⌋S_0 = \lfloor S_1^\mu (\log S_1)^\nu \rfloorS0​=⌊S1μ​(logS1​)ν⌋, T₀ = ⌊S₀/log S₁⌋, T₁ = ⌊S₀/S₁⌋, μ = d₁/(d−n), ν > (d₀+n)/(d−n), the constraint of Steps 3–5 holds for large S₁

Proved
DiazModulus.params_1122_eventually

by carlok · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Let d0,d1,n∈Nd_0, d_1, n \in \mathbb{N}d0​,d1​,n∈N with 1≤n<d=d0+d11 \leq n < d = d_0 + d_11≤n<d=d0​+d1​ and d0≤nd_0 \leq nd0​≤n, let C>0C > 0C>0 and ν>(d0+n)/(d−n)\nu > (d_0 + n)/(d - n)ν>(d0​+n)/(d−n). For S1∈NS_1 \in \mathbb{N}S1​∈N put S0=⌊S1d1/(d−n)(log⁡S1)ν⌋S_0 = \lfloor S_1^{d_1/(d - n)} (\log S_1)^\nu \rfloorS0​=⌊S1d1​/(d−n)​(logS1​)ν⌋, T0=⌊S0/log⁡S1⌋T_0 = \lfloor S_0 / \log S_1 \rfloorT0​=⌊S0​/logS1​⌋ and T1=⌊S0/S1⌋T_1 = \lfloor S_0 / S_1 \rfloorT1​=⌊S0​/S1​⌋. Then for all large S1S_1S1​: T0≥2T_0 \geq 2T0​≥2, T1≥2T_1 \geq 2T1​≥2, and C(S0log⁡(T0+T1+2)+T0log⁡(S1+2)+T1(S1+1))≤((T0+1)d0(2T1+1)d1)1/nC(S_0 \log(T_0 + T_1 + 2) + T_0 \log(S_1 + 2) + T_1(S_1 + 1)) \leq ((T_0 + 1)^{d_0} (2T_1 + 1)^{d_1})^{1/n}C(S0​log(T0​+T1​+2)+T0​log(S1​+2)+T1​(S1​+1))≤((T0​+1)d0​(2T1​+1)d1​)1/n.

Proof. Write x=S1x = S_1x=S1​, Λ=log⁡x\Lambda = \log xΛ=logx, e=d1/(d−n)≥1e = d_1/(d - n) \geq 1e=d1​/(d−n)≥1 and F=xeΛνF = x^e \Lambda^\nuF=xeΛν. As ν>0\nu > 0ν>0 and e≥1e \geq 1e≥1, F/x≥Λν→∞F/x \geq \Lambda^\nu \to \inftyF/x≥Λν→∞, so the floors give T0≥F/(2Λ)T_0 \geq F/(2\Lambda)T0​≥F/(2Λ), T1≥F/(2x)T_1 \geq F/(2x)T1​≥F/(2x), both ≥2\geq 2≥2, and T0≤F/ΛT_0 \leq F/\LambdaT0​≤F/Λ, T1≤F/xT_1 \leq F/xT1​≤F/x. The left side is at most KFΛK F \LambdaKFΛ with K=C(6+e+ν)K = C(6 + e + \nu)K=C(6+e+ν), and the right side at least ((F/(2Λ))d0(F/x)d1)1/n((F/(2\Lambda))^{d_0} (F/x)^{d_1})^{1/n}((F/(2Λ))d0​(F/x)d1​)1/n. Comparing logarithms, with log⁡F=eΛ+νlog⁡Λ\log F = e\Lambda + \nu \log\LambdalogF=eΛ+νlogΛ, the coefficient of Λ\LambdaΛ is (e(d−n)−d1)/n=0(e(d - n) - d_1)/n = 0(e(d−n)−d1​)/n=0 and that of log⁡Λ\log\LambdalogΛ is ((d−n)ν−d0−n)/n>0((d - n)\nu - d_0 - n)/n > 0((d−n)ν−d0​−n)/n>0, so the inequality holds once log⁡log⁡x\log\log xloglogx is large.

Novelty. Classical; routine formalisation. Step 7 of the proof of DALAG Th. 11.21: the parameters satisfy condition (11.22).

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem params_1122_eventually {d0 d1 n : ℕ} (hn : 1 ≤ n) (hnd : n < d0 + d1) (hd0n : d0 ≤ n)
    (C : ℝ) (hC : 0 < C) (ν : ℝ) (hν : ((d0 : ℝ) + n) / ((d0 : ℝ) + d1 - n) < ν) :
    ∀ᶠ S₁ : ℕ in Filter.atTop,
      2 ≤ ⌊(⌊(S₁ : ℝ) ^ ((d1 : ℝ) / (d0 + d1 - n)) * Real.log S₁ ^ ν⌋₊ : ℝ) / Real.log S₁⌋₊ ∧
      2 ≤ ⌊(⌊(S₁ : ℝ) ^ ((d1 : ℝ) / (d0 + d1 - n)) * Real.log S₁ ^ ν⌋₊ : ℝ) / S₁⌋₊ ∧
      C * (((⌊(S₁ : ℝ) ^ ((d1 : ℝ) / (d0 + d1 - n)) * Real.log S₁ ^ ν⌋₊ : ℕ) : ℝ) * Real.log (((⌊(⌊(S₁ : ℝ) ^ ((d1 : ℝ) / (d0 + d1 - n)) * Real.log S₁ ^ ν⌋₊ : ℝ) / Real.log S₁⌋₊ : ℕ) : ℝ)
            + ((⌊(⌊(S₁ : ℝ) ^ ((d1 : ℝ) / (d0 + d1 - n)) * Real.log S₁ ^ ν⌋₊ : ℝ) / S₁⌋₊ : ℕ) : ℝ) + 2)
          + ((⌊(⌊(S₁ : ℝ) ^ ((d1 : ℝ) / (d0 + d1 - n)) * Real.log S₁ ^ ν⌋₊ : ℝ) / Real.log S₁⌋₊ : ℕ) : ℝ) * Real.log ((S₁ : ℝ) + 2)
          + ((⌊(⌊(S₁ : ℝ) ^ ((d1 : ℝ) / (d0 + d1 - n)) * Real.log S₁ ^ ν⌋₊ : ℝ) / S₁⌋₊ : ℕ) : ℝ) * ((S₁ : ℝ) + 1))
        ≤ ((((⌊(⌊(S₁ : ℝ) ^ ((d1 : ℝ) / (d0 + d1 - n)) * Real.log S₁ ^ ν⌋₊ : ℝ) / Real.log S₁⌋₊) + 1) ^ d0 * (2 * (⌊(⌊(S₁ : ℝ) ^ ((d1 : ℝ) / (d0 + d1 - n)) * Real.log S₁ ^ ν⌋₊ : ℝ) / S₁⌋₊) + 1) ^ d1 : ℕ) : ℝ)
            ^ ((1 : ℝ) / n) := by
  sorry

end DiazModulus
Source
Step 7 (choice of parameters, condition (11.22)) of the proof of M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, Th. 11.21 (the linear subgroup theorem; proof in §11.7.1). C1.4 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 29 October 2026 (C. Perassi).

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