Wiki
Wiki

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

Updated

../


Source. Terence Tao, The convergence of an alternating series of Erdős, assuming the Hardy--Littlewood prime tuples conjecture, the random sifted model and displays (3.7)--(3.8) on physical and printed pp. 7--8, and Lemma 3.2 with its proof on pp. 9--10, in the sixteen-page arXiv v3 PDF held by its library card, Tao (2023).

Standing. This is an author-recorded reconstruction of a source lemma and of the model it concerns. It is not an independent review, changes no status and assigns no tier. The lemma is unconditional. Two external inputs are imported without rereading their proofs: Mertens' theorems and the pair singular-series average, both stated precisely below.

Definitions

Throughout, pp ranges over primes. For a finite set H={h1,…,hk}\mathcal H=\{h_1,\dots,h_k\} of distinct integers, νH(p)\nu_{\mathcal H}(p) is the number of residue classes modulo pp occupied by H\mathcal H, and

S(H)=∏p1−νH(p)/p(1−1/p)k\mathfrak S(\mathcal H)=\prod_p\frac{1-\nu_{\mathcal H}(p)/p}{(1-1/p)^k}

is its singular series; the product converges absolutely because νH(p)=k\nu_{\mathcal H}(p)=k once pp exceeds every difference ∣hi−hj∣|h_i-h_j|, and then the factor is 1+O(k2/p2)1+O(k^2/p^2). If some pp has νH(p)=p\nu_{\mathcal H}(p)=p then S(H)=0\mathfrak S(\mathcal H)=0.

Fix a positive integer dd (in the main argument d=λlog⁡xd=\lambda\log x) and a real z≥dz\ge d. Choose, for each prime p≤zp\le z, a residue class ap mod p\mathbf a_p\bmod p uniformly at random, independently over pp. For real w≤zw\le z the random sifted set at level ww is

Sw={0<h≤d: h≢ap ( mod p) for all p≤w},Sw=∣Sw∣.\boldsymbol{\mathcal S}_w=\{0<h\le d:\ h\not\equiv\mathbf a_p\ (\bmod p) \text{ for all }p\le w\}, \qquad \mathbf S_w=|\boldsymbol{\mathcal S}_w|.

