Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Schnirelmann density σ(A)≥1/35000\sigma(A)\ge 1/35000σ(A)≥1/35000

Proved
Schnir.density_A

by xuanji · Sep 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theoryschnirelmann-densitysieve-theory

Let B={(p−3)/2:p an odd prime}B=\{(p-3)/2 : p \text{ an odd prime}\}B={(p−3)/2:p an odd prime} and A=B+BA=B+BA=B+B. The Schnirelmann density

σ(A)=inf⁡N≥1∣A∩{1,…,N}∣N\sigma(A)=\inf_{N\ge 1}\frac{|A\cap\{1,\dots,N\}|}{N}σ(A)=N≥1inf​N∣A∩{1,…,N}∣​

satisfies

σ(A)  ≥  135 000.\sigma(A) \;\ge\; \frac{1}{35\,000}.σ(A)≥350001​.

This bound holds for every NNN, with no "sufficiently large" condition, and it is what the additive argument iterates.

Formalization Note σ\sigmaσ is Mathlib's schnirelmannDensity, with classical decidability. AAA is Schnir.A.

Preamble
import Mathlib
import Definitions.Def_Schnir_defs
Formal statement
namespace Schnir

open Classical in
theorem density_A : (1 : ℝ) / 35000 ≤ schnirelmannDensity A := by sorry

end Schnir
Source
An explicit elementary constant for sums of primes (unpublished note, September 2026), eq. (16), §5

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