Assembly of the three-primes asymptotic
ProvedThreePrimes.three_primes_asymptotic_of_piecescircle-methodnumber-theorythree-primesvinogradov
The bookkeeping that combines the four estimates into the asymptotic formula. Given and
- the minor arcs are ,
- the major-arc error is ,
- the truncated singular series converges to uniformly, and
- the truncated singular integral is ,
together with a uniform bound on , one obtains .
The proof is the identity , each of whose four terms is by hypothesis. Stating it with the pieces as hypotheses keeps the assembly independent of how each piece is proved.
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 three_primes_asymptotic_of_pieces {B : ℝ} (hB : 12 < B)
(hminor : (fun n : ℕ => minorInt B n) =o[atTop] (fun n : ℕ => (n : ℝ) ^ 2))
(hmajor : (fun n : ℕ => majorInt B n - T B n * J B n) =o[atTop] (fun n : ℕ => (n : ℝ) ^ 2))
(htail : (fun n : ℕ => T B n - singSeries (n : ℤ)) =o[atTop] (fun _ : ℕ => (1 : ℝ)))
(hJ : (fun n : ℕ => J B n - (1 / 2 : ℂ) * (n : ℂ) ^ 2) =o[atTop] (fun n : ℕ => (n : ℝ) ^ 2))
(hbd : ∃ Bd : ℝ, ∀ n : ℤ, ‖singSeries n‖ ≤ Bd) :
(fun n : ℕ => (R n : ℂ) - mainTerm 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.4