请输入您要查询的字词:

 

单词 ProofOfEgorovsTheorem
释义

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.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 21:25:13