The von Staudt–Clausen theorem
ProvedFamousTheorems.von_staudt_clausenThe von Staudt–Clausen theorem.
For every natural number ,
The Bernoulli numbers are rationals with wildly growing numerators, but their denominators are completely transparent: the denominator of is exactly the product of the primes with dividing , each appearing to the first power. So with , with , and with .
The theorem pins down the -adic valuation of at every prime at once, which is why it underlies the Kummer congruences and the construction of the -adic zeta function. It also explains the irregular primes appearing in Kummer's work on Fermat's Last Theorem: those are detected by the numerators, which this theorem shows are the only mysterious part.
Proved independently by von Staudt and Clausen in 1840.
Formalization note. The sum runs over primes below with , which
captures every relevant prime since forces ; membership in
Set.range Int.cast is integrality inside . The result is Mathlib's
Bernoulli.vonStaudt_clausen.
import Mathlib
namespace FamousTheorems
universe u v
open Filter Set Topology DirectSum
theorem von_staudt_clausen (k : ℕ) :
bernoulli (2 * k) + ∑ p ∈ Finset.range (2 * k + 2) with p.Prime ∧ (p - 1) ∣ 2 * k,
(1 : ℚ) / p ∈ Set.range Int.cast := by sorry
end FamousTheorems