Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bound the lower interval pointwise error

Proved
LL_Decomp1525c.low_pointwise

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

number-theory

Assume ∣θ(y)−y∣<y/(40log⁡y)|\theta(y)-y|<y/(40\log y)∣θ(y)−y∣<y/(40logy) for every real y≥678407y\ge678407y≥678407, where θ\thetaθ is Chebyshev's prime logarithm sum. For real x≥1052x\ge10^{52}x≥1052 and 3≤u≤x3\le u\le x3≤u≤x, with t=max⁡(x−u,2)t=\max(x-u,2)t=max(x−u,2), ∣Ix(u)−u∣≤x/(40log⁡x)+t/(40log⁡t)+678412|I_x(u)-u|\le x/(40\log x)+t/(40\log t)+678412∣Ix​(u)−u∣≤x/(40logx)+t/(40logt)+678412.

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 low_pointwise
    (h215 : ∀ y : ℝ, 678407 ≤ y → |Chebyshev.theta y - y| < y / (40 * Real.log y))
    (x u : ℝ) (hx : 10 ^ 52 ≤ x) (hu3 : 3 ≤ u) (hux : u ≤ x) :
    |thetaI x u - u| ≤ x / (40 * Real.log x)
      + max (x - u) 2 / (40 * Real.log (max (x - u) 2)) + 678412 := 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

Assume h215: for every real y≥678407y\ge 678407y≥678407, ∣ϑ(y)−y∣<y/(40log⁡y)|\vartheta(y)-y|<y/(40\log y)∣ϑ(y)−y∣<y/(40logy), ϑ\varthetaϑ Mathlib's Chebyshev.theta. Then for real x≥1052x\ge 10^{52}x≥1052 and 3≤u≤x3\le u\le x3≤u≤x: ∣θI(x,u)−u∣≤x40log⁡x+max⁡(x−u,2)40log⁡max⁡(x−u,2)+678412|\theta_I(x,u)-u|\le\frac{x}{40\log x}+\frac{\max(x-u,2)}{40\log\max(x-u,2)}+678412∣θI​(x,u)−u∣≤40logxx​+40logmax(x−u,2)max(x−u,2)​+678412, where θ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, effectively primes in (x−u,x−3](x-u,x-3](x−u,x−3]. Both logarithms have arguments at least 2, and log⁡x>0\log x>0logx>0, so no division by zero or junk values; when x−u<2x-u<2x−u<2 the middle term is 2/(40log⁡2)2/(40\log2)2/(40log2). h215 covers only y≥678407y\ge 678407y≥678407, so small x−ux-ux−u must be absorbed by the additive constant 678412678412678412; the statement does not say how. Non-strict.

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