Even over the complex numbers there are matrices that aren't diagonalizable, like [[2,1],[0,2]].
> Even over the complex numbers there are matrices that aren't diagonalizable, like [[2,1],[0,2]].
While that's completely true, and I'm glad someone said it, it's not much of an issue for 2×2 matrices. You can tell quickly when it's happened, because the characteristic polynomial is a square (itself easily tested by computing the gcd with the derivative … or just because it's easy to recognize when a quadratic is a perfect square) but the matrix isn't scalar; and then we have that the semisimple part S is scalar, the nilpotent part N satisfies N^2 = 0, and so (S + N)^n equals S^n + n S N^{n - 1} for n > 1.
(All real symmetric, or more generally Hermitian matrices are diagonalizable, which is the Spectral Theorem.)
But it would be interesting to mention that that's what this method is doing, just using that, in the distinct-eigenvalues case, A - \beta I maps onto the \alpha-eigenspace, so you can simply apply it instead of explicitly finding eigenvectors. (In fact, every time I teach linear algebra, one of my students discovers this trick, though usually accidentally thinking that they are finding \beta-eigenvectors, rather than \alpha-eigenvectors, by applying A - \beta I instead of computing its kernel.)
That's actually what's happening here for the distinct-eigenvalues case: (A - \beta I)/(\alpha - \beta) is the projection on the \alpha-eigenspace, where A^n acts by \alpha^n, with kernel the \beta-eigenspace; and similarly with \alpha and \beta switched. In general, pursuing this same line of attack underlies the proof that the semisimple part of A can be written as a polynomial in A. (Sadly, the polynomial itself depends on A, so this is probably more usefully stated as that the semisimple part of A lies in k[A] if k is perfect.)