Fact-checked by Grok 2 weeks ago

Dominated convergence theorem

The Dominated Convergence Theorem is a cornerstone result in measure theory and Lebesgue integration, providing conditions under which the limit of a sequence of integrals equals the integral of the pointwise limit of measurable functions, specifically when the sequence is dominated by an integrable function.^[1] Formulated by Henri Lebesgue in the early 20th century as part of his development of the Lebesgue integral, the theorem addresses a critical limitation of Riemann integration by enabling the rigorous interchange of limits and integrals in more general settings.^[1]^[2] In precise terms, the theorem states that if (X, \mathcal{A}, \mu) is a measure space, \{f_n\}_{n=1}^\infty is a sequence of \mu-measurable functions from X to [-\infty, \infty] that converges \mu-almost everywhere to a function f: X \to [-\infty, \infty], and there exists a \mu-integrable function g: X \to [0, \infty] such that |f_n(x)| \leq g(x) for all n and \mu-almost all x \in X, then f is \mu-integrable and \lim_{n \to \infty} \int_X f_n \, d\mu = \int_X f \, d\mu.^[2] This domination condition ensures that the sequence remains controlled in the L^1 sense, preventing pathologies where pointwise convergence fails to preserve integral convergence, such as sequences whose integrals do not approach zero despite pointwise limits of zero.^[3] The theorem's significance lies in its broad applicability across mathematical analysis, probability theory, and related fields, where it facilitates the passage of limits inside integrals without requiring stronger conditions like uniform convergence or monotonicity—unlike related results such as the Monotone Convergence Theorem or Fatou's Lemma.^[2]^[3] Key applications include establishing the continuity and differentiability of parameter-dependent integrals, such as F(t) = \int_X f(x, t) \, d\mu(x) under suitable domination of |f(\cdot, t)| and its partial derivatives by integrable functions; proving convergence in L^p spaces for $1 \leq p < \infty; and justifying approximations in Fourier analysis and stochastic processes.^[4]^[2] For instance, it underpins the computation of improper integrals like \int_{-\infty}^\infty \frac{1}{1+x^2} \, dx = \pi by approximating the integrand with a bounded sequence converging pointwise.^[3]

Introduction and Background

Historical Context

The limitations of the Riemann integral, particularly in dealing with improper integrals and the convergence of series like Fourier series, became apparent in the late 19th century, prompting mathematicians to seek more robust theories of integration. Camille Jordan and others attempted extensions, but it was Henri Lebesgue who revolutionized the field by introducing a measure-based integral capable of handling a broader class of functions, motivated by the need to justify term-by-term integration of series and limits of integrals that the Riemann approach could not reliably address. Lebesgue first defined his integral in his 1902 doctoral thesis Intégrale, longueur, aire, laying the groundwork for modern measure theory. The dominated convergence theorem emerged shortly thereafter as a pivotal tool in his 1904 publication Leçons sur l'intégration et la recherche des fonctions primitives, where it enabled the interchange of limits and integrals under suitable domination conditions, resolving key issues in the analysis of function sequences. In the 1910s, Frigyes Riesz provided significant refinements to convergence results in Lebesgue integration, including extensions and alternative proofs that strengthened the theorem's applicability in the study of integrable function systems and laid foundations for functional analysis. These contributions appeared in works such as his 1910 paper "Untersuchungen über Systeme integrierbarer Funktionen," which explored convergence properties central to the dominated convergence framework.^[5] The theorem achieved formalization in modern measure theory through texts like Paul Halmos's Measure Theory (1950), which presented it in an abstract, general setting. Simultaneously, in the 1930s, Andrey Kolmogorov integrated the dominated convergence theorem into probability theory via his measure-theoretic foundations, notably in Foundations of the Theory of Probability (1933), enabling rigorous treatment of limit theorems and expectations in stochastic processes.

Role in Measure Theory

