Let $X_0,X_1,\ldots$ be a Markov chain with state space $\mathbb{Z}$. Now I found in a textbook that we have $$ \mathbb{P}(X_{n+1} \in A \mid X_n = i, (X_{0},X_1,\ldots,X_{n-1}) \in B) = \mathbb{P}(X_{n+1} \in A \mid X_n = i) $$ for all $n \in \mathbb{N}$, $i \in \mathbb{Z}$, $A \subset \mathbb{Z}$, $B \subset \mathbb{Z}^n$. This was given as a Proposition without a proof? How can we prove it and what is the difference to the original Markov property for Markov chain?
2026-03-27 21:16:55.1774646215
General Markov property
266 Views Asked by user562724 https://math.techqa.club/user/user562724/detail At
1
There are 1 best solutions below
Related Questions in MARKOV-CHAINS
- Calculating probabilities using Markov chains.
- Probability being in the same state
- Random walk on $\mathbb{Z}^2$
- Polya's Urn and Conditional Independence
- Markov Chain never reaches a state
- Finding a mixture of 1st and 0'th order Markov models that is closest to an empirical distribution
- Find probability function of random walk, stochastic processes
- Generating cycles on a strongly connected graph
- Will be this random walk a Markov chain?
- An irreducible Markov chain cannot have an absorbing state
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
A similar proposition is proved in chapter 1 of “Introduction to Stochastic Processes” by Hoel (page 12), using the solution of exercise 4 of the very same chapter. I will solve the exercise and show how it can be used to prove your proposition.
Let's consider a probability space $(\Omega,F,\mathbb{P})$, and assume the sets mentioned belong to $F$. We want to prove that if $D_k$ are disjoint and $\mathbb{P}(C \mid D_k) = p$ independently of k, then $\mathbb{P}(C \mid \cup_{k}D_k) = p$.
Note that: $$\mathbb{P}(C \mid \cup_{k}D_k) = \frac{\mathbb{P}(C \cap (\cup_{k}D_k))}{\mathbb{P}(\cup_{k}D_k)}= \frac{\sum_{k}{\mathbb{P}(C \cap D_k)}}{\sum_{k}{\mathbb{P}(D_k)}}= \frac{\sum_{k}{\mathbb{P}(C \mid D_k)\mathbb{P}(D_k)}}{\sum_{k}{\mathbb{P}(D_k)}} = \frac{p\sum_{k}{\mathbb{P}(D_k)}}{\sum_{k}{\mathbb{P}(D_k)}} =p $$
Now that we proved that, let's go back to your initial proposition.
Let $B_k = (X_o=i^{(k)}_0,...,X_{n-1} =i^{(k)}_{n-1})$, such that $B = \cup_{k}{B_k}$, and $B_k$ are disjoint. Since we have a Markov chain:
$$ \mathbb{P}(X_{n+1} \in A \mid \{{ X_n =i\}} \cap B_k)=\mathbb{P}(X_{n+1} \in A \mid X_o=i^{(k)}_0,...,X_n=i) =\mathbb{P}(X_{n+1} \in A \mid X_n = i) = p~,$$ independently of $k$.
So what we have to show is that:
\begin{align} \mathbb{P}(X_{n+1} \in A \mid \{{ X_n =i\}} \cap (\cup_{k}{B_k})) &= \mathbb{P}(X_{n+1} \in A \mid X_n=i,(X_o,...,X_{n-1}) \in B) \\ &= \mathbb{P}(X_{n+1} \in A \mid X_n=i) \end{align}
Therefore, the proof to your proposition is achieved by making $C = \{{X_{n+1}\in A\}}$ and $D_k = \{{\{{ X_n =i\}} \cap {B_k}\}}$, and applying the solution previously demonstrated.