Difference between revisions of "Extending pre-measures to outer-measures"
From Maths
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)}} | ||
− | #*#* | + | #*#* By [[passing to the infimum]] we see that {{M|\bar{\mu}(A)\le\mu^*(A)}} as required. |
− | + | ||
− | + | ===Problems with proof=== | |
− | + | * 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
Contents
[hide]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)
- By passing to the infimum we see that ˉμ(A)≤μ∗(A) as required.
- 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.
Problems with proof
- How do we know the infimum even exists!
- For the application of passing to the infimum how do we know that the infimum involving ˉμ even exists (this probably uses monotonicity of ˉμ and should be easy to show)
References
|