Difference between revisions of "Extending pre-measures to outer-measures"

Revision as of 11:44, 30 July 2016

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, $\bar{\mu}$, on a ring of sets, $\mathcal{R}$, we can define a new function, $\mu^*$ which is^[1]:

• an extension of $\bar{\mu}$ and
• an outer-measure (on the hereditary $\sigma$-ring generated by $\mathcal{R}$, written $\mathcal{H}_{\sigma_R}(\mathcal{R})$)

Given by:

• $\mu^*:\mathcal{H}_{\sigma_R}(\mathcal{R})\rightarrow\bar{\mathbb{R} }_{\ge0}$
  • $$\mu^*:A\mapsto\text{inf}\left\{\left.\sum^\infty_{n=1}\bar{\mu}(A_n)\right\vert(A_n)_{n=1}^\infty\subseteq\mathcal{R}\wedge A\subseteq\bigcup_{n=1}^\infty A_n\right\}$$

The statement of the theorem is that this $\mu^*$ is indeed an outer-measure

Proof

1. We claimed that $\mu^*$ is an extension of $\bar{\mu}$, this means that: $\forall A\in\mathcal{R}[\mu^*=\bar{\mu}]$. Let us check this.
   • Let $A\in\mathcal{R}$ be given.
     1. First we must bound $\mu^*$ above. This is because $[\mu^*(A)=\bar{\mu}(A)]\iff[\mu^*(A)\ge\bar{\mu}(A)\wedge\bar{\mu}(A)\ge\mu^*(A)]$
        • Remember that $\emptyset\in\mathcal{R}$ as $\mathcal{ R }$ is a ring of sets
          • We can now define a sequence, $({ A_n })_{ n = 1 }^{ \infty }\subseteq \mathcal{R}$ as follows:
            • $A_1=A$
            • $A_n=\emptyset$ for $n\ge 2$
          • So $({ A_n })_{ n = 1 }^{ \infty }\subseteq \mathcal{R}$ is $(A,\emptyset,\emptyset,\ldots)$
          • Now $\sum_{n=1}^\infty \bar{\mu}(A_n)=\bar{\mu}(A)+\bar{\mu}(\emptyset)+\bar{\mu}(\emptyset)+\ldots=\bar{\mu}(A)+0+0+\ldots=\bar{\mu}(\emptyset)$
        • So $\mu^*(A)\le\bar{\mu}(A)$ (as $\mu^*$ is the defined as the infimum of such expressions, all we have done is find an upper-bound for it)
     2. Now we must bound $\mu^*$ below (by $\bar{\mu}(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, $(A_i)$ such that $A\subseteq\bigcup_i A_i$ then $\bar{\mu}(A)\le\sum_i\bar{\mu}(A_i)$
        • By passing to the infimum we see that $\bar{\mu}(A)\le\mu^*(A)$ as required.

Problems with proof

• How do we know the infimum even exists!
  • Was being silly, any set of real numbers bounded below has an infimum, as $\bar{\mu}:\mathcal{R}\rightarrow\bar{\mathbb{R} }_{\ge 0}$ we see that $-1$ is a lower bound for example. Having a lot of silly moments lately.
• For the application of passing to the infimum how do we know that the infimum involving $\bar{\mu}$ even exists (this probably uses monotonicity of $\bar{\mu}$ and should be easy to show)

References

1. ↑ ^{Jump up to: 1.0 1.1} Measure Theory - Paul R. Halmos