Technopedia

The technologist’s encyclopedia

Spaces

Spaces is the foundation of functional analysis: it classifies the infinite-dimensional vector spaces on which everything else lives — normed spaces, Banach spaces, and Hilbert spaces — and studies how each space relates to its dual. It is the place to look when a problem is about where a function lives (which space it belongs to, whether that space is “complete enough,” and whether it is its own double dual). This page covers norms and completeness, Hilbert-space geometry, duality, and reflexivity.

Authoritative sources

Normed and Banach spaces

Definition. A norm on a vector space XX is a function ∥⋅∥:X→[0,∞)\| \cdot \| : X \to [0, \infty) satisfying the three axioms

∥x∥=0  ⟺  x=0,∥αx∥=∣α∣ ∥x∥,∥x+y∥≤∥x∥+∥y∥.\|x\| = 0 \iff x = 0, \qquad \|\alpha x\| = |\alpha|\,\|x\|, \qquad \|x + y\| \leq \|x\| + \|y\|.

A normed space is a vector space with a norm; a Banach space is a normed space in which every Cauchy sequence converges (i.e. it is complete).

Details

From a number to a size

In finite dimensions, a vector x=(x1,…,xn)x = (x_1, \dots, x_n) has a natural size, the Euclidean length x12+⋯+xn2\sqrt{x_1^2 + \cdots + x_n^2}. A norm is exactly the generalization of “length” to any vector space: it assigns a non-negative size, respects scaling, and obeys the triangle inequality. The triangle inequality is what makes the norm a genuine notion of distance: d(x,y)=∥x−y∥d(x, y) = \|x - y\| is a metric.

Completeness is the real content

The interesting property is not the norm but completeness. A sequence is Cauchy if its terms get arbitrarily close to each other: ∥xn−xm∥→0\|x_n - x_m\| \to 0 as n,m→∞n, m \to \infty. A space is complete if every such sequence actually converges to a point inside the space.

Example. The space c00c_{00} of finitely supported sequences with the ℓ2\ell^2 norm is not complete: the sequence x(n)=(1,1/2,…,1/n,0,0,… )x^{(n)} = (1, 1/2, \dots, 1/n, 0, 0, \dots) is Cauchy but converges to (1,1/2,1/3,… )(1, 1/2, 1/3, \dots), which has infinitely many nonzero terms and so is not in c00c_{00}. Its completion is the Banach space ℓ2\ell^2.

limit Cauchy sequence: terms cluster, and completeness says the cluster point is in the space.

The workhorse examples

Example problem

Problem. Show that C([0,1])C([0,1]) with the L1L^1 norm ∥f∥1\|f\|_1 is not complete.

Solution

Take fn(x)=min⁡(nx,1)f_n(x) = \min(n x, 1). Each fnf_n is continuous. For m>nm > n, ∥fm−fn∥1≤∫01/n1 dx=1/n→0\|f_m - f_n\|_1 \leq \int_0^{1/n} 1 \, dx = 1/n \to 0, so (fn)(f_n) is Cauchy in L1L^1. It converges in L1L^1 to the step function f(x)=0f(x) = 0 for x=0x = 0 and f(x)=1f(x) = 1 for x>0x > 0, which is not continuous. Hence the limit is not in C([0,1])C([0,1]), so the space is not complete. ∎

Hilbert spaces

Definition. A Hilbert space is a vector space HH equipped with an inner product ⟨⋅,⋅⟩\langle \cdot, \cdot \rangle such that the induced norm ∥x∥=⟨x,x⟩\|x\| = \sqrt{\langle x, x \rangle} makes HH a Banach space. Two vectors are orthogonal if ⟨x,y⟩=0\langle x, y \rangle = 0.

Details

The inner product adds geometry

A norm gives you lengths and distances; an inner product adds angles and orthogonality. The key identity is the parallelogram law,

∥x+y∥2+∥x−y∥2=2∥x∥2+2∥y∥2,\|x + y\|^2 + \|x - y\|^2 = 2\|x\|^2 + 2\|y\|^2,

which holds exactly for norms coming from an inner product. It is the reason a Hilbert space “looks like” Euclidean space: you can project, decompose into orthogonal pieces, and talk about angles.

Example. L2([a,b])L^2([a,b]) has the inner product ⟨f,g⟩=∫abfg‾\langle f, g \rangle = \int_a^b f \overline{g}. The space ℓ2\ell^2 has ⟨x,y⟩=∑xnyn‾\langle x, y \rangle = \sum x_n \overline{y_n}.

