Let
- E be at most countable and equipped with the discrete topology and E be the Borel σ-algebra on E
- X=(Xn)n∈N0 be a discrete Markov chain with values in (E,E) and distributions (Px)x∈E
- τ0x:=0 and τkx:=inf{n>τk−1x:Xn=x}for x∈E and k∈N
Let ϱ(x,y):=Px[τ1y<∞]=Px[∃n∈N:Xn=y].
I want to prove, that Px[τky<∞]=ϱ(x,y)ϱ(y,y)k−1for all k∈N
using the strong Markov property: Ex[f∘(Xτ+t)t∈N0∣Fτ]=EXτ[f∘X]
for all x∈E, σ(X)-stopping times τ and bounded, E⊗N0-measurable f:EN0→R.
I want to prove (1) by induction over k∈N. Since, k=1 is trivial, we only need to care about k−1→k. Since {τk−1y<∞}∩{τky<∞}={τky<∞}
and {τk−1y<∞}∈Fτk−1y,
we've got Px[τky<∞]=Ex[1{τk−1y<∞}Px[τky<∞∣Fτk−1y]],
by definition of the conditional expectation. Now, I think, that we somehow need to apply (2) with τ=τk−1y to the red term in order to obtain Ex[1{τk−1y<∞}Px[τky<∞∣Fτk−1y]]=Ex[1{τk−1y<∞}ϱ(y,y)],
but I can't figure out how I need to choose f.
No comments:
Post a Comment