Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Leading-coefficient extraction: if aun≤b(u+c)na u^n \le b (u + c)^naun≤b(u+c)n for every integer u≥1u \ge 1u≥1, then a≤ba \le ba≤b

Proved
DiazModulus.le_of_forall_mul_pow_le

by carlok · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

commutative-algebradiaz-modulus-leanhilbert-functiontranscendence

Let a,b,c,n∈Na, b, c, n \in \mathbb{N}a,b,c,n∈N. If aun≤b(u+c)na u^n \le b (u + c)^naun≤b(u+c)n for every integer u≥1u \ge 1u≥1, then a≤ba \le ba≤b.

Proof. Dividing by unu^nun gives a≤b(1+c/u)na \le b (1 + c/u)^na≤b(1+c/u)n for every u≥1u \ge 1u≥1; as u→∞u \to \inftyu→∞ the right side tends to bbb, and a bound that holds eventually passes to the limit.

Novelty. Classical; routine formalisation. It stands in for the leading-coefficient limits of DALAG §8.2.2 (p. 235) and of the proof of Th. 8.18 (p. 245).

Preamble
import Mathlib
Formal statement
namespace DiazModulus

theorem le_of_forall_mul_pow_le (a b c n : ℕ) (h : ∀ u : ℕ, 1 ≤ u → a * u ^ n ≤ b * (u + c) ^ n) :
    a ≤ b := by
  sorry

end DiazModulus
Source
Elementary. A replacement for the limits defining the normalised leading coefficient in M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, §8.2.2 (p. 235; Chapter 8 is by D. Roy). C1.1 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 29 October 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me