Expansion along the first column gives the characteristic polynomial
Thus the eigenvalue has algebraic multiplicity two. Solving gives and then , leaving arbitrary. Its eigenspace is and has geometric multiplicity one. A diagonalisable matrix needs an eigenvector basis, so is not diagonalisable.
If with invertible, then . Multiplicativity of the determinant gives
The roots of the characteristic polynomial, counted with their multiplicities, are the eigenvalues with their algebraic multiplicities. Thus similar matrices have the same eigenvalues with the same algebraic multiplicities.
The converse is false. The matrices
both have characteristic polynomial , but every matrix similar to is , whereas . Alternatively, their geometric multiplicities for differ.
The Jordan normal form theorem says that every complex square matrix is similar to a direct sum of Jordan blocks, uniquely up to their order. For an eigenvalue , if its blocks have sizes , then its algebraic multiplicity and geometric multiplicity are
and its contribution to the minimal polynomial is . Thus
where is the largest -block size.
For the given matrix,
Moreover,
Hence
The eigenvalue therefore has one Jordan block of size two, so