Functional Analysis Lecture 7

[[lecture-data]]

← Lecture 6 | Lecture 8 → Lecture Notes: Rodriguez, page 31

 

2. Lebesgue Measure and Integration

Recall we defined

Outer Measure

For , we define the outer measure of m^*(A) = \inf\left\{ \sum_{n} \ell(I_{n}) : \{ I_{n} \} \text{ countable and open s.t. } A \subset \bigcup_{n}I_{n} \right\}$$ We can see that m^*(A) \geq 0A$.

Theorem

If is an interval, then

Proof

Suppose . Then for all . But then we have Thus we have .

Now we show . Let be a collection of open intervals such that .

Now, since is compact (by the Heine-Borel theorem), there exists a finite subcover such that

Since , there exists such that . Rearranging intervals, I let and . If , then . So ther eis some such that . By rearranging again, I assume . So .

Continuing in the same manner, we conclude that there exists a such that . And for all we have and .

But then we have

\sum_{n} \ell(I_{n}) & \geq \sum_{k=1}^m \ell(J_{k}) \\ & \geq \sum_{k=1}^K \ell(J_{k}) \\ &= (b_{K}-a_{K}) + (b_{K-1} - a_{K-1}) + \dots + (b_{1}-a_{1}) \\ &= b_{K} + (b_{K-1} - a_{K}) + (b_{K-2}-a_{K-1}) + \dots + (b_{1}-a_{2}) - a_{1} \\ & \geq b_{K} - a_{1} \\ &\geq b-a \\ &= \ell(I) \end{align}$$ Thus we have $m^*(I) \geq \ell(I) = b-a$ Thus we conclude $m^*(I) = \ell(I)$ $$\tag*{$\blacksquare$}$$

See the outer measure of an interval is its length

NOTE

If is any finite interval or , we note that for all we have

[a+\epsilon, b-\epsilon] &\subset I &\subset [a-\epsilon, b +\epsilon] \\ \implies m^*([a+\epsilon, b-\epsilon]) &\leq m^*(I) &\leq m^*([a-\epsilon, b +\epsilon]) \\ \implies (b-a) - 2\epsilon &\leq m^*(I) & \leq (b-a) + 2\epsilon \end{align}$$ Taking $\epsilon\to0$, we get the desired result.

Exercise

An infinite interval cannot be covered by a collection of intervals of finite length

Theorem

for every and , there exist an open set such that and

Proof

The result is obvious if (just take ), so we assume .

Let be a collection of open intervals that cover and have total length at most . Then is open and obviously . Thus by subadditivity ( theorem from lecture 6 )

m^*(O) &= m^*\left( \bigcup_{n}I_{n} \right) \\ &\leq \sum_{n} m^*(I_{n}) \\ &\leq \sum_{n} \ell(I_{n}) \\ & \leq m^*(A) + \epsilon \end{align}$$

see we can always find an open set with outer measure slightly more

Measurable Sets

Lebesgue measurable

A set is Lebesgue measurable if for all we have

NOTE

Since for all we have , we have by subadditivity that .

Thus is measurable if

( we only need to show one side of the inequality )

lebesgue measurable

Theorem

The empty set and the set of real numbers are measurable. And a set is measurable if and only if is measurable.

Proof

These are readily verifiable from the definition of measurability - which is symmetric in and .

Proposition

If then is measurable.

Proof

Let . Then means But then we see because .

see outer measure zero sets are measruable

NOTE

Lots of “uninteresting” sets are measurable - it is hard to find interesting sets that are measurable.

  • every open set is measurable
  • so every closed set is also measurable (by taking complements)
  • Most things we can write down are measurable (since taking unions and intersections of basic sets also give us measurable sets)

Proposition

If are measurable, then are measurable

Proof

Let . Since is measurable, we know Then we also know

A \cap(E_{1} \cup E_{2}) &= (A \cap E_{1}) \cup (A \cap E_{2}) \\ &= (A \cap E_{1}) \cup (A \cap E_{2} \cap E_{1}^c) \\ \end{align}

Taking outer measure we get

\implies m^*(A\cap(E_{1} \cup E_{2})) & \leq m^*(A \cap E_{1}) + m^*(A \cap E_{2} \cap E_{1}^c) \\ E_{1} \text{measurable } \implies&= m^*(A) - m^*(A \cap E_{1}^c) + m^*(A \cap E_{2} \cap E_{1}^c) \\ &= m^*(A) - m^*(A \cap (E_{1} \cup E_{2})^c) \end{align}$$ And this gives us the desired result.

see unions of measurable sets are measurable

Theorem

If are measurable, then is measurable

Proof

by induction. is trivial. Suppose the statement holds for . Then And then since unions of measurable sets are measurable we get the desired result.

Algebra

A nonempty collection of sets is an algebra if

  1. (closure under complements)
  2. (closure under finite unions)

see algebra, sigma-algebra

algebra

We say an algebra is a algebra (sigma-algebra) if also 3. (closure under countable unions)

NOTE

By DeMorgan’s Laws, if , then we also have Thus, if then Similarly, if is a sigma-algebra, then

We’ll show soon that is a sigma-algebra.

Examples of algebras

Stupid examples:

  • Less stupid example:
  • obviously, this is closed under complements by definition
  • If with all countable, then the union is a countable union of countable sets, which is countable. Thus it is in
  • If there exists some such that is countable (but is not), then is an intersection of sets, one of which is countable

Theorem

Let

Define the intersection of all such sigma-algebras as This is the smallest algebra containing all open subsets of and it is called the Borel algebra

( and for all , we have )

see borel sigma algebra

Proof

Just need to show that is indeed an algebra.

  • Since every open subset is an element of each , we conclude that each is then an element of .
  • And because it is the intersection of all other algebras in , it must indeed be the smallest one. Suppose .
  • Then for all .
  • So for all , we have
  • Similarly, for any such that for all , we must have
  • Then (because they are sigma-algebras) we also have for all

Next time, we will see that the set of lebesgue measurable sets is a sigma-algebra and in fact contains the borel sigma algebra.

const { dateTime } = await cJS()
 
return function View() {
	const file = dc.useCurrentFile();
	return <p class="dv-modified">Created {dateTime.getCreated(file)}     ֍     Last Modified {dateTime.getLastMod(file)}</p>
}