Euler's evaluation of ζ(2k)
ProvedFamousTheorems.euler_zeta_even_valuesEuler's evaluation of . For every integer ,
where is the -th Bernoulli number.
For this is the Basel problem , solved by Euler in 1734, and for it gives . The formula shows that every is a rational multiple of , in contrast with the odd values , about which little is known.
Formalization note. Mathlib's hasSum_zeta_nat. The series is indexed by all n : ℕ, but its term is in Lean, so it is the usual sum over . bernoulli is Mathlib's Bernoulli numbers (with , irrelevant here since only even indices appear).
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem euler_zeta_even_values {k : ℕ} (hk : k ≠ 0) :
HasSum (fun n : ℕ => 1 / (n : ℝ) ^ (2 * k))
((-1) ^ (k + 1) * 2 ^ (2 * k - 1) * Real.pi ^ (2 * k) * (bernoulli (2 * k) : ℝ) / ((2 * k).factorial : ℝ)) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `hasSum_zeta_nat`. Proof here reduces to that Mathlib result.