Dirichlet: with
ProvedCircleMethod.exists_rat_approxanalytic-number-theorycircle-methodexponential-sumsnumber-theory
Dirichlet's approximation theorem in its classical shape. For every real and every there are integers and with
This is the statement that generates the Farey dissection. Fixing a parameter , one declares to lie on the major arc when the approximation above holds with small, and on the minor arcs otherwise; the theorem guarantees that the arcs cover the whole unit interval. The quality — stronger than the naive — is what makes distinct major arcs with small denominators disjoint, so that their contributions may be summed without overcounting.
Preamble
import Definitions.Def_CircleMethod_char import Mathlib.NumberTheory.DiophantineApproximation.Basic open Finset
Formal statement
namespace CircleMethod
theorem exists_rat_approx (α : ℝ) {Q : ℕ} (hQ : 0 < Q) :
∃ (a : ℤ) (q : ℕ), 0 < q ∧ q ≤ Q ∧
|α - (a : ℝ) / (q : ℝ)| ≤ 1 / ((q : ℝ) * ((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.
Human review
Confirmed by the mission captain (proposal self-audit).