Linear preservers of rank permutability (Q1827482): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Sur une généralisation du groupe orthogonal à quatre variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear Preserver Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear preserver problems: A brief introduction and some special techniques / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix semigroups with commutable rank. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Chapter 9: miscellaneous preserver problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simultaneous triangularization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Invertibility of linear maps preserving matrix invariants / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear Preservers That Permute the Entries of a Matrix / rank | |||
Normal rank |
Latest revision as of 19:20, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear preservers of rank permutability |
scientific article |
Statements
Linear preservers of rank permutability (English)
0 references
6 August 2004
0 references
Let \(M_{n}(F)\) be the space of all \(n\times n\) matrices over a field \(F\). A \(k\)-tuple of matrices from \(M_{n}(F)\) is called ``rank permutable'' if the rank of the product of these \(k\) matrices is independent of the order of the factors (the concept arises in the problem of simultaneous triangualization of matrix families). An \(F\)-linear transformation \(T:M_{n}(F)\rightarrow M_{n}(F)\) is said to preserve rank permutability for \(k\)-tuples if, whenever a \(k\)-tuple \((A_{1},\dots,A_{k})\) is rank permutable, then \((T(A_{1}),\dots,T(A_{k}))\) is also rank permutable; it preserves rank permutablity strongly if the reverse implication is also true. The main theorem of the paper is that the following are equivalent: (1) for each \(k\), \(T\) preserves rank permutability strongly for \(k\)-tuples; (2) \(T\) is bijective and, for each \(k\), \(T\) preserves rank permutability for \(k\)-tuples; and (3) there exists an invertible matrix \(P\) and a nonzero scalar \(\alpha\) such that \(T(X)=\alpha PXP^{-1}\)for all \(X\) or \(T(X)=\alpha PX^{t}P^{-1}\) for all \(X\) (where \(X^{t}\) denotes the transpose).
0 references
rank permutability
0 references
linear preserver
0 references