The Dominated Convergence Theorem (DCT) operates within the framework of measure theory, where the Lebesgue measure serves as a fundamental prerequisite, extending the concept of length to a broader class of sets in \mathbb{R}^n through countable additivity and translation invariance on Lebesgue measurable sets.^[6]^[7] The Lebesgue integral, another essential prerequisite, defines the integral of a measurable function f over a measure space (X, \mathcal{A}, \mu) as the limit of integrals of simple functions approximating f, with a function deemed integrable if it is measurable and \int_X |f| \, d\mu < \infty.^[6]^[7] These tools enable the rigorous treatment of limits and integrals beyond Riemann integration, forming the basis for analyzing sequences of functions in L^1 spaces.^[2] As a cornerstone of measure theory, the DCT bridges pointwise almost everywhere convergence of a sequence of measurable functions to convergence of their integrals in L^1 spaces, provided the sequence is dominated by an integrable function, thus preserving the integrability of the limit and equating the limit of the integrals to the integral of the limit.^[6]^[7] This result is pivotal for limit theorems in L^1(\mu), allowing the interchange of limits and integrals under controlled conditions, which is crucial for advancing real analysis and related fields like partial differential equations.^[6] In comparison to the Monotone Convergence Theorem (MCT), which applies specifically to non-decreasing sequences of non-negative measurable functions and guarantees \int f \, d\mu = \lim \int f_n \, d\mu without a dominating function, the DCT offers broader applicability by accommodating non-monotonic sequences through the domination hypothesis.^[6]^[7]^[2] The MCT suffices for increasing approximations but fails for oscillating or sign-changing sequences, whereas the DCT's flexibility makes it indispensable for general convergence scenarios in measure spaces.^[2] Fatou's lemma complements the DCT by providing the inequality \int \liminf f_n \, d\mu \leq \liminf \int f_n \, d\mu for non-negative measurable functions and is often used in proofs of the DCT.^[6]^[7]^[2] By enabling proofs of such lemmas and supporting interchanges in more complex theorems like Fubini's, the DCT underpins the structural integrity of integration theory.^[7]

Formal Statement

Measure-Theoretic Version

The dominated convergence theorem in its measure-theoretic form provides a foundational result for interchanging limits and integrals in the context of Lebesgue integration on general measure spaces. Consider a measure space (X, \Sigma, \mu), where X is a nonempty set, \Sigma is a \sigma-algebra of subsets of X, and \mu: \Sigma \to [0, \infty] is a measure satisfying \mu(\emptyset) = 0 and countable additivity.^[6] The functions involved are extended real-valued or complex-valued, with measurability defined with respect to \Sigma, meaning the preimage of Borel sets under the function lies in \Sigma.^[6] While the theorem holds for arbitrary measures, it is often applied in \sigma-finite settings where X admits a countable partition into sets of finite measure, though this is not strictly required for the statement.^[8] The precise statement is as follows: Let \{f_n\}_{n=1}^\infty be a sequence of \Sigma-measurable functions f_n: X \to \overline{\mathbb{R}} (or \mathbb{C}) that converge pointwise \mu-almost everywhere to a function f: X \to \overline{\mathbb{R}}, meaning f_n(x) \to f(x) for all x \in X except possibly on a set of \mu-measure zero. Suppose there exists a \Sigma-measurable function g: X \to [0, \infty] such that \int_X g \, d\mu < \infty (i.e., g is integrable) and |f_n(x)| \leq g(x) for all n \in \mathbb{N} and \mu-almost every x \in X. Then f is \Sigma-measurable and integrable, f \in L^1(X, \Sigma, \mu), the sequence converges in the L^1-norm via

\lim_{n \to \infty} \int_X |f_n - f| \, d\mu = 0,

and the integrals converge as

\lim_{n \to \infty} \int_X f_n \, d\mu = \int_X f \, d\mu.

^[6]^[8] This formulation establishes both L^1 convergence of the sequence to its pointwise limit and the validity of passing the limit inside the integral, a bidirectional interchange that underpins much of modern analysis. The L^1 convergence implies the integral limit directly, since \left| \int_X f_n \, d\mu - \int_X f \, d\mu \right| \leq \int_X |f_n - f| \, d\mu \to 0.^[6] In the special case where \mu(X) = 1, the theorem adapts naturally to probability spaces, interpreting f_n as random variables.^[6]

Probabilistic Version

In probability theory, the dominated convergence theorem is formulated for sequences of random variables defined on a probability space (\Omega, \mathcal{F}, P). Let X_n be a sequence of random variables converging almost surely to a random variable X, that is, P(X_n(\omega) \to X(\omega)) = 1. Suppose there exists a dominating random variable Y such that |X_n| \leq Y almost surely for all n and E[|Y|] < \infty. Then X is integrable, the expectations converge as E[X_n] \to E[X], and the L^1 convergence holds: E[|X_n - X|] \to 0.^[9] The emphasis on almost sure convergence distinguishes this version from weaker modes like convergence in probability, while the expectation operator E[\cdot] replaces the general integral over the measure space. The domination condition ensures the sequence remains controlled by an integrable envelope, allowing the limit to pass inside the expectation. This result is particularly powerful in probabilistic settings for interchanging limits and expectations in laws of large numbers or martingale convergence.^[9] Since the probability measure satisfies P(\Omega) = 1, the theorem applies directly to finite-measure spaces, contrasting with the general measure-theoretic version where the dominating function must be integrable with respect to potentially infinite measures. A related but distinct concept is uniform integrability of \{X_n\}, which strengthens the theorem by enabling E[X_n] \to E[X] under convergence in probability alone, without a single dominating function, provided \sup_n E[|X_n| \mathbf{1}_{|X_n| > a}] \to 0 as a \to \infty.^[10]

