Cluster k0012
Lengths of kernels and cokernels over discrete valuation rings
Files bounding the "length" of kernels and cokernels of maps between modules over a discrete valuation ring (a ring with a single prime, like the p-adic integers). The length counts how many simple layers a module has. One statement says the torsion in a cokernel is at most as long as the module of the ring modulo a certain constant. Another assembles bounds column by column through a chain of submodules. Further files deal with power series, truncated series counting and valuations of products with factorial bounds. The pieces fit a single linear-algebra-over-valuation-rings theme.
5 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 itChain complexes, homology and exact sequencesValuation rings and lattices over themPolynomialsInfinite seriesReal analysis
References
Atiyah and Macdonald, Introduction to Commutative Algebra · ch. 6 and 9Background reading suggested by the AI namer · unchecked
Uses
Used by
37 Lean files, main folder Formalism.JumpKernelCokernel.JumpShiftProofs.