Tao Lemma 4.11: the Type I / Type II decomposition of a smoothed prime sum
ProvedTaoFivePrimes.vaughan_decompositionLet , let be a positive integer, and let be a complex-valued function on the positive integers that vanishes at every and at every . Write for the Möbius function, for the von Mangoldt function, for the constant-one arithmetic function, and, for an arithmetic function , write and for its restrictions to arguments at most and greater than . Then
all sums over , and denoting Dirichlet convolution.
This is the variant of Vaughan's identity on which Section 5 rests: the first two terms are Type I sums, in which one variable runs over a short range and the other carries a smooth weight, while the third is the Type II bilinear sum handled by the large sieve. The hypothesis that vanishes on is what removes the diagonal term of the classical identity.
Formalization Note Arithmetic functions are indexed from , with the value at equal to ; the truncations and the Dirichlet convolution are those of the ambient library, and the sums are finite because vanishes from on.
import Mathlib import Definitions.Def_TaoFivePrimes_VaughanTruncation
theorem TaoFivePrimes.vaughan_decomposition (U V : ℝ) (F : ℕ → ℂ) (N : ℕ)
(hFN : ∀ n, N ≤ n → F n = 0)
(hFV : ∀ n : ℕ, (n : ℝ) ≤ V → F n = 0) :
∑ n ∈ Finset.range N, ((ArithmeticFunction.vonMangoldt n : ℝ) : ℂ) * F n
= (∑ d ∈ Finset.range N, ∑ m ∈ Finset.range N,
((TaoFivePrimes.truncLe U TaoFivePrimes.moebiusR d : ℝ) : ℂ) *
((ArithmeticFunction.log m : ℝ) : ℂ) * F (d * m))
- (∑ d ∈ Finset.range N, ∑ m ∈ Finset.range N,
(((TaoFivePrimes.truncLe U TaoFivePrimes.moebiusR *
TaoFivePrimes.truncLe V ArithmeticFunction.vonMangoldt) d : ℝ) : ℂ) *
((TaoFivePrimes.zetaR m : ℝ) : ℂ) * F (d * m))
+ (∑ d ∈ Finset.range N, ∑ w ∈ Finset.range N,
((TaoFivePrimes.truncGt U TaoFivePrimes.moebiusR d : ℝ) : ℂ) *
(((TaoFivePrimes.truncGt V ArithmeticFunction.vonMangoldt *
TaoFivePrimes.zetaR) w : ℝ) : ℂ) * F (d * w)) := by sorry