You are currently browsing the tag archive for the ‘Selberg sieve’ tag.

Many problems in non-multiplicative prime number theory can be recast as sieving problems. Consider for instance the problem of counting the number ${N(x)}$ of pairs of twin primes ${p,p+2}$ contained in ${[x/2,x]}$ for some large ${x}$; note that the claim that ${N(x) > 0}$ for arbitrarily large ${x}$ is equivalent to the twin prime conjecture. One can obtain this count by any of the following variants of the sieve of Eratosthenes:

1. Let ${A}$ be the set of natural numbers in ${[x/2,x-2]}$. For each prime ${p \leq \sqrt{x}}$, let ${E_p}$ be the union of the residue classes ${0\ (p)}$ and ${-2\ (p)}$. Then ${N(x)}$ is the cardinality of the sifted set ${A \backslash \bigcup_{p \leq \sqrt{x}} E_p}$.
2. Let ${A}$ be the set of primes in ${[x/2,x-2]}$. For each prime ${p \leq \sqrt{x}}$, let ${E_p}$ be the residue class ${-2\ (p)}$. Then ${N(x)}$ is the cardinality of the sifted set ${A \backslash \bigcup_{p \leq \sqrt{x}} E_p}$.
3. Let ${A}$ be the set of primes in ${[x/2+2,x]}$. For each prime ${p \leq \sqrt{x}}$, let ${E_p}$ be the residue class ${2\ (p)}$. Then ${N(x)}$ is the cardinality of the sifted set ${A \backslash \bigcup_{p \leq \sqrt{x}} E_p}$.
4. Let ${A}$ be the set ${\{ n(n+2): x/2 \leq n \leq x-2 \}}$. For each prime ${p \leq \sqrt{x}}$, let ${E_p}$ be the residue class ${0\ (p)}$ Then ${N(x)}$ is the cardinality of the sifted set ${A \backslash \bigcup_{p \leq \sqrt{x}} E_p}$.

Exercise 1 Develop similar sifting formulations of the other three Landau problems.

In view of these sieving interpretations of number-theoretic problems, it becomes natural to try to estimate the size of sifted sets ${A \backslash \bigcup_{p | P} E_p}$ for various finite sets ${A}$ of integers, and subsets ${E_p}$ of integers indexed by primes ${p}$ dividing some squarefree natural number ${P}$ (which, in the above examples, would be the product of all primes up to ${\sqrt{x}}$). As we see in the above examples, the sets ${E_p}$ in applications are typically the union of one or more residue classes modulo ${p}$, but we will work at a more abstract level of generality here by treating ${E_p}$ as more or less arbitrary sets of integers, without caring too much about the arithmetic structure of such sets.

It turns out to be conceptually more natural to replace sets by functions, and to consider the more general the task of estimating sifted sums

$\displaystyle \sum_{n \in {\bf Z}} a_n 1_{n \not \in \bigcup_{p | P} E_p} \ \ \ \ \ (1)$

for some finitely supported sequence ${(a_n)_{n \in {\bf Z}}}$ of non-negative numbers; the previous combinatorial sifting problem then corresponds to the indicator function case ${a_n=1_{n \in A}}$. (One could also use other index sets here than the integers ${{\bf Z}}$ if desired; for much of sieve theory the index set and its subsets ${E_p}$ are treated as abstract sets, so the exact arithmetic structure of these sets is not of primary importance.)

Continuing with twin primes as a running example, we thus have the following sample sieving problem:

Problem 2 (Sieving problem for twin primes) Let ${x, z \geq 1}$, and let ${\pi_2(x,z)}$ denote the number of natural numbers ${n \leq x}$ which avoid the residue classes ${0, -2\ (p)}$ for all primes ${p < z}$. In other words, we have

$\displaystyle \pi_2(x,z) := \sum_{n \in {\bf Z}} a_n 1_{n \not \in \bigcup_{p | P(z)} E_p}$

where ${a_n := 1_{n \in [1,x]}}$, ${P(z) := \prod_{p < z} p}$ is the product of all the primes strictly less than ${z}$ (we omit ${z}$ itself for minor technical reasons), and ${E_p}$ is the union of the residue classes ${0, -2\ (p)}$. Obtain upper and lower bounds on ${\pi_2(x,z)}$ which are as strong as possible in the asymptotic regime where ${x}$ goes to infinity and the sifting level ${z}$ grows with ${x}$ (ideally we would like ${z}$ to grow as fast as ${\sqrt{x}}$).

From the preceding discussion we know that the number of twin prime pairs ${p,p+2}$ in ${(x/2,x]}$ is equal to ${\pi_2(x-2,\sqrt{x}) - \pi_2(x/2,\sqrt{x})}$, if ${x}$ is not a perfect square; one also easily sees that the number of twin prime pairs in ${[1,x]}$ is at least ${\pi_2(x-2,\sqrt{x})}$, again if ${x}$ is not a perfect square. Thus we see that a sufficiently good answer to Problem 2 would resolve the twin prime conjecture, particularly if we can get the sifting level ${z}$ to be as large as ${\sqrt{x}}$.

We return now to the general problem of estimating (1). We may expand

$\displaystyle 1_{n \not \in \bigcup_{p | P} E_p} = \prod_{p | P} (1 - 1_{E_p}(n)) \ \ \ \ \ (2)$

$\displaystyle = \sum_{k=0}^\infty (-1)^k \sum_{p_1 \dots p_k|P: p_1 < \dots < p_k} 1_{E_{p_1}} \dots 1_{E_{p_k}}(n)$

$\displaystyle = \sum_{d|P} \mu(d) 1_{E_d}(n)$

where ${E_d := \bigcap_{p|d} E_p}$ (with the convention that ${E_1={\bf Z}}$). We thus arrive at the Legendre sieve identity

$\displaystyle \sum_{n \in {\bf Z}} a_n 1_{n \not \in \bigcup_{p | P} E_p} = \sum_{d|P} \mu(d) \sum_{n \in E_d} a_n. \ \ \ \ \ (3)$

Specialising to the case of an indicator function ${a_n=1_{n \in A}}$, we recover the inclusion-exclusion formula

$\displaystyle |A \backslash \bigcup_{p|P} E_p| = \sum_{d|P} \mu(d) |A \cap E_d|.$

Such exact sieving formulae are already satisfactory for controlling sifted sets or sifted sums when the amount of sieving is relatively small compared to the size of ${A}$. For instance, let us return to the running example in Problem 2 for some ${x,z \geq 1}$. Observe that each ${E_p}$ in this example consists of ${\omega(p)}$ residue classes modulo ${p}$, where ${\omega(p)}$ is defined to equal ${1}$ when ${p=2}$ and ${2}$ when ${p}$ is odd. By the Chinese remainder theorem, this implies that for each ${d|P(z)}$, ${E_d}$ consists of ${\prod_{p|d} \omega(p)}$ residue classes modulo ${d}$. Using the basic bound

$\displaystyle \sum_{n \leq x: n = a\ (q)} 1 = \frac{x}{q} + O(1) \ \ \ \ \ (4)$

for any ${x > 0}$ and any residue class ${a\ (q)}$, we conclude that

$\displaystyle \sum_{n \in E_d} a_n = g(d) x + O( \prod_{p|d} \omega(p) ) \ \ \ \ \ (5)$

for any ${d|P(z)}$, where ${g}$ is the multiplicative function

$\displaystyle g(d) := \prod_{p|d: p|P(z)} \frac{\omega(p)}{p}.$

Since ${\omega(p) \leq 2}$ and there are at most ${\pi(z)}$ primes dividing ${P(z)}$, we may crudely bound ${\prod_{p|d} \omega(p) \leq 2^{\pi(z)}}$, thus

$\displaystyle \sum_{n \in E_d} a_n = g(d) x + O( 2^{\pi(z)} ). \ \ \ \ \ (6)$

Also, the number of divisors of ${P(z)}$ is at most ${2^{\pi(z)}}$. From the Legendre sieve (3), we thus conclude that

$\displaystyle \pi_2(x,z) = (\sum_{d|P(z)} \mu(d) g(d) x) + O( 4^{\pi(z)} ).$

We can factorise the main term to obtain

$\displaystyle \pi_2(x,z) = x \prod_{p < z} (1-\frac{\omega(p)}{p}) + O( 4^{\pi(z)} ).$

This is compatible with the heuristic

$\displaystyle \pi_2(x,z) \approx x \prod_{p < z} (1-\frac{\omega(p)}{p}) \ \ \ \ \ (7)$

coming from the equidistribution of residues principle (Section 3 of Supplement 4), bearing in mind (from the modified Cramér model, see Section 1 of Supplement 4) that we expect this heuristic to become inaccurate when ${z}$ becomes very large. We can simplify the right-hand side of (7) by recalling the twin prime constant

$\displaystyle \Pi_2 := \prod_{p>2} (1 - \frac{1}{(p-1)^2}) = 0.6601618\dots$

(see equation (7) from Supplement 4); note that

