Cluster k0462
Size bounds for lattices from sums over places
These files state inequalities about how big a lattice is, measured with logarithms. A "place" is a way of measuring size in a number field: either an ordinary absolute value or one tied to a prime. The sampled statements are long chains of "if these bounds hold, then this total is at most that total". One links the size of a dual lattice to a quantity of the original. Others bound a combined sum, and a log bound for a lifted map. Most are definitions of claims (Prop) or results that take other claims as assumptions.
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 integersHilbert spaces, bounded operators, and trace-class operators
References
Bombieri and Gubler, Heights in Diophantine Geometry · ch. 1-2Background reading suggested by the AI namer · unchecked
Uses
Used by
17 Lean files, main folder Formalism.QuotientMetricDivisors.