This paper extends Wiener-Hopf factorization theory to finite time-inhomogeneous Markov chains with general time-dependent generator matrices, broadening the scope beyond previous piecewise constant cases.
Contribution
It develops a Wiener-Hopf type factorization for finite Markov chains with general time-dependent generators, advancing the theoretical framework for inhomogeneous processes.
Findings
01
Derived Wiener-Hopf factorization for general time-inhomogeneous Markov chains.
02
Extended previous results from piecewise constant to general generator functions.
03
Provided new mathematical tools for analyzing inhomogeneous Markov processes.
Abstract
This work contributes to the theory of Wiener-Hopf type factorization for finite Markov chains. This theory originated in the seminal paper Barlow et al. (1980), which treated the case of finite time-homogeneous Markov chains. Since then, several works extended the results of Barlow et al. (1980) in many directions. However, all these extensions were dealing with time-homogeneous Markov case. The first work dealing with the time-inhomogeneous situation was Bielecki et al. (2018), where Wiener-Hopf type factorization for time-inhomogeneous finite Markov chain with piecewise constant generator matrix function was derived. In the present paper we go further: we derive and study Wiener-Hopf type factorization for time-inhomogeneous finite Markov chain with the generator matrix function being a fairly general matrix valued function of time.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · advanced mathematical theories · Advanced Queuing Theory Analysis
Full text
Wiener-Hopf Factorization for Time-Inhomogeneous Markov Chains
Department of Applied Mathematics, Illinois Institute of Technology
W 32nd Str, John T. Rettaliata Engineering Center, Room 208, Chicago, IL 60616, USA
(First Circulated: February 24, 2019 )
[TABLE]
1 Introduction
The main goal of this paper is to develop a Wiener-Hopf type factorization for finite time-inhomogeneous Markov chains. In order to motivate this goal, we first provide a brief account of the Wiener-Hopf factorization for time-homogeneous Markov chains based on [BRW80].
Towards this end, consider a finite state space E with cardinality m, and let Λ be a sub-Markovian generator matrix of dimension m×m, that is, Λ(i,j)≥0, i=j, and ∑j∈EΛ(i,j)≤0. Next, let v be a real valued function on E, such that v(i)=0 for all i∈E, and define
[TABLE]
We also denote by m± cardinality of E±, and we let V:=diag{v(i):i∈E} be the diagonal matrix of dimension m×m. Finally, let I and I± denote the identity matrices of dimensions m×m and m±×m±, respectively. Using probabilistic methods, the following result was proved in [BRW80].
For any c>0, there exists a unique pair of matrices (Πc+,Πc−) of dimensions m−×m+ and m+×m−m respectively, such that the matrix
[TABLE]
is invertible and the following factorization holds true
[TABLE]
where Qc± are m±×m± sub-Markovian generator matrices. Moreover, Πc± are strictly substochastic.
The right-hand side of (1.1) is said to constitute the Wiener-Hopf factorization of the matrix V−1(Q−cI). While the factorization (1.1) is algebraic in its nature, it admits a very important probabilistic interpretation, which leads to very efficient computation of some useful expectations. More precisely, let X be a time-homogeneous Markov chain taking values in E∪∂, where ∂ is a coffin state, with generator Λ. For t≥0, we define the additive functional
Both Theorems 1.1 and 1.2 have been studied for more general classes of Markov process, as well as for various types of stopping times, that naturally occur in applications (cf. [KW90], [APU03], [Wil08], [MP11], and references therein). However, in all these studies the Markov processes have been assumed to be time-homogeneous.
As it turns out, the time-inhomogeneous case is more intricate, and direct (naive) generalizations or applications of the time-homogenous case to the non-homogenous case can not be done in principle. Specifically, let now X be a finite state time-inhomogeneous Markov chain taking values in E∪∂, with generator function Λs, s≥0. The first observation that one needs to make is that the Wiener-Hopf factorization of the matrix V−1(Λs−cI) can be done for each s≥0 separately, exactly as described in Theorem 1.1. However, the resulting matrices Πc±(s) and Qc±(s), s≥0, are not useful for computing the expectations of the form
[TABLE]
where
[TABLE]
This makes the study of the time-inhomogeneous case a highly nontrivial and novel enterprise. As it will be seen from the discussion presented below, an entirely new theory needs to be put forth for this purpose. The research effort in this direction has been originated in [BCGH18]. This work contributes to the continuation of the research endeavor in this direction.
2 Setup and the main goal of the paper
2.1 Preliminaries
Throughout this paper we let E be a finite set, with ∣E∣=m>1. We define E:=E∪{∂}, where ∂ denotes the coffin state isolated from E. Let (Λs)s∈R+, where R+:=[0,∞), be a family of m×m generator matrices, i.e., their off-diagonal elements are non-negative, and the entries in their rows sum to zero. We additionally define Λ∞:=0, the m×m matrix with all entries equal to zero.
We make the following standing assumption:
Assumption 2.1**.**
**
(i)
There exists a universal constant K∈(0,∞), such that ∣Λs(i,j)∣≤K, for all i,j∈E and s∈R+.
(ii)
(Λs)s∈R+, considered as a mapping from R+ to the set of m×m generator matrices, is continuous with respect to s.
Let v:E→R with v(i)=0 for any i∈E and v(∂)=0, V:=diag{v(i):i∈E}, v:=maxi∈E∣v(i)∣, and v:=mini∈E∣v(i)∣. We will use the following partition of the set E
[TABLE]
We assume that both E+ and E− are non-empty, and that the indices of the first m+=∣E+∣ (respectively, last m−=∣E−∣) rows and columns of any m×m matrix correspond to the elements in E+ (respectively, E−). Accordingly, we write Λs and V in the block form
[TABLE]
In what follows we let X:=R+×E, and X±:=R+×E±). The Borel σ-field on X (respectively, X±) is denoted by B(X):=B(R+)⊗2E (respectively, B(X±):=B(R+)⊗2E±). Accordingly, we let X:=X∪(+∞,∂) (respectively, X±:=X±∪(+∞,∂)) be the one-point completion of X (respectively, X±), and let B(X):=σ(B(X)∪{(∞,∂)}) (respectively, B(X±):=σ(B(X±)∪{(∞,∂)})). A pair (s,i)∈X consists of the time variable t and the space variable s.
We will also use the following notations for various spaces of real-valued functions:
•
L∞(X) is the space of B(X)-measurable, and bounded functions f on X, with g(+∞,∂)=0.
•
C0(X) is the space of functions f∈L∞(X) such that f(⋅,i)∈C0(R+) for all i∈E, where C0(R+) is the space of functions vanishing at infinity.
•
Cc(X) is the space of functions f∈L∞(X) such that f(⋅,i)∈Cc(R+) for all i∈E, where Cc(R+) is the space of functions with compact support.
•
C01(X) is the space of functions f∈C0(X) such that, for any i∈E, ∂f(⋅,i)/∂s exists and belongs to C0(R+) (for convenience, we stipulate that ∂f(∞,∂)/∂s=0).
•
Cc1(X) is the space of functions f∈Cc(X) such that, for any i∈E, ∂f(⋅,i)/∂s exists (for convenience, we stipulate that ∂f(∞,∂)/∂s=0).
Sometimes X will be replaced by X+ or X− when the functions are defined on these spaces, in which case the set E will be replaced by E+ or E−, respectively, in the above definitions. Note that each function on X can be viewed as a time-dependent vector of size m, which can be split into a time-dependent vector of size m+ (a function on X+) and a time-dependent vector of size m− (a function on X−).
We conclude this section by introducing some more notations, this time for operators:
•
Λ:L∞(X)→L∞(X) is the multiplication operator associated with (Λs)s∈R+, defined by
[TABLE]
•
Similarly, we define multiplication operators A:L∞(X+)→L∞(X+), B:L∞(X−)→L∞(X+), C:L∞(X+)→L∞(X−), and D:L∞(X−)→L∞(X−), associated with the blocks (As)s∈R+, (Bs)s∈R+, (Cs)s∈R+, and (Ds)s∈R+ given in (2.1), respectively.
Given the above, for any111The superscript T will be used to denote the transpose of a vector or matrix. g=(g+,g−)T∈L∞(X), where g±∈L∞(X±), we have
[TABLE]
2.2 A time-inhomogeneous Markov family corresponding to (Λs)s∈R+ and related passage times
We start with introducing a time-inhomogeneous Markov Family corresponding to (Λs)s∈R+. Then, we proceed with a study of some passage times related to this family.
2.2.1 A time-inhomogeneous Markov family M∗ corresponding to (Λs)s∈R+
We take Ω∗ as the collection of E-valued functions ω∗ on R+, and F∗:=σ{Xt∗,t∈R+}, where X is the coordinate mapping X⋅∗(ω∗):=ω∗(⋅). Sometimes we may need the value of ω∗∈Ω∗ at infinity, and in such case we set X∞∗(ω∗)=ω∗(∞)=∂, for any ω∗∈Ω∗. We endow the space (Ω∗,F∗) with a family of filtrations Fs∗:={Fts,∗,t∈[s,∞]}, s∈R+, where, for s∈R+,
[TABLE]
and F∞∞,∗:={∅,Ω∗}. We denote by
[TABLE]
a canonical time-inhomogeneous Markov family. That is,
•
Ps,i∗ is a probability measure on (Ω∗,F∞s,∗) for (s,i)∈X;
•
the function P∗:X×R+×2E→[0,1] defined for 0≤s≤t≤∞ as
[TABLE]
is measurable with respect to i for any fixed s≤t and B∈2E;
•
Ps,i∗(Xs∗=i)=1 for any (s,i)∈X;
•
for any (s,i)∈X, s≤t≤r≤∞, and B∈2E, it holds that
[TABLE]
Let U∗:=(Us,t∗)0≤s≤t<∞ be the evolution system (cf. [Bot14]) corresponding to M∗ defined by
[TABLE]
for all functions (column vectors) f:E→R.222Note that for t∈R+, Xt∗ takes values in E. We assume that
[TABLE]
for all f:E→R.
It is well known that a standard version of the Markov family M∗ (cf. [GS04, Definition I.6.6]) can be constructed. This is done by first constructing via Peano-Baker series the evolution system U∗=(Us,t∗)0≤s≤t<∞ that solves
[TABLE]
Since Λt is a generator matrix, Us,t∗ is positive preserving and contracting with Us,t∗1m=1m. In addition, due to Assumption 2.1-(i) and (2.6), it holds for any 0≤s<t and r∈(0,t−s) that
[TABLE]
and
[TABLE]
for some positive constant C, so that Us,t∗ is strongly continuous in s and t. The above, together with the finiteness of the state space, implies that U∗ is a Feller evolution system. The corresponding standard version can then be constructed (cf. [GS04, Theorem I.6.3]).
In view of the above, we will consider the standard version of M∗ in what follows, and, for simplicity, we will preserve the notation M∗={(Ω∗,F∗,Fs∗,(Xt∗)t≥s,Ps,i∗), (s,i)∈X}, in which Ω∗ is restricted to the collection of E-valued càdlàg functions ω∗ on R+ with ω∗(∞)=∂.
2.2.2 Passage times related to M∗
For any s∈R+, we define an additive functional ϕ⋅∗(s) as
[TABLE]
and we stipulate ϕ∞∗(s,ω∗)=∞ for every ω∗∈Ω∗. In addition, for any s∈R+ and ℓ∈R+, we define associated passage times
[TABLE]
Both τℓ+,∗(s) and τℓ−,∗(s) are Fs∗-stopping times since, ϕ⋅∗(s) is Fs∗-adapted, has continuous sample paths, and Fs∗ is right-continuous (cf. [JS03, Proposition 1.28]). For notational convenience, if no confusion arises, we will omit the parameter s in ϕt∗(s) and τℓ±,∗(s).
The following result will be used later in the paper.
Lemma 2.2**.**
For any s∈R+, ℓ∈R+, and ω∗∈Ω∗, Xτℓ±,∗(s)∗(ω∗)∈E±∪{∂}. In particular, if τℓ±,∗(s,ω∗)<∞, then Xτℓ±,∗(s)∗(ω∗)∈E±.
Proof.
We will only prove the “+” version of the lemma; a proof of the “−” version proceeds in an analogous way.
To begin with, for any ω∗∈Ω∗ such that τℓ±,∗(s,ω∗)=∞, clearly we have Xτℓ±,∗(s)∗(ω∗)=X∞∗(ω∗)=ω∗(∞)=∂. Next, suppose that for some ω0∗∈Ω∗ and s0,ℓ0∈R+, τℓ0+,∗(s0,ω0∗)<∞ and Xτℓ0+,∗(s0)∗(ω0∗)∈E−. By the definition of ϕ∗, we have ϕτℓ0+,∗(s0)∗(ω0∗)=ℓ0. Moreover, since X⋅(ω0∗) is right-continuous, there exists ε0>0, such that for any t∈[τℓ0+,∗(s0,ω0∗),τℓ0+,∗(s0,ω0∗)+ε], Xt∗(ω0∗)∈E−. Hence, for any t∈[τℓ0+,∗(s0,ω0∗),τℓ0+,∗(s0,ω0∗)+ε], ϕt∗(ω0∗)≤ℓ0, which contradicts the definition of τℓ+,∗.
∎
Remark 2.3*.*
Here is an example where {τℓ+,∗=∞} has a positive probability. Consider E={1,−1}, v(±1)=±1, and
[TABLE]
Then, for any s∈R+ and ℓ>0,
[TABLE]
2.3 The main goal of the paper
Our main interest is to derive a Wiener-Hopf type method for computing expectations of the following form
[TABLE]
for g±∈L∞(X±), ℓ∈R+, and (s,i)∈X. In view of Lemma 2.2, it is enough to compute the expectation in (2.7) for g±∈L∞(X±) in order to compute the analogous expectation for g∈L∞(X).
The Wiener-Hopf type method derived in this paper generalizes the Wiener-Hopf type method of [BRW80] that was developed for the time-homogeneous Markov chains.
Remark 2.4*.*
The time-homogeneous version of the problem of computing the expectation of the type given in (2.7) appears frequently in time-homogeneous fluid models (see e.g. [Rog94] and the references therein). Time inhomogeneous extensions of such models is important and natural due to temporal (seasonal) effect, for example. This is one practical motivation for the study presented in this paper.
In order to proceed, we introduce the following operators:
•
J+:L∞(X+)→L∞(X−) is defined as
[TABLE]
Clearly, for any g+∈L∞(X+), ∣(J+g+)(s,i)∣≤∥g+∥L∞(X+)<∞ for any (s,i)∈X−, and (J+g+)(∞,∂)=0, so that J+g+∈L∞(X−).
•
J−:L∞(X−)→L∞(X+) is defined as,
[TABLE]
•
For any ℓ∈R+, Pℓ+:L∞(X+)→L∞(X+) is defined as
[TABLE]
•
For any ℓ∈R+, Pℓ−:L∞(X−)→L∞(X−) is defined as,
[TABLE]
•
For any (s,i)∈X+, we define
[TABLE]
for any g+∈C0(X+) such that the limit in (2.12) exists and is finite.
•
For any (s,i)∈X−, we define
[TABLE]
for all g−∈C0(X+) such that the above limit in (2.13) exists and is finite.
Remark 2.5*.*
For g+∈L∞(X+), ℓ∈(0,∞), and (s,i)∈X−, it can be shown that
[TABLE]
Similarly, for g−∈L∞(X−), ℓ∈(0,∞), and (s,i)∈X+, we have
[TABLE]
The identity (2.14) will be verified in Remark 4.5 below, while (2.15) can be proved in an analogous way with v replaced by −v.
In view of (2.8)−(2.11) and (2.14)−(2.15), the expectation of the form (2.7) for any g±∈L∞(X±), ℓ∈R+, and (s,i)∈X, can be represented in terms of the operators J± and Pℓ±.
3 Main Results
We now state the main results of this paper, Theorem 3.1 and Theorem 3.2. Theorem 3.1 is analytical in nature, and it provides the Wiener-Hopf factorization for the generator V−1(∂/∂s+Λ). This factorization is given in terms of operators (S+,H+,S−,H−) showing in the statement of the theorem. Theorem 3.2 is probabilistic in nature, and provides the probabilistic interpretation of the operators (S+,H+,S−,H−), which is key for various applications of our Wiener-Hopf factorization.
Theorem 3.1**.**
Let (Λs)s∈R+ be a family of m×m generator matrices satisfying Assumption 2.1, and let Λ be the associated multiplication operator defined as in (2.2). Let v:E→R with v(i)=0 for any i∈E, v(∂)=0, and V=diag{v(i):i∈E}. Then, there exists a unique quadruple of operators (S+,H+,S−,H−) which solves the following operator equation
[TABLE]
subject to the conditions below:
(a±)
S±:C0(X±)→C0(X∓)* is a bounded operator such that*
(i)
for any g±∈Cc(X±) with suppg±⊂[0,ηg±]×E± for some constant ηg±∈(0,∞), we have suppS±g±⊂[0,ηg±]×E∓;
(ii)
for any g±∈C01(X±), we have S±g±∈C01(X∓).
(b±)
H±* is the strong generator of a strongly continuous positive contraction semigroup (Qℓ±)ℓ∈R+ on C0(X±) with domain D(H±)=C01(X±).*
Theorem 3.2**.**
For any g±∈C0(X±), we have
[TABLE]
where J± and (Pℓ±)ℓ∈R+ are defined in (2.8)−(2.11). Moreover, G+ given in (2.12) is the (strong) generator of (Pℓ+)ℓ≥0 with D(G+)=C01(X+), and G− given in (2.13) is the (strong) generator of (Pℓ−)ℓ≥0 with D(G−)=C01(X−).
The proofs of these two theorems is deferred to Section 4.
By Theorems 3.1 and 3.2, we are able to compute J±g± and Pℓ±g±, for any g±∈C01(X±) and ℓ∈R+, by solving equation (3.1) subject to the conditions (a±) and (b±). In view of Remark 2.5, these functions lead to the expectation of the form (2.7) for any g±∈C01(X±). In particular, for any c>0 and j∈E±, by taking gj±∈C01(X±) with
[TABLE]
we obtain the following Laplace transform for (τℓ±,∗,Xτℓ±,∗∗)
[TABLE]
for any c∈(0,∞), ℓ∈R+, and (s,i)∈X. We then perform the inverse Laplace transform with respect to c to obtain the join distribution of (τℓ±,∗,Xτℓ±,∗∗) under Ps,i∗, which enables us to compute the expectations (2.7) for any g±∈L∞(X±).
Note that the equation (3.1) can be decomposed into the following two uncoupled equations
[TABLE]
Hence, one can compute J+g+ and G+g+ (and thus Pℓ+g+) separately from J−g− and G−g− (and thus Pℓ−g−) by solving (3.3) and (3.4) subject to (a+) and (b+), and (a−) and (b−), respectively.
Remark 3.3*.*
By (2.1), (2.3), and Theorems 3.1 and 3.2, we see that (J+,G+) is the unique solution, subject to (a+) and (b+), to the following two operator equations,
[TABLE]
where g+∈C01(X+).
By plugging (3.5) into (3.6), we obtain the operator Riccati equation of the form
[TABLE]
Hence, in order to compute (J+,G+) from (3.3), one needs first to compute J+ by solving the above operator equation subject to (a+), and then G+ is given in terms of J+ by (3.5). Similarly, one can compute (J−,G−) from (3.4) in an analogous way.
Remark 3.4*.*
The operator
[TABLE]
is the counterpart of the matrix S given in Theorem 1.1. It can be shown that the operator Ψ is injective. However, unlike the matrix S which is invertible, the operator Ψ is not invertible in general. In fact, the surjectivity of Ψ may fail, even when restricted to C01(X) (recall the condition (a+)(ii)). Nevertheless, the potential lack of invertibility of Ψ does not affect the existence and uniqueness of our Wiener-Hopf factorization. It only affects the form of equality (3.1), with S± replaced with J±.
Remark 3.5*.*
When the Markov family M∗ is time-homogeneous, namely, Λs=Λ for all s∈R+, where Λ is an m×m generator matrix, the equation (3.1) reduces to the time-homogeneous Wiener-Hopf factorization (1.1), which, in light of the invertibility of S, can be rewritten as
[TABLE]
In what follows, we will only check the “+” part of the above equality.
Towards this end, for any c∈(0,∞) and j∈E+, take gj+∈C01(X+) as in (3.2). Since (J+,G+) is the unique solution to (3.3) subject to (a+) and (b+), we have
[TABLE]
Since M∗ is a time-homogeneous Markov family, for any s,ℓ∈R+ and i∈E, the distribution of (τℓ+,∗(s)−s,Xτℓ+,∗(s)) under Ps,i∗ is the same as that of (τℓ+,∗(0),Xτℓ+,∗(0)) under P0,i∗. Hence, for any s∈R+ and i∈E+, we have
[TABLE]
where we recall that the matrix Qc+ is defined in (1.3). Similarly, for any s∈R+ and i∈E−,
where ej+ is the j-th m+-dimensional unit column vector. Finally, by evaluating the derivative and taking s=0 on the left-hand side above, we deduce that
From the discussion in Remark 3.5, for each c>0, solving the time-homogeneous Wiener-Hopf equation (1.1) for the matrices (Πc±,Qc±) is equivalent to solving the time-inhomogeneous Wiener-Hopf equation (3.1), subject to the conditions (a±) and (b±), for the operators (J±,G±) with g±∈C01(X±) of the form (3.2). Therefore, for each c∈(0,∞), the uniqueness of (Πc±,Qc±) as a solution to (1.1) corresponds to the uniqueness of (J±,G±) as a solution to (3.1), subject to (a±) and (b±), when g± is restricted to the subclasses of C01(X±) of the form (3.2).
When c=0, the functions g± of the form (3.2) do not belong to C01(X±) anymore. Hence, our uniqueness result does not contradict the non-uniqueness of (Π0±,Q0±) that was shown in [BRW80].
4 Proofs of the main results
In this section we prove Theorems 3.1 and 3.2. We will only give the proofs of the “+” case in both theorems, as the “−” case can be proved in an analogous way with v replaced by −v.
4.1 Auxiliary Markov families
In this subsection, we introduce an auxiliary time-inhomogenous Markov family M and an auxiliary time-homogenous Markov family M. We start by introducing some more notations of spaces and σ-fields. Let Y:=E×R, and the Borel σ-field on Y is denoted by B(Y):=2E⊗B(R). Accordingly, let Y:=Y∪{(∂,∞)} be the one-point completion of Y, and B(Y):=σ(B(Y)∪{(∂,∞)}). Moreover, we set Z:=R+×Y=X×R and Z:=Z∪{(∞,∂,∞)}.
Let Ω be the set of càdlàg functions ω on R+ taking values in Y. We define ω(∞):=(∂,∞) for every ω∈Ω. As shown in Appendix A, one can construct a standard canonical time-inhomogeneous Markov family (cf. [GS04, Definition I.6.6])
[TABLE]
with transition function P given by
[TABLE]
where (s,i,a)∈Z, t∈[s,∞], and A∈B(Y). Furthermore, M has the following properties:
(i)
for any (s,i,a)∈Z,
[TABLE]
(ii)
for any (s,i,a)∈Z,
[TABLE]
Considering the standard Markov family M, for any s,ℓ∈R+, we define
[TABLE]
which is an Fs-stopping time in light of the continuity of φ and the right-continuity of the filtration Fs. By similar arguments as in the proof of Lemma 2.2, for any (s,i,a)∈Z and ℓ∈[a,∞),
[TABLE]
Moreover, it follows from (4.3) that, for any (s,i,a)∈Z,
[TABLE]
If no confusion arise, we will omit the s in τℓ+(s).
Proposition 4.1 provides a useful representation of the expectation \mathbb{E}_{s,i}^{*}\Big{(}g^{+}\Big{(}\tau_{\ell-a}^{+,*},X_{\tau_{\ell-a}^{+,*}}^{*}\Big{)}\Big{)}. We will need still another representation of this expectation. Towards this end, we will first transform the time-inhomogeneous Markov family M into a time-homogeneous Markov family
[TABLE]
following the setup in [Bot14]. The construction of M proceeds as follows.
•
We let Ω:=R+×Ω to be the new sample space, with elements ω=(s,ω), where s∈R+ and ω∈Ω. On Ω we consider the σ-field
[TABLE]
where As:={ω∈Ω:(s,ω)∈A} and F∞s is the last element in Fs (the filtration in M).
•
We let Z=Z∪{(∞,∂,∞)} to be the new state space, where Z=R+×Y=X×R, with elements z=(s,i,a). On Z we consider the σ-field
[TABLE]
where \widetilde{B}_{s}:=\big{\{}(i,a)\in\mathscr{Y}:\,(s,i,a)\in\widetilde{B}\big{\}}. Let B(Z):=σ(B(Z)∪{(∞,∂,∞)}).
•
We consider a family of probability measures (Pz)z∈Z, where, for z=(s,i,a)∈Z,
[TABLE]
•
We consider the process Z:=(Zt)t∈R+ on (Ω,F), where, for t∈R+,
[TABLE]
Hereafter, we denote the three components of Z by Z1, Z2, and Z3, respectively.
•
On (Ω,F), we define F:=(Ft)t∈R+, where Ft:=Gt+ (with the convention G∞+=G∞), and (Gt)t∈R+ is the completion of the natural filtration generated by (Zt)t∈R+ with respect to the set of probability measures {Pz,z∈Z} (cf. [GS04, Chapter I]).
•
Finally, for any r∈R+, we consider the shift operator θr:Ω→Ω defined by
[TABLE]
It follows that Zt∘θr=Zt+r, for any t,r∈R+.
For z=(s,i,a)∈Z, t∈R+, and B∈B(Z), we define the transition function P by
By Lemma A.2, the transition function P, defined in (4.1), is associated with a Feller semigroup, so that P is a Feller transition function. This and [Bot14, Theorem 3.2] imply that P is also a Feller transition function. In light of the right continuity of the sample paths, and invoking [GS04, Theorem I.4.7], we conclude that M is a time-homogeneous strong Markov family.
For any ℓ∈R, we define
[TABLE]
Note that τℓ+ is an F-stopping time since Z3 has continuous sample paths and F is right-continuous. In light of (4.3), (4.5), and (4.6), for any (s,i,a)∈Z, we have
[TABLE]
Consequently, for any (s,i)∈X+ and ℓ∈R,
[TABLE]
Moreover, by (4.4) and (4.8), for any (s,i,a)∈Z and ℓ∈[a,∞), we have
[TABLE]
By Proposition 4.1, (4.5) and (4.6), for any g+∈L∞(X+), (s,i,a)∈Z, and ℓ∈[a,∞),
[TABLE]
which, in particular, implies that
[TABLE]
Consequently, the operators J+ and Pℓ+, ℓ∈R+, defined by (2.8) and (2.10), can be written as
[TABLE]
We conclude this section with the following key lemma, which will be crucial in the proofs of the main results.
Lemma 4.2**.**
Let τ be any F-stopping time, and g+∈L∞(X+). Then, for any (s,i,a)∈Z and ℓ∈[a,∞), we have
[TABLE]
Proof.
Note that if (s,i,a)=(∞,∂,∞), then both sides of (4.15) are zero. Hence, without loss of generality, assume that (s,i,a)∈Z and {τ≤τℓ+}=∅. Note that for any ℓ∈R and ω∈{τ≤τℓ+},
[TABLE]
and thus
[TABLE]
Therefore, for any (s,i,a)∈Z and ℓ∈[a,∞),
[TABLE]
where we used the fact that {τ≤τℓ+}∈Fτ (cf. [KS98, Lemma 1.2.16]) in the first and third equality, and the strong Markov property of Z (cf. [RW94, Theorem III.9.4]) in the last equality.
∎
This is a direct consequence of (4.15) and the fact that {τ≤τℓ+}∈Fτ.
∎
Corollary 4.4**.**
For any g+∈L∞(X+), (s,i,a)∈Z, ℓ∈[a,∞), and h∈(0,∞),
[TABLE]
Proof.
Since g+∈L∞(X+) and τℓ+h+≥τℓ+, g+(Zτℓ+h+1,Zτℓ+h+2)=g+(∞,∂)=0 on {τℓ+=∞}, so that EZτℓ+1,Zτℓ+2,Zτℓ+3(g+(Zτℓ+h+1,Zτℓ+h+2))=0 on {τℓ+=∞}. Moreover, Zτℓ+3=ℓ on {τℓ+<∞}. Thus, using Corollary 4.3, (4.12), (4.14), and (4.4), we obtain that
[TABLE]
where the last equality is due to the fact that (Ph+g+)(∞,∂)=0.
∎
Remark 4.5*.*
We now verify (2.14) using the strong Markov family M. Indeed, by (4.11) and Corollary 4.4, for any g+∈L∞(X+), (s,i)∈X−, and ℓ∈(0,∞),
The following lemma addresses the continuity of f+ with respect to different variables. In particular, due to (4.18) and (4.19), for any g+∈C0(X+), the continuity of J+g+(⋅,i), and P⋅+g+(⋅,i), with respect to each individual variable, is established as special cases of f+.
Recall that, by Assumption 2.1, K is a constant such that sups∈R+,i,j∈E∣Λs(i,j)∣≤K. Additionally, recall that v=mini∈E∣v(i)∣ and v=maxi∈E∣v(i)∣.
Lemma 4.6**.**
For any g+∈C0(X+), f+(⋅,i,⋅) is uniformly continuous on R+2, uniformly for all i∈E. That is, for any ε>0, there exists δ=δ(ε,K,∥g+∥∞,v,v)>0 such that
[TABLE]
Moreover, for any i∈E and ℓ∈R+, f(⋅,i,ℓ)∈C0(R+). In particular, J+g+∈C0(X−) and Pℓ+g+∈C0(X+).
The proof of this lemma is deferred to Appendix B.
4.3 Existence of the Wiener-Hopf factorization
This section is devoted to the proof of the ‘‘+" portion of Theorem 3.1. We do this by demonstrating the existence of solution to (3.3) subject to conditions (a+) and (b+). Recall that J+ and (Pℓ+)ℓ∈R+ are defined as in (2.8) and (2.10), and have the respective representations (4.13) and (4.14) in terms of the time-homogeneous Markov family M; G+ is defined as in (2.12) with respect to (Pℓ+)ℓ∈R+. We will show that (J+,G+) is a solution to (3.3) (which is equivalent to (3.5)−(3.6)) subject to (a+) and (b+). The proof is divided into four steps.
Step 1. In this step show that J+ satisfies the condition (a+)(i).
Let g+∈C0(X+). By Lemma 4.6, we have J+g+∈C0(X−). Moreover, if suppg+⊂[0,ηg+]×E+ for some ηg+∈(0,∞), we have (J+g+)(s,i)=Es,i,0(g+(s+τ0+,Zτ0+2))=0, for any (s,i)∈[ηg+,∞)×E−, which completes the proof in Step 1.
Step 2. Here we will show that (Pℓ+)ℓ∈R+ is a strongly continuous positive contraction semigroup on C0(X+), and thus a Feller semigroup.
Let g+∈C0(X+) and ℓ∈R+. By Lemma 4.6, we have Pℓ+g+∈C0(X+). The positivity and contraction property of Pℓ+ follow immediately from its definition. Hence, it remains to show that (Pℓ+)ℓ∈R+ is a strongly continuous semigroup.
To this end, we fix any (s,i)∈X+. By (4.17) and (4.19), we first have
[TABLE]
Moreover, for any ℓ∈R+ and h>0, by (4.14) and Corollary 4.4, we have
[TABLE]
Hence, (Pℓ+)ℓ∈R+ is a semigroup on C0(X+).
Finally, for any ℓ∈R+ and g+∈C0(X+), by (4.19) and Lemma 4.6, we have
[TABLE]
which shows the strong continuity of (Pℓ+)ℓ∈R+, and thus completes the proof in Step 2.
Step 3. We will show here that G+ is the strong generator of (Pℓ+)ℓ∈R+ with domain C01(X+), and that
[TABLE]
The argument proceeds in two sub-steps: (i) and (ii).
(i) We first show that, for any g+∈C0(X+), the pointwise limit in (2.12) exists for every (s,i)∈X+ if and only if g(⋅,i) is right-differentiable on R+ for each i∈E. Moreover, for such g+, we have
[TABLE]
When (s,i)=(∞,∂), (4.23) is trivial since both sides of the equality are equal to zero. In what follows, fix g+∈C0(X+) and (s,i)∈X+.
Let γ1 be the first jump time of Z2. For any ℓ∈(0,∞), by (4.14) and (D.4), we have
[TABLE]
Clearly,
[TABLE]
if and only if g+(⋅,i) is right-differentiable at s. As for I2(ℓ), (D.1) implies that
[TABLE]
It remains to analyze the limit of I3(ℓ), as ℓ→0+. By (D.5) and (4.15),
[TABLE]
Since Zγ13≤ℓ on {γ1≤τℓ+}, by (4.12) and (4.16), we have
[TABLE]
Thus, we can further decompose I3(ℓ) as
[TABLE]
For I31(ℓ), by (4.6), Lemma 4.6, and (D.2), we have
[TABLE]
where we recall that v=mini∈E∣v(i)∣. To study the limit of I32(ℓ) as ℓ→0+, we first rewrite I32(ℓ) as
[TABLE]
Note that, for any j∈E∖{i}, the probability in (4.29) can be further decomposed as
where the last equality is due to (4.17) and (4.18).
Therefore, from (4.27), (4.28), and (4.34), we have
[TABLE]
Combining (4.24)−(4.26) and (4.35), we conclude that the limit in (2.12) exists for every (s,i)∈X+ if and only if g(⋅,i) is right-differentiable on R+ for each i, and that for such g+∈C0(X+), (4.23) holds true for any (s,i)∈X+.
(ii) We now show that D(G+)=C01(X+). Toward this end we define
[TABLE]
Since (Pℓ+)ℓ∈R+ is a Feller semigroup on C0(X+) (cf. Step 2), it follows from [BSW13, Theorem 1.33] that G+ is the strong generator of (Pℓ+)ℓ∈R+ with D(G+)=L(G+). Hence, we only need to show that L(G+)=C01(X+).
We first show that L(G+)⊂C01(X+). For any g+∈L(G+), it was shown in Step 3 (i) that
[TABLE]
where the right-hand side, as a function of (s,i), belongs to C0(X+). By Lemma 4.6, we have J+g+∈C0(X−). This, together with Assumption 2.1 (ii), ensures that
[TABLE]
as a function of (s,i)∈X+, belongs to C0(X+). Thus, we must have ∂+g+/∂s exists at any (s,i)∈X+, ∂+g+(∞,∂)/∂s=0, and ∂+g+/∂s∈C0(X+). Therefore, ∂g+/∂s exists and belongs to C0(X+), i.e., g+∈C01(X+).
To show C01(X+)⊂L(G+), we first note that for g+∈C01(X+), Step 3 (i) shows that the limit in (2.12) exists for every (s,i)∈X+, and that (4.36) holds true. Since g+∈C0(X+), the same argument as above implies that (4.37), as a function of (s,i), belongs to C0(X+). Hence, G+g+∈C0(X+). The proof in Step 3 is now complete.
Step 4. In this step we will show that J+ satisfies the condition (a+)(ii), that is for any g+∈C01(X+) we have J+g+∈C01(X−). We will also show that
[TABLE]
We fix g+∈C01(X+) for the rest of the proof.
To begin with, we claim that in order to prove J+g+∈C01(X−) and (4.38), it is sufficient to show that
[TABLE]
In fact, since g+∈C01(X+), Step 3 shows that G+g+∈C0(X+). Hence, by Lemma 4.6, we have J+g+∈C0(X−) and J+G+g+∈C0(X−). Given the definition of C and D and invoking Assumption 2.1, we conclude that (−C−DJ++V−J+G+)g+∈C0(X−). Thus, indeed, (4.39) implies that J+g+∈C01(X−) and that (4.38) holds.
To prove (4.39), it is sufficient to consider (s,i)∈X− only, since both sides of (4.39) are equal to zero for (s,i)=(∞,∂). In view of (4.13), we will evaluate
Next, we will analyze the limit of Jk(r), k=1,2,3,4, as r→0+.
We begin with evaluating the limit of J1(r) as r→0+. By (4.5), (4.6), and (4.2), and using the evolution system U∗=(Us,t∗)0≤s≤t<∞ defined as in (2.4), we have
Next, we will study the limits of J2(r) and J3(r) as r→0+. Since i∈E−, Z2 must have at least one jump to E+ before Z3 (which coincides with ∫0⋅v(Zu2)du in view of (4.8)) can upcross the level [math], i.e., Ps,i,0(γ1≤τ0+)=1, where we recall that γ1 denotes the first jump time of Z2. Hence, by (D.2) and Lemma 4.6,
[TABLE]
Moreover, note that \mathbbm1{τ0+≤r}(f+(s+r,Zr2,0)−f+(s+r,Zτ0+2,0)) does not vanish only if Zr2=Zτ0+2, so Z2 must jump at least twice before time r. Hence, by (D.3) and (4.16), we have
[TABLE]
where we recall that γ2 denotes the second jump time of Z2.
Finally, we study the limit of J4(r), as r→0+, by further decomposing J4(r) as
[TABLE]
For J41(r), by (4.5), (4.6), (4.2), and (2.4), we have
[TABLE]
By Assumption 2.1, (2.6), and Lemma 4.6, a similar argument leading to (4.46) shows that
[TABLE]
Hence, noting that g+∈C01(X+)=D(G+), by (4.16) and Corollary 4.4, we have
[TABLE]
Next, since Ps,i,0(γ1≤τ0+)=1 for i∈E−, by Lemma 4.6 and (D.2),
[TABLE]
As for J43(r), since Zu2=Z02 for all u∈[0,r] on {γ1>r}, it follows from (4.8) that Zr3=∫0rv(Zu2)du=v(i)r, Ps,i,0−a.s. on {γ1>r}, and thus
Finally, in view of (4.13), (4.43), (4.47), (4.48), (4.49), and (4.54), for any g+∈C01(X+) and (s,i)∈X−, we get
[TABLE]
Moreover, by (4.17), (4.18), and the definitions of C and D (cf. the end of Section 2.1)
[TABLE]
Putting together (4.55) and (4.3), we deduce (4.39), which completes the proof.
4.4 Uniqueness of the Wiener-Hopf factorization
In this section we prove the “+” part of Theorem 3.2. Specifically, we will show that, if (S+,H+) solves (3.3) subject to (a+) and (b+), then, for any g+∈C0(X+), S+g+=J+g+ and Qℓ+g+=Pℓ+g+, ℓ∈R+. This also guarantees the uniqueness of G+, since two strongly continuous contraction semigroup coincide if and only if their generators coincide (cf. [Dyn65, Theorem 1.2]). Throughout this subsection, we assume that (S+,H+) satisfies (3.3) (or equivalently, (3.5) and (3.6)) and the conditions (a+) and (b+).
To begin with, we will show a sufficient condition of what we would like to prove. For any g+∈C0(X+), (s,i,a)∈Z, and ℓ∈[a,∞), we define
[TABLE]
When no confusion arises, we will omit g+ in F+(s,i,a,ℓ;g+) and F+(s,i,a,ℓ;g+).
Proposition 4.7**.**
Suppose that
[TABLE]
Then, for any g+∈C0(X+),
[TABLE]
Proof.
Let g+∈Cc1(X+). By Corollary 4.4, for any (s,i)∈X and ℓ∈R+,
[TABLE]
This, together with (4.59), implies that, for any ℓ∈R+,
[TABLE]
and thus S+Pℓ+g+=J+Pℓ+g+.
Since (Pℓ+)ℓ∈R+ is a strongly continuous semigroup, and S+ and J+ are bounded operators, we have
[TABLE]
so that S+g+=J+g+.
Alternatively, this equality can be obtained by letting ℓ=0 in (4.59).
Finally, since Cc1(X+) is dense in C0(X+), and S+, J+, and Pℓ+ are bounded operators, both (4.60) and (4.61) hold true for any g+∈C0(X+), which completes the proof of the proposition.
∎
Proposition 4.7 states that if (4.59) is satisfied then the “+” part of Theorem 3.2 holds true. Thus, to conclude the proof of the “+” part of Theorem 3.2, and therefore the proof of uniqueness of our Wiener-Hopf factorization, it remains to prove that (4.59) holds. The rest of this section is devoted to this task.
We need the following three technical lemmas, whose proofs are deferred to Appendix C.
Lemma 4.8**.**
For any g+∈C01(X+) and (s,i)∈X−, (S+Q⋅+g+)(s,i) is differentiable on R+, and
[TABLE]
Let C0(Z) be the space of real-valued B(Z)-measurable functions h on Z such that h(∞,∂,∞)=0, and that h(⋅,i,⋅)∈C0(R+×R) for all i∈E. Let C01(Z) be the space of functions h∈C0(Z) such that, for all i∈E, ∂h(⋅,i,⋅)/∂s and ∂h(⋅,i,⋅)/∂a exist and belong to C0(R+×R).
Lemma 4.9**.**
Let A be the strong generator of the Feller semigroup associated with the Markov family M. Then, C01(Z)⊂D(A), and for any h∈C01(Z),
[TABLE]
Lemma 4.10**.**
For any g+∈Cc(X+) with suppg+⊂[0,ηg+]×E+ for some ηg+∈(0,∞), we have suppQℓ+g+⊂[0,ηg+]×E+, for any ℓ∈R+.
For any a∈R, let C0(X×(−∞,a]) be the space of real-valued B(X)⊗B((−∞,a])-measurable functions h on X×(−∞,a]) such that h(⋅,i,⋅)∈C0(R+×(−∞,a]) for all i∈E. Let C01(X×(−∞,a]) be the space of functions h∈C0(X×(−∞,a]) such that, for all i∈E, ∂h(⋅,i,⋅)/∂s and ∂h(⋅,i,⋅)/∂a exist and belong to C0(R+×(−∞,a]).
Lemma 4.11**.**
For any ℓ∈R and g+∈Cc1(X+), F^+(⋅,⋅,⋅,ℓ;g+)∈C01(X×(−∞,ℓ]).
We are now in the position of proving (4.59). In what follows, we fix g+∈Cc1(X+) with suppg+⊂[0,ηg+]×E+ for some ηg+∈(0,∞).
We first show that, for any (s,i)∈X, ℓ∈R+, and T∈(0,∞),
[TABLE]
Let ϕ∈C1(R) with ϕ(a)=1 for a∈(−∞,ℓ] and lima→∞ϕ(a)=0. We extend F+(⋅,⋅,⋅,ℓ) to be a function on Z by defining
[TABLE]
By Lemma 4.11, we now have F+(⋅,⋅,⋅,ℓ)∈C01(Z) (with the convention that F+(∞,∂,∞,ℓ)=0). It follows from Lemma 4.9, (4.57), (C.24), and Lemma 4.8 that, for any (s,i)∈X and a∈(−∞,ℓ),
[TABLE]
where we note that Qℓ−a+g+∈D(H+) since g+∈C01(X+)=D(H+). Hence, since (S+,H+) solves (3.3), we have
[TABLE]
Therefore, by Dynkin’s formula (cf. [RW94, III.10]), we obtain that
From the definition of τℓ+ and the right-continuity of the sample paths of Z, we have Zτℓ+3=ℓ on {τℓ+<T}. Moreover, it is clear from the construction of M that Zt2∈E for t∈R+, and, in view of (4.10), we deduce that Zτℓ+2∈E+ on {τℓ+<T}. Together with (4.57), (4.58), and (4.6), we obtain that
[TABLE]
Therefore, in order to prove (4.59), it remains to show that the last two terms in (4.63) vanish. Since g+∈Cc(X+) (and so g+(Z∞1,Z∞2)=g+(∞,∂)=0) with suppg+⊂[0,ηg+]×E+, and using the fact that Zτℓ+2∈E+ on {τℓ+<∞}, we have, for T∈[ηg+−s,∞),
[TABLE]
Hence, the second term in (4.63) vanishes when T∈[ηg+−s,∞). As for the last term in (4.63), since suppg+⊂[0,ηg+]×E+, Lemma 4.10 and the condition (a+)(i) ensure that suppF+(⋅,⋅,⋅,ℓ)⊂[0,ηg+]×E×[0,ℓ]. Hence, when T∈[ηg+−s,∞), F+(s+T,ZT2,ZT3,ℓ)=0 so that the last term in (4.63) vanishes. Therefore, by choosing T∈[ηg+−s,∞), we obtain (4.59) from (4.63).
The proof of the “+” part of Theorem 3.2 is complete. As mentioned earlier, the proof of the “-” part of Theorem 3.2 proceeds in direct analogy to “+” part given above.
Appendix A Construction of M
In this appendix we provide construction of the standard time-inhomogeneous Markov family
Recall the function P:Z×R+×B(Y) given as in (4.1), where Y=E×R, Y=Y∪{(∂,∞)}, Z=R+×Y, and Z=Z∪{(∞,∂,∞)}.
Lemma A.1**.**
P* is a transition function.*
Proof.
The proof is divided into the following two steps.
Step 1. We first show that for any 0≤s≤t≤∞ and A∈B(Y),
[TABLE]
is measurable. Note that when t=∞, for any s∈[0,∞], (i,a)∈Y, and A∈B(Y), P(s,(i,a),∞,A)=δ(∂,∞)(A), where δ(∂,∞) denotes the Dirac measure at (∂,∞). Hence, P(s,⋅,∞,A) is B(Y)-measurable. When t∈R+, (Xt∗,ϕt∗) takes values only in Y, and thus P(s,(i,a),t,⋅) is supported on Y. Thus, it is sufficient to discuss the measurability of P(s,⋅,t,A) when 0≤s≤t<∞ and A∈B(Y)=2E⊗B(R).
Hence, for any i∈E, P(s,(i,⋅),t,{j}×(−∞,b]) is left-continuous on R, and is thus B(R)-measurable. Therefore, P(s,⋅,t,{j}×(−∞,b]) is B(Y)-measurable since E is finite.
Next, let
[TABLE]
The above arguments have shown that
[TABLE]
since E is finite. Clearly, H0 is a π-system on Y. We will now show that H1 is a λ-system on Y. First, P(s,(i,a),t,Y)≡1 for all (i,a)∈Y and 0≤s≤t<∞, so that P(s,⋅,t,Y) is B(Y)-measurable for any 0≤s≤t<∞, which implies that Y∈H1. Moreover, if A∈H1, then P(s,⋅,t,A) is B(Y)-measurable for any 0≤s≤t<∞. Hence, P(s,⋅,t,Ac)=1−P(s,⋅,t,A) is B(Y)-measurable for any 0≤s≤t<∞, which implies that Ac∈H1. Finally, if (An)n∈N is a sequence of disjoint subsets in H1, then P(s,⋅,t,An) is B(Y)-measurable for any 0≤s≤t<∞ and n∈N. Since,
[TABLE]
P(s,⋅,t,∪n∈NAn) is also B(Y)-measurable for any 0≤s≤t<∞, and thus ∪n∈NAn∈H1. Hence, H1 is a λ-system on Y, and by the monotone class theorem, H1⊃σ(H0)=B(Y). Therefore, H1=B(Y), which completes the proof of Step 1.
Step 2. It is clear from (4.1) that, for any 0≤s≤t≤∞ and (i,a)∈Y, P(s,(i,a),t,⋅) is a probability measure on (Y,B(Y)). In particular, P(s,(i,a),s,⋅) is the Dirac measure at (i,a).
To show that P is a transition function, it remains to show that P satisfies the Chapman-Kolmogorov equation, namely, for any 0≤s≤r≤t≤∞, (i,a)∈Y, and A∈B(Y),
[TABLE]
Note that when t=∞, (A.2) is satisfied since P(s,(i,a),∞,A)=P(r,(j,b),∞,A)=δ(∂,∞)(A). Since P(s,(i,a),t,⋅) is supported on Y, it is sufficient to show that
[TABLE]
for any 0≤s≤r≤t<∞, (i,a)∈Y, and A∈B(Y).
Again, we start with the case when A={k}×(−∞,c], for some k∈E and c∈R. For each n∈N, and any j∈E, let
[TABLE]
The dominated convergence theorem implies that
[TABLE]
Since E is a finite set, for any 0≤s≤t<∞ and (i,a)∈Y, when n∈N is large enough,
[TABLE]
Hence, for large n∈N, by the Markov property of X∗,
[TABLE]
Note that, for each n∈N,
[TABLE]
Hence, for A={k}×(−∞,c],
[TABLE]
To prove the Chapman-Kolmogorov equation (A.3) for general A∈B(Y), we use again the monotone class theorem. Let
[TABLE]
The above arguments have shown that H2 contains the π-system H0, defined as in (A.1). Moreover, using arguments similar to those from the end of Step 1, we can show that Y∈H2, and that H2 is closed under complements and countable disjoint unions. Hence, H2 is a λ-system, and by the monotone class theorem, H2⊃σ(H0)=B(Y). Therefore, H2=B(Y). This completes the proof of Step 2, and thus concludes the proof of the lemma.
∎
Let L∞(Y) be the collection of all bounded, B(Y)-measurable real-valued functions f on Y, and C0(Y) be the collection of functions f∈L∞(Y) such that f(i,⋅)∈C0(R) for all i∈E. Let T:=(Ts,t)0≤s≤t<∞ be the evolution system corresponding to the transition function P defined by
[TABLE]
where f∈L∞(Y). Hence, for any 0≤s≤r≤t<∞ and f∈L∞(Y), we have
[TABLE]
Lemma A.2**.**
(Ts,t)0≤s≤t* is a Feller evolution system. That is,*
(a)
Ts,t(C0(Y))⊂C0(Y), for any 0≤s≤t<∞;
(b)
for any f∈C0(Y) and s∈R+, Ts,tf converges to f uniformly on Y, as t↓s;
(c)
for any f∈C0(Y), the function (Ts,tf)(i,a) is jointly continuous with respect to (s,t,i,a) on {(s,t)∈R+2:s≤t}×Y.
Proof.
(a) For any 0≤s≤t<∞, f∈C0(Y), and i∈E, we first show that (Ts,tf)(i,⋅) is continuous on R. By (4.1), for any a,a′,b∈R and j∈E,
[TABLE]
Hence, we have
[TABLE]
so that
[TABLE]
The continuity of (Ts,tf)(i,⋅) follows from the uniform continuity of f(j,⋅), since f(j,⋅)∈C0(R), for any j∈E.
It remains to show that ∣(Ts,tf)(i,a)∣→0, as ∣a∣→∞. By (4.1), for any a∈R,
[TABLE]
where we recall that v:=maxi∈E∣v(i)∣. Hence,
[TABLE]
since f(j,⋅)∈C0(R) for any j∈E. This completes the proof of part (a).
(b) For any 0≤s≤t<∞ and f∈C0(Y), by (A.7) and (4.1),
[TABLE]
By the right-continuity of the sample paths of X∗ and by the dominated convergence theorem,
[TABLE]
Together with the uniform continuity of f(i,⋅) on R, we obtain that
[TABLE]
which completes the proof of part (b).
(c) For any f∈C0(Y) and i∈E, since E is finite, it is sufficient to establish the joint continuity of (T⋅,⋅f)(i,⋅) at any (s,t,a)∈{(s,t)∈R+2:s≤t}×R. For any (s′,t′,b)∈{(s,t)∈R+2:s≤t}×R (without loss of generality, assume that s≤s′≤t≤t′, as the other cases can be proved similarly),
[TABLE]
For the first term in (A.1), by (A.4), (A.5), and part (b), for any ε∈(0,∞), there exists δ1=δ1(ε,t)∈(0,∞) such that, whenever t′−t∈[0,δ1),
[TABLE]
As for the last term in (A.1), it follows from part (a) that (Ts,tf)(i,⋅) is uniformly continuous on R. Hence, there exists δ2=δ2(ε,s,t)∈(0,∞) such that, whenever ∣b−a∣∈[0,δ2),
[TABLE]
It remains to analyze the second term in (A.1). Using a similar argument leading to (A.8) (but with f replaced with Ts′,tf), we have
[TABLE]
By (A.5) and (A.9), there exists δ31=δ31(ε,s)∈(0,∞) such that, whenever s′−s∈[0,δ31),
[TABLE]
Moreover, by (A.6) and the uniform continuity of f(i,⋅) on R, there exists δ32=δ32(ε)∈(0,∞) such that, whenever s′−s∈[0,δ32),
[TABLE]
Therefore, if s′−s∈[0,δ3), where δ3:=min(δ31,δ32), we have
[TABLE]
Combining (A.1) - (A.13), and letting δ=δ(ε,s,t):=min(δ1,δ2,δ3), for any (s′,t′,b)∈{(s,t)∈R+2:s≤t}×R such that ∣s′−s∣+∣t′−t∣+∣b−a∣∈[0,δ], we obtain that
[TABLE]
which completes the proof of part (c), and thus concludes the proof of the lemma.
∎
Let Ω be the collection of all càdlàg functions ω on R+ taking values in Y, with extended value ω(∞)=(∂,∞), on which we let (X,φ):=(Xt,φt)t∈R+ be the coordinate mapping process. By Lemma A.1, Lemma A.2, and [GS04, Theorem I.6.3], there exists a standard time-inhomogeneous Markov family M:={(Ω,F,Fs,(Xt,φt)t∈[s,∞],Ps,(i,a)),(s,i,a)∈Z}, such that
[TABLE]
A.2 Proof of properties (i) and (ii) in Section 4.1
The property (i) follows immediately from (A.14). So, it remains to prove property (ii). Towards this end, we first extend (A.14) to measurable sets in Ω.
Lemma A.3**.**
For any 0≤s≤t<∞, let Ωs,t be the collection of all càdlàg functions on [s,t] taking values in Y, i.e., Ωs,t=Ω∣[s,t]. Let Gs,t be the cylindrical σ-field on Ωs,t generated by (Xu,φu)u∈[s,t]. Then, for any a∈R and C∈Gs,t,
[TABLE]
Proof.
We first shows that, for any n∈N, s≤t1≤⋯≤tn≤t, j1,…,jn∈E, and b1,…,bn∈R,
[TABLE]
The proof will proceed by induction in n. For n=1, (A.16) is just a special case of (A.14). Assume that (A.16) holds for n=p∈N. For any s≤t1≤⋯≤tp+1≤t, j1,…,jp+1∈E, and b1,…,bp+1∈R, by (A.14) and the Markov property of (X,φ),
[TABLE]
By the induction hypothesis for n=p, the joint distribution of (Xtj,φtj,j=1,…,p) under Ps,(i,a) coincides with the joint distribution of (Xtj∗,a+∫stjv(Xu∗)du,j=1,…,p) under Ps,i∗. Applying the standard procedure of approximation by simple functions we conclude that for any bounded measurable function f:(En×Rp,2Ep⊗B(Rp))→(R,B(R)),
[TABLE]
Together with (A.17) and the Markov property of X∗, we obtain that
The above arguments show that H⊃Hc, where Hc denotes the collection of all cylinder sets on Ωs,t of the form
[TABLE]
for some x1,…,xn∈E, b1,…,bn∈R, s≤t1≤⋯≤tn≤t, and n∈N. Clearly, Hc is a π-system on Ωs,t, and one can check that H is closed under complements and countable disjoint unions with Ωs,t∈H. Therefore, H is a λ-system on Ωs,t, and by the monotone class theorem, H⊃σ(Hc)=Gs,t, and thus H=Gs,t, which completes the proof of the lemma.
∎
Since φ has càdlàg sample paths, and a+∫stv(Xu)du, t∈[s,∞), has continuous sample paths, [KS98, Problem 1.1.5] implies that these two processes are indistinguishable, which implies (4.3).
∎
For any ε>0, i∈E, and (s1,ℓ1),(s2,ℓ2)∈R+2, without loss of generality, assume that s2≥s1 and ℓ2≥ℓ1. Then,
[TABLE]
The proof will be divided into three steps.
Step 1. We begin by investigating the first term in (B.1). Noting that (Pℓ+g+)(∞,∂)=g+(∞,∂)=0, by (4.16), Corollary 4.4, and (4.14),
[TABLE]
Recall that γ1 is the first jump time of Z2. For any (t,j)∈X+, on the event {Zu3=∫0uv(Zr2)dr,∀u≥0} (which has probability 1 under Pt,j,0 in view of (4.8)), we have
Since the semigroup induced by M is Feller, by [BSW13, Theorem 1.33], the above pointwise limit is uniform for all (s,i,a)∈Z and h∈D(A), which completes the proof of the lemma.
∎
To proceed with the proof of Lemma 4.10, we first prove the following auxiliary result.
Lemma C.1**.**
For any λ∈R+ and h+∈C0(X+) with supph+⊂[0,ηh+]×E+, for some ηh+∈(0,∞), there exists a unique solution Φ∈C0(X+) to
[TABLE]
and furthermore, Φ∈Cc1(X+).
Moreover, for any λ∈R+, Φ∈C01(X+) is a solution to (C.6) if and only if Φ∈C01(X+) solves
[TABLE]
subject to Φ=0 on ([ηh+,∞)×E+)∪{(∞,∂)}. Consequently, there exists a unique solution Φ∈C01(X+) to (C.7) subject to Φ=0 on ([ηh+,∞)×E+)∪{(∞,∂)}.
Proof.
In view of (3.5), we have that (C.7) is equivalent to the following equation
[TABLE]
We first show that Φ∈C01(X+) is a solution to (C.6) if and only if Φ solves (C.8) with Φ=0 on ([ηh+,∞)×E+)∪{(∞,∂)}. On the one hand, if Φ∈C01(X+) is a solution to (C.6), by differentiating the first equality in (C.6) and rearranging terms, we obtain (C.8) on [0,ηh+)×E+, while (C.8) holds trivially on ([ηh+,∞)×E+)∪{(∞,∂)} since both sides are equal to 0. On the other hand, if Φ∈C01(X+) solves (C.8) with Φ=0 on ([ηh+,∞)×E+)∪{(∞,∂)}, the first equality in (C.6) follows by rearranging terms in (C.8) and then integrating both sides. Therefore, we only need to show that (C.6) has a unique solution Φ∈C0(X+) which, in particular, belongs to Cc1(X+). The proof will be done in the following three steps.
Step 1. For any T>0, let XT±:=[T,∞)×E± and XT±:=XT±∪{(∞,∂)}. We define the spaces of functions C0(XT±) (respectively, Cc(XT±)) in analogy to C0(X±) (respectively, Cc(X±)), with the domain of functions restricted to XT±. Clearly, any function in C0(XT±) can be regarded as the restriction of some function in C0(X±) on XT±. The goal of this step is to seek for an operator ST+:C0(XT+)→C0(XT−), for any T∈(0,∞), such that for each g+∈C0(X+), S+g+=ST+(g+∣XT+) on XT−.
Note that, for any (s,i)∈X−, we define the linear functional Θs,i:C0(X+)→R by
[TABLE]
Since S+:C0(X+)→C0(X−) is bounded, Θs,i is a bounded linear functional on C0(X+). Hence, by Riesz representation theorem (cf. [Rud87, Theorem 6.19]), there is a unique signed measure μs,i on (X+,B(X+)), such that
[TABLE]
We claim that, for any fixed (s,i)∈X−,
[TABLE]
Otherwise, there exists [a,b]⊂[0,s) and j0∈E+, such that ∣μs,i∣([a,b]×{j0})>0. Let μs,i+ and μs,i− be the positive and the negative variations of μs,i, and let X+=Ds,i∪Ds,ic (where Ds,i∈B(X+)) be the Hahn decomposition (cf. [Rud87, Theorem 6.14]) with respect to μs,i, so that
[TABLE]
Without loss of generality, we can assume that there exists [a′,b′]⊂[a,b] such that [a′,b′]×{j0}⊂([a,b]×{j0})∩Ds,i and that μs,i+([a′,b′]×{j0})>0. Now we can construct ρ∈C0(R+) such that suppρ=[a′,b′], and let g~+(t,k)=ρ(t)\mathbbm1{j0}(k), (s,i)∈X+. Clearly, g~+∈C0(X+) with suppg~+⊂[a′,b′]×E+⊂[0,s)×E+. Hence, by the condition (a+)(i), (S+g~+)(s,i)=0. However,
[TABLE]
which contradicts (C.9). Therefore, (C.10) holds true.
Next, for any T∈(0,∞), we define ST+ on C0(XT+) by
[TABLE]
By (C.10), for any gT+∈C0(XT+) and g+∈C0(X+) such that gT+=g+∣XT+,
[TABLE]
In particular, since S+ is a bounded operator on C0(X+), we have
[TABLE]
and
[TABLE]
Moreover, for any 0<T1≤T2<∞, g+∈C0(XT+), gT1+∈C0(XT1+), and gT2+∈C0(XT2+), such that g+=gT1+=gT2+ on XT2+, a similar argument using (C.10) shows that
[TABLE]
Step 2. We now verify the existence and uniqueness of the solution to (C.6) by proceeding backwards starting from ηh+. Fix any λ∈R+ and h+∈C0(X+), and pick δ0∈(0,ηh+) small enough so that
[TABLE]
Using (C.12), we define Γ1:C0(Xη1+)→C0(Xη1+), where η1:=ηh+−δ0, by
[TABLE]
and (Γ1ϕ)(s,i)=0 for (s,i)∈Xηh++, where ϕ∈C0(Xη1+). By Assumption 2.1 and (C.12), the integral on the right-hand side above is well defined since the integrand is continuous in t and bounded. In this step, we will show that Γ1 has a unique fixed point Φ(1)∈C0(Xη1+), so that
[TABLE]
and
[TABLE]
Moreover, we will show that Φ(1)∈C01(Xη1+). It is then clear from (C.17) that suppΦ(1)⊂[η1,ηh+]×E+ so that Φ(1)∈Cc1(Xη1+). Therefore, the result in this step implies that (C.6) has a unique solution Φ(1) on the restricted domain Cc(Xη1+), and Φ(1)∈Cc1(Xη1+).
We first show that Γ1 has a unique fixed point in C0(Xη1+). For any ϕ1,ϕ2∈C0(Xη1+), by Assumption 2.1 and (C.13),
[TABLE]
Hence, by (C.15), Γ1 is a contraction mapping on C0(Xη1+), and thus Γ1 has a unique fixed point Φ(1)∈C0(Xη1+). In particular, (C.16) and (C.17) hold true.
Next, we show that Φ(1)∈C01(Xη1+). By (C.17), it is clear that Φ(1)∣Xηh++∈C01(Xηh++). Also, since the integrand on the right-hand side of (C.16) is continuous in t and bounded, we obtain from (C.16) that Φ(1)(⋅,i) is continuous on [η1,ηh+), and that lims→ηh+−Φ(1)(s,i)=0=Φ(1)(ηh+,i), for any i∈E+. It remains to show that Φ(1)(⋅,i) is continuously differentiable at s=ηh+ for any i∈E+, and, due to (C.17), we only need to prove that ∂−Φ(1)(ηh+,i)/∂s exists and equals to [math], and that ∂Φ(1)(⋅,i)/∂s is continuous at s=ηh+.
We fix an i∈E+. Since suppΦ(1)⊂[η1,ηh+]×E+, by (C.14) and the condition (a+)(i), for any g+∈C0(X+) such that g+∣Xη1+=Φ(1), (Sη1+Φ(1))(s,i)=(S+g+)(s,j)=0 for all (s,j)∈(ηh+,∞)×E−. It follows from the continuity of Sη1+Φ(1) that
Therefore, by (C.16), (C.17), and the fact that the integrand in (C.16) is continuous in t, we have
[TABLE]
and
[TABLE]
which completes the proof in step 2.
Step 3. In this step, we will extend the result in Step 2 and construct the unique solution to (C.6) restricted to Xη2+, where η2:=(ηh+−2δ0)∨0. Without loss of generality, we take δ0∈(0,ηh+/2).
In view of (C.12), we define Γ2:C0(Xη2+)→C0(Xη2+) by
[TABLE]
and (Γ2ϕ)(s,i)=Φ(1)(s,i) for (s,i)∈Xη1+. By Assumption 2.1 and (C.12), the integral on the right-hand side above is well defined since the integrand is continuous in t and bounded. For any ϕ1,ϕ2∈C0(Xη2+), by Assumption 2.1 and (C.13),
[TABLE]
Hence, by (C.15), Γ2 is contraction mapping on C0(Xη2+), and hence
Γ2 has a unique fixed point Φ(2)∈C0(Xη2+). Therefore, for any (s,i)∈[η2,η1)×E+,
[TABLE]
and
[TABLE]
Moreover, we will show that Φ(2)∈C01(Xη2+). By Step 2 and (C.19), it is clear that Φ(2)∣Xη1+∈C01(Xη1+). Also, since the integrand on the right-hand side of (C.18) is continuous in t and bounded, we obtain from (C.18) that Φ(2)(⋅,i) is continuous on [η2,η1), and that lims→η1−Φ(2)(s,i)=Φ(1)(η1,i)=Φ(2)(η1,i), for any i∈E+. It remains to show that Φ(2)(⋅,i) is continuously differentiable at s=η1 for any i∈E+, and, in light of (C.19), we only need to show that ∂−Φ(2)(η1,i)/∂s exists and equals to ∂+Φ(1)(η1,i)/∂s, and that ∂Φ(2)(⋅,i)/∂s is continuous at s=η1.
Therefore, by (C.18), (C.19), and the fact that the integrand in (C.18) is continuous in t, we have
[TABLE]
and
[TABLE]
where we have used the fact that Φ(1)∈C01(Xη1+) in the penultimate equality.
In conclusion, we have shown that there exists a unique solution Φ(2)∈Cc(Xη2+) to (C.6) when restricted to Xη2+ and Φ(2)∈Cc1(Xη2+). By induction, we obtain a unique solution Φ∈Cc(X+) to (C.6) and Φ∈Cc1(X+), which completes the proof of the lemma.
∎
Let g+∈Cc(X+) with suppg+⊂[0,ηg+]×E+ for some ηg+∈(0,∞). For any λ∈R+, define Rλ on C0(X+) by
[TABLE]
The integral on the right-hand side above is well defined since Qℓ+ is a contraction mapping, for any ℓ∈R+. In order to prove that suppQℓg+⊂[0,ηg+]×E+, for any ℓ∈R+, it is sufficient to show that suppRλg+⊂[0,ηg+]×E+, for any λ∈(0,∞). Indeed, if the later is true, then for any (s,i)∈[ηg+,∞)×E+,
[TABLE]
which implies that (cf. [Dyn65, Lemma 1.1]), (Qℓ+g+)(s,i)=0 for almost every ℓ∈R+. Since (Q⋅+g+)(s,i) is continuous on R+, we have (Qℓ+g+)(s,i)=0 for all ℓ∈R+.
By [EK05, Proposition I.2.1]), for any λ∈(0,∞), the operator (λ−H+):C01(X+)→C0(X+) is invertible and (λ−H+)−1=Rλ (so that Rλ is the resolvent at λ of H+). Hence, the equation (C.7) has a unique solution Φλ=Rλg+=(λ−H+)−1g+∈C01(X+). On the other hand, by Lemma C.1, (C.7) (with h+ replaced by g+) has a unique solution in C01(X+) which vanishes in [ηg+,∞)×E+. Therefore, suppRλg+⊂[0,ηg+]×E+, which completes the proof of the lemma.
∎
The proof of Lemma 4.11 requires the following additional lemma.
Lemma C.2**.**
For any g+∈Cc(X+) with suppg+⊂[0,ηg+]×E+ for some ηg+∈(0,∞), limℓ→∞∥Qℓ+g+∥∞=0.
Proof.
By Lemma C.1, when λ=0, (C.7) (or equivalently, (C.6)) has a unique solution Φ0∈C01(X+) subject to suppΦ0⊂[0,ηg+]×E+. Note that this does NOT imply the invertibility of H+ (or equivalently, the existence of [math]-resolvent of H+).
We first show that limλ→0+∥Φλ−Φ0∥∞=0. From the proof of Lemma 4.10, for any λ∈(0,∞), Φλ=Rλg+∈C01(X+) is the unique solution to (C.7) with suppΦλ⊂[0,ηg+]×E+. It follows from Lemma C.1 that Φλ is the unique solution to (C.6). Hence, for any s∈[0,ηg+], we have
[TABLE]
where we recall Xs+=[s,∞)×E+ and X0+=X+. For any (r,j)∈[0,ηg+]×E−, let Φλ,0(r) be the restriction of Φλ−Φ0 on Xr+. By (C.11) and (C.13),
[TABLE]
Therefore, for any s∈[0,ηg+], we have
[TABLE]
where Mλ:=∥A∥∞+λ∥V+∥∞+∥B∥∞∥S+∥∞. By Gronwall inequality, we obtain that
[TABLE]
Next, we will show that limℓ→∞∥Qℓ+g+∥∞=0. Without loss of generality, we assume that g+ is nonnegative. Otherwise, we can prove the above statement for the positive and negative part of g+, denoted by gp+ and gn+ respectively. Then, ∥Qℓ+g+∥∞≤∥Qℓ+gp+∥∞+∥Qℓ+gn+∥∞→0, as ℓ→∞. Note that when g+ is nonnegative, since Qℓ+ is positive, we have Qℓ+g+≥0 for any ℓ∈R+.
To begin with, since limλ→0+∥Φλ−Φ0∥∞=0 and ∥Φ0∥∞<∞. Hence, for any (s,i)∈X+,
[TABLE]
where we have used the monotone convergence in the last equality.
Suppose that limsupℓ→∞∥Qℓ+g+∥∞>0, then there exists ε0>0 and (sn,in,ℓn)∈X+×R+, n∈N, with limn→∞ℓn=∞, such that (Qℓn+g+)(sn,in)≥ε0 for any n∈N. Without loss of generality, we can assume that ℓn+1−ℓn>1 and in=i0∈E+ for all n∈N. Moreover, by part (i), suppQℓn+g+⊂[0,ηg+], and so (sn)n∈N⊂[0,ηg+], and hence we may also assume that limn→∞sn=s0 for some s0∈[0,ηg+].
Since (Qℓ+)ℓ∈R+ is a strongly continuous contraction semigroup on C0(X+), for any b>0,
[TABLE]
In particular, (Q⋅+g+)(s,i) is uniformly continuous on R+, uniformly for all (s,i)∈X+. Thus, there exists a universal constant δ0∈(0,1), such that for any b∈[0,δ0], (Qℓn+b+g+)(sn,i0)>ε0/2, for all n∈N, which implies that
[TABLE]
On the other hand, by [EK05, Propositon I.1.5 (a)]), ∫0δ0Qℓ+g+dℓ∈D(H+)=C01(X+), so that by [EK05, Propositon I.1.5 (b)]) and [Dyn65, 1.2.B],
[TABLE]
Hence, by (3.5) and [EK05, Propositon I.1.5 (b)]), and since (Qℓ+)ℓ∈R+ is a contraction semigroup,
[TABLE]
Combining (C.21) and (C.22), for any r∈(−δ0ε0/(4M),δ0ε0/(4M)), we have
[TABLE]
Let N∈N be large enough so that s0∈(sn−δ0ε0/(4M),sn+δ0ε0/(4M)) for all n≥N. Since ℓn+1−ℓn>0 and δ0∈(0,1), the intervals (ℓn,ℓn+δ0), n∈N, are non-overlapping. Therefore, we obtain from (C.23) that
[TABLE]
which clearly contradicts (C.20). The proof of the lemma is now complete.
∎
Let g+∈Cc1(X+) with suppg+⊂[0,ηg+]×E+ for some ηg+∈(0,∞), and fix ℓ∈R. Recall that F+ is defined as in (4.57).
We first show that F+(⋅,⋅,⋅,ℓ)∈C0(X×(−∞,ℓ]). For any i∈E+, s,s′∈R+, and a,a′∈(−∞,ℓ], we have
[TABLE]
Since Qℓ−a+g+∈C0(X+) and Qℓ−⋅+g+ is strongly continuous on (−∞,ℓ], we see that (Qℓ−⋅+g+)(⋅,i) is jointly continuous on R+×(−∞,ℓ]. Moreover, for any i∈E−,
[TABLE]
Since Qℓ−a+g+∈C0(X+), the condition (a+)(i) implies that S+Qℓ−a+g+∈C0(X−). Together with the strong continuity of Qℓ−⋅+g+ on (−∞,ℓ] as well as the boundedness of S+, we obtain that (S+Qℓ−⋅+g+)(⋅,i) is jointly continuous on R+×(−∞,ℓ]. In view of (4.57), we obtain that F+(⋅,i,⋅,ℓ) is jointly continuous on R+×(−∞,ℓ] for any i∈E. It remains to show that F+(⋅,i,⋅,ℓ) vanishes at infinity for any i∈E. By Lemma 4.10, suppQℓ−a+g+⊂[0,ηg+]×E+, and the condition (a+)(i) implies that suppS+Qℓ−a+g+⊂[0,ηg+]×E−, so that suppF+(⋅,i,a,ℓ)⊂[0,ηg+]. Moreover, by Lemma C.2, lima→−∞Qℓ−a+g+=0 strongly, and since ∥S+∥∞<∞, we also have lima→−∞S+Qℓ−a+g+=0 strongly. Hence, F+(⋅,i,⋅,ℓ) vanishes at infinity for any i∈E, and therefore, F+(⋅,⋅,⋅,ℓ)∈C0(X×(−∞,ℓ]).
Next, we will show that ∂F+(⋅,⋅,⋅,ℓ)/∂a exists and belongs to C0(X×(−∞,ℓ]). Since g+∈C01(X+)=D(H+), for any a∈(−∞,ℓ], by [EK05, Proposition I.1.5 (b)], we have Qℓ−a+g+∈D(H+), and
[TABLE]
Together with Lemma 4.8, we obtain that ∂F+(⋅,⋅,a,ℓ)/∂a at any a∈(−∞,ℓ], and
[TABLE]
Moreover, by (3.5) and the condition (a+)(i), we have H+g+∈C0(X+) with suppH+g+⊂[0,ηg+]×E+. Using arguments similar to those leading to F+(⋅,⋅,⋅,ℓ)∈C0(X×(−∞,ℓ]) above, we conclude that ∂F+(⋅,⋅,⋅,ℓ)/∂a∈C0(X×(−∞,ℓ]).
Finally, we will show that ∂F+(⋅,⋅,⋅,ℓ)/∂s exists and belongs to C0(X×(−∞,ℓ]). For any a∈(−∞,ℓ], since Qℓ−a+g+∈C01(X+)=D(H+), by (3.3), we have
[TABLE]
Consequently, in view of (4.57), ∂F+(s,i,a,ℓ)/∂s exists at any (s,i,a)∈X×(−∞,ℓ], and
[TABLE]
With similar technique as before, the right-hand sides above, as a function of (s,i,a), belongs to C0(X×(−∞,ℓ]).
∎
Appendix D Two additional technical lemmas
In this section, we establish two additional technical lemmas that are used in the proofs of our main theorems. We begin with a lemma regarding the distributions of the first and second jump time of Z2 (see also [RSST99, Section 8.4.2]).
Lemma D.1**.**
Let γ1 and γ2 be the first and the second jump time of Z2, respectively. Then, for any (s,i,a)∈Z and r∈R+,
[TABLE]
In particular,
[TABLE]
Proof.
For any (s,i,a)∈Z and r∈R+, by (4.5), (4.6), and (4.2),
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[APU 03] F. Avram, M. R. Pistorius, and M. Usabel. The two barriers ruin problem via a Wiener Hopf decomposition approach. An. Univ. Craiova Ser. Mat. Inform. , 30(1):38 − - 44, 2003.
2[BRW 80] M. T. Barlow, L. C. G. Rogers, and D. Williams. Wiener-Hopf factorization for matrices. Séminaire de Probabilités de Strasbourg , 14:324 − - 331, 1980.
3[BCGH 18] T. R. Bielecki, I. Cialenco, R. Gong, and Y. Huang. Wiener-Hopf factorization for time-inhomogeneous Markov chains and its application. Illinois Insitute of Technology, preprint , submitted, 2018.
4[Bot 14] B. Böttcher. Feller evolution systems: generators and approximation. Stoch. Dynam. , 14(3), 1350025 (15 pages), 2014.
5[BSW 13] B. Böttcher, R. L. Schilling and J. Wang. Lévy Matters III - Lévy-type processes: construction, approximation and sample path properties . Lecture Notes in Math. , Vol. 2009, Springer, 2013.
6[Dyn 65] E. B. Dynkin. Markov processes , Vol. 1. Springer-Verlag Berlin Heidelberg, Germany, 1965.
7[EK 05] S. N. Ethier and T. G. Kurtz. Markov processes characterization and convergence . John Wiley & Sons, Inc, Hoboken, NJ, USA, 2005.
8[GS 04] I. I. Gikhman and A. V. Skorokhod. The theory of stochastic processes , Vol. II. Springer-Verlag Berlin Heidelberg, Germany, 2004.