Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

One scale of Gel'fond's criterion: small values at the same point force divisibility

Proved
FourExp.dvd_of_small_values_at_scale

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

diaz-modulus-leanpolynomialstranscendence

Let α∈C\alpha \in \mathbb{C}α∈C and ε>0\varepsilon > 0ε>0. There is UUU such that, for all real u≥Uu \ge Uu≥U and 1≤v≤u1 \le v \le u1≤v≤u, the following holds. Let P,Q∈Z[X]P, Q \in \mathbb{Z}[X]P,Q∈Z[X] with QQQ irreducible, and suppose:

  • the coefficients of PPP are at most eue^{u}eu in absolute value, and deg⁡P≤v\deg P \le vdegP≤v;
  • the coefficients of QQQ are at most e3ue^{3u}e3u in absolute value, and deg⁡Q≤(1+ε/2) v\deg Q \le (1 + \varepsilon/2)\, vdegQ≤(1+ε/2)v;
  • ∣P(α)∣<e−(4+ε)uv|P(\alpha)| < e^{-(4+\varepsilon)uv}∣P(α)∣<e−(4+ε)uv and ∣Q(α)∣<e−(4+ε)uv|Q(\alpha)| < e^{-(4+\varepsilon)uv}∣Q(α)∣<e−(4+ε)uv.

Then QQQ divides PPP.

This is FourExp.dvd_of_small_values with every size written in terms of one scale (u,v)(u, v)(u,v), the form in which the proof of the transcendence criterion uses it at each step.

Preamble
import Mathlib
Formal statement
open Polynomial

namespace FourExp

theorem dvd_of_small_values_at_scale (α : ℂ) (ε : ℝ) (hε : 0 < ε) :
    ∃ U : ℝ, ∀ u v : ℝ, U ≤ u → 1 ≤ v → v ≤ u → ∀ P Q : ℤ[X], Irreducible Q →
      (∀ i, |(P.coeff i : ℝ)| ≤ Real.exp u) → (P.natDegree : ℝ) ≤ v →
      (∀ i, |(Q.coeff i : ℝ)| ≤ Real.exp (3 * u)) → (Q.natDegree : ℝ) ≤ (1 + ε / 2) * v →
      ‖aeval α P‖ < Real.exp (-((4 + ε) * (u * v))) →
      ‖aeval α Q‖ < Real.exp (-((4 + ε) * (u * v))) → Q ∣ P := by
  sorry

end FourExp
Source
A step in the proof of the transcendence criterion FourExp.transcendence_criterion_continuous (M. Waldschmidt, Indépendance algébrique des valeurs de la fonction exponentielle, Bull. Soc. Math. France 99 (1971), 285–304, §3). Formal proof: Diaz modulus mission, 25 September 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me