If then every is a sum of exactly elements of
ProvedSchnir.basis_of_densityadditive-combinatoricsnumber-theoryschnirelmann-density
Let with , and let be the Schnirelmann density. If is a natural number with
then every natural number is a sum of exactly elements of (repetitions allowed): there is a multiset with , all elements of in , and . The passage from "at most " to "exactly " costs nothing because allows padding with zeros.
Together with the iterated Mann bound , this is the endpoint of the Schnirelmann density iteration: density for means , and supplies .
Formalization Note The multiset formulation matches the odd-Goldbach campaign statements (odd_sum_le_6101_primes and its siblings).
Preamble
import Mathlib
Formal statement
namespace Schnir
open Pointwise Classical in
theorem basis_of_density (A : Set ℕ) (hA0 : 0 ∈ A) (k : ℕ)
(hk : 1 ≤ (k : ℝ) * schnirelmannDensity A) :
∀ n : ℕ, ∃ t : Multiset ℕ, t.card = k ∧ (∀ x ∈ t, x ∈ A) ∧ t.sum = n := by
sorry
end Schnir
Source
Standard corollary of Mann's theorem (L. G. Schnirelmann 1930, H. B. Mann 1942); see Nathanson, Additive Number Theory, GTM 165, §7. Uses platform theorem Schnir.mann_iterate.