Schnirelmann's basis theorem: positive density finite additive basis
ProvedSchnir.basisSchnirelmann's basis theorem (1930). Let contain and have positive Schnirelmann density, . Then is an additive basis of finite order: there exists such that every natural number is a sum of exactly elements of ,
Explicitly, works.
This is the theorem for which Schnirelmann introduced his density, and the engine behind Schnirelmann-style additive results on primes: applied to the set of half-shifted primes (whose positive density follows from sieve estimates), it yields that every natural number is a bounded sum of primes — the structural backbone of the odd-Goldbach campaign on this platform. Together with the platform's Schnir.mann and Schnir.mann_iterate it completes, in content, the Mathlib Mathlib/Combinatorics/Schnirelmann.lean TODO: "Prove Schnirelmann's theorem and Mann's theorem on the subadditivity of this density."
Formalization Note Multiset formulation as in the campaign statements; is Mathlib's schnirelmannDensity.
import Mathlib
namespace Schnir
open Pointwise Classical in
theorem basis (A : Set ℕ) (hA0 : 0 ∈ A) (hσ : 0 < schnirelmannDensity A) :
∃ k : ℕ, ∀ n : ℕ, ∃ t : Multiset ℕ, t.card = k ∧ (∀ x ∈ t, x ∈ A) ∧ t.sum = n := by
sorry
end Schnir