MathIsimple
π
θ
Δ
ε
RA-4
7-11 hours
Advanced

Convergence Theorems: Fatou, MCT, DCT

Master the fundamental convergence theorems of Lebesgue integration: Fatou's lemma, monotone convergence theorem, and dominated convergence theorem. These tools are essential for exchanging limits and integrals.

Learning Objectives
By the end of this course, you will be able to:
1
Understand and apply Fatou's lemma to sequences of nonnegative functions
2
Master the monotone convergence theorem and its proof
3
Apply the dominated convergence theorem to exchange limits and integrals
4
Understand uniform integrability and its relationship to convergence
5
Recognize when convergence theorems can be applied
6
Use convergence theorems to solve problems involving limits of integrals

Prerequisites

Before starting this course, you should be familiar with:

  • Lebesgue integral for nonnegative and general functions
  • L1 space and absolute integrability
  • Pointwise and almost-everywhere convergence
  • Basic properties of sequences and limits

Core Theorems

Fundamental convergence results

Theorem 4.1: Fatou's Lemma

Let {fn}\{f_n\} be a sequence of nonnegative measurable functions. Then:

lim infnfndmlim infnfndm\int \liminf_{n \to \infty} f_n \, dm \leq \liminf_{n \to \infty} \int f_n \, dm
Proof of Theorem 4.1:

Proof:

Let gn=infknfkg_n = \inf_{k \geq n} f_k. Then {gn}\{g_n\} is an increasing sequence with gnlim inffng_n \to \liminf f_n.

By the monotone convergence theorem, gnlim inffn\int g_n \to \int \liminf f_n.

Since gnfng_n \leq f_n, we have gnfn\int g_n \leq \int f_n, so

lim inffn=limngnlim infnfn\int \liminf f_n = \lim_{n \to \infty} \int g_n \leq \liminf_{n \to \infty} \int f_n

Theorem 4.2: Monotone Convergence Theorem

Let {fn}\{f_n\} be an increasing sequence of nonnegative measurable functions converging pointwise to ff. Then:

fdm=limnfndm\int f \, dm = \lim_{n \to \infty} \int f_n \, dm
Proof of Theorem 4.2:

Proof:

Since fnff_n \leq f, we have fnf\int f_n \leq \int f, so limfnf\lim \int f_n \leq \int f.

For the reverse inequality, let φ\varphi be a simple function with 0φf0 \leq \varphi \leq f. For 0<α<10 < \alpha < 1, define En={x:fn(x)αφ(x)}E_n = \{x : f_n(x) \geq \alpha \varphi(x)\}.

Then EnXE_n \uparrow X and fnEnfnαEnφ\int f_n \geq \int_{E_n} f_n \geq \alpha \int_{E_n} \varphi.

Taking limits, limfnαφ\lim \int f_n \geq \alpha \int \varphi. Since this holds for all α<1\alpha < 1 and all simple φf\varphi \leq f, we get limfnf\lim \int f_n \geq \int f. ∎

Theorem 4.3: Dominated Convergence Theorem

Let {fn}\{f_n\} be a sequence of measurable functions such that:

  1. fnff_n \to f pointwise a.e.
  2. There exists gL1g \in L^1 such that fng|f_n| \leq g a.e. for all nn

Then fL1f \in L^1 and:

fdm=limnfndm\int f \, dm = \lim_{n \to \infty} \int f_n \, dm
Proof of Theorem 4.3:

Proof:

Since fng|f_n| \leq g a.e., we have fg|f| \leq g a.e., so fL1f \in L^1.

Apply Fatou's lemma to g+fng + f_n and gfng - f_n:

(g+f)lim inf(g+fn)=g+lim inffn\int (g + f) \leq \liminf \int (g + f_n) = \int g + \liminf \int f_n

and

(gf)lim inf(gfn)=glim supfn\int (g - f) \leq \liminf \int (g - f_n) = \int g - \limsup \int f_n

Rearranging gives lim supfnflim inffn\limsup \int f_n \leq \int f \leq \liminf \int f_n, so the limit exists and equals f\int f. ∎

