Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Identify the lower interval prime sum

Proved
LL_Decomp1525c.thetaI_low

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

number-theory

For real x≥6x\ge6x≥6 and 3≤u≤x3\le u\le x3≤u≤x, Ix(u)=θ(x−3)−θ(max⁡(x−u,2))I_x(u)=\theta(x-3)-\theta(\max(x-u,2))Ix​(u)=θ(x−3)−θ(max(x−u,2)), where θ(t)=∑p≤tlog⁡p\theta(t)=\sum_{p\le t}\log pθ(t)=∑p≤t​logp over primes.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1525c_P1V
import Definitions.Def_LL_Decomp1525c_thetaI
open Finset Real MeasureTheory intervalIntegral
open scoped Classical
Formal statement
namespace LL_Decomp1525c
theorem thetaI_low (x u : ℝ) (hx : 6 ≤ x) (hu3 : 3 ≤ u) (hux : u ≤ x) :
    thetaI x u = Chebyshev.theta (x - 3) - Chebyshev.theta (max (x - u) 2) := by sorry
end LL_Decomp1525c
Source
R. C. Vaughan, On the estimation of Schnirelman's constant, J. reine angew. Math. 290, 1977, pp. 93 to 108, p. 103, proof of Lemma 11. https://doi.org/10.1515/crll.1977.290.93
Read-back

What the Lean code literally says, in plain math · claude-haiku

For real x,ux,ux,u with 6≤x6\le x6≤x, 3≤u3\le u3≤u, u≤xu\le xu≤x: θI(x,u)=ϑ(x−3)−ϑ(max⁡(x−u,2))\theta_I(x,u)=\vartheta(x-3)-\vartheta(\max(x-u,2))θI​(x,u)=ϑ(x−3)−ϑ(max(x−u,2)), where ϑ\varthetaϑ is Mathlib's Chebyshev.theta, ∑log⁡p\sum\log p∑logp over primes p≤⌊y⌋+p\le\lfloor y\rfloor_+p≤⌊y⌋+​, and θI(x,u)\theta_I(x,u)θI​(x,u) sums log⁡p\log plogp over primes 3≤p≤x−33\le p\le x-33≤p≤x−3 with x−u<p≤2x−ux-u<p\le 2x-ux−u<p≤2x−u. The upper condition is redundant since 2x−u≥x>x−32x-u\ge x>x-32x−u≥x>x−3, so the left side is the sum over primes in (x−u, x−3](x-u,\,x-3](x−u,x−3] with p≥3p\ge3p≥3. The right side matches in both regimes: if x−u≥2x-u\ge2x−u≥2 it is ϑ(x−3)−ϑ(x−u)\vartheta(x-3)-\vartheta(x-u)ϑ(x−3)−ϑ(x−u), and if x−u<2x-u<2x−u<2 it is ϑ(x−3)−log⁡2\vartheta(x-3)-\log 2ϑ(x−3)−log2, removing the prime 2 the left side excludes. All floor arguments are nonnegative; no junk values. Equality, no further quantifiers.

Human review
  • Endorsed by Shuze Chen · Oct 28, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 28, 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