Source: arXiv v2,
pp. 5--6, Lemma 3.3 and its proof.
Statement
Let s=m(A) and 1≤j≤J.
(a) If δi=0 for every i<j, then
Mj(1)≤sd≥d1P+(d)=pj∑d1.(1)
(b) Uniformly in all choices 0≤δi≤1/2,
Mj(2)≪pj2s2(logpj)6,(2)
with an absolute implied constant.
Full proof relative to the external distortion bound
Write p=pj and let t∈{1,2}. Raise the nonnegative inequality of
Lemma 3.2
to the tth power, expand the ordered product, and take expectation. This
gives
Ej−1αjt≤1≤r1,…,rt≤νjg1,…,gt∣Qj−1∑1≤i1,…,it≤ndiℓ=gℓprℓ (1≤ℓ≤t)∑pr1+⋯+rtPj−1(⋂ℓ=1t(aiℓ+gℓZ)).(3)
Every occurring gℓprℓ=diℓ is at least d1. Once
gℓ,rℓ are fixed, multiplicity gives at most st ordered choices
of the indices. A compatible intersection is one progression of modulus
[g1,…,gt]; an incompatible one is empty. Applying the exact
external distortion bound
to every nonempty intersection yields
Ej−1αjt≤st1≤r1,…,rt≤νjg1,…,gt∣Qj−1gℓprℓ≥d1 (1≤ℓ≤t)∑[g1,…,gt]pr1+⋯+rtph∣[g1,…,gt]∏(1−δh)−1.(4)
For t=1 and δh=0 for h<j, the distortion product is 1.
Each pair (g,r) determines d=gpr with P+(d)=p, so (4) is bounded by
the enlarged sum in (1).
For t=2, each distortion factor is at most 2, whence
Mj(2)≤(p−1)2s2g1,g2∣Qj−1∑[g1,g2]2ω([g1,g2]).(5)
Indeed, the two geometric sums in r1,r2 are each at most
∑r≥1p−r=1/(p−1).
The remaining sum is multiplicative. If a prime power qe with e≥1
is the exact q-part of [g1,g2], there are
(e+1)2−e2=2e+1
ordered pairs of exponents having maximum e, and the factor
2ω([g1,g2]) contributes 2. Therefore
g1,g2∣Qj−1∑[g1,g2]2ω([g1,g2])=h<j∏(1+2e=1∑νhphe2e+1).(6)
Each local factor is 1+6/ph+O(ph−2). Enlarging the absolute constant
handles the finitely many small primes, and 1+z≤ez gives
(6)≪exp(6ph<p∑ph1)≪(logp)6
by Mertens' estimate for the prime reciprocal sum. Finally
(p−1)−2≪p−2, and (2) follows. The Chinese remainder theorem and
Mertens' estimate are standard external inputs; the distortion estimate is
the separately identified imported lemma above.