Egorov's Theorem

From ProofWiki
Jump to: navigation, search

Contents

Theorem

Suppose we are given a measure space $(X, \Sigma, \mu)\ $ and a sequence of $\Sigma$-measurable functions $f_n: D \to \R$ for $D \in \Sigma$.

Then if $f_n$ converges a.e. to a function $f$ on $D$ and $\mu \left({D}\right) < \infty$, then $f_n$ almost uniformly converges to $f$.


Proof

Pick $\epsilon > 0$.

By definition of convergence a.e., there is a set $E \in \Sigma$ such that

  • $E \subseteq D$
  • $\mu \left({E}\right) = 0$
  • $f_n \left({x}\right) \to f \left({x}\right)$ for each $x \in A \equiv D - E$.

For each $n, k \in \N$, define:

$\displaystyle A_{n, k} \equiv \left\{ {x \in A : \left| {f_n \left({x}\right) - f \left({x}\right)} \right| \geq \frac 1 k}\right\}$

Also define:

$\displaystyle B_{n, k} \equiv \bigcup_{i=n}^\infty A_{i, k}$

Since $f_n \to f$ on $A$, it follows by definition of convergence that for each $x \in A$, $\displaystyle \left| {f_i \left({x}\right) - f \left({x}\right)}\right| < \frac 1 k$ for all $i$ sufficiently large.

Thus, when $k$ is fixed, no element of $A$ belongs to $A_{n, k}$ infinitely often. Hence by Characterization of Limit Superior of Sets, $\displaystyle \limsup_{n \to \infty} A_{n, k} = \varnothing$.

So we have:

\(\displaystyle \) \(\displaystyle 0\) \(=\) \(\displaystyle \mu \left({\varnothing}\right)\) \(\displaystyle \)          since the Measure of Null Set is Zero          
\(\displaystyle \) \(\displaystyle \) \(=\) \(\displaystyle \mu \left({\limsup_{n \to \infty} A_{n, k} }\right)\) \(\displaystyle \)                    
\(\displaystyle \) \(\displaystyle \) \(=\) \(\displaystyle \mu \left({\bigcap_{n=0}^\infty B_{n, k} }\right)\) \(\displaystyle \)          by definition of lim sup          
\(\displaystyle \) \(\displaystyle \) \(=\) \(\displaystyle \mu \left({\lim_{n \to \infty} B_{n, k} }\right)\) \(\displaystyle \)          since $B_{n, k}$ is a decreasing sequence of sets          
\(\displaystyle \) \(\displaystyle \) \(=\) \(\displaystyle \lim_{n \to \infty} \mu \left({B_{n, k} }\right)\) \(\displaystyle \)          since $B_{n, k} \subseteq D$, $\mu \left({D}\right) < \infty$ and by Continuity of Measure          

Thus, since $k$ was arbitrary, we can associate some $n_k \in N$ with each $k$ such that $\displaystyle \mu \left({B_{n_k, k}}\right) < \frac {\epsilon} {2^{k+1}}$.

Setting $\displaystyle B \equiv \bigcup_{k \in \N} B_{n_k, k}$, we have:

$\displaystyle \mu (B) \leq \sum_{k \in N} \mu (B_{n_k, k}) \leq \sum_{k \in \N} \frac{\epsilon}{2^{k+1}} = \epsilon$

by the countable additivity of $\mu$ and by Sum of Infinite Geometric Progression.

Also, given any $\displaystyle \frac 1 k$, we have $x \in A - B$ implies $x \notin B_{n_k, k}$, which means $|f_i(x) - f(x)| < \frac{1}{k}$ for all $i \geq n_k$.

Since this is true for all $x\in A - B$, it follows that $f_n$ converges to $f$ uniformly on $A - B$.

Finally, note that $A - B = D - (E \cup B)$, and $\mu (E \cup B) \leq \mu (B) + \mu (E) = \mu (B) + 0 < \epsilon$.

Since $\epsilon$ was arbitrary, the convergence is uniform a.e.

$\blacksquare$


Notes

Egorov's theorem is a partial converse to the fact that Uniform Convergence a.e. Implies Convergence a.e.


Source of Name

This entry was named for Dmitri Fyodorovich Egorov.

Personal tools
Namespaces
Variants
Actions
Navigation
ProofWiki.org
ToDo
Toolbox
Google AdSense