Example 4.1: Applying Monotone Convergence

Problem: Compute limn01nenxdx\lim_{n \to \infty} \int_0^1 n e^{-nx} \, dx.

Solution:

Let fn(x)=nenxf_n(x) = n e^{-nx} on [0,1][0,1]. Note that fn(0)=nf_n(0) = n \to \infty, but fn(x)0f_n(x) \to 0 for x>0x > 0.

However, the sequence is not monotone. Instead, we can use dominated convergence with g(x)=1xg(x) = \frac{1}{x} on (0,1](0,1], but this is not in L1.

A better approach: use the substitution u=nxu = nx to get 01nenxdx=1en1\int_0^1 n e^{-nx} \, dx = 1 - e^{-n} \to 1.

But note that fn0f_n \to 0 pointwise a.e., so this is a counterexample showing that pointwise convergence alone is not enough.

Corollary 4.1: Bounded Convergence Theorem

If fnff_n \to f pointwise a.e. on a set of finite measure, and fnM|f_n| \leq M for all nn, then fnf\int f_n \to \int f.

Definition 4.1: Uniform Integrability

A family of functions F\mathcal{F} in L1L^1 is said to be uniformly integrable if for every ϵ>0\epsilon > 0, there exists δ>0\delta > 0 such that for all fFf \in \mathcal{F} and all measurable sets EE with m(E)<δm(E) < \delta, we have

Efdm<ϵ\int_E |f| \, dm < \epsilon
Theorem 4.4: Vitali Convergence Theorem

Let {fn}\{f_n\} be a sequence of functions in L1L^1 such that:

  1. fnff_n \to f in measure (or pointwise a.e.)
  2. {fn}\{f_n\} is uniformly integrable

Then fL1f \in L^1 and fnff_n \to f in L1L^1 (i.e., fnf10\|f_n - f\|_1 \to 0).

Proof of Theorem 4.4:

Proof:

By uniform integrability, for any ϵ>0\epsilon > 0, there exists δ>0\delta > 0 such that Efn<ϵ/3\int_E |f_n| < \epsilon/3 for all nn and all EE with m(E)<δm(E) < \delta.

By Egorov's theorem (if convergence is a.e.) or by convergence in measure, there exists a set FF with m(Fc)<δm(F^c) < \delta such that fnff_n \to f uniformly on FF.

Then

fnf=Ffnf+FcfnfFfnf+Fcfn+Fcf\int |f_n - f| = \int_F |f_n - f| + \int_{F^c} |f_n - f| \leq \int_F |f_n - f| + \int_{F^c} |f_n| + \int_{F^c} |f|

The first term tends to 0 by uniform convergence on FF, and the other terms are <ϵ/3< \epsilon/3 by uniform integrability. Therefore, fnff_n \to f in L1L^1. ∎

Theorem 4.5: Bounded Convergence Theorem (Detailed Proof)

Let (X,M,μ)(X, \mathcal{M}, \mu) be a finite measure space. If {fn}\{f_n\} is a sequence of measurable functions such that:

  1. fnff_n \to f pointwise a.e.
  2. There exists M>0M > 0 such that fnM|f_n| \leq M a.e. for all nn

Then fL1f \in L^1 and fnf\int f_n \to \int f.

Proof of Theorem 4.5:

Proof:

Since fnM|f_n| \leq M a.e., we have fM|f| \leq M a.e., so fL1f \in L^1 (since the measure space is finite).

The constant function g(x)=Mg(x) = M is in L1L^1 because μ(X)<\mu(X) < \infty. Since fng|f_n| \leq g a.e., we can apply the dominated convergence theorem to conclude fnf\int f_n \to \int f.

Alternative direct proof: For any ϵ>0\epsilon > 0, by Egorov's theorem, there exists a set EE with μ(E)<ϵ/(4M)\mu(E) < \epsilon/(4M) such that fnff_n \to f uniformly on XEX \setminus E.

Then for large nn,

fnffnf=XEfnf+Efnf<ϵ2+2Mϵ4M=ϵ\left|\int f_n - \int f\right| \leq \int |f_n - f| = \int_{X \setminus E} |f_n - f| + \int_E |f_n - f| < \frac{\epsilon}{2} + 2M \cdot \frac{\epsilon}{4M} = \epsilon

