Cluster k1091
Bernoulli numbers and Dirichlet characters
Statements about Bernoulli numbers (a famous sequence of fractions that appears in sums of powers and in values of zeta-like functions) and their versions twisted by Dirichlet characters, which are multiplication-compatible functions on whole numbers mod N. The visible results include a parity rule for characters (a sign condition at -1), identities for sums over residues mod N, a bound on a sum of logarithms of primes dividing a number, and facts about denominators of generalised Bernoulli numbers. The cluster looks like a library of explicit arithmetic facts feeding the cyclotomic-field and class-group parts.
4 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
Dirichlet charactersPrimitive characters, conductorModular arithmeticPrimes and divisibilityFormal power series: infinite polynomials with no convergence
References
Washington, Introduction to Cyclotomic Fields · ch. 4Background reading suggested by the AI namer · unchecked
Uses
Used by
45 Lean files, main folder Development.AutomorphicArithmetic.AutomorphicVarieties.GaloisLibrary.BernoulliNumbers.