Id: palomar/PALOMAR-2026-11-09-000017 Url: https://github.com/BruceLoveLee000/erdos-lean-proofs/tree/caacb396739c327a3444ab69ce56a68b4d8887fd/palomar/erdos881-k2 Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-09-000017-v1.json Repo: https://github.com/BruceLoveLee000/erdos-lean-proofs Tags: math.NT, math.CO, msc:11B13 Score: 0 Title: Erdős Problem 881 for k = 2: infinite deletions from asymptotic bases of order two Trust: high Domain: math.NT Source: palomar Authors: Bruce Lee Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-09 Formalized: true Page: https://delphi.science/r/palomar/PALOMAR-2026-11-09-000017 Erdős Problem 881 asks whether every minimal additive basis A of order k (one from which no infinite set can be removed while keeping a basis of order k) contains an infinite set B such that A \ B is a basis of order k + 1. This formalization settles the case k = 2 in the formulation of google-deepmind/formal-conjectures, where a basis of order n is an asymptotic basis: all but finitely many natural numbers are sums of exactly n elements of A. It proves the stronger statement that every asymptotic additive basis of order 2 in the natural numbers, minimal or not, contains an infinite set…