$\displaystyle \prod_p (1-\frac{1}{p})^{-2} (1-\frac{\omega(p)}{p}) = 2 \Pi_2$

so from Mertens’ third theorem (Theorem 42 from Notes 1) one has

$\displaystyle \prod_{p < z} (1-\frac{\omega(p)}{p}) = (2\Pi_2+o(1)) \frac{1}{(e^\gamma \log z)^2} \ \ \ \ \ (8)$

as ${z \rightarrow \infty}$. Bounding ${4^{\pi(z)}}$ crudely by ${\exp(o(z))}$, we conclude in particular that

$\displaystyle \pi_2(x,z) = (2\Pi_2 +o(1)) \frac{x}{(e^\gamma \log z)^2}$

when ${x,z \rightarrow \infty}$ with ${z = O(\log x)}$. This is somewhat encouraging for the purposes of getting a sufficiently good answer to Problem 2 to resolve the twin prime conjecture, but note that ${z}$ is currently far too small: one needs to get ${z}$ as large as ${\sqrt{x}}$ before one is counting twin primes, and currently ${z}$ can only get as large as ${\log x}$.

The problem is that the number of terms in the Legendre sieve (3) basically grows exponentially in ${z}$, and so the error terms in (4) accumulate to an unacceptable extent once ${z}$ is significantly larger than ${\log x}$. An alternative way to phrase this problem is that the estimate (4) is only expected to be truly useful in the regime ${q=o(x)}$; on the other hand, the moduli ${d}$ appearing in (3) can be as large as ${P}$, which grows exponentially in ${z}$ by the prime number theorem.

To resolve this problem, it is thus natural to try to truncate the Legendre sieve, in such a way that one only uses information about the sums ${\sum_{n \in E_d} a_n}$ for a relatively small number of divisors ${d}$ of ${P}$, such as those ${d}$ which are below a certain threshold ${D}$. This leads to the following general sieving problem:

Problem 3 (General sieving problem) Let ${P}$ be a squarefree natural number, and let ${{\mathcal D}}$ be a set of divisors of ${P}$. For each prime ${p}$ dividing ${P}$, let ${E_p}$ be a set of integers, and define ${E_d := \bigcap_{p|d} E_p}$ for all ${d|P}$ (with the convention that ${E_1={\bf Z}}$). Suppose that ${(a_n)_{n \in {\bf Z}}}$ is an (unknown) finitely supported sequence of non-negative reals, whose sums

$\displaystyle X_d := \sum_{n \in E_d} a_n \ \ \ \ \ (9)$

are known for all ${d \in {\mathcal D}}$. What are the best upper and lower bounds one can conclude on the quantity (1)?

Here is a simple example of this type of problem (corresponding to the case ${P = 6}$, ${{\mathcal D} = \{1, 2, 3\}}$, ${X_1 = 100}$, ${X_2 = 60}$, and ${X_3 = 10}$):

Exercise 4 Let ${(a_n)_{n \in {\bf Z}}}$ be a finitely supported sequence of non-negative reals such that ${\sum_{n \in {\bf Z}} a_n = 100}$, ${\sum_{n \in {\bf Z}: 2|n} a_n = 60}$, and ${\sum_{n \in {\bf Z}: 3|n} a_n = 10}$. Show that

$\displaystyle 30 \leq \sum_{n \in {\bf Z}: (n,6)=1} a_n \leq 40$

and give counterexamples to show that these bounds cannot be improved in general, even when ${a_n}$ is an indicator function sequence.

Problem 3 is an example of a linear programming problem. By using linear programming duality (as encapsulated by results such as the Hahn-Banach theorem, the separating hyperplane theorem, or the Farkas lemma), we can rephrase the above problem in terms of upper and lower bound sieves:

Theorem 5 (Dual sieve problem) Let ${P, {\mathcal D}, E_p, E_d, X_d}$ be as in Problem 3. We assume that Problem 3 is feasible, in the sense that there exists at least one finitely supported sequence ${(a_n)_{n \in {\bf Z}}}$ of non-negative reals obeying the constraints in that problem. Define an (normalised) upper bound sieve to be a function ${\nu^+: {\bf Z} \rightarrow {\bf R}}$ of the form

$\displaystyle \nu^+ = \sum_{d \in {\mathcal D}} \lambda^+_d 1_{E_d}$

for some coefficients ${\lambda^+_d \in {\bf R}}$, and obeying the pointwise lower bound

$\displaystyle \nu^+(n) \geq 1_{n \not \in\bigcup_{p|P} E_p}(n) \ \ \ \ \ (10)$

for all ${n \in {\bf Z}}$ (in particular ${\nu^+}$ is non-negative). Similarly, define a (normalised) lower bound sieve to be a function ${\nu^-: {\bf Z} \rightarrow {\bf R}}$ of the form

$\displaystyle \nu^-(n) = \sum_{d \in {\mathcal D}} \lambda^-_d 1_{E_d}$

for some coefficients ${\lambda^-_d \in {\bf R}}$, and obeying the pointwise upper bound

$\displaystyle \nu^-(n) \leq 1_{n \not \in\bigcup_{p|P} E_p}(n)$

for all ${n \in {\bf Z}}$. Thus for instance ${1}$ and ${0}$ are (trivially) upper bound sieves and lower bound sieves respectively.

• (i) The supremal value of the quantity (1), subject to the constraints in Problem 3, is equal to the infimal value of the quantity ${\sum_{d \in {\mathcal D}} \lambda^+_d X_d}$, as ${\nu^+ = \sum_{d \in {\mathcal D}} \lambda^+_d 1_{E_d}}$ ranges over all upper bound sieves.
• (ii) The infimal value of the quantity (1), subject to the constraints in Problem 3, is equal to the supremal value of the quantity ${\sum_{d \in {\mathcal D}} \lambda^-_d X_d}$, as ${\nu^- = \sum_{d \in {\mathcal D}} \lambda^-_d 1_{E_d}}$ ranges over all lower bound sieves.

Proof: We prove part (i) only, and leave part (ii) as an exercise. Let ${A}$ be the supremal value of the quantity (1) given the constraints in Problem 3, and let ${B}$ be the infimal value of ${\sum_{d \in {\mathcal D}} \lambda^+_d X_d}$. We need to show that ${A=B}$.

We first establish the easy inequality ${A \leq B}$. If the sequence ${a_n}$ obeys the constraints in Problem 3, and ${\nu^+ = \sum_{d \in {\mathcal D}} \lambda^+_d 1_{E_d}}$ is an upper bound sieve, then

$\displaystyle \sum_n \nu^+(n) a_n = \sum_{d \in {\mathcal D}} \lambda^+_d X_d$

and hence (by the non-negativity of ${\nu^+}$ and ${a_n}$)

$\displaystyle \sum_{n \not \in \bigcup_{p|P} E_p} a_n \leq \sum_{d \in {\mathcal D}} \lambda^+_d X_d;$

taking suprema in ${f}$ and infima in ${\nu^+}$ we conclude that ${A \leq B}$.

