Homepage Solution manuals Terence Tao An Introduction to Measure Theory Exercise 1.7.7 (Hahn-Kolmogorov extension is unique up to a restriction)

Exercise 1.7.7 (Hahn-Kolmogorov extension is unique up to a restriction)

Let μ0 : 0 [0,+] be a pre-measure, let μ : [0,+] be the Hahn-Kolmogorov extension of μ0, and let μ : [0,+] be another countably additive extension of μ0. Suppose also that μ0 is σ-finite, which means that one can express the whole space X as the countable union of sets E1,E2, 0 for which μ0(En) < for all n. Show that μ and μ agree on their common domain of definition. In other words, show that μ(E) = μ(E) for all E .

Answers

This exercise is closely related to Exercise 1.4.28 (Approximation by an algebra).

We use the usual trick of demonstrating that the left-hand side is both less than or equal to the right-hand side and vice versa.

  • E B B : μ(E) μ(E).
    This assertion can be viewed as an implication of

    BB : μ(B) μ(B).

    Making use of the fact that μ = μ0 when restricted to B0 and μ is countably additive, we can rewrite μ(B) as follows:

    μ(B) = inf { n=1μ 0(En) | B n=1En En B0 } = inf { n=1μ(E n) | B n=1En En B0 } = inf {μ ( n=1E n) | B n=1En En B0 } .

    For an arbitrary 𝜖 > 0 approximate μ(B) by μ ( n=1En) satisfying

    μ ( n=1E n) μ(B) + 𝜖.

    By monotonicity of μ we then have

    μ(B) μ(B) + 𝜖.

    Sending 𝜖 to zero, we obtain the desired result. Notice that we have not violated the possibility of μ(E) = in any of the steps above.

  • E B B : μ(E) μ(E).
    Case I. μ(E) < .
    Let (En)nN be an outer cover of E such that n=1μ0(En) μ(E) 𝜖 2. By additivity of the measures, we then have:

    μ (E) = μ ( n=1E n) μ ( n=1E n E). By the previous part of this proof, we know that μ is greater than or equal to μ. μ ( n=1E n) μ ( n=1E n E) By the construction of (En)nN we have an upper bound on how this cover differs from E: μ ( n=1E n) 𝜖 2 = n=1μ(E n) 𝜖 2 n=1Nμ(E n) 𝜖 2 = n=1Nμ(E n) 𝜖 2 Here we spend another 𝜖2 and easily find a N N such that the series nNμ(En) is approximated by the finite sum  nNμ(En): n=1μ(E n) 𝜖 2 𝜖 2 μ ( n=1E n) 𝜖

    Sending 𝜖 0, we obtain the desired result.
    Case II. μ(E) = .
    This is where the σ-additivity property of B0 becomes crucial. Let (Xm)m be the required sequence of sets in B0, i.e., X = m=1Xn and μ0(Xn) < . By the previous part of the proof, we have:

    M : μ (E m=1MX m) μ (E m=1MX m) .

    Since both μ and μ are measures, we can send M to infinity and, using the upwards monotone convergence, conclude that both quantities become equal in infinity.

  • (Alternative proof) E B B : μ(E) μ(E).
    Alternatively, we can argue by contradiction: suppose that μ(E) > μ(E). Then we can find (En)nN such that

    μ(E) > n=1μ 0(En)

    contradicting the monotonicity of E n=1En.

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