Skip to content

Normed Spaces and Banach Spaces

A normed space is a vector space XX over R\mathbb{R} or C\mathbb{C} together with a norm ∥⋅∥:X→[0,∞)\|\cdot\| : X \to [0, \infty) satisfying:

  1. ∥x∥=0  ⟺  x=0\|x\| = 0 \iff x = 0 (positive definiteness).
  2. ∥αx∥=∣α∣⋅∥x∥\|\alpha x\| = |\alpha| \cdot \|x\| for all scalars α\alpha (homogeneity).
  3. ∥x+y∥≤∥x∥+∥y∥\|x + y\| \leq \|x\| + \|y\| (triangle inequality).

A norm induces a metric d(x,y)=∥x−y∥d(x, y) = \|x - y\|, making XX a metric space.

Example 1. (C[a,b],∥⋅∥∞)(C[a, b], \|\cdot\|_\infty) with ∥f∥∞=sup⁡x∈[a,b]∣f(x)∣\|f\|_\infty = \sup_{x \in [a,b]} |f(x)|.

Example 2. (C[a,b],∥⋅∥1)(C[a, b], \|\cdot\|_1) with ∥f∥1=∫ab∣f(x)∣ dx\|f\|_1 = \int_a^b |f(x)|\, dx. This norm is weaker: convergence in ∥⋅∥1\|\cdot\|_1 does not imply pointwise convergence.

Example 3. ℓp={(xn):∑∣xn∣p<∞}\ell^p = \{(x_n) : \sum |x_n|^p < \infty\} with ∥x∥p=(∑∣xn∣p)1/p\|x\|_p = (\sum |x_n|^p)^{1/p} for 1≤p<∞1 \leq p < \infty.

Example 4. ℓ∞={(xn):sup⁡n∣xn∣<∞}\ell^\infty = \{(x_n) : \sup_n |x_n| < \infty\} with ∥x∥∞=sup⁡n∣xn∣\|x\|_\infty = \sup_n |x_n|.

A Banach space is a complete normed space (every Cauchy sequence converges).

Theorem 1.1. ℓp\ell^p is a Banach space for 1≤p≤∞1 \leq p \leq \infty.

Proof. First, ℓp\ell^p is a normed space: positive definiteness and homogeneity are immediate, and the triangle inequality is Minkowski’s inequality, proved in §1.8 below.

Let 1≤p<∞1 \leq p < \infty and let (x(k))(x^{(k)}) be a Cauchy sequence in ℓp\ell^p, where x(k)=(x1(k),x2(k),… )x^{(k)} = (x^{(k)}_1, x^{(k)}_2, \dots). For each coordinate ii,

∣xi(k)−xi(m)∣≤∥x(k)−x(m)∥p,|x^{(k)}_i - x^{(m)}_i| \leq \|x^{(k)} - x^{(m)}\|_p,

so (xi(k))k(x^{(k)}_i)_k is Cauchy in F\mathbb{F} and converges; define xi=lim⁡kxi(k)x_i = \lim_k x^{(k)}_i and x=(xi)x = (x_i).

Given ε>0\varepsilon > 0, choose KK with ∥x(k)−x(m)∥p≤ε\|x^{(k)} - x^{(m)}\|_p \leq \varepsilon for all k,m≥Kk, m \geq K. For any finite NN and k,m≥Kk, m \geq K,

∑i=1N∣xi(k)−xi(m)∣p≤εp.\sum_{i=1}^{N} |x^{(k)}_i - x^{(m)}_i|^p \leq \varepsilon^p.

The sum is finite, so we may let m→∞m \to \infty inside it: ∑i=1N∣xi(k)−xi∣p≤εp\sum_{i=1}^{N} |x^{(k)}_i - x_i|^p \leq \varepsilon^p. This holds for every NN; take the supremum over NN to get ∥x(k)−x∥p≤ε\|x^{(k)} - x\|_p \leq \varepsilon for all k≥Kk \geq K. The case p=∞p = \infty is identical with sums replaced by suprema. In particular x(k)−x∈ℓpx^{(k)} - x \in \ell^p, so x=x(k)−(x(k)−x)∈ℓpx = x^{(k)} - (x^{(k)} - x) \in \ell^p, and x(k)→xx^{(k)} \to x in norm. ■\blacksquare

Note the mechanism, which recurs throughout functional analysis: Cauchy in norm forces coordinatewise convergence; the candidate limit is then shown to lie in the space and to be the norm limit, by letting a finite partial sum absorb the limit.

Theorem 1.2. Lp(μ)L^p(\mu) is a Banach space for 1≤p≤∞1 \leq p \leq \infty.

Proof. The norm axioms again reduce to Minkowski (the integral version, proved identically to §1.8 with sums replaced by integrals; see the LpL^p page in the measure theory track). For completeness, let (fn)(f_n) be Cauchy in LpL^p, 1≤p<∞1 \leq p < \infty. Extract a subsequence with

∥gk+1−gk∥p<2−k,gk=fnk.\|g_{k+1} - g_k\|_p < 2^{-k}, \qquad g_k = f_{n_k}.

Let h=∑k=1∞∣gk+1−gk∣h = \sum_{k=1}^{\infty} |g_{k+1} - g_k|, a function in [0,∞][0, \infty]. By monotone convergence and Minkowski,

∥h∥p≤∑k=1∞∥gk+1−gk∥p<∑k=1∞2−k=1,\|h\|_p \leq \sum_{k=1}^{\infty} \|g_{k+1} - g_k\|_p < \sum_{k=1}^{\infty} 2^{-k} = 1,

