Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Vinogradov's asymptotic formula (conditional on Siegel--Walfisz)

Proved
ThreePrimes.three_primes_asymptotic

by tabbott · Sep 3, 2026 · Mathlib c5ea003 (Lean v4.30.0)

circle-methodnumber-theorythree-primesvinogradov

Vinogradov's asymptotic formula, conditional on the Siegel--Walfisz theorem:

R(n)  =  ∑a+b+c=nΛ(a)Λ(b)Λ(c)  =  12 S(n) n2+o(n2),R(n)\;=\;\sum_{a+b+c=n}\Lambda(a)\Lambda(b)\Lambda(c)\;=\;\tfrac12\,\mathfrak S(n)\,n^{2}+o(n^{2}),R(n)=a+b+c=n∑​Λ(a)Λ(b)Λ(c)=21​S(n)n2+o(n2),

where S(n)=∏p∣n(1−1(p−1)2)∏p∤n(1+1(p−1)3)\mathfrak S(n)=\prod_{p\mid n}\bigl(1-\tfrac{1}{(p-1)^2}\bigr)\prod_{p\nmid n}\bigl(1+\tfrac{1}{(p-1)^3}\bigr)S(n)=∏p∣n​(1−(p−1)21​)∏p∤n​(1+(p−1)31​) is the singular series.

This is the full circle-method output for the ternary Goldbach problem: the Farey dissection with P=(log⁡N)BP=(\log N)^BP=(logN)B, B>12B>12B>12; Vinogradov's estimate on the minor arcs; Siegel--Walfisz on the major arcs; and the factorisation of the main term into singular series times singular integral. Siegel--Walfisz is carried as an explicit hypothesis because it is not yet available in Mathlib; everything else 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 (hSW : SiegelWalfisz) :
    (fun n : ℕ => (R n : ℂ) - mainTerm n) =o[atTop] (fun n : ℕ => (n : ℝ) ^ 2) := by sorry

end ThreePrimes
Source
I. M. Vinogradov, Representation of an odd number as a sum of three primes, Dokl. Akad. Nauk SSSR 15 (1937), 291-294; H. Davenport, Multiplicative Number Theory, 3rd ed., GTM 74, Springer, 2000, Chapter 26 (the three primes theorem)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me