Cluster k0438
Mean height descent, divisor inequalities and hook-log bounds
This cluster contains explicit inequalities. One sums heights over places under a branch sandwich; one bounds the log of a hook product of a Young diagram (a staircase-shaped array of boxes) by factorial-type terms; one joint inequality combines many real parameters involving degrees and covolumes; another bounds a covolume in terms of average degree over a totally complex number field. A "divisor inequality" theorem is assembled in three steps, with an error-absorption helper. The files share vocabulary of logs and degrees but I cannot see a single mathematical object beyond that.
3 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
Number fields, algebraic integersLattices in n dimensions, covolume and counting pointsReal analysisFinite sets and counting
Uses
Used by
30 Lean files, main folder Formalism.MeanHeightDescent.AverageDegreeBounds.