Lemma 1.2.15 (The measure axioms)

(i)
(Empty set axiom) m() = 0.
(ii)
(Countable additivity) If E1,E2, d is countable sequence of disjoint Lebesgue measurable sets, then m ( n=1En) = n=1m(En).

Answers

The first claim is trivial.

The second claim we prove by generalizing cases.

  • En’s are compact.
    We show that the left hand side is both greater than equal and less or equal to the right hand side.

    The first direction is trivial, and follows directly from the countable subadditivity property of the Lebesgue measure (Exercise 1.2.3):

    m ( n=1E n) i=1m(E n)

    Now we prove the other direction. Notice, that by Exercise 1.2.4 compact disjoint sets En must be separated by some set distance; by Lemma 1.2.5 we thus have the finite version of the claim: for any E1,,EN it is true that m ( n=1NEn) = i=1nm(En). By monotonicity of the Lebesgue measure

    N : m ( n=1E n) m ( n=1NE n) = i=1Nm(E n)

    By monotonicity of limits, we thus obtain by taking N from both sides:

    m ( n=1E n) i=1m(E n)

  • En’s are bounded.
    The trick is to make En’s look like they are disjoint; by Exercise 1.2.7 (v) we can replace each En by a closed (and bounded) set Kn En such that m(EnKn) = m(En) m(Kn) 𝜖2n. Again, the first direction is trivial and follows directly from the countable additivity of Lebesgue measure

    m ( n=1E n) i=1m(E n)

    On the other hand, employing the 𝜖2n and the monotonicity of series we deduce

    n=1E n n=1m(Kn) + 𝜖 = m ( n=1K n) + 𝜖 m ( n=1E n) + 𝜖

    where we have used the additivity property applied to the compact sets. The arbitrary nature of the choice of 𝜖 implies

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

    as desired.

  • General case
    Now we do not assume that En are bounded any more. The basic idea is to decompose each En as a countable disjoint union of bounded Lebesgue measurable sets. First, notice that we can decompose d as (disjoint) overlapped annuli of growing size:

    d = m=1A n := m=1 {x d : m 1 x < m}

    Then each En is the countable disjoint union of the bounded measurable sets En Am, i.e.,

    m(En) = m ( m=1E n Am) = m=1nm(E n Am)

    and thus, we apply the countable additivity for bounded sets:

    m ( n=1E n) = m ( n=1 m=1E n Am) = m ( (n,m)2En Am) = (n,m)2m (En Am) = n=1 m=1m(E n Am) = n=1m(E n)

    where in the last steps we obviously used the Tonelli’s theorem.

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