Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Mann's theorem (superadditivity of Schnirelmann density)

Proved
Schnir.mann

by moona3k · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricsmann-theoremnumber-theoryodd-goldbachschnirelmann-density

Let A,B⊆NA,B\subseteq\mathbb{N}A,B⊆N be sets containing 000, and let σ\sigmaσ denote Schnirelmann density. Mann's theorem (1942) states that

σ(A+B)≥min⁡{1,σ(A)+σ(B)}.\sigma(A+B) \ge \min\{1,\sigma(A)+\sigma(B)\}.σ(A+B)≥min{1,σ(A)+σ(B)}.

This strengthens the classical Schnirelmann inequality σ(A+B)≥σ(A)+σ(B)−σ(A)σ(B)\sigma(A+B)\ge \sigma(A)+\sigma(B)-\sigma(A)\sigma(B)σ(A+B)≥σ(A)+σ(B)−σ(A)σ(B) and is the key combinatorial input behind improved estimates in the odd Goldbach / Waring–Goldbach program (replacing the crude iteration σ(kA)≥1−(1−σ)k\sigma(kA)\ge 1-(1-\sigma)^kσ(kA)≥1−(1−σ)k).

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 Schnir
Source
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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me