From the asymptotic formula to the existence theorem
ProvedThreePrimes.three_primes_of_asymptoticcircle-methodnumber-theorythree-primesvinogradov
If and for odd , then every sufficiently large odd is a sum of three primes.
Two steps. First, the asymptotic and the lower bound for give for large odd . Second, weights prime powers, not primes: the contribution of triples in which some with occurs is , so it cannot account for the whole of . Hence some triple of genuine primes sums to .
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_of_asymptotic (hasymp : (fun n : ℕ => (R n : ℂ) - mainTerm n) =o[atTop] (fun n : ℕ => (n : ℝ) ^ 2))
(hpos : ∀ n : ℤ, ¬ (2 : ℤ) ∣ n → 1 ≤ (singSeries n).re) :
∃ N₀ : ℕ, ∀ n : ℕ, N₀ ≤ n → Odd n →
∃ p₁ p₂ p₃ : ℕ, p₁.Prime ∧ p₂.Prime ∧ p₃.Prime ∧ p₁ + p₂ + p₃ = n := 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