Difference between revisions of "Extending pre-measures to outer-measures"
From Maths
(Created page with "==Statement== Given a pre-measure, {{M|\bar{\mu} }}, on a ring of sets, {{M|\mathcal{R} }}, we can define a new function, {{M|\mu^*}} which is{{rMTH}}: * an exte...") |
m |
||
Line 28: | Line 28: | ||
#*#* '''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 | #*#* '''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 | ||
{{Todo|Finish proof}} | {{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.... | ||
+ | ** This confirms it has something to do with the infimum. Investigate in the morning | ||
==References== | ==References== | ||
<references/> | <references/> | ||
{{Measure theory navbox|plain}} | {{Measure theory navbox|plain}} | ||
{{Theorem Of|Measure Theory}} | {{Theorem Of|Measure Theory}} |
Revision as of 23:26, 8 April 2016
Statement
Given a pre-measure, ˉμ, on a ring of sets, R, we can define a new function, μ∗ which is[1]:
- an extension of ˉμ and
- an outer-measure (on the hereditary σ-ring generated by R, written HσR(R))
Given by:
- μ∗:HσR(R)→ˉR≥0
- μ∗:A↦inf{∞∑n=1ˉμ(An)|(An)∞n=1⊆R∧A⊆∞⋃n=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.
- We claimed that μ∗ is an extension of ˉμ, this means that: ∀A∈R[μ∗=ˉμ]. Let us check this.
- Let A∈R be given.
- 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=1⊆R as follows:
- A1=A
- An=∅ for n≥2
- So (An)∞n=1⊆R is (A,∅,∅,…)
- Now ∑∞n=1ˉμ(An)=ˉμ(A)+ˉμ(∅)+ˉμ(∅)+…=ˉμ(A)+0+0+…=ˉμ(∅)
- We can now define a sequence, (An)∞n=1⊆R as follows:
- So μ∗(A)≤ˉμ(A) (as μ∗ is the defined as the infimum of such expressions, all we have done is find an upper-bound for it)
- Remember that ∅∈R as R is a ring of sets
- Now we must bound μ∗ below (by ˉμ(A)) to show they're equal.
- 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 A and a countably infinite or finite sequence of sets, (Ai) such that A⊆⋃iAi then ˉμ(A)≤∑iˉμ(Ai)
- Halmos handwaves here, we want to show that ˉμ(A)≤μ∗(A), however all we know is μ∗(A)≤∑iˉμ(Ai) and ˉμ(A)≤∑iˉμ(Ai) - this isn't very helpful, the solution will be in the nature of the infimum I am sure
- 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:
- First we must bound μ∗ above. This is because [μ∗(A)=ˉμ(A)]⟺[μ∗(A)≥ˉμ(A)∧ˉμ(A)≥μ∗(A)]
- Let A∈R be given.
TODO: Finish proof
- Suppose it is not true, that is that we have ˉμ(A)>μ∗(A), then ∑iˉμ(Ai)>μ∗(A)... then what....
- This confirms it has something to do with the infimum. Investigate in the morning
References
|