Two-coefficient reduction of matrix powers ($A^n=a_{n}A+b_{n}I$)

Consider the real matrixThe Cayley-Hamilton theorem gives $A^2=3A-I$. ConsequentlyThusAll four entries come from just two scalar coefficients. If $A^n=a_{n}A+b_{n}I$, multiplying once by $A$ and replacing $A^2$ gives the linear recurrence relationEquivalently $a_{n+2}=3a_{n+1}-a_n$, with $a_0=0,a_1=1$. The appearance of Fibonacci numbers is explained by $A=Q^2$, where $Q=\left(\begin{array}{cc}1& 1\\ 1& 0\end{array}\right)$ advances the Fibonacci recurrence. No eigenvectors need to be computed.

The same identity computes an inverse. Rearrange it as $A(3I-A)=I$, givingThis works because the constant term of this characteristic polynomial is nonzero and the coefficients lie in a field. Generally, when $c_0\ne 0$ over a field, rearranging the Cayley-Hamilton theorem expresses $A^{-1}$ as a polynomial evaluated at a matrix. Over a general commutative ring, a nonzero constant need not be a unit; invertibility requires that extra condition.