Differentiation and splitting for lattices over orders
We extend our module-theoretic approach to Zavadskiĭ’s differentiation techniques in representation theory. Let R be a complete discrete valuation domain with quotient field K, and Λ an R-order in a finite-dimensional K-algebra. For a hereditary monomorphism u: P ↪ I of Λ-lattices we have an equivalence of quotient categories which generalizes Zavadskiĭ’s algorithms for posets and tiled orders, and Simson’s reduction algorithm for vector space categories. In this article we replace u by a more...