when
ProvedCircleMethod.nrm_eq_abs_subanalytic-number-theorycircle-methodexponential-sumsnumber-theory
If an integer lies strictly within of , then it is the nearest integer and computes the norm exactly:
The minimality property gives for free; the content is the reverse inequality, which holds because two distinct integers are at distance at least apart while both would have to lie within of . This is the lemma that converts a rational approximation supplied by Dirichlet's theorem into an exact value of , which is what the exponential sum bounds actually consume. The strict inequality is necessary: at both neighbouring integers are equally near.
Preamble
import Definitions.Def_CircleMethod_char open Finset
Formal statement
namespace CircleMethod
theorem nrm_eq_abs_sub {θ : ℝ} {n : ℤ} (h : |θ - (n : ℝ)| < 1 / 2) :
nrm θ = |θ - (n : ℝ)| := by sorry
end CircleMethodSource
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Sections 1.1 and 2.1 (generating functions, the distance-to-nearest-integer norm, and complete exponential sums over Z/qZ).