If \(M\) and \(N\) are in \(M(n,\mathbb{C})\) and have the same rank, then there exist \(P\) and \(Q\) in \(GL(n,\mathbb{C})\) such that \(PMQ=N\). It is shown that \(P\) and \(Q\) can be chosen to be similar, or, equivalently, that there exist invertible matrices \(R\) and \(S\) such that \(RSMSR=N\).
Recommendations
Cited in
(6)- Sweeping-similarity of matrices
- An NC^ 2 algorithm for testing similarity of matrices
- scientific article; zbMATH DE number 4134226 (Why is no real title available?)
- Similarity of matrices under SL(n,K)
- The rank of the difference of matrices with prescribed similarity classes
- The rank conditions such that AB and BA are similar and applications
This page was built for publication: Similarity and matrices of constant rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124924)