Linear maps preserving rank less than or equal to one (Q3755578)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4004368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear maps preserving rank less than or equal to one |
scientific article; zbMATH DE number 4004368 |
Statements
Linear maps preserving rank less than or equal to one (English)
0 references
1987
0 references
rank preserving transformation
0 references
K-space
0 references
K-linear transformations
0 references
0.8560420274734497
0 references
0.8560417890548706
0 references
0.8213560581207275
0 references
0.8170406818389893
0 references
0.8150811791419983
0 references
Let M(m,n;K) denote the K-space of all \(m\times n\) matrices over a field K. The author considers the problem of determining the K-linear transformations L: M(m,n;K)\(\to M(p,q;K)\) with the property that any matrix of rank at most 1 is mapped by L onto a matrix of rank at most 1. It is readily seen that any L of the form \(L(X)=UXV\) or \({}^ t(UXV)\) for fixed matrices U and V of suitable sizes has the required property (t denotes the transpose). The author shows that, on the other hand, every L with the required property can be constructed as follows (with possibly an added final transposition): for fixed \(a_ i\in K\), and linear functionals \(L_ j\) on M(m,n;K), define the (i,j)th entry of L(X) by \(L(X)_{ij}=a_ iL_ j(X)\). The corresponding problem where ''rank at most 1'' is replaced by ''rank at most k'' is left as an open question.
0 references