I am having trouble understanding the proof of the first return identity. \bigskip
Let $f_n = {{P(S_1 \neq0, S_2 \neq0,...,S_{(n-1)} \neq 0, S_n = 0)}}$, i.e the probability that the simple random walk first returns back to the origin at step $n.$ \bigskip
Let $U_n = P(S_n = 0)$. Then the first return identity states that $$U_n = \sum_{k=0}^{n}{f_{k}U_{n-k}}$$ \bigskip
Now the proof goes like this; Define $A_n = {\{S_n = 0}\}, B_k = {{P(S_1 \neq0, S_2 \neq0,...,S_{(k-1)} \neq 0, S_k = 0)}}.$ \medskip
Then $A_n = \bigcup \limits_{k=1}^{n}{A_{n}\cap B_{k}}$, and since the events are disjoint we can calculate the probabilities by summing, then the rest of the proof is pretty easy to follow. But I don't understand how we can partition $A_n$ in this way. Isn't $A_n \cap B_k = A_n \cap B_n?$ \bigskip
I also do not understand the proof of the recurrence probability, which is the probability that the SRW returns to the origin at some point $n$, i.e the event ${\{S_n = 0 , n \geq 1}\}$, the proof then states that this event is equal to the following; $\bigcup\limits_{n=1}^{\infty}${first return to 0 occurs at step n}, and I also don't understand this.
Any help would be appreciated.