Linear preservers for matrix inequalities and partial orderings (Q5943027)

From MaRDI portal
Revision as of 18:45, 3 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1642115
Language Label Description Also known as
English
Linear preservers for matrix inequalities and partial orderings
scientific article; zbMATH DE number 1642115

    Statements

    Linear preservers for matrix inequalities and partial orderings (English)
    0 references
    19 May 2002
    0 references
    Let \(M_{n}(F)\) denote the algebra of \(n\times n\) matrices over the field \(F\). The author calls a linear transformation \(T\) of \(M_{n}(F)\) into itself of ``standard form'' if \(T\) either has the form \(X\mapsto AXB\) or the form \(X\mapsto AX^{T}B\) for some fixed invertible matrices \(A\) and \(B\). There have been many papers by a series of authors in which it has been shown that transformations \(T\) which preserve a wide variety of properties of \(M_{n}(F)\) are necessarily of standard form [see, for example, \textit{C.-K. Li} and \textit{N.-K. Tsing}, Linear Algebra Appl. 162-164, 217-235 (1992; Zbl 0762.15016)]. In the present paper the author considers the partial ordering \(\preceq\) on \(M_{n}(F)\) defined by \(A\preceq B\) when \(rank(B-A)=rank(B)-rank(A).\) (This is called the rank-subtractivity ordering and is equivalent to the minus ordering). He shows that, provided \(\left|F\right|>n\), every invertible linear transformation \(T\) of \(M_{n}(F)\) which preserves \(\preceq\) is of standard form, and also proves a number of related results.
    0 references
    0 references
    minus-order
    0 references
    rank-subtractivity order
    0 references
    linear preservers
    0 references
    matrix inequalities
    0 references
    partial orderings
    0 references
    linear transformation
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references