Leading-coefficient extraction: if for every integer , then
ProvedDiazModulus.le_of_forall_mul_pow_lecommutative-algebradiaz-modulus-leanhilbert-functiontranscendence
Let . If for every integer , then .
Proof. Dividing by gives for every ; as the right side tends to , 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).