Finite Abel summation for reciprocal primes and Chebyshev theta
ProvedTaoFivePrimes.reciprocal_primes_theta_partial_summationanalytic-number-theorypartial-summation
For every real , writing , finite Abel summation gives
This is an exact finite-interval identity: it uses no prime number theorem or numerical prime verification. Applying partial summation with weights and test function proves it. It is the finite-interval input to the theta-tail remainder identity.
Preamble
import Mathlib
Formal statement
theorem TaoFivePrimes.reciprocal_primes_theta_partial_summation (x : ℝ) (hx : 2 ≤ x) :
(∑ p ∈ Nat.primesLE ⌊x⌋₊, 1 / (p : ℝ)) =
(∑ p ∈ Nat.primesLE ⌊x⌋₊, Real.log (p : ℝ)) / (x * Real.log x) +
∫ t in Set.Ioc (2 : ℝ) x,
(∑ p ∈ Nat.primesLE ⌊t⌋₊, Real.log (p : ℝ)) *
(Real.log t + 1) / (t ^ 2 * (Real.log t) ^ 2) := by sorrySource
Abel partial summation, specialized to f(t)=1/(t log t). See R. Vanlalngaia, Explicit Mertens Sums, Integers 17 (2017), A11, p. 9, proof preceding equation (17), https://emis.de/ft/19485.