Cluster k0963
Size and shape bounds for Frobenius-orbit words over thick places
These files study words (ordered strings of letters, each tied to a place of a number field and a Frobenius orbit) and show they satisfy numerical bounds. Statements include a bound that gives a least power depth, a box or size bound on page words, results that "thick" embeddings (large-size ones) cannot be too numerous in a short orbit, and a dichotomy for inert primes (primes that stay prime in an extension). One file bounds quantities for primes at least eleven. Most of this is inequality bookkeeping under a "roomy" size hypothesis. It reads like combinatorial support for a larger design of parameters rather than a conceptual result.
4 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 integersFinite sets and countingIdeals, ideal norm and discriminant of a number fieldReal analysis
Uses
Used by
82 Lean files, main folder Development.AbelianVarietyTheory.Proofs.SatakeParameters.