Difference between revisions of "Measure Theory"
(Created page with "==First things== * Ring of sets * Algebra of sets * Sigma-ring * Sigma-algebra Category:Measure Theory") |
m (→Our first measure) |
||
(4 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
+ | {{Extra Maths}} | ||
==First things== | ==First things== | ||
* [[Ring of sets]] | * [[Ring of sets]] | ||
Line 4: | Line 5: | ||
* [[Sigma-ring]] | * [[Sigma-ring]] | ||
* [[Sigma-algebra]] | * [[Sigma-algebra]] | ||
+ | |||
+ | |||
+ | ==Measures== | ||
+ | To start with we define [[Ring of sets|rings]], for example consider the ring of all half-open-half-closed rectangles of dimension {{M|n}}, call this <math>\mathcal{J}^n</math> | ||
+ | |||
+ | <math>[[a,b))\in\mathcal{J}^n</math> means <math>[a_1,b_1)\times[a_2,b_2)\times\cdots\times[a_n,b_n)\in\mathcal{J}^n</math> | ||
+ | |||
+ | We can clearly get a ring from this, but not a [[Sigma-ring|{{Sigma|ring}}]] as for example: | ||
+ | |||
+ | <math>\bigcup^\infty_{n=1}[[0,1-\tfrac{1}{n}))=[[0,1]]\notin\mathcal{J}^n</math> | ||
+ | |||
+ | The [[Lebesgue measure]] on <math>\mathcal{J}^n</math>, which is <math>\lambda^n:\mathcal{J}^n\rightarrow[0,\infty]</math> where: | ||
+ | |||
+ | <math>\lambda^n\Big([[a,b))\Big)=\prod^n_{i=1}(b_i-a_i)</math>. | ||
+ | |||
+ | ===Forming a ring=== | ||
+ | So let us take the one dimensional case. Consider the following <math>\in\mathcal{J}^1</math> | ||
+ | {| class="wikitable" border="1" | ||
+ | |- | ||
+ | ! Example | ||
+ | ! As disjoint union | ||
+ | ! Measure | ||
+ | |- | ||
+ | | {{M|[0,5)}} | ||
+ | | (example:) {{M|[0,1)\cup[1,2)\cup[2,3)\cup[3,4)\cup[4,5)}} | ||
+ | | {{M|5}} | ||
+ | |- | ||
+ | | {{M|[0,5)-[2,5)}} | ||
+ | | {{M|[0,2)}} | ||
+ | | {{M|2}} | ||
+ | |- | ||
+ | | {{M|[0,5)-[1,2)}} | ||
+ | | {{M|[0,1)\cup[2,5)}} | ||
+ | | {{M|1=1+3=4}} | ||
+ | |- | ||
+ | | {{M|[0,5)-[0,1)}} | ||
+ | | {{M|[1,5)}} | ||
+ | | {{M|4}} | ||
+ | |- | ||
+ | | {{M|[0,1)\cup[1,2)}} | ||
+ | | {{M|[0,2)}} | ||
+ | | {{M|2}} | ||
+ | |- | ||
+ | | {{M|[0,1)\cup[3,4)}} | ||
+ | | {{M|[0,1)\cup[3,4)}} | ||
+ | | {{M|1=1+1=2}} | ||
+ | |- | ||
+ | !colspan="3"|Using intersection (which can be done using {{M|-}}) | ||
+ | |- | ||
+ | | {{M|[0,5)\cap[1,2)}} | ||
+ | | {{M|[1,2)}} | ||
+ | | {{M|1}} | ||
+ | |} | ||
+ | |||
+ | As you can see, we can form a ring quite easily using {{M|\mathcal{J}^1}}, furthermore we can express things in this ring as disjoint unions! | ||
+ | |||
+ | We may now consider <math>R(\mathcal{J}^n)</math> - the [[Ring generated by|ring generated by {{M|\mathcal{J}^n}}]], note that <math>\mathcal{J}^n\subset R(\mathcal{J}^n)</math> | ||
+ | |||
+ | With the example of <math>\bigcup^\infty_{n=1}[[0,1-\tfrac{1}{n}))=[[0,1]]\notin\mathcal{J}^n</math> you have probably already started to suspect that the "Lesbegue measure" or "n-dimensional version of volume" for <math>[[0,1]]</math> may well just be 1, this intuition is correct, but we're staying in the finite | ||
+ | deliberately right now. | ||
+ | |||
+ | ==Our first measure== | ||
+ | Consider this: <math>\lambda_0^n:R(\mathcal{J}^n)\rightarrow[0,\infty]</math>, 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: <math>\lambda_0^n(A)\mapsto\left\{\begin{array}{lr} | ||
+ | \lambda^n(A) & \text{if }A\in\mathcal{J}^n\\ | ||
+ | \sum^m_{i=1}\lambda^n(A_i) & \text{where }A=\bigudot^m_{i=1}A_i | ||
+ | \end{array}\right.</math>, that is: | ||
+ | |||
+ | * If {{M|A}} is just a rectangle, then its measure is the volume of that rectangle | ||
+ | * If {{M|A}} is the disjoint union of some rectangles, then the volume of {{M|A}} is the sum of the disjoint rectangles that make it up | ||
+ | |||
+ | |||
+ | Intuitively we know that we want <math>R(\mathcal{J}^n)</math> to be the smallest ring we can have with <math>\mathcal{J}^n\subset R(\mathcal{J}^n)</math> 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 <math>\mathcal{J}^n</math> | ||
+ | |||
+ | |||
+ | However that is not good enough! We are being formal here! | ||
+ | |||
+ | |||
+ | We know that [[Ring generated by#Every set in R(A) can be finitely covered by sets in A|Every set in {{M|R(\mathcal{J}^n)}} can be finitely covered by sets in {{M|\mathcal{J}^n}}]], that is <math>\forall S\in R(\mathcal{J}^n)\exists \{S_i\}_{i=1}^m:S=\cup^m_{i=1}S_i</math> | ||
+ | |||
+ | |||
+ | But we do not know that every set in {{M|R(\mathcal{J}^n)}} can be finitely covered by DISJOINT sets in {{M|\mathcal{J}^n}} | ||
+ | |||
+ | {{Begin Theorem}} | ||
+ | Theorem to show that every set in {{M|R(\mathcal{J}^n)}} may be covered by a disjoint finite selection in {{M|\mathcal{J}^n}} | ||
+ | {{Begin Proof}} | ||
+ | {{Todo|Todo finite ring proof for Lebesgue measure}} | ||
+ | Took me a while to work it out - will do later. Isn't that bad. Induction induction and more induction! | ||
+ | {{End Proof}} | ||
+ | {{End Theorem}} | ||
+ | |||
+ | |||
+ | |||
+ | Now <math>\lambda_0^n(A)\mapsto\left\{\begin{array}{lr} | ||
+ | \lambda^n(A) & \text{if }A\in\mathcal{J}^n\\ | ||
+ | \sum^m_{i=1}\lambda^n(A_i) & \text{where }A=\bigudot^m_{i=1}A_i | ||
+ | \end{array}\right.</math> satisfies the definition of a [[Pre-measure]] | ||
+ | |||
+ | ==Extending to measures== | ||
+ | |||
+ | |||
+ | |||
[[Category:Measure Theory]] | [[Category:Measure Theory]] |
Latest revision as of 01:41, 28 March 2015
[math]\newcommand{\bigudot}{ \mathchoice{\mathop{\bigcup\mkern-15mu\cdot\mkern8mu}}{\mathop{\bigcup\mkern-13mu\cdot\mkern5mu}}{\mathop{\bigcup\mkern-13mu\cdot\mkern5mu}}{\mathop{\bigcup\mkern-13mu\cdot\mkern5mu}} }[/math][math]\newcommand{\udot}{\cup\mkern-12.5mu\cdot\mkern6.25mu\!}[/math][math]\require{AMScd}\newcommand{\d}[1][]{\mathrm{d}^{#1} }[/math]
First things
Measures
To start with we define rings, for example consider the ring of all half-open-half-closed rectangles of dimension [ilmath]n[/ilmath], call this [math]\mathcal{J}^n[/math]
[math][[a,b))\in\mathcal{J}^n[/math] means [math][a_1,b_1)\times[a_2,b_2)\times\cdots\times[a_n,b_n)\in\mathcal{J}^n[/math]
We can clearly get a ring from this, but not a [ilmath]\sigma[/ilmath]-ring as for example:
[math]\bigcup^\infty_{n=1}[[0,1-\tfrac{1}{n}))=[[0,1]]\notin\mathcal{J}^n[/math]
The Lebesgue measure on [math]\mathcal{J}^n[/math], which is [math]\lambda^n:\mathcal{J}^n\rightarrow[0,\infty][/math] where:
[math]\lambda^n\Big([[a,b))\Big)=\prod^n_{i=1}(b_i-a_i)[/math].
Forming a ring
So let us take the one dimensional case. Consider the following [math]\in\mathcal{J}^1[/math]
Example | As disjoint union | Measure |
---|---|---|
[ilmath][0,5)[/ilmath] | (example:) [ilmath][0,1)\cup[1,2)\cup[2,3)\cup[3,4)\cup[4,5)[/ilmath] | [ilmath]5[/ilmath] |
[ilmath][0,5)-[2,5)[/ilmath] | [ilmath][0,2)[/ilmath] | [ilmath]2[/ilmath] |
[ilmath][0,5)-[1,2)[/ilmath] | [ilmath][0,1)\cup[2,5)[/ilmath] | [ilmath]1+3=4[/ilmath] |
[ilmath][0,5)-[0,1)[/ilmath] | [ilmath][1,5)[/ilmath] | [ilmath]4[/ilmath] |
[ilmath][0,1)\cup[1,2)[/ilmath] | [ilmath][0,2)[/ilmath] | [ilmath]2[/ilmath] |
[ilmath][0,1)\cup[3,4)[/ilmath] | [ilmath][0,1)\cup[3,4)[/ilmath] | [ilmath]1+1=2[/ilmath] |
Using intersection (which can be done using [ilmath]-[/ilmath]) | ||
[ilmath][0,5)\cap[1,2)[/ilmath] | [ilmath][1,2)[/ilmath] | [ilmath]1[/ilmath] |
As you can see, we can form a ring quite easily using [ilmath]\mathcal{J}^1[/ilmath], furthermore we can express things in this ring as disjoint unions!
We may now consider [math]R(\mathcal{J}^n)[/math] - the ring generated by [ilmath]\mathcal{J}^n[/ilmath], note that [math]\mathcal{J}^n\subset R(\mathcal{J}^n)[/math]
With the example of [math]\bigcup^\infty_{n=1}[[0,1-\tfrac{1}{n}))=[[0,1]]\notin\mathcal{J}^n[/math] you have probably already started to suspect that the "Lesbegue measure" or "n-dimensional version of volume" for [math][[0,1]][/math] may well just be 1, this intuition is correct, but we're staying in the finite deliberately right now.
Our first measure
Consider this: [math]\lambda_0^n:R(\mathcal{J}^n)\rightarrow[0,\infty][/math], 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: [math]\lambda_0^n(A)\mapsto\left\{\begin{array}{lr} \lambda^n(A) & \text{if }A\in\mathcal{J}^n\\ \sum^m_{i=1}\lambda^n(A_i) & \text{where }A=\bigudot^m_{i=1}A_i \end{array}\right.[/math], that is:
- If [ilmath]A[/ilmath] is just a rectangle, then its measure is the volume of that rectangle
- If [ilmath]A[/ilmath] is the disjoint union of some rectangles, then the volume of [ilmath]A[/ilmath] is the sum of the disjoint rectangles that make it up
Intuitively we know that we want [math]R(\mathcal{J}^n)[/math] to be the smallest ring we can have with [math]\mathcal{J}^n\subset R(\mathcal{J}^n)[/math] 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 [math]\mathcal{J}^n[/math]
However that is not good enough! We are being formal here!
We know that Every set in [ilmath]R(\mathcal{J}^n)[/ilmath] can be finitely covered by sets in [ilmath]\mathcal{J}^n[/ilmath], that is [math]\forall S\in R(\mathcal{J}^n)\exists \{S_i\}_{i=1}^m:S=\cup^m_{i=1}S_i[/math]
But we do not know that every set in [ilmath]R(\mathcal{J}^n)[/ilmath] can be finitely covered by DISJOINT sets in [ilmath]\mathcal{J}^n[/ilmath]
Theorem to show that every set in [ilmath]R(\mathcal{J}^n)[/ilmath] may be covered by a disjoint finite selection in [ilmath]\mathcal{J}^n[/ilmath]
TODO: Todo finite ring proof for Lebesgue measure
Took me a while to work it out - will do later. Isn't that bad. Induction induction and more induction!
Now [math]\lambda_0^n(A)\mapsto\left\{\begin{array}{lr}
\lambda^n(A) & \text{if }A\in\mathcal{J}^n\\
\sum^m_{i=1}\lambda^n(A_i) & \text{where }A=\bigudot^m_{i=1}A_i
\end{array}\right.[/math] satisfies the definition of a Pre-measure