Ideal counting: average of the coefficients of
ProvedClassNumberFormula.ideal_count_asymptoticclass-number-formulanumber-theory
Let be a number field with real places, complex places, regulator , class number , roots of unity and discriminant . Then the number of nonzero ideals of of norm at most satisfies
In the source this is the lattice-point step of the general proof: the count is reduced, through the real and complex embeddings and Dirichlet's unit theorem, to counting lattice points in a region, which is approximated by the volume of the region.
Formalization Note The condition excludes the zero ideal, whose norm is in Mathlib.
Preamble
import Mathlib open NumberField NumberField.InfinitePlace NumberField.Units Filter Topology Real
Formal statement
namespace ClassNumberFormula
theorem ideal_count_asymptotic (K : Type*) [Field K] [NumberField K] :
Tendsto (fun N : ℕ =>
(Nat.card {I : Ideal (𝓞 K) // 1 ≤ Ideal.absNorm I ∧ Ideal.absNorm I ≤ N} : ℝ) / N)
atTop (𝓝 ((2 : ℝ) ^ nrRealPlaces K * (2 * π) ^ nrComplexPlaces K * regulator K *
classNumber K / (torsionOrder K * Real.sqrt |(discr K : ℝ)|))) := by sorry
end ClassNumberFormulaSource
Wikipedia, "Class number formula" (revision oldid=1366411311), https://en.wikipedia.org/w/index.php?title=Class_number_formula&oldid=1366411311, section "Proof", fourth paragraph (general case: reduction to a lattice point count)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.