Tao Lemma 4.6 (proof): disjointness of the translated Farey systems
ProvedTaoFivePrimes.farey_rough_separationLet be positive integers. Let be positive integers at most , and let be positive integers at most none of whose prime factors is at most . Let be integers. If
then in , that is, divides . Here is the distance from to the nearest integer.
This is the Farey-type separation that makes the translated major-arc systems disjoint. In the local estimate for smoothed prime exponential sums one takes the union of the intervals of radius around the fractions with , and translates it by the fractions with coprime to the primorial ; the statement above says that two such translates can only meet if their translation vectors already agree modulo , which is what allows the translated copies to be summed against a single global bound.
The two mechanisms are: a nonzero rational with denominator at most is at distance at least from the integers, which forces the displayed difference to be an integer; and the rough denominators are coprime to the smooth ones , which forces the rough part of that integer relation to be integral on its own.
Formalization Note The distance to the nearest integer is written as the existence of an integer with small, which for a distance below is the same condition. The conclusion is stated as the integer divisibility , which is equivalent to and avoids a second existential. Roughness of and is stated primewise; the fractions are not assumed to be in lowest terms.
import Mathlib open Finset
theorem TaoFivePrimes.farey_rough_separation (Q R : ℕ)
(q0 q0' q1 q1' : ℕ) (a0 a0' a1 a1' : ℤ)
(hq0 : 0 < q0) (hq0Q : q0 ≤ Q) (hq0' : 0 < q0') (hq0'Q : q0' ≤ Q)
(hq1 : 0 < q1) (hq1R : q1 ≤ R) (hq1' : 0 < q1') (hq1'R : q1' ≤ R)
(hrough : ∀ p : ℕ, p.Prime → p ≤ Q → ¬ p ∣ q1)
(hrough' : ∀ p : ℕ, p.Prime → p ≤ Q → ¬ p ∣ q1')
(hclose : ∃ k : ℤ,
|((a0 : ℝ) / q0 + (a1 : ℝ) / q1 - (a0' : ℝ) / q0' - (a1' : ℝ) / q1') - (k : ℝ)|
< 1 / ((Q : ℝ) ^ 2 * (R : ℝ) ^ 2)) :
((q1 : ℤ) * q1') ∣ (a1 * q1' - a1' * q1) := by sorry