Divergence of the sum of reciprocals of the primes
ProvedFamousTheorems.sum_prime_reciprocals_divergesDivergence of the sum of reciprocals of the primes. The series
diverges.
Proved by Euler in 1737, this strengthens Euclid's theorem that there are infinitely many primes: the primes are dense enough that the sum of their reciprocals diverges, unlike the sum over the squares. It started analytic number theory. Mertens later sharpened it to .
Formalization note. Mathlib's not_summable_one_div_on_primes. The series is written as the function restricted by Set.indicator to the set of primes (zero elsewhere), and divergence is ¬Summable in .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem sum_prime_reciprocals_diverges : ¬Summable ({p : ℕ | p.Prime}.indicator fun n : ℕ => (1 : ℝ) / n) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `not_summable_one_div_on_primes`. Proof here reduces to that Mathlib result.