The Riesz-Fischer Theorem
In the previous chapter, \(L^p\) Spaces — Construction & Inequalities, we constructed \(L^p(\Omega, \mathcal{F}, \mu)\) as a normed vector space: we passed from raw measurable functions to equivalence classes modulo a.e. equality, defined the \(p\)-norm via the Lebesgue integral, and proved Hölder's inequality and Minkowski's inequality. This established the algebraic and metric structure of \(L^p\).
This chapter completes the picture in two stages. First, we prove the Riesz-Fischer theorem — that \(L^p\) is complete and hence a Banach space — after first developing a self-contained toolkit of convergence theorems for the Lebesgue integral (MCT, Fatou's lemma, and DCT). Second, we map the broader landscape of convergence modes for sequences of measurable functions — convergence in \(L^p\), almost everywhere, in measure, and uniformly almost everywhere — establishing their logical relationships and the canonical counterexamples (the traveling bump, the typewriter sequence) that prevent further implications. We close with applications to probability, Fourier analysis, and quantum mechanics.
We have established that \(L^p\) is a normed space. Completeness — the property that every Cauchy sequence converges within the space — is what elevates a normed space to a Banach space. In Completeness, we studied this property for general metric spaces. Now we prove it concretely for \(L^p\).
The proof relies on three fundamental convergence theorems from Lebesgue integration. We state them precisely here for reference, as they are the essential tools of the argument.
Toolkit from Lebesgue Integration
Conventions. Throughout this chapter, we work on a measure space \((\Omega, \mathcal{F}, \mu)\), and we inherit the convention from the previous chapter: \(\mathbb{F}\) denotes the scalar field \(\mathbb{R}\) or \(\mathbb{C}\), and measurable functions \(f : \Omega \to \mathbb{F}\) are \((\mathcal{F}, \mathcal{B}(\mathbb{F}))\)-measurable. A null set means an \(\mathcal{F}\)-measurable set of \(\mu\)-measure zero. No \(\sigma\)-finiteness or completeness of \(\mu\) is assumed unless stated.
The following three theorems govern the interchange of limits and integrals. They were introduced conceptually in Lebesgue Integration; we now state and prove them in the precise form needed for the completeness proof. The MCT proof uses only the supremum-of-simple-functions definition of the integral together with the continuity of measure from below; Fatou and DCT follow from MCT via the chain below.
Let \((g_n)\) be a sequence of measurable functions satisfying \(0 \leq g_1(x) \leq g_2(x) \leq \cdots\) for a.e. \(x \in \Omega\). Set \(g(x) := \sup_n g_n(x)\), which is measurable as a pointwise supremum of measurable functions and satisfies \(g(x) = \lim_{n \to \infty} g_n(x)\) for a.e. \(x\) (namely, on the set where monotonicity holds). Then \[ \int_\Omega g \, d\mu \;=\; \lim_{n \to \infty} \int_\Omega g_n \, d\mu. \] In words: for nonnegative increasing sequences, the integral of the limit equals the limit of the integrals.
Modifying each \(g_n\) on a null set does not change any integral, so we may assume the monotonicity \(0 \leq g_1 \leq g_2 \leq \cdots\) holds everywhere. Then \(g(x) = \lim_n g_n(x) = \sup_n g_n(x)\) is measurable as the pointwise supremum of measurable functions.
Easy direction (\(\leq\)): Since \(g_n \leq g\) pointwise, every simple function \(q \in S(g_n)\) also satisfies \(q \leq g\), i.e., \(S(g_n) \subseteq S(g)\). Hence \[ \int g_n \, d\mu \;=\; \sup_{q \in S(g_n)} \int q \, d\mu \;\leq\; \sup_{q \in S(g)} \int q \, d\mu \;=\; \int g \, d\mu \] for every \(n\). The sequence \(\bigl(\int g_n \, d\mu\bigr)\) is non-decreasing (same argument applied to \(g_n \leq g_{n+1}\)), so its limit exists in \([0, \infty]\) and \[ \lim_{n \to \infty} \int g_n \, d\mu \;\leq\; \int g \, d\mu. \]
Hard direction (\(\geq\)): We show \(\int q \, d\mu \leq \lim_n \int g_n \, d\mu\) for every simple \(q \in S(g)\); taking the supremum over such \(q\) then yields the desired inequality, by definition of \(\int g \, d\mu\).
Fix \(q = \sum_{i=1}^k a_i \, \chi_{A_i} \in S(g)\), with \(a_i \geq 0\) and \(\{A_i\}\) disjoint measurable. Fix \(\alpha \in (0, 1)\) and define \[ E_n \;=\; \{x \in \Omega : g_n(x) \geq \alpha \, q(x)\}. \] Each \(E_n\) is measurable: on \(\bigcup_i A_i\), \(q\) takes the constant value \(a_i\) on each \(A_i\), so \(E_n \cap A_i = \{g_n \geq \alpha a_i\} \cap A_i\); on the complement \(\Omega \setminus \bigcup_i A_i\), \(q\) vanishes and \(E_n\) contains this complement entirely (since \(g_n \geq 0\)). Hence \[ E_n \;=\; \Bigl(\bigcup_{i=1}^k \bigl(\{g_n \geq \alpha a_i\} \cap A_i\bigr)\Bigr) \cup \Bigl(\Omega \setminus \bigcup_{i=1}^k A_i\Bigr), \] a finite combination of measurable sets, hence measurable. The sequence is increasing because \(g_n\) is. We claim \(\bigcup_n E_n = \Omega\). Indeed, fix \(x \in \Omega\):
- If \(q(x) = 0\), then \(g_n(x) \geq 0 = \alpha q(x)\) for every \(n\), so \(x \in E_1 \subseteq \bigcup E_n\).
- If \(q(x) > 0\), then \(g(x) \geq q(x) > \alpha q(x)\) (strict, since \(\alpha < 1\)), and \(g_n(x) \uparrow g(x)\), so eventually \(g_n(x) \geq \alpha q(x)\), placing \(x\) in some \(E_n\).
On \(E_n\) we have \(g_n \geq \alpha q\), so \[ \int g_n \, d\mu \;\geq\; \int_{E_n} g_n \, d\mu \;\geq\; \alpha \int_{E_n} q \, d\mu \;=\; \alpha \sum_{i=1}^k a_i \, \mu(A_i \cap E_n). \] For each \(i\), the sets \(A_i \cap E_n\) increase to \(A_i\) (since \(E_n \uparrow \Omega\)), so by continuity from below, \(\mu(A_i \cap E_n) \uparrow \mu(A_i)\). The sum has finitely many terms, so we may pass to the limit term-by-term: \[ \lim_{n \to \infty} \int g_n \, d\mu \;\geq\; \alpha \sum_{i=1}^k a_i \, \mu(A_i) \;=\; \alpha \int q \, d\mu. \] This holds for every \(\alpha \in (0, 1)\); letting \(\alpha \to 1^-\) gives \(\lim_n \int g_n \, d\mu \geq \int q \, d\mu\). Taking the supremum over \(q \in S(g)\) yields \(\lim_n \int g_n \, d\mu \geq \int g \, d\mu\), completing the proof.
Let \((g_n)\) be a sequence of measurable functions satisfying \(g_n(x) \geq 0\) for a.e. \(x\). Then \(\liminf_n g_n\) is measurable (as a pointwise countable sup of countable infs of measurable functions), and \[ \int_\Omega \liminf_{n \to \infty} g_n \, d\mu \;\leq\; \liminf_{n \to \infty} \int_\Omega g_n \, d\mu. \] In words: the integral of the \(\liminf\) is bounded above by the \(\liminf\) of the integrals. The inequality can be strict — passing limits through integrals can "lose mass."
As in MCT, modifying each \(g_n\) on the null set \(N_n = \{g_n < 0\}\) does not affect any integral; on the complement of \(N = \bigcup_n N_n\) (itself null), all \(g_n\) are non-negative. Working modulo \(N\), we may assume \(g_n \geq 0\) everywhere. For each \(n\), set \(h_n(x) = \inf_{k \geq n} g_k(x)\). Then \(0 \leq h_1 \leq h_2 \leq \cdots\) (the infimum over a smaller index set is larger), \(h_n\) is measurable as the pointwise infimum of countably many measurable functions, and by definition \[ \lim_{n \to \infty} h_n(x) \;=\; \sup_n \inf_{k \geq n} g_k(x) \;=\; \liminf_{n \to \infty} g_n(x). \] Applying MCT to \((h_n)\): \[ \int \liminf_{n \to \infty} g_n \, d\mu \;=\; \lim_{n \to \infty} \int h_n \, d\mu. \] Since \(h_n \leq g_n\) pointwise (the infimum is at most each member), monotonicity of the integral gives \(\int h_n \, d\mu \leq \int g_n \, d\mu\) for every \(n\). Taking \(\liminf\) on both sides and using \(\lim \int h_n \, d\mu = \liminf \int h_n \, d\mu\) (the limit exists), \[ \int \liminf_{n \to \infty} g_n \, d\mu \;=\; \liminf_{n \to \infty} \int h_n \, d\mu \;\leq\; \liminf_{n \to \infty} \int g_n \, d\mu. \]
Let \((f_n)\) be a sequence of measurable functions such that \(f_n(x) \to f(x)\) for a.e. \(x\). Suppose there exists a dominating function \(h \in L^1(\mu)\) with \(|f_n(x)| \leq h(x)\) for a.e. \(x\) and all \(n\). Then \(f \in L^1(\mu)\) and \[ \lim_{n \to \infty} \int_\Omega f_n \, d\mu \;=\; \int_\Omega f \, d\mu. \] In words: under pointwise convergence with a uniform integrable bound, limits and integrals commute.
Modifying on a null set, assume the convergence \(f_n \to f\) and the bound \(|f_n| \leq h\) hold everywhere. Then \(f\) is measurable as the pointwise limit of measurable functions, and \(|f| \leq h\) everywhere gives \(\int |f| \, d\mu \leq \int h \, d\mu < \infty\), hence \(f \in L^1\). For brevity we treat the real-valued case; the complex case follows by splitting \(f_n = \mathrm{Re}(f_n) + i\,\mathrm{Im}(f_n)\) and applying the real result to each part, noting that \(|\mathrm{Re}(f_n)|, |\mathrm{Im}(f_n)| \leq |f_n| \leq h\) and both parts converge pointwise.
The sequences \(h + f_n\) and \(h - f_n\) are non-negative (since \(|f_n| \leq h\)) and converge pointwise to \(h + f\) and \(h - f\) respectively. Note that \(|f_n| \leq h \in L^1\) gives \(\bigl|\int f_n \, d\mu\bigr| \leq \int h \, d\mu < \infty\), so the real sequence \(\bigl(\int f_n \, d\mu\bigr)\) is bounded, and both \(\liminf\) and \(\limsup\) are finite real numbers — in particular, the identity \(\liminf(-a_n) = -\limsup(a_n)\) applies without \(\infty - \infty\) ambiguity. Apply Fatou's lemma to each: \[ \int (h + f) \, d\mu \;=\; \int \liminf_{n} (h + f_n) \, d\mu \;\leq\; \liminf_{n} \int (h + f_n) \, d\mu \;=\; \int h \, d\mu + \liminf_{n} \int f_n \, d\mu, \] \[ \int (h - f) \, d\mu \;=\; \int \liminf_{n} (h - f_n) \, d\mu \;\leq\; \liminf_{n} \int (h - f_n) \, d\mu \;=\; \int h \, d\mu - \limsup_{n} \int f_n \, d\mu, \] where the last equality uses \(\liminf(-a_n) = -\limsup(a_n)\). On each left-hand side, expand \(\int (h \pm f) \, d\mu = \int h \, d\mu \pm \int f \, d\mu\) (integral linearity, valid since \(h, f \in L^1\)) and subtract \(\int h \, d\mu\) (finite, hence cancellable): \[ \int f \, d\mu \;\leq\; \liminf_{n} \int f_n \, d\mu, \qquad -\int f \, d\mu \;\leq\; -\limsup_{n} \int f_n \, d\mu. \] The second rearranges to \(\limsup_n \int f_n \, d\mu \leq \int f \, d\mu\). Combining with the first, \[ \limsup_{n} \int f_n \, d\mu \;\leq\; \int f \, d\mu \;\leq\; \liminf_{n} \int f_n \, d\mu. \] Since \(\liminf \leq \limsup\) always, all three quantities coincide; the common value is \(\lim_n \int f_n \, d\mu\), which equals \(\int f \, d\mu\).
The MCT requires monotonicity but imposes no integrability bound — it even allows the limit to be infinite. Fatou's lemma relaxes monotonicity to mere nonnegativity, at the cost of an inequality rather than equality. The DCT trades the nonnegativity assumption for a dominating function, recovering full equality. Together, these three tools form the backbone of measure-theoretic analysis, and the chain of derivations above (MCT \(\Rightarrow\) Fatou \(\Rightarrow\) DCT) shows that once MCT is established from the integral definition and the continuity of measure, the remaining two follow.
The Theorem
For \(1 \leq p \leq \infty\), the space \(L^p(\Omega, \mathcal{F}, \mu)\) is complete. That is, \(L^p\) is a Banach space.
The proof splits into two cases of quite different character. For \(1 \leq p < \infty\), we develop the argument in five clearly delineated steps, each carrying its own role: extracting a fast subsequence, building a dominating function via MCT, obtaining a pointwise limit, upgrading to \(L^p\) convergence via DCT, and lifting from the subsequence to the full sequence. This same five-step pattern reappears in virtually every completeness proof in modern analysis (Sobolev spaces, Besov spaces, Hardy spaces), making it one of the most important proof patterns to internalize. For \(p = \infty\), the convergence theorems of Lebesgue integration are not needed: a simpler uniform-convergence argument suffices. We treat the two cases in turn.
Proof for \(1 \leq p < \infty\)
The challenge: We are given a Cauchy sequence \((f_n)\) in \(L^p\) and must produce a limit function \(f \in L^p\) with \(\|f_n - f\|_p \to 0\). The difficulty is that \(L^p\) convergence is an integral condition — it says nothing directly about pointwise behavior. We need to bridge from integral estimates to pointwise convergence and back.
Reduction to an equivalent criterion. Rather than working directly with an arbitrary Cauchy sequence, we use the following reformulation of completeness for normed spaces.
A normed space \((\mathcal{X}, \|\cdot\|)\) is complete if and only if every absolutely summable series converges — that is, \(\sum_{k=1}^{\infty} \|h_k\| < \infty\) implies that the partial sums \(\sum_{k=1}^{N} h_k\) converge in norm to some element of \(\mathcal{X}\).
(\(\Rightarrow\)) Assume \(\mathcal{X}\) is complete and \(\sum \|h_k\| < \infty\). For \(M > N\), the partial sums satisfy \(\bigl\|\sum_{k=1}^{M} h_k - \sum_{k=1}^{N} h_k\bigr\| = \bigl\|\sum_{k=N+1}^{M} h_k\bigr\| \leq \sum_{k=N+1}^{M} \|h_k\| \to 0\) as \(N, M \to \infty\), since the tail of a convergent series tends to zero. Hence the partial sums form a Cauchy sequence and converge by completeness.
(\(\Leftarrow\)) Assume every absolutely summable series converges. Let \((x_n)\) be a Cauchy sequence in \(\mathcal{X}\). Extract a fast subsequence \(x_{n_1}, x_{n_2}, \ldots\) with \(\|x_{n_{k+1}} - x_{n_k}\| < 2^{-k}\). Setting \(h_k = x_{n_{k+1}} - x_{n_k}\), we have \(\sum \|h_k\| < \sum 2^{-k} = 1 < \infty\), so by hypothesis the series \(\sum h_k\) converges. Its partial sums telescope to \(x_{n_{K+1}} - x_{n_1}\), so the subsequence \((x_{n_k})\) converges to some \(x\). To upgrade convergence of the subsequence to convergence of the full sequence, we use the standard \(\epsilon/2\) argument: given \(\epsilon > 0\), choose \(N_0\) so that \(\|x_m - x_n\| < \epsilon/2\) for \(m, n \geq N_0\), and \(K\) so that \(n_K \geq N_0\) and \(\|x_{n_K} - x\| < \epsilon/2\); then for all \(n \geq N_0\), \(\|x_n - x\| \leq \|x_n - x_{n_K}\| + \|x_{n_K} - x\| < \epsilon\). Hence \(x_n \to x\). (This same lifting argument reappears as Step 5 of the Riesz-Fischer proof below.)
This criterion is often easier to work with than the Cauchy sequence definition directly, because summability conditions mesh naturally with the MCT. The proof below is the concrete implementation of this criterion for \(L^p\): Step 1 reduces to an absolutely summable sequence of differences; Steps 2-4 establish its convergence; Step 5 lifts back to the full sequence.
Step 1 — Extract a fast subsequence.
Since \((f_n)\) is Cauchy, for each \(k \geq 1\) there exists a threshold
index \(N_k\) such that \(\|f_m - f_n\|_p < 2^{-k}\) for all \(m, n \geq N_k\);
replacing \(N_k\) by \(\max(N_1, \dots, N_k)\) if necessary, we may assume
\(N_1 \leq N_2 \leq \cdots\). Construct \((n_k)\) inductively: pick
\(n_1 \geq N_1\), and given \(n_k\), pick
\(n_{k+1} > n_k\) with \(n_{k+1} \geq N_{k+1}\) (always possible since
the Cauchy thresholds impose only a lower bound on indices). Since
\(n_k, n_{k+1} \geq N_k\) (using the monotonicity of \((N_k)\)), the
resulting subsequence \((f_{n_k})\) is strictly index-increasing and satisfies
\[
\|f_{n_{k+1}} - f_{n_k}\|_p \;<\; 2^{-k} \quad \text{for all } k \geq 1.
\]
In particular, the "differences" \(h_k = f_{n_{k+1}} - f_{n_k}\) satisfy
\(\sum_{k=1}^{\infty} \|h_k\|_p < \sum_{k=1}^{\infty} 2^{-k} = 1 < \infty\).
Step 2 — Construct a dominating function via MCT.
Define the partial sums of absolute values:
\[
G_N(x) \;=\; |f_{n_1}(x)| + \sum_{k=1}^{N} |f_{n_{k+1}}(x) - f_{n_k}(x)|.
\]
The sequence \((G_N)\) is nonnegative, pointwise increasing, and measurable
(as finite sums of measurable functions). Since \(t \mapsto t^p\) is
continuous and nondecreasing on \([0, \infty)\) for any \(p > 0\) (a
fortiori for \(p \geq 1\)), the sequence \((G_N^p)\) is also nonnegative,
pointwise increasing, and measurable.
Applying the Monotone Convergence Theorem
to \((G_N^p)\):
\[
\int_\Omega G^p \, d\mu \;=\; \lim_{N \to \infty} \int_\Omega G_N^p \, d\mu,
\]
where \(G(x) = \lim_{N \to \infty} G_N(x)\). Taking \(p\)-th roots (the
continuous map \(t \mapsto t^{1/p}\) on \([0, \infty]\) preserves
limits), \(\|G\|_p = \lim_{N \to \infty} \|G_N\|_p\). Each \(|h_k|\) lies in
\(L^p\) (since \(h_k \in L^p\) and \(\||h_k|\|_p = \|h_k\|_p\)), so applying
Minkowski's inequality
finitely many times gives
\[
\|G_N\|_p \;\leq\; \|f_{n_1}\|_p + \sum_{k=1}^{N} \|h_k\|_p
\;\leq\; \|f_{n_1}\|_p + 1.
\]
Therefore \(\|G\|_p \leq \|f_{n_1}\|_p + 1 < \infty\), which means
\(G \in L^p\). In particular, since \(\int G^p \, d\mu < \infty\) and
\(G \geq 0\), we have \(G(x) < \infty\) for a.e. \(x\).
Step 3 — Obtain a pointwise limit.
Fix any \(x\) with \(G(x) < \infty\) (which holds for a.e. \(x\), as
established in Step 2). From the definition of \(G\) and \(G_N\),
\[
\sum_{k=1}^{\infty} |f_{n_{k+1}}(x) - f_{n_k}(x)|
\;=\; G(x) - |f_{n_1}(x)| \;<\; \infty,
\]
so the series
\(\sum_{k=1}^{\infty} (f_{n_{k+1}}(x) - f_{n_k}(x))\) is
absolutely convergent in \(\mathbb{F}\), hence convergent
(since \(\mathbb{F}\) is complete).
By telescoping,
\(\sum_{k=1}^{K} h_k(x) = f_{n_{K+1}}(x) - f_{n_1}(x)\), so
\(f_{n_{K+1}}(x) = f_{n_1}(x) + \sum_{k=1}^{K} h_k(x)\) converges as
\(K \to \infty\); reindexing, the subsequence \((f_{n_K}(x))\) itself
converges. Define
\[
f(x) \;=\; \lim_{K \to \infty} f_{n_K}(x).
\]
(On the measure-zero set where \(G(x) = \infty\), we set
\(f(x) = 0\), say; since this set is null, the resulting a.e.-equivalence
class is independent of the choice.)
We show \(|f_{n_K}(x)| \leq G(x)\) for every \(K\) and every \(x\) with \(G(x) < \infty\). Indeed, by the same telescoping plus the triangle inequality, \[ |f_{n_K}(x)| \;=\; \biggl| f_{n_1}(x) + \sum_{k=1}^{K-1} h_k(x) \biggr| \;\leq\; |f_{n_1}(x)| + \sum_{k=1}^{K-1} |h_k(x)| \;\leq\; |f_{n_1}(x)| + \sum_{k=1}^{\infty} |h_k(x)| \;=\; G(x). \] Passing to the limit \(K \to \infty\) — using \(f_{n_K}(x) \to f(x)\) and continuity of \(|\cdot|\) — gives \(|f(x)| \leq G(x)\) for a.e. \(x\) (namely, on \(\{G < \infty\}\)). The function \(f\) is measurable as the a.e.-pointwise limit of measurable functions (extended by \(0\) on the null set where \(G = \infty\)), and \(G \in L^p\) together with \(|f|^p \leq G^p\) a.e. yields, by monotonicity of the integral, \(\int |f|^p \, d\mu \leq \int G^p \, d\mu < \infty\), so \(f \in L^p\).
Step 4 — Prove \(L^p\) convergence of the subsequence.
From Step 3, \(f_{n_K}(x) \to f(x)\) for a.e. \(x\); since
\(t \mapsto |t|^p\) is continuous on \(\mathbb{F}\), this gives
\(|f_{n_K} - f|^p \to 0\) a.e. Furthermore, using
\(|f_{n_K}|, |f| \leq G\) a.e. (Step 3),
\[
|f_{n_K}(x) - f(x)|^p
\;\leq\; \bigl(|f_{n_K}(x)| + |f(x)|\bigr)^p
\;\leq\; (G(x) + G(x))^p
\;=\; (2G(x))^p,
\]
and \(\int (2G)^p \, d\mu = 2^p \int G^p \, d\mu < \infty\), so
\((2G)^p \in L^1\) is an admissible dominator. By the
Dominated Convergence Theorem:
\[
\|f_{n_K} - f\|_p^p \;=\; \int |f_{n_K} - f|^p \, d\mu \;\to\; 0
\quad \text{as } K \to \infty.
\]
Since \(t \mapsto t^{1/p}\) is continuous on \([0, \infty)\) with
\(t^{1/p} = 0 \iff t = 0\), this gives \(\|f_{n_K} - f\|_p \to 0\).
Step 5 — Lift from the subsequence to the full sequence.
(This is the same lifting argument as in
Lemma: Absolute Summability Criterion
(\(\Leftarrow\)), applied concretely to \((f_n)\).)
We now know \(f_{n_K} \to f\) in \(L^p\). To show \(f_n \to f\) in \(L^p\),
we use the fact that \((f_n)\) is Cauchy. Fix \(\epsilon > 0\) and choose
\(N_0\) such that \(\|f_m - f_n\|_p < \epsilon/2\) for all \(m, n \geq N_0\).
Since \(n_K \to \infty\) and \(\|f_{n_K} - f\|_p \to 0\), we can pick a
single \(K\) satisfying both \(n_K \geq N_0\) and
\(\|f_{n_K} - f\|_p < \epsilon/2\). Then for all \(n \geq N_0\), the Cauchy
condition applies to the pair \((n, n_K)\), giving
\[
\|f_n - f\|_p \;\leq\; \|f_n - f_{n_K}\|_p + \|f_{n_K} - f\|_p
\;<\; \frac{\epsilon}{2} + \frac{\epsilon}{2} \;=\; \epsilon.
\]
Hence \(f_n \to f\) in \(L^p\), completing the proof for
\(1 \leq p < \infty\).
The Case \(p = \infty\)
For \(L^\infty\), the argument is simpler and does not require the MCT. Since \(L^\infty\) is closed under subtraction (as a vector space), each difference \(f_m - f_n\) lies in \(L^\infty\), so by Lemma: Essential Supremum Is Attained applied to \(f_m - f_n\), for each pair of indices \(m, n\), the inequality \(|f_m(x) - f_n(x)| \leq \|f_m - f_n\|_\infty\) holds for a.e. \(x\), outside an exceptional null set \(E_{m,n}\); likewise, for each \(n\), the inequality \(|f_n(x)| \leq \|f_n\|_\infty\) holds outside a null set \(F_n\). Taking the countable union \(E = \bigl(\bigcup_{m,n \in \mathbb{N}} E_{m,n}\bigr) \cup \bigl(\bigcup_n F_n\bigr)\) (still a null set, as a countable union of null sets), we have \[ |f_m(x) - f_n(x)| \;\leq\; \|f_m - f_n\|_\infty \quad \text{and} \quad |f_n(x)| \;\leq\; \|f_n\|_\infty \quad \text{for all } x \notin E \text{ and all } m, n. \] If \((f_n)\) is Cauchy in \(L^\infty\), the right side tends to zero as \(m, n \to \infty\), so \((f_n(x))\) is a Cauchy sequence in \(\mathbb{F}\) for every \(x \notin E\). Since \(\mathbb{F}\) is complete, \(f_n(x) \to f(x)\) pointwise on \(\Omega \setminus E\). Defining \(f(x) = 0\) on \(E\), the function \(f\) is measurable as the pointwise limit of measurable functions on \(\Omega \setminus E\), extended by zero on a null set.
Moreover, the convergence is uniform outside \(E\): for any \(\epsilon > 0\), choose \(N\) such that \(\|f_m - f_n\|_\infty < \epsilon\) for \(m, n \geq N\); then for \(x \notin E\) and \(m \geq N\), letting \(n \to \infty\) in \(|f_m(x) - f_n(x)| \leq \|f_m - f_n\|_\infty < \epsilon\) gives \(|f_m(x) - f(x)| \leq \epsilon\). This shows two things at once. First, \(f \in L^\infty\): by the triangle inequality, for \(x \notin E\), \[ |f(x)| \;\leq\; |f_N(x)| + |f(x) - f_N(x)| \;\leq\; \|f_N\|_\infty + \epsilon, \] where we used \(F_N \subseteq E\) for the first term (giving \(|f_N(x)| \leq \|f_N\|_\infty\) on \(\Omega \setminus E\)) and the uniform bound \(|f - f_N| \leq \epsilon\) on \(\Omega \setminus E\) (established above) for the second. This is an admissible essential bound for \(f\), giving \(\|f\|_\infty \leq \|f_N\|_\infty + \epsilon < \infty\), so \(f \in L^\infty\). Second, the bound \(|f_m - f| \leq \epsilon\) on \(\Omega \setminus E\) (a null-set complement) makes \(\epsilon\) an admissible essential bound for \(|f_m - f|\), so \(\|f_m - f\|_\infty \leq \epsilon\) for all \(m \geq N\). Since \(\epsilon\) was arbitrary, \(\|f_n - f\|_\infty \to 0\), completing the proof for \(p = \infty\).
Why the Proof Architecture Matters
The five-step pattern above — extract a fast subsequence, build a dominating function, obtain pointwise convergence, apply DCT, lift to the full sequence — is the standard template for proving completeness of function spaces throughout analysis. Spaces built over \(L^p\) — notably Sobolev spaces \(W^{k,p}\), which arise in the study of partial differential equations and physics-informed neural networks — inherit completeness by applying the Riesz-Fischer argument to each derivative component and reassembling. Recognizing this architecture once equips you to deploy it, directly or as a building block, wherever function space completeness is needed.
An Important Corollary
The Riesz-Fischer proof yields more than just completeness. Step 4 produced a subsequence \((f_{n_K})\) that converges to \(f\) both in \(L^p\) and pointwise a.e. This is worth recording as an independent result:
If \(f_n \to f\) in \(L^p\) (\(1 \leq p \leq \infty\)), then there exists a subsequence \((f_{n_k})\) such that \(f_{n_k}(x) \to f(x)\) for a.e. \(x\).
Case \(1 \leq p < \infty\): Since \((f_n)\) converges in \(L^p\), it is Cauchy. Apply Steps 1-3 of the Riesz-Fischer proof to extract a subsequence \((f_{n_k})\) and produce an a.e. pointwise limit \(\tilde f \in L^p\) with \(f_{n_k}(x) \to \tilde f(x)\) for a.e. \(x\); Step 4 further gives \(f_{n_k} \to \tilde f\) in \(L^p\). On the other hand, by hypothesis \(f_n \to f\) in \(L^p\), so the subsequence also converges in \(L^p\) to \(f\). The \(L^p\) limit is unique (if \(g_n \to g\) and \(g_n \to g'\) in \(L^p\), then \(\|g - g'\|_p \leq \|g - g_n\|_p + \|g_n - g'\|_p \to 0\), so \(\|g - g'\|_p = 0\), i.e., \(g = g'\) a.e.), so \(\tilde f = f\) a.e. Therefore \(f_{n_k}(x) \to f(x)\) for a.e. \(x\), as claimed.
Case \(p = \infty\): The argument in the Case \(p = \infty\) section above (applied to \((f_n)\), which is Cauchy because it converges) directly produces a function \(\tilde f\) with \(f_n(x) \to \tilde f(x)\) for every \(x \notin E\), where \(E\) is a null set. The same uniqueness argument as above identifies \(\tilde f = f\) a.e. Hence the full sequence — not merely a subsequence — converges a.e. to \(f\), and the corollary holds trivially.
This corollary connects \(L^p\) convergence (an integral condition) back to pointwise behavior (a condition on individual points). As we will see in the next section, the converse does not hold: pointwise a.e. convergence alone does not imply \(L^p\) convergence, and \(L^p\) convergence does not imply full pointwise a.e. convergence (only a subsequence is guaranteed).