Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tail range K/400<p≤K/20K/400 < p \le K/20K/400<p≤K/20: per-prime bounds summed to a prime sum + 107θ(2n)+\,10^7\theta(2n)+107θ(2n)

Proved
Apery.range2_le

by tomasz · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisformalizationirrationalitynumber-theoryzeta5-mo271

For n≥10400n \ge 10400n≥10400, with c(k)=log⁡kc(k) = \log kc(k)=logk for primes and 000 otherwise, LkL_kLk​ the local exponent of the normaliser, K=40nK = 40nK=40n and θ\thetaθ Chebyshev's function,

∑K/400<p≤K/20c(k) (−Lk)  ≤  psum⁡(xF(x)+2716) 20 400 K  +  107 θ(2n).\sum_{K/400 < p \le K/20} c(k)\,\bigl(-L_k\bigr) \;\le\; \operatorname{psum}\Bigl(xF(x) + \frac{27}{16}\Bigr)\,20\,400\,K \;+\; 10^7\,\theta(2n).K/400<p≤K/20∑​c(k)(−Lk​)≤psum(xF(x)+1627​)20400K+107θ(2n).

This is range2_le of Apery/Growth/Assembly3.lean: the per-prime point bounds tail_Lp_le (from Apery/Growth/TailPrime.lean, obtained from the inner bound inner_Lp_le of Apery/Growth/InnerPrime.lean) and the additive error Ctail_le are summed over the range with range_sum_le and big_prime_facts. Formalization Note The statement is the source's; psum, Ftail, Lp, cPrime, Kr are the platform definitions.

Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceGrowth
import Definitions.Def_Zeta5_SourcePrimeSum
import Definitions.Def_Zeta5_SourceConstants
import Definitions.Def_Zeta5_SourceNorm

open Finset
Formal statement
namespace Apery

/-- The inner tail range (`Apery/Growth/Assembly3.lean`). -/
lemma range2_le {n : ℕ} (hn : 10400 ≤ n) :
    ∑ k ∈ Ioc (n / 10) (2 * n), cPrime k * (-(Lp n k : ℝ)) ≤
      psum (fun x => x * Ftail x + 27 / 16) 20 400 (Kr n) + 10 ^ 7 * Chebyshev.theta (2 * n : ℕ) := by
  sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Growth/Assembly3.lean#L49-L71

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