so hh is finite almost everywhere. On the full-measure set {h<∞}\{h < \infty\}, the telescoping series ∑k(gk+1(x)−gk(x))\sum_k (g_{k+1}(x) - g_k(x)) converges absolutely, hence converges; define

g=g1+∑k=1∞(gk+1−gk)a.e.,g = g_1 + \sum_{k=1}^{\infty} (g_{k+1} - g_k) \quad \text{a.e.},

and set g=0g = 0 on the null set where the series diverges. Then ∣g−g1∣≤h|g - g_1| \leq h gives g∈Lpg \in L^p, and for each kk,

∣g−gk∣≤∑j≥k∣gj+1−gj∣a.e.,∥g−gk∥p≤∑j≥k2−j→0.|g - g_k| \leq \sum_{j \geq k} |g_{j+1} - g_j| \quad \text{a.e.}, \qquad \|g - g_k\|_p \leq \sum_{j \geq k} 2^{-j} \to 0.

So the subsequence converges in LpL^p to gg. Finally, a Cauchy sequence with a convergent subsequence converges: ∥fn−g∥p≤∥fn−fnk∥p+∥fnk−g∥p\|f_n - g\|_p \leq \|f_n - f_{n_k}\|_p + \|f_{n_k} - g\|_p, choosing kk with nkn_k large. The case p=∞p = \infty is simpler: Cauchy in ∥⋅∥∞\|\cdot\|_\infty is uniform Cauchy, and a uniform limit of essentially bounded measurable functions is essentially bounded. ■\blacksquare

Theorem 1.3. (C[a,b],∥⋅∥∞)(C[a, b], \|\cdot\|_\infty) is a Banach space, but (C[a,b],∥⋅∥1)(C[a, b], \|\cdot\|_1) is not.

Proof. Supremum norm. Let (fn)(f_n) be Cauchy in ∥⋅∥∞\|\cdot\|_\infty. For each fixed xx, the real sequence (fn(x))(f_n(x)) satisfies ∣fn(x)−fm(x)∣≤∥fn−fm∥∞|f_n(x) - f_m(x)| \leq \|f_n - f_m\|_\infty, so it is Cauchy; define f(x)=lim⁡nfn(x)f(x) = \lim_n f_n(x). Given ε>0\varepsilon > 0, choose NN with ∣fn(x)−fm(x)∣<ε|f_n(x) - f_m(x)| < \varepsilon for all xx and all n,m≥Nn, m \geq N; holding nn and xx fixed and letting m→∞m \to \infty gives ∣fn(x)−f(x)∣≤ε|f_n(x) - f(x)| \leq \varepsilon for all xx; the convergence is uniform. A uniform limit of continuous functions is continuous: given x0x_0 and ε\varepsilon, pick nn with ∥fn−f∥∞≤ε\|f_n - f\|_\infty \leq \varepsilon and use the continuity of fnf_n at x0x_0 in the ε/3\varepsilon/3 bound

∣f(x)−f(x0)∣≤∣f(x)−fn(x)∣+∣fn(x)−fn(x0)∣+∣fn(x0)−f(x0)∣.|f(x) - f(x_0)| \leq |f(x) - f_n(x)| + |f_n(x) - f_n(x_0)| + |f_n(x_0) - f(x_0)|.

So f∈C[a,b]f \in C[a, b] and fn→ff_n \to f in ∥⋅∥∞\|\cdot\|_\infty.

L1L^1 norm. Not complete; the explicit Cauchy sequence converging to a discontinuous limit is constructed in Practice Problem 1 below. ■\blacksquare

Theorem 1.4. All norms on a finite-dimensional vector space are equivalent.

Proof. Let XX have dimension nn with basis e1,…,ene_1, \dots, e_n, and let ∥⋅∥∙\|\cdot\|_\bullet be the auxiliary norm ∥∑iaiei∥∙=∑i∣ai∣\bigl\|\sum_i a_i e_i\bigr\|_\bullet = \sum_i |a_i|. It suffices to show every norm ∥⋅∥\|\cdot\| on XX is equivalent to ∥⋅∥∙\|\cdot\|_\bullet: equivalence of norms is transitive, and both inequalities below compose.

Upper bound. For x=∑iaieix = \sum_i a_i e_i,

∥x∥=∥∑iaiei∥≤∑i∣ai∣∥ei∥≤(max⁡i∥ei∥)∥x∥∙.\|x\| = \Bigl\| \sum_i a_i e_i \Bigr\| \leq \sum_i |a_i| \|e_i\| \leq \Bigl(\max_i \|e_i\|\Bigr) \|x\|_\bullet.

Lower bound. By the upper bound, ∣∥x∥−∥y∥∣≤∥x−y∥≤C∥x−y∥∙\bigl| \|x\| - \|y\| \bigr| \leq \|x - y\| \leq C\|x - y\|_\bullet, so a↦∥∑iaiei∥a \mapsto \bigl\|\sum_i a_i e_i\bigr\| is continuous as a function on Fn\mathbb{F}^n with the ∥⋅∥∙\|\cdot\|_\bullet metric. The set S={a:∥a∥∙=1}S = \{a : \|a\|_\bullet = 1\} is compact (closed and bounded in finite dimensions; Heine—Borel), and the function is strictly positive on SS: if ∥∑aiei∥=0\bigl\|\sum a_i e_i\bigr\| = 0 then ∑aiei=0\sum a_i e_i = 0 (positive definiteness), so all ai=0a_i = 0 (basis), contradicting ∥a∥∙=1\|a\|_\bullet = 1. A continuous function on a compact set attains its infimum, so m=min⁡S∥⋅∥>0m = \min_S \|\cdot\| > 0. For x≠0x \neq 0 the vector x/∥x∥∙x / \|x\|_\bullet lies on SS, so

