
8.4 First Order Differential Equations and Inclusions with Mean Derivatives 213
that all a
i
(t, x)anda(t, x) satisfy (8.47) for some constant that is bigger
than the constnant K from the condition of the Theorem. Nevertheless, for
simplicity, we shall retain the notation K for this constant.
Like a(t, x), α(t, x) has in S(n)anε-approximation from Theorem 4.11
for any ε>0sinceα(t, x) is an upper semicontinuous set-valued mapping
with closed convex values. Note that
¯
S
+
(n) is a convex set in S(n)andso
by Theorem 4.11 those approximations also take values in
¯
S
+
(n). For the se-
quence (ε
i
)(seeabove)denoteby¯α
i
(t, x)an
ε
i
2
-approximation of α(t, x). Let
α
i
(t, x)=¯α
i
(t, x)+
ε
i
4
I where I is the unit matrix. Immediately from the con-
struction it follows that α
i
(t, x), for any i, is a continuous ε
i
-approximation
of α(t, x) and that at any (t, x) it belongs to S
+
(n), i.e., it is strictly positive
definite. In addition, α
i
(t, x) satisfies (8.48) where the constant K>0is
bigger than the constant from the hypothesis of the Theorem. Also, by con-
struction, the sequence α
i
(t, x) point-wise converges to a Borel measurable
selector α(t, x)ofα(t, x).
By Lemma 8.40 for any i there exists a continuous A
i
(t, x) such that
A
i
(t, x)A
∗
i
(t, x)=α
i
(t, x). Directly from the definition of trace we obtain
that tr α
i
(t, x) is equal to the sum of the squares of the elements of A
i
(t, x),
i.e., it is the square of the Euclidean norm in L(R
n
, R
n
). Hence from (8.48)
it follows that A
i
(t, x) <K(1 + x)forsomeK>0.
Thus the stochastic differential equation
ξ(t)=ξ
0
+
t
0
a
i
(s, ξ(s))ds +
t
0
A
i
(s, ξ(s))dw(s) (8.49)
satisfies the hypothesis of Theorem 6.26 and so it has a weak solution that is
well-defined on the entire interval [0,T]. Denote this solution by ξ
i
(t).
Below in this section we use the measure space (
˜
Ω,
˜
F) and the family
˜
P
t
of σ-subalgebras of
˜
F introduced in Section 6.1.1. On the measure space
([0,T], B), where B is the Borel σ-algebra, we denote the Lebesgue measure
by λ
1
.
The process ξ
i
(t) determines a measure μ
i
on (
˜
Ω,
˜
F). On the probability
space (
˜
Ω,
˜
F,μ
i
) the process ξ
i
(t) is the coordinate process, i.e., ξ
i
(t, x(·)) =
x(t), x(·) ∈
˜
Ω. In addition it is clear that Lemma 6.28 is valid for measures
μ
i
and so the set of measures {μ
i
} is weakly compact, i.e., it is possible to
select a subsequence weakly convergent to some measure μ. Denote by ξ(t)
the coordinate process on the probability space (
˜
Ω,
˜
F,μ).
Define the measures ν
i
on (
˜
Ω,
˜
F) by the relations dν
i
=(1+x(·))dμ
i
.
By Lemma 6.29 these measures weakly converge to the measure ν given by
the relation dν =(1+x(·))dμ.
Since the sequence a
i
(t, x(·)) converges to a(t, x(·)) point-wise, it converges
almost surely with respect to all λ×μ
k
and so the functions
a
i
(t,x(·))
1+x(·)
converge
to
a(t,x(·))
1+x(·)
almost surely with respect to all λ × ν
k
.
Let δ>0. By Egorov’s theorem (see, e.g., [235]) for every k there exists
a subset
˜
K
k
δ
⊂ [0; T ] ×
˜
Ω such that (λ × ν
k
)(
˜
K
k
δ
) > 1 − δ and the sequence