Large indecomposables over representation-infinite orders and algebras. (Q1764935)

From MaRDI portal
Revision as of 01:21, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Large indecomposables over representation-infinite orders and algebras.
scientific article

    Statements

    Large indecomposables over representation-infinite orders and algebras. (English)
    0 references
    0 references
    22 February 2005
    0 references
    Let \(R\) be a complete discrete valuation domain with field of fractions \(K\) and let \(\Lambda\) be an \(R\)-algebra, which is a finitely generated free \(R\)-module and suppose that \(K\cdot\Lambda=A\) is a semisimple \(K\)-algebra. Such an algebra \(\Lambda\) is called an \(R\)-order. A generalized \(\Lambda\)-lattice is an \(R\)-free \(\Lambda\)-module. A generalized lattice is a lattice if it is finitely generated over \(R\). Otherwise the generalized lattice is called large. Large lattices may have very strange properties, as is given in a series of illuminating examples. In previous work the author introduced a theory of ``ladders''. A straight forward construction has morphisms between lattices as objects and morphisms between these objects are given by commutative diagrams. A ladder functor is then a certain endo-functor in this category together with a right adjoint \(L^-\) and natural transformations \(1\to L^-\) and \(L\to 1\). The main result of the paper under review is that given a monomorphism \(f\colon E\to F\) between generalized lattices, so that applying the inverse lattice functor \(L^-\) and the natural transformation \(1\to L^-\) iteratively will never produce isomorphic morphisms of lattices, then there is an infinite sequence of kernels \(E_i\to E_{i+1}\) so that each \(E_i\) is a indecomposable direct summand of some starting lattice of the morphism \(L^{-n}f\) and so that the inductive limit of this sequence is an indecomposable large \(\Lambda\)-lattice. As an application the author shows that \(\Lambda\) admits only a finite number of indecomposable lattices if and only if every generalized \(\Lambda\)-lattice decomposes into \(\Lambda\)-lattices. This generalizes a result proved by Auslander for Artinian algebras over fields.
    0 references
    generalized lattices over orders
    0 references
    representation finite orders
    0 references
    infinitely generated lattices
    0 references
    coproducts of lattices
    0 references
    localisations
    0 references
    indecomposable lattices
    0 references
    ladder functors
    0 references

    Identifiers