∥x∥∥x∥∙≥m  ⟹  ∥x∥≥m∥x∥∙.\frac{\|x\|}{\|x\|_\bullet} \geq m \implies \|x\| \geq m \|x\|_\bullet.

■\blacksquare

Corollary 1.5. Every finite-dimensional normed space is a Banach space.

Proof. Let XX be finite-dimensional. A ∥⋅∥\|\cdot\|-Cauchy sequence is ∥⋅∥∙\|\cdot\|_\bullet-Cauchy by Theorem 1.4, i.e. each coordinate is Cauchy in F\mathbb{F}, hence convergent (R\mathbb{R} and C\mathbb{C} are complete). Convergence in ∥⋅∥∙\|\cdot\|_\bullet implies convergence in ∥⋅∥\|\cdot\|, again by Theorem 1.4. ■\blacksquare

One consequence used constantly: every finite-dimensional subspace of a normed space is closed, being complete in its own right (a complete subspace of a metric space is closed; its complement is open, since a point at distance zero from it is its limit point).

Theorem 1.6 (Riesz’s Lemma). Let XX be a normed space and YY a proper closed subspace. For every 0<θ<10 < \theta < 1, there exists x∈Xx \in X with ∥x∥=1\|x\| = 1 and d(x,Y)≥θd(x, Y) \geq \theta.

Proof. Pick any x0∈X∖Yx_0 \in X \setminus Y. Since YY is closed, X∖YX \setminus Y is open, so some ball around x0x_0 misses YY and α:=d(x0,Y)>0\alpha := d(x_0, Y) > 0. Choose y0∈Yy_0 \in Y with ∥x0−y0∥≤α/θ\|x_0 - y_0\| \leq \alpha / \theta; possible since θ<1\theta < 1 makes α/θ>α\alpha/\theta > \alpha. Set

x=x0−y0∥x0−y0∥,so ∥x∥=1.x = \frac{x_0 - y_0}{\|x_0 - y_0\|}, \qquad \text{so } \|x\| = 1.

For any y∈Yy \in Y,

∥x−y∥=1∥x0−y0∥∥(x0−y0)−∥x0−y0∥ y∥=1∥x0−y0∥∥x0−(y0+∥x0−y0∥ y)∥,\|x - y\| = \frac{1}{\|x_0 - y_0\|} \Bigl\| (x_0 - y_0) - \|x_0 - y_0\|\, y \Bigr\| = \frac{1}{\|x_0 - y_0\|} \Bigl\| x_0 - \bigl(y_0 + \|x_0 - y_0\|\, y\bigr) \Bigr\|,

and y0+∥x0−y0∥y∈Yy_0 + \|x_0 - y_0\| y \in Y (a subspace absorbs scaling and addition), so the last quantity is at least α/∥x0−y0∥≥θ\alpha / \|x_0 - y_0\| \geq \theta. ■\blacksquare

Corollary 1.7. The closed unit ball of a normed space is compact if and only if the space is finite-dimensional.

Proof. (⇐\Leftarrow) If XX is finite-dimensional, fix a linear isomorphism with Fn\mathbb{F}^n. By Theorem 1.4 the closed unit ball is closed in, and contained in a multiple of, the Euclidean unit ball under this identification; closed and bounded in Fn\mathbb{F}^n; hence compact by Heine—Borel.

(⇒\Rightarrow) Contrapositive. Suppose XX is infinite-dimensional and build a sequence in the unit ball with no Cauchy subsequence. Pick x1x_1 with ∥x1∥=1\|x_1\| = 1. Inductively, having chosen x1,…,xnx_1, \dots, x_n, let Yn=span⁡{x1,…,xn}Y_n = \operatorname{span}\{x_1, \dots, x_n\}; a finite-dimensional subspace, hence closed (Corollary 1.5), and proper (as XX is infinite-dimensional). Riesz’s lemma with θ=1/2\theta = 1/2 produces xn+1x_{n+1} with ∥xn+1∥=1\|x_{n+1}\| = 1 and d(xn+1,Yn)≥1/2d(x_{n+1}, Y_n) \geq 1/2.

For i<ji < j the point xix_i lies in Yj−1Y_{j-1}, so ∥xj−xi∥≥d(xj,Yj−1)≥1/2\|x_j - x_i\| \geq d(x_j, Y_{j-1}) \geq 1/2. No subsequence is Cauchy, so the closed unit ball is not (sequentially) compact; and in a metric space compactness and sequential compactness coincide. ■\blacksquare

This corollary is the first taste of what makes infinite dimensions genuinely different: in finite dimensions, closed and bounded is compact; in infinite dimensions it never is.

Let XX be a normed space and Y⊆XY \subseteq X a closed subspace. The quotient space X/YX / Y consists of equivalence classes [x]=x+Y[x] = x + Y with the quotient norm:

∥[x]∥X/Y=inf⁡y∈Y∥x−y∥\|[x]\|_{X/Y} = \inf_{y \in Y} \|x - y\|

Theorem 1.8. If XX is a Banach space and YY is a closed subspace, then X/YX/Y is a Banach space.

Proof. The quotient norm is a norm. Homogeneity and positivity of the infimum are clear, and the triangle inequality follows since for any y,y′∈Yy, y' \in Y,

