This proves the entire statement of
L218 at
author-recorded tier 0. Write S=∑n≥1φ(n)2−n, which
converges absolutely since 0<φ(n)≤n, and write
⌊x⌉ for an integer nearest to x.
Choose the δk in turn. Put η0=r−S and, for k≥1,
δk=2s(ek)⌊ηk−12ek−s(ek)⌉,ηk=ηk−1−δk2−ek.
Item 1 holds by construction. Since
ηk=2s(ek)−ek(x−⌊x⌉) with
x=ηk−12ek−s(ek), every k≥1 satisfies
∣ηk∣≤2s(ek)−ek−1.(1)
For k≥2, rounding gives
∣δk∣≤∣ηk−1∣2ek+2s(ek)−1. By (1) at k−1, the gap
condition ek−ek−1≤g(ek−1), and the monotonicity of s and g,
∣δk∣≤2s(ek−1)+g(ek−1)−1+2s(ek)−1≤2s(ek)+g(ek)≤ek1/2,
the last step because ek≥n0. This is item 2.
For item 3, the bounds ∣ψ(n)∣≤n off the ek, $|\delta_k|\le
e_k^{1/2}$ for k≥2 and the single term δ1 make
∑n∣ψ(n)∣2−n finite. Rearranging the absolutely convergent
series,
n≥1∑ψ(n)2−n=S+i≥1∑δi2−ei=r−ηk+i>k∑δi2−ei
for every k≥1, by the definition of the ηi. As k→∞,
ηk→0 by (1), since s(ek)≤21log2ek gives
∣ηk∣≤ek1/22−ek−1, and the last sum tends to 0 as the
tail of a convergent series. Hence the sum equals r. □