A peak reduction functor for socle projective representations (Q1355644)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A peak reduction functor for socle projective representations
scientific article

    Statements

    A peak reduction functor for socle projective representations (English)
    0 references
    0 references
    0 references
    5 November 1998
    0 references
    The authors study representations of \(r\)-peak finite posets, namely of those posets with \(r\) maximal elements. The representations considered mainly by the authors are socle projective modules and prinjective modules over the incidence algebra of the given poset. Recall that a module \(X\) is called prinjective if the kernel of the map from the projective cover of \(X\) to \(X\) is a semisimple projective module. For posets with at most 2 peaks, a characterization of tame prinjective type has been discussed by Nazarova and the authors, respectively, but for posets with arbitrary number of maximal elements, this is an open question. Keeping this in mind, the authors associate with any poset \(J\) and a maximal element \(q\) a socle projective algebra \(A\), and provide a functor from the category of all socle projective representations of \(J\) to the category of all socle projective modules over \(A\). They call this functor a peak reduction functor and show as main result of the paper that a peak reduction functor is always full, dense and preserves and reflects tame representation type. Moreover, some special posets \(J\) are investigated in detail.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    partially ordered sets
    0 references
    socle projective modules
    0 references
    vector space categories
    0 references
    representations of posets
    0 references
    prinjective modules
    0 references
    incidence algebras
    0 references
    tame representation type
    0 references
    peak reduction functors
    0 references
    0 references
    0 references