Prime-side generating functions of the circle method
DefinitionVino_primesThree objects underlie the prime side of the Hardy--Littlewood circle method.
The von Mangoldt exponential sum
is the generating function whose cube has -th Fourier coefficient equal to the weighted number of representations of as a sum of three prime powers. Weighting by the von Mangoldt function rather than by the indicator of the primes is what makes the arithmetic in the major arcs come out in closed form.
The prime exponential sum
is the unweighted variant, which is what one estimates when counting primes rather than prime powers.
Finally Chebyshev's function is the value of at the origin, and therefore the normalisation against which every cancellation estimate for is measured.
All three are indexed by n < N rather than n ≤ N, matching Lean's Finset.range.
import Definitions.Def_CircleMethod_char
import Mathlib.NumberTheory.ArithmeticFunction.VonMangoldt
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
namespace Vino
/-- The von Mangoldt exponential sum `S(α, N) = ∑_{n < N} Λ(n) e(αn)`, the
prime-side generating function of the circle method. -/
noncomputable def vmSum (α : ℝ) (N : ℕ) : ℂ :=
∑ n ∈ Finset.range N,
((ArithmeticFunction.vonMangoldt n : ℝ) : ℂ) * CircleMethod.e (α * (n : ℝ))
/-- The unweighted prime exponential sum `∑_{p < N, p prime} e(αp)`. -/
noncomputable def primeSum (α : ℝ) (N : ℕ) : ℂ :=
∑ p ∈ (Finset.range N).filter Nat.Prime, CircleMethod.e (α * (p : ℝ))
/-- Chebyshev's function `ψ(N) = ∑_{n < N} Λ(n)`. -/
noncomputable def psi (N : ℕ) : ℝ :=
∑ n ∈ Finset.range N, (ArithmeticFunction.vonMangoldt n : ℝ)
end Vino