Hi I am trying to understand a proof in a paper (written by Isaac Sonin), I don't know if anyone could give me a clarification on the following:
Firstly we have a Markov chain $\{Y\_k\}$ with finite state space $X\_1$ and a probability transition matrix $P\_1=\{p\_1(x,y)\}$. Let $D \subset X\_1$ and $\tau\_1, \tau\_2, ..., \tau\_n, ...$ the sequence of first, second and so on time visits of the Markov chain to the set $X\_2=X\_1\setminus D$. Let $u\_1^{X\_2}(x,.)$ be the distribution of the Markov chain at the moment of first visit to set $X\_2$. Then we have the first result (which I understand):
1) The random sequence $\{Y\_{\tau\_k}\}$ is a Markov chain in a model with state space $X\_2$ and transition probability given by:
\begin{equation} (Eq1) \quad
p\_2(x,y)= p\_1(x,y)+ \sum\_{z \in D} p\_1(x,z)u\_1^{X\_2}(z,y) \quad x, y \in X\_2
\end{equation}
Now, consider $H\_1$ (resp $H\_2$) the set of all trajectories for the Markov chain $\{Y\_k\}$ (resp $\{Y\_{\tau\_k}\}$) with state space $X\_1$ (resp $X\_2$) and $\mathcal{B}\_1$ (resp $\mathcal{B}\_2$) the corresponding $\sigma - algebra$.
Introduce the mapping: $F: H\_1 \rightarrow H\_2$ by $F(x\_0x\_1...x\_s...)= (x\_{\tau\_1} ...x\_{\tau\_k}...)$, i.e all $x\_i \in D$ are deleted from the trajectory $(x\_0x\_1...x\_s...)$ in $H\_1$. Then the author write as proposition that using Equation (Eq1) we have:
$P\_2(x,B)=P\_1(x,F^{-1}(B))$ for all $B \in \mathcal{B}\_2$. Intuitively, I think I can somehow give sense to the equality but I could not write a formal proof although the writer says it is clear. 
Thanks



Markov Chain: state reduction
Before starting you have to note that the definition of $P\_2$ and $P\_1$ at the end of the question are not the same as the definitions at the top of the question. At the top, they're matrices, whereas at the bottom, they are probability measures on $H\_1$ and $H\_2$. More specifically, $P\_1(x,B)$ means $\mathbb P((X\_1,X\_2,X\_3,X\_4,\ldots)\in B|X\_0=x)$, where the family of variables $(X\_i)\_{i\ge 0}$ is the Markov chain with transition matrix $P\_1$.


It's enough to check the equality for `cylinder' sets $B\in \mathcal B\_2$. Specifically, it suffices to check the condition for $B$ of the form $\lbrace x\in X\_2^{\mathbb N}\colon x\_1=a\_1,\ldots,x\_k=a\_k\rbrace$ for arbitrary $k>0$ and any $a\_1,\ldots,a\_k$. You then can describe $F^{-1}B$ as the set of all sequences in $H\_1$ where $a\_1,\ldots,a\_k$ are the first $k$ entries in $X\_2$. 


You should then be able to check that $P\_1(x\_0,F^{-1}B)=p\_2(x\_0,a\_1)p\_2(a\_1,a\_2),\ldots,p\_2(a\_{k-1},a\_k)$ just by summing over the possible paths in $H\_1$ going through the $X\_2$ states $a\_1,\ldots,a\_k$ in that order.


