Divisor bound
ProvedCircleMethod.divisor_boundThe classical divisor bound: for every there is a constant with
where is the number of positive divisors of . Equivalently : the divisor function grows more slowly than any positive power of , even though it is unbounded and reaches infinitely often.
This is needed in the proof of Weyl's inequality. After the differencing steps one must count the pairs for which the resulting linear coefficient lies close to an integer; the count is governed by the number of divisors of an integer of size , and the crude bound above is exactly strong enough to absorb it into the factor. It is also used throughout analytic number theory whenever a divisor-type sum must be dominated.
Formalization Note. is n.divisors.card, Mathlib's count of the divisors of n; the hypothesis excludes the convention Nat.divisors 0 = ∅. The exponent is a real power (Real.rpow). The constant is quantified after and before , so a single must serve every ; solvers should preserve that order, since permitting to depend on trivialises the claim.
import Definitions.Def_CircleMethod_genfun import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.NumberTheory.Divisors import Mathlib.Data.Fintype.Pi open Finset
namespace CircleMethod
theorem divisor_bound {ε : ℝ} (hε : 0 < ε) :
∃ C : ℝ, 0 < C ∧ ∀ n : ℕ, 0 < n → ((n.divisors.card : ℝ)) ≤ C * (n : ℝ) ^ ε := by sorry
end CircleMethod