Powers of the divisor function:
ProvedCircleMethod.divisor_bound_powanalytic-number-theorycircle-methodexponential-sumsnumber-theory
For every and every fixed exponent there is a constant with
where is the number of positive divisors of . It follows immediately from the divisor bound applied with , the point being that a fixed power of a quantity that is for every is again for every .
The reason the power is needed rather than the bare divisor bound: in Weyl's inequality of degree one must count the tuples whose product takes a given value , and that count is bounded by a power of growing with . This lemma is what absorbs the whole tuple count into a single factor.
Formalization Note. The case is included and is not vacuous: the claim becomes , which is why the constant is taken to be at least .
Preamble
import Definitions.Def_CircleMethod_char import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.NumberTheory.Divisors open Finset
Formal statement
namespace CircleMethod
theorem divisor_bound_pow {ε : ℝ} (hε : 0 < ε) (j : ℕ) :
∃ C : ℝ, 0 < C ∧ ∀ n : ℕ, 0 < n →
((n.divisors.card : ℝ)) ^ j ≤ C * (n : ℝ) ^ ε := by sorry
end CircleMethodSource
G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 6th ed., Oxford University Press, 2008, Theorem 315; the power form is used in R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., 1997, proof of Lemma 2.4.