On the radical idealizer chain of symmetric orders. (Q1763743)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the radical idealizer chain of symmetric orders.
scientific article

    Statements

    On the radical idealizer chain of symmetric orders. (English)
    0 references
    0 references
    22 February 2005
    0 references
    The radical idealizer of an order \(\Lambda\) over a discrete valuation domain played an important rĂ´le since the early days of integral representation theory. The Russian school (Drozd, Kirichenko, Roiter et al.) called it the multiplier of the radical and used this concept since the sixties of the last century to reduce indecomposable representations of \(\Lambda\) to those of an overorder. In the present paper, the idealizer \(\Lambda':=\text{Id}(\text{rad\,}\Lambda)\) of the radical \(\text{rad\,}\Lambda\) is defined to be the intersection \(O_l(\text{rad\,}\Lambda)\cap O_r(\text{rad\,}\Lambda)\) of the left and right multiplier of \(\text{rad\,}\Lambda\). The author observes first that \(\Lambda'=\Lambda\) holds if and only if \(\Lambda\) is hereditary. So there is a finite chain \(\Lambda\subset\Lambda'\subset\Lambda''\subset\cdots\subset\Gamma\) between \(\Lambda\) and a hereditary overorder \(\Gamma\). For symmetric orders \(\Lambda\), she studies the first two idealizer steps \(\Lambda\subset\Lambda'\subset\Lambda''\). Using Jacobinski's conductor formula, she proves for a non-hereditary indecomposable and symmetric order \(\Lambda\), that \(\text{rad\,}\Lambda\) coincides with the conductor of \(\Lambda'\) in \(\Lambda\). For a group ring \(\Lambda=\mathbb{Z}_pG\) of a \(p\)-group \(G\), she calculates \(\Lambda'\) and \(\Lambda''\) and shows that \(\Lambda'\not=\Lambda\) is hereditary if and only if \(G\cong C_p\), and in case \(\Lambda''\not=\Lambda'\), that \(\Lambda''\) is hereditary if and only if \(|G|=4\). For an Abelian group \(G\), she provides an explicit formula for the number of idealizer steps between \(\Lambda\) and \(\Gamma\).
    0 references
    0 references
    symmetric orders
    0 references
    hereditary orders
    0 references
    Brauer trees
    0 references
    idealizers
    0 references
    indecomposable representations
    0 references
    multipliers
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers