A rigorous notion of size for sets, underlying the Lebesgue integral and modern probability.
IntuitionWhy 'length' needs a rigorous definition
The length of an interval [a,b] is obviously b−a, but what is the 'length' (or area, or volume) of a wild set like the rationals in [0,1], or a fractal? Measure theory answers this by first choosing a family of 'well-behaved' subsets — called a σ-algebra — on which a consistent notion of size, a measureμ, can be defined; famously, no measure can be defined consistently on the family of all subsets of R (as the Vitali set construction shows), so restricting to a suitable σ-algebra is unavoidable, not a technicality.
Interactive Riemann sum widget with an adjustable number of subintervals, used to motivate the limits of domain-partition integration.
Refining a Riemann sum's partition of the x-axis to n=55 subintervals: for smooth functions the sum converges nicely, but for wildly discontinuous functions (like the indicator of the rationals) no amount of refinement helps — Lebesgue's fix is to partition the y-axis (the range) into level sets instead, and measure those.
UndergraduateFormal definitions: σ-algebras, measures, and the Lebesgue integral
Definition: σ-algebra and measure space
A σ-algebra F on a set X is a family of subsets containing X itself, closed under complements, and closed under countable unions. A measureμ:F→[0,∞] assigns μ(∅)=0 and is countably additive: the measure of a countable disjoint union equals the sum of the individual measures. The triple (X,F,μ) is called a measure space; when X=Rn, F is the family of Lebesgue-measurable sets, and μ assigns [a,b] the value b−a, we call μLebesgue measure.
A function f:X→R is measurable if f−1((a,∞))∈F for every real a. The Lebesgue integral is built up in stages: first for simple functionss=∑kck1Ek (finite linear combinations of indicators of measurable sets), where ∫sdμ:=∑kckμ(Ek); then for general nonnegative measurable f, by approximating from below with simple functions.
∫fdμ=sup{∫sdμ:0≤s≤f,s simple and measurable}
Riemann integral versus Lebesgue integral
Aspect
Riemann integral
Lebesgue integral
Partition strategy
Partitions the domain (the x-axis) into subintervals
Partitions the range (the y-axis) into level sets
Class of integrable functions
Bounded functions continuous almost everywhere
Any measurable function (e.g. the Dirichlet function)
Limit-interchange theorems
Requires uniform convergence in general
Monotone and Dominated Convergence Theorems suffice
UndergraduateCore theorems: Monotone Convergence and Dominated Convergence
Let (fn) be measurable functions with 0≤f1≤f2≤⋯ pointwise almost everywhere, and let f=limn→∞fn pointwise almost everywhere. Then limn→∞∫fndμ=∫fdμ.
Why is it true?
Since the fn only grow, no 'area' is ever lost or double-counted as n increases; stacking their simple-function approximations, the total accumulated area converges exactly to the area under the limit f.
Proof
Since ∫fndμ is a nondecreasing sequence of extended reals (as fn increases), the limit L:=limn→∞∫fndμ exists in [0,∞]. Since fn≤f for every n, monotonicity of the integral gives ∫fndμ≤∫fdμ for every n, hence L≤∫fdμ.
For the reverse inequality, fix any simple measurable function s with 0≤s≤f and fix a constant c∈(0,1). Define En={x:fn(x)≥cs(x)}. Because fn increases to f≥s pointwise, the sets En increase and their union is (almost) all of X: for a.e. x with s(x)=0 this is automatic, and for a.e. x with s(x)>0, eventually fn(x)>cs(x) since fn(x)→f(x)≥s(x)>cs(x).
Writing s=∑kck1Ek, we get ∫fndμ≥∫Enfndμ≥c∫Ensdμ=c∑kckμ(Ek∩En). By countable additivity (continuity of measure from below, since En increases to X), μ(Ek∩En)→μ(Ek) as n→∞, so letting n→∞ gives L≥c∑kckμ(Ek)=c∫sdμ.
Letting c→1 gives L≥∫sdμ for every simple s≤f, and taking the supremum over all such s (the very definition of ∫fdμ) gives L≥∫fdμ. Combined with L≤∫fdμ from above, we conclude L=∫fdμ.
Let (fn) be measurable functions with fn→f pointwise almost everywhere, and suppose there is an integrable function g (i.e. ∫gdμ<∞) with ∣fn∣≤g almost everywhere for every n. Then f is integrable and limn→∞∫fndμ=∫fdμ.
Why is it true?
The dominating function g acts as a fixed 'ceiling' of finite total mass that no fn can exceed, ruling out mass silently escaping to infinity — the exact failure mode that defeats naive limit-interchange arguments when there is no monotonicity to rely on.
Proof
Since g−fn≥0 almost everywhere, Fatou's lemma applies: ∫liminfn→∞(g−fn)dμ≤liminfn→∞∫(g−fn)dμ. Because fn→f, the left side equals ∫(g−f)dμ=∫gdμ−∫fdμ (valid since ∫gdμ is finite), and the right side equals ∫gdμ−limsupn→∞∫fndμ.
Cancelling the finite quantity ∫gdμ from both sides gives −∫fdμ≤−limsupn→∞∫fndμ, i.e. limsupn→∞∫fndμ≤∫fdμ.
Next, since g+fn≥0 almost everywhere, Fatou's lemma applied to (g+fn) gives ∫(g+f)dμ≤liminfn→∞∫(g+fn)dμ, and cancelling ∫gdμ again gives ∫fdμ≤liminfn→∞∫fndμ.
Combining the two inequalities, limsupn→∞∫fndμ≤∫fdμ≤liminfn→∞∫fndμ. Since liminf≤limsup always holds, all three quantities must coincide, so limn→∞∫fndμ exists and equals ∫fdμ.
UndergraduateReal-World Applications and Worked Examples
Measure theory is the invisible foundation of modern probability: Kolmogorov's axioms (1933) define a random experiment as a measure space of total mass 1, so that expectation is literally a Lebesgue integral; in signal processing and Fourier analysis, the Lp spaces of measurable functions (built from the Lebesgue integral) are the natural setting for Parseval's identity and Fourier series convergence; in mathematical finance, stochastic integration and option pricing rely on measure-theoretic probability; and fractal geometry and image compression use generalizations of Lebesgue measure (Hausdorff measure) to assign a meaningful 'size' to sets with non-integer dimension.
Example: The Dirichlet function: Lebesgue integrable, not Riemann integrable
Let f=1Q∩[0,1] be the indicator of the rationals in [0,1] (the Dirichlet function). Show f is not Riemann integrable, but is Lebesgue integrable with ∫01fdμ=0.
Solution
For Riemann integrability: on any subinterval of any partition of [0,1], both rationals and irrationals are dense, so the supremum of f on that subinterval is 1 and the infimum is 0. Hence every upper Riemann sum equals 1 and every lower Riemann sum equals 0, regardless of how fine the partition is; since these never converge to a common value, f is not Riemann integrable.
For Lebesgue integrability: the set Q∩[0,1] is countable, so enumerate it as {q1,q2,…}. By countable subadditivity of Lebesgue measure, μ(Q∩[0,1])≤∑i=1∞μ({qi})=∑i=1∞0=0, so Q∩[0,1] has Lebesgue measure zero.
Since f equals the zero function everywhere except on this measure-zero set, and the Lebesgue integral is unaffected by modifying a function on a set of measure zero, ∫01fdμ=∫010dμ=0.
Example: Evaluating a limit of integrals with the Monotone Convergence Theorem
Let fn(x)=(1−nx)n for 0≤x≤n and fn(x)=0 for x>n. Using the Monotone Convergence Theorem, evaluate limn→∞∫0∞fndμ.
Solution
For each fixed x≥0, it is a standard calculus fact that (1−nx)n→e−x as n→∞ (take logarithms and use nln(1−x/n)→−x), and that fn(x) is nondecreasing in n for fixed x (a consequence of the concavity of ln). Thus 0≤f1≤f2≤⋯ and fn→e−x1[0,∞)(x) pointwise.
By the Monotone Convergence Theorem, limn→∞∫0∞fndμ=∫0∞e−xdx.
This is a standard improper Riemann integral (which agrees with the Lebesgue integral here, since e−x≥0): ∫0∞e−xdx=[−e−x]0∞=0−(−1)=1. So limn→∞∫0∞fndμ=1.
What is the Lebesgue integral ∫01fdμ of the Dirichlet function f=1Q∩[0,1]?
By countable additivity, what is the Lebesgue measure of (0,1)∪(2,3)?
In Kolmogorov's measure-theoretic axioms for probability, what does a random experiment correspond to?
Which theorem justifies limn→∞∫fndμ=∫fdμ when fn→f pointwise and ∣fn∣≤g for a single fixed integrable g, without requiring the fn to be monotone?