Vinogradov's three primes theorem (conditional on Siegel--Walfisz)
ProvedThreePrimes.three_primesVinogradov's three primes theorem, conditional on the Siegel--Walfisz theorem: there is such that every odd is a sum of three primes,
Proved by the Hardy--Littlewood--Vinogradov circle method. Writing as an integral of over the circle, the Farey dissection at level splits it into major and minor arcs. On the minor arcs Vinogradov's estimate for — proved here via Vaughan's identity — gives a saving of an arbitrary power of . On the major arcs Siegel--Walfisz gives the approximation , whose cube integrates to . Since for odd (and for even — the parity obstruction), the main term dominates and . Finally the prime-power triples contribute only , so the representation uses three genuine primes.
The one input not formalised is Siegel--Walfisz itself, which Mathlib does not yet contain; it appears as an explicit hypothesis.
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
namespace ThreePrimes
theorem three_primes (hSW : SiegelWalfisz) :
∃ N₀ : ℕ, ∀ n : ℕ, N₀ ≤ n → Odd n →
∃ p₁ p₂ p₃ : ℕ, p₁.Prime ∧ p₂.Prime ∧ p₃.Prime ∧ p₁ + p₂ + p₃ = n := by sorry
end ThreePrimes
Confirmed by the mission captain (proposal self-audit).