Homepage Solution manuals Terence Tao An Introduction to Measure Theory Exercise 1.4.20 (Properties of finitely additive measure)

Exercise 1.4.20 (Properties of finitely additive measure)

Let μ : [0,+] be a finitely additive measure on a Boolean algebra . Establish the following facts:

(i)
(Monotonicity) If E,F are -measurable and E F then μ(E) μ(F).
(ii)
(Finite additivity) If E1,,Ek are -measurable and disjoint, then μ( n=1kEn) = n=1kμ(En).
(iii)
(Finte subadditivity) If E1,,Ek are -measurable, then μ( n=1kEn) n=1kμ(En).
(iv)
(Finite inclusion-exclusion principle) If E,F are -measurable, then μ(E F) = μ(E) + μ(F) μ(E F).

Answers

(i)
(Monotonicity) Notice that the sets FE and F E = E are disjoint, and (FE) E = F. By finite additivity we then have μ(F) = μ(FE) + μ(E) μ(E), where we have used the non-negativity of μ : B [0,+] in the last step.
(ii)
(Finite additivity) The induction base case n = 2 is true by definition, and in the induction step we have μ ( n=1k+1E n) = μ ( n=1kE n Ek+1) = μ ( n=1k+1E n)+μ(Ek+1) = n=1kμ(E n)+μ(Ek+1) = n=1k+1μ(E n)

(iii)
(Finte subadditivity) The induction base for n = 2 follows by μ(EF) = μ ((EF) (FE) (E F)) = μ((EF)(EF))+μ(FE) μ(E)+μ(F)

from the finite additivity and monotonicity properties. The induction step follows in a similar spirit:

μ ( n=1k+1E n) = μ ( n=1kE n Ek+1) = μ ( [ n=1k+1E nEk+1] [Ek+1 n=1k+1E n] [ n=1k+1E n Ek+1]) = μ ( [ n=1k+1E nEk+1] [ n=1k+1E n Ek+1]) + μ (Ek+1 n=1k+1E n) μ ( n=1k+1E n) + μ (Ek+1) n=1kμ(E nEk+1) + μ(Ek+1 n=1k+1E n) n=1k+1μ(E n)
(iv)
(Finite inclusion-exclusion principle) We have μ(E) = μ(EF) + μ(E F) μ(F) = μ(FE) + μ(F E)

The last term being the same in both equations. Adding these equations up we obtain

μ(E) + μ(F) = μ(EF) + μ(FE) + μ(E F) + μ(E F) = μ(E F) + μ(E F)

since we have the union E F = (EF) (FE) (E F), and this representation is disjoint.

User profile picture
2020-07-30 00:00
Comments