Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Mann's α+β\alpha+\betaα+β theorem: σ(D+E)≥min⁡(1,σ(D)+σ(E))\sigma(D+E)\ge\min(1,\sigma(D)+\sigma(E))σ(D+E)≥min(1,σ(D)+σ(E))

Proved
Schnirelmann.mann

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

additive-combinatoricsnumber-theoryschnirelmann-densitysumsets

Mann's α+β\alpha+\betaα+β theorem. For a set A⊆NA\subseteq\mathbb{N}A⊆N write A(n)=∣A∩[1,n]∣A(n)=\lvert A\cap[1,n]\rvertA(n)=∣A∩[1,n]∣ and let

σ(A)=inf⁡n≥1A(n)n\sigma(A)=\inf_{n\ge 1}\frac{A(n)}{n}σ(A)=n≥1inf​nA(n)​

be its Schnirelmann density. Let D,E⊆ND,E\subseteq\mathbb{N}D,E⊆N be sets that both contain 000, and let D+E={d+e:d∈D, e∈E}D+E=\{d+e : d\in D,\ e\in E\}D+E={d+e:d∈D, e∈E} be their sumset. Then

σ(D+E) ≥ min⁡(1, σ(D)+σ(E)).\sigma(D+E)\ \ge\ \min\bigl(1,\ \sigma(D)+\sigma(E)\bigr).σ(D+E) ≥ min(1, σ(D)+σ(E)).

This is the α+β\alpha+\betaα+β conjecture (Khinchin; Landau and Schnirelmann), proved by H. B. Mann in 1942. It strengthens Schnirelmann's inequality σ(D+E)≥σ(D)+σ(E)−σ(D)σ(E)\sigma(D+E)\ge\sigma(D)+\sigma(E)-\sigma(D)\sigma(E)σ(D+E)≥σ(D)+σ(E)−σ(D)σ(E) by removing the product term, and it contains Schnirelmann's lemma (σ(D)+σ(E)≥1\sigma(D)+\sigma(E)\ge 1σ(D)+σ(E)≥1 implies D+E=ND+E=\mathbb{N}D+E=N) as the case min⁡=1\min=1min=1.

A standard consequence, by induction on hhh, is σ(hA)≥min⁡(1, h σ(A))\sigma(hA)\ge\min(1,\,h\,\sigma(A))σ(hA)≥min(1,hσ(A)) for every AAA containing 000. In particular a set with σ(A)>0\sigma(A)>0σ(A)>0 and 0∈A0\in A0∈A is an additive basis of order at most ⌈1/σ(A)⌉\lceil 1/\sigma(A)\rceil⌈1/σ(A)⌉, instead of the order of size about ln⁡2/σ(A)\ln 2/\sigma(A)ln2/σ(A) that the product inequality gives. This is the quantitative input that sharpens bounds of the form "every integer is a sum of at most kkk primes" obtained from a lower bound for the density of the set of sums of two primes.

Formalization note. schnirelmannDensity is Mathlib's definition (it counts elements of AAA in {1,…,n}\{1,\dots,n\}{1,…,n}, so membership of 000 does not affect the density). The sumset is the pointwise sum on Set ℕ. The hypotheses 0∈D0\in D0∈D and 0∈E0\in E0∈E are the standard ones in Mann's theorem.

Preamble
import Mathlib
Formal statement
namespace Schnirelmann

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 Schnirelmann
Source
H. B. Mann, A proof of the fundamental theorem on the density of sums of sets of positive integers, Ann. of Math. 43 (1942), 523-527; see M. B. Nathanson, Additive number theory and the Dyson transform, arXiv:2407.12253, Theorem 2 (Mann).
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by moona3k · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me