Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The von Mangoldt exponential sum at a rational point

Proved
Vino.vmSum_rat_char_expansion

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

analytic-number-theorycircle-methoddirichlet-charactersnumber-theory

Let q≥1q\ge1q≥1 and let bbb be coprime to qqq. Then, with 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),

φ(q) S ⁣(bq,N)=∑χ mod qχ−1(b) τ(χ) ψ(N,χ−1)  +  φ(q)∑n<N(n,q)>1Λ(n) e ⁣(bnq).\varphi(q)\,S\!\left(\tfrac{b}{q},N\right) =\sum_{\chi\bmod q}\chi^{-1}(b)\,\tau(\chi)\,\psi(N,\chi^{-1}) \;+\;\varphi(q)\sum_{\substack{n<N\\ (n,q)>1}}\Lambda(n)\,e\!\left(\tfrac{bn}{q}\right).φ(q)S(qb​,N)=χmodq∑​χ−1(b)τ(χ)ψ(N,χ−1)+φ(q)n<N(n,q)>1​∑​Λ(n)e(qbn​).

This is the exact major-arc identity in the form it is actually used. The first term is the main term: evaluating the Gauss sums and estimating each ψ(N,χ−1)\psi(N,\chi^{-1})ψ(N,χ−1) by the prime number theorem in arithmetic progressions produces μ(q)φ(q)−1N\mu(q)\varphi(q)^{-1}Nμ(q)φ(q)−1N plus an error. The second term is supported on the powers of the primes dividing qqq and is O(ω(q)log⁡N)O(\omega(q)\log N)O(ω(q)logN), hence negligible.

No approximation has been made: the identity holds for every NNN and every reduced fraction b/qb/qb/q.

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

theorem vmSum_rat_char_expansion (q : ℕ) [NeZero q] {b : ℕ} (hb : IsUnit ((b : ℕ) : ZMod q)) (N : ℕ) :
    (Nat.totient q : ℂ) * vmSum ((b : ℝ) / (q : ℝ)) N
      = (∑ χ : DirichletCharacter ℂ q,
            χ⁻¹ ((b : ℕ) : ZMod q) * gaussE q χ * vmSumChar q χ⁻¹ N)
        + (Nat.totient q : ℂ)
            * ∑ n ∈ (Finset.range N).filter (fun n => ¬ Nat.Coprime n q),
                ((ArithmeticFunction.vonMangoldt n : ℝ) : ℂ)
                  * CircleMethod.e ((b : ℝ) / (q : ℝ) * (n : ℝ)) := by sorry

end Vino
Source
H. Davenport, Multiplicative Number Theory, 3rd ed., Springer GTM 74, 2000, Chapters 9 and 26; R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Chapter 3, Section 3.1.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me