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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementCartesian Products and RelationsPartial OrdersBinary RelationsEquivalence RelationsInjective, Surjective, and Bijective FunctionsCardinality and CountabilitySigma-Algebras and Measurable SetsMeasurable Sets and σ-Algebra PropertiesMeasure SpacesMeasurable FunctionsSimple Functions and ApproximationLebesgue Integral for Simple FunctionsLebesgue Integral for Non-Negative FunctionsLebesgue Integral: General DefinitionLebesgue Integral (Full Construction)Fatou's LemmaDominated Convergence TheoremFatou's LemmaMonotone Convergence Theorem

Longest path: 88 steps · 433 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.