Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 from a first and a second moment

Proved
LL_Decomp1526a.theorem2_of_moments

by sthubbar · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

Let L,UL,UL,U be real numbers with L>0L>0L>0, U>0U>0U>0 and 1/5≤L2/U1/5\le L^2/U1/5≤L2/U. Suppose that for every real X≥e67X\ge e^{67}X≥e67, LX2≤∑Nr(N)LX^2\le\sum_{N}r(N)LX2≤∑N​r(N) and ∑Nr(N)2≤UX3\sum_N r(N)^2\le UX^3∑N​r(N)2≤UX3, where NNN ranges over the even natural numbers with ⌊X⌋<N≤⌊2X⌋\lfloor X\rfloor<N\le\lfloor 2X\rfloor⌊X⌋<N≤⌊2X⌋. Then Theorem 2 holds: for every real X≥e67X\ge e^{67}X≥e67, at least X/5X/5X/5 such NNN are sums of two primes.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1526a_IsGoldbachSum
import Definitions.Def_LL_Decomp1526a_rep
import Definitions.Def_LL_Decomp1526a_evenBlock
import Definitions.Def_LL_Decomp1526a_Theorem2

open Finset Real
open scoped Chebyshev Classical
Formal statement
namespace LL_Decomp1526a
theorem theorem2_of_moments (L U : ℝ) (hL : 0 < L) (hU : 0 < U) (hc : 1 / 5 ≤ L ^ 2 / U)
    (h1 : ∀ X : ℝ, exp 67 ≤ X → L * X ^ 2 ≤ ∑ N ∈ evenBlock X, rep N)
    (h2 : ∀ X : ℝ, exp 67 ≤ X → ∑ N ∈ evenBlock X, rep N ^ 2 ≤ U * X ^ 3) : Theorem2 := by sorry
end LL_Decomp1526a
Source
Ramaré 1995, Theorem 2, p. 646; Section 2.3, pp. 653 to 656.
Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 30, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me