Therefore, fnf\int f_n \to \int f. ∎

Example 4.4: Applying Dominated Convergence Theorem

Problem: Compute limn0sin(x/n)1+x2dx\lim_{n \to \infty} \int_0^\infty \frac{\sin(x/n)}{1 + x^2} \, dx.

Solution:

Define fn(x)=sin(x/n)1+x2f_n(x) = \frac{\sin(x/n)}{1 + x^2} for x0x \geq 0.

Then fn(x)0f_n(x) \to 0 pointwise for all xx (since sin(x/n)0\sin(x/n) \to 0 as nn \to \infty).

We have fn(x)11+x2|f_n(x)| \leq \frac{1}{1 + x^2}, and g(x)=11+x2g(x) = \frac{1}{1 + x^2} is in L1L^1 because

011+x2dx=π2<\int_0^\infty \frac{1}{1 + x^2} \, dx = \frac{\pi}{2} < \infty

By the dominated convergence theorem,

limn0fn(x)dx=00dx=0\lim_{n \to \infty} \int_0^\infty f_n(x) \, dx = \int_0^\infty 0 \, dx = 0
Example 4.5: Fatou's Lemma: When Equality Holds

Problem: Give an example where equality holds in Fatou's lemma, and an example where strict inequality holds.

Solution:

Equality case: Let fn(x)=χ[n,n+1](x)f_n(x) = \chi_{[n, n+1]}(x) on R\mathbb{R}. Then fn0f_n \to 0 pointwise, and fn=1\int f_n = 1 for all nn.

We have lim inffn=0=0\int \liminf f_n = \int 0 = 0 and lim inffn=1\liminf \int f_n = 1, so strict inequality holds: 0<10 < 1.

Equality case: Let fn(x)=χ[0,1/n](x)f_n(x) = \chi_{[0, 1/n]}(x) on [0,1][0,1]. Then fn0f_n \to 0 pointwise, and fn=1/n0\int f_n = 1/n \to 0.

We have lim inffn=0\int \liminf f_n = 0 and lim inffn=0\liminf \int f_n = 0, so equality holds.

More generally, if {fn}\{f_n\} is an increasing sequence, then by the monotone convergence theorem, equality holds in Fatou's lemma.

Example 4.6: Monotone Convergence: Integrating a Series

Problem: Use the monotone convergence theorem to show that

01n=1xnn2dx=n=11n2(n+1)\int_0^1 \sum_{n=1}^\infty \frac{x^n}{n^2} \, dx = \sum_{n=1}^\infty \frac{1}{n^2(n+1)}

Solution:

Define fN(x)=n=1Nxnn2f_N(x) = \sum_{n=1}^N \frac{x^n}{n^2}. Then {fN}\{f_N\} is an increasing sequence of nonnegative functions converging pointwise to f(x)=n=1xnn2f(x) = \sum_{n=1}^\infty \frac{x^n}{n^2}.

By the monotone convergence theorem,

01f(x)dx=limN01fN(x)dx=limNn=1N01xnn2dx\int_0^1 f(x) \, dx = \lim_{N \to \infty} \int_0^1 f_N(x) \, dx = \lim_{N \to \infty} \sum_{n=1}^N \int_0^1 \frac{x^n}{n^2} \, dx

Since 01xndx=1n+1\int_0^1 x^n \, dx = \frac{1}{n+1}, we get

01f(x)dx=n=11n2(n+1)\int_0^1 f(x) \, dx = \sum_{n=1}^\infty \frac{1}{n^2(n+1)}

This demonstrates how the monotone convergence theorem allows us to interchange summation and integration.

Example 4.7: Counterexample: When Dominated Convergence Fails

Problem: Give an example where fnff_n \to f pointwise a.e. but fn\int f_n does not converge to f\int f, and explain why dominated convergence does not apply.

Solution:

