Abel summation for the sum of reciprocals of primes
ProvedLL_Decomp1528b.abel_recipnumber-theory
For real with , let over primes up to . Then , 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_Decomp1528bSource
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 and be real numbers with . Then
Symbols:
- is the largest natural number not exceeding .
- ranges over primes. Since is a whole number, means , so the left sum is over the primes in .
- is the natural logarithm.
- is the integral from to of the function .
Quantifiers and hypotheses: and are universally quantified. The hypotheses are and , which together force .
Edge cases:
- Since , and , so both divisions are by positive numbers.
- On , , so the integrand is well defined.
- When , the left sum is empty and the integral is zero, so both sides equal .
- The hypotheses are satisfiable, so the statement is not vacuous.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.