Proof

Key Ideas

The dominated convergence theorem hinges on the presence of an integrable dominating function g that bounds the sequence of functions f_n and their pointwise limit f, ensuring that |f_n(x) - f(x)| \leq 2g(x) almost everywhere. This bound guarantees uniform integrability of the differences |f_n - f|, as the integrability of g implies that the integrals of these differences remain controlled, allowing the limit of the integrals to equal the integral of the limit.^[11] The core strategy of the proof involves applying Fatou's lemma to suitable combinations of the functions to establish both the integrability of f and the convergence of the integrals. Specifically, consider g + f_n and g - f_n, which are dominated by $2g and converge pointwise almost everywhere to g + f and g - f, respectively. Fatou's lemma provides the necessary lower semicontinuity to bound the liminf and limsup of the integrals, forcing convergence under the domination condition. This approach prevents the "escape of mass," where without an integrable bound, pointwise convergence might allow mass to concentrate on sets of small measure or disperse to infinity, causing the integrals to diverge or fail to converge to the expected limit.^[12]

Detailed Derivation

Assume the functions f_n are real-valued and \mathcal{A}-measurable, f_n \to f \mu-a.e., and there exists a non-negative integrable dominating function g such that |f_n| \leq g \mu-a.e. for each n, with \int_X g \, d\mu < \infty. The complex-valued case follows by applying the result separately to the real and imaginary parts. First, establish the integrability of f. Since |f_n| \to |f| \mu-a.e. and $0 \leq |f_n| \leq g for all n, Fatou's lemma yields

\int_X |f| \, d\mu = \int_X \liminf_{n \to \infty} |f_n| \, d\mu \leq \liminf_{n \to \infty} \int_X |f_n| \, d\mu \leq \int_X g \, d\mu < \infty.

Thus, f \in L^1(X, \mu).^[13]^[6] To prove \lim_{n \to \infty} \int_X f_n \, d\mu = \int_X f \, d\mu, apply Fatou's lemma to the non-negative functions g + f_n and g - f_n. Note that g + f_n \to g + f \mu-a.e. and $0 \leq g + f_n \leq 2g, so by Fatou's lemma,

\int_X (g + f) \, d\mu \leq \liminf_{n \to \infty} \int_X (g + f_n) \, d\mu = \int_X g \, d\mu + \liminf_{n \to \infty} \int_X f_n \, d\mu.

Thus,

\int_X f \, d\mu \leq \liminf_{n \to \infty} \int_X f_n \, d\mu.

Similarly, since g - f_n \to g - f \mu-a.e. and $0 \leq g - f_n \leq 2g,

\int_X (g - f) \, d\mu \leq \liminf_{n \to \infty} \int_X (g - f_n) \, d\mu = \int_X g \, d\mu - \limsup_{n \to \infty} \int_X f_n \, d\mu,

which rearranges to

\limsup_{n \to \infty} \int_X f_n \, d\mu \leq \int_X f \, d\mu.

Combining these inequalities yields

\lim_{n \to \infty} \int_X f_n \, d\mu = \int_X f \, d\mu.

This also implies \lim_{n \to \infty} \int_X |f_n - f| \, d\mu = 0, as |\int_X (f_n - f) \, d\mu| \leq \int_X |f_n - f| \, d\mu and the left side tends to zero. For the non-negative case where $0 \leq f_n \to f \mu-a.e. and $0 \leq f_n \leq g, the result follows directly from the above or via the monotone convergence theorem applied after adjustment. The general signed case extends via decomposition into positive and negative parts, each dominated by g.^[12]^[13]^[6]

Assumptions and Their Role

The Dominating Function

In the dominated convergence theorem, the dominating function g is a non-negative integrable function such that g \geq |f_n| \mu-almost everywhere for every n, with \int g \, d\mu < \infty.^[6]^[14] This condition ensures that the sequence \{f_n\} remains bounded in a manner that supports the theorem's conclusion regarding the convergence of integrals. The role of g is to provide a uniform integrable envelope for the sequence, guaranteeing that |f_n - f| \leq 2g \mu-almost everywhere, where f is the pointwise limit of f_n.^[6] This bound implies that the family \{|f_n|\} is uniformly integrable, meaning \sup_n \int_{\{|f_n| > K\}} |f_n| \, d\mu \to 0 as K \to \infty, since the integral over such sets is controlled by the tail of g, which vanishes due to its integrability.^[6] Uniform integrability thus prevents the mass of the functions from escaping in a way that would disrupt the interchange of limits and integrals. Mere L^1-boundedness of the sequence, where \sup_n \int |f_n| \, d\mu < \infty, is insufficient without domination, as it does not provide the necessary pointwise control to ensure convergence of the integrals.^[6]^[14] A standard counterexample is the "typewriter sequence" on [0,1], where indicator functions cycle through dyadic intervals, yielding bounded L^1-norms but failing to converge in L^1 due to uncontrolled mass redistribution.^[6]

