is diagonalizable when has a basis of eigenvectors (matrix: similar to a diagonal matrix); trigonalizable when its matrix in some basis is upper triangular.
Examples
Example 3.8 (Diagonalization put to work)
, with the all-ones matrix: from (Example 2.19), , with eigenspaces and the plane : dimensions , diagonalizable (Theorem 3.6 (2)). Powers without any change-of-basis matrix: with the projector onto ,
(Check : .) The closing insight: when the eigenspaces are visible, spectral projectors compute powers faster than ever will — and the formula displays the dynamics: grows like along and stays put on the orthogonal plane.
Example 3.10 (Trigonalizing by hand)
: , and is the line spanned by : one eigenvalue, a one-dimensional eigenspace — not diagonalizable, but trigonalizable (Theorem 3.9). Complete the basis with and compute:
so in the basis the matrix is . The closing insight: the diagonal of was forced (both entries must be the double eigenvalue ); only the corner entry depended on the choice of , and rescaling can make it any nonzero value — the resistant “” is the shadow of the nilpotent part that Dunford will isolate.
Example 3.4 (Same , different geometry)
The matrices
share the characteristic polynomial , the trace, the determinant, the spectrum — yet are not similar: the first has of dimension (geometric multiplicity ), the second of dimension . The characteristic polynomial sees only algebraic multiplicities; the eigenspace dimensions are the finer invariant, and the minimal polynomial arbitrates ( versus ). Moral for all diagonalizability discussions: shortlists the candidates, but kernels cast the votes.