The Farey dissection has at most major arcs
ProvedThreePrimes.card_fareyPairs_lecircle-methodnumber-theorythree-primesvinogradov
The number of reduced fractions with is at most .
Crude but sufficient: the major arcs are indexed by these fractions, each has measure , and the total major-arc measure is therefore , which is for a power of . The bound (rather than the true ) is all the error analysis needs.
Preamble
import Definitions.Def_Vino_threeprimes import Mathlib.Analysis.Asymptotics.Defs import Mathlib.Analysis.Asymptotics.Lemmas import Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic import Mathlib.MeasureTheory.Integral.Bochner.Set import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Data.Nat.Totient open CircleMethod Vino Finset Filter Asymptotics MeasureTheory open scoped Topology
Formal statement
namespace ThreePrimes theorem card_fareyPairs_le (P : ℕ) : (fareyPairs P).card ≤ P ^ 2 := by sorry end ThreePrimes
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Chapter 3, Section 3.2