Cluster k0941
Semisimple-letter criterion and slot hypotheses for lifting
These sixteen short files give "slots", named hypotheses of a lifting argument, and bridge lemmas among them. One states that a semisimple-letter theorem holds exactly when a condition holds for every member of a family. Others package hypotheses called step, mixed-slot, up-position and down-slot, each of the shape "given admissible data, a claim holds", and a valuation of a product of terms of the form one minus a power of a unit. Nearly everything is a definition of a claim or an implication between claims. The mathematical content is a p-adic valuation count. Names are the project's own, so details are uncertain.
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
Discrete valuation rings: numbers with one prime, and reducing mod itA stranger way to measure size: ultrametric absolute valuesp-adic numbers
Uses
Used by
18 Lean files, main folder Formalism.SharpRestriction.LevelLetterCocycles.