proof of Egorov’s theorem


Let Ei,j={xE:|fj(x)-f(x)|<1/i}. Since fnf almost everywhere, there is a set S with μ(S)=0 such that, given i and xE-S, there is m such that j>m implies |fj(x)-f(x)|<1/i. This can be expressed by

E-Smj>mEi,j,

or, in other words,

mj>m(E-Ei,j)S.

Since {j>m(E-Ei,j)}m is a decreasing nested sequencePlanetmathPlanetmath of sets, each of which has finite measure, and such that its intersectionMathworldPlanetmathPlanetmath has measure 0, by continuity from above (http://planetmath.org/PropertiesForMeasure) we know that

μ(j>m(E-Ei,j))m0.

Therefore, for each i, we can choose mi such that

μ(j>mi(E-Ei,j))<δ2i.

Let

Eδ=ij>mi(E-Ei,j).

Then

μ(Eδ)i=1μ(j>mi(E-Ei,j))<i=1δ2i=δ.

We claim that fnf uniformly on E-Eδ. In fact, given ε>0, choose n such that 1/n<ε. If xE-Eδ, we have

xij>miEi,j,

which in particular implies that, if j>mn, xEn,j; that is, |fj(x)-f(x)|<1/n<ε. Hence, for each ε>0 there is N (which is given by mn above) such that j>N implies |fj(x)-f(x)|<ε for each xE-Eδ, as required. This the proof.

Title proof of Egorov’s theorem
Canonical name ProofOfEgorovsTheorem
Date of creation 2013-03-22 13:47:59
Last modified on 2013-03-22 13:47:59
Owner Koro (127)
Last modified by Koro (127)
Numerical id 7
Author Koro (127)
Entry type Proof
Classification msc 28A20