Nonnegative rank-preserving operators (Q2266048): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Leroy B. Beasley / rank | |||
Normal rank | |||
Property / author | |||
Property / author: David A. Gregory / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Norman J. Pullman / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: George Phillip Barker / rank | |||
Normal rank |
Revision as of 03:11, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonnegative rank-preserving operators |
scientific article |
Statements
Nonnegative rank-preserving operators (English)
0 references
1985
0 references
A nonnegative semidomain S is a subset of the nonnegative real numbers which contains 0, 1, and which is closed under addition and multiplication. The authors consider the set of \(m\times n\) matrices with entries in S and transformations T which satisfy a ''linearity'' condition \(T(\alpha x+\beta y)=\alpha Tx+\beta Ty\) except of course \(\alpha\), \(\beta\in S\). If x is an \(m\times n\) matrix with entries from S then the rank of x is the least integer k for which x has a factorization \(x=yz\) where y is \(m\times k\) and z is \(k\times n\) (both y and z have entries from S). A major result is that if T is a linear operator on the \(m\times n\) matrices over S where min(m,n)\(\geq 4\) then T preserves ranks if and only if T preserves ranks 1, 2, and 4.
0 references
field-valued matrices
0 references
nonnegative
0 references
rank preserving operators
0 references
nonnegative semidomain
0 references