Egerov's Theorem: Difference between revisions

From Optimal Transport Wiki
Jump to navigation Jump to search
Line 11: Line 11:


Now fix any <math> \delta>0 </math>. We choose <math> n\geq N</math> such that <math>\frac{1}{n}\leq \delta </math>. Since <math> n \geq N </math> if <math> x \in \tilde{A}_\epsilon </math> then <math> x \in E_{k_n}^n </math>. And by definition if <math>x \in E_{k_n}^n </math> then <math>|f_j(x)-f(x)|<\frac{1}{n}<\delta </math> whenever <math> j > k_n </math>. Hence <math> f_n \rightarrow f</math> uniformly on <math> \tilde{A}_\epsilon </math>.
Now fix any <math> \delta>0 </math>. We choose <math> n\geq N</math> such that <math>\frac{1}{n}\leq \delta </math>. Since <math> n \geq N </math> if <math> x \in \tilde{A}_\epsilon </math> then <math> x \in E_{k_n}^n </math>. And by definition if <math>x \in E_{k_n}^n </math> then <math>|f_j(x)-f(x)|<\frac{1}{n}<\delta </math> whenever <math> j > k_n </math>. Hence <math> f_n \rightarrow f</math> uniformly on <math> \tilde{A}_\epsilon </math>.
Finally, we use the fact that ha


==Proof==
==Proof==

Revision as of 09:30, 7 December 2020

Statement

Suppose is a sequence of measurable functions defined on a measurable set with and a.e. on E.

Then: Given we may find a closed subset such that and uniformly on

Proof

WLOG assume for all since the set of points at which is a null set. Fix and for we define Now for fixed we have that and . Therefore using continuity from below we may find a such that . Now choose so that and define . By countable subadditivity we have that .

Now fix any . We choose such that . Since if then . And by definition if then whenever . Hence uniformly on .

Finally, we use the fact that ha

Proof

For any , let .

By definition, . And , so by Monotone Convergence Theorem, .

Furthermore, by definition we have , then .

Since exists, taking of both sides: .

References