Functional Analysis Lecture 10

[[lecture-data]]

← Lecture 9 | Lecture 11 → Lecture Notes: Rodriguez, page 47

 

2. Lebesgue Measure and Integration

Recall

Measurable function

Let be measurable and . We say is a Lebesgue measurable function is for all . $f^{-1}((\alpha, \infty]) \in {\cal M}$$ ie, the preimage is a measurable set.

We also showed:

All of these had to do with functions on the extended reals, but we might also deal with complex-valued functions. Thus we will extend our existing definition of a measurable function:

Measurable Function (extension to complex image)

If is measurable, a complex-valued function is measurable if both

We can also verify that the results from last lecture also hold:

Theorem

If are measurable and , then

Are all measurable as well.

Proof

Exercise

see sums and products of measurable functions are measurable

Theorem

If is measurable for all and pointwise for all , then is measurable.

Proof

Note that And since the limit of a convergent sequence of measurable functions is measurable for real-valued functions, we preserve measurability for both and . sums and products of measurable functions are measurable gives us the desired result

This extends the limit of a convergent sequence of measurable functions is measurable

NOTE

Since we can write complex valued functions as a sum of and , it is not too hard to extend the results we have for real-valued functions.

Simple Function

A measurable function is simple if
(ie, the size of the range is finite)

see simple function

Remark

simple functions can be written as a complex linear combination of finitely many indicator functions.

Proof

Suppose is a simple function where the range . Define the sets Note that each is measurable because they are intersections of the measurable sets where and .

For all we have and . ie, the form a finite partition of the domain . Thus, for all , we can write Which is a finite complex linear combination of indicator functions. \tag*{$\blacksquare$}

see simple functions can be written as a finite complex linear combination of indicator functions

Recall that indicator functions are measurable and simple functions can be written as a finite complex linear combination of indicator functions. Thus the the complex extension of sums and products of measurable functions are measurable gives us that simple functions are measurable as well.

see simple functions are measurable

NOTE

The idea here is that every measurable set is approximately a simple function

Theorem

Scalar multiples, linear combinations, and products of simple functions are also simple functions.

Proof

This can be seen by checking that the resulting functions are measurable and that their ranges are finite.

see sums and products of simple functions are simple functions

Theorem

If is a nonnegative measurable function, then there exists a sequence of simple functions such that

  1. (pointwise increasing sequence dominated by ) For all we have
  2. (pointwise convergence) for all we have
  3. (uniform convergence when is bounded) for all , uniformly on the set where the bound holds

We start with the reals, but the proof will extend easily to the extended reals and complex numbers.

Proof

We will build our functions to have better resolution and larger range as a function of .

For each , define the sets

E_{k}^{(n)} &= \{ x \in E : k\,2^{-n} \leq f(x) < (k+1)2^{-n}\} \\ &= f^{-1}((k\,2^{-n}, (k+1)\,2^{-n}]) \end{align}$$ For each $0 \leq k \leq 2^{2n}-1$. This yields an "interval of length $2^{-n}$" in the range. These are measurable ([[inverse image of measurable functions of all borel sets are measurable]]), so we can define the sets $$F^{(n)} = f^{-1}((2^n, \infty])$$ So we have that $E = F^{(n)} \cup \left(\bigcup_{k=0}^{2^{2n}-1} E_{k}^{(n)}\right)$ for all $n$. Then, we can write $$\phi_{n} = 2^n \mathbb{1}_{F^{(n)}}+\sum_{k=0}^{2^{2n} - 1} \frac{k}{2^n} \mathbb{1}_{E_{k}^{(n)}} = 2^n \mathbb{1}_{F^{(n)}} + \sum_{k=1}^{2^{2n}-1} \frac{k}{2^n} \mathbb{1}_{E_{k}^{(n)}}$$ > [!example] > $$\phi_{1} = \frac{1}{2} \cdot\mathbb{1}_{f^{-1}\left( \frac{1}{2}, 1 \right]} + 1\cdot \mathbb{1}_{f^{-1}\left( 1, \frac{3}{2} \right]} + \frac{3}{2} \mathbb{1}_{f^{-1}\left( \frac{3}{2}, 2 \right]} + 2 \cdot \mathbb{1}_{f^{-1}\left( 2, \infty \right]}$$ > **Claim**: this sequence of approximations satisfies the three conditions we want. - It is easy to see that $\phi_{n}$ takes on finitely many values for each $n$ ($2^n + 1$, to be exact), so each $\phi_{n}$ is indeed a [[simple function]] - By design, we always have $0 \leq \phi_{n} \leq f$ since we defined each function such that $\frac{k}{2^n} < f(x) \leq \frac{k+1}{2^n} \implies \phi_{n}(x) = \frac{k}{2^n} < f(x)$ > [!proof]+ Pointwise Increasing > To show that the $\{ \phi_{n} \}$ are pointwise increasing, we note that if $x \in E_{k}^{(n)}$, we have > $$\begin{align} > \frac{k}{2^n} <f(x) \leq \frac{k+1}{2^n} &\implies \frac{2k}{2^{n+1}} < f(x) \leq \frac{2(k+1)}{2^{n+1}} \\ > &\implies x \in E_{2k}^{(n+1)} \cup E_{2k+1}^{(n+1)}\\ > &\implies \phi_{n}(x) =\begin{cases} > \frac{k}{2^n} = \frac{2k}{2^{n+1}} = \phi_{n+1}(x), & x \in E_{2k}^{(n+1)} \\ > \frac{k}{2^n} = \frac{2k}{2^{(n+1)}} < \frac{2(k+1)}{2^{n+1}} = \phi_{n+1}(x), & x \in E_{2k+1}^{(n+1)} > \end{cases} > \end{align}$$ > ie, we have $\phi_{n}(x) \leq \phi_{n+1}(x)$ if $x \in E_{k}^{(n)}$. If $x \in F^{(n)}$, then we get a similar result with the same argument. Pointwise convergence + Uniform convergence on sets where $f$ is bounded by $B$ **Claim**: For all $x \in \{ y \in E : f(y) \leq 2^n\}$, we have $$0 \leq f(x) - \phi_{n}(x) \leq 2^{-n}$$ Recall that each $\phi_{n}$ partitions the range into intervals of length $\frac{1}{2^n}$ and note that $$\{ y \in E : f(x) \leq 2^n \} = \bigcup_{k=0}^{2^{2n}-1} E_{k}^{(n)} $$ Thus, we can just verify the claim for each $E_{k}^{(n)}$. So suppose $x \in E_{k}^{(n)}$. Then $$\begin{align} \phi_{n}(x) &= \frac{k}{2^n} \leq f(x) < \frac{k+1}{2^n} \\ \implies f(x) - \phi_{n}(x) & \leq \frac{k+1}{2^n} - \frac{k}{2^n} \\ &= \frac{1}{2^n} \end{align}$$ > [!proof] Pointwise convergence > Let $x \in E$. If $f(x) = \infty$, then we are done. Otherwise, $f^{-1}(x) \in \{ y \in E : f(y) \leq 2^n \}$ for all $n \geq N$ for some $N$ large enough. But then for all $n \geq N$, we have > $$\lvert f(x) - \phi_{n}(x) \rvert \leq \frac{1}{2^n} $$ > ie $\phi_{n}(x) \to f(x)$ for all $x$. > [!proof] Uniform convergence for a fixed bound > Now, for any fixed $B$, pick some $N$ such that $\{ x \in E : f(x) \leq B \} \subset \{ x \in E : f(x) \leq 2^N \}$. Then in the bound, we have uniform convergence. $$\tag*{$\blacksquare$}$$

