Cluster k0983
Number bounds for odd levels and a Cayley-type claim
These files mix several small tasks. One is a list of numerical inequalities about a prime l of at least 5 and odd exponents, with formulas like l squared times a constant equals one plus that constant. Another claim says a Cayley-type identity implies a stated theorem. Others split a sum by a valuation (a measure of how divisible a number is by a prime), and show that a certain count is even. The files use power series in many variables and p-adic sizes. Several definitions are Prop-valued claims only. The cluster seems to supply arithmetic bookkeeping for a bound proved elsewhere. Which larger argument they serve is unclear from the statements.
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 numbersPrimes and divisibilityFormal power series: infinite polynomials with no convergenceA stranger way to measure size: ultrametric absolute valuesLinear algebra
Uses
Used by
20 Lean files, main folder Formalism.LocalToGlobal.CharacterGerms.