The major-arc error is
ProvedThreePrimes.major_error_isLittleOcircle-methodnumber-theorythree-primesvinogradov
The total error committed on the major arcs is negligible:
There are at most arcs, each of measure ; on each, the approximation error is and the cube contributes cross terms of size at most times that error. The total is , which is once is taken large enough in terms of — legitimate, since the major-arc approximation holds for every saving exponent.
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 major_error_isLittleO (hSW : SiegelWalfisz) {B : ℝ} (hB : 0 < B) :
(fun n : ℕ => majorInt B n - T B n * J B n) =o[atTop] (fun n : ℕ => (n : ℝ) ^ 2) := by sorry
end ThreePrimesSource
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Chapter 3, Section 3.3