What we want to do is perform a dot product type of calculation to calculate each entry in the resulting matrix. We want to take the first row of the first matrix transposed and dot it with the first column of the second matrix:
We do a similar thing to find the second element in the first row:
Can you follow this process and finish this multiplication?
It took me a moment to figure out what Prove It meant!
The "Cayley-Hamilton Theorem" says that every matrix satisfies its own characteristic equation. For this particular matrix, the characteristic equation is .
By the Cayley-Hamilton Theorem, then, and you can create higher powers from that: which cuts the work by half.
It is also true that this matrix has two distinct eigenvalues, and and so have two independent eigenvectors. If we create the matrix P having two independent eigenvectors as columns, where D is the diagonal matrix having the eigenvalues on its main diagonal: .
Then, for all n, and powers of the diagonal matrix is just the diagonal matrix with powers of its original diagonal elements: .