logo

Proof of Levy's Theorem in Measure Theory 📂Measure Theory

Proof of Levy's Theorem in Measure Theory

Theorem 1

If k=1fkdm<\displaystyle \sum_{k=1}^{\infty} \int |f_{k}| dm < \infty, then k=1fk(x)\displaystyle \sum_{k=1}^{\infty} f_{k} (x) converges almost everywhere and is Lebesgue integrable with the integration explicitly as follows. k=1fkdm=k=1fkdm \int \sum_{k=1}^{\infty} f_{k} dm = \sum_{k=1}^{\infty} \int f_{k} dm

Proof

Part 1. That k=1fk(x)\displaystyle \sum_{k=1}^{\infty} f_{k} (x) converges almost everywhere and is Lebesgue integrable

If we define ϕ(x):=k=1fk(x)\displaystyle \phi (x) := \sum_{k=1}^{\infty} | f_{k} (x) |, then ϕ\phi is a non-negative measurable function.

The corollary of the Monotone Convergence Theorem: Let’s say the sequence of non-negative measurable functions {fn}\left\{ f_{n} \right\} satisfies fnff_{n} \nearrow f. Then n=1fndm=n=1fndm\int \sum_{n=1}^{\infty} f_{n} dm = \sum_{n=1}^{\infty} \int f_{n} dm

By the Monotone Convergence Theorem, ϕdm=n=1fkdm \displaystyle \int \phi dm = \sum_{n=1}^{\infty} \int | f_{k} | dm and since it was assumed that k=1fkdm<\displaystyle \sum_{k=1}^{\infty} \int |f_{k}| dm < \infty, ϕdm\int \phi dm takes a finite value, hence ϕ\phi is Lebesgue integrable, that is ϕL1\phi \in \mathcal{L}^{1}. Therefore, ϕ\phi is finite almost everywhere, and from its definition, k=1fk=ϕ< \sum_{k=1}^{\infty} \left| f_{k} \right| = \phi < \infty thus k=1fk(x)\displaystyle \sum_{k=1}^{\infty} | f_{k } (x) | converges almost everywhere, and k=1fk(x)\displaystyle \sum_{k=1}^{\infty} f_{k } (x) also converges almost everywhere. Meanwhile, k=1nfk(x)k=1nfk(x)k=1fk(x)=ϕ(x) \begin{align*} \left| \sum_{ k=1 }^{ n } f_{k} (x) \right| \le & \sum_{ k=1 }^{ n } \left| f_{k} (x) \right| \\ \le & \sum_{k=1}^{\infty} \left| f_{k} (x) \right| \\ = & \phi (x) \end{align*} thus, for all nNn \in \mathbb{N}, the inequality k=1nfk(x)ϕ(x)\displaystyle \left| \sum_{ k=1 }^{ n } f_{k} (x) \right| \le \phi (x) almost everywhere holds. Lastly, ϕ\phi, though similar but without absolute values within the sigma, ff is defined f(x):=k=1fk(x) f(x) := \sum_{k=1}^{\infty} f_{k} (x) as such, and those points where ff does not converge are simply left as f(x)f(x) to ensure it is a Lebesgue integrable function. This prepares us for the use of the Dominated Convergence Theorem. k=1nfkϕ,ϕL1f=limnk=1nfk \left| \sum_{ k=1 }^{ n } f_{k} \right| \le \phi \qquad , \phi \in \mathcal{L}^{1} \\ f = \lim_{n \to \infty} \sum_{k=1}^{n} f_{k}


Part 2. The specific integration

The Dominated Convergence Theorem: Let’s say for a measurable set EME \in \mathcal{M} and gL1(E)g \in \mathcal{L}^{1} (E), the sequence of measurable functions {fn}\left\{ f_{n} \right\} satisfies EE almost everywhere in fng|f_{n}| \le g. If almost everywhere in EE is f=limnfn\displaystyle f = \lim_{n \to \infty} f_{n}, then fL1(E)limnEfn(x)dm=Efdmf \in \mathcal{L}^{1}(E) \\ \lim_{ n \to \infty} \int_{E} f_{n} (x) dm = \int_{E} f dm

Hence the following holds. k=1fkdm=limnk=1nfkdm=fdm=limnk=1nfkdm=limnk=1nfkdm=k=1fkdm \begin{align*} \int \sum_{k=1}^{\infty} f_{k} dm = & \int \lim_{n \to \infty} \sum_{k=1}^{n} f_{k} dm \\ =& \int f dm \\ =& \lim_{n \to \infty} \int \sum_{k=1}^{n} f_{k} dm \\ =& \lim_{n \to \infty} \sum_{k=1}^{n} \int f_{k} dm \\ =& \sum_{k=1}^{\infty} \int f_{k} dm \end{align*}

Explanation

This theorem, proved by the Italian mathematician Beppo Levi, amazingly simplifies the integration of function sequences.

Example

Find 01(logx1x)2dx\displaystyle \int_{0}^{1} \left( {{ \log x } \over {1-x}} \right)^2 dx.

Solution

If we define fn(x):=nxn1(logx)2f_{n} (x) : = n x^{n-1} ( \log x )^2, since n=1nxn1=1(1x)2\displaystyle \sum_{n=1}^{\infty} n x^{n-1} = {{1} \over {(1-x)^2}}, thus n=1fn(x)=(logx1x)2 \sum_{n=1}^{\infty} f_{n} (x) = \left( {{ \log x } \over {1-x}} \right)^2 By Levi’s theorem, 01f(x)dx=n=101fn(x)dx\int_{0}^{1} f (x) dx = \sum_{n=1}^{\infty} \int_{0}^{1} f_{n} (x) dx but by the method of integration by parts, 01fn(x)dx=01nxn1(logx)2dx=2n2\int_{0}^{1} f_{n} (x) dx = \int_{0}^{1} n x^{n-1} ( \log x )^2 dx = {{2} \over {n^2}} Thus, we obtain the following. 01f(x)dx=n=12n2=π23\displaystyle \int_{0}^{1} f(x) dx = \sum_{n=1}^{\infty} {{2} \over {n^2}} = {{\pi^2} \over {3}}

Commentary

The essence of solving the problem eventually lies in finding fnf_{n} that satisfies {n=1fn(x)=f(x)Ef(x)dx=n=1Efn(x)dx \begin{cases} \displaystyle \sum_{n=1}^{\infty} f_{n} (x) = f(x) \\ \displaystyle \int_{E} f(x) dx = \sum_{n=1}^{\infty} \int_{E} f_{n} (x) dx \end{cases}. Although this process is genuinely challenging, it would be considerably easier than solving through finding an antiderivative like in Riemann integration.

See Also


  1. Capinski. (1999). Measure, Integral and Probability: p95. ↩︎