A positive lower bound for the representation count
ProvedThreePrimes.R_ge_of_closecircle-methodnumber-theorythree-primesvinogradov
If is odd, the singular series satisfies , and the representation count is within of its predicted main term, then
The main term is for odd , so an error of at most cannot cancel it. This is the step that converts an asymptotic formula into an existence statement: means some triple of prime powers 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 R_ge_of_close {n : ℕ} (hodd : Odd n) (hpos : ∀ n : ℤ, ¬ (2 : ℤ) ∣ n → 1 ≤ (singSeries n).re)
(hclose : ‖(R n : ℂ) - mainTerm n‖ ≤ 1 / 4 * (n : ℝ) ^ 2) :
1 / 4 * (n : ℝ) ^ 2 ≤ R 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