\(\tau\)-categories. I: Ladders. (Q2490349): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10468-005-0968-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087244123 / rank
 
Normal rank

Revision as of 23:01, 19 March 2024

scientific article
Language Label Description Also known as
English
\(\tau\)-categories. I: Ladders.
scientific article

    Statements

    \(\tau\)-categories. I: Ladders. (English)
    0 references
    0 references
    2 May 2006
    0 references
    This is the first of three important papers on categories with almost split sequences, and their application to lattices over orders. In this first paper, the author introduces \(\tau\)-categories which allow a unified treatment of categories of representations of Cohen-Macaulay orders up to the critical dimension 2. In contrast to right almost split sequences \(\tau X\overset\nu\rightarrowtail\theta X@>\mu>>X\) for an isolated singularity in the sense of Auslander, it is not assumed that \(\nu\) is monic. So the generalized Auslander-Reiten sequences \(\tau X\to\theta X\to X\) in a \(\tau\)-category \(\mathcal C\) are not destroyed by passing to a quotient category \({\mathcal C}/[C]\) unless \(\theta X\in [C]\). The theory developed in this first paper is applied in the third one [Algebr. Represent. Theory 8, No. 5, 601-619 (2005; Zbl 1091.16012)], where it yields a purely combinatorial characterization of finite Auslander-Reiten quivers of classical orders. In the present paper, the ladder formalism, first introduced by Igusa and Todorov, is developed further, and a general Radical Layers Theorem for arbitrary \(\tau\)-categories is proved. This leads to a structure theorem for \(\tau\)-categories in terms of \(\tau\)-species. Invertible ladders play an important rôle for the structural analysis of categories of lattices over an order. Amazingly, it turns out that the two kinds of ladders needed for this investigation, allow a purely combinatorial description. For the purpose of representation-theory, the methods developed in the paper are very general and apply, in particular, to length-finite modules over Artinian rings, which are much easier to handle than lattices over orders.
    0 references
    0 references
    Auslander-Reiten theory
    0 references
    \(\tau\)-categories
    0 references
    ladders
    0 references
    radical layers
    0 references
    mesh categories
    0 references
    Auslander-Reiten quivers
    0 references
    categories of projective lattices
    0 references
    almost split sequences
    0 references
    translation quivers
    0 references
    lattices over orders
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references