Now suppose for contradiction that ${A, thus ${A < C < B}$ for some real number ${C}$. We will argue using the hyperplane separation theorem; one can also proceed using one of the other duality results mentioned above. (See this previous blog post for some discussion of the connections between these various forms of linear duality.) Consider the affine functional

$\displaystyle \rho_0: (a_n)_{n \in{\bf Z}} \mapsto C - \sum_{n \not \in \bigcup_{p|P} E_p} a_n.$

on the vector space of finitely supported sequences ${(a_n)_{n \in {\bf Z}}}$ of reals. On the one hand, since ${C > A}$, this functional is positive for every sequence ${(a_n)_{n \in{\bf Z}}}$ obeying the constraints in Problem 3. Next, let ${K}$ be the space of affine functionals ${\rho}$ of the form

$\displaystyle \rho: (a_n)_{n \in {\bf Z}} \mapsto -\sum_{d \in {\mathcal D}} \lambda^+_d ( \sum_{n \in E_d} a_n - X_d ) + \sum_n a_n \nu(n) + X$

for some real numbers ${\lambda^+_d \in {\bf R}}$, some non-negative function ${\nu: {\bf Z} \rightarrow {\bf R}^+}$ which is a finite linear combination of the ${1_{E_d}}$ for ${d|P}$, and some non-negative ${X}$. This is a closed convex cone in a finite-dimensional vector space ${V}$; note also that ${\rho_0}$ lies in ${V}$. Suppose first that ${\rho_0 \in K}$, thus we have a representation of the form

$\displaystyle C - \sum_{n \not \in \bigcup_{p|P} E_p} a_n = -\sum_{d \in {\mathcal D}} \lambda^+_d ( \sum_{n \in E_d} a_n - X_d ) + \sum_n a_n \nu(n) + X$

for any finitely supported sequence ${(a_n)_{n \in {\bf Z}}}$. Comparing coefficients, we conclude that

$\displaystyle \sum_{d \in {\mathcal D}} \lambda^+_d 1_{E_d}(n) \geq 1_{n \not \in \bigcup_{p|P} E_p}$

for any ${n}$ (i.e., ${\sum_{d \in {\mathcal D}} \lambda^+_d 1_{E_d}}$ is an upper bound sieve), and also

$\displaystyle C \geq \sum_{d \in {\mathcal D}} \lambda^+_d X_d,$

and thus ${C \geq B}$, a contradiction. Thus ${\rho_0}$ lies outside of ${K}$. But then by the hyperplane separation theorem, we can find an affine functional ${\iota: V \rightarrow {\bf R}}$ on ${V}$ that is non-negative on ${K}$ and negative on ${\rho_0}$. By duality, such an affine functional takes the form ${\iota: \rho \mapsto \rho((b_n)_{n \in {\bf Z}}) + c}$ for some finitely supported sequence ${(b_n)_{n \in {\bf Z}}}$ and ${c \in {\bf R}}$ (indeed, ${(b_n)_{n \in {\bf Z}}}$ can be supported on a finite set consisting of a single representative for each atom of the finite ${\sigma}$-algebra generated by the ${E_p}$). Since ${\iota}$ is non-negative on the cone ${K}$, we see (on testing against multiples of the functionals ${(a_n)_{n \in {\bf Z}} \mapsto \sum_{n \in E_d} a_n - X_d}$ or ${(a_n)_{n \in {\bf Z}} \mapsto a_n}$) that the ${b_n}$ and ${c}$ are non-negative, and that ${\sum_{n \in E_d} b_n - X_d = 0}$ for all ${d \in {\mathcal D}}$; thus ${(b_n)_{n \in {\bf Z}}}$ is feasible for Problem 3. Since ${\iota}$ is negative on ${\rho_0}$, we see that

$\displaystyle \sum_{n \not \in \bigcup_{p|P} E_p} b_n \geq C$

and thus ${A \geq C}$, giving the desired contradiction. $\Box$

Exercise 6 Prove part (ii) of the above theorem.

Exercise 7 Show that the infima and suprema in the above theorem are actually attained (so one can replace “infimal” and “supremal” by “minimal” and “maximal” if desired).

Exercise 8 What are the optimal upper and lower bound sieves for Exercise 4?

In the case when ${{\mathcal D}}$ consists of all the divisors of ${P}$, we see that the Legendre sieve ${\sum_{d|P} \mu(d) 1_{E_d}}$ is both the optimal upper bound sieve and the optimal lower bound sieve, regardless of what the quantities ${X_d}$ are. However, in most cases of interest, ${{\mathcal D}}$ will only be some strict subset of the divisors of ${P}$, and there will be a gap between the optimal upper and lower bounds.

Observe that a sequence ${(\lambda^+_d)_{d \in {\mathcal D}}}$ of real numbers will form an upper bound sieve ${\sum_d \lambda^+_d 1_{E_d}}$ if one has the inequalities

$\displaystyle \lambda^+_1 \geq 1$

and

$\displaystyle \sum_{d|n} \lambda^+_d \geq 0$

for all ${n|P}$; we will refer to such sequences as upper bound sieve coefficients. (Conversely, if the sets ${E_p}$ are in “general position” in the sense that every set of the form ${\bigcap_{p|n} E_p \backslash \bigcup_{p|P; p\not | n} E_p}$ for ${n|P}$ is non-empty, we see that every upper bound sieve arises from a sequence of upper bound sieve coefficients.) Similarly, a sequence ${(\lambda^-_d)_{d \in {\mathcal D}}}$ of real numbers will form a lower bound sieve ${\sum_d \lambda^-_d 1_{E_d}}$ if one has the inequalities

$\displaystyle \lambda^-_1 \leq 1$

and

$\displaystyle \sum_{d|n} \lambda^-_d \leq 0$

for all ${n|P}$ with ${n>1}$; we will refer to such sequences as lower bound sieve coefficients.

Exercise 9 (Brun pure sieve) Let ${P}$ be a squarefree number, and ${k}$ a non-negative integer. Show that the sequence ${(\lambda_d)_{d | P}}$ defined by

$\displaystyle \lambda_d := 1_{\omega(d) \leq k} \mu(d),$

where (in contrast with the rest of this set of notes) ${\omega(d)}$ denotes the number of prime factors of ${d}$, is a sequence of upper bound sieve coefficients for even ${k}$, and a sequence of lower bound sieve coefficients for odd ${k}$. Deduce the Bonferroni inequalities

$\displaystyle \sum_{n \in {\bf Z}} a_n 1_{n \not \in \bigcup_{p | P} E_p} \leq \sum_{d|P: \omega(d) \leq k} \mu(d) X_d \ \ \ \ \ (11)$

when ${k}$ is even, and

$\displaystyle \sum_{n \in {\bf Z}} a_n 1_{n \not \in \bigcup_{p | P} E_p} \geq \sum_{d|P: \omega(d) \leq k} \mu(d) X_d \ \ \ \ \ (12)$

when ${k}$ is odd, whenever one is in the situation of Problem 3 (and ${{\mathcal D}}$ contains all ${d|P}$ with ${\omega(d) \leq k}$). The resulting upper and lower bound sieves are sometimes known as Brun pure sieves. The Legendre sieve can be viewed as the limiting case when ${k \geq \omega(P)}$.

In many applications the sums ${X_d}$ in (9) take the form

$\displaystyle \sum_{n \in E_d} a_n = g(d) X + r_d \ \ \ \ \ (13)$

for some quantity ${X}$ independent of ${d}$, some multiplicative function ${g}$ with ${0 \leq g(p) \leq 1}$, and some remainder term ${r_d}$ whose effect is expected to be negligible on average if ${d}$ is restricted to be small, e.g. less than a threshold ${D}$; note for instance that (5) is of this form if ${D \leq x^{1-\varepsilon}}$ for some fixed ${\varepsilon>0}$ (note from the divisor bound, Lemma 23 of Notes 1, that ${\prod_{p|d} \omega(p) \ll x^{o(1)}}$ if ${d \ll x^{O(1)}}$). We are thus led to the following idealisation of the sieving problem, in which the remainder terms ${r_d}$ are ignored:

Problem 10 (Idealised sieving) Let ${z, D \geq 1}$ (we refer to ${z}$ as the sifting level and ${D}$ as the level of distribution), let ${g}$ be a multiplicative function with ${0 \leq g(p) \leq 1}$, and let ${{\mathcal D} := \{ d|P(z): d \leq D \}}$. How small can one make the quantity

$\displaystyle \sum_{d \in {\mathcal D}} \lambda^+_d g(d) \ \ \ \ \ (14)$

for a sequence ${(\lambda^+_d)_{d \in {\mathcal D}}}$ of upper bound sieve coefficients, and how large can one make the quantity

$\displaystyle \sum_{d \in {\mathcal D}} \lambda^-_d g(d) \ \ \ \ \ (15)$

for a sequence ${(\lambda^-_d)_{d \in {\mathcal D}}}$ of lower bound sieve coefficients?

Thus, for instance, the trivial upper bound sieve ${\lambda^+_d := 1_{d=1}}$ and the trivial lower bound sieve ${\lambda^-_d := 0}$ show that (14) can equal ${1}$ and (15) can equal ${0}$. Of course, one hopes to do better than these trivial bounds in many situations; usually one can improve the upper bound quite substantially, but improving the lower bound is significantly more difficult, particularly when ${z}$ is large compared with ${D}$.

If the remainder terms ${r_d}$ in (13) are indeed negligible on average for ${d \leq D}$, then one expects the upper and lower bounds in Problem 3 to essentially be the optimal bounds in (14) and (15) respectively, multiplied by the normalisation factor ${X}$. Thus Problem 10 serves as a good model problem for Problem 3, in which all the arithmetic content of the original sieving problem has been abstracted into two parameters ${z,D}$ and a multiplicative function ${g}$. In many applications, ${g(p)}$ will be approximately ${\kappa/p}$ on the average for some fixed ${\kappa>0}$, known as the sieve dimension; for instance, in the twin prime sieving problem discussed above, the sieve dimension is ${2}$. The larger one makes the level of distribution ${D}$ compared to ${z}$, the more choices one has for the upper and lower bound sieves; it is thus of interest to obtain equidistribution estimates such as (13) for ${d}$ as large as possible. When the sequence ${a_d}$ is of arithmetic origin (for instance, if it is the von Mangoldt function ${\Lambda}$), then estimates such as the Bombieri-Vinogradov theorem, Theorem 17 from Notes 3, turn out to be particularly useful in this regard; in other contexts, the required equidistribution estimates might come from other sources, such as homogeneous dynamics, or the theory of expander graphs (the latter arises in the recent theory of the affine sieve, discussed in this previous blog post). However, the sieve-theoretic tools developed in this post are not particularly sensitive to how a certain level of distribution is attained, and are generally content to use sieve axioms such as (13) as “black boxes”.

In some applications one needs to modify Problem 10 in various technical ways (e.g. in altering the product ${P(z)}$, the set ${{\mathcal D}}$, or the definition of an upper or lower sieve coefficient sequence), but to simplify the exposition we will focus on the above problem without such alterations.

As the exercise below (or the heuristic (7)) suggests, the “natural” size of (14) and (15) is given by the quantity ${V(z) := \prod_{p < z} (1 - g(p))}$ (so that the natural size for Problem 3 is ${V(z) X}$):

Exercise 11 Let ${z,D,g}$ be as in Problem 10, and set ${V(z) := \prod_{p \leq z} (1 - g(p))}$.

• (i) Show that the quantity (14) is always at least ${V(z)}$ when ${(\lambda^+_d)_{d \in {\mathcal D}}}$ is a sequence of upper bound sieve coefficients. Similarly, show that the quantity (15) is always at most ${V(z)}$ when ${(\lambda^-_d)_{d \in {\mathcal D}}}$ is a sequence of lower bound sieve coefficients. (Hint: compute the expected value of ${\sum_{d|n} \lambda^\pm_d}$ when ${n}$ is a random factor of ${P(z)}$ chosen according to a certain probability distribution depending on ${g}$.)
• (ii) Show that (14) and (15) can both attain the value of ${V(z)}$ when ${D \geq P(z)}$. (Hint: translate the Legendre sieve to this setting.)

The problem of finding good sequences of upper and lower bound sieve coefficients in order to solve problems such as Problem 10 is one of the core objectives of sieve theory, and has been intensively studied. This is more of an optimisation problem rather than a genuinely number theoretic problem; however, the optimisation problem is sufficiently complicated that it has not been solved exactly or even asymptotically, except in a few special cases. (It can be reduced to a optimisation problem involving multilinear integrals of certain unknown functions of several variables, but this problem is rather difficult to analyse further; see these lecture notes of Selberg for further discussion.) But while we do not yet have a definitive solution to this problem in general, we do have a number of good general-purpose upper and lower bound sieve coefficients that give fairly good values for (14), (15), often coming within a constant factor of the idealised value ${V(z)}$, and which work well for sifting levels ${z}$ as large as a small power of the level of distribution ${D}$. Unfortunately, we also know of an important limitation to the sieve, known as the parity problem, that prevents one from taking ${z}$ as large as ${D^{1/2}}$ while still obtaining non-trivial lower bounds; as a consequence, sieve theory is not able, on its own, to sift out primes for such purposes as establishing the twin prime conjecture. However, it is still possible to use these sieves, in conjunction with additional tools, to produce various types of primes or prime patterns in some cases; examples of this include the theorem of Ben Green and myself in which an upper bound sieve is used to demonstrate the existence of primes in arbitrarily long arithmetic progressions, or the more recent theorem of Zhang in which an upper bound sieve (among other things) was used to demonstrate the existence of infinitely many pairs of primes whose difference was bounded. In such arguments, the upper bound sieve was used not so much to count the primes or prime patterns directly, but to serve instead as a sort of “container” to efficiently envelop such prime patterns; when used in such a manner, the upper bound sieves are sometimes known as enveloping sieves. If the original sequence was supported on primes, then the enveloping sieve can be viewed as a “smoothed out indicator function” that is concentrated on almost primes, which in this context refers to numbers with no small prime factors.

In a somewhat different direction, it can be possible in some cases to break the parity barrier by assuming additional equidistribution axioms on the sequence ${a_n}$ than just (13), in particular controlling certain bilinear sums involving ${a_{nm}}$ rather than just linear sums of the ${a_n}$. This approach was in particular pursued by Friedlander and Iwaniec, leading to their theorem that there are infinitely many primes of the form ${n^2+m^4}$.

The study of sieves is an immense topic; see for instance the recent 527-page text by Friedlander and Iwaniec. We will limit attention to two sieves which give good general-purpose results, if not necessarily the most optimal ones:

• (i) The beta sieve (or Rosser-Iwaniec sieve), which is a modification of the classical combinatorial sieve of Brun. (A collection of sieve coefficients ${\lambda_d^{\pm}}$ is called combinatorial if its coefficients lie in ${\{-1,0,+1\}}$.) The beta sieve is a family of upper and lower bound combinatorial sieves, and are particularly useful for efficiently sieving out all primes up to a parameter ${z = x^{1/u}}$ from a set of integers of size ${x}$, in the regime where ${u}$ is moderately large, leading to what is sometimes known as the fundamental lemma of sieve theory.
• (ii) The Selberg upper bound sieve, which is a general-purpose sieve that can serve both as an upper bound sieve for classical sieving problems, as well as an enveloping sieve for sets such as the primes. (One can also convert the Selberg upper bound sieve into a lower bound sieve in a number of ways, but we will only touch upon this briefly.) A key advantage of the Selberg sieve is that, due to the “quadratic” nature of the sieve, the difficult optimisation problem in Problem 10 is replaced with a much more tractable quadratic optimisation problem, which can often be solved for exactly.

Remark 12 It is possible to compose two sieves together, for instance by using the observation that the product of two upper bound sieves is again an upper bound sieve, or that the product of an upper bound sieve and a lower bound sieve is a lower bound sieve. Such a composition of sieves is useful in some applications, for instance if one wants to apply the fundamental lemma as a “preliminary sieve” to sieve out small primes, but then use a more precise sieve like the Selberg sieve to sieve out medium primes. We will see an example of this in later notes, when we discuss the linear beta-sieve.

We will also briefly present the (arithmetic) large sieve, which gives a rather different approach to Problem 3 in the case that each ${E_p}$ consists of some number (typically a large number) of residue classes modulo ${p}$, and is powered by the (analytic) large sieve inequality of the preceding section. As an application of these methods, we will utilise the Selberg upper bound sieve as an enveloping sieve to establish Zhang’s theorem on bounded gaps between primes. Finally, we give an informal discussion of the parity barrier which gives some heuristic limitations on what sieve theory is able to accomplish with regards to counting prime patters such as twin primes.

These notes are only an introduction to the vast topic of sieve theory; more detailed discussion can be found in the Friedlander-Iwaniec text, in these lecture notes of Selberg, and in many further texts.

This post is a continuation of the previous post on sieve theory, which is an ongoing part of the Polymath8 project. As the previous post was getting somewhat full, we are rolling the thread over to the current post.

In this post we will record a new truncation of the elementary Selberg sieve discussed in this previous post (and also analysed in the context of bounded prime gaps by Graham-Goldston-Pintz-Yildirim and Motohashi-Pintz) that was recently worked out by Janos Pintz, who has kindly given permission to share this new idea with the Polymath8 project. This new sieve decouples the ${\delta}$ parameter that was present in our previous analysis of Zhang’s argument into two parameters, a quantity ${\delta}$ that used to measure smoothness in the modulus, but now measures a weaker notion of “dense divisibility” which is what is really needed in the Elliott-Halberstam type estimates, and a second quantity ${\delta'}$ which still measures smoothness but is allowed to be substantially larger than ${\delta}$. Through this decoupling, it appears that the ${\kappa}$ type losses in the sieve theoretic part of the argument can be almost completely eliminated (they basically decay exponential in ${\delta'}$ and have only mild dependence on ${\delta}$, whereas the Elliott-Halberstam analysis is sensitive only to ${\delta}$, allowing one to set ${\delta}$ far smaller than previously by keeping ${\delta'}$ large). This should lead to noticeable gains in the ${k_0}$ quantity in our analysis.

To describe this new truncation we need to review some notation. As in all previous posts (in particular, the first post in this series), we have an asymptotic parameter ${x}$ going off to infinity, and all quantities here are implicitly understood to be allowed to depend on ${x}$ (or to range in a set that depends on ${x}$) unless they are explicitly declared to be fixed. We use the usual asymptotic notation ${O(), o(), \ll}$ relative to this parameter ${x}$. To be able to ignore local factors (such as the singular series ${{\mathfrak G}}$), we also use the “${W}$-trick” (as discussed in the first post in this series): we introduce a parameter ${w}$ that grows very slowly with ${x}$, and set ${W := \prod_{p.

For any fixed natural number ${k_0}$, define an admissible ${k_0}$-tuple to be a fixed tuple ${{\mathcal H}}$ of ${k_0}$ distinct integers which avoids at least one residue class modulo ${p}$ for each prime ${p}$. Our objective is to obtain the following conjecture ${DHL[k_0,2]}$ for as small a value of the parameter ${k_0}$ as possible:

Conjecture 1 (${DHL[k_0,2]}$) Let ${{\mathcal H}}$ be a fixed admissible ${k_0}$-tuple. Then there exist infinitely many translates ${n+{\mathcal H}}$ of ${{\mathcal H}}$ that contain at least two primes.

The twin prime conjecture asserts that ${DHL[k_0,2]}$ holds for ${k_0}$ as small as ${2}$, but currently we are only able to establish this result for ${k_0 \geq 6329}$ (see this comment). However, with the new truncated sieve of Pintz described in this post, we expect to be able to lower this threshold ${k_0 \geq 6329}$ somewhat.

In previous posts, we deduced ${DHL[k_0,2]}$ from a technical variant ${MPZ[\varpi,\delta]}$ of the Elliot-Halberstam conjecture for certain choices of parameters ${0 < \varpi < 1/4}$, ${0 < \delta < 1/4+\varpi}$. We will use the following formulation of ${MPZ[\varpi,\delta]}$:

Conjecture 2 (${MPZ[\varpi,\delta]}$) Let ${{\mathcal H}}$ be a fixed ${k_0}$-tuple (not necessarily admissible) for some fixed ${k_0 \geq 2}$, and let ${b\ (W)}$ be a primitive residue class. Then

$\displaystyle \sum_{q \in {\mathcal S}_I: q< x^{1/2+2\varpi}} \sum_{a \in C(q)} |\Delta_{b,W}(\Lambda; q,a)| = O( x \log^{-A} x) \ \ \ \ \ (1)$

for any fixed ${A>0}$, where ${I = (w,x^{\delta})}$, ${{\mathcal S}_I}$ are the square-free integers whose prime factors lie in ${I}$, and ${\Delta_{b,W}(\Lambda;q,a)}$ is the quantity

$\displaystyle \Delta_{b,W}(\Lambda;q,a) := | \sum_{x \leq n \leq 2x: n=b\ (W); n = a\ (q)} \Lambda(n) \ \ \ \ \ (2)$

$\displaystyle - \frac{1}{\phi(q)} \sum_{x \leq n \leq 2x: n = b\ (W)} \Lambda(n)|.$

and ${C(q)}$ is the set of congruence classes

$\displaystyle C(q) := \{ a \in ({\bf Z}/q{\bf Z})^\times: P(a) = 0 \}$

and ${P}$ is the polynomial

$\displaystyle P(a) := \prod_{h \in {\mathcal H}} (a+h).$

The conjecture ${MPZ[\varpi,\delta]}$ is currently known to hold whenever ${87 \varpi + 17 \delta < \frac{1}{4}}$ (see this comment and this confirmation). Actually, we can prove a stronger result than ${MPZ[\varpi,\delta]}$ in this regime in a couple ways. Firstly, the congruence classes ${C(q)}$ can be replaced by a more general system of congruence classes obeying a certain controlled multiplicity axiom; see this post. Secondly, and more importantly for this post, the requirement that the modulus ${q}$ lies in ${{\mathcal S}_I}$ can be relaxed; see below.

To connect the two conjectures, the previously best known implication was the folowing (see Theorem 2 from this post):

Theorem 3 Let ${0 < \varpi < 1/4}$, ${0 < \delta < 1/4 + \varpi}$ and ${k_0 \geq 2}$ be such that we have the inequality

$\displaystyle (1 +4 \varpi) (1-\kappa') > \frac{j^2_{k_0-2}}{k_0(k_0-1)} (1+\kappa) \ \ \ \ \ (3)$

where ${j_{k_0-2} = j_{k_0-2,1}}$ is the first positive zero of the Bessel function ${J_{k_0-2}}$, and ${\kappa,\kappa'>0}$ are the quantities

$\displaystyle \kappa := \sum_{1 \leq n < \frac{1+4\varpi}{4\delta}} \frac{3^n+1}{2} \frac{k_0^n}{n!} (\int_{4\delta/(1+4\varpi)}^1 (1-t)^{k_0/2}\ \frac{dt}{t})^n$

and

$\displaystyle \kappa' := \sum_{2 \leq n < \frac{1+4\varpi}{4\delta}} \frac{3^n-1}{2} \frac{(k_0-1)^n}{n!}$

$\displaystyle (\int_{4\delta/(1+4\varpi)}^1 (1-t)^{(k_0-1)/2}\ \frac{dt}{t})^n.$

Then ${MPZ[\varpi,\delta]}$ implies ${DHL[k_0,2]}$.

Actually there have been some slight improvements to the quantities ${\kappa,\kappa'}$; see the comments to this previous post. However, the main error ${\kappa}$ remains roughly of the order ${\delta^{-1} \exp( - 2 k_0\delta )}$, which limits one from taking ${\delta}$ too small.

To improve beyond this, the first basic observation is that the smoothness condition ${q \in {\mathcal S}_I}$, which implies that all prime divisors of ${q}$ are less than ${x^\delta}$, can be relaxed in the proof of ${MPZ[\varpi,\delta]}$. Indeed, if one inspects the proof of this proposition (described in these three previous posts), one sees that the key property of ${q}$ needed is not so much the smoothness, but a weaker condition which we will call (for lack of a better term) dense divisibility:

Definition 4 Let ${y > 1}$. A positive integer ${q}$ is said to be ${y}$-densely divisible if for every ${1 \leq R \leq q}$, one can find a factor of ${q}$ in the interval ${[y^{-1} R, R]}$. We let ${{\mathcal D}_y}$ denote the set of positive integers that are ${y}$-densely divisible.

Certainly every integer which is ${y}$-smooth (i.e. has all prime factors at most ${y}$ is also ${y}$-densely divisible, as can be seen from the greedy algorithm; but the property of being ${y}$-densely divisible is strictly weaker than ${y}$-smoothness, which is a fact we shall exploit shortly.

We now define ${MPZ'[\varpi,\delta]}$ to be the same statement as ${MPZ[\varpi,\delta]}$, but with the condition ${q \in {\mathcal S}_I}$ replaced by the weaker condition ${q \in {\mathcal S}_{[w,+\infty)} \cap {\mathcal D}_{x^\delta}}$. The arguments in previous posts then also establish ${MPZ'[\varpi,\delta]}$ whenever ${87 \varpi + 17 \delta < \frac{1}{4}}$.

The main result of this post is then the following implication, essentially due to Pintz:

Theorem 5 Let ${0 < \varpi < 1/4}$, ${0 < \delta \leq \delta' < 1/4 + \varpi}$, ${A \geq 0}$, and ${k_0 \geq 2}$ be such that

$\displaystyle (1 +4 \varpi) (1-2\kappa_1 - 2\kappa_2 - 2\kappa_3) > \frac{j^2_{k_0-2}}{k_0(k_0-1)}$

where

$\displaystyle \kappa_1 := \int_{\theta}^1 (1-t)^{(k_0-1)/2}\ \frac{dt}{t}$

$\displaystyle \kappa_2 := (k_0-1) \int_{\theta}^1 (1-t)^{k_0-1}\ \frac{dt}{t}$

$\displaystyle \kappa_3 := e^A \frac{G_{k_0-1,\tilde \theta}(0,0)}{G_{k_0-1}(0,0)} \sum_{0 \leq J \leq 1/\tilde \delta} \frac{(k_0-1)^J}{J!} (\int_{\tilde \delta}^\theta e^{-At} \frac{dt}{t})^J$

and

$\displaystyle \theta := \frac{\delta'}{1/4+\varpi}$

$\displaystyle \tilde \theta := \frac{(\delta' - \delta)/2 + \varpi}{1/4 + \varpi}$

$\displaystyle \tilde \delta := \frac{\delta}{1/4+\varpi}$

$\displaystyle G_{k_0-1}(0,0) := \int_0^1 f(t)^2 \frac{t^{k_0-2}}{(k_0-2)!}\ dt$

$\displaystyle G_{k_0-1,\tilde \theta}(0,0) := \int_0^{\tilde \theta} f(t)^2 \frac{t^{k_0-2}}{(k_0-2)!}\ dt$

and

$\displaystyle f(t) := t^{1-k_0/2} J_{k_0-2}( \sqrt{t} j_{k_0-2} ).$

Then ${MPZ'[\varpi,\delta]}$ implies ${DHL[k_0,2]}$.

This theorem has rather messy constants, but we can isolate some special cases which are a bit easier to compute with. Setting ${\delta' = \delta}$, we see that ${\kappa_3}$ vanishes (and the argument below will show that we only need ${MPZ[\varpi,\delta]}$ rather than ${MPZ'[\varpi,\delta]}$), and we obtain the following slight improvement of Theorem 3:

Theorem 6 Let ${0 < \varpi < 1/4}$, ${0 < \delta < 1/4 + \varpi}$ and ${k_0 \geq 2}$ be such that we have the inequality

$\displaystyle (1 +4 \varpi) (1-2\kappa_1-2\kappa_2) > \frac{j^2_{k_0-2}}{k_0(k_0-1)} \ \ \ \ \ (4)$

where

$\displaystyle \kappa_1 := \int_{4\delta/(1+4\varpi)}^1 (1-t)^{(k_0-1)/2}\ \frac{dt}{t}$

$\displaystyle \kappa_2 := (k_0-1) \int_{4\delta/(1+4\varpi)}^1 (1-t)^{k_0-1}\ \frac{dt}{t}.$

Then ${MPZ[\varpi,\delta]}$ implies ${DHL[k_0,2]}$.

This is a little better than Theorem 3, because the error ${2\kappa_1+2\kappa_2}$ has size about ${\frac{1}{2 k_0 \delta} \exp( - 2 k_0 \delta) + \frac{1}{2 \delta} \exp(-4 k_0 \delta)}$, which compares favorably with the error in Theorem 3 which is about ${\frac{1}{\delta} \exp(-2 k_0 \delta)}$. This should already give a “cheap” improvement to our current threshold ${k_0 \geq 6329}$, though it will fall short of what one would get if one fully optimised over all parameters in the above theorem.

Returning to the full strength of Theorem 5, let us obtain a crude upper bound for ${\kappa_3}$ that is a little simpler to understand. Extending the ${J}$ summation to infinity and using the Taylor series for the exponential, we have

$\displaystyle \kappa_3 \leq \frac{G_{k_0-1,\tilde \theta}(0,0)}{G_{k_0-1}(0,0)} \exp( A + (k_0-1) \int_{\tilde \delta}^\theta e^{-At} \frac{dt}{t} ).$

We can crudely bound

$\displaystyle \int_{\tilde \delta}^\theta e^{-At} \frac{dt}{t} \leq \frac{1}{A \tilde \delta}$

and then optimise in ${A}$ to obtain

$\displaystyle \kappa_3 \leq \frac{G_{k_0-1,\tilde \theta}(0,0)}{G_{k_0-1}(0,0)} \exp( 2 (k_0-1)^{1/2} \tilde \delta^{-1/2} ).$

Because of the ${t^{k_0-2}}$ factor in the integrand for ${G_{k_0-1}}$ and ${G_{k_0-1,\tilde \theta}}$, we expect the ratio ${\frac{G_{k_0-1,\tilde \theta}(0,0)}{G_{k_0-1}(0,0)}}$ to be of the order of ${\tilde \theta^{k_0-1}}$, although one will need some theoretical or numerical estimates on Bessel functions to make this heuristic more precise. Setting ${\tilde \theta}$ to be something like ${1/2}$, we get a good bound here as long as ${\tilde \delta \gg 1/k_0}$, which at current values of ${\delta, k_0}$ is a mild condition.

Pintz’s argument uses the elementary Selberg sieve, discussed in this previous post, but with a more efficient estimation of the quantity ${\beta}$, in particular avoiding the truncation to moduli ${d}$ between ${x^{-\delta} R}$ and ${R}$ which was the main source of inefficiency in that previous post. The basic idea is to “linearise” the effect of the truncation of the sieve, so that this contribution can be dealt with by the union bound (basically, bounding the contribution of each large prime one at a time). This mostly avoids the more complicated combinatorial analysis that arose in the analytic Selberg sieve, as seen in this previous post.

This post is a continuation of the previous post on sieve theory, which is an ongoing part of the Polymath8 project to improve the various parameters in Zhang’s proof that bounded gaps between primes occur infinitely often. Given that the comments on that page are getting quite lengthy, this is also a good opportunity to “roll over” that thread.

We will continue the notation from the previous post, including the concept of an admissible tuple, the use of an asymptotic parameter ${x}$ going to infinity, and a quantity ${w}$ depending on ${x}$ that goes to infinity sufficiently slowly with ${x}$, and ${W := \prod_{p (the ${W}$-trick).

The objective of this portion of the Polymath8 project is to make as efficient as possible the connection between two types of results, which we call ${DHL[k_0,2]}$ and ${MPZ[\varpi,\delta]}$. Let us first state ${DHL[k_0,2]}$, which has an integer parameter ${k_0 \geq 2}$:

Conjecture 1 (${DHL[k_0,2]}$) Let ${{\mathcal H}}$ be a fixed admissible ${k_0}$-tuple. Then there are infinitely many translates ${n+{\mathcal H}}$ of ${{\mathcal H}}$ which contain at least two primes.

Zhang was the first to prove a result of this type with ${k_0 = 3,500,000}$. Since then the value of ${k_0}$ has been lowered substantially; at this time of writing, the current record is ${k_0 = 26,024}$.

There are two basic ways known currently to attain this conjecture. The first is to use the Elliott-Halberstam conjecture ${EH[\theta]}$ for some ${\theta>1/2}$:

Conjecture 2 (${EH[\theta]}$) One has

$\displaystyle \sum_{1 \leq q \leq x^\theta} \sup_{a \in ({\bf Z}/q{\bf Z})^\times} |\sum_{n < x: n = a\ (q)} \Lambda(n) - \frac{1}{\phi(q)} \sum_{n < x} \Lambda(n)|$

$\displaystyle = O( \frac{x}{\log^A x} )$

for all fixed ${A>0}$. Here we use the abbreviation ${n=a\ (q)}$ for ${n=a \hbox{ mod } q}$.

Here of course ${\Lambda}$ is the von Mangoldt function and ${\phi}$ the Euler totient function. It is conjectured that ${EH[\theta]}$ holds for all ${0 < \theta < 1}$, but this is currently only known for ${0 < \theta < 1/2}$, an important result known as the Bombieri-Vinogradov theorem.

In a breakthrough paper, Goldston, Yildirim, and Pintz established an implication of the form

$\displaystyle EH[\theta] \implies DHL[k_0,2] \ \ \ \ \ (1)$

for any ${1/2 < \theta < 1}$, where ${k_0 = k_0(\theta)}$ depends on ${\theta}$. This deduction was very recently optimised by Farkas, Pintz, and Revesz and also independently in the comments to the previous blog post, leading to the following implication:

Theorem 3 (EH implies DHL) Let ${1/2 < \theta < 1}$ be a real number, and let ${k_0 \geq 2}$ be an integer obeying the inequality

$\displaystyle 2\theta > \frac{j_{k_0-2}^2}{k_0(k_0-1)}, \ \ \ \ \ (2)$

where ${j_n}$ is the first positive zero of the Bessel function ${J_n(x)}$. Then ${EH[\theta]}$ implies ${DHL[k_0,2]}$.

Note that the right-hand side of (2) is larger than ${1}$, but tends asymptotically to ${1}$ as ${k_0 \rightarrow \infty}$. We give an alternate proof of Theorem 3 below the fold.

Implications of the form Theorem 3 were modified by Motohashi and Pintz, which in our notation replaces ${EH[\theta]}$ by an easier conjecture ${MPZ[\varpi,\delta]}$ for some ${0 < \varpi < 1/4}$ and ${0 < \delta < 1/4+\varpi}$, at the cost of degrading the sufficient condition (2) slightly. In our notation, this conjecture takes the following form for each choice of parameters ${\varpi,\delta}$:

Conjecture 4 (${MPZ[\varpi,\delta]}$) Let ${{\mathcal H}}$ be a fixed ${k_0}$-tuple (not necessarily admissible) for some fixed ${k_0 \geq 2}$, and let ${b\ (W)}$ be a primitive residue class. Then

$\displaystyle \sum_{q \in {\mathcal S}_I: q< x^{1/2+2\varpi}} \sum_{a \in C(q)} |\Delta_{b,W}(\Lambda; q,a)| = O( x \log^{-A} x) \ \ \ \ \ (3)$

for any fixed ${A>0}$, where ${I = (w,x^{\delta})}$, ${{\mathcal S}_I}$ are the square-free integers whose prime factors lie in ${I}$, and ${\Delta_{b,W}(\Lambda;q,a)}$ is the quantity

$\displaystyle \Delta_{b,W}(\Lambda;q,a) := | \sum_{x \leq n \leq 2x: n=b\ (W); n = a\ (q)} \Lambda(n) \ \ \ \ \ (4)$

$\displaystyle - \frac{1}{\phi(q)} \sum_{x \leq n \leq 2x: n = b\ (W)} \Lambda(n)|.$

and ${C(q)}$ is the set of congruence classes

$\displaystyle C(q) := \{ a \in ({\bf Z}/q{\bf Z})^\times: P(a) = 0 \}$

and ${P}$ is the polynomial

$\displaystyle P(a) := \prod_{h \in {\mathcal H}} (a+h).$

This is a weakened version of the Elliott-Halberstam conjecture:

Proposition 5 (EH implies MPZ) Let ${0 < \varpi < 1/4}$ and ${0 < \delta < 1/4+\varpi}$. Then ${EH[1/2+2\varpi+\epsilon]}$ implies ${MPZ[\varpi,\delta]}$ for any ${\epsilon>0}$. (In abbreviated form: ${EH[1/2+2\varpi+]}$ implies ${MPZ[\varpi,\delta]}$.)

In particular, since ${EH[\theta]}$ is conjecturally true for all ${0 < \theta < 1/2}$, we conjecture ${MPZ[\varpi,\delta]}$ to be true for all ${0 < \varpi < 1/4}$ and ${0<\delta<1/4+\varpi}$.

Proof: Define

$\displaystyle E(q) := \sup_{a \in ({\bf Z}/q{\bf Z})^\times} |\sum_{x \leq n \leq 2x: n = a\ (q)} \Lambda(n) - \frac{1}{\phi(q)} \sum_{x \leq n \leq 2x} \Lambda(n)|$

then the hypothesis ${EH[1/2+2\varpi+\epsilon]}$ (applied to ${x}$ and ${2x}$ and then subtracting) tells us that

$\displaystyle \sum_{1 \leq q \leq Wx^{1/2+2\varpi}} E(q) \ll x \log^{-A} x$

for any fixed ${A>0}$. From the Chinese remainder theorem and the Siegel-Walfisz theorem we have

$\displaystyle \sup_{a \in ({\bf Z}/q{\bf Z})^\times} \Delta_{b,W}(\Lambda;q,a) \ll E(qW) + \frac{1}{\phi(q)} x \log^{-A} x$

for any ${q}$ coprime to ${W}$ (and in particular for ${q \in {\mathcal S}_I}$). Since ${|C(q)| \leq k_0^{\Omega(q)}}$, where ${\Omega(q)}$ is the number of prime divisors of ${q}$, we can thus bound the left-hand side of (3) by

$\displaystyle \ll \sum_{q \in {\mathcal S}_I: q< x^{1/2+2\varpi}} k_0^{\Omega(q)} E(qW) + k_0^{\Omega(q)} \frac{1}{\phi(q)} x \log^{-A} x.$

The contribution of the second term is ${O(x \log^{-A+O(1)} x)}$ by standard estimates (see Proposition 8 below). Using the very crude bound

$\displaystyle E(q) \ll \frac{1}{\phi(q)} x \log x$

and standard estimates we also have

$\displaystyle \sum_{q \in {\mathcal S}_I: q< x^{1/2+2\varpi}} k_0^{2\Omega(q)} E(qW) \ll x \log^{O(1)} A$

and the claim now follows from the Cauchy-Schwarz inequality. $\Box$

In practice, the conjecture ${MPZ[\varpi,\delta]}$ is easier to prove than ${EH[1/2+2\varpi+]}$ due to the restriction of the residue classes ${a}$ to ${C(q)}$, and also the restriction of the modulus ${q}$ to ${x^\delta}$-smooth numbers. Zhang proved ${MPZ[\varpi,\varpi]}$ for any ${0 < \varpi < 1/1168}$. More recently, our Polymath8 group has analysed Zhang’s argument (using in part a corrected version of the analysis of a recent preprint of Pintz) to obtain ${MPZ[\varpi,\delta]}$ whenever ${\delta, \varpi > 0}$ are such that

$\displaystyle 207\varpi + 43\delta < \frac{1}{4}.$

The work of Motohashi and Pintz, and later Zhang, implicitly describe arguments that allow one to deduce ${DHL[k_0,2]}$ from ${MPZ[\varpi,\delta]}$ provided that ${k_0}$ is sufficiently large depending on ${\varpi,\delta}$. The best implication of this sort that we have been able to verify thus far is the following result, established in the previous post:

Theorem 6 (MPZ implies DHL) Let ${0 < \varpi < 1/4}$, ${0 < \delta < 1/4+\varpi}$, and let ${k_0 \geq 2}$ be an integer obeying the constraint

$\displaystyle 1+4\varpi > \frac{j_{k_0-2}^2}{k_0(k_0-1)} (1+\kappa) \ \ \ \ \ (5)$

where ${\kappa}$ is the quantity

$\displaystyle \kappa := \sum_{1 \leq n < \frac{1+4\varpi}{2\delta}} (1 - \frac{2n \delta}{1 + 4\varpi})^{k_0/2} \prod_{j=1}^{n} (1 + 3k_0 \log(1+\frac{1}{j})) ).$

Then ${MPZ[\varpi,\delta]}$ implies ${DHL[k_0,2]}$.

This complicated version of ${\kappa}$ is roughly of size ${3 \log(2) k_0 \exp( - k_0 \delta)}$. It is unlikely to be optimal; the work of Motohashi-Pintz and Pintz suggests that it can essentially be improved to ${\frac{1}{\delta} \exp(-k_0 \delta)}$, but currently we are unable to verify this claim. One of the aims of this post is to encourage further discussion as to how to improve the ${\kappa}$ term in results such as Theorem 6.

We remark that as (5) is an open condition, it is unaffected by infinitesimal modifications to ${\varpi,\delta}$, and so we do not ascribe much importance to such modifications (e.g. replacing ${\varpi}$ by ${\varpi-\epsilon}$ for some arbitrarily small ${\epsilon>0}$).

The known deductions of ${DHL[k_0,2]}$ from claims such as ${EH[\theta]}$ or ${MPZ[\varpi,\delta]}$ rely on the following elementary observation of Goldston, Pintz, and Yildirim (essentially a weighted pigeonhole principle), which we have placed in “${W}$-tricked form”:

Lemma 7 (Criterion for DHL) Let ${k_0 \geq 2}$. Suppose that for each fixed admissible ${k_0}$-tuple ${{\mathcal H}}$ and each congruence class ${b\ (W)}$ such that ${b+h}$ is coprime to ${W}$ for all ${h \in {\mathcal H}}$, one can find a non-negative weight function ${\nu: {\bf N} \rightarrow {\bf R}^+}$, fixed quantities ${\alpha,\beta > 0}$, a quantity ${A>0}$, and a fixed positive power ${R}$ of ${x}$ such that one has the upper bound

$\displaystyle \sum_{x \leq n \leq 2x: n = b\ (W)} \nu(n) \leq (\alpha+o(1)) A\frac{x}{W}, \ \ \ \ \ (6)$

the lower bound

$\displaystyle \sum_{x \leq n \leq 2x: n = b\ (W)} \nu(n) \theta(n+h_i) \geq (\beta-o(1)) A\frac{x}{W} \log R \ \ \ \ \ (7)$

for all ${h_i \in {\mathcal H}}$, and the key inequality

$\displaystyle \frac{\log R}{\log x} > \frac{1}{k_0} \frac{\alpha}{\beta} \ \ \ \ \ (8)$

holds. Then ${DHL[k_0,2]}$ holds. Here ${\theta(n)}$ is defined to equal ${\log n}$ when ${n}$ is prime and ${0}$ otherwise.

Proof: Consider the quantity

$\displaystyle \sum_{x \leq n \leq 2x: n = b\ (W)} \nu(n) (\sum_{h \in {\mathcal H}} \theta(n+h) - \log(3x)). \ \ \ \ \ (9)$

By (6), (7), this quantity is at least

$\displaystyle k_0 \beta A\frac{x}{W} \log R - \alpha \log(3x) A\frac{x}{W} - o(A\frac{x}{W} \log x).$

By (8), this expression is positive for all sufficiently large ${x}$. On the other hand, (9) can only be positive if at least one summand is positive, which only can happen when ${n+{\mathcal H}}$ contains at least two primes for some ${x \leq n \leq 2x}$ with ${n=b\ (W)}$. Letting ${x \rightarrow \infty}$ we obtain ${DHL[k_0,2]}$ as claimed. $\Box$

In practice, the quantity ${R}$ (referred to as the sieve level) is a power of ${x}$ such as ${x^{\theta/2}}$ or ${x^{1/4+\varpi}}$, and reflects the strength of the distribution hypothesis ${EH[\theta]}$ or ${MPZ[\varpi,\delta]}$ that is available; the quantity ${R}$ will also be a key parameter in the definition of the sieve weight ${\nu}$. The factor ${A}$ reflects the order of magnitude of the expected density of ${\nu}$ in the residue class ${b\ (W)}$; it could be absorbed into the sieve weight ${\nu}$ by dividing that weight by ${A}$, but it is convenient to not enforce such a normalisation so as not to clutter up the formulae. In practice, ${A}$ will some combination of ${\frac{\phi(W)}{W}}$ and ${\log R}$.

Once one has decided to rely on Lemma 7, the next main task is to select a good weight ${\nu}$ for which the ratio ${\alpha/\beta}$ is as small as possible (and for which the sieve level ${R}$ is as large as possible. To ensure non-negativity, we use the Selberg sieve

$\displaystyle \nu = \lambda^2, \ \ \ \ \ (10)$

where ${\lambda(n)}$ takes the form

$\displaystyle \lambda(n) = \sum_{d \in {\mathcal S}_I: d|P(n)} \mu(d) a_d$

for some weights ${a_d \in {\bf R}}$ vanishing for ${d>R}$ that are to be chosen, where ${I \subset (w,+\infty)}$ is an interval and ${P}$ is the polynomial ${P(n) := \prod_{h \in {\mathcal H}} (n+h)}$. If the distribution hypothesis is ${EH[\theta]}$, one takes ${R := x^{\theta/2}}$ and ${I := (w,+\infty)}$; if the distribution hypothesis is instead ${MPZ[\varpi,\delta]}$, one takes ${R := x^{1/4+\varpi}}$ and ${I := (w,x^\delta)}$.

One has a useful amount of flexibility in selecting the weights ${a_d}$ for the Selberg sieve. The original work of Goldston, Pintz, and Yildirim, as well as the subsequent paper of Zhang, the choice

$\displaystyle a_d := \log(\frac{R}{d})_+^{k_0+\ell_0}$

is used for some additional parameter ${\ell_0 > 0}$ to be optimised over. More generally, one can take

$\displaystyle a_d := g( \frac{\log d}{\log R} )$

for some suitable (in particular, sufficiently smooth) cutoff function ${g: {\bf R} \rightarrow {\bf R}}$. We will refer to this choice of sieve weights as the “analytic Selberg sieve”; this is the choice used in the analysis in the previous post.

However, there is a slight variant choice of sieve weights that one can use, which I will call the “elementary Selberg sieve”, and it takes the form

$\displaystyle a_d := \frac{1}{\Phi(d) \Delta(d)} \sum_{q \in {\mathcal S}_I: (q,d)=1} \frac{1}{\Phi(q)} f'( \frac{\log dq}{\log R}) \ \ \ \ \ (11)$

for a sufficiently smooth function ${f: {\bf R} \rightarrow {\bf R}}$, where

$\displaystyle \Phi(d) := \prod_{p|d} \frac{p-k_0}{k_0}$

for ${d \in {\mathcal S}_I}$ is a ${k_0}$-variant of the Euler totient function, and

$\displaystyle \Delta(d) := \prod_{p|d} \frac{k_0}{p} = \frac{k_0^{\Omega(d)}}{d}$

for ${d \in {\mathcal S}_I}$ is a ${k_0}$-variant of the function ${1/d}$. (The derivative on the ${f}$ cutoff is convenient for computations, as will be made clearer later in this post.) This choice of weights ${a_d}$ may seem somewhat arbitrary, but it arises naturally when considering how to optimise the quadratic form

$\displaystyle \sum_{d_1,d_2 \in {\mathcal S}_I} \mu(d_1) a_{d_1} \mu(d_2) a_{d_2} \Delta([d_1,d_2])$

(which arises naturally in the estimation of ${\alpha}$ in (6)) subject to a fixed value of ${a_1}$ (which morally is associated to the estimation of ${\beta}$ in (7)); this is discussed in any sieve theory text as part of the general theory of the Selberg sieve, e.g. Friedlander-Iwaniec.

The use of the elementary Selberg sieve for the bounded prime gaps problem was studied by Motohashi and Pintz. Their arguments give an alternate derivation of ${DHL[k_0,2]}$ from ${MPZ[\varpi,\theta]}$ for ${k_0}$ sufficiently large, although unfortunately we were not able to confirm some of their calculations regarding the precise dependence of ${k_0}$ on ${\varpi,\theta}$, and in particular we have not yet been able to improve upon the specific criterion in Theorem 6 using the elementary sieve. However it is quite plausible that such improvements could become available with additional arguments.

Below the fold we describe how the elementary Selberg sieve can be used to reprove Theorem 3, and discuss how they could potentially be used to improve upon Theorem 6. (But the elementary Selberg sieve and the analytic Selberg sieve are in any event closely related; see the appendix of this paper of mine with Ben Green for some further discussion.) For the purposes of polymath8, either developing the elementary Selberg sieve or continuing the analysis of the analytic Selberg sieve from the previous post would be a relevant topic of conversation in the comments to this post.

In this, the final lecture notes of this course, we discuss one of the motivating applications of the theory developed thus far, namely to count solutions to linear equations in primes ${{\mathcal P} = \{2,3,5,7,\ldots\}}$ (or in dense subsets ${A}$ of primes ${{\mathcal P}}$). Unfortunately, the most famous linear equations in primes: the twin prime equation ${p_2 - p_1 = 2}$ and the even Goldbach equation ${p_1+p_2=N}$ – remain out of reach of this technology (because the relevant affine linear forms involved are commensurate, and thus have infinite complexity with respect to the Gowers norms), but most other systems of equations, in particular that of arithmetic progressions ${p_i = n+ir}$ for ${i=0,\ldots,k-1}$ (or equivalently, ${p_i + p_{i+2} = 2p_{i+1}}$ for ${i=0,\ldots,k-2}$) , as well as the odd Goldbach equation ${p_1+p_2+p_3=N}$, are tractable.

To illustrate the main ideas, we will focus on the following result of Green:

Theorem 1 (Roth’s theorem in the primes) Let ${A \subset {\mathcal P}}$ be a subset of primes whose upper density ${\limsup_{N \rightarrow \infty} |A \cap [N]|/|{\mathcal P} \cap [N]|}$ is positive. Then ${A}$ contains infinitely many arithmetic progressions of length three.

This should be compared with Roth’s theorem in the integers (Notes 2), which is the same statement but with the primes ${{\mathcal P}}$ replaced by the integers ${{\bf Z}}$ (or natural numbers ${{\bf N}}$). Indeed, Roth’s theorem for the primes is proven by transferring Roth’s theorem for the integers to the prime setting; the latter theorem is used as a “black box”. The key difficulty here in performing this transference is that the primes have zero density inside the integers; indeed, from the prime number theorem we have ${|{\mathcal P} \cap [N]| = (1+o(1)) \frac{N}{\log N} = o(N)}$.

There are a number of generalisations of this transference technique. In a paper of Green and myself, we extended the above theorem to progressions of longer length (thus transferring Szemerédi’s theorem to the primes). In a series of papers (culminating in a paper to appear shortly) of Green, myself, and also Ziegler, related methods are also used to obtain an asymptotic for the number of solutions in the primes to any system of linear equations of bounded complexity. This latter result uses the full power of higher order Fourier analysis, in particular relying heavily on the inverse conjecture for the Gowers norms; in contrast, Roth’s theorem and Szemerédi’s theorem in the primes are “softer” results that do not need this conjecture.

To transfer results from the integers to the primes, there are three basic steps:

• A general transference principle, that transfers certain types of additive combinatorial results from dense subsets of the integers to dense subsets of a suitably “pseudorandom set” of integers (or more precisely, to the integers weighted by a suitably “pseudorandom measure”);
• An application of sieve theory to show that the primes (or more precisely, an affine modification of the primes) lie inside a suitably pseudorandom set of integers (or more precisely, have significant mass with respect to a suitably pseudorandom measure).
• If one is seeking asymptotics for patterns in the primes, and not simply lower bounds, one also needs to control correlations between the primes (or proxies for the primes, such as the Möbius function) with various objects that arise from higher order Fourier analysis, such as nilsequences.

The former step can be accomplished in a number of ways. For progressions of length three (and more generally, for controlling linear patterns of complexity at most one), transference can be accomplished by Fourier-analytic methods. For more complicated patterns, one can use techniques inspired by ergodic theory; more recently, simplified and more efficient methods based on duality (the Hahn-Banach theorem) have also been used. No number theory is used in this step. (In the case of transference to genuinely random sets, rather than pseudorandom sets, similar ideas appeared earlier in the graph theory setting, see this paper of Kohayakawa, Luczak, and Rodl.

The second step is accomplished by fairly standard sieve theory methods (e.g. the Selberg sieve, or the slight variants of this sieve used by Goldston and Yildirim). Remarkably, very little of the formidable apparatus of modern analytic number theory is needed for this step; for instance, the only fact about the Riemann zeta function that is truly needed is that it has a simple pole at ${s=1}$, and no knowledge of L-functions is needed.

The third step does draw more significantly on analytic number theory techniques and results (most notably, the method of Vinogradov to compute oscillatory sums over the primes, and also the Siegel-Walfisz theorem that gives a good error term on the prime number theorem in arithemtic progressions). As these techniques are somewhat orthogonal to the main topic of this course, we shall only touch briefly on this aspect of the transference strategy.

I’ve just uploaded to the arXiv the short note “A remark on primality testing and the binary expansion“, submitted to the Journal of the Australian Mathematical Society. In this note I establish the following result: for any sufficiently large integer n, there exists an n-bit prime p, such that the numbers $p \pm 2^i$ for $i=0,\ldots,n-1$ are all composite. In particular, if one flips any one of the bits in the binary expansion of the prime p, one obtains a composite number. As a consequence, one obtains the (rather plausible) consequence that in order to (deterministically) test whether an n-bit integer is prime or not, one needs (in the worst-case) to read all n bits of the prime. (This question was posed to me by my colleague here at UCLA, Yiannis Moschovakis.)

Primes p of the form mentioned in the above result are somewhat rare at first; the first some prime is $1973 = 11110110101_2$. But in fact, the argument in my note shows that the set of such primes actually has positive relative density inside the set of all primes. (Amusingly, this means that one can apply a theorem of Ben Green and myself and conclude that there are arbitrarily long arithmetic progressions of such primes, although I doubt that there is any particular significance or application to this conclusion.)

The same remark applies to other bases; thus, for instance, there exist infinitely many prime numbers with the property that if one changes any one of the base 10 digits of that number, one obtains a composite number. (Presumably the first such number can be located by computer search, though I did not attempt to do so.) [Update, Feb 25: see comments.]