Cluster k0419
Slopes of lattices and Harder-Narasimhan filtrations
This cluster studies a lattice together with its slope, the degree divided by the rank, where degree is the minus-log-covolume of the lattice. The statements say that sublattices have a degree and rank, that saturated sublattices (not a proper piece of a larger one of the same rank) satisfy degree additivity in quotients, that slope behaves well for products, and that maximal slope is at most the minimal slope in a precise sense. A layer-cake integral formula and some Gaussian coefficient bounds also appear. It looks like a lattice version of the Harder-Narasimhan stability theory, used for estimates later on.
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
Lattices in n dimensions, covolume and counting pointsLinear algebraReal analysis
References
Bost, Periodes et isogenies des varietes abeliennes sur les corps de nombres (Seminaire Bourbaki 795) · sec. 4 (slopes of hermitian vector bundles)Background reading suggested by the AI namer · unchecked
Uses
Used by
- Chow forms, dimension of polynomial quotients, toric dimensionComplex analytic sets and Chow heights
- Degrees of Hermitian bundles, filtrations and field changeComplex analytic sets and Chow heights
- Ball domains, Haar pushforward and adapted frames for CM familiesHodge lower bounds via plurisubharmonic potentials
- Counting sublattices and index bounds, mixed estimatesHermitian lattice counts and unitary mass
- Local lattice bases, Fourier kernels and Cartan-type lattice mapsHermitian lattice counts and unitary mass
- Lengths, saturation and lattices over discrete valuation ringsHermitian lattice counts and unitary mass
- Chain parameters, weighted means and grid valuation boundsHermitian lattice counts and unitary mass
- Nuclear-norm bounds, lattice counting and slope estimatesHermitian lattice counts and unitary mass
- Slopes and heights of lattices (Harder-Narasimhan style)Hermitian lattice counts and unitary mass
- Counting frames in lattices with bounded Gram dataHermitian lattice counts and unitary mass
- Koszul and Eagon-Northcott exactness for polynomial ringsPolynomial representations of GL and Fock spaces
- Host field data, class number lemmas and Galois descent for embeddingsHecke characters and primes in progressions
- Proofs: Flag MeasuresSiegel lattices: root thresholds and gauge shifts
- Definitions: Automorphic MembershipCubical line bundles and theta laws
- Divisibility: Generator PowersSiegel theta transformation and cusp form evaluation
- Sharp Restriction: DivisibilityGlobal interpolation and Satake parameters
43 Lean files, main folder Formalism.HarderNarasimhan.HarderNarasimhanProofs.