A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Monotone Convergence Theorem

Research Depth 87 in the knowledge graph ☐ I know this ☆ Set as goal
433prerequisites beneath it
See this on the map →
Lebesgue Integral for Non-Negative FunctionsFatou's Lemma+1 more→
convergence-theorems

Core Idea

If 0 ≤ fₙ ≤ f_{n+1} pointwise for all n and fₙ → f, then ∫fₙ dμ → ∫f dμ. This is the most fundamental convergence theorem for the Lebesgue integral, allowing us to interchange limit and integral under monotonicity.

Explainer

One of the central challenges in integration theory — which you encountered when building the Lebesgue integral for non-negative functions — is determining when you can swap a limit and an integral: ∫(lim fₙ) = lim ∫fₙ. For Riemann integrals, the swap requires uniform convergence, a very stringent condition. The Monotone Convergence Theorem (MCT) shows that for the Lebesgue integral, pointwise monotone convergence is enough, making it a far more powerful tool.

The theorem says: if 0 ≤ f₁ ≤ f₂ ≤ f₃ ≤ ... pointwise and fₙ → f pointwise, then ∫fₙ dμ → ∫f dμ (with the limit possibly being +∞). The key insight is that the integrals ∫fₙ form a non-decreasing sequence of non-negative extended real numbers — they converge to a limit in [0, ∞], with no oscillation possible. The Lebesgue integral was built to handle exactly this situation: it measures "area under the curve" by approximating from below with simple functions (finite linear combinations of indicator functions), and monotone convergence means those approximations converge to the right answer without any mass being lost or gained.

A concrete example anchors the intuition. Let fₙ = χ_{[0,n]} on ℝ with Lebesgue measure — the indicator function of the interval [0, n]. The sequence is increasing (fₙ(x) ≤ f_{n+1}(x) everywhere), and fₙ → f = χ_{[0,∞)} pointwise. The integrals are ∫fₙ dλ = n → ∞ = ∫f dλ. The MCT applies, and the conclusion is that both sides are ∞ — the theorem handles infinite limits gracefully without requiring any finiteness assumption.

The MCT is not just a convergence result — it is the constructive engine for the entire Lebesgue integration theory. Any non-negative measurable function f can be approximated from below by an increasing sequence of simple functions sₙ ↑ f (this is a standard construction using dyadic approximations). Defining ∫f dμ = lim ∫sₙ dμ is consistent and well-defined precisely because the MCT guarantees the limit exists and is independent of the approximating sequence. Everything built afterward — Fatou's Lemma, the Dominated Convergence Theorem, Lp spaces — relies on this foundation. The non-negativity and monotonicity hypotheses are not just technical conveniences; they are exactly what prevents the mass-escaping behavior that makes unconstrained limits of integrals unreliable.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Cardinality and Countability → Sigma-Algebras and Measurable Sets → Measurable Sets and σ-Algebra Properties → Measure Spaces → Measurable Functions → Simple Functions and Approximation → Lebesgue Integral for Simple Functions → Lebesgue Integral for Non-Negative Functions → Lebesgue Integral: General Definition → Lebesgue Integral (Full Construction) → Fatou's Lemma → Dominated Convergence Theorem → Fatou's Lemma → Monotone Convergence Theorem

Longest path: 88 steps · 433 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.