Gel'fond's lemma: a polynomial small at a transcendental number has a small irreducible factor
ProvedFourExp.small_irreducible_factornumber-theorypolynomialstranscendence
Small values pass to an irreducible factor.
Let be transcendental and let be primitive, with all coefficients at most in absolute value. Let and be real with and . If
then there are a primitive irreducible divisor of and an integer with
Proof idea. Factor into irreducibles, grouped as powers . Gel'fond's height inequality bounds by . Since is very small, a weighted averaging argument finds one factor that is small relative to its own share of the degree and the height. Here is essentially the multiplicity with which that share is taken.
What it is for. Step (3.7) of Waldschmidt's proof of FourExp.transcendence_criterion_continuous. It is applied to the primitive part of each , with , and .
Preamble
import Mathlib
Formal statement
namespace FourExp
theorem small_irreducible_factor
(α : ℂ) (hα : Transcendental ℚ α) (P : Polynomial ℤ) (hprim : P.IsPrimitive)
(H n lam : ℝ) (hPH : ∀ i : ℕ, |(P.coeff i : ℝ)| ≤ H)
(hlog : n ≤ Real.log H) (hdeg : (P.natDegree : ℝ) ≤ n) (hlam : 6 < lam)
(hsmall : ‖Polynomial.aeval α P‖ < H ^ (-(lam * n))) :
∃ Q : Polynomial ℤ, Q ∣ P ∧ Q.IsPrimitive ∧ Irreducible Q ∧
∃ s : ℕ, 0 < s ∧
‖Polynomial.aeval α Q‖ < H ^ (-((lam - 6) * n / s)) ∧
(∀ i : ℕ, |(Q.coeff i : ℝ)| ≤ H ^ ((1 : ℝ) / s) * Real.exp (2 * n / s)) ∧
(Q.natDegree : ℝ) ≤ n / s := by
sorry
end FourExpSource
M. Waldschmidt, Indépendance algébrique des valeurs de la fonction exponentielle, Bull. Soc. Math. France 99 (1971), 285–304, §3, Lemme 2 (A. O. Gel'fond, Transcendental and Algebraic Numbers, 1952; compare S. Lang, Introduction to Transcendental Numbers, 1966, VI §2).