Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Proposition 2.3, p. 3, with Lemmas 2.1 (p. 2) and 2.2 (p. 3), of David Turturean, A Negative Answer to Erdős Problem #870, preprint dated April 2026 (11 pp.), https://www.overleaf.com/read/gknkvvxrymfv; the edition read is named on the source card.
Setting
Pp. 1–3. is the number of pairs with and , the exact two-summand representations. An additive basis of order 2 in the at-most-two sense is a set with cofinite. is the number of elements of up to .
Statement
Proposition 2.3 (p. 3). There are an absolute constant and a set such that
- is cofinite;
- for all sufficiently large ;
- ;
- contains no minimal additive basis of order 2 in the at-most-two sense.
Lemma 2.1 (p. 2). Almost surely the final set of the Larsen–Larsen construction satisfies , uniformly in and not only at the stage boundaries .
Lemma 2.2 (p. 3). Almost surely, for all sufficiently large , there are no two distinct stage- canaries , element of the earlier stages and element of , the set holding the control summands of the stage- canaries, with .
Proof pointer
Pp. 2–4. The set is the random order-2 basis of Larsen and Larsen, built in stages by Bernoulli sampling, deletion of the summands of a sparse set of canaries, and addition of restoration elements. The exact order-2 basis property, the logarithmic lower bound and the absence of a minimal subbasis in the exact convention are cited from Larsen and Larsen. Lemma 2.1 gives (3), counting the Bernoulli samples by Chernoff bounds and the restoration elements by the doubly exponential growth of . Lemma 2.2, a summable Borel–Cantelli bound, excludes a representation of a canary by another canary's restoration element and an old element, so each large canary keeps only its intended representations. The passage to the at-most-two convention shows that large canaries lie outside , that every large robust element has at least two representations in any at-most-two subbasis , and that deleting any leaves an at-most-two basis.
Dependencies
Lemmas 2.1 and 2.2, and the construction of D. Larsen and M. Larsen, Robust additive bases without minimal subbases, arXiv:2601.18507 (2026), including its finite-incidence argument, which the paper cites. The constant is not given explicitly.
Read depth: claims checked. The statements were read clause by clause on the print and the proofs followed in outline; the cited Larsen–Larsen results were not read.
Bears on
- Problem 870: the order-2 input of Proposition 5.2, which gives the cases of Theorem 1.1. On its own it concerns order 2, outside the problem's range .