see convergent sequence of simple functions for a measurable function

Positive and Negative part of a function

Let be a measurable function. Then the positive part and the negative part of is respectively.

NOTE

See positive and negative part of a function

Now we can extend our convergent sequence of simple functions for a measurable function to the extended reals and the complex numbers.

Lebesgue Integrals

We can now define an integral by looking at the limit of a convergent sequence of simple functions for a measurable function. We don’t want to depend on the simple function representation, so instead we will define something else.

First, we will build a notion of integral for nonnegative functions and then generalize to complex-valued functions from there.

functions

If is measurable, the class of nonnegative measurable functions on is given as

see nonnegative measurable functions

Lebesgue integral (for nonnegative measurable functions)

Let be a simple, nonnegative measurable function such that where for all and . Then the Lebesgue integral of is

see Lebesgue Integral

Theorem

Suppose are two simple functions. Then for any , we have

  1. if
  2. If is measurable, then

Proof

(1) then . Thus

Note that if

\int _{E} c \phi &= \sum_{i=1}^n ca_{i} m(A_{i}) \\ &= c \sum_{i=1}^n a_{i}m(A_{i}) \\ &= c \int _{E}\phi \end{align}$$

(2) and . Then

We again write

E &= \bigcup_{i=1}^n A_{i} = \bigcup_{j=1}^\ell B_{j} \\ \implies A_{i} &= \bigcup _{j=1}^\ell (A_{i} \cap B_{j}),\quad B_{j} = \bigcup_{i=1}^n (A_{i} \cap B_{j}) \end{align}$$ And each set in each of the unions are disjoint since the $A_{i}$ are pairwise disjoint and the $B_{j}$ are pairwise disjoint too. Then from [[measure satisfies countable additivity]], we get $$\begin{align} \int _{E} \phi + \int _{E} \psi &= \sum_{i=1}^n a_{i} m({A_{i}} )+ \sum_{j=1}^\ell b_{j} m(B_{j}) \\ &= \sum_{i=1}^n \sum_{j=1}^\ell a_{i} m(A_{i} \cap B_{j}) + \sum_{j=1}^\ell \sum_{i=1}^m b_{j} (A_{i} \cap B_{j}) \\ &= \sum_{i,j} (a_{i} + b_{j}) m(A_{i} \cap B_{j}) \\ (*)&= \int _{E} \phi + \psi \, \end{align}$$ Where $(*)$ is because we can write $\phi + \psi = \sum_{i,j} (a_{i} + b_{j}) \mathbb{1}_{A_{i} \cap B_{j}}$ . - Note that this is not technically the "canonical" decomposition for [[simple function|simple functions]] since it is possible for $a_{i}+b_{j}$ to be equal to each other for different $(i,j)$ pairs. This is OK though, because we can just combine the disjoint sets where they are equal.

(3) and . Then whenever . So since we have measure satisfies countable additivity, we get

Write

\int _{E} \phi &= \sum_{i=1}^n a_{i} m(A_{i}) \\ &= \sum_{i=1}^n a_{i}\sum_{j=1}^\ell m(A_{i} \cap B_{j}) \\ (\,\,A_{i} \cap B_{j} \neq \varnothing \implies a_{i} \leq b_{j} \,\,)\implies&\leq \sum_{i=1}^n b_{j} \sum_{j=1}^\ell m(A_{i} \cap B_{j}) \\ &= \sum_{j=1}^\ell b_{j} m(B_{j}) \\ &= \int _{E} \psi \end{align}$$

(4)

Exercise

\tag*{$\blacksquare$}

Defined the “under the curve” notion for our Lebesgue Integral

Next time, we will define the integral of a nonnegative measurable function

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>
}