Homepage Solution manuals Terence Tao An Introduction to Measure Theory Exercise 1.2.23 (Uniqueness of Lebesgue measure)

Exercise 1.2.23 (Uniqueness of Lebesgue measure)

Let L ( d ) be the set of all Lebesgue measurable sets on d , and let

m : L ( d ) [ 0 , + ] , E m ( E )

be a map that obeys the following axioms:

(i)
(Empty set) m ( ) = 0 .
(ii)
(Countable additivity) If E 1 , E 2 , d is a contable sequence of disjoint Lebesgue measurable sets, then m ( n = 1 E n ) = n = 1 m ( E n ) .
(iii)
(Translation invariance) If E is Lebesgue measurable and x d then m ( E + x ) = m ( E ) .
(iv)
(Normalisation) m ( [ 0 , 1 ] d ) = 1

Show that m = m .

Answers

We first add extra properties to the list that we already have

(v)
(Monotonicity) If E1 E2 d is a countable sequence of Lebesgue measurable sets, then m(E1) m(E2)
(vi)
(Countable subadditivity) If E1,E2, d is a contable sequence of Lebesgue measurable sets, then m( n=1En) n=1m(En).

Monotonicity follows from additivity, since En = En1 (EnEn1) and thus m(En) = m(En1) + m(EnEn1) m(En1). The subadditivity can be shown using additivity for finite unions m( n=1NEn) n=1Nm(En). Using the convergence therems allows us to take N and obtain the coutable version.

Now we have to demonstrate that E L (d) : m(E) = m(E). We use the following strategy: we first demonstrate it for elementary sets, then for open sets, and only then do we generalise to the Lebesgue measurable sets.

  • Elementary sets
    Note that m(E) = m(E) for all A E(d) follow directly from Exercise 1.1.3, since both m and m satisfy the axioms of elementary measure together with the normalisation property.
  • Bounded open sets
    Let U be an open set with m(U) < . By famous Lemma 1.2.11 we write U as a countable union of (almost) disjoint boxes n=1Bn. We can make them disjoint by setting the boundary F := n=1Bn n=1Bn. By additivity of the both functions we want to obtain the following equality:

    m(U) = m(F) + m ( n=1B n)=??m(F) + m ( n=1B n) = m(U)

    First notice F is a Lebesgue null set m(F) = m(U)m( n=1Bn) = m( n=1Bn)m( n=1Bn) = n=1Bn n=1Bn = 0. But m and m always agree on Lebesgue null sets. If F is a null set, then we can find a box cover n=1Cn such that n=1|Cn| 𝜖. Since m and m agree on elementary sets, we have by subadditivity m(E) m( n=1Cn) n=1m(Cn) = n=1|Cn| 𝜖. Thus, m(F) = m(F) = 0. The latter terms must also agree, since this is a disjoint union of elementary sets, and the equality holds indeed./li>

  • Bounded Lebesgue measurable sets
    Let E be a bounded Lebesgue measurable set with m(E) < . We demonstrate that m(E) = m(E). Since both maps fulfill very similar properties, we give ourselves an epsilon of a room.

    • We use the outer regularity of the Lebesgue measure. Since E is bounded, we can a bounded open set U containing E such that m(U) m(E) = m(UE) 𝜖. We then have m(E) m(U) = m(U) m(E) + 𝜖. Since our choice of 𝜖 was arbitrary, m(E) m(E).
    • Since E is bounded, we can contain it in a box B E. By additivity of m we have m(B) = m(E) + m(BE) and thus

      m(E) = m(B)m(BE) = m(B)m(BE) = m(E)+m(BE)m(BE) m(E)

      where in the last step we used the same trick as in the first part of this proof to demonstrate that m(BE) m(BE).

To generalise this to any unbounded Lebesgue measurable set E, write En = E B(0,n)En1 where B(0,n) is a ball of radius n around the origin. We then have by the countable additivity of both measures

m(E) = m ( n=1E n) = n=1m(E n) = n=1m(E n) = m ( n=1E n) = m(E).

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

Proof. We already know that m(E) = m(E) for any Jordan measurable set E, and specifically for boxes.

It is simple to prove that m is sub-additive and monotone.

Step I. We show that for A L, if m(A) = 0 then m(A) = 0 : Let A be a Lebesgue measurable set of 0 measure, m(A) = 0. For any 𝜀 > 0, let (Bn) n be a sequence of boxes such that A nBn and such that n |Bn| 𝜀. Then, m(A) nm (Bn) = n |Bn| 𝜀, and taking 𝜀 0, we have that m(A) = 0.

Step II. We show that if U is open of finite Lebesgue measure, then m(U) = m(U) : Let U be an open set such that m(U) < . Write U = nBn where (Bn) n are almost disjoint closed boxes. Let Bn = (Bn) , so (Bn)n are pairwise disjoint. Let F = nBn nBn. Since

m(F) = m(U) m ( nBn) = n |Bn| n |Bn| = 0,

we have that m(F) = 0. Note that U = F nBn, so

m(U) = m(F) + nm (B n) = n |Bn| = m(U).

Step III. We show that for any A L, the inequality m(A) m(A) holds: Let A be a Lebesgue measurable set with m(A) < . Fix 𝜀 > 0 and let U be an open set such that A U and m(U) m(A) = m(UA) < 𝜀. Then, m(A) m(U) m(A) + 𝜀. Taking 𝜀 0 we have that for any A L, the inequality m(A) m(A) holds. (The case where m(A) = is immediate.)

Step IV. We show that for any bounded set A L we have m(A) = m(A) : Let A L be a bounded set. Let B be a box bounding A B. We have m(BA) = m(B) m(A) by additivity of m. Also,

m(A) m(A) = m(B) m(BA) m(B) m(BA) = m(A).

Step V. We show that for any A L we have m(A) = m(A) : Let A L. Write A = An where An = BnBn1, and Bn = [n,n]d. Then by additivity of both m,m and since An are all bounded,

m(A) = nm (A n) = nm (An) = m(A).

User profile picture
2021-12-04 17:38
Comments