Standard transition semigroups and regularity of jump processes
[14/29%]Let be a homogeneous standard (i.e., as ) Markov chain with a finite or countable state space and transition probabilities , considered in its separable modification, and let be its infinitesimal matrix:
Let for a state . Then the probability that the process stays in this state for a positive time is zero, i.e., having entered this state, the process leaves it instantly.
Let be a homogeneous standard (i.e., as ) Markov chain with a finite or countable state space and transition probabilities , and let be its infinitesimal matrix:
Prove that if and only if as uniformly in (or, equivalently, as uniformly in ).
Give an example of transition probabilities for which the standardness condition (49) does not hold.
Definition 9. A homogeneous Markov chain (or the semigroup generated by it) is called standard if as , i.e., for all
where, as usual, is the Kronecker symbol.
Give an example where property (49) holds but (89) does not.
Condition (89), where are the entries of the infinitesimal matrix :
Definition 9. A homogeneous Markov chain (or the semigroup generated by it) is called standard if as , i.e., for all
where, as usual, is the Kronecker symbol.
Let the state space consist of a finite number of elements, and let the transition matrix be standard. Prove that then this matrix admits the following representation:
where the matrix satisfies the condition
Conversely, if conditions (95) hold for a matrix , then formula (94) defines a standard matrix of transition probabilities.
The backward system of Kolmogorov equations for the transition probabilities of a homogeneous Markov chain with infinitesimal matrix has the form
and the forward system has the form
Equations (65) and (72) can be understood either in the narrow sense (i.e., that all are continuous for and the equations under study hold for all ), or in the broad sense, i.e., that are absolutely continuous and the equations under consideration hold for almost all (with respect to Lebesgue measure) .
Prove that for the systems of Kolmogorov equations both interpretations given above (in the narrow and in the broad sense) are equivalent. For the forward equations this exercise should be classed among the very difficult ones.
Let be a matrix with real entries, where is countable, such that
The backward and forward systems of Kolmogorov equations for the matrices , , have, respectively, the form
and
(see also Exercise 34). Prove that if , then both systems of Kolmogorov equations have a unique solution.
Let be a continuous-time Markov chain with countable state space and semigroup . Show that is a continuous function of . Let ; show that is a continuous function, , and . We say that is 'subadditive', and a well known theorem gives the result that
Deduce that the limit exists.
Prove that the transition probabilities of a standard stochastic semigroup are uniformly continuous on .
Let , be a homogeneous Markov process with countably many states . Prove that if the transition functions are continuous at , then they are uniformly continuous for .
Let and , be two homogeneous Markov processes with countably many states, and the corresponding transition functions. Prove that if for some and all and , for , then for all .
Let , be a homogeneous Markov process with finitely many states and transition functions . Prove that the determinant of the matrix with entries , is positive for all .
Let , be a homogeneous Markov process with finitely many states and transition functions . Suppose that is continuous for all . Prove that the finite limits
exist, and .
Give an example of a homogeneous Markov process with countably many states for which the finite limits
exist, but .
Show that there is no Markov process , , with two states and trajectories almost surely continuous, whose transition probabilities equal .