Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Schnirelmann's basis theorem: positive density ⇒\Rightarrow⇒ finite additive basis

Proved
Schnir.basis

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

additive-combinatoricsnumber-theoryschnirelmann-density

Schnirelmann's basis theorem (1930). Let A⊆Z≥0A \subseteq \mathbb{Z}_{\ge 0}A⊆Z≥0​ contain 000 and have positive Schnirelmann density, σ(A)>0\sigma(A) > 0σ(A)>0. Then AAA is an additive basis of finite order: there exists kkk such that every natural number nnn is a sum of exactly kkk elements of AAA,

∀n∈N  ∃ multiset t:∣t∣=k,t⊆A,∑x∈tx=n.\forall n \in \mathbb{N}\ \ \exists\, \text{multiset } t:\quad |t| = k,\quad t \subseteq A,\quad \textstyle\sum_{x \in t} x = n.∀n∈N  ∃multiset t:∣t∣=k,t⊆A,∑x∈t​x=n.

Explicitly, k=⌈1/σ(A)⌉k = \lceil 1/\sigma(A) \rceilk=⌈1/σ(A)⌉ works.

This is the theorem for which Schnirelmann introduced his density, and the engine behind Schnirelmann-style additive results on primes: applied to the set of half-shifted primes (whose positive density follows from sieve estimates), it yields that every natural number is a bounded sum of primes — the structural backbone of the odd-Goldbach campaign on this platform. Together with the platform's Schnir.mann and Schnir.mann_iterate it completes, in content, the Mathlib Mathlib/Combinatorics/Schnirelmann.lean TODO: "Prove Schnirelmann's theorem and Mann's theorem on the subadditivity of this density."

Formalization Note Multiset formulation as in the campaign statements; σ\sigmaσ is Mathlib's schnirelmannDensity.

Preamble
import Mathlib
Formal statement
namespace Schnir

open Pointwise Classical in
theorem basis (A : Set ℕ) (hA0 : 0 ∈ A) (hσ : 0 < schnirelmannDensity A) :
    ∃ k : ℕ, ∀ n : ℕ, ∃ t : Multiset ℕ, t.card = k ∧ (∀ x ∈ t, x ∈ A) ∧ t.sum = n := by
  sorry

end Schnir
Source
L. G. Schnirelmann, Über additive Eigenschaften von Zahlen, Math. Ann. 107 (1930), 649–690; textbook treatment in M. B. Nathanson, Additive Number Theory: Inverse Problems of the Theory of Additive Number Theory, GTM 165, §7 (Theorem 7.2). Closes in content the Mathlib TODO in Mathlib/Combinatorics/Schnirelmann.lean line 42.

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