Extending pre-measures to outer-measures

From Maths
Revision as of 13:42, 18 April 2016 by Alec (Talk | contribs)

Jump to: navigation, search

Statement

Given a pre-measure, ˉμ, on a ring of sets, R, we can define a new function, μ which is[1]:

Given by:

  • μ:HσR(R)ˉR0
    • μ:Ainf{n=1ˉμ(An)|(An)n=1RAn=1An}

The statement of the theorem is that this μ is indeed an outer-measure

Proof

[Expand]

Recall the definition of an outer-measure, we must show μ satisfies this.

  1. We claimed that μ is an extension of ˉμ, this means that: AR[μ=ˉμ]. Let us check this.
    • Let AR be given.
      1. First we must bound μ above. This is because [μ(A)=ˉμ(A)][μ(A)ˉμ(A)ˉμ(A)μ(A)]
        • Remember that R as R is a ring of sets
          • We can now define a sequence, (An)n=1R as follows:
            • A1=A
            • An= for n\ge 2
          • So ({ A_n })_{ n = 1 }^{ \infty }\subseteq \mathcal{R} is (A,\emptyset,\emptyset,\ldots)
          • Now \sum_{n=1}^\infty \bar{\mu}(A_n)=\bar{\mu}(A)+\bar{\mu}(\emptyset)+\bar{\mu}(\emptyset)+\ldots=\bar{\mu}(A)+0+0+\ldots=\bar{\mu}(\emptyset)
        • So \mu^*(A)\le\bar{\mu}(A) (as \mu^* is the defined as the infimum of such expressions, all we have done is find an upper-bound for it)
      2. Now we must bound \mu^* below (by \bar{\mu}(A)) to show they're equal.

Problems with proof

  • How do we know the infimum even exists!
    • Was being silly, any set of real numbers bounded below has an infimum, as \bar{\mu}:\mathcal{R}\rightarrow\bar{\mathbb{R} }_{\ge 0} we see that -1 is a lower bound for example. Having a lot of silly moments lately.
  • For the application of passing to the infimum how do we know that the infimum involving \bar{\mu} even exists (this probably uses monotonicity of \bar{\mu} and should be easy to show)

References

  1. Jump up to: 1.0 1.1 Measure Theory - Paul R. Halmos