24.8. THE RIESZ REPRESENTATION THEOREM 685

Lemma 24.8.4 F defined above is a vector measure with values in X ′ and |F |(Ω)< ∞.

Proof of the lemma: Clearly F (E) is linear. Also

∥F (E)∥= sup∥x∥≤1

∥F (E)(x)∥ ≤ ∥l∥ sup∥x∥≤1

∥XE (·)x∥Lp(Ω;X) ≤ ∥l∥µ (E)1/p.

Let {Ei}∞i=1 be a sequence of disjoint elements of S and let E = ∪n<∞En.∣∣∣∣∣F (E)(x)−

n

∑k=1

F (Ek)(x)

∣∣∣∣∣=∣∣∣∣∣l (XE (·)x)−

n

∑i=1

l (XEi (·)x)

∣∣∣∣∣ (24.36)

≤ ∥l∥

∥∥∥∥∥XE (·)x−n

∑i=1

XEi (·)x

∥∥∥∥∥Lp(Ω;X)

≤ ∥l∥µ

(⋃k>n

Ek

)1/p

∥x∥.

Since µ (Ω)< ∞, limn→∞ µ

( ⋃k>n

Ek

)1/p

= 0 and so inequality 24.36 shows that

limn→∞

∥∥∥∥∥F (E)−n

∑k=1

F (Ek)

∥∥∥∥∥X ′

= 0.

To show |F |(Ω) < ∞, let ε > 0 be given, let {H1, · · · ,Hn} be a partition of Ω, and let∥xi∥ ≤ 1 be chosen in such a way that F (Hi)(xi)> ∥F (Hi)∥− ε/n. Thus

−ε +n

∑i=1∥F (Hi)∥<

n

∑i=1|l (XHi (·)xi)| ≤ ∥l∥

∥∥∥∥∥ n

∑i=1

XHi (·)xi

∥∥∥∥∥Lp(Ω;X)

≤ ∥l∥(∫

n

∑i=1

XHi (s)dµ

)1/p

= ∥l∥µ (Ω)1/p.

Since ε > 0 was arbitrary, ∑ni=1 ∥F (Hi)∥ < ∥l∥µ (Ω)1/p.Since the partition was arbitrary,

this shows |F |(Ω)≤ ∥l∥µ (Ω)1/p and this proves the lemma. ■Continuing with the proof of Theorem 24.8.3, note that F≪ µ. Since X ′ has the Radon

Nikodym property, there exists g ∈ L1 (Ω;X ′) such that F (E) =∫

E g(s)dµ. Also, from thedefinition of F (E) ,

l

(n

∑i=1

xiXEi (·)

)=

n

∑i=1

l (XEi (·)xi)

=n

∑i=1

F (Ei)(xi) =n

∑i=1

∫Ei

g(s)(xi)dµ. (24.37)

It follows from 24.37 that whenever h is a simple function,

l (h) =∫

g(s)(h(s))dµ. (24.38)

Let Gn ≡ {s : ∥g(s)∥X ′ ≤ n} and let j : Lp (Gn;X)→ Lp (Ω;X) be given by

jh(s) ={

h(s) if s ∈ Gn,0 if s /∈ Gn.

24.8. THE RIESZ REPRESENTATION THEOREM 685Lemma 24.8.4 F defined above is a vector measure with values in X' and |F | (Q) <9.Proof of the lemma: Clearly F (£) is linear. AlsoFE) = sup |F(E) (II <M sup || 2 (ll ocozxy < Mell e(E)'”.I|x||<1 I|x||<1Let {E;}7 , be a sequence of disjoint elements of Y and let E = Un<coEn.~Y¥F (By) (x)k=1Me= |l( Ze (x) - YU Be, ()x) (24.36)i=1\/p< dle (U b) IIx.LP(Q;X) k>n1/pSince Ll (Q) < 0, limp soo ( U Fi) = 0 and so inequality 24.36 shows thatk>n=< [|Alli=1i ()x-Y) Ze, (-)x=0.xX’limn—ooF(E)— DF (Ex)i mnuaTo show |F| (Q) < ©, let € > 0 be given, let {H,--- ,H,} be a partition of Q, and let||x;|| < 1 be chosen in such a way that F (H;) (x;) > ||F (Hj)|| — €/n. Thusyf—e+ VP (ADI < YM ( 2H, ()a0)| S Wli=l i=lLP(Q:X)n 1/pWi (LE enioan) = ino”Since € > 0 was arbitrary, )?_, ||F (A;)|| < |l/||u (Q)!/? Since the partition was arbitrary,this shows |F|(Q) < ||| (Q)'/” and this proves the lemma.Continuing with the proof of Theorem 24.8.3, note that F <u. Since X’ has the RadonNikodym property, there exists g € L' (Q;X") such that F (E) = J; g(s) du. Also, from thedefinition of F (E),= 7 (Ei) (x) =) | g(s) Ga)dy. (24.37)i=l i=l? FiIt follows from 24.37 that whenever h is a simple function,n) = [ e(s)(n(s)) du. (24.38)Let G, = {s: |g (s)||y <n} and let j : L? (G,;X) + L? (Q;X) be given by. _ J h(s) ifs €Gy,jn(s) ={ Oif s ¢ Gy.