A square matrix is diagonalizable over a specified scalar field if an invertible matrix exists such thatEquivalently, the underlying vector space has a basis of eigenvectors of : those basis vectors are the columns of , and their eigenvalues are the diagonal entries of . Here the field is unless specified otherwise.
Taking determinants of gives , so is singular and has the eigenvalue zero. More strongly, if with , then , so every eigenvalue is zero.
If the nilpotent matrix were diagonalizable, write . Then , hence each diagonal entry of has zero th power and is zero. Thus and . Conversely the zero matrix is diagonal. ThereforeThe conclusion is valid over and also over .
Use the full matrix in the original PDF; the transcription has dropped its middle column. For either matrix, the three-dimensional characteristic polynomial is . Both have zero trace and zero determinant, while and . ConsequentlyFor , a useful check isfor every value of . Thus is a nonzero nilpotent matrix for all ; for example its second column never vanishes. By the preceding result, .
For , the three eigenvalues are distinct and real, so their eigenvectors are linearly independent. An explicit eigenbasis isWith , and . Hence .
A repeated root of the characteristic polynomial alone would not settle diagonalizability; for it is the nonzero nilpotence that completes the argument.
Articles by others on the same topic
There are currently no matching articles.