Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Lemma 8, p. 5 (Section 5.1, pp. 5--7), of Infinite Deletions from Strongly Minimal Additive Bases, manuscript (2026), no author printed, posted by Svyable in the thread of Erdős Problem 881 on 2026-05-03, https://www.overleaf.com/read/dckvqtggbjzn; the edition read is identified on the source card.
Read depth. Claims checked: the statement was read clause by clause on the print and the proof on pp. 5--7 was read; no step is checked here.
Statement
is the set of sums of exactly elements of , repetitions allowed (p. 2).
Lemma 8 (p. 5). Let , let be finite, , and a positive integer. For all sufficiently large there are a finite set and an integer such that, with ,
The lemma continues (p. 5, quoted): "Moreover, once is large enough, and all elements of may be chosen inside any prescribed subinterval of of length tending to infinity with ."
Proof pointer
Pp. 5--7. consists of new elements with , the and free and determined by them. A representation of by terms avoiding is an affine equation in the free variables; comparing coefficients, the proof argues that none of these equations is an identity, so free variables chosen in a large box off finitely many hyperplanes give the third property. For the "Moreover" clause the proof offers one sentence (p. 5): the box may be shifted and rescaled into any large subinterval. On the same page it notes that variables near a parameter give and .
A reader's AI check posted in the problem's thread, recorded on the claim page, reports that the "Moreover" clause is false as stated. The construction applies it on p. 10.
Bears on
- Problem 881: an ingredient of the manuscript's construction for Main Theorem 6; its witnesses are meant to show that deleting any element of destroys the basis property at order .