Pointwise Convergence and Measurability

In the dominated convergence theorem, a key assumption is that the sequence of functions \{f_n\} converges pointwise almost everywhere to a limit function f on the measure space (X, \mathcal{A}, \mu), meaning f_n(x) \to f(x) for \mu-almost every x \in X.^[2] This condition ensures that the pointwise behavior of the functions aligns with the limit in all but a set of measure zero, which is critical for interchanging limits and integrals.^[15] All functions involved—f_n, f, and the dominating function g—must be measurable with respect to the \sigma-algebra \mathcal{A}. Measurability of f_n and g is required for their integrals to be well-defined, while the limit f inherits measurability as the pointwise limit of measurable functions almost everywhere.^[2] Without these measurability conditions, the integrals may not exist or behave as expected in the theorem.^[16] The almost everywhere qualification suffices because integrals are invariant under modifications on null sets, i.e., sets N \subset X with \mu(N) = 0; altering functions on such sets does not change their integrals.^[15] Thus, pointwise convergence on the complement of a null set preserves the convergence of integrals under the theorem's other assumptions.^[2] While pointwise almost everywhere convergence is standard, alternatives like convergence in measure—where for every \epsilon > 0, \mu(\{x : |f_n(x) - f(x)| \geq \epsilon\}) \to 0—are weaker and do not guarantee integral convergence without the dominating function.^[15] Convergence in measure alone can fail to imply \int f_n \, d\mu \to \int f \, d\mu, as mass may escape to infinity without domination.^[15]

Special Cases

Bounded Convergence Theorem

The bounded convergence theorem provides a specific instance of the dominated convergence theorem applicable when functions are uniformly bounded by a constant. Consider a measure space (X, \mathcal{A}, \mu) with \mu(X) < \infty. Suppose \{f_n\}_{n=1}^\infty is a sequence of measurable functions satisfying |f_n(x)| \leq M for some constant M < \infty and all n \in \mathbb{N}, and f_n \to f pointwise \mu-almost everywhere, where f: X \to \mathbb{C} is measurable. Then f is integrable, |f(x)| \leq M \mu-almost everywhere, and \lim_{n \to \infty} \int_X f_n \, d\mu = \int_X f \, d\mu. To prove this, observe that the constant function g(x) = M serves as a dominating function, since |f_n| \leq g \mu-almost everywhere for all n and g is integrable: \int_X g \, d\mu = M \mu(X) < \infty. The pointwise convergence condition also holds for f. Thus, the hypotheses of the dominated convergence theorem are met, yielding the desired limit of integrals. This result extends to \sigma-finite measure spaces, where X = \bigcup_{k=1}^\infty X_k with each X_k \in \mathcal{A} and \mu(X_k) < \infty. The uniform bound |f_n| \leq M ensures integrability on each X_k, allowing application of the finite-measure case to the restrictions f_n|_{X_k} and f|_{X_k}, followed by summing the integrals over the countable partition. In contrast to the monotone convergence theorem, which applies only to non-decreasing sequences of non-negative functions and relies on monotonicity to pass limits inside integrals, the bounded convergence theorem accommodates sequences that may oscillate, provided the uniform bound and finite (or \sigma-finite) measure control the integrals.^[17]

L^p Spaces Corollary

A key corollary of the dominated convergence theorem extends its applicability to L^p spaces for $1 \leq p < \infty. Specifically, suppose (X, \mathcal{A}, \mu) is a measure space, \{f_n\} is a sequence of measurable functions converging pointwise almost everywhere to a measurable function f: X \to \mathbb{R} (or \mathbb{C}), and there exists a function g \in L^p(X, \mathcal{A}, \mu) such that |f_n(x)| \leq g(x) for \mu-almost every x \in X and all n \in \mathbb{N}. Then f \in L^p(X, \mathcal{A}, \mu) and \|f_n - f\|_p \to 0 as n \to \infty, where \|h\|_p = \left( \int_X |h|^p \, d\mu \right)^{1/p}.^[18] To derive this from the measure-theoretic dominated convergence theorem, first observe that |f_n|^p \to |f|^p pointwise almost everywhere and |f_n|^p \leq g^p almost everywhere, with g^p \in L^1(X, \mathcal{A}, \mu) since g \in L^p(X, \mathcal{A}, \mu). Applying the dominated convergence theorem to the non-negative functions |f_n|^p yields \int_X |f_n|^p \, d\mu \to \int_X |f|^p \, d\mu < \infty, so f \in L^p(X, \mathcal{A}, \mu).^[18] Next, consider |f_n - f|^p. This converges pointwise almost everywhere to 0, and by the inequality |a - b|^p \leq 2^{p-1} (|a|^p + |b|^p) for a, b \geq 0 and p \geq 1, it follows that |f_n - f|^p \leq 2^{p-1} (|f_n|^p + |f|^p) \leq 2^p g^p almost everywhere. Since $2^p g^p \in L^1(X, \mathcal{A}, \mu), another application of the dominated convergence theorem gives \int_X |f_n - f|^p \, d\mu \to 0, hence \|f_n - f\|_p \to 0.^[18] This corollary strengthens pointwise convergence under domination to norm convergence in L^p, enabling interchanges of limits and integrals in L^p settings, such as in functional analysis and partial differential equations. It generalizes the case p=1, which recovers the original theorem, and holds without requiring finite measure, unlike some bounded variants.^[18]

