Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Abel summation for the sum of reciprocals of primes

Proved
LL_Decomp1528b.abel_recip

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

number-theory

For real x,yx,yx,y with 2≤y≤x2\le y\le x2≤y≤x, let A(t)=∑p≤tlog⁡p/pA(t)=\sum_{p\le t}\log p/pA(t)=∑p≤t​logp/p over primes ppp up to ⌊t⌋\lfloor t\rfloor⌊t⌋. Then ∑⌊y⌋<p≤⌊x⌋1/p=A(x)/log⁡x−A(y)/log⁡y+∫yxA(t)/(tlog⁡2t) dt\sum_{\lfloor y\rfloor<p\le\lfloor x\rfloor}1/p = A(x)/\log x - A(y)/\log y + \int_y^x A(t)/(t\log^2 t)\,dt∑⌊y⌋<p≤⌊x⌋​1/p=A(x)/logx−A(y)/logy+∫yx​A(t)/(tlog2t)dt, the sum being over primes.

Preamble
import Mathlib

open Real Finset Filter Topology
Formal statement
namespace LL_Decomp1528b
theorem abel_recip {x y : ℝ} (hy : 2 ≤ y) (hyx : y ≤ x) :
    ∑ p ∈ (Ioc ⌊y⌋₊ ⌊x⌋₊).filter Nat.Prime, (1 : ℝ) / p =
      (∑ p ∈ Nat.primesLE ⌊x⌋₊, log p / p) / log x -
        (∑ p ∈ Nat.primesLE ⌊y⌋₊, log p / p) / log y +
        ∫ t in y..x, (∑ p ∈ Nat.primesLE ⌊t⌋₊, log p / p) / (t * log t ^ 2) := by sorry
end LL_Decomp1528b
Source
Rosser and Schoenfeld, Illinois J. Math. 6 (1962), Section 4, p. 74 style; Montgomery and Vaughan, Multiplicative Number Theory I, Thm 2.7(d) proof
Read-back

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

Read-back: abel_recip

Let xxx and yyy be real numbers with 2≤y≤x2 \le y \le x2≤y≤x. Then

∑p prime⌊y⌋<p≤⌊x⌋1p=1log⁡x∑p primep≤⌊x⌋log⁡pp−1log⁡y∑p primep≤⌊y⌋log⁡pp+∫yx1t (log⁡t)2∑p primep≤⌊t⌋log⁡pp dt.\sum_{\substack{p \text{ prime} \\ \lfloor y \rfloor < p \le \lfloor x \rfloor}} \frac{1}{p} = \frac{1}{\log x}\sum_{\substack{p \text{ prime} \\ p \le \lfloor x \rfloor}} \frac{\log p}{p} - \frac{1}{\log y}\sum_{\substack{p \text{ prime} \\ p \le \lfloor y \rfloor}} \frac{\log p}{p} + \int_y^x \frac{1}{t\,(\log t)^2}\sum_{\substack{p \text{ prime} \\ p \le \lfloor t \rfloor}} \frac{\log p}{p}\, dt.p prime⌊y⌋<p≤⌊x⌋​∑​p1​=logx1​p primep≤⌊x⌋​∑​plogp​−logy1​p primep≤⌊y⌋​∑​plogp​+∫yx​t(logt)21​p primep≤⌊t⌋​∑​plogp​dt.

Symbols:

  • ⌊z⌋\lfloor z \rfloor⌊z⌋ is the largest natural number not exceeding zzz.
  • ppp ranges over primes. Since ppp is a whole number, ⌊y⌋<p\lfloor y \rfloor < p⌊y⌋<p means y<py < py<p, so the left sum is over the primes in (y,x](y, x](y,x].
  • log⁡\loglog is the natural logarithm.
  • ∫yx\int_y^x∫yx​ is the integral from yyy to xxx of the function t↦1t(log⁡t)2∑p≤⌊t⌋log⁡ppt \mapsto \frac{1}{t(\log t)^2}\sum_{p \le \lfloor t \rfloor}\frac{\log p}{p}t↦t(logt)21​∑p≤⌊t⌋​plogp​.

Quantifiers and hypotheses: xxx and yyy are universally quantified. The hypotheses are 2≤y2 \le y2≤y and y≤xy \le xy≤x, which together force x≥2x \ge 2x≥2.

Edge cases:

  • Since y≥2y \ge 2y≥2, log⁡y>0\log y > 0logy>0 and log⁡x≥log⁡y>0\log x \ge \log y > 0logx≥logy>0, so both divisions are by positive numbers.
  • On t∈[y,x]t \in [y, x]t∈[y,x], t≥2t \ge 2t≥2, so the integrand is well defined.
  • When x=yx = yx=y, the left sum is empty and the integral is zero, so both sides equal 000.
  • The hypotheses are satisfiable, so the statement is not vacuous.
Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

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