User:Mct mht/some links/d4

From Wikipedia, the free encyclopedia

A proof of Monotone Convergence Theorem:

Suppose an increasing sequence f_n \rightarrow f a.e., then it is immediate that \lim \int f_n \leq \int f. The theorem claims the reverse inequality holds as well. To show this, it's sufficient to show that

\lim \int f_n \geq \int \phi

for a simple function φ with \phi \leq f (since, by definition, \int f = \sup_{\phi} \int \phi.)

To this end, fix 0 < α < 1, we consider the sets

E_n = \{ f(x) \geq \phi(x) \}.

Since fn is increasing, \cup E_n = X. Also, for all n

\int f_n \geq \int_{E_n} f_n \geq \alpha \int_{E_n} \phi.

Now we notice that φdx is a positive measure on X. Thus, by the so-called "continuity from below" property of measures,

\lim_n \int_{E_n} \phi = \int \phi.

Together with the previous estimate, this implies

\lim \int f_n \geq \alpha \int \phi.

By virtue of φ being simple, taking the supremum of α gives

\lim \int f_n \geq \int \phi.

Taking the supremum over φ proves the claim.

Notice the argument hinges on how one partitions the range (as oppose to the domain in the Riemann case) of the functions into suitable parts, passes back to the preimages, and then applies the machinery of measure theory.

The assumption that the sequence {fn} be increasing is needed, for the areas of {fn} might "escape to infinity" and equality may fail. In the absence of this assumption, taking the infimum and applying the monotone convergence theorem yields the Fatou's lemma:

\int \lim \inf f_n = \lim_{k \rightarrow \infty} \int \inf_{k \geq n} f_k \leq \lim_{k \rightarrow \infty} \inf_{k \geq n} \int f_k.

We note that, assuming Fatou's lemma, the monotone convergence theorem follows trivially:

\int \sup f_n = \int \lim \inf f_n \leq \lim_{k \rightarrow \infty} \inf_{k \geq n} \int f_k = \sup \int f_n.