Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The cofactor of the smallest irreducible factor is not small (the multiplicative step of Gel'fond's lemma)

Proved
Transcendence.exists_irreducible_factor_cofactor_bound

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

diaz-modulus-leannumber-theorypolynomialstranscendence

Let P∈Z[X]P \in \mathbb{Z}[X]P∈Z[X] have positive degree and let θ∈C\theta \in \mathbb{C}θ∈C. Then P=QeRP = Q^{e} RP=QeR with Q,R∈Z[X]Q, R \in \mathbb{Z}[X]Q,R∈Z[X], QQQ irreducible of positive degree, e≥1e \ge 1e≥1, and

1≤2deg⁡Qdeg⁡R M(Q)deg⁡R M(R)deg⁡Q ∣R(θ)∣,1 \le 2^{\deg Q \deg R}\, M(Q)^{\deg R}\, M(R)^{\deg Q}\, |R(\theta)|,1≤2degQdegRM(Q)degRM(R)degQ∣R(θ)∣,

where MMM is the Mahler measure. Take for QQQ a non-constant irreducible factor of PPP at which ∣Q(θ)∣|Q(\theta)|∣Q(θ)∣ is least, and for eee its multiplicity. Every irreducible factor of RRR is then a constant or coprime to QQQ, and Transcendence.norm_resultant_le_max_norm_eval bounds its value at θ\thetaθ from below; the bound is multiplicative, so it passes to RRR.

Preamble
import Mathlib
Formal statement
namespace Transcendence

/-- The cofactor of the smallest irreducible factor is not small (the multiplicative step of
Gel'fond's lemma).

Let `P ∈ ℤ[X]` have positive degree and let `θ ∈ ℂ`. Among the non-constant irreducible factors of
`P`, let `Q` be one at which `|Q(θ)|` is least, let `e` be its multiplicity, and write
`P = Q^e R`. Every irreducible factor `T` of `R` either is a constant, and then trivially satisfies
the bound below, or is coprime to `Q` with `|Q(θ)| ≤ |T(θ)|`; the Liouville inequality through the
resultant then bounds `|T(θ)|` from below. The bound is multiplicative in `T`, so it passes to
`R`: `1 ≤ 2^(deg Q · deg R) · M(Q)^(deg R) · M(R)^(deg Q) · |R(θ)|`, with `M` the Mahler measure. -/
theorem exists_irreducible_factor_cofactor_bound (P : Polynomial ℤ) (hP : 0 < P.natDegree)
    (θ : ℂ) :
    ∃ (Q R : Polynomial ℤ) (e : ℕ), Irreducible Q ∧ 0 < Q.natDegree ∧ 0 < e ∧ P = Q ^ e * R ∧
      1 ≤ 2 ^ (Q.natDegree * R.natDegree) *
        (Q.map (Int.castRingHom ℂ)).mahlerMeasure ^ R.natDegree *
        (R.map (Int.castRingHom ℂ)).mahlerMeasure ^ Q.natDegree * ‖Polynomial.aeval θ R‖ := by
  sorry

end Transcendence
Source
The multiplicative step of Gel'fond's lemma (A. O. Gel'fond, Transcendental and Algebraic Numbers, 1952), as in M. Waldschmidt, Indépendance algébrique des valeurs de la fonction exponentielle, Bull. Soc. Math. France 99 (1971), 285–304, §3, Lemme 2. Formal proof: Diaz modulus mission, 27 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