For y≥10 and nonnegative real numbers ad indexed by
d∈N≤y,
d∈N≤y∑ad≪(logy)d∈N≤ysupd1−1/logyad.(1)
Either side may be infinite. The notation and exact classical inputs are
fixed in Definitions and analytic inputs.
Proof. Set α=1−1/logy>0. Unique factorization and monotone
limits of positive geometric series give
d∈N≤y∑d−α=p≤y∏(1−p−α)−1.
For y≥e4, α≥3/4, so uniformly in p≤y,
(1−p−α)−1=1+pp1/logy+O(p−3/2).
Since 0≤logp/logy≤1, the inequality
eu=1+O(u) on [0,1] yields
logp≤y∏(1−p−α)−1=p≤y∑p1+O(logy1p≤y∑plogp)+O(1)=loglogy+O(1).
The error ∑p−3/2 converges, and the two prime sums are (2) in
the input page. For 10≤y≤e4, only finitely many primes occur
and α≥1−1/log10>0. The product is uniformly bounded; enlarging
the constant therefore proves the same O(logy) bound.
Let T be the supremum in (1). If T=∞, the assertion is immediate.
Otherwise ad≤Td−α for every d, and summing proves (1).
This includes T=0 and the term d=1. □
Source. Tao, published paper, published pp.798–799, Lemma 1.5. This page uses that published version.
Bears on. Problem 49.