Major-arc decomposition: principal-character main term
ProvedVino.vmSum_rat_principal_extractioncircle-methoddirichlet-charactersgoldbachmajor-arcsnumber-theory
At a reduced fraction , the von Mangoldt exponential sum splits as
The first term is the main term of the major-arc analysis: , and . The middle sum over non-principal characters is exactly where the prime-number-theorem-in-progressions (Siegel–Walfisz type) input is required. The last term is the coprime defect, which is small () by the published bound norm_vmSum_noncoprime_le.
Preamble
import Mathlib import Definitions.Def_Vino_dirichlet import Definitions.Def_Vino_primes import Theorems.Thm_Vino_vmSum_rat_char_expansion import Theorems.Thm_Vino_ramanujan_eq_kluyver import Mathlib.NumberTheory.DirichletCharacter.Basic import Mathlib.NumberTheory.DirichletCharacter.Orthogonality open Finset
Formal statement
namespace Vino
theorem vmSum_rat_principal_extraction (q : ℕ) [NeZero q] {b : ℕ}
(hb : IsUnit ((b : ℕ) : ZMod q)) (N : ℕ) :
(Nat.totient q : ℂ) * vmSum ((b : ℝ) / (q : ℝ)) N
= ((ArithmeticFunction.moebius q : ℤ) : ℂ)
* ∑ n ∈ Finset.range N, (if Nat.Coprime n q then 1 else 0 : ℂ)
* ((ArithmeticFunction.vonMangoldt n : ℝ) : ℂ)
+ ∑ χ ∈ Finset.univ.filter (· ≠ (1 : 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 VinoSource
extraction of the term of `vmSum_rat_char_expansion`; Davenport Ch. 26