Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Terence Tao and Tamar Ziegler, Infinite partial sumsets in the primes, J. Anal. Math. 151 (2023), 375--389, read in the arXiv version identified on the source card; labels and pages are that version's.
Statement
Setting (Definition 1.1, p. 1). A tuple of natural numbers is admissible if for each prime it avoids at least one residue class mod , and prime-producing if there are infinitely many for which are simultaneously prime.
Conjecture 1.2 (Dickson--Hardy--Littlewood conjecture, p. 1, quoted). "Every admissible tuple is prime-producing."
Theorem 1.3 (p. 2, quoted). "Assume Conjecture 1.2. Then there exists an infinite set of primes such that is prime for every distinct ."
The paper presents this as the analogue, for the primes, of Erdős's question whether every set of natural numbers of positive upper density contains an infinite and a natural number with in the set for all distinct , which it reports proved by Kra, Moreira, Richter and Robertson (p. 1). It notes (p. 2) that Granville had shown that Conjecture 1.2 implies that the primes contain a sumset of two infinite sets, and that Theorem 1.3 gives a new proof of this; and that, by results of Balog (see also Green and Tao), the theorem holds unconditionally when "infinite set" is replaced by "arbitrarily large finite sets".
Remark 1.4 (p. 2). The theorem does not carry over to every subset of the primes of positive relative density. If is a set of primes containing for all distinct in some infinite , then has bounded gaps infinitely often, since two elements of give infinitely many pairs in . But for any with and , the primes with no prime in form a set of relative density in the primes (by a theorem of Gallagher) whose consecutive gaps tend to infinity. The remark says a similar remark applies to Theorem 1.5 and Corollary 1.6.
Read depth. Claims checked: the definition, the conjecture, the theorem and the remark were read clause by clause on the printed pages. The proof was read but not checked step by step. Nothing here is independently reviewed.
Proof pointer
Section 2, pp. 4--5. Call an increasing tuple of primes good if is prime for , consecutive entries differ by more than , and does not divide for . Proposition 2.1 (p. 4) extends a good -tuple to a good -tuple, by applying Conjecture 1.2 to the admissible tuple ; iterating from gives the set . Remark 2.2 (pp. 4--5) recasts the construction in the dynamical framework of Kra, Moreira, Richter and Robertson.
Dependencies
Conjecture 1.2, assumed.
Bears on
- Problem 656: the problem's hypothesis is positive upper density, which the primes lack. Theorem 1.3 proves the problem's conclusion for the primes, with , assuming Conjecture 1.2; Remark 1.4 shows the conclusion fails for some subset of the primes of relative density .
- Problem 431: assuming Conjecture 1.2, the paper says Theorem 1.3 reproves Granville's result that the primes contain a sumset of two infinite sets. It says nothing on whether such a sumset can agree with the primes up to finitely many exceptions.