20.9. SEQUENTIAL COMPACTNESS IN L1 635

What of the claim about ||L||? By the regularity of |λ | , it follows that C0 (X) (In fact,Cc (X)) is dense in L1 (X , |λ |). Since |λ | is finite, g ∈ L1 (X , |λ |). Therefore, there existsa sequence of functions in C0 (X) ,{ fn} such that fn → g in L1 (X , |λ |). Therefore, thereexists a subsequence, still denoted by { fn} such that fn (x)→ g(x) |λ | a.e. also. But since|g(x)|= 1 a.e. it follows that hn (x)≡ fn(x)

| fn(x)|+ 1n

also converges pointwise |λ | a.e. Then from

the dominated convergence theorem and 20.8.22

||L|| ≥ limn→∞

∫X

hngd |λ |= |λ |(X) .

Also, if || f ||C0(X) ≤ 1, then

|L( f )|=∣∣∣∣∫X

f gd |λ |∣∣∣∣≤ ∫X

| f |d |λ | ≤ |λ |(X) || f ||C0(X)

and so ||L|| ≤ |λ |(X) . This proves everything but uniqueness.Suppose λ and λ 1 both work. Then for all f ∈C0 (X) ,

0 =∫

Xf d (λ −λ 1) =

∫X

f hd |λ −λ 1|

where hd |λ −λ 1| is the polar decomposition for λ −λ 1. By Lemma 20.8.2 λ −λ 1 is reg-ular and so, as above, there exists { fn} such that | fn| ≤ 1 and fn→ h pointwise. Therefore,∫

X d |λ −λ 1|= 0 so λ = λ 1. This proves the theorem.

20.9 Sequential Compactness In L1

Lemma 20.9.1 Let C ≡ {Ei}∞

i=1 be a countable collection of sets and let Ω1 ≡ ∪∞i=1Ei.

Then there exists an algebra of sets, A , such that A ⊇ C and A is countable.

Proof: Let C1 denote all finite unions of sets of C and also include Ω1 and /0. Thus C1is countable. Next let B1 denote all sets of the form Ω1 \A such that A ∈ C1. Next let C2denote all finite unions of sets of B1∪C1. Then let B2 denote all sets of the form Ω1 \Asuch that A ∈ C2 and let C3 =B2∪C2. Continuing this way yields an increasing sequence,{Cn} each of which is countable. Let

A ≡ ∪∞i=1Ci.

Then A is countable. Also A is an algebra. Here is why. Suppose A,B ∈A . Then thereexists n such that both A,B ∈ Cn−1. It follows A∪B ∈ Cn ⊆ A from the construction. Itonly remains to show that A \B ∈ A . Taking complements with respect to Ω1, it followsfrom the construction that AC,BC are both in Bn−1 ⊆ Cn. Thus,

AC ∪B ∈ Cn

and soA\B =

(AC ∪B

)C ∈Bn ⊆ Cn+1 ⊆A .

This shows A is an algebra of sets of Ω1 which is also countable and contains C .

20.9. SEQUENTIAL COMPACTNESS IN L! 635What of the claim about ||L||? By the regularity of |A|, it follows that Co (X) (In fact,C.(X)) is dense in L! (X,|A]|). Since |A| is finite, g € L'(X,|A|). Therefore, there existsa sequence of functions in Co (X),{f,} such that f, > 2 in L'(X,|A|). Therefore, thereexists a subsequence, still denoted by {f,,} such that f, (x) > Z(x) |A| a.e. also. But since|g (x)| = 1 ae. it follows that h, (x) = nae Tthe dominated convergence theorem and 20.8.22also converges pointwise |A| a.e. Then from2] = fim, hag |A| = |A|(X).Also, if ||fl|cyix) < 1, thencn =| frealal| < f inialal < a1) itlland so ||L]| < |A|(X). This proves everything but uniqueness.Suppose A and A; both work. Then for all f € Co (X),0= | fa(a—ar)= [ fha|a— 21)where hd |A — A,| is the polar decomposition for A — A. By Lemma 20.8.2 4 — A, is reg-ular and so, as above, there exists {f,,} such that | f,| < 1 and f, — / pointwise. Therefore,Jyd|A —A\| =0s0 A =A}. This proves the theorem.20.9 Sequential Compactness In L!Lemma 20.9.1 Let @ = {E;};_, be a countable collection of sets and let Qy = U%_,E;.Then there exists an algebra of sets, &, such that & DC and @ is countable.Proof: Let @ denote all finite unions of sets of @ and also include Q, and @. Thus @is countable. Next let 4, denote all sets of the form Q) \A such that A € @. Next let ©denote all finite unions of sets of 4; UG. Then let A denote all sets of the form Q; \Asuch that A € @ and let @ = 42 UG. Continuing this way yields an increasing sequence,{@,,} each of which is countable. LetA = V2).Then . is countable. Also ./ is an algebra. Here is why. Suppose A,B € /. Then thereexists n such that both A,B € G,_. It follows AUB € G, C & from the construction. Itonly remains to show that A\ B € &. Taking complements with respect to Q1, it followsfrom the construction that A©, B© are both in Z,_1 C G,. Thus,ATUBE®and so cA\B=(ATUB) EB, CE Ce.This shows is an algebra of sets of Q; which is also countable and contains @.