Two-point differentiation for general orders (Q1587977)

The author extends A.~G.~Zavadskij's two-point differentiation algorithm for posets to the situation of lattices over an order in a (not necessarily semisimple) finite-dimensional algebra over a field that is complete with respect to a discrete valuation. For a suitable morphism \(u\) of \(\Lambda\)-lattices, there is a derived order \(\delta_u\Lambda\) and a functor \(\partial_u\) from \(\Lambda\)-lattices to \(\delta_u\Lambda\)-lattices that yields an equivalence of categories modulo finitely many indecomposable lattices at either end.