Difference between revisions of "Extending pre-measures to outer-measures"

From Maths
Jump to: navigation, search
m
m
Line 26: Line 26:
 
#*#* Using [[the (pre-)measure of a set is no more than the sum of the (pre-)measures of the elements of a covering for that set]], which states, symbolically:
 
#*#* Using [[the (pre-)measure of a set is no more than the sum of the (pre-)measures of the elements of a covering for that set]], which states, symbolically:
 
#*#** Given a set {{M|A}} and a [[countably infinite]] or [[finite]] ''[[sequence]]'' of sets, {{M|(A_i)}} such that {{M|A\subseteq\bigcup_i A_i}} then {{M|\bar{\mu}(A)\le\sum_i\bar{\mu}(A_i)}}
 
#*#** Given a set {{M|A}} and a [[countably infinite]] or [[finite]] ''[[sequence]]'' of sets, {{M|(A_i)}} such that {{M|A\subseteq\bigcup_i A_i}} then {{M|\bar{\mu}(A)\le\sum_i\bar{\mu}(A_i)}}
#*#* '''Halmos handwaves here''', we want to show that {{M|\bar{\mu}(A)\le\mu^*(A)}}, however all we know is {{M|\mu^*(A)\le\sum_i\bar{\mu}(A_i)}} and {{M|\bar{\mu}(A)\le\sum_i\bar{\mu}(A_i)}} - this isn't very helpful, the solution will be in the nature of the [[infimum]] I am sure
+
#*#* By [[passing to the infimum]] we see that {{M|\bar{\mu}(A)\le\mu^*(A)}} as required.
{{Todo|Finish proof}}
+
 
* Suppose it is not true, that is that we have {{M|\bar{\mu}(A)>\mu^*(A)}}, then {{M|\sum_i\bar{\mu}(A_i)>\mu^*(A)}}... then what....
+
===Problems with proof===
** This confirms it has something to do with the infimum. Investigate in the morning
+
* How do we know the [[infimum]] even exists!
 +
* For the application of ''[[passing to the infimum]]'' how do we know that the [[infimum]] involving {{M|\bar{\mu} }} even exists (this probably uses [[monotonic|monotonicity]] of {{M|\bar{\mu} }} and should be easy to show)
 
==References==
 
==References==
 
<references/>
 
<references/>
 
{{Measure theory navbox|plain}}
 
{{Measure theory navbox|plain}}
 
{{Theorem Of|Measure Theory}}
 
{{Theorem Of|Measure Theory}}

Revision as of 09:30, 16 April 2016

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 n2
          • So (An)n=1R is (A,,,)
          • Now n=1ˉμ(An)=ˉμ(A)+ˉμ()+ˉμ()+=ˉμ(A)+0+0+=ˉμ()
        • So μ(A)ˉμ(A) (as μ 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 μ below (by ˉμ(A)) to show they're equal.

Problems with proof

References

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