Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Growth, tail range K/400<p≤K/20K/400 < p \le K/20K/400<p≤K/20: contribution ≤−0.05346K2+o(K2)\le -0.05346K^2 + o(K^2)≤−0.05346K2+o(K2)

Proved
Apery.range_tail

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

With c(k)=log⁡kc(k) = \log kc(k)=logk for primes and 000 otherwise, and LkL_kLk​ the local exponent of the normaliser: for every ε>0\varepsilon > 0ε>0 and all large nnn, the primes K/400<p≤K/20K/400 < p \le K/20K/400<p≤K/20 contribute at most

∑K/400<p≤K/20c(k) (−Lk)  ≤  (−6843153128000000+ε)K2,K=40n,\sum_{K/400 < p \le K/20} c(k)\,\bigl(-L_k\bigr) \;\le\; \Bigl(-\frac{6843153}{128000000} + \varepsilon\Bigr) K^2, \qquad K = 40n,K/400<p≤K/20∑​c(k)(−Lk​)≤(−1280000006843153​+ε)K2,K=40n,

i.e. −0.0534621…K2-0.0534621\ldots K^2−0.0534621…K2. In the source this is the composition of range2_le (Apery/Growth/Assembly3.lean) with the prime-sum limit tail_psum_limit (Apery/Growth/Assembly4.lean, via psum_piecewise_le and the Abel summation of Apery/PrimeSum.lean), absorbing the error term 107θ(2n)≤4⋅107n10^7\theta(2n) \le 4\cdot 10^7n107θ(2n)≤4⋅107n with θ(y)≤2y\theta(y) \le 2yθ(y)≤2y; the constant is evaluated by the table Apery/Growth/TailPrime.lean (tail_sum_le). Formalization Note The weighted sum is written over integers kkk with the weight cPrime; the range endpoints are the source's n/10n/10n/10 and 2n2n2n.

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

open Finset Filter
Formal statement
namespace Apery

theorem range_tail : ∀ ε : ℝ, 0 < ε → ∀ᶠ n in atTop,
    ∑ k ∈ Ioc (n / 10) (2 * n), cPrime k * (-(Lp n k : ℝ)) ≤
      (-6843153 / 128000000 + ε) * Kr n ^ 2 := by
  sorry

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

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