Cluster k0443
Chain parameters, weighted means and grid valuation bounds
This cluster states numerical inequalities about "chains" of lattices indexed by parameters, with a weighted mean claim, a trace-square bound for compressions of matrices, a grid valuation bound over primes, and a statement that sizes in a model chain eventually hold for large x. A slope inequality for lattices is also used. Everything is stated with many explicit real parameters. Some files restate earlier hypotheses. The goal looks like controlling an average over places for the main argument.
2 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
Real analysisLinear algebraChebyshev functions theta and psiFinite sets and countingLattices in n dimensions, covolume and counting points
Uses
Used by
29 Lean files, main folder Formalism.SizeWindowBrackets.