Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Gel'fond criterion: infinitely many lower bounds for polynomial values

Proved
TranscendenceTheory.gelfond_polynomial_sequence_lower_bound

by tomasz · Sep 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theorypolynomialstranscendence

Let θ\thetaθ be a transcendental complex number and c>1c>1c>1. Let dn,tnd_n,t_ndn​,tn​ be strictly increasing positive real sequences tending to infinity, with

dn+1≤cdn,tn+1≤ctn.d_{n+1}\le c d_n,\qquad t_{n+1}\le c t_n.dn+1​≤cdn​,tn+1​≤ctn​.

For integer polynomials PnP_nPn​ assume Pn(θ)≠0P_n(\theta)\ne0Pn​(θ)=0, deg⁡Pn≤dn\deg P_n\le d_ndegPn​≤dn​, and every coefficient of PnP_nPn​ has absolute value at most etne^{t_n}etn​. Then infinitely many indices satisfy

log⁡∣Pn(θ)∣>−(2c+1)dn(tn+dn).\log|P_n(\theta)|>-(2c+1)d_n(t_n+d_n).log∣Pn​(θ)∣>−(2c+1)dn​(tn​+dn​).

This polynomial form of Gel'fond's criterion rules out uniformly excessive smallness while degrees and logarithmic coefficient bounds grow at controlled rates.

Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Basic
import Mathlib.Analysis.Complex.Norm
import Mathlib.RingTheory.Algebraic.Defs
import Mathlib.Order.Filter.AtTopBot.Field

open Filter
open scoped Topology Polynomial

Formal statement
namespace TranscendenceTheory

/-- Polynomial form of Senthil Kumar (2026), Lemma 3 (Gel'fond's criterion). -/
theorem gelfond_polynomial_sequence_lower_bound
    (θ : ℂ) (hθ : Transcendental ℚ θ) (c : ℝ) (hc : 1 < c)
    (d t : ℕ → ℝ)
    (hd_pos : ∀ n, 0 < d n) (ht_pos : ∀ n, 0 < t n)
    (hd_strict : StrictMono d) (ht_strict : StrictMono t)
    (hd_unbounded : Tendsto d atTop atTop) (ht_unbounded : Tendsto t atTop atTop)
    (hd_growth : ∀ n, d (n + 1) ≤ c * d n)
    (ht_growth : ∀ n, t (n + 1) ≤ c * t n)
    (P : ℕ → ℤ[X])
    (h_nonzero : ∀ n, Polynomial.aeval θ (P n) ≠ 0)
    (h_degree : ∀ n, ((P n).natDegree : ℝ) ≤ d n)
    (h_coeff : ∀ n k, |((P n).coeff k : ℝ)| ≤ Real.exp (t n)) :
    ∃ᶠ n in atTop,
      -(2 * c + 1) * d n * (t n + d n) <
        Real.log ‖Polynomial.aeval θ (P n)‖ := by sorry

end TranscendenceTheory
Source
Senthil Kumar K (2026), Section 3, Lemma 3 and its proof (polynomial formulation), https://doi.org/10.1017/S001309152610145X; the proof cites Brownawell, Lemma 4, and Waldschmidt, Theorem 8.2.1. Indices are shifted to start at zero; unbounded increasing sequences are expressed by StrictMono and Tendsto atTop atTop. No elliptic-function hypothesis is needed.

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