Dirichlet: some has
ProvedCircleMethod.exists_nrm_mul_leanalytic-number-theorycircle-methodexponential-sumsnumber-theory
Dirichlet's approximation theorem, in the form the circle method uses. For every real and every there is an integer with
Here is the distance to the nearest integer. The point is that every real number is well approximable at scale : there is no for which all of stay far from the integers. This is precisely what makes the Farey dissection exhaustive — each point of the unit interval lies on some arc — and it is the reason the minor arcs can be characterised by the largeness of the denominator rather than by the absence of any approximation at all.
Preamble
import Definitions.Def_CircleMethod_char import Mathlib.NumberTheory.DiophantineApproximation.Basic open Finset
Formal statement
namespace CircleMethod
theorem exists_nrm_mul_le (α : ℝ) {Q : ℕ} (hQ : 0 < Q) :
∃ q : ℕ, 0 < q ∧ q ≤ Q ∧ nrm ((q : ℝ) * α) ≤ 1 / ((Q : ℝ) + 1) := by sorry
end CircleMethodSource
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.