Extending pre-measures to outer-measures

From Maths
Revision as of 22:41, 31 July 2016 by Alec (Talk | contribs) (Saving work)

Jump to: navigation, search
Caution:This page is currently being written and is not ready for being used as a reference, it's a notes quality page

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} - here inf denotes the infimum of a set.

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

Proof

[Expand]

Proof notes

[Expand]

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

For brevity we define the following shorthands:

  1. αA:={(An)n=1 | (An)n=1RAn=1An}
  2. βA:={n=1ˉμ(An) | (An)n=1αA}

Now we may define μ as:

  • μ:Ainf(βA)

Proof that μ is an extension of ˉμ

  • Let AR be given
    • In order to prove ˉμ(A)=μ(A) we need only prove [ˉμ(A)μ(A)ˉμ(A)μ(A)][Note 1]
      1. Part 1: ˉμ(A)μ(A)
        • Consider the sequence (An)n=1 given by A1:=A and Ai:= for i>1, so the sequence A,,,.
          • Clearly An=1An (as n=1An=A)
          • As such this (An)n=1αA
          • This means n=1ˉμ(An)βA (as (An)n=1αA and βA is the sum of all the pre-measures Template:WRT ˉμ of the sequences of sets in αA)
          • Recall that the infimum of a set is, among other things, a lower bound of the set. So:
            • for inf(S) (for a set, S) we see:
              • sS[inf(S)s] - this uses only the lower bound part of the infimum definition.
          • By applying this to inf(βA)(=μ(A)) we see:
            • μ(A):=inf(βA)n=1ˉμ(An)=ˉμ(A)
              • as n=1ˉμ(An)βA and inf(S) remember and
              • By definition of a (pre-)measure, μ()=0, so: n=1ˉμ(An)=ˉμ(A)+ˉμ()+ˉμ()+=ˉμ(A)
        • We have shown μ(A)ˉμ(A) as required
      2. Part 2: ˉμ(A)μ(A)

Notes

  1. Jump up This is called the trichotomy rule or something, I should link to the relevant part of a partial order here

References

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