Lp spaces §
spaces are the natural function spaces in which the Lebesgue integral lives. They consist of equivalence classes of measurable functions whose -th power is integrable, equipped with a norm that makes them complete (Banach spaces). They answer the question what is the space of integrable functions like?
Beyond pure analysis, spaces are where the big applications live: weak solutions of partial differential equations are sought in -based Sobolev spaces, Fourier analysis is naturally at home in , and the state spaces of quantum mechanics are spaces.
Authoritative sources
Definition §
Let be a measure space and . The space is the set of equivalence classes of measurable functions (or ) such that
where if -almost everywhere.
For : (the essential supremum).
Details
Why equivalence classes? Two functions that differ only on a set of measure zero have the same integral and the same norm. Working with equivalence classes makes the norm well-defined (a true norm, not just a seminorm).
The norm. For , satisfies:
- , with a.e.
- Minkowski inequality (triangle inequality):
Completeness. is a Banach space for all : every Cauchy sequence in converges to an element of .
Separability. If is -finite, then is separable for (simple functions with rational coefficients on a countable algebra generate a dense subset). In contrast, is never separable on a non-atomic space.
Uniform convexity. is uniformly convex if and only if . This geometric property underpins the norm-convergence characterization in the Convergence section and implies that is reflexive for .
Unit balls in two dimensions (the same picture governs on a two-atom measure space). For the ball is strictly convex: no flat spots, so midpoints of distinct boundary points lie strictly inside — this is uniform convexity. At and the ball has flat sides, and uniform convexity fails.
Special case : is a Hilbert space with inner product .
Hölder’s inequality §
Theorem. Let with (conjugate exponents). If and , then
Details
Proof sketch. For , apply Young’s inequality to , , then integrate.
Consequences:
- (product of and functions is integrable)
- for (on finite measure spaces, — see Nesting of spaces)
Example. , : Cauchy–Schwarz inequality .
Minkowski inequality §
Theorem. For and :
Details
For , this is the triangle inequality for integrals: .
For , the proof uses Hölder’s inequality. Write , split into and , apply Hölder with exponents and to each term, and factor.
This is what makes a true norm (rather than just a seminorm) and a normed vector space.
Concrete example. Let and on with Lebesgue measure, and take . Then:
So . The inequality is strict because and have disjoint supports (they are “orthogonal” in the sense). Equality in Minkowski holds if and only if and are non-negative scalar multiples of each other a.e.
Nesting of spaces §
Theorem (inclusions on a finite measure space). If and , then , with the norm inequality
So on a finite measure space (in particular on a probability space), the spaces shrink as grows:
The limit . On a finite measure space, the family of norms converges to a single object:
This connects the whole family to the essential supremum: as grows, only the tallest peak of the function survives.
Details
Proof of the inclusion. For , apply Hölder’s inequality with exponents and its conjugate to the functions and :
Taking the -th root gives . For the inequality is immediate from a.e.
Intuition. On a finite measure space, a spike of height on a tiny set contributes little to when is small, but dominates when is large. So requiring for a large is a strong condition: it forbids tall spikes. Requiring for a small is weaker. Hence for . The inclusion is strict in general: on belongs to (integral ) but not to ().
Example. On , take (the function of the Quiz below). Here for and : the norms blow up exactly because the spike at is unbounded, consistent with the limit theorem. For a bounded illustration, let on , so ; then increases toward as , since the values near the cap weigh ever more heavily in .
What survives on arbitrary measure spaces is the interpolation inequality: if with , then and where .
Proof sketch of the limit . Assume and . Upper bound: . Lower bound: for every the set has positive measure, so , and letting then gives . (On an infinite measure space the limit can still hold, but the upper bound needs an extra argument; the statement above is the standard finite-measure form.)
Example. On , take (the function of the Quiz below). Here for , and indeed : the norm “blows up” exactly because the spike at is unbounded, consistent with the limit theorem. For a bounded example, has for , which grows to … take instead the bounded truncated: on has and as .
Convergence in §
Theorem (biconditional for ). Let and . Then in (i.e., ) if and only if:
- in measure, and
- .
This follows from the uniform convexity of for (see the Definition section and its unit-ball picture).
Theorem (general, all ). in if and only if:
- in measure, and
- is uniformly integrable.
(These two conditions in fact force , so no separate norm-convergence condition is needed; see the details.)
Details
Why the naive “boundedness” condition fails. The statement “ in iff in measure and is bounded” is false. Counterexample: on . Then in measure (the support shrinks to a point) and for all (bounded), yet . The mass concentrates near 0 without the norm vanishing. What is needed is not mere boundedness but uniform integrability of .
The easy direction, and what convergence always implies. If , then by the Minkowski inequality , so the norms converge; and Chebyshev’s inequality gives , so in measure (hence a subsequence converges a.e.). These one-direction facts hold for all and are the “” half of both theorems above.
Why the general theorem needs no norm condition. In the general theorem, conditions (1) and (2) already force : apply the Vitali convergence theorem to the functions , which converge in measure to and are uniformly integrable by (2). Hence (in fact equality) comes for free, and listing it as a third condition would be redundant.
Relationships between modes of convergence (on finite measure spaces):
The reverse implications do not hold in general, but:
- DCT (see Lebesgue integral) gives: a.e. convergence + domination convergence (for on finite measure spaces)
- Uniform integrability + convergence in measure convergence (Vitali convergence theorem)
Example. on . Then a.e., but for all , so in . The mass “concentrates” near 0.
In : means uniform convergence a.e. (essential uniform convergence). This is strictly stronger than convergence for finite .
Duality §
Theorem (Riesz representation for ). Let be -finite and . The dual space is isometrically isomorphic to where . Every bounded linear functional on is of the form
for a unique , with .
The case . The dual is strictly larger than . By the Yosida–Hewitt theorem, is the space of bounded finitely additive measures (the ba space). The subspace of countably additive measures recovers only when is localizable.
Reflexivity. is reflexive if and only if . The spaces and are not reflexive.
Details
Why and fail reflexivity. is not reflexive because its dual has a larger dual than itself. is not reflexive because it contains an isometric copy of (on a non-atomic space), which is not reflexive.
Connection to Hölder. The duality pairing is precisely the one bounded by Hölder’s inequality. The isometric isomorphism means the operator norm of the functional equals the norm of the representing function.
Practical consequence. In optimization and PDE theory, weak convergence in (i.e., convergence against all test functions in ) is the natural compactness tool: bounded sequences in for have weakly convergent subsequences (Banach–Alaoglu + reflexivity).
Connection to probability §
On a probability space , a random variable belongs to if and only if its -th absolute moment is finite:
The norm becomes the -th root of the -th moment: . In particular, means has finite variance, and the inner product is the covariance structure used throughout probability and statistics. The nesting for (on probability spaces, which have total measure 1) means that higher moments imply lower ones.
Details
Convergence of moments. If in , then (the norm is continuous), and more generally for every . This is why convergence is the standard hypothesis behind “convergence of moments” results: it rules out the mass-concentrating pathologies (spikes on vanishing sets) that make a.e. convergence alone too weak.
The inner product gives the covariance. For centered random variables (), the inner product is exactly the covariance , and . The Cauchy–Schwarz inequality becomes , which is the source of the bound on the correlation coefficient. Orthogonality in is uncorrelatedness — the geometric foundation of least squares, the law of total variance, and the projection arguments behind conditional expectation (see Random variables and expectation).
Why analysts care. Martingale convergence, the law of large numbers in its strong form, and the basic limit theorems of statistics are all most cleanly stated as statements with a separate a.e.-convergence clause — the two modes of convergence are genuinely independent, and is the one that carries quantitative control.
Quiz §
Problem. Let on with Lebesgue measure. Determine for which the function belongs to .
Solution
Step 1: Compute .
This integral converges if and only if , i.e., .
For :
So .
Step 2: Check .
(the function is unbounded near 0).
Conclusion. if and only if . In particular, and , but and .
Interactive exploration §
The simulation below illustrates the two central phenomena of this page.
- Left panel — the norm as a function of . It plots for the function of the Quiz above. Drag the slider to see the norm grow without bound as : the exact phenomenon that makes , and a concrete instance of the nesting theorem (larger is a stronger requirement).
- Right panel — a mass-concentrating sequence. It animates from the Convergence section: a.e. and in measure, yet for every — a.e. convergence alone never forces convergence without uniform integrability.