Infinite deletions from additive bases in Erdős 881

A set of natural numbers is an asymptotic basis of order k if every sufficiently large integer is a sum of exactly k elements of the set. Repeated summands are allowed. Erdős asked whether an infinite subset can be removed from a basis of order k while keeping a basis of order k+1k + 1, when no infinite deletion preserves order k.

Why it matters and what counts as progress

Why it matters: A basis can lose its ability to represent large integers when elements are removed. The question asks whether one extra summand can make up for infinitely many deletions.

What counts as progress: Prove or refute the infinite-deletion property for a fixed order. Distinguish the need for a minimality assumption and the convention for the number of summands.

How the problem developed

  1. 1980 · Order-two and order-three question [6]

    Paul Erdős and Melvyn B. Nathanson Asked whether a minimal asymptotic basis of order three can also be an asymptotic basis of order two.

  2. 8 Nov 2026 · Infinite deletion for order two [1][4][3]

    Bruce Lee with GPT-6.1 agents Reported that every asymptotic basis of order two admits an infinite deletion leaving a basis of order three.

AI contribution

Sources

  1. Bruce Lee’s order-two proof and provenance
  2. Lean statements for the three conclusions
  3. Palomar preflight verification
  4. Lee’s formal-conjectures submission
  5. Erdős Problem 881
  6. Erdős and Nathanson on minimal asymptotic bases
Publication history