Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


This proves the entire statement of L16 at author-recorded tier 0. Write μ\mu for the Möbius function and ρ(n)=φ(n)/n\rho(n)=\varphi(n)/n. Inclusion-exclusion over the distinct prime divisors of nn gives

ρ(n)=∏p∣n(1−p−1)=∑d∣nμ(d)d,0<ρ(n)≤1.\rho(n)=\prod_{p\mid n}(1-p^{-1}) =\sum_{d\mid n}\frac{\mu(d)}d, \qquad 0<\rho(n)\le1.

Exact means of the normalized totient

Fix Q≥1Q\ge1 and first take an integer r≥0r\ge0. For g=gcd⁡(d,Q)g=\gcd(d,Q), the condition d∣r+Qtd\mid r+Qt is soluble in tt exactly when g∣rg\mid r. In that case it defines one residue class modulo d/gd/g, whose count among 1≤t≤X1\le t\le X differs from Xg/dXg/d by at most one. Expanding the divisor identity, with Y=r+QXY=r+QX, therefore gives

1X∑t=1Xρ(r+Qt)=∑d≤Y(d,Q)∣rμ(d)(d,Q)d2+O ⁣(1+log⁡YX).\frac1X\sum_{t=1}^X\rho(r+Qt) =\sum_{\substack{d\le Y\\(d,Q)\mid r}} \frac{\mu(d)(d,Q)}{d^2} +O\!\left(\frac{1+\log Y}{X}\right).

The sum on the right extends to an absolutely convergent series: its tail is at most Q∑d>Yd−2≤Q/YQ\sum_{d>Y}d^{-2}\le Q/Y. Both errors tend to zero for fixed Q,rQ,r. A fixed shift of tt handles negative rr and shows that changing representatives modulo QQ does not change the mean. Thus the mean is

κQ(r)=∑d≥1(d,Q)∣rμ(d)(d,Q)d2.\kappa_Q(r)=\sum_{\substack{d\ge1\\(d,Q)\mid r}} \frac{\mu(d)(d,Q)}{d^2}.

Its multiplicative summands admit an absolutely convergent Euler product. A prime p∤Qp\nmid Q gives the factor 1−p−21-p^{-2}; a prime p∣Qp\mid Q gives 1−p−11-p^{-1} if p∣rp\mid r, and 11 otherwise. Using ∏p(1−p−2)=1/ζ(2)\prod_p(1-p^{-2})=1/\zeta(2) gives the formula in the statement. The infinite product is positive because ∑pp−2<∞\sum_p p^{-2}<\infty, and the finitely many replacement factors are positive. Consequently κQ(r)>0\kappa_Q(r)>0 for every rr, and κQ(r)≤1\kappa_Q(r)\le1 because it is a limit of averages of numbers in (0,1](0,1].

Refinement at a fresh prime

Let ℓ∤Q\ell\nmid Q be prime. For each residue b(modℓ)b\pmod\ell, choose aba_b with ab≡a(modQ)a_b\equiv a\pmod Q and ab≡b(modℓ)a_b\equiv b\pmod\ell; the Chinese remainder theorem supplies it. The product formula shows, for every integer ss,

κQℓ(ab+s)=κQ(a+s)1−ℓ−2(1−1ℓ∣b+sℓ).\kappa_{Q\ell}(a_b+s) =\frac{\kappa_Q(a+s)}{1-\ell^{-2}} \left(1-\frac{\boldsymbol1_{\ell\mid b+s}}\ell\right).

Indeed the factors at primes dividing QQ are unchanged. At ℓ\ell, the former factor 1−ℓ−21-\ell^{-2} is replaced by 1−ℓ−11-\ell^{-1} when ℓ∣b+s\ell\mid b+s, and by 11 otherwise.

Passing the infinite kernel through the mean

For any absolutely summable real kernel cc, the tails of F(N)=∑scsρ(N+s)F(N)=\sum_sc_s\rho(N+s) have absolute value at most ∑s>H∣cs∣\sum_{s>H}|c_s|, uniformly in N≥1N\ge1. For a finite truncation, the mean is the sum of the finitely many means already computed. Letting the cutoff grow proves that every progression mean of FF exists and equals

MQ(a)=∑s≥1csκQ(a+s).\mathcal M_Q(a)=\sum_{s\ge1}c_s\kappa_Q(a+s).

The error from the omitted kernel is bounded by its absolute tail in each average and in this limiting expression. This justifies the interchange without any assumption on pointwise asymptotics for φ(n)/n\varphi(n)/n.

Separating the two refinements

Put ds=csκQ(a+s)d_s=c_s\kappa_Q(a+s). This sequence is absolutely summable, and it has a nonzero entry since κQ(a+s)>0\kappa_Q(a+s)>0 and cc is nonzero. Take any s∗,K,ℓs_*,K,\ell satisfying the statement's conditions. Such a KK exists by absolute convergence, and such primes exist by infinitude of primes. Define

Dr=∑s≥1s≡r (ℓ)ds.D_r=\sum_{\substack{s\ge1\\s\equiv r\ (\ell)}}d_s.

Because 1≤s∗≤K<ℓ1\le s_*\le K<\ell, the initial part with s≤Ks\le K of Ds∗D_{s_*} contains only ds∗d_{s_*}, whereas that of D0D_0 is empty. The two remaining sums use disjoint subsets of s>Ks>K, so

∣Ds∗−D0∣≥∣ds∗∣−∑s>K∣ds∣>34∣ds∗∣>12∣ds∗∣.|D_{s_*}-D_0| \ge |d_{s_*}|-\sum_{s>K}|d_s| >\frac34|d_{s_*}|>\frac12|d_{s_*}|.

Summing the refinement identity against csc_s now gives

MQℓ(a−s∗)−MQℓ(a0)=−Ds∗−D0ℓ(1−ℓ−2).\mathcal M_{Q\ell}(a_{-s_*})- \mathcal M_{Q\ell}(a_0) =-\frac{D_{s_*}-D_0}{\ell(1-\ell^{-2})}.

Its magnitude exceeds ∣ds∗∣/[2ℓ(1−ℓ−2)]=2η|d_{s_*}|/[2\ell(1-\ell^{-2})]=2\eta. Hence at least one of these two means has magnitude greater than η\eta. The class denoted a−s∗a_{-s_*} here is the class denoted a1a_1 in the statement; it is different from a0a_0 since 0<s∗<ℓ0<s_*<\ell.

On the refinement whose mean has magnitude greater than η\eta, there must be infinitely many NN with ∣F(N)∣>η/2|F(N)|>\eta/2. Otherwise, all sufficiently late terms would have absolute value at most η/2\eta/2, forcing the mean to have absolute value at most η/2\eta/2. The finitely many earlier terms have no effect on the mean because ∣F(N)∣≤∑s∣cs∣|F(N)|\le\sum_s|c_s|. These infinitely many witnesses are also in the original progression, proving its positive absolute limsup. This proves both the main conclusion and every quantified refinement assertion. □\square