Sums of diagonalizable matrices
The problem of decomposition of an arbitrary \(n\times n\)-matrix into a sum of diagonalizable matrices is considered. It is shown that every square matrix \(A\) over an arbitrary field \(F\) is a sum of two diagonalizable matrices, except for special choice of the field \(F\) \((F=GF(2))\). In the last case the matrix \(A\) is, generally, a sum of three diagonalizable matrices or of two ones, under fixed conditions. The extent to which the ranks in a diagonalizable sum decomposition of a matrix \(A\) can be prescribed is also investigated. It is proved that the necessary conditions for a matrix \(A\) over an arbitrary field \(F\) to be a sum of two diagonalizable matrices with prescribed ranks are also sufficient when \(F\) is infinite.
- Decompositions of matrices into diagonalizable and square-zero matrices
- Products of diagonalizable matrices
- Representing matrices over fields as square-zero matrices and diagonal matrices
- Sums of two triangularizable quadratic matrices over an arbitrary field
- On some decompositions of matrices over algebraically closed and finite fields
- Reconstructing permutation matrices from diagonal sums
- Matrix Waring problem
- Matrices as Sums of Invertible Matrices
- Sums of two triangularizable quadratic matrices over an arbitrary field
- A useful expansion of the exponential of the sum of two non-commuting matrices, one of which is diagonal
- Dense Sets of Diagonalizable Matrices
- On some decompositions of matrices over algebraically closed and finite fields
- Diagonal Sums of Doubly Substochastic Matrices
- Decompositions of matrices into diagonalizable and square-zero matrices
- Waring problem for matrices over finite fields
- Decompositions of matrices into a sum of invertible matrices and matrices of fixed nilpotence
This page was built for publication: Sums of diagonalizable matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583714)
