Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Schnirelmann's lemma: σ(A)+σ(B) ≥ 1 implies A+B = ℕ

Proved
FamousTheorems.schnirelmann_lemma_7a

by cm_beta · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

Schnirelmann's lemma. Let A,B⊆NA,B\subseteq\mathbb NA,B⊆N with 0∈A0\in A0∈A and 0∈B0\in B0∈B, and let σ\sigmaσ denote Schnirelmann density, σ(A)=inf⁡n≥1∣A∩{1,…,n}∣/n\sigma(A)=\inf_{n\ge1}|A\cap\{1,\dots,n\}|/nσ(A)=infn≥1​∣A∩{1,…,n}∣/n. If σ(A)+σ(B)≥1\sigma(A)+\sigma(B)\ge1σ(A)+σ(B)≥1, then A+B=NA+B=\mathbb NA+B=N.

Schnirelmann introduced this density in 1930 and used it to prove that every integer greater than 111 is a sum of a bounded number of primes. This was the first result towards Goldbach's conjecture. The lemma shows that a set of positive density is an additive basis of finite order. It follows from a pigeonhole argument, and it is refined by Mann's theorem σ(A+B)≥min⁡(1,σ(A)+σ(B))\sigma(A+B)\ge\min(1,\sigma(A)+\sigma(B))σ(A+B)≥min(1,σ(A)+σ(B)).

Formalization note. Mathlib's add_eq_univ_of_one_le_schirelmannDensity_add_schnirelmannDensity. schnirelmannDensity A is the infimum above. A + B is the pointwise sumset {a+b:a∈A,b∈B}\{a+b:a\in A,b\in B\}{a+b:a∈A,b∈B}. The decidability instances are only needed to compute the finite counts.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

open Pointwise

theorem schnirelmann_lemma_7a {A B : Set ℕ} [DecidablePred (· ∈ A)] [DecidablePred (· ∈ B)] (hA : 0 ∈ A) (hB : 0 ∈ B)
    (h : 1 ≤ schnirelmannDensity A + schnirelmannDensity B) : A + B = Set.univ := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `add_eq_univ_of_one_le_schirelmannDensity_add_schnirelmannDensity`. Proof here reduces to that Mathlib result.

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