Cluster k1110
Class number bounds from discriminants and ideal counting
Concrete numerical bounds in number fields. The files bound the logarithm of the class number (size of the ideal class group) by the discriminant (an integer measuring how the field's arithmetic is twisted) and the degree, bound the number of ideals of norm at most M by counting tuples of whole numbers, and bound the discriminant of subfields of cyclotomic fields in terms of the conductor. A window argument turns these into statements on growth in layers of a tower. Several statements combine such bounds with assumptions named SecondBound or HasMuQ. Useful as counting estimates for later steps.
5 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
The ideal class group of a number fieldIdeals, ideal norm and discriminant of a number fieldNumber fields, algebraic integersFinite sets and countingRoots of unity and Kummer generators
References
Neukirch, Algebraic Number Theory · ch. I, sect. 5-6; ch. IIIBackground reading suggested by the AI namer · unchecked
Uses
Used by
22 Lean files, main folder Development.AutomorphicArithmetic.AutomorphicVarieties.LayeredIsomorphisms.