If is a unipotent matrix, is a nilpotent matrix. If for a nonzero eigenvector, then for some , forcing .
Conversely, suppose the only eigenvalue is . Over , the characteristic polynomial is then . The Cayley-Hamilton theorem gives , so is nilpotent. Thus is unipotent if and only if its only eigenvalue is one.
Choose an invertible change-of-basis matrix so that is the Jordan normal form of . Write each block aswhere has ones on its first superdiagonal and all other entries zero. DefineEvery because is invertible, so is an invertible diagonal matrix. The matrix is strictly upper triangular and hence nilpotent. On each block is a scalar multiple of the identity, so it commutes with on that block and therefore on the whole space. This gives
For , conjugating givesBecause commutes with , and ,Thus is similar to a nilpotent matrix, and is itself nilpotent. Therefore is a unipotent matrix.
The definition gives . The matrix is invertible and diagonalizable. In the same basis is , which commutes with because does. Conjugating back givesThis is the multiplicative Jordan decomposition in an affine algebraic group, here applied to the general linear group. The explicit construction also handles repeated eigenvalues and nontrivial Jordan blocks.
Articles by others on the same topic
There are currently no matching articles.