sequences and series - Question regarding proof for $sum_{k=0}^nbinom{n-k}{k} = F_{n+1}$

I am currently working through the various properties of the binomial coefficient and was up to the identity

$\sum_{k=0}^n\binom{n-k}{k} = F_{n+1}$

The proof is provided elsewhere on this website, here specifically. I have reproduced the user Adi Dani's proof below.

$$\begin{align} F_{n+1}&=\sum_{k=0}^n\binom{n-k}{k}\\ &=\sum_{k=0}^{n}\Bigg(\binom{n-k-1}{k}+\binom{n-k-1}{k-1}\Bigg)\\ &=\sum_{k=0}^{n-1}\Bigg(\binom{(n-1)-k}{k}+\binom{n-2-(k-1)}{(k-1)}\Bigg)\\ &=\sum_{k=0}^{n-1}\binom{(n-1)-k}{k}+\sum_{k=0}^{n-1}\binom{n-2-(k-1)}{k-1}\\ &=\sum_{k=0}^{n-1}\binom{(n-1)-k}{k}+\sum_{j=0}^{n-2}\binom{(n-2)-j}{j}\\ &=F_{n}+F_{n-1} \end{align}$$

It's all clear to me except for the changing of the index on the summation. How are you able to reduce a summation by one or two members in the series without consequence?

As an addendum to this question, I've noted that the only proofs I've had trouble with so far have involved changing the index on a summation. As such, if anyone had some good resources for looking at summations in more detail (especially if there are exercises) then that would be massively appreciated.

Answer

I believe that proof uses the convention, that $\binom{n}{k} = 0$ for all $k > n$ and for all $k < 0$. This of course means that most of the terms in the sum are equal to zero.

I've annotated the proof for a bit for you.

\begin{align} F_{n+1}&=\sum_{k=0}^n\binom{n-k}{k} \text{ (induction hypothesis) } \\ &=\sum_{k=0}^{n}\Bigg(\binom{n-k-1}{k}+\binom{n-k-1}{k-1}\Bigg) \text{ (recursive formula for binom. coefficients) }\\ &=\sum_{k=0}^{n}\Bigg(\binom{(n-1)-k}{k}+\binom{n-2-(k-1)}{(k-1)}\Bigg)\text{ $(n-2-(k-1)= n-k-1)$} \\
&=\sum_{k=0}^{n-1}\Bigg(\binom{(n-1)-k}{k}+\binom{n-2-(k-1)}{(k-1)}\Bigg)\text{ (the $k=n$ Term is equal to zero)} \\ &=\sum_{k=0}^{n-1}\binom{(n-1)-k}{k}+\sum_{k=0}^{n-1}\binom{n-2-(k-1)}{k-1} \text{ (splitting the sum into two sums) } \\ &=\sum_{k=0}^{n-1}\binom{(n-1)-k}{k}+\sum_{j=-1}^{n-2}\binom{(n-2)-j}{j} \text{ (substitute $j = k-1$) } \\ &=\sum_{k=0}^{n-1}\binom{(n-1)-k}{k}+\sum_{j=0}^{n-2}\binom{(n-2)-j}{j} \text{ (the $j = -1$ Term is equal to zero) } \\
&=F_{n}+F_{n-1} \end{align}

See wikipedia for the recursive formula. The article also mentions the convention I described earlier. In fact it also lists the formula for the Fibonacci numbers as
$$F(n+1) = \sum_{k=0}^{\lfloor{n/2}\rfloor} \binom{n-k}{k}.$$