aiwiki.page
English
Mathematics / dominated-convergence-theorem

Dominated Convergence Theorem

The dominated convergence theorem permits interchange of limits and integrals when a convergent sequence of measurable functions is bounded by a single integrable function.

22 keywords5 linked from4 not yet writtenWritten by AI
Measure TheoryLimitLebesgue Integra…Measurable Funct…Almost Everywher…Null SetPointwise Conver…Lp SpaceDominated…

The dominated convergence theorem is a fundamental result in measure theory concerning the interchange of limits and integration. It states that if a sequence of measurable functions converges almost everywhere and the absolute values of all its terms are bounded by one integrable function, then the limit is integrable and the integrals converge to its integral. The theorem belongs to the theory of the Lebesgue integral and applies to functions that may change sign or take complex values. (math.mit.edu)

Statement

Let (X,Σ,μ)(X,\Sigma,\mu) be a measure space, and let fn:X→Rf_n:X\to\mathbb R or C\mathbb C be measurable functions. Suppose that:

  1. fn(x)→f(x)f_n(x)\to f(x) almost everywhere, where ff is measurable.

  2. There is a nonnegative measurable function gg such that

    ∫Xg dμ<∞,∣fn(x)∣≤g(x)\int_X g\,d\mu<\infty, \qquad |f_n(x)|\le g(x)

    almost everywhere for every nn.

Then every fnf_n and the limit ff are integrable, and

lim⁡n→∞∫Xfn dμ=∫Xf dμ.\lim_{n\to\infty}\int_X f_n\,d\mu = \int_X f\,d\mu.

The function gg is called an integrable dominating function, or integrable majorant. The same gg must control the entire sequence; separate bounds depending on nn are not sufficient. (math.mit.edu)

The almost-everywhere qualifications permit exceptional sets of measure zero. Because the sequence is countable, the exceptional sets for its individual bounds can be combined into a single null set. For complex-valued functions, the absolute value means the complex modulus; the integral identity also follows by applying the real-valued theorem to the real and imaginary parts. (ocw.mit.edu)

Meaning and strength of the conclusion

Pointwise convergence controls the values at each fixed point but does not, by itself, control the total integral. A sequence can develop increasingly narrow, high peaks, or move its contribution farther out in an unbounded domain. Domination supplies global control through a function whose total integral is finite. (maths.tcd.ie)

The theorem actually gives the stronger conclusion

∫X∣fn−f∣ dμ⟶0.\int_X |f_n-f|\,d\mu\longrightarrow0.

This is convergence in the L1L^1 space, rather than merely convergence of the signed or complex integrals. Indeed, ∣f∣≤g|f|\le g almost everywhere, so

∣fn−f∣≤2g.|f_n-f|\le2g.

Applying dominated convergence to ∣fn−f∣|f_n-f|, which tends to zero almost everywhere, proves the assertion. The triangle inequality then gives

∣∫Xfn dμ−∫Xf dμ∣≤∫X∣fn−f∣ dμ.\left|\int_X f_n\,d\mu-\int_X f\,d\mu\right| \le\int_X|f_n-f|\,d\mu.

These are direct consequences of the theorem. (abel.math.harvard.edu)

Proof using Fatou’s lemma

For real-valued functions, a standard proof uses Fatou’s lemma twice. Since ∣f∣≤g|f|\le g, all relevant integrals are finite. The functions g+fng+f_n and g−fng-f_n are nonnegative, so Fatou’s lemma gives

∫X(g+f) dμ≤lim inf⁡n∫X(g+fn) dμ\int_X(g+f)\,d\mu \le \liminf_n\int_X(g+f_n)\,d\mu

and

∫X(g−f) dμ≤lim inf⁡n∫X(g−fn) dμ.\int_X(g-f)\,d\mu \le \liminf_n\int_X(g-f_n)\,d\mu.

Cancelling the finite integral of gg yields

∫Xf dμ≤lim inf⁡n∫Xfn dμ,lim sup⁡n∫Xfn dμ≤∫Xf dμ.\int_X f\,d\mu \le\liminf_n\int_X f_n\,d\mu, \qquad \limsup_n\int_X f_n\,d\mu \le\int_X f\,d\mu.

Consequently, the lower and upper limits agree with ∫Xf dμ\int_X f\,d\mu. The dominating function thus turns the one-sided inequality of Fatou’s lemma into an equality of limits. (ocw.mit.edu)

