We fix the language of measure spaces and measurable functions, construct the Lebesgue integral by approximation from below, and prove the monotone convergence theorem. Fatou's lemma and the dominated convergence theorem follow as corollaries, and we close with the Holder and Minkowski inequalities and the completeness of L^p.
Integration theory rests on a single move. One defines the integral of a nonnegative function
as the supremum of the integrals of the simple functions beneath it, then proves that this
construction commutes with monotone limits. The standard interchange theorems used in
probability descend from that one theorem.
A σ-algebra on a set Ω is a collection F of subsets containing
Ω and closed under complementation and countable unions. A measure is a function
μ:F→[0,∞] with μ(∅)=0 that is countably additive, so that
for pairwise disjoint A1,A2,⋯∈F,
μ(n⋃An)=n∑μ(An).(1)
The triple (Ω,F,μ) is a measure space, and μ is a probability
measure when μ(Ω)=1.
A function f:Ω→R is measurable when f−1((a,∞))∈F for every
a∈R, equivalently when preimages of Borel sets lie in F. The same definition
applies to [0,∞]-valued functions, with f measurable when f−1((a,∞])∈F
for every a∈R; the supremum integral below and the monotone limits we build are taken in
this extended-real class. Measurable functions are closed under pointwise limits because
{supnfn>a}=⋃n{fn>a} and {infnfn<a}=⋃n{fn<a} exhibit
sup, inf, and hence limsup, liminf, lim as countable set operations. Closure
under sums follows from {f+g>a}=⋃r∈Q({f>r}∩{g>a−r}), a countable
union of measurable sets, and closure under products from fg=21((f+g)2−f2−g2) with
x↦x2 continuous. Existence of nontrivial measures rests on the extension theorem
below.
Theorem2
(Caratheodory extension.) A countably additive premeasure on an algebra of subsets of
Ω extends to a measure on the generated σ-algebra, and the extension is unique
when the premeasure is σ-finite. Lebesgue measure on R is the extension of the
interval-length premeasure defined on the algebra of finite unions of intervals
[1], [2].
A simple function is a finite combination s=∑i=1mai1Ai with ai≥0
and Ai∈F, and its integral is ∫sdμ=∑i=1maiμ(Ai), a value
independent of the representation. For measurable f≥0 define
∫fdμ=sup{∫sdμ:s simple,0≤s≤f},(2)
and for general measurable f, write f=f+−f− with f±=max(±f,0) and set ∫fdμ=∫f+dμ−∫f−dμ whenever the difference is not ∞−∞. The
function f is integrable, f∈L1(μ), when ∫∣f∣dμ<∞.
(Monotone convergence.) If fn≥0 are measurable with fn↑f pointwise, then
∫fndμ↑∫fdμ.
Proof
The sequence ∫fndμ is nondecreasing and bounded above by ∫fdμ from
Equation (2), so it converges to some L≤∫fdμ. Fix a simple s with
0≤s≤f and a constant c∈(0,1), and set En={fn≥cs}. Each En∈F, the En increase, and ⋃nEn=Ω. Where s>0 one has f≥s>cs and
fn↑f, so fn≥cs eventually, while where s=0 one has cs=0≤fn for every
n. Then
∫fndμ≥∫Enfndμ≥c∫Ensdμ,(3)
and continuity from below of the measure A↦∫Asdμ, itself a consequence of
Equation (1), gives ∫Ensdμ↑∫sdμ. Letting n grow
yields L≥c∫sdμ; letting c approach 1 and taking the supremum over s gives
L≥∫fdμ. Both inequalities hold, so L=∫fdμ.
Corollary4
(Fatou's lemma.) For measurable fn≥0, ∫liminfnfndμ≤liminfn∫fndμ.
Proof
Put gn=infk≥nfk. Then gn is measurable, 0≤gn↑liminfnfn, and
gn≤fk for every k≥n, so ∫gndμ≤infk≥n∫fkdμ. Applying
Theorem 3 to gn on the left and passing to the limit on the right delivers the
claim.
Theorem5
(Dominated convergence.) Suppose measurable fn satisfy fn→f pointwise and
∣fn∣≤g for a fixed g∈L1(μ). Then f∈L1(μ) and ∫∣fn−f∣dμ
vanishes; in particular ∫fndμ converges to ∫fdμ.
Proof
The bound ∣f∣≤g passes to the limit, so f∈L1(μ). The functions
2g−∣fn−f∣ are nonnegative, so Corollary 4 gives
Since ∫2gdμ is finite it cancels, leaving limsupn∫∣fn−f∣dμ≤0.
The integrand is nonnegative, so the limit superior is exactly 0, and ∫fndμ−∫fdμ≤∫∣fn−f∣dμ closes the argument.
For 1≤p<∞ let ∥f∥p=(∫∣f∣pdμ)1/p and let Lp(μ) collect the
measurable f with ∥f∥p<∞, identified up to equality almost everywhere.
Proposition6
(Holder and Minkowski.) For conjugate exponents 1<p,q<∞ with 1/p+1/q=1,
∫∣fg∣dμ≤∥f∥p∥g∥q, and for 1≤p<∞,
∥f+g∥p≤∥f∥p+∥g∥p.
Proof
For Holder, if ∥f∥p=∞ or ∥g∥q=∞ the bound is trivial, and if
∥f∥p=0 then f=0 almost everywhere so ∫∣fg∣=0, likewise for ∥g∥q=0.
In the remaining case 0<∥f∥p,∥g∥q<∞, Young's inequality
ab≤ap/p+bq/q follows from concavity of the logarithm. Apply it to
a=∣f∣/∥f∥p and b=∣g∣/∥g∥q and integrate, which gives
∫∣fg∣/(∥f∥p∥g∥q)≤1/p+1/q=1. For Minkowski the case p=1 is immediate
from ∣f+g∣≤∣f∣+∣g∣ integrated, so assume 1<p<∞. If ∥f∥p=∞ or
∥g∥p=∞ the bound is trivial, and if ∥f+g∥p=0 it is trivial. Otherwise
convexity of t↦tp gives ∣f+g∣p≤2p−1(∣f∣p+∣g∣p), so
∥f+g∥p<∞ is finite and nonzero. Write
∣f+g∣p≤∣f+g∣p−1(∣f∣+∣g∣), integrate, and apply Holder to each term with
exponent q=p/(p−1), using ∫(∣f+g∣p−1)q=∫∣f+g∣p<∞, to obtain
∥f+g∥pp≤∥f+g∥pp−1(∥f∥p+∥g∥p); dividing by the finite nonzero
∥f+g∥pp−1 yields the triangle inequality.
Theorem7
(Riesz-Fischer.) Each Lp(μ) is complete. Every Cauchy sequence converges in
∥⋅∥p to an element of Lp(μ)[1].
Domination in Theorem 5 cannot be dropped. On (0,1) with Lebesgue measure the
bumps fn=n1(0,1/n) converge pointwise to 0, yet each has integral 1; no
integrable function dominates the family, and the limit of the integrals is not the integral
of the limit.
import numpy as npdef escaping_mass_integral(n: int, grid: int = 1_000_000) -> float: """Midpoint estimate of the integral of n * indicator(0, 1/n) on (0, 1). Args: n: Height and inverse width of the bump. grid: Number of equal subintervals discretizing the unit interval. Returns: The approximate integral, equal to one for every n. """ midpoints = (np.arange(grid) + 0.5) / grid heights = np.where(midpoints < 1.0 / n, float(n), 0.0) return float(heights.mean())integrals = [escaping_mass_integral(n) for n in (1, 10, 100, 1_000)]pointwise_limit = 0.0
The monotone convergence theorem is the one result that survives without a dominating
function, and it is the engine from which the other two were derived.
[1]
G. B. Folland, Real Analysis: Modern Techniques and Their Applications, 2nd ed. Wiley, 1999.
[2]
P. Billingsley, Probability and Measure, 3rd ed. Wiley, 1995.