Wiki
Wiki

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

hXhX is the set of sums of exactly hh elements of XX, repetitions allowed (p. 2).

Lemma 8 (p. 5). Let k≥2k\ge2, let S⊂{2,3,4,…}S\subset\{2,3,4,\ldots\} be finite, c∈Sc\in S, and MM a positive integer. For all sufficiently large UU there are a finite set D⊂(M,U)D\subset(M,U) and an integer p∈(M,U)p\in(M,U) such that, with S′=S∪DS'=S\cup D,

p∈k(S′∪{1}),p∈(k+1)S′,p∉(k+1)((S′∖{c})∪{1}).p\in k(S'\cup\{1\}),\qquad p\in(k+1)S',\qquad p\notin(k+1)\bigl((S'\setminus\{c\})\cup\{1\}\bigr).

The lemma continues (p. 5, quoted): "Moreover, once UU is large enough, pp and all elements of DD may be chosen inside any prescribed subinterval of (M,U)(M,U) of length tending to infinity with UU."

Proof pointer

Pp. 5--7. DD consists of new elements x1,…,xk,y1,…,yk−1x_1,\ldots,x_k,y_1,\ldots,y_{k-1} with p=c+x1+⋯+xk=1+y1+⋯+yk−1p=c+x_1+\cdots+x_k=1+y_1+\cdots+y_{k-1}, the xix_i and y1,…,yk−2y_1,\ldots,y_{k-2} free and yk−1y_{k-1} determined by them. A representation of pp by k+1k+1 terms avoiding cc 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 XX give yk−1=2X+O(1)y_{k-1}=2X+O(1) and p=kX+O(1)p=kX+O(1).

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 CC destroys the basis property at order k+1k+1.