Proved
CircleMethod.norm_f_leanalytic-number-theorycircle-methodexponential-sumsnumber-theory
The generating function never exceeds the size of the set:
Together with this shows the bound is attained, so it is the correct benchmark. Every non-trivial exponential sum estimate is an assertion that is smaller than by some power saving, for in a suitable region.
Preamble
import Definitions.Def_CircleMethod_genfun import Mathlib.Algebra.BigOperators.Group.Finset.Basic open Finset
Formal statement
namespace CircleMethod theorem norm_f_le (A : Finset ℤ) (θ : ℝ) : ‖f A θ‖ ≤ (A.card : ℝ) := by sorry end CircleMethod
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 1.1 (the generating function, eq. (1.3)) and Section 2.1 (Farey dissection and Dirichlet's approximation theorem, Lemma 2.1); Dirichlet's theorem as in G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 6th ed., Theorem 36.