On [0,1][0,1], define fn(x)=nχ(0,1/n](x)f_n(x) = n \chi_{(0, 1/n]}(x). Then fn0f_n \to 0 pointwise (since for any x>0x > 0, eventually fn(x)=0f_n(x) = 0), but

01fn(x)dx=n1n=1\int_0^1 f_n(x) \, dx = n \cdot \frac{1}{n} = 1

so fn=1\int f_n = 1 for all nn, while 0=0\int 0 = 0.

Dominated convergence does not apply because there is no gL1g \in L^1 such that fng|f_n| \leq g a.e. for all nn. Any such gg would need to satisfy g(x)ng(x) \geq n on (0,1/n](0, 1/n] for all nn, which would force g=g = \infty on a set of positive measure.

Example 4.8: Application of Uniform Integrability

Problem: Show that the sequence fn(x)=n1+n2x2f_n(x) = \frac{n}{1 + n^2x^2} on [0,1][0,1] is uniformly integrable and converges in L1L^1.

Solution:

First, note that fn(x)0f_n(x) \to 0 pointwise for x>0x > 0, and fn(0)=nf_n(0) = n \to \infty.

For uniform integrability, given ϵ>0\epsilon > 0, choose δ=ϵ\delta = \epsilon. For any measurable set EE with m(E)<δm(E) < \delta, we have

EfnEn1+n2x2dxnm(E)<nϵ\int_E f_n \leq \int_E \frac{n}{1 + n^2x^2} \, dx \leq n \cdot m(E) < n\epsilon

Wait, this doesn't work. Let's use a better bound: fn(x)1xf_n(x) \leq \frac{1}{x} for x>0x > 0, but this is not in L1.

Actually, we can show uniform integrability by noting that 01fn(x)dx=arctan(n)π2\int_0^1 f_n(x) \, dx = \arctan(n) \to \frac{\pi}{2}, and the functions are bounded on sets away from 0. More carefully, for E[δ,1]E \subseteq [\delta, 1], we have fn(x)n1+n2δ2f_n(x) \leq \frac{n}{1 + n^2\delta^2}, which is bounded. The uniform integrability follows from the fact that the integrals are uniformly bounded and the functions decay away from 0.

Example 4.9: Combining Convergence Theorems

Problem: Compute limn0(1+xn)nexdx\lim_{n \to \infty} \int_0^\infty \left(1 + \frac{x}{n}\right)^{-n} e^{-x} \, dx.

Solution:

Define fn(x)=(1+xn)nexf_n(x) = \left(1 + \frac{x}{n}\right)^{-n} e^{-x}.

We know that (1+xn)nex\left(1 + \frac{x}{n}\right)^{-n} \to e^{-x} as nn \to \infty, so fn(x)e2xf_n(x) \to e^{-2x} pointwise.

To apply dominated convergence, we need a bound. Note that (1+xn)nex\left(1 + \frac{x}{n}\right)^{-n} \leq e^{-x} (this follows from the inequality (1+u/n)neu(1 + u/n)^n \leq e^u for u0u \geq 0).

Therefore, fn(x)e2xf_n(x) \leq e^{-2x}, and g(x)=e2xg(x) = e^{-2x} is in L1L^1 on [0,infty)[0, \\infty).

By the dominated convergence theorem,

limn0fn(x)dx=0e2xdx=12\lim_{n \to \infty} \int_0^\infty f_n(x) \, dx = \int_0^\infty e^{-2x} \, dx = \frac{1}{2}
Corollary 4.3: Interchanging Summation and Integration

If fn0f_n \geq 0 are measurable functions, then

n=1fndm=n=1fndm\int \sum_{n=1}^\infty f_n \, dm = \sum_{n=1}^\infty \int f_n \, dm

This follows from the monotone convergence theorem applied to the partial sums.

Corollary 4.4: Continuity of Parameter Integrals

Let f(x,t)f(x, t) be a function such that f(,t)f(\cdot, t) is measurable for each tt, and suppose there exists gL1g \in L^1 such that f(x,t)g(x)|f(x, t)| \leq g(x) for all tt in a neighborhood of t0t_0.

If f(x,t)f(x,t0)f(x, t) \to f(x, t_0) as tt0t \to t_0 for a.e. xx, then

