Measure Theory/Outer Measure

Outer Measure

In the previous lesson we learned that there is no total measure on all real numbers.

We also learned that, of all the properties used in the proof, we were apparently not willing to give up any of them.

But perhaps we can make progress by thinking more about that "feather" set F, used in the proof.

The problem with this set is that it is "weird", and trying to measure it causes problems.

Can we perhaps have a system of measuring intervals, and then disjoint unions of intervals, and so on -- but avoid trying to measure sets that are weird, like F?

This is precisely the strategy that we will now pursue.

We cannot currently say which sets are "weird". But we can get started on this project, by trying to measure sets in the most "real analysis way" possible: Find reasonable approximations, and then let the error go to zero.

Approximations

Recall that the most bedrock principle that we have is,

Therefore, it makes sense that if we have an arbitrary set $A\subseteq ℝ$, we might approximate this set by Template:H:title

Template:Definition Template:Robelbox Show that every subset of real numbers, $A\subseteq ℝ$, has at least one open interval over-approximation.

Hint: The collection $𝔒$ can even be chosen to be a singleton.

Template:Robelbox/close Template:Robelbox True or false: The collection $\{(-1,1),(0,2)\}$ is an open interval over-approximation of the set $[0,1]$.

Estimates

For each over-approximation, there corresponds a number, an "over-estimate".

Note that because the sums here are over nonnegative terms, then the order in which the terms appear is unimportant. This is why we may merely sum over the set, rather than give it any specific indexing which would impose an ordering on the terms. Template:Robelbox Given the open interval over-approximation $\{(0,1),(0,2)\}$, compute its corresponding over-estimate.

Do the same for the open interval over-approximation $\{(0,1),(0,1/2),(0,1/4),(0,1/8),...\}$.

Template:Robelbox/close Template:Robelbox Show that every over-estimate of any set is always nonnegative. (In the extended real numbers we include $\mathrm{\infty }$ as a positive value.)

Outer Measure

In a sense, to measure a set, we would like to find its "least" over-estimate. This is an "approximate from above" strategy.

But a set may not have a least element, and therefore what we truly want is the infimum.

Template:Definition Template:Robelbox Prove that for every subset of real numbers, its outer length-measure always exists and is nonnegative. Hint: Use Exercise 1. and Exercise 4.

Initially it seems that the over-approximations may be uncountable, and that is true. This might cause us to worry that we will need to frequently compute uncountable sums, which is unwieldy.

However, there is a well-known result about uncountable sums of nonnegative quantities: Either the sum is infinity or only countably many terms are nonzero. This is shown in, for example, Terence Tao's Analysis II. Template:Robelbox Show that for any set of real numbers, $A\subseteq ℝ$,

${\lambda }^{*}(A)=\{\sum _{I\in 𝔒}\ell (I):𝔒\text{ is an countable open interval over-approximation of }A\}$

Assume in your proof the following fact: Every uncountable sum is either infinity, or has at most a countable number of nonzero terms.

(The proof of this fact can be found in several places. One of them is in the second volume of Tao's analysis series.) Template:Robelbox/close

Because of the result above, whenever considering the outer measure of a set, we will only ever consider its countable open interval over-approximations. Template:Robelbox Prove that ${\lambda }^{*}$ is translation-invariant. That is to say, for any subset $A\subseteq ℝ$ and real number $r\in ℝ$, define

$A+r=\{a+r|a\in A\}$

Now prove that ${\lambda }^{*}(A)={\lambda }^{*}(A+r)$.

Hint: The basic strategy is just what you would think it is. Take any open interval over-approximation for one set and show that its translation is an open interval over-approximation for the other set. Then argue that A and $A+r$ have exactly the same set of over-estimates. Therefore they have the same outer measure.

Template:Robelbox/close Template:Robelbox Prove that ${\lambda }^{*}$ is monotonic. That is to say, if $A\subseteq B\subseteq ℝ$ are two subsets of real numbers, one containing the other, then

${\lambda }^{*}(A)\le {\lambda }^{*}(B)$

Hint: Recall that if $X\subseteq Y\subseteq ℝ$ then $\inf Y\le \inf X$.

If you don't recall this fact, then proving it would be a good exercise to practice the fundamentals of infima.

Then show that every open interval over-estimate of B is necessarily an open interval over-estimate of A. Infer that the set of over-estimates of B, $𝔉$ is a subset of the set of over-estimates of A, $𝔈$. Infer that $\inf 𝔈\le \inf 𝔉$.

The ε/2ⁿ Trick

In this subsection, we will prove that every countable set is a null set.

The proof is a good demonstration of a tool we will need often, called the

"$\epsilon /2^n$ trick".

Let $A\subseteq ℝ$ be a countable subset of real numbers. As such it must have an enumeration, which we may represent by the sequence $a_1,a_2,\dots \in A$.

Template:H:title $I_n=(a_n-\epsilon /2^n,a_n+\epsilon /2^n)$. This is of course where the trick gets its very unimaginative name.

Notice that for each $n\in \mathbb{N}$ we have $a_n\in I_n$.

Template:H:title $\ell (I_n)=\epsilon /2^{n-1}$.

$\sum _{n=1}^{\mathrm{\infty }}\ell (I_n)=\sum _{n=1}^{\mathrm{\infty }}\epsilon /2^{n-1}=2\epsilon$

We can now say that the set of over-estimates contains $2\epsilon$ for every positive real $\epsilon$. Therefore ${\lambda }^{*}(A)\le 0$ and since ${\lambda }^{*}$ is nonnegative then ${\lambda }^{*}(A)=0$.

This proves that A is a null set.

$◻$

Template:Robelbox Confirm my claim above that

$\ell (a_n-\epsilon ,a_n+\epsilon )=2\epsilon$

Template:CourseCat