Measure Theory

From Maths
Revision as of 21:12, 16 March 2015 by Alec (Talk | contribs)

Jump to: navigation, search

First things


Measures

To start with we define rings, for example consider the ring of all half-open-half-closed rectangles of dimension n, call this Jn

[[a,b))Jn means [a1,b1)×[a2,b2)××[an,bn)Jn

We can clearly get a ring from this, but not a σ-ring as for example:

n=1[[0,11n))=[[0,1]]Jn

The Lebesgue measure on Jn, which is λn:Jn[0,] where:

λn([[a,b)))=ni=1(biai).

Forming a ring

So let us take the one dimensional case. Consider the following J1

Example As disjoint union Measure
[0,5) (example:) [0,1)[1,2)[2,3)[3,4)[4,5) 5
[0,5)[2,5) [0,2) 2
[0,5)[1,2) [0,1)[2,5) 1+3=4
[0,5)[0,1) [1,5) 4
[0,1)[1,2) [0,2) 2
[0,1)[3,4) [0,1)[3,4) 1+1=2
Using intersection (which can be done using )
[0,5)[1,2) [1,2) 1

As you can see, we can form a ring quite easily using J1, furthermore we can express things in this ring as disjoint unions!

We may now consider R(Jn) - the ring generated by Jn, note that JnR(Jn)

With the example of n=1[[0,11n))=[[0,1]]Jn you have probably already started to suspect that the "Lesbegue measure" or "n-dimensional version of volume" for [[0,1]] may well just be 1, this intuition is correct, but we're staying in the finite deliberately right now.

Our first measure

Consider this: λn0:R(Jn)[0,], we want to be able to "measure" things in our ring. The natural way to do this is to break them down in to separate things and add the measure of each bit!

We can clearly say: λn0(A){λn(A)if AJnmi=1λn(Ai)where A=mi=1Ai, that is:

  • If A is just a rectangle, then its measure is the volume of that rectangle
  • If A is the disjoint union of some rectangles, then the volume of A is the sum of the disjoint rectangles that make it up


Intuitively we know that we want R(Jn) to be the smallest ring we can have with JnR(Jn) and using the logic described in the table above we can see that anything in this ring is the union of some (indeed finite) amount of sets in Jn


However that is not good enough! We are being formal here!


We know that Every set in R(Jn) can be finitely covered by sets in Jn, that is SR(Jn){Si}mi=1:S=mi=1Si


But we do not know that every set in R(Jn) can be finitely covered by DISJOINT sets in Jn