Exercise 1.7.9 (Approximation by an algebra II)

Let μ 0 : B 0 → [ 0 , + ∞ ] be a pre-measure which is σ -finite (thus X is the countable union of sets in B 0 of finite μ 0 -measure), and let μ : B → [ 0 , + ∞ ] be the Hahn-Kolmogorov extension of μ 0 .

(i)
Show that if E ∈ B , then there exists F ∈ ⟨ B 0 ⟩ containing E such that μ ( F ∖ E ) = 0 (thus F consists of the union of E and a null set). Furthermore, show that F can be chosen to be a countable intersection F = ⋂ ⁡ n = 1 ∞ F n of sets F n , each of which is a countable union F n = ⋃ ⁡ m = 1 ∞ F n , m of sets F n , m in B 0 .
(ii)
If E ∈ B has finite measure (i.e. μ ( E ) < ∞ ), and 𝜀 > 0 , show that there exists F ∈ B 0 such that μ ( E Δ F ) ≤ 𝜀 .
(iii)
Conversely, if E is a set such that for every 𝜀 > 0 there exists F ∈ B 0 such that μ ∗ ( E Δ F ) ≤ 𝜀 , show that E ∈ B .

Answers

(i)
Let E ∈B. First, suppose additionally that μ(E) < ∞∗. Let 1 n > 0,n ∈ ℕ be arbitrary. By definition of the outer measure, we can find a sequence (Em)m∈ℕ in B0 such that μ (E) + 1 n ≥∑ m=1∞μ 0(Em).

Using the axiom of choice, for each n ∈ ℕ pick a sequence (Em(n)) m∈ℕ in B0 with the above property. Denoting Fn := ⋃ ⁡ m=1∞Em(n) ∈⟨B0⟩ we immediate that

∀ ⁡n ∈ ℕ : μ (⋂ n=1∞F n ∖ E) ≤ μ (Fn ∖ E)≤∗∑ m=1∞μ (E m(n)) − μ(E) ≤ 1 n.

Thus, by setting

F := ⋂ n=1∞⋃ m=1∞E m(n)

we obtain the desired result.
In the case when μ(E) = ∞, we can call our right to find the sequence (Xm)m∈N in B0 with X = ⋃ ⁡ Xm and μ0(Xm) < ∞ and consider covers E ∩ (⋃ ⁡ m=1MXm) for each M ∈ 𝕄. Then, apply the previous part to each of these sets separately and take countable unions over M.

(ii)
Fix an 𝜖 > 0. Using a similar strategy to those we have employed in the first part of this proof, find a sequence (Em)m∈ℕ in B0 such that by the definition of μ∗ we have μ(E) + 𝜖 2 < ∑ m=1∞μ(E m).

Unfortunately, ⋃ ⁡ m∈NEm is not necessarily contained in B0, but ⋃ ⁡ m≤MEm is, of which we make use. Set FM := ⋃ ⁡ m=1MEm. We need to demonstrate that the following quantity can get arbitrarily small.

μ (FM△E) = μ(F ∖ E) + μ(E ∖ F) = μ (⋃ m=1ME m ∖ E) + μ (E ∖⋃ m=1ME m)

We immediately observe two symmetric facts:

  • On one hand, ⋃ ⁡ m=11Em ∖ E ⊆⋃ m=1MEm ∖ E ⊆… is an increasing sequence of B0-measurable sets. This allows us to apply the upwards monotone convergence and conclude that

    lim ⁡ M→∞μ (⋃ m=1ME m ∖ E) = μ (⋃ m=1∞E m ∖ E) = ∑ m=1∞μ(E m)−μ(E) < 𝜖 2.

    Thus, we can choose M1 ∈N large enough so that μ (⋃ ⁡ m=1M1Em ∖ E) ≤ 𝜖∕2.

  • On the other hand, E ∖⋃ ⁡ m=11Em ⊇ E ∖⋃ m=1MEm ⊇… is a decreasing sequence of B0-measurable sets. This allows us to apply the downwards monotone convergence and conclude that

    lim ⁡ M→∞μ (E ∖⋃ m=1ME m) = μ (E ∖⋃ m=1∞E m) = 0.

    Once again, we choose M2 ∈N large enough so that μ (E ∖⋃ ⁡ m=1MEm) ≤ 𝜖∕2.

Finally, combining these two results by setting M := max ⁡ {M1,M2} gives us the desired result μ(FM△E) ≤ 𝜖.

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