Skip to content
AI360Xpert
Beta

Convergence Theorems

The two licenses that let limits move inside integrals: climbing sequences and dominated sequences.

Monotone functions climb to their limit from below while dominated functions stay under one integrable roof
Monotone functions climb to their limit from below while dominated functions stay under one integrable roof

Why Does This Exist?

Training moves limits inside expectations everywhere: empirical averages approaching true risk, truncated losses approaching the full loss, gradients of limits versus limits of gradients. Without a license the swap is a guess, and guesses fail on spikes that run away.

Two theorems cover almost every ML case. Monotone convergence handles rising non-negative sequences. Dominated convergence handles sequences trapped under one integrable roof, no matter how they oscillate.

This page states both with the failure that each prevents. The integral itself is in Lebesgue integration, and expectation practice is in integrals in probability.

The one idea you need first

Swapping means lim⁡∫fn=∫lim⁡fn\lim \int f_n = \int \lim f_n. Pointwise convergence alone does not imply it. The moving bump with area 11 sliding to infinity converges pointwise to 00 but keeps integral 11.

Think of It Like This

Water filling a tank, with and without a lid

Monotone: water pours in and never drains. The level only rises, so the final volume is the limit of partial volumes. No surprise is possible.

Dominated: water sloshes but a fixed lid caps every wave. Since nothing escapes above the lid and the tank floor is fixed, the average settles with the surface. Where the analogy stops: the lid must itself have finite volume; an infinite lid licenses nothing.

How It Actually Works

Monotone convergence: if 0≤f1≤f2≤⋯0 \le f_1 \le f_2 \le \cdots and fn→ff_n \to f pointwise, then ∫fn→∫f\int f_n \to \int f, allowing ∞\infty. Dominated convergence: if fn→ff_n \to f pointwise and ∣fn∣≤g|f_n| \le g with ∫g<∞\int g < \infty, then ∫fn→∫f\int f_n \to \int f and ∫∣fn−f∣→0\int |f_n - f| \to 0. Fatou: ∫lim inf⁡fn≤lim inf⁡∫fn\int \liminf f_n \le \liminf \int f_n for non-negative fnf_n.

In probability: if Xn↑XX_n \uparrow X then E[Xn]↑E[X]\mathbb{E}[X_n] \uparrow \mathbb{E}[X]; if ∣Xn∣≤Y|X_n| \le Y with E[Y]<∞\mathbb{E}[Y] < \infty then E[Xn]→E[X]\mathbb{E}[X_n] \to \mathbb{E}[X].

Worked example

Monotone: fn=1−(0.5)nf_n = 1 - (0.5)^n constants rising: 0.5,0.75,0.875,0.93750.5, 0.75, 0.875, 0.9375 on [0,1][0,1]. Integrals equal the constants, limit 11, and integrals converge to 11. Dominated: fn(x)=sin⁡(nx)/nf_n(x) = \sin(nx)/n on [0,1][0,1], bounded by g=1/n≤1g = 1/n \le 1 then by 11. Values shrink: sup ∣fn∣=1/n|f_n| = 1/n giving 1,0.1,0.011, 0.1, 0.01 for n=1,10,100n = 1, 10, 100. Integrals tend to 00, the integral of the pointwise limit 00.

Watch Out For

Swapping without a dominating function

Symptom: fn=nf_n = n on (0,1/n)(0, 1/n) has area 11 but pointwise limit 00; the swap reports 00. Fix: exhibit an integrable gg above all ∣fn∣|f_n|; here none exists since sup⁡nfn\sup_n f_n is not integrable.

Applying monotone to decreasing sequences

Symptom: 1/n1/n decreasing to 00 is treated as monotone convergence from below, hiding the non-negativity direction. Fix: flip sign or use dominated with g=1g = 1; monotone needs rising from below, not falling.

The Quick Version

  • Monotone convergence licenses limits for rising non-negative sequences, even to infinity.
  • Dominated convergence licenses them under one integrable roof, covering oscillation.
  • Fatou gives the one-sided bound when no roof exists.
  • Moving bumps with constant area show why pointwise alone is never enough.
  • In ML both justify passing sample or iteration limits inside risk and expectation.