Applications

In Real Analysis

One prominent application of the dominated convergence theorem (DCT) in real analysis is in justifying the differentiation of integrals with respect to a parameter, often termed "differentiation under the integral sign." Consider a function f: \mathbb{R} \times I \to \mathbb{R}, where I is an interval, such that for each fixed t \in I, x \mapsto f(x, t) is measurable and integrable over \mathbb{R}, and the partial derivative \frac{\partial f}{\partial t}(x, t) exists and satisfies |\frac{\partial f}{\partial t}(x, t)| \leq g(x) for some integrable g. Then, the function F(t) = \int_{\mathbb{R}} f(x, t) \, dx is differentiable on I, with F'(t) = \int_{\mathbb{R}} \frac{\partial f}{\partial t}(x, t) \, dx.^[2] This result follows by applying the DCT to the difference quotient \frac{F(t+h) - F(t)}{h} = \int_{\mathbb{R}} \frac{f(x, t+h) - f(x, t)}{h} \, dx, where pointwise convergence to the partial derivative holds by the mean value theorem, and domination ensures the interchange of limit and integral.^[19] The DCT also facilitates the analysis of Fourier series by enabling the interchange of limits in integrals defining the coefficients. For a function f \in L^1([0, 1]) and a sequence of approximations f_n converging pointwise to f with |f_n| \leq M for some constant M, the Fourier coefficients c_n(f) = \int_0^1 f(x) e^{-2\pi i n x} \, dx satisfy \lim_{n \to \infty} c_k(f_n) = c_k(f) for each k, by applying the DCT with dominating function M \cdot 1_{[0,1]}.^[20] In the context of convolutions, if f and g are in the Wiener algebra A(\mathbb{S}^1) (trigonometric polynomials dense), the coefficient of the product fg is \hat{(fg)}(n) = \sum_k \hat{f}(k) \hat{g}(n-k), justified by approximating with Fejér kernels and using the DCT to pass the limit inside the integral representation.^[21] A key use of the DCT arises in evaluating parameter-dependent integrals, particularly for interchanging limits: if f(x, t) is measurable in x for each t, continuous in t for almost every x, and |f(x, t)| \leq g(x) with g \in L^1(\mathbb{R}) for t near t_0, then \lim_{t \to t_0} \int_{\mathbb{R}} f(x, t) \, dx = \int_{\mathbb{R}} \lim_{t \to t_0} f(x, t) \, dx.^[2] This ensures continuity of F(t) = \int_{\mathbb{R}} f(x, t) \, dx. An illustrative example is the improper integral \int_0^\infty \frac{\sin x}{x} \, dx = \frac{\pi}{2}, computed via the parameterized form F(t) = \int_0^\infty e^{-t x} \frac{\sin x}{x} \, dx for t > 0, where F'(t) = -\int_0^\infty e^{-t x} \sin x \, dx = -\frac{1}{1 + t^2} (justified by DCT with dominator e^{-t x}), yielding the value \frac{\pi}{2} upon integration and taking the limit as t \to 0^+.^[22]

In Probability and Stochastic Processes

