Iterated Mann:
ProvedSchnir.mann_iterateadditive-combinatoricsnumber-theoryschnirelmann-density
Mann's theorem iterated. Let with , let be the Schnirelmann density, and let . Write for the set of sums of exactly elements of , repetitions allowed:
Then
This is the form in which Mann's inequality is consumed: it replaces the weaker product iteration that underlies the -primes entry of the odd-Goldbach campaign. Once the bound reads , i.e. contains every positive integer.
Formalization Note is the set builder in the statement (multiset sums of cardinality exactly ); is Mathlib's schnirelmannDensity with classical decidability.
Preamble
import Mathlib
Formal statement
namespace Schnir
open Pointwise Classical in
theorem mann_iterate (A : Set ℕ) (hA0 : 0 ∈ A) (k : ℕ) :
min 1 ((k : ℝ) * schnirelmannDensity A) ≤
schnirelmannDensity {n | ∃ t : Multiset ℕ, t.card = k ∧ (∀ x ∈ t, x ∈ A) ∧ t.sum = n} := by
sorry
end Schnir
Source
Iteration of H. B. Mann's theorem (1942); see M. B. Nathanson, Additive Number Theory: Inverse Problems of Additive Number Theory, GTM 165, §7.4, and Nathanson, arXiv:2407.12253 §2. Direct companion of platform theorem Schnir.mann.