arXiv · 1608.02503
Each n-by-n matrix with n>1 is a sum of 5 coninvolutory matrices
Abstract
An $n\times n$ complex matrix $A$ is called coninvolutory if $\bar AA=I_n$ and skew-coninvolutory if $\bar AA=-I_n$ (which implies that $n$ is even). We prove that each matrix of size $n\times n$ with $n>1$ is a sum of 5 coninvolutory matrices and each matrix of size $2m\times 2m$ is a sum of 5 skew-coninvolutory matrices. We also prove that each square complex matrix is a sum of a coninvolutory matrix and a condiagonalizable matrix. A matrix $M$ is called condiagonalizable if $M=\bar S^{-1}DS$ in which $S$ is nonsingular and $D$ is diagonal.
Explore related subjects
Keep this discovery
Ma. Nerissa M. Abara, Dennis I. Merino, Vyacheslav I. Rabanovich, Vladimir V. Sergeichuk, John Patrick Sta. Maria. 2016-08-08. Each n-by-n matrix with n>1 is a sum of 5 coninvolutory matrices. https://doi.org/10.1016/j.laa.2016.07.011
Cite the original work for its findings. Save a collection to share your selection of sources.