Linear operators strongly preserving idempotent matrices over semirings (Q1183140)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Linear operators strongly preserving idempotent matrices over semirings
scientific article

    Statements

    Linear operators strongly preserving idempotent matrices over semirings (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    Let \(S\) be a semiring, let \(M_ n(S)\) be the set of \(n\times n\) matrices over \(S\). A linear operator \(T\) on \(M_ n(S)\) is said to be strongly \(r\)-potent preserving if \(T(X)^ r=T(X)\) if and only if \(X^ r=X\). These operators form a semigroup \(\mathcal S\). In this paper we have \(r=2\). If \(S=\{0,1\}\) is the 2-element Boolean algebra then \(\mathcal S\) is generated by the transposition and the similarity operators \(X\mapsto PXP^ t\), \(P\) a permutation matrix. If \(S\) is antinegative (i.e. no element \(\neq 0\) has an additive inverse) and free of zero divisors then \(\mathcal S\) is generated by the transposition, the similarity operators \(X\mapsto AXA^{-1}\) and those operators \(T_ A(X)=A\circ X\) that are contained in \(\mathcal S\) (\(\circ\) denotes the Hadamard product). If moreover each element of \(S\) is idempotent then such operators \(T_ A\) occur only for \(n=2\).
    0 references
    0 references
    idempotent matrices over semirings
    0 references
    semiring
    0 references
    \(r\)-potent preserving
    0 references
    semigroup
    0 references
    Boolean algebra
    0 references
    Hadamard product
    0 references
    fuzzy matrices
    0 references
    Boolean zero-one matrices
    0 references