Infinite deletions from asymptotic additive bases of order two

Every asymptotic additive basis of order two in the natural numbers contains an infinite subset whose removal leaves an asymptotic additive basis of order three. The result uses exactly the stated number of summands, with repetitions allowed, and requires no minimality hypothesis.

What was already known

Erdős posed the general infinite-deletion question. In 1980, Erdős and Nathanson asked whether a minimal asymptotic basis of order three can also be an asymptotic basis of order two.

AI involvement AI-autonomous

Bruce Lee reports that GPT-6.1 agents found the mathematical argument in an automated search. Claude extracted the required declarations and ported them to the Palomar layout.

Importance Notable

The result settles the order-two case and answers the Erdős–Nathanson question in the negative.

Technical verification Formal (Lean 4)

Palomar preflight passed for the pinned project. Its challenge covers infinite deletion, the order-two specialisation of Erdős 881 and the Erdős–Nathanson corollary.

Formal checking

Palomar preflight passed for the pinned project. Its challenge covers infinite deletion, the order-two specialisation of Erdős 881 and the Erdős–Nathanson corollary.

Checker
Lean 4 kernel through Palomar preflight
Scope
Every asymptotic additive basis of order two in the natural numbers contains an infinite subset whose removal leaves an asymptotic additive basis of order three. The result uses exactly the stated number of summands, with repetitions allowed, and requires no minimality hypothesis.
Basis
Reported by the linked checker

Human understanding Few

Lee reports that no person reviewed the proof. The author’s pull request summarises its two cases without attributing the explanation to a human proof review.

Correction and publication history