How to prove Fibonacci sequence with matrices? [duplicate]

Solution 1:

Let

$$A=\begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}$$

And the Fibonacci numbers, defined by

$$\begin{eqnarray} F_0&=&0\\ F_1&=&1\\ F_{n+1}&=&F_n+F_{n-1} \end{eqnarray}$$

Then, by induction,

$$A^1=\begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix} = \begin{pmatrix} F_2 & F_1 \\ F_1 & F_0 \end{pmatrix}$$

And if for $n$ the formula is true, then

$$A^{n+1}=A\,A^n=\begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}\begin{pmatrix} F_{n+1} & F_{n} \\ F_{n} & F_{n-1} \end{pmatrix}=\begin{pmatrix} F_{n+1}+F_n & F_{n}+F_{n-1} \\ F_{n+1} & F_{n} \end{pmatrix}=\begin{pmatrix} F_{n+2} & F_{n+1} \\ F_{n+1} & F_{n} \end{pmatrix}$$

So, the induction step is true, and by induction, the formula is true for all $n>0$.

Solution 2:

$$\begin{align} F(n+1) &= 1\,F(n) + 1\,F(n-1)\\ F(n) &= 1\,F(n) + 0\,F(n-1)\\ \\ \begin{bmatrix} F(n+1) \\ F(n) \end{bmatrix} &= \begin{bmatrix} 1 & 1 \\ 1 & 0 \end{bmatrix} \begin{bmatrix} F(n) \\ F(n - 1) \end{bmatrix} \\ \begin{bmatrix} F(n+1) \\ F(n) \end{bmatrix} &= \begin{bmatrix} 1 & 1 \\ 1 & 0 \end{bmatrix}^n \begin{bmatrix} F(1) \\ F(0) \end{bmatrix} \\ \\ \text{as well as} \\ \begin{bmatrix} F(n) \\ F(n-1) \end{bmatrix} &= \begin{bmatrix} 1 & 1 \\ 1 & 0 \end{bmatrix}^n \begin{bmatrix} F(0) \\ F(-1) \end{bmatrix} \\ \\ \text{from which it follows}\\ \begin{bmatrix} F(n+1) & F(n) \\ F(n) & F(n-1) \end{bmatrix} &= \begin{bmatrix} 1 & 1 \\ 1 & 0 \end{bmatrix}^n \begin{bmatrix} F(1) & F(0) \\ F(0) & F(-1) \end{bmatrix} \\ \\ \text{and choosing} \\ F(1) &= 1 \\ F(0) &= 0 \\ F(-1) &= 1 \end{align}$$