322 CHAPTER 13. REPRESENTATION THEOREMS

≤ ε +n

∑i=1

∑F∈π(E)

|µ (F ∩Ei)| ≤ ε +n

∑i=1|µ|(Ei)

Since ε is arbitrary, this shows |µ|(∪n

i=1Ei)≤ ∑

ni=1 |µ|(Ei) . Thus |µ| is finitely additive.

■In the case that µ is a complex measure, it is always the case that |µ|(Ω)< ∞. First is

a lemma.

Lemma 13.2.5 Suppose µ is a real valued measure (signed measure by Definition7.11.2). Then |µ| is a finite measure.

Proof: Suppose µ : F →R is a vector measure (signed measure by Definition 7.11.2).By the Hahn decomposition, Theorem 7.11.5 on Page 179, Ω = P∪N where P is a positiveset and N is a negative one. Then on N, −µ is a measure and if A⊆ B and A,B measurablesubsets of N, then −µ (A)≤−µ (B). Similarly µ is a measure on P.

∑F∈π(Ω)

|µ (F)| ≤ ∑F∈π(Ω)

(|µ (F ∩P)|+ |µ (F ∩N)|)

= ∑F∈π(Ω)

µ (F ∩P)+ ∑F∈π(Ω)

−µ (F ∩N)

= µ((∪F∈π(Ω)F

)∩P)+−µ

((∪F∈π(Ω)F

)∩N)≤ µ (P)+ |µ (N)|

It follows that |µ|(Ω)< µ (P)+ |µ (N)| and so |µ| has finite total variation. ■

Theorem 13.2.6 Suppose µ is a complex measure on (Ω,S ) where S is a σ al-gebra of subsets of Ω. That is, whenever {Ei} is a sequence of disjoint sets of S ,

µ (∪∞i=1Ei) =

∑i=1

µ (Ei) .

Then |µ|(Ω)< ∞.

Proof: If µ is a vector measure with values in C, Re µ and Im µ have values in R. Then

∑F∈π(Ω)

|µ (F)| ≤ ∑F∈π(Ω)

|Re µ (F)|+ |Im µ (F)|

= ∑F∈π(Ω)

|Re µ (F)|+ ∑F∈π(Ω)

|Im µ (F)|

≤ |Re µ|(Ω)+ |Im µ|(Ω)< ∞

thanks to Lemma 13.2.5. ■

Theorem 13.2.7 Let (Ω,S ) be a measure space and let λ : S → C be a complexvector measure. Thus |λ |(Ω) < ∞. Let µ : S → [0,µ(Ω)] be a finite measure such thatλ ≪ µ . Then there exists a unique f ∈ L1(Ω) such that for all E ∈S ,∫

Ef dµ = λ (E).

322 CHAPTER 13. REPRESENTATION THEOREMSn n<et+)) )) |m(FNB)| <e+ ) |u| (Ei)i=l Fen(E) i=lSince € is arbitrary, this shows |u| (U7_,£;) < Di, |u| (Zi). Thus || is finitely additive.aIn the case that y1 is a complex measure, it is always the case that || (Q) < ce. First isa lemma.Lemma 13.2.5 Suppose u is a real valued measure (signed measure by Definition7.11.2). Then || is a finite measure.Proof: Suppose pl : ¥ — R is a vector measure (signed measure by Definition 7.11.2).By the Hahn decomposition, Theorem 7.11.5 on Page 179, Q = PUN where P is a positiveset and N is a negative one. Then on N, —y is a measure and if A C B and A, B measurablesubsets of N, then —u (A) < —p (B). Similarly y is a measure on P.LY HPs Yo Weep) +e an)))Fen(Q) Fen(Q)= Yo w(Fnp)+ YY -u(F ON)Fen(Q) Fen(Q)=H ((Urem(ayF) OP) + —H ((UremayF) ON) < w(P)+|H(N)|It follows that || (Q) < u“(P)+ |p (N)| and so || has finite total variation.Theorem 13.2.6 Suppose LL is a complex measure on (Q,./) where S is a © al-gebra of subsets of Q. That is, whenever {E;} is a sequence of disjoint sets of S,cou(U2,Ei) = Yu (Ei).i=]Then |p| (Q) < °%.Proof: If i is a vector measure with values in C, Rew and Imp have values in R. ThenY lH) < YE [Ren (F)|+ [Im (F)|Fen(Q) Fen(Q)= ) [Rew(F)i+ ) {imu (F)|Fen(Q) Fen(Q)< |Rep|(Q)+|Imp|(Q) <thanks to Lemma 13.2.5.Theorem 13.2.7 Ler (Q,.%) be a measure space and let A: SY — C be a complexvector measure. Thus |A|(Q) < ce. Let U: Y% > [0,u(Q)] be a finite measure such thatA <u. Then there exists a unique f € L'(Q) such that for all E €.Y,I fdu = A(E).