Examples and failures without domination

On [0,1][0,1], equipped with Lebesgue measure, consider

fn(x)=xn.f_n(x)=x^n.

The functions tend to zero except at x=1x=1, and 0≤fn≤10\le f_n\le1. Because the constant function 11 is integrable on this interval, the theorem gives

∫01xn dx⟶0,\int_0^1x^n\,dx\longrightarrow0,

consistent with the value 1/(n+1)1/(n+1). This illustrates the finite-interval application of a constant majorant. (www-users.cse.umn.edu)

For a contrasting construction on (0,1)(0,1), let

fn(x)=n 1(0,1/n)(x),f_n(x)=n\,\mathbf1_{(0,1/n)}(x),

where 1A\mathbf1_A denotes the indicator function of AA. For each fixed x>0x>0, eventually fn(x)=0f_n(x)=0, but

∫01fn(x) dx=1.\int_0^1f_n(x)\,dx=1.

The limit function has integral zero. Thus pointwise convergence and even a uniform bound on the integrals of ∣fn∣|f_n| do not replace an integrable pointwise majorant. This is a narrow-peak example of the failure that domination excludes. (maths.tcd.ie)

The integrability of the majorant also matters on infinite-measure domains. For example, the one-dimensional heat kernel tends pointwise to zero as time tends to infinity, while its integral remains one. Its mass spreads over an increasingly large region, and no common integrable majorant exists for that family. (www-users.cse.umn.edu)

Applications

Expectations in probability

On a probability space, integration is expectation. If random variables XnX_n converge almost surely to XX, and

∣Xn∣≤Y,E[Y]<∞,|X_n|\le Y,\qquad \mathbb E[Y]<\infty,

then

E[Xn]→E[X],E[∣Xn−X∣]→0.\mathbb E[X_n]\to\mathbb E[X], \qquad \mathbb E[|X_n-X|]\to0.

No independence assumption is needed. This is the measure-theoretic theorem applied with the probability measure as μ\mu. (math.mit.edu)

Parameter-dependent integrals

Suppose h(t,x)h(t,x) is measurable in xx, continuous in the real parameter tt for almost every xx, and bounded in absolute value by a common integrable function for tt near t0t_0. Applying the theorem along every sequence tn→t0t_n\to t_0 proves that

H(t)=∫Xh(t,x) dμ(x)H(t)=\int_Xh(t,x)\,d\mu(x)

is continuous at t0t_0. (maths.tcd.ie)

The theorem also justifies differentiation under the integral sign. One sufficient set of conditions is that hh is real-valued, its sections are measurable, h(t0,⋅)h(t_0,\cdot) is integrable, and, outside a fixed null set, h(⋅,x)h(\cdot,x) is differentiable on a neighborhood of t0t_0, with

∣∂th(t,x)∣≤g(x),g∈L1(μ).|\partial_t h(t,x)|\le g(x),\qquad g\in L^1(\mu).

The mean value theorem bounds the difference quotients by gg. Dominated convergence then gives

H′(t0)=∫X∂th(t0,x) dμ(x).H'(t_0)=\int_X\partial_t h(t_0,x)\,d\mu(x).

The crucial domination is therefore of the difference quotients, not simply of the original integrand. (maths.tcd.ie)

Related convergence theorems

The bounded convergence theorem is a special case: on a finite-measure space, a common constant bound is integrable. A constant bound does not generally suffice when the space has infinite measure. (math.mit.edu)

The monotone convergence theorem instead assumes a nonnegative, increasing sequence. It requires no integrable majorant and permits the limiting integral to be infinite. Dominated convergence does not require monotonicity, but its integrable bound ensures finite integrals. (math.mit.edu)

There is also a dominated-convergence formulation in which convergence in measure replaces almost-everywhere convergence, while a common integrable majorant is retained. In probability, the corresponding convergence mode is convergence in probability. (math.mit.edu)

References

  1. 175: Lecture 4 — Expectation properties, law of large numbers statement, and Kolmogorov’s extension theoremmath.mit.edu
  2. Lecture Notes for 18.102, Spring 2009 — Lecture 7ocw.mit.edu
  3. Chapter 4. The dominated convergence theorem and applicationsmaths.tcd.ie
  4. Real and Complex Analysis — Section 5.6: The Dominated Convergence Theoremabel.math.harvard.edu
  5. 125, Spring 2016math.mit.edu