Section 3.6 · PDF pages 17–18
Uniform perturbation and subgroup averaging
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
3.6 Uniform perturbation and subgroup averaging
There is an absolute constant C_{d} ≥0, independent of H, D, ℓ, such that for y, z ≥1
Selectable PDF notation • transcription unchecked
|G(y) −G(z)| ≤C_{d}|y −(z|, )_{(19)}|G_{D}(ψ; y) −G_{D}(ψ; z)| ≤|y −z| log max(y, z) + C_{d} + |ℓ(ψ)| (ψ ̸= 1).
Also, for A, w, w^{′}> 0, uniformly in ψ,
Selectable PDF notation • transcription unchecked
|wG_{D}(ψ; A/w) −w^{′}G_{D}(ψ; A/w^{′})| ≤^{3A} (20)min(w, w^{′})^{|w −w′|.}
We supply the needed elementary justification, including the uniform constants. Rosser and Schoenfeld, Theorem 12, equation (3.35), give ∑_{m≤Y} Λ(m) < 1.03883Y for every Y > 0; in particular this sum is at most 3Y .^{2} For k ≥1, write A(k) =∑_{m≤k}Λ(m)/m. The identity log k! = ∑_{m≤k}Λ(m)⌊k/m⌋ and the bounds k/m −1 < ⌊k/m⌋≤k/m imply
log k −1 ≤A(k) ≤ log k + 3.
Selectable PDF notation • transcription unchecked
∫ k
Here log k! ≤k log k and log k! ≥_{1} log t dt ≥k log k −k. On k ≤y ≤k + 1,
Selectable PDF notation • transcription unchecked
∑
G(y) = yA(k) − Λ(m) −y log y + (1 + γ)y.
Selectable PDF notation • transcription unchecked
m≤k
The extra term at y = k+1 is zero, so this formula includes both endpoints. Its derivative is A(k)−log y+γ, which is bounded by an absolute constant for k ≥1. The mean value bound on each such interval, followed by addition over the intervening integer intervals, proves the first part of (19). For the second, truncate both ramps at ⌊max(y, z)⌋, use |(y/m−1)_{+} −(z/m−1)_{+}| ≤|y −z|/m and |b_{ψ}(m)| ≤1, and add |y −z||ℓ(ψ)|. Increase C_{d} once to cover both estimates.
For (20), take the common cutoff ⌊A/ min(w, w^{′})⌋. For a nonprincipal ψ, the linear correction Aℓ(ψ) cancels, and ∑
Selectable PDF notation • transcription unchecked
wG_{D}(ψ; A/w) = Λ(m)b_{ψ}(m)(A/m −w)_{+} + Aℓ(ψ).
mEach ramp difference is at most |w −w^{′}|; summing and using the 3Y bound proves the assertion. For ψ = 1, assume by symmetry w ≤w^{′}. The difference is U −V , where 0 ≤U ≤3A(w^{′}−w)/w is the difference of the two ramp sums and V = A log(w^{′}/w). Since 0 ≤V ≤A(w^{′}−w)/w, the absolute value of U −V has the same upper bound 3A(w^{′}−w)/w.
Fix a subgroup A_{0} ≤H, and put
Ψ(A_{0}) = {ψ ∈Γ :̂ ψ(0, u) = 1 for all u ∈A_{0}}.
Let T, T_{2} ⊆H, T_{2} ⊆A_{0}, m ∈ℕ, and choose b, b^{′}, X^{′}> 0, η, ϑ ≥0. For each u ∈A_{0}, j < m, let w_{u,j} be positive on Φ. Assume
Selectable PDF notation • transcription unchecked
|a_{t}/b −x| ≤1 (t ∈T), b^{′}X^{′}≤xb,b ≤w_{u,j} ≤b + η + 1 on Θ_{u}, w_{u,j} ≤2b^{′} on Φ \ Θ_{u}, (21)
Selectable PDF notation • transcription unchecked
a_{t}/w_{u,j}(ρ) ≤N (t ∈T, ρ ∈Φ).^{2}J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962), 64–94, p. 71, Theorem 12; https://doi.org/10.1215/ijm/1255631807. The theorem in the original paper was checked at this location.
Assume further that
Selectable PDF notation • transcription unchecked
|G_{D}(ψ; y)| ≤ϑy (y ≥X^{′}/3, ψ ∈Γ)̂ ,and that the cost inequalities hold:
Selectable PDF notation • transcription unchecked
2f(x + 1)ϑ ≤1/x, 6f(x + 1)(η + 1) ≤b/x. (22)
Define the gap at u by
Selectable PDF notation • transcription unchecked
∑∑( )
gap(u) = ASK(a_{t}, t, w_{u,j}) −ℜ MAIN(a_{t}, w_{u,j}) .
Selectable PDF notation • transcription unchecked
t∈Tj<m
Lemma 3.6 (Averaged gap bound). Suppose x ≥3, the preceding assumptions hold, and gap(u) ≤E for every u ∈A_{0}. If ∑
Selectable PDF notation • transcription unchecked
|T|Y ≤ ℜ ∑ ψ(e_{1}(t))G_{D}(ψ; a_{t}/b),
t∈T ψ∈Ψ(A_{0})then
Selectable PDF notation • transcription unchecked
|T|mb^{δ}_{2}^{2}Y ≤E + 2^{|T}_{x}^{|mb}.Proof. Define
Selectable PDF notation • transcription unchecked
∑∑
Th(u, t; y) =^{b} ψ(−e_{1}(s + u −t))G_{D}(ψ; y).
Selectable PDF notation • transcription unchecked
^{f}s∈T_{2} ψThe complement points whose partners belong to Θ_{u} are exactly e_{1}(s + u −t), s ∈T_{2}. Thus this thick sum is the right side of Lemma 3.5 with each thick weight replaced by b, and the other terms omitted. For A = a_{t}, the error per character and complement point is at most
Selectable PDF notation • transcription unchecked
K = 3(x + 1)(η + 1) + (x + 1)bϑ.
On the thick set this follows from (20) and A/b ≤x + 1. Off the thick set,
Selectable PDF notation • transcription unchecked
A/w ≥(x −1)b/(2b^{′}) ≥X^{′}/3,because x ≥3 and b^{′}X^{′}≤xb. The thin bound gives |wG_{D}(ψ; A/w)| ≤Aϑ, which is at most the second term of K. There are f complement points and 2f characters; division by f therefore bounds the total error by 2fK. By (22), this is at most 2b/x. Exact balance consequently gives
ℜ Th(u, t; a_{t}/b) ≤ ASK(a_{t}, t, w_{u,j}) −ℜ MAIN(a_{t}, w_{u,j}) + 2b/x.
Sum over t ∈T and j < m.
Next average over u ∈A_{0}. For s ∈T_{2} ⊆A_{0}, the character sum over u is
Selectable PDF notation • transcription unchecked
∑ ψ(−e_{1}(s + u −t)) = |A_{0}| 1_{ψ∈Ψ(A0)}ψ(e_{1}(t)).
u∈A_{0}The proof is the subgroup character sum: a nontrivial restriction has sum zero by translation by an element on which it is nontrivial; a trivial restriction has every term equal to 1. Therefore
Selectable PDF notation • transcription unchecked
∑ ∑
Th(u, t; y) = |A_{0}|b^{|T2|} ψ(e_{1}(t))G_{D}(ψ; y).
Selectable PDF notation • transcription unchecked
u∈A0^{f} ψ∈Ψ(A_{0})Since |T_{2}|/f = δ_{2}/2, dividing the summed gap bound by |A_{0}| > 0, and then applying the hypothesized lower bound, proves the assertion.