Measure Theory/Approximations of Sequences of Functions

Approximations of Sequences of Functions
The content of this lesson is the final of Littlewood's three principles, which are also known as Egoroff's Theorem and Lusin's Theorem.

Pointwise Convergence to Nearly Uniform
Here we will show that pointwise convergence can, through an appropriate domain restriction, entail something like uniform convergence.

There are a few theorems that show something like the rough expression above. The first interpretation that we will prove, in a slightly more formal expression, is:


 * For $$\delta$$ as small as you like, you never need to remove more than $$100\delta$$ percent of the domain, for the convergence to be uniform.

The formal expression of this is: Let
 * $$E\in\mathcal M$$ has finite measure,
 * $$\langle f_n\rangle $$ a sequence of measurable functions defined on E,
 * $$f_n\to f$$ pointwise on E,

Then $$\forall \delta,\varepsilon\in\Bbb R^+,\quad \exists F\in\mathcal M,\quad \exists N\in\Bbb Z^+$$ such that


 * $$F\subseteq E$$
 * on $$E\smallsetminus F, \quad |f_n(x)-f(x)| <\varepsilon \quad \forall n\ge N$$
 * $$\lambda(F)<\delta$$

To begin the proof, let $$\varepsilon,\delta\in\Bbb R^+$$.

With the assumptions as above, define for each $$1\le n$$ the set of points where the sequence is "far apart":


 * $$G_n=\{x\in E:|f_n(x)-f(x)|\ge \varepsilon\}$$

Exercise 1. Where the Sequence Is Far
Of course every definition above for suprema has a correlate for infima.

Part A. Prove that the subsets of any set X are well-ordered by the subset relation.

Part B. Prove that the union of $$\langle A_n\rangle$$ is an upper bound on this sequence, for the subset relation. Also, and in the same sense, prove that it is the least of the upper bounds.

Part C. Explain why the limit supremum for real numbers is analogous to the limit supremum for sets. There are several equivalent definitions of the limit supremum for a sequence of real numbers, $$\langle a_k\rangle$$. So take the definition to be $$\overline{\lim}a_k = \lim_{N\to\infty}\sup \{a_k|N\le k\}$$

Part D. State the definitions that make the most sense for infima and limit inferiors, for sets.

Part E. Now prove that the limit superior of $$G_n$$ is the empty set.

Part F. Define the union of the Nth tail, $$E_N = \bigcup_{N\le n} G_n$$ and apply the continuity of measure, to infer that $$\exists N\in\Bbb Z^+$$ such that $$\lambda(E_N)<\delta$$

Part G. Conclude the rest of the proof of the theorem.

Part H. Show that the result we finished proving in Part G. also holds if the condition of pointwise convergence is replaced by pointwise a.e. convergence.

Egoroff's Theorem
Egoroff's theorem states the following.

Let $$\langle f_n\to \rangle$$ pointwise a.e. on a measurable set E of finite measure.

Then $$\forall \eta \in\Bbb R^+ \quad \exist (F\subseteq E)$$ such that
 * $$\lambda(F)<\eta$$
 * $$ f_n\overset u\to f $$ on $$E\smallsetminus F$$.

Exercise 2. Prove Egoroff's
Prove Egoroff's theorem.

Hint: Use the Part H. of ''Exercise 1. Where the Sequence Is Far'' together with the $$\eta/2^n$$ trick.

Lusin's Theorem
Lusin's theorem states the following.

Let
 * $$f:[a,b]\to\Bbb R$$ be a measurable real-valued function.
 * $$\varepsilon\in\Bbb R^+$$

Then there exists a continuous $$g:[a,b]\to\Bbb R$$ such that $$\lambda(\{x\in[a,b]: f(x)\ne g(x)\}) < \delta$$.

Exercise 3. Prove Lusin's
Prove Lusin's theorem.

Hint: Use Egoroff's and the approximation of measurable functions by continuous functions.