Proved
CircleMethod.nrm_natCast_mul_leanalytic-number-theorycircle-methodexponential-sumsnumber-theory
For a natural number ,
This follows by induction from the triangle inequality for the distance to the nearest integer. Note the inequality only goes one way: can be far smaller than , and indeed Dirichlet's theorem asserts that for some it is at most no matter how large is. The useful direction here is the contrapositive: if is large then so is , which is how one propagates minor-arc information from a dilate back to the original point.
Preamble
import Definitions.Def_CircleMethod_char open Finset
Formal statement
namespace CircleMethod theorem nrm_natCast_mul_le (n : ℕ) (θ : ℝ) : nrm ((n : ℝ) * θ) ≤ (n : ℝ) * nrm θ := by sorry end CircleMethod
Source
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).