Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tail prime-sum limit: psum (xF+27/16) 20 400 K/K2≤−6843153/128000000+δ\mathrm{psum}\,(xF+27/16)\,20\,400\,K/K^2 \le -6843153/128000000 + \deltapsum(xF+27/16)20400K/K2≤−6843153/128000000+δ

Proved
Apery.tail_psum_limit

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

analysisformalizationirrationalitynumber-theoryzeta5-mo271

For every δ>0\delta > 0δ>0 and all sufficiently large real KKK,

1K2∑K/400<p≤K/20p (KpF(Kp)+2716)log⁡p  ≤  −6843153128000000+δ,\frac{1}{K^2}\sum_{K/400 < p \le K/20} p\,\Bigl(\frac{K}{p}F\Bigl(\frac{K}{p}\Bigr) + \frac{27}{16}\Bigr)\log p \;\le\; -\frac{6843153}{128000000} + \delta,K21​K/400<p≤K/20∑​p(pK​F(pK​)+1627​)logp≤−1280000006843153​+δ,

i.e. the tail prime sum is at most −0.0534621…K2+o(K2)-0.0534621\ldots K^2 + o(K^2)−0.0534621…K2+o(K2). This is tail_psum_limit of Apery/Growth/Assembly4.lean; it is obtained from the piecewise-linear majorant tT/gT built on the grid ti=20+i/3t_i = 20 + i/3ti​=20+i/3 (i≤1140i \le 1140i≤1140) via psum_piecewise_le (Abel summation + the prime number theorem), and the numerical evaluation tail_sum_le of Apery/Growth/TailIntegral.lean (two integrations by parts per piece with telescoping). Formalization Note The statement is the source's; psum and Ftail are the platform definitions.

Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceGrowth

open Finset Filter
Formal statement
namespace Apery

/-- The tail prime-sum limit (`Apery/Growth/Assembly4.lean`). -/
lemma tail_psum_limit {δ : ℝ} (hδ : 0 < δ) :
    ∀ᶠ K : ℝ in atTop, psum (fun x => x * Ftail x + 27 / 16) 20 400 K / K ^ 2 ≤
      -6843153 / 128000000 + δ := by
  sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Growth/Assembly4.lean#L63-L94 (via Apery/Growth/TailIntegral.lean)

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