The source writes λlog⁡x\lambda\log x for dd; the model is that of Banks, Ford and Tao (the source's reference [1], §1.3), which this repository does not hold.

Imported input 1 (Mertens' theorems). There is an absolute constant BB such that, for y≥2y\ge2,

∑p≤y1p=log⁡log⁡y+B+O ⁣(1log⁡y),∏p≤y(1−1p)=e−γlog⁡y(1+O ⁣(1log⁡y)),\sum_{p\le y}\frac1p=\log\log y+B+O\!\left(\frac1{\log y}\right), \qquad \prod_{p\le y}\left(1-\frac1p\right) =\frac{e^{-\gamma}}{\log y}\left(1+O\!\left(\frac1{\log y}\right)\right),

where γ\gamma is the Euler--Mascheroni constant. These are the standard forms of Mertens' second and third theorems, and are used as external theorems here; the repository holds no source for them.

Imported input 2 (pair singular-series average). For all sufficiently large integers HH,

2∑0<h1<h2≤HS({h1,h2})≤H2.2\sum_{0<h_1<h_2\le H}\mathfrak S(\{h_1,h_2\})\le H^2.

This is the source's display (3.14) on p. 9. The source attributes the asymptotic H2−Hlog⁡H+O(H)H^2-H\log H+O(H) for the left side to unpublished work of Montgomery, with a full proof in M. J. Croft, Square-free numbers in arithmetic progressions, Proc. London Math. Soc. (3) 30 (1975), 143--159 (the source's reference [2]), and cites the sharper asymptotic of Montgomery and Soundararajan, Primes in short intervals, Comm. Math. Phys. 252 (2004), 589--617 (its reference [16], displays (16)--(17)). The asymptotic implies the inequality for large HH because Hlog⁡HH\log H eventually exceeds the O(H)O(H) term. Neither paper is held or reread here.

The product formula (3.7) and its tail (3.8)

Let 0<h1<⋯<hk≤d0<h_1<\dots<h_k\le d and d≤w≤zd\le w\le z, and write H={h1,…,hk}\mathcal H=\{h_1,\dots,h_k\}. The events {h1,…,hk≢ap ( mod p)}\{h_1,\dots,h_k\not\equiv\mathbf a_p\ (\bmod p)\} for distinct p≤wp\le w are independent, and each has probability 1−νH(p)/p1-\nu_{\mathcal H}(p)/p, since ap\mathbf a_p is uniform and H\mathcal H occupies νH(p)\nu_{\mathcal H}(p) classes. Hence

P(h1,…,hk∈Sw)=∏p≤w(1−νH(p)p).\mathbf P(h_1,\dots,h_k\in\boldsymbol{\mathcal S}_w) =\prod_{p\le w}\left(1-\frac{\nu_{\mathcal H}(p)}p\right).

For p>w≥dp>w\ge d every difference hj−hih_j-h_i lies in (0,d)(0,d), so is not divisible by pp, and νH(p)=k\nu_{\mathcal H}(p)=k. Multiplying and dividing by the absolutely convergent product over p>wp>w gives display (3.7):

P(h1,…,hk∈Sw)=S(H)(∏p≤w(1−1p)k)∏p>w(1−1/p)k1−k/p.\mathbf P(h_1,\dots,h_k\in\boldsymbol{\mathcal S}_w) =\mathfrak S(\mathcal H) \left(\prod_{p\le w}\left(1-\frac1p\right)^k\right) \prod_{p>w}\frac{(1-1/p)^k}{1-k/p}.

If S(H)=0\mathfrak S(\mathcal H)=0 both sides vanish, since the vanishing factor 1−νH(p)/p1-\nu_{\mathcal H}(p)/p then occurs at some p≤wp\le w.

Now suppose k2≤wk^2\le w; then k/p≤1/2k/p\le1/2 for every p>wp>w (for k≥2k\ge2 because k≤w/k≤w/2k\le w/k\le w/2, and trivially for k=1k=1). For 0≤u≤1/20\le u\le1/2 one has ∣log⁡(1−u)+u∣≤u2|\log(1-u)+u|\le u^2, so for p>wp>w

klog⁡(1−1p)−log⁡(1−kp)=k(−1p+O ⁣(1p2))+kp+O ⁣(k2p2)=O ⁣(k2p2).k\log\left(1-\frac1p\right)-\log\left(1-\frac kp\right) =k\left(-\frac1p+O\!\left(\frac1{p^2}\right)\right) +\frac kp+O\!\left(\frac{k^2}{p^2}\right) =O\!\left(\frac{k^2}{p^2}\right).

Summing over p>wp>w and using ∑n>wn−2≤1/⌊w⌋≤2/w\sum_{n>w}n^{-2}\le1/\lfloor w\rfloor\le2/w for real w≥1w\ge1 gives ∑p>w(klog⁡(1−1/p)−log⁡(1−k/p))=O(k2/w)\sum_{p>w}\bigl(k\log(1-1/p)-\log(1-k/p)\bigr)=O(k^2/w), and since k2/w≤1k^2/w\le1, exponentiating gives display (3.8):

P(h1,…,hk∈Sw)=S(H)(∏p≤w(1−1p)k)(1+O ⁣(k2w))(k2≤w).\mathbf P(h_1,\dots,h_k\in\boldsymbol{\mathcal S}_w) =\mathfrak S(\mathcal H) \left(\prod_{p\le w}\left(1-\frac1p\right)^k\right) \left(1+O\!\left(\frac{k^2}w\right)\right) \qquad(k^2\le w).

The source states (3.8) in the regime k≤rk\le r of its fixed setting (p. 7), where k2/w→0k^2/w\to0; the hypothesis k2≤wk^2\le w is supplied here as the one the derivation uses, since under 2k≤w2k\le w alone k2/wk^2/w is unbounded and exp⁡(O(k2/w))\exp(O(k^2/w)) is not 1+O(k2/w)1+O(k^2/w). In the main argument k≤r≪(log⁡log⁡x)4.5k\le r\ll(\log\log x)^{4.5} and w≥d≥log⁡xw\ge d\ge\log x, so k2≤wk^2\le w holds for large xx.

Statement

Lemma 3.2. There is an absolute constant d0d_0 such that for every integer d≥d0d\ge d_0, every real z≥dz\ge d and every real ww with d≤w≤zd\le w\le z,

E Sw=d∏p≤w(1−1p)=deγlog⁡w(1+O ⁣(1log⁡w))(3.12)\mathbf E\,\mathbf S_w =d\prod_{p\le w}\left(1-\frac1p\right) =\frac{d}{e^{\gamma}\log w}\left(1+O\!\left(\frac1{\log w}\right)\right) \tag{3.12}

and

Var(Sw)≪dlog⁡w.(3.13)\mathbf{Var}(\mathbf S_w)\ll\frac{d}{\log w}. \tag{3.13}

The implied constants are absolute, the source's convention for OO and ≪\ll (p. 3). The source states the lemma for λlog⁡x≤w≤z\lambda\log x\le w\le z with d=λlog⁡xd=\lambda\log x inside its fixed setting, where xx is sufficiently large and λlog⁡x\lambda\log x is an integer with 1≪λ1\ll\lambda (pp. 5--6); the hypothesis d≥d0d\ge d_0 replaces that setting here and is used twice below, as d≥4d\ge4 where (3.8) is applied with k=2k=2 and as dd at least the threshold of imported input 2.

Proof

Mean. By linearity of expectation and the case k=1k=1 of the product formula, for which ν{h}(p)=1\nu_{\{h\}}(p)=1 for every pp,

E Sw=∑0<h≤dP(h∈Sw)=d∏p≤w(1−1p),\mathbf E\,\mathbf S_w=\sum_{0<h\le d}\mathbf P(h\in\boldsymbol{\mathcal S}_w) =d\prod_{p\le w}\left(1-\frac1p\right),

and Mertens' third theorem gives the second form of (3.12). The source writes this probability "for all 0<h≤w0<h\le w"; the sum runs over 0<h≤d0<h\le d, and d≤wd\le w, so nothing changes.

Second factorial moment. The number of two-element subsets of Sw\boldsymbol{\mathcal S}_w is (Sw2)\binom{\mathbf S_w}2, so

E(Sw2−Sw)=2 E(Sw2)=2∑0<h1<h2≤dP(h1,h2∈Sw).\mathbf E(\mathbf S_w^2-\mathbf S_w) =2\,\mathbf E\binom{\mathbf S_w}2 =2\sum_{0<h_1<h_2\le d}\mathbf P(h_1,h_2\in\boldsymbol{\mathcal S}_w).

By (3.8) with k=2k=2 (valid as w≥d≥4w\ge d\ge4, so that k2=4≤wk^2=4\le w, which d≥d0d\ge d_0 supplies),

P(h1,h2∈Sw)=S({h1,h2})Pw2(1+O ⁣(1w)),Pw:=∏p≤w(1−1p).\mathbf P(h_1,h_2\in\boldsymbol{\mathcal S}_w) =\mathfrak S(\{h_1,h_2\})P_w^2\left(1+O\!\left(\frac1w\right)\right), \qquad P_w:=\prod_{p\le w}\left(1-\frac1p\right).

Imported input 2 with H=dH=d, which d≥d0d\ge d_0 allows, gives 2∑0<h1<h2≤dS({h1,h2})≤d22\sum_{0<h_1<h_2\le d}\mathfrak S(\{h_1,h_2\})\le d^2, hence

E(Sw2−Sw)≤d2Pw2+O ⁣(d2Pw2w).\mathbf E(\mathbf S_w^2-\mathbf S_w) \le d^2P_w^2+O\!\left(\frac{d^2P_w^2}w\right).

Variance. Since E Sw=dPw\mathbf E\,\mathbf S_w=dP_w,

Var(Sw)=E(Sw2−Sw)+E Sw−(dPw)2≤E Sw+O ⁣(d2Pw2w).\mathbf{Var}(\mathbf S_w) =\mathbf E(\mathbf S_w^2-\mathbf S_w)+\mathbf E\,\mathbf S_w-(dP_w)^2 \le\mathbf E\,\mathbf S_w+O\!\left(\frac{d^2P_w^2}w\right).

By (3.12), E Sw≪d/log⁡w\mathbf E\,\mathbf S_w\ll d/\log w. By the hypothesis w≥dw\ge d and Mertens' third theorem, d2Pw2/w≤dPw2≪d/log⁡2wd^2P_w^2/w\le dP_w^2\ll d/\log^2w. Both terms are ≪d/log⁡w\ll d/\log w, which is (3.13).

Boundary. The lemma is unconditional. Its only inputs beyond the model are Mertens' theorems and the pair singular-series average, both imported. The Theorem 1.4 reconstruction consumes (3.7)--(3.8) at level w=zw=z and (3.12)--(3.13) at every prime level ww in [d,z][d,z].