Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The growth functions of Waldschmidt's construction satisfy the criterion's hypotheses

Proved
FourExp.construction_growth

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

four-exponentialsnumber-theorytranscendence

Explicit growth functions.

For k>0k > 0k>0 put

σ1(x)=k⋅{x−3+9log⁡3,x≤3,x2log⁡x,x>3,σ2(x)=k⋅{x−3+9/log⁡3,x≤3,x2/log⁡x,x>3.\sigma_1(x) = k\cdot\begin{cases} x - 3 + 9\sqrt{\log 3}, & x \le 3,\\ x^2\sqrt{\log x}, & x > 3,\end{cases} \qquad \sigma_2(x) = k\cdot\begin{cases} x - 3 + 9/\sqrt{\log 3}, & x \le 3,\\ x^2/\sqrt{\log x}, & x > 3.\end{cases}σ1​(x)=k⋅{x−3+9log3​,x2logx​,​x≤3,x>3,​σ2​(x)=k⋅{x−3+9/log3​,x2/logx​,​x≤3,x>3.​

Then:

  • σ1\sigma_1σ1​ and σ2\sigma_2σ2​ are strictly increasing and tend to +∞+\infty+∞;
  • σ2(x)≤σ1(x)\sigma_2(x) \le \sigma_1(x)σ2​(x)≤σ1​(x) for all x>0x > 0x>0;
  • σi(x+1)≤3 σi(x)\sigma_i(x+1) \le 3\,\sigma_i(x)σi​(x+1)≤3σi​(x) for all x>0x > 0x>0.

These are the hypotheses of FourExp.transcendence_criterion with a1=a2=3a_1 = a_2 = 3a1​=a2​=3.

Proof idea.

  • Both pieces are increasing. ddx(x2/log⁡x)=xlog⁡x(2−12log⁡x)>0\frac{d}{dx}\bigl(x^2/\sqrt{\log x}\bigr) = \frac{x}{\sqrt{\log x}}\bigl(2 - \tfrac{1}{2\log x}\bigr) > 0dxd​(x2/logx​)=logx​x​(2−2logx1​)>0 for x>3x > 3x>3. The pieces meet at x=3x = 3x=3 with the value of the right piece at 333.
  • σ2≤σ1\sigma_2 \le \sigma_1σ2​≤σ1​ because log⁡x≥1\log x \ge 1logx≥1 for x>3x > 3x>3, and 9/log⁡3≤9log⁡39/\sqrt{\log 3} \le 9\sqrt{\log 3}9/log3​≤9log3​.
  • The ratio σi(x+1)/σi(x)\sigma_i(x+1)/\sigma_i(x)σi​(x+1)/σi​(x) is at most about 2.02.02.0 for σ1\sigma_1σ1​ and 1.61.61.6 for σ2\sigma_2σ2​ on x>0x > 0x>0, checked on each piece.

What it is for. It supplies the growth data in FourExp.auxiliary_construction, matching the sizes log⁡H(PN)≪N2log⁡N\log H(P_N) \ll N^2\sqrt{\log N}logH(PN​)≪N2logN​ and deg⁡PN≪N2/log⁡N\deg P_N \ll N^2/\sqrt{\log N}degPN​≪N2/logN​ of Waldschmidt's polynomials.

Preamble
import Mathlib

open Filter Topology
Formal statement
namespace FourExp

theorem construction_growth (k : ℝ) (hk : 0 < k) :
    StrictMono (fun x : ℝ => k * (if x ≤ 3 then x - 3 + 9 * Real.sqrt (Real.log 3) else x ^ 2 * Real.sqrt (Real.log x))) ∧
    StrictMono (fun x : ℝ => k * (if x ≤ 3 then x - 3 + 9 / Real.sqrt (Real.log 3) else x ^ 2 / Real.sqrt (Real.log x))) ∧
    Tendsto (fun x : ℝ => k * (if x ≤ 3 then x - 3 + 9 * Real.sqrt (Real.log 3) else x ^ 2 * Real.sqrt (Real.log x))) atTop atTop ∧
    Tendsto (fun x : ℝ => k * (if x ≤ 3 then x - 3 + 9 / Real.sqrt (Real.log 3) else x ^ 2 / Real.sqrt (Real.log x))) atTop atTop ∧
    (∀ x : ℝ, 0 < x → k * (if x ≤ 3 then x - 3 + 9 / Real.sqrt (Real.log 3) else x ^ 2 / Real.sqrt (Real.log x)) ≤ k * (if x ≤ 3 then x - 3 + 9 * Real.sqrt (Real.log 3) else x ^ 2 * Real.sqrt (Real.log x))) ∧
    (∀ x : ℝ, 0 < x → k * (if (x + 1) ≤ 3 then (x + 1) - 3 + 9 * Real.sqrt (Real.log 3) else (x + 1) ^ 2 * Real.sqrt (Real.log (x + 1))) ≤ 3 * (k * (if x ≤ 3 then x - 3 + 9 * Real.sqrt (Real.log 3) else x ^ 2 * Real.sqrt (Real.log x)))) ∧
    (∀ x : ℝ, 0 < x → k * (if (x + 1) ≤ 3 then (x + 1) - 3 + 9 / Real.sqrt (Real.log 3) else (x + 1) ^ 2 / Real.sqrt (Real.log (x + 1))) ≤ 3 * (k * (if x ≤ 3 then x - 3 + 9 / Real.sqrt (Real.log 3) else x ^ 2 / Real.sqrt (Real.log x)))) := by
  sorry

end FourExp
Source
Elementary real analysis; the functions correspond to σ₁(t₀) = k₆t₀²(log t₀)^{1/2}, σ₂(t₀) = k₇t₀²(log t₀)^{-1/2} in M. Waldschmidt, Solution du huitième problème de Schneider, J. Number Theory 5 (1973), 191–202, end of §III.

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