Orthogonal projection and the Pythagorean theorem

Given a closed subspace M⊂HM \subset H, every x∈Hx \in H splits uniquely as x=m+hx = m + h with m∈Mm \in M and h⊥Mh \perp M. This is the infinite-dimensional version of dropping a perpendicular. It yields the Pythagorean theorem ∥x∥2=∥m∥2+∥h∥2\|x\|^2 = \|m\|^2 + \|h\|^2, and it is the engine behind Fourier series: the partial sums are orthogonal projections onto finite-dimensional subspaces.

x m (projection) h (perp)

Bases and the Riesz representation theorem

In a Hilbert space, every continuous linear functional φ\varphi has the form φ(x)=⟨x,y⟩\varphi(x) = \langle x, y \rangle for a unique y∈Hy \in H. This is the Riesz representation theorem, and it is what makes Hilbert spaces self-dual: the space and its dual are canonically the same. It fails in general Banach spaces, which is the dividing line between the two settings.

Example problem

Problem. In R2\mathbb{R}^2 with the standard inner product, find the orthogonal projection of x=(3,4)x = (3, 4) onto the line M={(t,t):t∈R}M = \{(t, t) : t \in \mathbb{R}\}.

Solution

Project onto the unit vector u=(1,1)/2u = (1, 1)/\sqrt{2}. The projection is m=⟨x,u⟩u=3+42⋅(1,1)2=72(1,1)=(3.5,3.5)m = \langle x, u \rangle u = \frac{3 + 4}{\sqrt{2}} \cdot \frac{(1,1)}{\sqrt{2}} = \frac{7}{2}(1, 1) = (3.5, 3.5). The perpendicular part is h=x−m=(−0.5,0.5)h = x - m = (-0.5, 0.5), and indeed h⊥Mh \perp M. Check: ∥x∥2=25=∥m∥2+∥h∥2=24.5+0.5\|x\|^2 = 25 = \|m\|^2 + \|h\|^2 = 24.5 + 0.5. ∎

Duality

Definition. The dual of a normed space XX is X∗={φ:X→F continuous linear}X^* = \{ \varphi : X \to \mathbb{F} \text{ continuous linear} \}, with norm ∥φ∥=sup⁡∥x∥≤1∣φ(x)∣\|\varphi\| = \sup_{\|x\| \leq 1} |\varphi(x)|. The double dual is (X∗)∗(X^*)^*.

Details

Why look at the dual

The dual collects all the “measuring devices” on a space — every continuous way to extract a single number from a vector. Two spaces that are hard to distinguish directly often have very different duals, so the dual is a powerful invariant.

Example. The dual of ℓ1\ell^1 is ℓ∞\ell^\infty: a continuous linear functional on ℓ1\ell^1 is given by pairing with a bounded sequence. The dual of LpL^p for 1≤p<∞1 \leq p < \infty is LqL^q where 1/p+1/q=11/p + 1/q = 1 (Hölder’s inequality).

Hahn–Banach: extending functionals

The Hahn–Banach theorem says a continuous linear functional defined on a subspace can be extended to the whole space without increasing its norm. Concretely, it guarantees that the dual is “large enough”: for every nonzero x∈Xx \in X there is a functional φ\varphi with φ(x)=∥x∥\varphi(x) = \|x\| and ∥φ∥=1\|\varphi\| = 1. This is the reason the dual norm recovers the original norm: ∥x∥=sup⁡∥φ∥≤1∣φ(x)∣\|x\| = \sup_{\|\varphi\| \leq 1} |\varphi(x)|.

Example problem

Problem. Identify the dual of R2\mathbb{R}^2 with the ℓ∞\ell^\infty norm ∥(a,b)∥∞=max⁡(∣a∣,∣b∣)\|(a,b)\|_\infty = \max(|a|, |b|).

Solution

