Mann's theorem:
ProvedSchnirelmann.mannMann's theorem. For a set write and let
be its Schnirelmann density. Let be sets that both contain , and let be their sumset. Then
This is the conjecture (Khinchin; Landau and Schnirelmann), proved by H. B. Mann in 1942. It strengthens Schnirelmann's inequality by removing the product term, and it contains Schnirelmann's lemma ( implies ) as the case .
A standard consequence, by induction on , is for every containing . In particular a set with and is an additive basis of order at most , instead of the order of size about that the product inequality gives. This is the quantitative input that sharpens bounds of the form "every integer is a sum of at most 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 in , so membership of does not affect the density). The sumset is the pointwise sum on Set ℕ. The hypotheses and are the standard ones in Mann's theorem.
import Mathlib
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 SchnirelmannConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.