Representation Theorem for Generators of BSDEs Driven by G-Brownian Motion and Its Applications
Abstract
We obtain a representation theorem for the generators of BSDEs driven by G-Brownian motions and then we use the representation theorem to get a converse comparison theorem for G-BSDEs and some equivalent results for nonlinear expectations generated by G-BSDEs.
1. Introduction
Let (Ω, ℱ, P) be a probability space, and, for fixed T ∈ [0, +∞), let (Bt) 0≤t≤T be a standard Brownian motion and let ℱt be the augmentation of σ{Bs, 0 ≤ s ≤ t}. Then Pardoux and Peng [1] introduced the backward stochastic differential equations (BSDEs) and proved the existence and uniqueness result of the BSDEs. In 1997, Peng [2] promoted g-expectations based on BSDEs. One of the important properties of g-expectations is comparison theorem or monotonicity. Chen [3] first considers a converse result of BSDEs under equal case. After that, Briand et al. [4] obtained a converse comparison theorem for BSDEs under general case. They also derived a representation theorem for the generator g. Following this paper, Jiang [5] discussed a more general representation theorem then, in his another paper [6], showed a more general converse comparison theorem. Here the representation theorem is an important method in solving the converse comparison problem and other problems (see Jiang [7]).
Peng [8–13] defined the G-expectations and G-Brownian motions (G-BMs) and proved the representation theorem of G-expectation by a set of singular probabilities, which differs from nonlinear g-expectations because g-expectations are equivalent with a group of absolutely continuous probabilities with respect to the probability measure P. Soner et al. [14] obtained an existence and uniqueness result of 2 BSDEs. Recently, Hu et al. [15] proved another existence and uniqueness result on BSDEs driven by G-Brownian motions (G-BSDEs).
An important advantage of G-BSDEs is the easiness to define the nonlinear expectations. Hu et al. in [16] gave a comparison theorem for G-BSDEs and talked about the properties of corresponding nonlinear expectations. In this paper, we consider the representation theorem for generators of G-BSDEs and then consider the converse comparison theorem of G-BSDEs and some equivalent results for nonlinear expectations generated by G-BSDEs. In the following, in Section 2, we review some basic concepts and results about G-expectations. We give the representation theorem of G-BSDEs in Section 3. In Section 4, we consider the applications of representation theorem of G-BSDEs, which contain the converse comparison theorem and some equivalent results for nonlinear expectations generated by G-BSDEs.
2. Preliminaries
We review some basic notions and results of G-expectation, the related spaces of random variables, and the backward stochastic differential equations driven by a G-Brownian motion. The readers may refer to [10, 13, 15, 17–19] for more details.
Definition 1. Let Ω be a given set and let ℋ be a vector lattice of real valued functions defined on Ω, namely, c ∈ ℋ for each constant c and |X | ∈ ℋ if X ∈ ℋ. ℋ is considered as the space of random variables. A sublinear expectation on ℋ is a functional satisfying the following properties: for all X, Y ∈ ℋ, one has
- (a)
monotonicity: if X ≥ Y, then ;
- (b)
constant preservation: ;
- (c)
subadditivity: ;
- (d)
positive homogeneity: for each λ ≥ 0. is called a sublinear expectation space.
Definition 2. Let X1 and X2 be two n-dimensional random vectors defined, respectively, in sublinear expectation spaces and . They are called identically distributed, denoted by , if , for all φ ∈ Cb·Lip (ℝn), where Cb·Lip (ℝn) denotes the space of bounded and Lipschitz functions on ℝn.
Definition 3. In a sublinear expectation space , a random vector Y = (Y1, …, Yn), Yi ∈ ℋ, is said to be independent of another random vector X = (X1, …, Xm), Xi ∈ ℋ under , denoted by Y⊥X, if for every test function φ ∈ Cb·Lip (ℝm × ℝn) one has .
Definition 4 (G-normal distribution). A d-dimensional random vector X = (X1, …, Xd) in a sublinear expectation space is called G-normally distributed if for each a, b ≥ 0 one has
In this paper, we only consider nondegenerate G-normal distribution; that is, there exists some such that for any A ≥ B.
Definition 5. (i) Let denote the space of ℝd-valued continuous functions on [0, ∞) with ω0 = 0 and let Bt(ω) = ωt be the canonical process. Set
(ii) For each fixed t ∈ [0, ∞), the conditional G-expectation for , where without loss of generality we suppose ti = t, is defined by
Definition 6. For fixed T > 0, let be the collection of processes in the following form: for a given partition {t0, …, tN} = πT of [0, T],
For each , we can define the integrals and for each a, . For each with p ≥ 1, we can define Itô′s integral .
Let . For p ≥ 1 and , set . Denote by the completion of under the norm .
- (H1)
There exists some β > 1 such that for any .
- (H2)
There exists some L > 0 such that
()
For simplicity, we denote by the collection of processes (Y, Z, K) such that , , K is a decreasing G-martingale with K0 = 0 and .
Definition 7. Let and f and gij satisfy (H1) and (H2) for some β > 1. A triplet of processes (Y, Z, K) is called a solution of (13) if for some 1 < α ≤ β the following properties hold:
- (a)
;
- (b)
.
Theorem 8 (see [15].)Assume that and f and gij satisfy (H1) and (H2) for some β > 1. Then, (13) has a unique solution (Y, Z, K). Moreover, for any 1 < α < β, one has , , and .
We have the following estimates.
Proposition 9 (see [15].)Let and f, gij satisfy (H1) and (H2) for some β > 1. Assume that for some 1 < α < β is a solution of (13). Then, there exists a constant Cα > 0 depending on α, T, G, L such that
Proposition 10 (see [15], [20].)Let α ≥ 1 and δ > 0 be fixed. Then, there exists a constant C depending on α and δ such that
Theorem 11 (see [16].)Let (Yl, Zl, Kl), l = 1,2, be the solutions of the following G-BSDEs:
- (H3)
For each fixed (ω, y, z) ∈ ΩT × ℝ × ℝd, t → f(t, ω, y, z) and t → gij(t, ω, y, z) are continuous.
- (H4)
For each fixed (t, y, z) ∈ [0, T) × ℝ × ℝd, f(t, y, z), , and
() - (H5)
For each (t, ω, y) ∈ [0, T] × ΩT × ℝ, f(t, ω, y, 0) = gij(t, ω, y, 0) = 0.
3. Representation Theorem of Generators of G-BSDEs
We now give the main result in this section.
Theorem 12. Let b : ℝn → ℝn, hij : ℝn → ℝn, and σ : ℝn → ℝn×d be Lipschitz functions and let f and gij satisfy (H1), (H2), (H3), and (H4) for some β > 1. Then, for each (t, x, y, p) ∈ [0, T) × ℝn × ℝ × ℝn and α ∈ (1, β), one has
Proof. For each fixed (t, x, y, p) ∈ [0, T) × ℝn × ℝ × ℝn, we write (Yε, Zε, Kε) instead of for simplicity. We have for each γ ≥ 1 (see [16, 19]). Thus, by Theorem 8, G-BSDE (22) has a unique solution (Yε, Zε, Kε) and . We set, for s ∈ [t, t + ε],
4. Some Applications
4.1. Converse Comparison Theorem for G-BSDEs
We first generalized the comparison theorem in [16].
Proposition 13. Let fl and satisfy (H1) and (H2) for some β > 1, l = 1,2. If , then, for each , one has for t ∈ [0, T].
Proof. From the above G-BSDEs, we have
Remark 14. Suppose d = 1 and let f1 = 10 | z|, f2 = |z|, g1 = |z|, and g2 = 2 | z|. It is easy to check that f2 − f1 + 2G(g2 − g1) ≤ 0. Thus, does not imply f2 ≤ f1 and .
Now, we give the converse comparison theorem.
Theorem 15. Let fl and satisfy (H1), (H2), (H3), (H4), and (H5) for some β > 1, l = 1,2. If for each t ∈ [0, T] and , then q.s..
Proof. For simplicity, we take the notation , l = 1,2. For each fixed (t, y, z) ∈ [0, T) × ℝ × ℝd, let us consider
In the following, we use the notation , l = 1,2.
Corollary 16. Let fl and be deterministic functions and satisfy (H1), (H2), (H3), and (H5) for some β > 1, l = 1,2. If for each , then .
4.2. Some Equivalent Relations
Proposition 17. Let f and gij satisfy (H1), (H2), (H3), (H4), and (H5) for some β > 1 and fix α ∈ (1, β). Then, one has
- (1)
for t ∈ [0, T], , and if and only if for each t ∈ [0, T], y, y′ ∈ ℝ, z ∈ ℝd,
() - (2)
for t ∈ [0, T], , and if and only if for each t ∈ [0, T], y, y′ ∈ ℝ, z, z′ ∈ ℝd,
() - (3)
for t ∈ [0, T], λ ∈ [0,1], , and if and only if for each t ∈ [0, T], y, y′ ∈ ℝ, z, z′ ∈ ℝd, λ ∈ [0,1],
() - (4)
for t ∈ [0, T], λ ≥ 0, and if and only if for each t ∈ [0, T], y ∈ ℝ, z ∈ ℝd, λ ≥ 0,
()
Proof. (1) “⇒” part. For each fixed t ∈ [0, T), y, y′ ∈ ℝ, z ∈ ℝd, we take
“⇐” part. Let (Y, Z, K) be the solution of G-BSDE (46) corresponding to terminal condition ξ. We claim that (Ys + η, Zs, Ks) s∈[t,T] is the solution of G-BSDE (46) corresponding to terminal condition ξ + η on [t, T]. For this, we only need to check that, for s ∈ [t, T],
(2) “⇒” part. For each fixed t ∈ [0, T), y, y′ ∈ ℝ, z, z′ ∈ ℝd, we consider ξε = y + 〈z, hij〉(〈Bi, Bj〉 t+ε − 〈Bi, Bj〉 t)+〈z, Bt+ε − Bt〉 and , where hij = hji ∈ ℝd and . Then, by Theorem 12 and , we obtain
“⇐” part. Let (Y, Z, K) and (Y′, Z′, K′) be the solutions of G-BSDE (46) corresponding to terminal condition ξ and η, respectively. Then, (Y + Y′, Z + Z′, K) solves the following G-BSDE:
Finally, we could prove (3) as in (2) and (4) as in (1).
Proposition 18. One has the following.
- (1)
If G(A) + G(−A) > 0 for any A ∈ 𝕊d and A ≠ 0, then (47) holds if and only if f and gij are independent of y.
- (2)
If there exists an A ∈ 𝕊d with A ≠ 0 such that G(A) + G(−A) = 0 and G(A) ≠ 0, then, for any fixed g(t, y, z) satisfying (H1)–(H5), one has f(t, y, z) = −2G(A)g(t, y, z) and satisfying (47).
Proof. It is easy to verify (2), and we only need to prove (1). If (47) holds, it is easy to check that holds. Then, from the assumption, we get gij(t, y, z) = gij(t, 0, z). Therefore, by (47), we have f(t, y, z) = f(t, 0, z), which implies that f and gij are independent of y. The converse part is obvious.
Acknowledgments
K. He acknowledges the financial support from the National Natural Science Foundation of China (Grant nos. 11301068 and 11171062) and the Innovation Program of Shanghai Municipal Education Commission (Grant no. 12ZZ063). M. Hu acknowledges the financial support from the National Natural Science Foundation of China (Grant nos. 11201262 and 11101242) and the Scientific Research Foundation for the Excellent Middle-Aged and Young Scientists of Shandong Province of China (Grant no. BS2013SF020).