Farey covering with coprime numerator
ProvedCircleMethod.farey_cover_coprimeDirichlet's approximation theorem in the form the Farey dissection requires, with the numerator reduced to lowest terms.
For every and every real there exist and with
The unreduced version is classical; the content added here is that the approximating fraction may be taken in lowest terms without weakening the bound. That matters because the major arcs of the circle method are indexed by coprime pairs — one arc per reduced fraction — and the disjointness of arcs with distinct centres is proved using coprimality. Without the reduction one would count the same arc repeatedly and the sum over major arcs would overcount.
Together with the bound this statement makes the dissection exhaustive: every point of the unit interval lies within of some reduced fraction with denominator at most , so declaring the remaining points "minor arcs" is a genuine dichotomy rather than a definition with an empty complement.
Formalization Note. Coprimality is stated as Nat.Coprime a.natAbs q, which is the correct notion when the numerator may be negative. Note that forces , since ; that instance is the arc centred at the integer , which is exactly as intended.
import Definitions.Def_CircleMethod_genfun import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.NumberTheory.Divisors import Mathlib.Data.Fintype.Pi open Finset
namespace CircleMethod
theorem farey_cover_coprime {Q : ℕ} (hQ : 0 < Q) (α : ℝ) :
∃ (a : ℤ) (q : ℕ), 0 < q ∧ q ≤ Q ∧ Nat.Coprime a.natAbs q ∧
|α - (a : ℝ) / (q : ℝ)| ≤ 1 / ((q : ℝ) * ((Q : ℝ) + 1)) := by sorry
end CircleMethod