Chapter 74

A More Attractive VersionThe following lemma is convenient.

Lemma 74.0.1 Let fn→ f in Lp ([0,T ]×Ω,E) . Then there exists a subsequence nk and aset of measure zero N such that if ω /∈ N, then

fnk (·,ω)→ f (·,ω)

in Lp ([0,T ] ,E) and for a.e. t.

Proof: We have

P([∥ fn− f∥Lp([0,T ],E) > λ

])≤ 1

λ

∫Ω

∥ fn− f∥Lp([0,T ],E) dP

≤ 1λ∥ fn− f∥Lp([0,T ]×Ω,E)

Hence there exists a subsequence nk such that

P([∥∥ fnk − f

∥∥Lp([0,T ],E) > 2−k

])≤ 2−k

Then by the Borel Cantelli lemma, it follows that there exists a set of measure zero N suchthat for all k large enough and ω /∈ N,∥∥ fnk − f

∥∥Lp([0,T ],E) ≤ 2−k

Now by the usual arguments used in proving completeness, fnk (t)→ f (t) for a.e.t.Also, we have the approximation lemma proved earlier, Lemma 65.3.1.

Lemma 74.0.2 Let Φ : [0,T ]×Ω→V, be B ([0,T ])×F measurable and suppose

Φ ∈ K ≡ Lp ([0,T ]×Ω;E) , p≥ 1

Then there exists a sequence of nested partitions, Pk ⊆Pk+1,

Pk ≡{

tk0 , · · · , tk

mk

}such that the step functions given by

Φrk (t) ≡

mk

∑j=1

Φ

(tk

j

)X(tk

j−1,tkj ](t)

Φlk (t) ≡

mk

∑j=1

Φ

(tk

j−1

)X[tk

j−1,tkj )(t)

both converge to Φ in K as k→ ∞ and

limk→∞

max{∣∣∣tk

j − tkj+1

∣∣∣ : j ∈ {0, · · · ,mk}}= 0.

2497

Chapter 74A More Attractive VersionThe following lemma is convenient.Lemma 74.0.1 Let f, — f in L? ((0,T] x Q,E). Then there exists a subsequence ng and aset of measure zero N such that if @ ¢ N, thenSn (-,@) > f(-,@)in LP ([0,T],E) and for ae. t.Proof: We haveP ( [lls — f\lx-(o,r),2) > A])lA1x ft Fllarcor.e)4?IA1Wy Il fn ~ F\lip((0,.7)x@,z)Hence there exists a subsequence nx such thatLP((0,T],E) > 2*)) < q-kThen by the Borel Cantelli lemma, it follows that there exists a set of measure zero N suchthat for all k large enough and @ ¢ N,line — |P( (lin — £1g-k1(0,7),£) <Now by the usual arguments used in proving completeness, fy, (t) > f(t) fora.e.t. WlAlso, we have the approximation lemma proved earlier, Lemma 65.3.1.Lemma 74.0.2 Let ®: [0,T] x Q— V, be @([0,T]) x F measurable and suppose®EK=L? ((0,T] x Q3E), p> 1Then there exists a sequence of nested partitions, Pp. C Pray,— Jk kPAe= {ij th, }such that the step functions given byMrOrr) = ye) Zu w(t1 ~ ka(t) = Le (1) Fe w(tboth converge to ® in K as k + andfim max { |r —1, :7 € {0,--- sm} } =0.k>002497