The dominated convergence theorem (DCT) plays a pivotal role in probability theory by enabling the interchange of limits and expectations for sequences of random variables that converge almost surely, provided they are dominated by an integrable random variable. This is essential for i.i.d. random variables X_1, X_2, \dots with finite mean \mu = \mathbb{E}[X_1], where the strong law of large numbers guarantees that the sample average \bar{X}_n = n^{-1} \sum_{i=1}^n X_i converges almost surely to \mu. Under the additional assumption of domination by an integrable Y (e.g., when the X_i are bounded above in absolute value by a constant times Y), DCT implies \mathbb{E}[\bar{X}_n] \to \mathbb{E}[\mu] = \mu, though linearity of expectation already yields this directly; more powerfully, for a bounded continuous function f, it ensures \mathbb{E}[f(\bar{X}_n)] \to f(\mu), facilitating the study of asymptotic behavior of functionals of the average.^[23] In the weak law of large numbers (WLLN), DCT underpins the truncation method for i.i.d. random variables with finite mean but potentially infinite variance. The approach decomposes each X_i into a truncated part X_{i,\leq n} = X_i \mathbf{1}_{|X_i| \leq n} (bounded by n, hence dominated) and a tail X_{i,>n} = X_i \mathbf{1}_{|X_i| > n}; the truncated averages converge in probability to \mu via Chebyshev's inequality and bounded convergence (a special case of DCT), while the probability of nonzero tail contribution vanishes as n \to \infty by Markov's inequality on the integrable tails. This yields \bar{X}_n \to \mu in probability, with the domination ensuring control over the expectations of the truncated sums.^[23] For martingales, DCT facilitates convergence results by passing limits inside expectations, particularly for stopped martingales. Consider a martingale (X_n) bounded in L^p for p > 1, so \sup_n \mathbb{E}[|X_n|^p] < \infty; the martingale convergence theorem implies almost sure convergence to some X_\infty, and DCT applies with dominator $2 \sup_m |X_m| (which is in L^p by Doob's maximal inequality), yielding X_n \to X_\infty in L^p and thus \mathbb{E}[|X_n - X_\infty|^p] \to 0. For a stopped martingale X_{n \wedge \tau} at a stopping time \tau, if the unstopped process is dominated (e.g., by uniform integrability), DCT justifies \mathbb{E}[\lim_{n \to \infty} X_{n \wedge \tau}] = \lim_{n \to \infty} \mathbb{E}[X_{n \wedge \tau}], crucial for optional stopping theorems and computing limits of conditional expectations.^[24] An illustrative application arises in central limit theorem (CLT) approximations, where uniform integrability—closely tied to domination—ensures convergence of expectations for functions of normalized sums. For i.i.d. random variables with mean zero and finite variance \sigma^2 > 0, the CLT states that S_n / \sqrt{n} \to_d \mathcal{N}(0, \sigma^2); if the family \{ |S_n / \sqrt{n}|^p : n \in \mathbb{N} \} is uniformly integrable for some p > 1 (e.g., under finite moments), DCT implies that for a continuous function g with |g(x)| \leq C(1 + |x|^k) for k < p and integrable g(Z) under Z \sim \mathcal{N}(0, \sigma^2), \mathbb{E}[g(S_n / \sqrt{n})] \to \mathbb{E}[g(Z)], providing rigorous justification for asymptotic approximations in statistical inference.^[25]

Extensions

To Abstract Measure Spaces

The dominated convergence theorem extends to arbitrary measure spaces (X, \mathcal{M}, \mu), where \mathcal{M} is a \sigma-algebra and \mu is any measure, not necessarily \sigma-finite or finite. In this general setting, if a sequence of measurable functions f_n: X \to \mathbb{R} (or \mathbb{C}) converges pointwise \mu-almost everywhere to a measurable function f: X \to \mathbb{R} (or \mathbb{C}), and there exists an integrable dominating function g: X \to [0, \infty) such that |f_n| \leq g \mu-almost everywhere for each n, then \lim_{n \to \infty} \int_X f_n \, d\mu = \int_X f \, d\mu. This formulation holds without additional restrictions on the measure \mu, as the proof relies on the monotone convergence theorem applied to the positive and negative parts of the functions, combined with the integrability of g, rather than on finiteness assumptions.^[15] While the theorem applies directly to infinite measure spaces, the dominating function g must satisfy \int_X g \, d\mu < \infty globally, ensuring that the sequence does not "escape to infinity" in regions of large measure. Partitioning the space into \sigma-finite components is possible for some convergence results, but for the dominated convergence theorem, such partitioning is unnecessary and potentially problematic, as the domination condition must hold across the entire space to control the integrals uniformly. Proofs that invoke Egoroff's theorem for uniform convergence on sets of finite measure may require the measure to be locally finite (i.e., finite on a countable collection of sets covering X) or \sigma-finite to apply effectively, but the standard proof avoids this by using simple function approximations valid in the general case.^[15] In non-complete measure spaces, the pointwise limit f of measurable functions f_n may fail to be measurable, even almost everywhere. To apply the theorem, one typically completes the measure space or extends the functions to measurable representatives within their equivalence classes, ensuring the limit is treated as a measurable version modulo null sets. This adjustment preserves the integral convergence under the domination hypothesis.^[26] A related version appears in functional analysis for one-parameter semigroups of positive operators on Banach lattices, where pointwise convergence of T(t)f_n to T(t)f as n \to \infty, dominated by an integrable function independent of t, implies strong convergence \|T(t)f_n - T(t)f\| \to 0 for each t \geq 0. This extension leverages the order-preserving properties of positive operators to control norms via integral domination.

Vitali Convergence Theorem

The Vitali convergence theorem extends the dominated convergence theorem by replacing the pointwise domination condition with uniform integrability of the sequence, while requiring only convergence in measure rather than pointwise convergence. Let (X, \mathcal{A}, \mu) be a measure space. Suppose \{f_n\} is a sequence of functions in L^1(\mu) that converges in measure to an integrable function f \in L^1(\mu), and suppose the family \{|f_n|\}_{n \in \mathbb{N}} is uniformly integrable. Then \lim_{n \to \infty} \int_X |f_n - f| \, d\mu = 0.^[27] Uniform integrability of \{|f_n|\} means that \sup_n \int_X |f_n| \, d\mu < \infty and, for every \varepsilon > 0, there exists K > 0 such that \sup_n \int_{\{|f_n| > K\}} |f_n| \, d\mu < \varepsilon; equivalently, for every \varepsilon > 0, there exists \delta > 0 such that if E \in \mathcal{A} with \mu(E) < \delta, then \sup_n \int_E |f_n| \, d\mu < \varepsilon.^[28] This condition ensures that the functions do not concentrate excessive mass on sets of small measure or exhibit heavy tails, providing a global control on the integrability that substitutes for a single dominating function. A standard proof proceeds by first using convergence in measure and the \sigma-finiteness of the space (or finite measure case) to apply Egorov's theorem, yielding a subsequence that converges pointwise almost everywhere and uniformly on subsets of finite measure. Uniform integrability is then used to show L^1 convergence along this subsequence: on each finite-measure subset, the uniform convergence allows application of the bounded convergence theorem (since the L^1 norms are uniformly bounded), and the integrals outside are controlled by the uniform integrability condition. The de la Vallée Poussin theorem characterizes the uniform integrability via the existence of a convex increasing function \Phi with \Phi(t)/t \to \infty and \sup_n \int \Phi(|f_n|) \, d\mu < \infty, aiding in verification but not directly constructing a global dominator. Uniform integrability extends the L^1 convergence from the subsequence to the full sequence by establishing that the sequence is Cauchy in L^1, using the maximal inequality for the differences.^[28]^[27] The theorem, named after the Italian mathematician Giuseppe Vitali (1875–1932), originated as a converse-like result to early integration theorems in his 1907 paper establishing conditions for interchanging limits and integrals of series.^[29] It highlights uniform integrability as the key property ensuring strong L^1 convergence under weaker topological assumptions than pointwise domination, making it particularly useful in probability theory where convergence in measure (or probability) is natural.

References

[1]
[PDF] 4 Expectation & the Lebesgue Theorems - Stat@Duke
Sep 20, 2017 · The two most famous of these conditions are both attributed to Henri Lebesgue: the Monotone Convergence Theorem (MCT) and the Domi-.
[2]
[PDF] Chapter 4. The dominated convergence theorem and applica- tions
Fatou's lemma and the dominated convergence theorem are other theorems in this vein, where monotonicity is not required but something else is needed in its ...
[3]
Dominated Convergence Theorem - Math3ma
Oct 12, 2015 · The Monotone Convergence Theorem (MCT), the Dominated Convergence Theorem (DCT), and Fatou's Lemma are three major results in the theory of ...
[4]
Lebesgue Dominated Convergence Theorem - ScienceDirect.com
Lebesgue's Dominated Convergence Theorem is defined as a principle that ensures the interchange of limits and integrals for a sequence of measurable functions, ...<|control11|><|separator|>
[5]
[PDF] An Introduction to Measure Theory - Terry Tao
orem, the dominated convergence theorem (Theorem 1.4.49). This convergence theorem makes the Lebesgue integral (and its abstract generalisations to other ...
[6]
[PDF] MEASURE AND INTEGRATION - ETH Zürich
It includes proofs of the Lebesgue Monotone Convergence Theorem, the Lemma of Fatou, and the Lebesgue Dominated Convergence Theorem. In Chapter 2 we move on ...<|control11|><|separator|>
[7]
[PDF] Key theorems in measure theory - UNM Math
We have stated the generalized version of the dominated convergence theorem, but in practice, one often applies this to the standard case with gk a sequence of ...
[8]
[PDF] Probability: Theory and Examples Rick Durrett Version 5 January 11 ...
Jan 11, 2019 · The Ex- amples, Theorems, and Lemmas are now numbered in one sequence to make it easier to find things.
[9]
[PDF] Probability and Measure - University of Colorado Boulder
Measure and integral are used together in Chapters 4 and 5 for the study of random sums, the Poisson process, convergence of measures, characteristic functions, ...
[10]
[PDF] Lecture notes for Math 205A, Version 2014 - Stanford Mathematics
Nov 18, 2014 · as ξ0 → ξ, by the Lebesgue dominated convergence theorem since f ∈ L1(Rn). ... The dominated convergence theorem implies that both integrals on ...
[11]
[PDF] Math 6710. Probability Theory I
Theorem 3.8.2 (Dominated Convergence). If fn → f almost everywhere, and |fn| ≤ g, where. Z g dµ < ∞, then. Z fn dµ →. Z f dµ. Proof. Observe that |fn| ≤ g ...
[12]
[PDF] MIRA.pdf - Measure, Integration & Real Analysis
... proofs related to measure, integration, and real analysis. This book aims to guide you to the wonders of this subject. You cannot read mathematics the way ...
[13]
[PDF] An Introduction to Real Analysis John K. Hunter - UC Davis Math
Abstract. These are some notes on introductory real analysis. They cover the properties of the real numbers, sequences and series of real numbers, limits.
[14]
245A, Notes 3: Integration on abstract measure spaces, and the ...
Sep 25, 2010 · The monotone convergence theorem is, in some sense, a defining property of the unsigned integral, as the following exercise illustrates.
[15]
Lecture 12. Lebesgue Integrable Functions, the Lebesgue Integral and the Dominated Convergence Theorem | Introduction to Functional Analysis | Mathematics | MIT OpenCourseWare
### Summary of Pointwise Convergence, Almost Everywhere, and Measurability in the Dominated Convergence Theorem
[16]
SPRING-19 18.125
Basic integral convergence theorems (assuming sigma-finite measure space): bounded convergence theorem, Fatou's lemma, monotone convergence theorem, dominated ...<|control11|><|separator|>
[17]
[PDF] 2. Convergence theorems - KSU Math
They are among the most important results in Measure Theory. In many instances, these theorem are employed during proofs, at key steps. The next two results are ...
[18]
[PDF] 3. The Lp spaces (1 ≤ p < ∞) - KSU Math
The following technical result is very useful in the study of Lp spaces. Theorem 3.2 (L p Dominated Convergence Theorem). Let (X, Л,µ) be a mea- sure space ...
[19]
[PDF] 3.9 Integrals depending on a parameter - Uni Ulm
Feb 5, 2015 · In this short section, we use the dominated convergence theorem to prove some results in this direction. Proposition 3.85.
[20]
[PDF] Applications to Fourier series
Feb 19, 2005 · From Lusin's theorem and (again) dominated convergence, the same applies with h being a characteristic function of a measurable set. Thus f = 0, ...
[21]
[PDF] convergence of fourier series. - EPFL
Letting N → ∞ and using the dominated convergence theorem, we get c fg(n) = ∑ k. Cf(k)C g(n − k). Moreover, since. ∑ n. |c fg(n)|≤|. ∑ k. Cf(k)C g(n − k)| ...
[22]
[PDF] Chapter 4 Integration Techniques
Finally, Arzel`a's dominated convergence theorem can be applied to the last integral with fn(x) = e−tnx(tn sin(x) + cos(x))/x2, x ≥ 1, n ∈ N. (Note that ...
[23]
275A, Notes 3: The weak and strong law of large numbers
Oct 23, 2015 · We begin by using the moment method to establish both the strong and weak law of large numbers for sums of iid random variables, under ...
[24]
[PDF] Martingales convergence theorem - MIT OpenCourseWare
Oct 9, 2013 · Therefore, by the Dominated Convergence Theorem E[|Xn − X|p] → 0. Proof. (Theorem 3) We will use truncation of X∗ to prove the result.
[25]
275A, Notes 4: The central limit theorem | What's new - Terry Tao
Nov 2, 2015 · The law of large numbers ensures that the empirical averages {S_n/n} converge (both in probability and almost surely) to a deterministic limit.
[26]
[PDF] MEASURE THEORY D.H.Fremlin University of Essex, Colchester ...
Jul 24, 2017 · Levi's theorem; Fatou's lemma; Lebesgue's Dominated Convergence Theorem; differentiating through an integral. ... Liftings of non-complete measure ...
[27]
(PDF) VITALI CONVERGENCE THEOREM - ResearchGate
Jul 9, 2023 · ... Vitali convergence theorem, named after the Italian mathematician Giuseppe Vitali, is a general-. ization of the well-known dominated con ...
[28]
[PDF] Uniform Integrability in vector lattices and applications. - arXiv
Apr 14, 2023 · We demonstrate that the de La Vallée Poussin criterion for uniform integrability fails in the setting of Riesz spaces. Moreover, we establish ...
[29]
[PDF] Theory of the Integral - ClassicalRealAnalysis.info
Jun 19, 2012 · ... Vitali's convergence theorem. Math. Bohem. 129 (2004), no. 2, 141 ... Giuseppe Vitali in 1905, only shortly after the publication by ...