Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Parseval for the prime exponential sum

Proved
ThreePrimes.integral_norm_sq_vmSum

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

circle-methodnumber-theorythree-primesvinogradov

Parseval's identity for the finite sum S(α,N)=∑n<NΛ(n)e(αn)S(\alpha,N)=\sum_{n<N}\Lambda(n)e(\alpha n)S(α,N)=∑n<N​Λ(n)e(αn):

∫01∣S(α,N)∣2 dα  =  ∑m<NΛ(m)2.\int_0^1\bigl|S(\alpha,N)\bigr|^2\,d\alpha\;=\;\sum_{m<N}\Lambda(m)^2 .∫01​​S(α,N)​2dα=m<N∑​Λ(m)2.

Expanding ∣S∣2=SS‾|S|^2=S\overline S∣S∣2=SS into a double sum and integrating term by term, orthogonality ∫01e(kα) dα=[k=0]\int_0^1e(k\alpha)\,d\alpha=[k=0]∫01​e(kα)dα=[k=0] kills every off-diagonal pair. Combined with ∑m<NΛ(m)2≤Nlog⁡2N\sum_{m<N}\Lambda(m)^2\le N\log^2 N∑m<N​Λ(m)2≤Nlog2N this is the mean-square input to the minor-arc estimate: the cubic integral over the minor arcs is bounded by sup⁡m∣S∣\sup_{\mathfrak m}|S|supm​∣S∣ times this L2L^2L2 norm, so a pointwise saving on m\mathfrak mm translates directly into a saving for the whole integral.

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 integral_norm_sq_vmSum (N : ℕ) :
    (∫ α in (0 : ℝ)..1, ‖vmSum α N‖ ^ 2)
      = ∑ m ∈ range N, (ArithmeticFunction.vonMangoldt m : ℝ) ^ 2 := by sorry

end ThreePrimes
Source
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