Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Farey covering with coprime numerator

Proved
CircleMethod.farey_cover_coprime

by tabbott · Sep 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorycircle-methodexponential-sumsnumber-theory

Dirichlet's approximation theorem in the form the Farey dissection requires, with the numerator reduced to lowest terms.

For every Q≥1Q\ge 1Q≥1 and every real α\alphaα there exist a∈Za\in\mathbb{Z}a∈Z and q∈Nq\in\mathbb{N}q∈N with

1≤q≤Q,gcd⁡(∣a∣,q)=1,∣α−aq∣≤1q(Q+1).1\le q\le Q,\qquad \gcd(|a|,q)=1,\qquad \left|\alpha-\frac{a}{q}\right|\le\frac{1}{q(Q+1)}.1≤q≤Q,gcd(∣a∣,q)=1,​α−qa​​≤q(Q+1)1​.

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 (a,q)(a,q)(a,q) — 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 1q(Q+1)\frac{1}{q(Q+1)}q(Q+1)1​ of some reduced fraction with denominator at most QQQ, 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 a=0a=0a=0 forces q=1q=1q=1, since gcd⁡(0,q)=q\gcd(0,q)=qgcd(0,q)=q; that instance is the arc centred at the integer 000, which is exactly as intended.

Preamble
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
Formal statement
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
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., 1997, Section 2.1 (Farey dissection); Dirichlet's approximation theorem as in G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 6th ed., Theorem 36.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me