Prove2Me
Navigate
MissionsFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Splitting the von Mangoldt exponential sum at a modulus

Proved
Vino.vmSum_split_coprime

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

analytic-number-theorycircle-methoddirichlet-charactersnumber-theory

For every modulus qqq, every α\alphaα and every NNN,

S(α,N)=∑n<N(n,q)=1Λ(n)e(αn)  +  ∑n<N(n,q)>1Λ(n)e(αn).S(\alpha,N)=\sum_{\substack{n<N\\ (n,q)=1}}\Lambda(n)e(\alpha n)\;+\;\sum_{\substack{n<N\\ (n,q)>1}}\Lambda(n)e(\alpha n).S(α,N)=n<N(n,q)=1​∑​Λ(n)e(αn)+n<N(n,q)>1​∑​Λ(n)e(αn).

On a major arc around b/qb/qb/q only the first sum is expanded in Dirichlet characters; the second is an error term supported on the powers of the primes dividing qqq, and is negligible. Recording the split explicitly keeps the character expansion an exact identity rather than an approximation.

Preamble
import Definitions.Def_Vino_dirichlet
import Definitions.Def_Vino_primes
import Mathlib.NumberTheory.DirichletCharacter.Orthogonality
import Mathlib.Data.ZMod.Units
open Finset
Formal statement
namespace Vino

theorem vmSum_split_coprime (q : ℕ) (α : ℝ) (N : ℕ) :
    vmSum α N
      = (∑ n ∈ (Finset.range N).filter (fun n => Nat.Coprime n q),
            ((ArithmeticFunction.vonMangoldt n : ℝ) : ℂ) * CircleMethod.e (α * (n : ℝ)))
        + ∑ n ∈ (Finset.range N).filter (fun n => ¬ Nat.Coprime n q),
            ((ArithmeticFunction.vonMangoldt n : ℝ) : ℂ) * CircleMethod.e (α * (n : ℝ)) := 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.1 (major arcs for the three primes theorem, expansion of the von Mangoldt exponential sum in Dirichlet characters); H. Davenport, Multiplicative Number Theory, 3rd ed., Springer GTM 74, 2000, Chapter 26.

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