Mann's theorem (superadditivity of Schnirelmann density)
ProvedSchnir.mannadditive-combinatoricsmann-theoremnumber-theoryodd-goldbachschnirelmann-density
Let be sets containing , and let denote Schnirelmann density. Mann's theorem (1942) states that
This strengthens the classical Schnirelmann inequality and is the key combinatorial input behind improved estimates in the odd Goldbach / Waring–Goldbach program (replacing the crude iteration ).
The proof is finite and elementary (Dyson's transform); it is listed as a Mathlib TODO in Mathlib/Combinatorics/Schnirelmann.lean.
Preamble
import Mathlib.Combinatorics.Schnirelmann import Mathlib.Data.Nat.Count import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring import Mathlib.Algebra.BigOperators.Intervals import Mathlib.Tactic.NormNum
Formal statement
namespace Schnir
open Pointwise Classical in
theorem mann (D E : Set ℕ) (hD : 0 ∈ D) (hE : 0 ∈ E) :
min 1 (schnirelmannDensity D + schnirelmannDensity E) ≤ schnirelmannDensity (D + E) := by sorry
end SchnirSource
H. B. Mann, Ann. of Math. 43 (1942), 523–527; F. J. Dyson, J. London Math. Soc. 20 (1945), 8–14; Nathanson, arXiv:2407.12253