∥[x+x′]∥≤∥x+x′−y−y′∥≤∥x−y∥+∥x′−y′∥,\|[x + x']\| \leq \|x + x' - y - y'\| \leq \|x - y\| + \|x' - y'\|,

so taking infima over yy and y′y' separately gives ∥[x+x′]∥≤∥[x]∥+∥[x′]∥\|[x+x']\| \leq \|[x]\| + \|[x']\|. Finally, ∥[x]∥=0\|[x]\| = 0 means xx is a limit of points of YY, i.e. x∈Y‾=Yx \in \overline{Y} = Y (closedness is exactly what is used here), so [x]=0[x] = 0.

Completeness. Let ([xn])([x_n]) be Cauchy in X/YX/Y. Extract a subsequence with ∥[xnk+1]−[xnk]∥<2−k\|[x_{n_{k+1}}] - [x_{n_k}]\| < 2^{-k}. Since ∥[xnk+1]−[xnk]∥=d(xnk+1−xnk, Y)\|[x_{n_{k+1}}] - [x_{n_k}]\| = d(x_{n_{k+1}} - x_{n_k},\, Y), choose yk+1∈Yy_{k+1} \in Y with

∥xnk+1−xnk−yk+1∥<2−k.\|x_{n_{k+1}} - x_{n_k} - y_{k+1}\| < 2^{-k}.

Now define z1=xn1z_1 = x_{n_1} and inductively zk+1=zk+(xnk+1−xnk−yk+1)z_{k+1} = z_k + (x_{n_{k+1}} - x_{n_k} - y_{k+1}). The increments are absolutely summable, so (zk)(z_k) converges in the Banach space XX; write the limit as zz. Passing to quotients, the recursion telescopes:

[zk+1]=[zk]+[xnk+1−xnk−yk+1]=[zk]+[xnk+1]−[xnk]  ⟹  [zk]=[xnk],[z_{k+1}] = [z_k] + [x_{n_{k+1}} - x_{n_k} - y_{k+1}] = [z_k] + [x_{n_{k+1}}] - [x_{n_k}] \implies [z_k] = [x_{n_k}],

the last step by induction from [z1]=[xn1][z_1] = [x_{n_1}]. Hence

∥[xnk]−[z]∥=∥[zk]−[z]∥≤∥zk−z∥→0,\|[x_{n_k}] - [z]\| = \|[z_k] - [z]\| \leq \|z_k - z\| \to 0,

so the subsequence converges, and a Cauchy sequence with a convergent subsequence converges, as in Theorem 1.2. ■\blacksquare

Proposition 1.9. The quotient map π:X→X/Y\pi : X \to X/Y, π(x)=[x]\pi(x) = [x], is a bounded linear operator with ∥π∥=1\|\pi\| = 1 (for YY a proper closed subspace).

Proof. Linearity is inherited from the vector space quotient. Since 0∈Y0 \in Y, ∥[x]∥=d(x,Y)≤∥x∥\|[x]\| = d(x, Y) \leq \|x\|, so ∥π∥≤1\|\pi\| \leq 1. Conversely, Riesz’s lemma provides, for every θ<1\theta < 1, a unit vector xx with ∥x∥=1\|x\| = 1 and ∥[x]∥=d(x,Y)≥θ\|[x]\| = d(x, Y) \geq \theta; so ∥π∥≥θ\|\pi\| \geq \theta for all θ<1\theta < 1, whence ∥π∥≥1\|\pi\| \geq 1. Combining: ∥π∥=1\|\pi\| = 1.

Note the sup is generally not attained: Riesz’s lemma gives d(x,Y)≥θd(x, Y) \geq \theta for each θ<1\theta < 1 but not necessarily =1= 1. In finite dimensions the unit sphere is compact and the sup is attained; in infinite dimensions it can genuinely fail to be. ■\blacksquare

The dual space X∗X^* of a normed space XX is the space of all bounded linear functionals f:X→Ff : X \to \mathbb{F}, equipped with the operator norm:

∥f∥=sup⁡∥x∥≤1∣f(x)∣\|f\| = \sup_{\|x\| \leq 1} |f(x)|

Theorem 1.10. The dual space X∗X^* is always a Banach space, regardless of whether XX is complete.

Proof. Linearity of the candidate limit. Let (fn)(f_n) be Cauchy in the operator norm. For each fixed xx, ∣fn(x)−fm(x)∣≤∥fn−fm∥∥x∥|f_n(x) - f_m(x)| \leq \|f_n - f_m\| \|x\|, so (fn(x))(f_n(x)) is Cauchy in F\mathbb{F}; define f(x)=lim⁡nfn(x)f(x) = \lim_n f_n(x). Taking limits in the linearity identity fn(αx+βy)=αfn(x)+βfn(y)f_n(\alpha x + \beta y) = \alpha f_n(x) + \beta f_n(y) gives linearity of ff.

Boundedness. Cauchy sequences are bounded in norm: ∥fn∥≤C\|f_n\| \leq C for all nn. So ∣fn(x)∣≤C∥x∥|f_n(x)| \leq C\|x\| for every nn and xx; let n→∞n \to \infty: ∣f(x)∣≤C∥x∥|f(x)| \leq C\|x\|, so ∥f∥≤C\|f\| \leq C.

Convergence in norm. Given ε>0\varepsilon > 0, choose NN with ∥fn−fm∥≤ε\|f_n - f_m\| \leq \varepsilon for n,m≥Nn, m \geq N. Fix n≥Nn \geq N and xx with ∥x∥≤1\|x\| \leq 1. Then for every m≥Nm \geq N,

∣f(x)−fn(x)∣≤∣f(x)−fm(x)∣+∣fm(x)−fn(x)∣≤∣f(x)−fm(x)∣+ε.|f(x) - f_n(x)| \leq |f(x) - f_m(x)| + |f_m(x) - f_n(x)| \leq |f(x) - f_m(x)| + \varepsilon.

Let m→∞m \to \infty: the first term tends to 00, giving ∣f(x)−fn(x)∣≤ε|f(x) - f_n(x)| \leq \varepsilon for all ∥x∥≤1\|x\| \leq 1. Taking the supremum over such xx: ∥f−fn∥≤ε\|f - f_n\| \leq \varepsilon. ■\blacksquare

Note where completeness of XX would have been used; nowhere. The dual is complete because the scalar field is, and the operator norm controls convergence uniformly on the unit ball.

Examples of dual spaces:

  • (ℓp)∗≅ℓq(\ell^p)^* \cong \ell^q where 1/p+1/q=11/p + 1/q = 1 for 1≤p<∞1 \leq p < \infty.
  • (c0)∗≅ℓ1(c_0)^* \cong \ell^1, where c0c_0 is the space of sequences converging to 00.
  • (Lp(μ))∗≅Lq(μ)(L^p(\mu))^* \cong L^q(\mu) for 1≤p<∞1 \leq p < \infty and 1/p+1/q=11/p + 1/q = 1.

Theorem 1.11. Every normed space XX has a completion: a Banach space X~\tilde{X} and an isometric embedding i:X→X~i : X \to \tilde{X} with dense image. The completion is unique up to isometric isomorphism.

Proof. Construction. Let C\mathcal{C} be the set of Cauchy sequences in XX, with (xn)∼(yn)(x_n) \sim (y_n) iff ∥xn−yn∥→0\|x_n - y_n\| \to 0 (an equivalence relation; check transitivity via the ε/2\varepsilon/2 argument). Set X~=C/∼\tilde{X} = \mathcal{C}/{\sim} and define

∥[(xn)]∥=lim⁡n→∞∥xn∥.\|[(x_n)]\| = \lim_{n \to \infty} \|x_n\|.

The limit exists because ∣ ∥xn∥−∥xm∥ ∣≤∥xn−xm∥|\,\|x_n\| - \|x_m\|\,| \leq \|x_n - x_m\| (reverse triangle inequality) makes (∥xn∥)(\|x_n\|) Cauchy in F\mathbb{F}. It is well defined: replacing (xn)(x_n) by an equivalent sequence changes each ∥xn∥\|x_n\| by at most ∥xn−yn∥→0\|x_n - y_n\| \to 0. The norm axioms pass to the limit from each coordinate.

The embedding. i(x)=[(x,x,x,… )]i(x) = [(x, x, x, \dots)] is linear, and ∥i(x)∥=lim⁡n∥x∥=∥x∥\|i(x)\| = \lim_n \|x\| = \|x\|: isometric. Its image is dense: given ξ=[(xn)]∈X~\xi = [(x_n)] \in \tilde{X} and ε>0\varepsilon > 0, pick NN with ∥xn−xm∥<ε\|x_n - x_m\| < \varepsilon for n,m≥Nn, m \geq N; then

∥ξ−i(xN)∥=lim⁡n→∞∥xn−xN∥≤ε.\|\xi - i(x_N)\| = \lim_{n \to \infty} \|x_n - x_N\| \leq \varepsilon.

Completeness. Let (ξk)(\xi_k) be Cauchy in X~\tilde{X}. Choose representatives x(k)∈Xx^{(k)} \in X with ∥ξk−i(x(k))∥<1/k\|\xi_k - i(x^{(k)})\| < 1/k (density). Then for k,lk, l large,

∥x(k)−x(l)∥≤∥x(k)−ξk∥via i+∥ξk−ξl∥+∥ξl−x(l)∥→0,\|x^{(k)} - x^{(l)}\| \leq \|x^{(k)} - \xi_k\|_{\text{via } i} + \|\xi_k - \xi_l\| + \|\xi_l - x^{(l)}\| \to 0,

so (x(k))(x^{(k)}) is Cauchy in XX; let ξ=[(x(k))]∈X~\xi = [(x^{(k)})] \in \tilde{X}. A three-term estimate with the same ingredients gives ∥ξk−ξ∥→0\|\xi_k - \xi\| \to 0. So X~\tilde{X} is complete.

Uniqueness. Given two completions i:X→X~i : X \to \tilde{X} and j:X→Xˉj : X \to \bar{X}, define Φ\Phi on the dense subspace i(X)i(X) by Φ(i(x))=j(x)\Phi(i(x)) = j(x). On i(X)i(X), Φ\Phi is isometric:

∥Φ(i(x))−Φ(i(x′))∥=∥j(x)−j(x′)∥=∥x−x′∥=∥i(x)−i(x′)∥.\|\Phi(i(x)) - \Phi(i(x'))\| = \|j(x) - j(x')\| = \|x - x'\| = \|i(x) - i(x')\|.

An isometry on a dense subspace of a metric space extends uniquely to an isometry on the whole space (the extension sends z↦lim⁡Φ(zn)z \mapsto \lim \Phi(z_n) along any sequence in the subspace converging to zz; well defined by isometry and Cauchy). The extension Φ:X~→Xˉ\Phi : \tilde{X} \to \bar{X} is surjective: its image is complete; being isometric to a complete space; hence closed in Xˉ\bar{X}, and it contains the dense set j(X)j(X). ■\blacksquare

Example. The completion of (C[a,b],∥⋅∥1)(C[a, b], \|\cdot\|_1) is L1[a,b]L^1[a, b].

Infinite-dimensional normed spaces have properties that contrast sharply with finite-dimensional ones:

  • The closed unit ball is not compact (Riesz’s lemma).
  • There exist discontinuous linear operators (requires the axiom of choice).
  • Not every linear subspace is closed.
  • The weak topology differs from the norm topology.

Lemma 1.12.0 (Young’s inequality). For 1<p<∞1 < p < \infty and 1/p+1/q=11/p + 1/q = 1, all a,b≥0a, b \geq 0:

ab≤app+bqq.ab \leq \frac{a^p}{p} + \frac{b^q}{q}.

Proof. If a=0a = 0 or b=0b = 0 both sides vanish. Otherwise fix bb and minimise φ(a)=ap/p+bq/q−ab\varphi(a) = a^p/p + b^q/q - ab over a≥0a \geq 0. Then φ′(a)=ap−1−b\varphi'(a) = a^{p-1} - b, which vanishes at a=b1/(p−1)=bq/pa = b^{1/(p-1)} = b^{q/p}, and φ′′(a)=(p−1)ap−2>0\varphi''(a) = (p-1)a^{p-2} > 0, so this is the global minimum (with φ(0)=bq/q>0\varphi(0) = b^q/q > 0 confirming the boundary is worse). The value there:

φ(bq/p)=bqp/pp+bqq−bq/pb=bq(1p+1q)−bq/p+1=bq−bq/p+1.\varphi(b^{q/p}) = \frac{b^{qp/p}}{p} + \frac{b^q}{q} - b^{q/p} b = b^q \Bigl( \frac{1}{p} + \frac{1}{q} \Bigr) - b^{q/p + 1} = b^q - b^{q/p + 1}.

Since q/p+1=q(1/p+1/q)=qq/p + 1 = q(1/p + 1/q) = q, the minimum is bq−bq=0b^q - b^q = 0. So φ(a)≥0\varphi(a) \geq 0 everywhere. ■\blacksquare

Theorem 1.12 (Hölder’s Inequality). For 1≤p,q≤∞1 \leq p, q \leq \infty with 1/p+1/q=11/p + 1/q = 1:

∑n=1∞∣xnyn∣≤∥x∥p∥y∥q.\sum_{n=1}^\infty |x_n y_n| \leq \|x\|_p \|y\|_q.

Proof. Case 1<p<∞1 < p < \infty. If ∥x∥p=0\|x\|_p = 0 or ∥y∥q=0\|y\|_q = 0 the inequality is trivial. Otherwise normalise: x^=x/∥x∥p\hat{x} = x / \|x\|_p and y^=y/∥y∥q\hat{y} = y / \|y\|_q satisfy ∥x^∥p=∥y^∥q=1\|\hat{x}\|_p = \|\hat{y}\|_q = 1, and both sides scale by the same factor ∥x∥p∥y∥q\|x\|_p \|y\|_q, so it suffices to prove ∑∣x^ny^n∣≤1\sum |\hat{x}_n \hat{y}_n| \leq 1.

For every NN and every n≤Nn \leq N, Young’s inequality with a=∣x^n∣a = |\hat{x}_n|, b=∣y^n∣b = |\hat{y}_n| gives ∣x^ny^n∣≤∣x^n∣p/p+∣y^n∣q/q|\hat{x}_n \hat{y}_n| \leq |\hat{x}_n|^p / p + |\hat{y}_n|^q / q. Summing over n≤Nn \leq N:

∑n=1N∣x^ny^n∣≤1p∑n=1N∣x^n∣p+1q∑n=1N∣y^n∣q≤1p+1q=1.\sum_{n=1}^{N} |\hat{x}_n \hat{y}_n| \leq \frac{1}{p} \sum_{n=1}^{N} |\hat{x}_n|^p + \frac{1}{q} \sum_{n=1}^{N} |\hat{y}_n|^q \leq \frac{1}{p} + \frac{1}{q} = 1.

The partial sums are increasing and bounded, so the full series converges with sum ≤1\leq 1.

Case p=1p = 1, q=∞q = \infty: ∣xnyn∣≤∣xn∣∥y∥∞|x_n y_n| \leq |x_n| \|y\|_\infty termwise, then sum. Case p=∞p = \infty symmetrically. ■\blacksquare

Theorem 1.13 (Minkowski’s Inequality). For 1≤p≤∞1 \leq p \leq \infty:

∥x+y∥p≤∥x∥p+∥y∥p.\|x + y\|_p \leq \|x\|_p + \|y\|_p.

Proof. p=1p = 1 is the ordinary triangle inequality in F\mathbb{F}, summed; p=∞p = \infty is the supremum version. Let 1<p<∞1 < p < \infty and qq its conjugate. The case x+y=0x + y = 0 is trivial; otherwise expand:

∥x+y∥pp=∑n∣xn+yn∣p≤∑n∣xn∣∣xn+yn∣p−1+∑n∣yn∣∣xn+yn∣p−1.\|x + y\|_p^p = \sum_n |x_n + y_n|^p \leq \sum_n |x_n| |x_n + y_n|^{p-1} + \sum_n |y_n| |x_n + y_n|^{p-1}.

Apply Hölder to each sum. Since (p−1)q=p(p-1)q = p, the Hölder factor for the second argument is

(∑n∣xn+yn∣(p−1)q)1/q=(∑n∣xn+yn∣p)1/q=∥x+y∥pp/q,\Bigl( \sum_n |x_n + y_n|^{(p-1)q} \Bigr)^{1/q} = \Bigl( \sum_n |x_n + y_n|^{p} \Bigr)^{1/q} = \|x + y\|_p^{p/q},

so

∥x+y∥pp≤(∥x∥p+∥y∥p)∥x+y∥pp/q.\|x + y\|_p^p \leq \bigl( \|x\|_p + \|y\|_p \bigr) \|x + y\|_p^{p/q}.

If ∥x+y∥p>0\|x + y\|_p > 0, divide both sides by ∥x+y∥pp/q\|x + y\|_p^{p/q}; the exponent satisfies p−p/q=p(1−1/q)=1p - p/q = p(1 - 1/q) = 1, leaving ∥x+y∥p≤∥x∥p+∥y∥p\|x + y\|_p \leq \|x\|_p + \|y\|_p. ■\blacksquare

These inequalities prove that ℓp\ell^p and LpL^p are normed spaces. The integral versions follow by the identical arguments with sums replaced by integrals; see the LpL^p page in the measure theory track, where the completeness of LpL^p is also treated.

Problem 1. Show that C[a,b]C[a, b] with ∥f∥1=∫ab∣f(x)∣ dx\|f\|_1 = \int_a^b |f(x)|\, dx is not complete.

Solution. Consider fn(x)={0a≤x≤(a+b)/2−1/nlinearin the transition1(a+b)/2+1/n≤x≤bf_n(x) = \begin{cases} 0 & a \leq x \leq (a+b)/2 - 1/n \\ \text{linear} & \text{in the transition} \\ 1 & (a+b)/2 + 1/n \leq x \leq b \end{cases}. This is a Cauchy sequence in ∥⋅∥1\|\cdot\|_1 but converges to the discontinuous step function. ■\blacksquare

Problem 2. Prove that ℓp⊂ℓq\ell^p \subset \ell^q for 1≤p<q≤∞1 \leq p < q \leq \infty.

Problem 3. Show that ∥x∥∞=lim⁡p→∞∥x∥p\|x\|_\infty = \lim_{p \to \infty} \|x\|_p for x∈ℓp∩ℓ∞x \in \ell^p \cap \ell^\infty.

Problem 4. Prove that the dual of c0c_0 is ℓ1\ell^1.

A normed space XX carries the weak topology σ(X,X∗)\sigma(X, X^*), the coarsest topology making all f∈X∗f \in X^* continuous. A sequence converges weakly (xn⇀xx_n \rightharpoonup x) if f(xn)→f(x)f(x_n) \to f(x) for every f∈X∗f \in X^*.

The dual space X∗X^* carries the weak-* topology σ(X∗,X)\sigma(X^*, X), the coarsest topology making all evaluation maps x↦f(x)x \mapsto f(x) continuous.

Theorem 1.14 (Banach-Alaoglu). The closed unit ball of X∗X^* is compact in the weak-* topology.

Proof. Let B={f∈X∗:∥f∥≤1}B = \{f \in X^* : \|f\| \leq 1\}. For each x∈Xx \in X let Dx={z∈F:∣z∣≤∥x∥}D_x = \{z \in \mathbb{F} : |z| \leq \|x\|\}, a closed disc; compact by Heine—Borel in F≅R\mathbb{F} \cong \mathbb{R} or R2\mathbb{R}^2. Consider the product P=∏x∈XDxP = \prod_{x \in X} D_x and the map

Φ:B→P,Φ(f)=(f(x))x∈X.\Phi : B \to P, \qquad \Phi(f) = \bigl( f(x) \bigr)_{x \in X}.

The weak-* topology on BB is exactly the subspace topology inherited from PP: both are initial topologies for the same family of coordinate maps f↦f(x)f \mapsto f(x). So BB is compact iff Φ(B)\Phi(B) is compact as a subspace of PP.

PP is compact by Tychonoff’s theorem (Theorem 8.4 in the topology track). And Φ(B)\Phi(B) is closed in PP: a point (zx)∈P(z_x) \in P lies in Φ(B)\Phi(B) iff

zx+y=zx+zy for all x,y,zαx=αzx for all α,x,z_{x + y} = z_x + z_y \ \text{for all } x, y, \qquad z_{\alpha x} = \alpha z_x \ \text{for all } \alpha, x,

and each of these conditions is closed; the map (z∙)↦zx+y−zx−zy(z_\bullet) \mapsto z_{x+y} - z_x - z_y is a finite combination of coordinate projections, hence continuous, and the condition is the preimage of {0}\{0\}. (Positivity of the norm needs no separate condition: ∣zx∣≤∥x∥|z_x| \leq \|x\| is built into DxD_x, and it reproduces ∥f∥≤1\|f\| \leq 1 by taking suprema.) A closed subset of a compact space is compact, so Φ(B)\Phi(B); hence BB; is compact. ■\blacksquare

A normed space is separable if it contains a countable dense subset.

Examples: ℓp\ell^p is separable for 1≤p<∞1 \leq p < \infty. ℓ∞\ell^\infty is not separable. C[a,b]C[a, b] is separable (polynomials with rational coefficients are dense).

Theorem 1.15. If X∗X^* is separable, then XX is separable. The converse does not hold: ℓ1\ell^1 is separable but (ℓ1)∗≅ℓ∞(\ell^1)^* \cong \ell^\infty is not.

Proof. Let {fn}\{f_n\} be a countable dense subset of the unit sphere {f∈X∗:∥f∥=1}\{f \in X^* : \|f\| = 1\}; separability of X∗X^* gives a countable dense set in all of X∗X^*, and intersecting with spheres (or normalising) yields one in the sphere. For each nn pick xnx_n with ∥xn∥=1\|x_n\| = 1 and ∣fn(xn)∣≥1/2|f_n(x_n)| \geq 1/2 (the unit norm is a supremum, so values arbitrarily close to 11 are attained).

Claim: the rational span DD of {xn}\{x_n\} is dense in XX. DD is countable. Suppose not dense; then some y∈Xy \in X and δ>0\delta > 0 have d(y,span⁡{xn})≥δd(y, \operatorname{span}\{x_n\}) \geq \delta. The distance functional extends: by Hahn—Banach (Theorem 1.3 of the fundamental-theorems page) there is f∈X∗f \in X^* with ∥f∥=1\|f\| = 1, f∣span⁡{xn}=0f|_{\operatorname{span}\{x_n\}} = 0, and f(y)=δf(y) = \delta.

Density of {fn}\{f_n\} in the sphere gives a subsequence fnk→ff_{n_k} \to f in operator norm. But for every kk,

12≤∣fnk(xnk)∣=∣fnk(xnk)−f(xnk)∣≤∥fnk−f∥,\frac{1}{2} \leq |f_{n_k}(x_{n_k})| = |f_{n_k}(x_{n_k}) - f(x_{n_k})| \leq \|f_{n_k} - f\|,

since f(xnk)=0f(x_{n_k}) = 0. The right side tends to 00; contradiction. So DD is dense and XX is separable. ■\blacksquare

A Banach space XX is reflexive if the natural embedding J:X→X∗∗J : X \to X^{**} defined by J(x)(f)=f(x)J(x)(f) = f(x) is surjective.

Examples: ℓp\ell^p is reflexive for 1<p<∞1 < p < \infty. ℓ1\ell^1 and ℓ∞\ell^\infty are not reflexive. Every finite-dimensional space is reflexive.

Theorem 1.16. A Banach space is reflexive if and only if its closed unit ball is weakly compact.

Proof. (⇐\Leftarrow) Suppose BXB_X is weakly compact. The canonical embedding J:X→X∗∗J : X \to X^{**} is weak-to-weak-* continuous: for each f∈X∗f \in X^*, the composition J(⋅)(f)=f(⋅)J(\cdot)(f) = f(\cdot) is weakly continuous by definition of σ(X,X∗)\sigma(X, X^*). Moreover the weak-* topology of X∗∗X^{**} restricted to J(X)J(X) is the weak topology of XX transported by JJ; both are initial topologies for the same set of functionals, {f:f∈X∗}\{f : f \in X^*\}.

By Goldstine’s theorem (a consequence of Hahn—Banach; see the fundamental-theorems page), J(BX)J(B_X) is weak-* dense in BX∗∗B_{X^{**}}. As a weakly compact set, J(BX)J(B_X) is compact in the subspace topology; which is the weak-* topology just identified; and a compact subset of a Hausdorff space is closed in the ambient space. So J(BX)J(B_X) is weak-* closed, and closed and dense in BX∗∗B_{X^{**}} forces J(BX)=BX∗∗J(B_X) = B_{X^{**}}. Scaling: every x∗∗∈X∗∗x^{**} \in X^{**} with x∗∗≠0x^{**} \neq 0 is a multiple of a point of BX∗∗=J(BX)B_{X^{**}} = J(B_X), so JJ is surjective.

(⇒\Rightarrow) Suppose JJ is surjective. Since JJ is an isometry (∥J(x)∥=sup⁡∥f∥≤1∣f(x)∣=∥x∥\|J(x)\| = \sup_{\|f\| \leq 1} |f(x)| = \|x\| by the Hahn—Banach corollary on norming functionals), J(BX)=BX∗∗J(B_X) = B_{X^{**}}. Banach—Alaoglu (Theorem 1.14) makes BX∗∗B_{X^{**}} compact in σ(X∗∗,X∗)\sigma(X^{**}, X^*). And JJ is a homeomorphism between (X,σ(X,X∗))(X, \sigma(X, X^*)) and its image with the weak-* subspace topology; continuous, injective, and open onto the image, because the coordinate functionals agree. Compactness is a property of the topology on a set, not of the ambient space, so BXB_X is weakly compact. ■\blacksquare

Problem 5. Show that c0c_0 (sequences converging to 0 with sup norm) is not reflexive.

Problem 6. Prove that ℓp\ell^p for 1<p<∞1 < p < \infty is reflexive using the fact that (ℓp)∗∗≅ℓp(\ell^p)^{**} \cong \ell^p via the natural embedding.

Functional analysis extends linear algebra to infinite dimensions. A normed space is a vector space where you can measure the “size” of vectors, and a Banach space is one where Cauchy sequences converge, the space has no “holes.” Think of it as doing linear algebra with functions instead of finite arrays. The dual space contains all continuous linear functionals: machines that take in a vector and return a number. Boundedness and continuity coincide for linear maps, a fact that fails in nonlinear settings. The key challenge of infinite dimensions is that bounded sequences need not have convergent subsequences, compactness becomes a rare and precious property, requiring special conditions like reflexivity.

Mistake 1: Confusing a norm with a metric A norm ∥⋅∥\|\cdot\| on a vector space induces a metric d(x,y)=∥x−y∥d(x, y) = \|x - y\|, but not every metric comes from a norm. The discrete metric d(x,y)=1d(x, y) = 1 for x≠yx \neq y is not induced by any norm because norms are homogeneous (∥αx∥=∣α∣∥x∥\|\alpha x\| = |\alpha|\|x\|), which the discrete metric violates. Always verify that a metric is translation-invariant and homogeneous before assuming it comes from a norm.

Mistake 2: Assuming bounded linear operators are automatically continuous In the context of linear operators, boundedness and continuity are equivalent for linear maps between normed spaces. However, students sometimes confuse bounded linear functionals with bounded sets. A bounded linear functional f∈X∗f \in X^* satisfies ∥f(x)∥≤C∥x∥\|f(x)\| \leq C\|x\| for some constant CC, not that f(X)f(X) is a bounded set.

Mistake 3: Forgetting that (C[a,b],∥⋅∥1)(C[a,b], \|\cdot\|_1) is not complete The space of continuous functions with the L1L^1-norm is not a Banach space because Cauchy sequences can converge to discontinuous functions. Only (C[a,b],∥⋅∥∞)(C[a,b], \|\cdot\|_\infty) is complete. When completeness is required, always verify the norm, not just the underlying set.