limtt0f(x,t)dm(x)=f(x,t0)dm(x)\lim_{t \to t_0} \int f(x, t) \, dm(x) = \int f(x, t_0) \, dm(x)

This follows from the dominated convergence theorem.

Remark 4.3: Historical Context and Importance of Convergence Theorems

The convergence theorems are among the most important results in Lebesgue integration theory:

  • Fatou's lemma (1906): Proved by Pierre Fatou in his work on complex analysis. It provides a fundamental inequality that underlies many other results.
  • Monotone convergence theorem: Often attributed to Beppo Levi (1906) and sometimes called Levi's theorem. It was a key result in establishing the power of Lebesgue integration.
  • Dominated convergence theorem: Proved by Lebesgue (1908) and later refined. It is the most widely used convergence theorem in practice.

These theorems solved a major problem with Riemann integration: the difficulty of interchanging limits and integrals. In Riemann integration, one typically needed uniform convergence, which is a very strong condition. The Lebesgue convergence theorems work under much weaker hypotheses.

The importance of these theorems cannot be overstated—they are used constantly in modern analysis, probability theory, partial differential equations, and many other areas.

Remark 4.4: When Limits and Integrals Cannot Be Exchanged

It is crucial to understand when the convergence theorems do not apply:

  • Pointwise convergence alone is not enough: Example 4.7 shows that fnff_n \to f pointwise does not guarantee fnf\int f_n \to \int f.
  • Missing domination: If there is no dominating L1 function, the dominated convergence theorem cannot be applied. The sequence may "escape to infinity" in a way that prevents the limit from being interchanged with the integral.
  • Non-monotone sequences: The monotone convergence theorem requires the sequence to be increasing. For decreasing sequences, one can apply it to fn-f_n, but care must be taken with signs.
  • Infinite measure spaces: Some results (like Egorov's theorem) require finite measure. On infinite measure spaces, additional care is needed.

Always verify the hypotheses before applying these theorems. When in doubt, look for counterexamples or use more careful analysis.

Remark 4.5: Applications in Probability Theory

The convergence theorems have fundamental applications in probability:

  • Expectation as an integral: The expectation of a random variable is defined as E[X]=XdPE[X] = \int X \, dP. The convergence theorems allow us to exchange limits and expectations.
  • Monotone convergence: If XnXX_n \uparrow X almost surely, then E[Xn]E[X]E[X_n] \to E[X]. This is crucial for proving properties of expectations.
  • Dominated convergence: If XnXX_n \to X almost surely and XnY|X_n| \leq Y with E[Y]<E[Y] < \infty, then E[Xn]E[X]E[X_n] \to E[X]. This is used constantly in probability theory.
  • Fatou's lemma: In probability, this becomes E[lim infXn]lim infE[Xn]E[\liminf X_n] \leq \liminf E[X_n], which is used to prove many limit theorems.
  • Uniform integrability: This concept is central to martingale theory and convergence of random variables in L1.

These applications demonstrate why the convergence theorems are essential not just for pure analysis, but for applied mathematics as well.

Example 4.10: Fatou's Lemma with Strict Inequality

Problem: Give an example where strict inequality holds in Fatou's lemma.

Solution:

On R\mathbb{R}, define fn(x)=nχ(0,1/n](x)f_n(x) = n \chi_{(0, 1/n]}(x). Then fn0f_n \to 0 pointwise, and fn=1\int f_n = 1 for all nn.

We have lim inffn=0=0\int \liminf f_n = \int 0 = 0 and lim inffn=1\liminf \int f_n = 1, so strict inequality holds: 0<10 < 1.

This example shows that Fatou's lemma can give a strict inequality when the functions "escape to infinity" in a way that prevents the limit from being interchanged with the integral.

Example 4.11: Monotone Convergence: Computing an Infinite Series

Problem: Use the monotone convergence theorem to show that

01n=1xn1n!dx=e1\int_0^1 \sum_{n=1}^\infty \frac{x^{n-1}}{n!} \, dx = e - 1

Solution:

Define fN(x)=n=1Nxn1n!f_N(x) = \sum_{n=1}^N \frac{x^{n-1}}{n!}. Then {fN}\{f_N\} is an increasing sequence of nonnegative functions converging pointwise to f(x)=ex1xf(x) = \frac{e^x - 1}{x} for x>0x > 0 and f(0)=1f(0) = 1.

By the monotone convergence theorem,

01f(x)dx=limNn=1N01xn1n!dx=limNn=1N1nn!=n=11nn!\int_0^1 f(x) \, dx = \lim_{N \to \infty} \sum_{n=1}^N \int_0^1 \frac{x^{n-1}}{n!} \, dx = \lim_{N \to \infty} \sum_{n=1}^N \frac{1}{n \cdot n!} = \sum_{n=1}^\infty \frac{1}{n \cdot n!}

Using the series expansion ex=n=0xnn!e^x = \sum_{n=0}^\infty \frac{x^n}{n!}, we can verify that this equals e1e - 1.

Example 4.12: Dominated Convergence: Parameter-Dependent Integral

Problem: Show that F(t)=0etxsin(x)dxF(t) = \int_0^\infty e^{-tx} \sin(x) \, dx is continuous for t>0t > 0.

Solution:

For fixed t0>0t_0 > 0, consider tt in a neighborhood of t0t_0, say t[t0/2,2t0]t \in [t_0/2, 2t_0].

We have etxsin(x)et0x/2|e^{-tx} \sin(x)| \leq e^{-t_0 x/2} for tt0/2t \geq t_0/2, and g(x)=et0x/2g(x) = e^{-t_0 x/2} is in L1L^1 on [0,infty)[0, \\infty).

As tt0t \to t_0, etxsin(x)et0xsin(x)e^{-tx} \sin(x) \to e^{-t_0 x} \sin(x) pointwise. By the dominated convergence theorem, F(t)F(t0)F(t) \to F(t_0).

Therefore, FF is continuous at t0t_0, and since t0t_0 was arbitrary, FF is continuous on (0,)(0, \infty).

Example 4.13: Uniform Integrability: Necessary and Sufficient Conditions

Problem: Show that a sequence {fn}\{f_n\} in L1L^1 is uniformly integrable if and only if:

  1. supnfn1<\sup_n \|f_n\|_1 < \infty (uniformly bounded in L1)
  2. For every ϵ>0\epsilon > 0, there exists δ>0\delta > 0 such that Efn<ϵ\int_E |f_n| < \epsilon for all nn and all EE with m(E)<δm(E) < \delta

Solution:

The "if" direction follows from the definition. For the "only if" direction, use Chebyshev's inequality: for M>0M > 0,

m({fn>M})fnMCMm(\{|f_n| > M\}) \leq \frac{\int |f_n|}{M} \leq \frac{C}{M}

where C=supnfn1C = \sup_n \|f_n\|_1. For large MM, this is small, and uniform integrability follows.

Theorem 4.6: Scheffé's Lemma

Let {fn}\{f_n\} be a sequence in L1L^1 such that fnff_n \to f pointwise a.e. and fnf\int |f_n| \to \int |f|.

Then fnff_n \to f in L1L^1 (i.e., fnf10\|f_n - f\|_1 \to 0).

Proof of Theorem 4.6:

Proof:

Note that fnffn+f|f_n - f| \leq |f_n| + |f|, so fnf(fnf)2f|f_n - f| - (|f_n| - |f|) \leq 2|f|.

Since fnff_n \to f pointwise, we have fnf0|f_n| - |f| \to 0 pointwise. By Fatou's lemma,

lim sup(fnf)0\limsup \int (|f_n| - |f|) \leq 0

Since fnf\int |f_n| \to \int |f|, we get fnf0\int |f_n - f| \to 0. ∎

Corollary 4.5: Convergence of Positive Parts

If fnff_n \to f in L1L^1, then fn+f+f_n^+ \to f^+ and fnff_n^- \to f^- in L1L^1.

This follows from the fact that fn+f+fnf|f_n^+ - f^+| \leq |f_n - f| and similarly for the negative parts.

Remark 4.6: Comparison of Convergence Modes

The different modes of convergence are related as follows:

  • Uniform convergence implies pointwise convergence, which implies convergence almost everywhere.
  • Lp convergence (for 1p<1 \leq p < \infty) implies convergence in measure.
  • Convergence in measure implies convergence almost everywhere along a subsequence.
  • On finite measure spaces, uniform convergence implies Lp convergence for all pp.
  • With additional conditions (domination, monotonicity), pointwise convergence a.e. can imply L1 convergence.

The convergence theorems provide the conditions under which these implications hold, making them essential tools in analysis.

Remark 4.7: Extensions to Complex-Valued Functions

All convergence theorems extend naturally to complex-valued functions:

  • For a complex function f=u+ivf = u + iv, we define f=u+iv\int f = \int u + i\int v.
  • Fatou's lemma applies to fn|f_n| (the modulus).
  • Monotone convergence requires {fn}\{f_n\} to be real and increasing.
  • Dominated convergence works with a real dominating function gg such that fng|f_n| \leq g.

These extensions are crucial for complex analysis, Fourier theory, and harmonic analysis.

Remark 4.1: Key Insights

Key takeaways:

  • Fatou's lemma provides a lower bound and is the most general result
  • Monotone convergence applies to increasing sequences and gives equality
  • Dominated convergence is the most widely applicable but requires a dominating L1 function
  • These theorems are essential for exchanging limits and integrals
  • Always verify the hypotheses before applying these theorems

Practice Quiz

Convergence Theorems
10
Questions
0
Correct
0%
Accuracy
1
Fatou's lemma applies to:
Easy
Not attempted
2
The monotone convergence theorem requires:
Medium
Not attempted
3
The dominated convergence theorem requires:
Medium
Not attempted
4
Fatou's lemma gives:
Easy
Not attempted
5
If fnff_n \to f pointwise a.e. and fngL1|f_n| \leq g \in L^1, then:
Hard
Not attempted
6
A sequence {fn}\{f_n\} is uniformly integrable if:
Hard
Not attempted
7
The monotone convergence theorem allows us to:
Medium
Not attempted
8
If fn0f_n \geq 0 and fnff_n \to f pointwise, then by Fatou's lemma:
Medium
Not attempted
9
The dominated convergence theorem is more general than the monotone convergence theorem because:
Hard
Not attempted
10
If fnff_n \to f in L1L^1 (i.e., fnf0\int |f_n - f| \to 0), then:
Hard
Not attempted

Frequently Asked Questions

What is the relationship between Fatou's lemma, monotone convergence, and dominated convergence?

Fatou's lemma is the most general but gives only an inequality. The monotone convergence theorem strengthens it to equality for increasing sequences. The dominated convergence theorem applies to more general sequences (not necessarily monotone) but requires a dominating L1 function.

Why do we need these convergence theorems?

In analysis, we often need to exchange limits and integrals. These theorems provide conditions under which $\lim \int f_n = \int \lim f_n$, which is not true in general. They are essential for many proofs and applications.

Can we always exchange limits and integrals?

No. Counterexamples exist where $f_n \to f$ pointwise but $\int f_n$ does not converge to $\int f$. The convergence theorems provide sufficient conditions (monotonicity, domination) under which the exchange is valid.

What is uniform integrability and why is it important?

Uniform integrability means the integrals are uniformly small on sets of small measure. It's a necessary and sufficient condition for L1 convergence (along with convergence in measure), and is crucial for the Vitali convergence theorem.

How do I know which convergence theorem to use?

Use monotone convergence for increasing sequences of nonnegative functions. Use dominated convergence when you have pointwise convergence and can find an L1 dominating function. Use Fatou's lemma when you only need a lower bound.

What happens if the conditions of a convergence theorem are not satisfied?

The conclusion may fail. For example, without domination, the limit and integral may not commute. It's important to verify the hypotheses before applying these theorems.

Are there other convergence theorems besides these three?

Yes, there are other important results like the Vitali convergence theorem (for uniformly integrable sequences), the bounded convergence theorem, and various results for convergence in measure.