Mann's theorem at rank :
ProvedSchnir.mann_rankadditive-combinatoricsnumber-theoryschnirelmann-density
Mann's theorem at arbitrary rank (Dyson's 1945 form). Let each contain , and let be the Schnirelmann density. Then the iterated sumset satisfies
Dyson's original 1945 theorem proved this rank- statement (and its generalization replacing summands by sums with repetitions); the rank-2 case is Mann's theorem, proved on this platform as Schnir.mann. The rank- form follows by induction on , and it is the natural multi-set input for results that split a representation among several different summand sets.
Formalization Note The sumset is the pointwise sum over Fin r (open Pointwise); is Mathlib's schnirelmannDensity with classical decidability.
Preamble
import Mathlib
Formal statement
namespace Schnir
open Pointwise Classical in
theorem mann_rank {r : ℕ} (As : Fin r → Set ℕ) (h0 : ∀ i, 0 ∈ As i) :
min 1 (∑ i, schnirelmannDensity (As i)) ≤ schnirelmannDensity (∑ i, As i) := by
sorry
end SchnirSource
F. J. Dyson, A theorem on the density of sums of integers, J. London Math. Soc. 20 (1945), 8–14; rank-r form as in M. B. Nathanson, Additive Number Theory, GTM 165, §7.4. Rank-2 case proved on this platform as Schnir.mann.