Cluster k0780
Formal group systems and lattice tuples, growth bounds
A mid-sized group of files about "systems" built from formal groups (power series acting like an addition law over p-adic numbers) together with tuples of lattices (regular grids of points). The sampled statements are small bookkeeping facts: a certain quantity is positive, an operation is zero at the first step, a lattice tuple stays a lattice tuple after a group element acts, and one claim about expansions multiplying. Others are named bounds on growth. The words "Pend" and "adm" are the project's own labels and I cannot tell what they mean. It looks like supporting machinery for the p-adic side of the theta argument, not a headline 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
p-adic numbersFormal power series: infinite polynomials with no convergenceLattices in n dimensions, covolume and counting pointsGroup actions: orbits, stabilizers, fixed points
References
Hazewinkel, Formal Groups and Applications · ch. IBackground reading suggested by the AI namer · unchecked
Uses
Used by
45 Lean files, main folder Formalism.SharpRestriction.GrowthBounds.MultisetValuation.