Measure Theory/The Measurable Sets Form a Sigma-algebra

From testwiki
Revision as of 01:17, 19 February 2024 by imported>Addemf
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

The Measurable Sets Form a Sigma-algebra

In a previous exercise you showed that if E then Ec. This is called "closure under complements".

Here we will prove other useful closure properties, such as closure under unions and closure under intersections.

Template:Robelbox

Suppose that is closed under all unions. That is to say, if 𝒫() is any collection of measurable sets, then

EE

Show that, in that case, =𝒫().

Does this make you suspect that is or is not closed under arbitrary unions? (We will answer this question more formally in the next lesson.)

Template:Robelbox/close

Closure Under Union

Exercise 1. Not All Unions hints to us that is not closed under so-called "arbitrary unions". But perhaps there is some weaker closure property for unions that it still satisfies?

Let's try to prove closure under just pairwise unions.

Let E,F and we will try to show that EF.

Let A and we need to show that EF splits A cleanly. As usual, we only need to show one direction,

λ*(A)λ*(A[EF])+λ*(A[EF])

because the other direction is handled automatically by subadditivity.

Because this proof can get complicated, it may help to name all the relevant components of the set EF in the following way.

  • EF=E11
  • EFc=E10
  • EcF=E01
  • EcFc=E00

Notice that with this naming system, EF=E11E10E01. Therefore the right-hand side of the inequality that we seek to prove is

λ*(A[EF])+λ*(A[EF])

which is now the same as

λ*([AE11][AE10][AE01])+λ*(AE00)

Template:Robelbox

Complete the proof of closure under pairwise union by following these steps.

1. Strategically apply subadditivity.  That is to say, do not fully distribute the λ* to every unioned set above.  Keep inside of the λ* those sets with initial index 1.
2.  For the stuff left not distributed, reorganize this into λ*(AE).
3.  Use the fact that F is measurable, applied to the set AEc, to "factor out" a λ*.  Then reorganize this.
4.  Use the fact that E is measurable.

Template:Robelbox/close

Closure under Finite Unions

Now that we have closure under pairwise unions, this generalizes easily to closure under finite unions.

Template:Robelbox

This time I won't tell you exactly the theorem to state. Rather, it is your job to both formalize the theorem for finite unions, and then to prove it.

Template:Robelbox/close

Closure under Countable Unions

Finally we show closure under countable unions.

Let E1,E2, be any countable collection of measurable sets, and A. As always, we need

λ*(A)λ*(Ai=1Ei)+λ*(Ai=1Ei)

By the result for finite additivity, we know that for each n,

λ*(A)λ*(Ai=1nEi)+λ*(Ai=1nEi)

Template:Robelbox

Explain why λ(Ai=1nEi)λ(Ai=1Ei)

Template:Robelbox/close

Template:Robelbox

Prove that limnλ*(Ai=1nEi)=λ*(Ai=1Ei) by completing the following steps.

1. For a fixed n, prove λ*(Ai=1nEi)=λ*((Ai=1nEi)En)+λ*((Ai=1nEi)En).  Then simplify (Ai=1nEi)En and (Ai=1nEi)En.  
2. Use (1.) to prove by induction that λ*(Ai=1nEi)=i=1nλ*(AEi).  
3. Prove that i=1nλ(AEi)i=1λ(AEi).
4. Take a limit as n and infer the result.

Template:Robelbox/close

Intersections

Template:Robelbox

Use closure under complements and closure under countable unions to easily infer closure under countable intersections.

Template:Robelbox/close

Sigma Algebra

Template:Definition

Template:Robelbox

Prove that is a σ-algebra. (The proof should merely reference results that we've already proved elsewhere.)

(Note: As of right now the concept of a σ-algebra isn't terribly useful. However, if and when I extend this course to cover topics in general measure theory rather than just Lebesgue measure, the concept will become more important.)

Template:Robelbox/close

All Intervals

In a previous lesson we showed that the open rays, (a,), are all measurable.

Template:Robelbox

Now use the σ-algebra properties of to show that every other interval is measurable. Note: Intervals may be closed, open, or neither. They may also be bounded or unbounded.

Template:Robelbox/close










Template:CourseCat