Any continuous linear functional is φ(a,b)=αa+βb\varphi(a, b) = \alpha a + \beta b. Its norm is ∥φ∥=sup⁡max⁡(∣a∣,∣b∣)≤1∣αa+βb∣=∣α∣+∣β∣\|\varphi\| = \sup_{\max(|a|,|b|)\le 1} |\alpha a + \beta b| = |\alpha| + |\beta| (attained at (a,b)=(sgn α,sgn β)(a,b) = (\mathrm{sgn}\,\alpha, \mathrm{sgn}\,\beta)). So (R∞2)∗≅R12( \mathbb{R}^2_\infty )^* \cong \mathbb{R}^2_1: the dual of the ∞\infty-norm space is the 11-norm space. This is the finite-dimensional shadow of the ℓ1↔ℓ∞\ell^1 \leftrightarrow \ell^\infty duality. ∎

Reflexivity

Definition. A Banach space XX is reflexive if the canonical map J:X→X∗∗J : X \to X^{**}, J(x)(φ)=φ(x)J(x)(\varphi) = \varphi(x), is onto. Equivalently, XX is (isometrically) its own double dual.

Details

What reflexivity means

Every Banach space embeds into its double dual via JJ, but JJ need not be surjective. Reflexivity says it is: no “extra” functionals appear when you dualize twice. Reflexive spaces are the well-behaved ones for existence arguments — they are the setting where weak compactness (below) gives you convergent subsequences.

Examples. ℓp\ell^p and LpL^p for 1<p<∞1 < p < \infty are reflexive. ℓ1\ell^1, ℓ∞\ell^\infty, and C([0,1])C([0,1]) are not reflexive. Every finite-dimensional space is reflexive.

The weak topology and why reflexivity pays off

The weak topology on XX is the coarsest topology making every φ∈X∗\varphi \in X^* continuous; a sequence xn⇀xx_n \rightharpoonup x (weak convergence) means φ(xn)→φ(x)\varphi(x_n) \to \varphi(x) for every φ\varphi. The key fact: in a reflexive space, every bounded sequence has a weakly convergent subsequence (the Eberlein–Šmulian / Banach–Alaoglu machinery). This is the workhorse behind existence theorems for PDEs and optimization — see Applications.

weak limit Bounded sequence in a reflexive space: a subsequence converges weakly.
Example problem

Problem. Show that ℓ1\ell^1 is not reflexive.

Solution

(ℓ1)∗=ℓ∞( \ell^1 )^* = \ell^\infty, so (ℓ1)∗∗=(ℓ∞)∗( \ell^1 )^{**} = ( \ell^\infty )^*. The space ℓ∞\ell^\infty is not separable and its dual is strictly larger than ℓ∞\ell^\infty itself (e.g. Banach limits are functionals on ℓ∞\ell^\infty that vanish on ℓ1\ell^1 but are not given by an ℓ1\ell^1 sequence). Hence the canonical map ℓ1→(ℓ∞)∗\ell^1 \to ( \ell^\infty )^* is not onto, so ℓ1\ell^1 is not reflexive. Equivalently, ℓ1\ell^1 contains the sequence en=(0,…,1,… )e_n = (0, \dots, 1, \dots) which is bounded but has no weakly convergent subsequence. ∎

Quiz

Example problem

Problem. Let HH be a Hilbert space and M⊂HM \subset H a closed subspace. Prove that H=M⊕M⊥H = M \oplus M^\perp (direct sum), and explain why this decomposition is the reason Hilbert spaces are reflexive.

Solution

For any x∈Hx \in H, the set D={∥x−m∥:m∈M}D = \{ \|x - m\| : m \in M \} has an infimum δ≥0\delta \geq 0. By completeness of MM and the parallelogram law, there is a sequence mn∈Mm_n \in M with ∥x−mn∥→δ\|x - m_n\| \to \delta, and (mn)(m_n) is Cauchy, hence converges to some m∈Mm \in M with ∥x−m∥=δ\|x - m\| = \delta. Let h=x−mh = x - m. For any v∈Mv \in M and any scalar tt, ∥h+tv∥2≥δ2=∥h∥2\|h + t v\|^2 \geq \delta^2 = \|h\|^2, which forces Re ⟨h,v⟩=0\mathrm{Re}\,\langle h, v \rangle = 0 for all vv, so h⊥Mh \perp M. Thus x=m+hx = m + h with m∈Mm \in M, h∈M⊥h \in M^\perp, and the split is unique.

Because every closed subspace admits this orthogonal projection, the Riesz representation theorem holds (every functional is ⟨⋅,y⟩\langle \cdot, y \rangle), so H≅H∗H \cong H^* canonically, and iterating gives H≅H∗∗H \cong H^{**}: every Hilbert space is reflexive. ∎