Measure Theory/Length Measure

From testwiki
Jump to navigation Jump to search

Length Measure

We now have a good introductory comprehension of the outer measure, λ*. What we wanted this whole time, though, was the measure function, which we'll call λ. Finally now we are in a position to state its definition.

Recall that in previous lessons we stated that λ will simply be the same thing as λ*, except with its domain restricted to "nice" or "not weird" sets. We can nearly say what the nice sets are, and therefore specify the domain restriction.

But first we must introduce the inner measure.

Inner Measure

You have probably noticed a somewhat curious asymmetry in the definition of the outer measure. Why take over-approximations? Could we have taken under-approximations instead?

Indeed we could have. Template:H:title

This is exactly what the inner measure does.

Template:Definition

We could, but will not, go through all the same sorts of theorems for inner measure which we just finished for outer measure. Rather, we will simply take some results about inner measure for granted. The reader is free to research the proofs of these facts independently.

Measurable Sets

The strategy for defining the measurable sets is extremely similar to the way in which we define integrable functions in elementary analysis.

Template:Definition

Now since we are not going to seriously study the inner measure, I need to give you another way to tell whether a set is measurable or not.

Template:H:title

Template:Definition

Template:H:title Template:Robelbox Let E be a set of real numbers. Then E is measurable if and only if E splits every set cleanly. Template:Robelbox/close

The condition that a set splits every set cleanly, is called the "Caratheodory condition" in honor of its discoverer. Template:Robelbox Prove that the empty set is measurable, .

Template:Robelbox/close Template:Robelbox Prove that every null set is measurable. That is to say, if N is a null set, then N.

Template:Robelbox/close Template:Robelbox Let E be any measurable set. Prove that the complement is also measurable, Ec.

Template:Robelbox/close

Open Rays Are Measurable

Since the whole point of the project is to measure intervals and interval-like-things, we would like to prove that intervals are measurable.

The proof is not very easy though. One way to simplify the proof is to consider only intervals of the form (a,), which we call a "ray" of real numbers. The fact that it only has one end-point makes it a little bit easier to use than a bounded interval.

We now set for ourselves the proof of the following theorem. Template:Robelbox Let a. Then the open right ray (a,) is measurable, (a,). Template:Robelbox/close Let I=(a,), and let A be arbitrary. We need to show that I splits A cleanly.

As is typical for proofs in analysis, we will approach the problem by proving two inequalities.

λ*(A)λ*(AI)+λ*(AI)

and

λ*(A)λ*(AI)+λ*(AI)

But notice that in fact the first inequality follows immediately from subadditivity. In fact, whenever proving that a set splits another cleanly, we can always use subadditivity for the direction.

Therefore we only need to prove the second inequality. Template:Robelbox Consider the case that λ*(A)= and state why, in this case, there is nothing to prove.

Template:Robelbox/close

Due to the result above, we will assume throughout the rest of the proof that λ*(A) is finite.

We will initially assume a∉A. This is simplifying, and once we have proved our theorem in this case, we can use the narrow result to prove the theorem in the case where aA.

The high-level strategy of our proof will be to show that λ*(AI)+λ*(AI) is a lower bound on the set of over-estimates of A. From this, the needed inequality follows immediately.

To begin, let ε+ and let 𝔒 be open interval over-approximations of A such that

J𝔒(J)<λ*(A)+ε

Template:Robelbox Show that 𝔓={UI|U𝔒} is an open interval over-approximation of AI.

Also do similarly for AI. When you decide what the open interval over-approximation of AI should be, call it 𝔔.

Now show that, for any U𝔒,

(U)=(UI)+(UI)

Hint: U cannot be infinite in length, otherwise the over-estimate above is infinite, in which case it cannot be strictly bounded by any number.

Therefore U=(b,c) for finite real numbers b,c.

Template:Robelbox/close Template:Robelbox Justify why

λ*(AI)+λ*(AI)J𝔓(J)+K𝔔(K)

and why the right-hand side equals

L𝔒(L)

which is less than

λ*(A)+ε

Then conclude the proof that λ*(A)λ*(AI)+λ*(AI).

Template:Robelbox/close Template:Robelbox Finally, prove λ*(A)λ*(AI)+λ(AI) in the case that aA.

Hint: By an earlier exercise, you can show all three of

λ*(A)=λ*(A{a})
λ*(AI)=λ*([A{a}]I])
λ*(AI)=λ*([A{a}]I])

Now apply the result of Exercise 5. Using the Split Covers to the set A{a}.

Template:Robelbox/close

Length Measure

Template:Definition

Note that the only way in which λ and λ* differ is by their domain. The former has domain while the latter has 𝒫().

Whenever the set E is measurable we will prefer to write λ(E) instead of λ*(E) even though they technically mean the same thing. When a set is not necessarily measurable we will be required to write λ*(A).

Therefore we are now justified in writing, for example,

  • λ()=0
  • λ()=0
  • λ((0,))=

On the other hand, if F is the feather set from the Vitali proof that there is no total measure function, then one would have to write λ*(F) since we have no current reason to think that it is measurable.

Template:CourseCat