Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The local factor at 222 vanishes for even nnn

Proved
Vino.threePrimeFactor_two_of_even

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

analytic-number-theorycircle-methodnumber-theorysingular-series

The local factor of the singular series of the three primes problem at a prime ppp is

Sp(n)={1−1(p−1)2,p∣n,1+1(p−1)3,p∤n.\mathfrak S_p(n)=\begin{cases}1-\dfrac{1}{(p-1)^2},& p\mid n,\\[8pt] 1+\dfrac{1}{(p-1)^3},& p\nmid n.\end{cases}Sp​(n)=⎩⎨⎧​1−(p−1)21​,1+(p−1)31​,​p∣n,p∤n.​

At p=2p=2p=2 and nnn even this is 1−1/(2−1)2=01-1/(2-1)^2=01−1/(2−1)2=0:

S2(n)=0whenever 2∣n.\mathfrak S_2(n)=0\qquad\text{whenever }2\mid n.S2​(n)=0whenever 2∣n.

This single vanishing is the parity obstruction of the three primes problem: an even number has no representation as a sum of three odd primes, and the singular series records that fact locally at 222.

Preamble
import Definitions.Def_Vino_ramanujan
import Mathlib.Data.Nat.Totient
open Finset
Formal statement
namespace Vino

theorem threePrimeFactor_two_of_even {n : ℤ} (h : (2 : ℤ) ∣ n) : threePrimeFactor 2 n = 0 := by sorry

end Vino
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Chapter 3, Section 3.2 (the singular series of the three primes theorem); I. M. Vinogradov, Representation of an odd number as a sum of three primes, Doklady Akademii Nauk SSSR 15 (1937), 291-294.

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me