Chapter 36

Semigroups

[5/0%]
LaTeX
Problem 36.1

Suppose PtP_t is a family of sub-Markov transition probabilities and we define Pˉt\bar{P}_t by (36.12). Show that PtP_t is a family of Markov transition probabilities. Show that PΔ(Xt≠Δ\mathbb {P}^{\Delta }\left(X_t \neq \Delta \right. for some t>0)=0\left.t>0\right)=0, i.e., starting at Δ\Delta, the process stays there forever.

?
Problem 36.2

Show that if Pt(x,A)P_t(x, A) is defined by (19.17), and Ptf(x)=∫f(y)Pt(x,dy)P_t f(x)=\int f(y) P_t(x, d y), then PtP_t maps C0C_0 into C0C_0 -

?
Problem 36.3

Show that (36.14) equals (36.15).

?
Problem 36.4

Show that PtP_t defined by (36.13) satisfies all the parts of Assumption 36.1.

?
Problem 36.5

Suppose {μt,t≥0}\left\{ \mu_t, t \geq 0\right\} is a tight family of probability measures on the real line. Suppose there exists a function ψ:R→C\psi : \mathbb {R} \rightarrow \mathbb {C} such that the Fourier transforms of the μt\mu_t have the following form:

∫eiuxμt(dx)=etψ(u),t≥0,u∈R. \int e^{i u x} \mu _t(d x)=e^{t \psi (u)}, \quad t \geq 0, u \in \mathbb {R} .
?
(1)

Prove that μt\mu_t converges weakly to μ0\mu_0 as t→0t \rightarrow 0. Note that μ0\mu_0 is the same as point mass at 0 .

(2)

Define the operators PtP_t by

Ptf(x)=∫f(x−y)μt(dy).  P_t f(x)=\int f(x-y) \mu _t(d y) \text{. }

Prove that the PtP_t form a strongly continuous semigroup of contraction operators mapping C0C_0 into C0C_0. Conclude that there exists a strong Markov process whose semigroup is given by the PtP_t.

This semigroup is called a convolution semigroup because μt+s=μt∗μs\mu_{t+s}=\mu_t * \mu_s, in the sense of convolution of measures. We will see later that these are associated with Lévy processes.