Homepage Solution manuals Terence Tao Probability Theory Exercise 1.7 (Linearity of the unsigned integral)

Exercise 1.7 (Linearity of the unsigned integral)

Let (Ω,,μ) be a measure space.

1.
Let f : Ω [0,+] be an unsigned measurable function which is both bounded (i.e., there is a finite M such that |f(ω)| M for all ω Ω) and has finite measure support (i.e., there is a measurable set E with μ(E) < such that f(ω) = 0 for all ω ΩE). Show that Ωf=inf gfSimpΩg

holds for this function f.

2.
Establish the additivity property Ωf + g =Ωf +Ωg

whenever f,g : Ω [0,+] are unsigned measurable functions that are bounded with finite measure support.

3.
(Horizontal truncation) Show that Ω min (f,n) Ωf

as n whenever f : Ω [0,+] is unsigned measurable.

4.
Using (iii), extend (ii) to the case where f,g are unsigned measurable functions with finite measure support, but are not necessarily bounded.
5.
(Vertical truncation) Show that Ωf1f1n Ωf

as n whenever f : Ω [0,+] is unsigned measurable.

6.
Using (iii) and (v), show that (ii) holds for any unsigned measurable f,g (which are not necessarily bounded or of finite measure support).

Answers

1.
We have to demonstrate that sup hf {SimpΩh}=inf gf {SimpΩg}

We already know that

sup hf {SimpΩh} inf gf {SimpΩg}

So it is left to demonstrate that

sup hf {SimpΩh}inf gf {SimpΩg}

Pick an 𝜖 > 0, and let f𝜖 be f rounded down to the nearest integer multiple of 𝜖, and let f𝜖 be f rounded up to the nearest integer multiple.

f𝜖 := max {k𝜖 : k  and k𝜖 < f}f𝜖 := min {k𝜖 : k  and k𝜖 f}

Clearly, for all ω Ω we have the pointwise bounds

f𝜖(ω) f(ω) f𝜖(ω)

and

f𝜖(ω) f 𝜖(ω) 𝜖.

Finally, f is bounded, which means that f𝜖,f𝜖 can only take on finitely many values in the range of 0,𝜖, 2𝜖,, K𝜖 M (K + 1)𝜖. To sum up, for any 𝜖 > 0 we can find an Simp Ωf𝜖 from the left-hand side set and an Simp Ωf𝜖 from the right-hand side set such that the difference between them is less than an arbitrarily small quantity 𝜖 μ(E). Thus, the right-hand side cannot be strictly greater than the left-hand side, and so they must be equal.

2.
In view of superadditivity (href./exercise_1-5Exercise 1.5 (i)) we only have to demonstrate that Ωf + g Ωf +Ωg

Just as in the previous part, define f𝜖,f𝜖 and g𝜖,g𝜖. We give ourselves an 𝜖 of a room and see that

f + g f𝜖 + g𝜖 + 2𝜖

from f𝜖(ω) f𝜖(ω) 𝜖 and g𝜖(ω) g𝜖(ω) 𝜖. By Exercise 1.5 and properties of the simple integral,

Ωf + g Ωf𝜖 + g𝜖 + 2𝜖dμ = SimpΩf𝜖 + g𝜖 + 2𝜖dμ = SimpΩf𝜖dμ + SimpΩg𝜖dμ + 2𝜖μ(E) = [Ωfdμ 𝜖] + [Ωgdμ 𝜖] + 2𝜖μ(E)

where we have used the supremum definition of the unsigned integral in the last line. Letting 𝜖 0 and using the assumption that μ(E) is finite, we obtain the claim.

3.
See the equivalent Exercise 1.4.35 (ix) from Terence Tao’s An Introduction to Measure Theory.
4.
Now we continue to assume that μ is a finite measure, but now we do not assume that f,g are bounded. Then for any natural number n, we can use the previous case to deduce that Ω min (f,n) + min (g,n)dμ Ω min (f,n)dμ +Ω min (g,n)dμ.

Furthermore, since min (f + g,n) min (f,n) + min (g,n), we conclude that

Ω min (f + g,n)dμ Ω min (f,n)dμ +Ω min (g,n)dμ.

Taking limits as n using horizontal truncation, we obtain the claim.

5.
See the equivalent Exercise 1.4.35 (x) from Terence Tao’s An Introduction to Measure Theory.
6.
Finally, we no longer assume that μ is of finite measure, and also do not require f,g to be bounded. If either f or g is infinite, then by monotonicity, f + g is infinite as well, and the claim follows; so we may assume that f and g are both finite. By Markov’s inequality (Exercise 1.5(v)), we conclude that for each natural number n , the set E := {ω Ω : f(ω) > 1 n}{ω Ω : g(ω) > 1 n} is has finite measure. These sets are increasing in n, and f,g,f + g are supported on nEn, and so by vertical truncation Ω(f + g) = lim nΩ(f + g) 1En.

From the previous case, we have

Ω(f + g) 1En Ωf1En +Ωg1En

Letting n and using horizontal truncation we obtain the claim.

User profile picture
2021-08-09 00:00
Comments