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 CircleMethodRead-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: CircleMethod.farey_cover_coprime
What the declaration asserts. The statement is parameterized by a natural number (supplied implicitly, i.e. inferred from the other data rather than written by the caller), together with two explicit hypotheses/inputs: a proof that , and an arbitrary real number . Under these assumptions the claim is that there exist an integer and a natural number such that all four of the following hold simultaneously:
Reading of each conjunct.
- and : the denominator is a strictly positive natural number, bounded above by (non-strictly). Both are comparisons of natural numbers.
- The coprimality clause is the assertion that the greatest common divisor of the natural number (the absolute value of , coerced to ) and the natural number equals . Note the first argument is , not itself; the condition is symmetric in sign, so it constrains only up to sign.
- The final clause is an inequality between real numbers. Both and are coerced into ; the quotient and the quotient are real divisions, and is likewise coerced into before is added to it. The inequality is non-strict (), and the right-hand denominator is , not with any other normalization, nor , nor with an exponent.
Quantifier structure. The two witnesses and are existentially quantified and are asserted to exist for every real and every positive ; no uniqueness is claimed, and nothing asserts that the pair depends measurably, continuously, or canonically on . There is no upper or lower bound imposed on beyond what the final inequality forces: may be any integer, of either sign or zero, and in particular the statement does not require , , or to lie in any fixed residue range.
Degenerate and edge cases silently included.
- Since the conclusion asserts , the hypothesis is consistent with, and necessary for, the conclusion; for no such could exist, and the hypothesis excludes that case.
- The value is permitted. In that case the coprimality condition holds automatically for every integer , including , so the coprimality clause imposes no restriction at all when .
- is permitted whenever , i.e. exactly when ; note , so forces .
- Because is asserted, the real divisions and never fall back on the division-by-zero convention; and since , the factor is strictly positive, so the bound on the right-hand side is a positive real number.
- No claim is made about the number of such pairs, about being maximal or minimal, or about being in lowest terms as a rational number beyond the stated .
Definitions from the surrounding bundle. The statement lives in the namespace CircleMethod, whose ambient definitions include the additive character , the generating function for a finite set , and the distance-to-nearest-integer function . None of these appears in this statement: the assertion is expressed purely in terms of ordinary absolute value, real arithmetic, and the gcd of natural numbers. In particular the final inequality uses the ordinary absolute value of a real number, not the distance-to-nearest-integer norm.
Proof status. The declaration is stated as a theorem whose proof is left as sorry; the file therefore contains the assertion above but no proof of it.
Confirmed by the mission captain (proposal self-audit).