8.1 Normed and Banach Spaces; Bounded Operators; Hahn–Banach
Spaces of sequences and functions with a norm: $\ell^p$, $c_0$, $C[a,b]$ and $L^p$ and why they are complete; bounded operators and the operator norm; the duals $(\ell^p)^*=\ell^q$ and $c_0^*=\ell^1$; and the Hahn–Banach theorem, which guarantees that a normed space has enough bounded linear functionals.
Linear algebra studies linear maps between finite-dimensional spaces; functional analysis studies linear maps between spaces of functions — the integral operator $f\mapsto\int_0^1K(\cdot,t)f(t)\,dt$, the differentiation operator $f\mapsto f'$, the map that sends a function to its sequence of Fourier coefficients. To speak of continuity, convergence and approximation for such maps we measure the size of a function by a norm. Two questions then dominate. Is the space complete, so that the limits we construct by iteration, by series or by approximation actually exist inside it? And is a given linear map bounded, so that small inputs produce small outputs? In finite dimensions both answers are always "yes"; in infinite dimensions they depend on the norm, and getting them right is most of the work.
The section ends with the first of the great theorems of the subject, the Hahn–Banach theorem. It says that a bounded linear functional defined on a subspace can always be extended to the whole space without increasing its norm, and, geometrically, that a convex set can be separated from a point outside it by a hyperplane. Its consequences — every normed space has many bounded functionals, $\|x\|=\max_{\|f\|\le1}|f(x)|$, closed subspaces are cut out by functionals — are used everywhere in analysis, optimisation and the theory of PDEs. GATE asks for the norms of concrete operators and functionals (often as NAT questions), for the completeness of concrete spaces, and for the precise statements of Hahn–Banach and its corollaries in MSQ form. Norms, $C[a,b]$ and equivalent norms are also developed, with further examples, in CSIR Unit 1 · §7.4; here we go further, to $L^p$, dual spaces and Hahn–Banach.
Normed Spaces and Banach Spaces
Throughout, $\mathbb{F}$ denotes $\mathbb{R}$ or $\mathbb{C}$, and all vector spaces are over $\mathbb{F}$. For $1\le p\le\infty$ the conjugate exponent $q$ is defined by $\tfrac1p+\tfrac1q=1$, with $q=\infty$ when $p=1$ and $q=1$ when $p=\infty$; for instance $p=2\leftrightarrow q=2$, $p=3\leftrightarrow q=\tfrac32$, $p=4\leftrightarrow q=\tfrac43$.
A norm on a vector space $X$ is a function $\|\cdot\|:X\to[0,\infty)$ such that, for all $x,y\in X$ and $\lambda\in\mathbb{F}$,
A normed space is a vector space with a norm; it is a metric space with $d(x,y)=\|x-y\|$, and $x_n\to x$ means $\|x_n-x\|\to0$. A normed space that is complete (every Cauchy sequence converges) is a Banach space. From the triangle inequality, $\big|\|x\|-\|y\|\big|\le\|x-y\|$, so the norm is continuous, and so are addition and scalar multiplication.
In $L^p$ two functions that are equal almost everywhere are identified (an element of $L^p$ is an equivalence class); otherwise $\|f\|_p=0$ would not force $f=0$. The unit vectors are $e_n=(0,\dots,0,1,0,\dots)$ with the $1$ in place $n$. The same definitions with $n\le N$ give the finite-dimensional spaces $\ell^p_N=(\mathbb{F}^N,\|\cdot\|_p)$.
Let $1\le p\le\infty$ with conjugate exponent $q$.
- Hölder: for sequences, $\sum_n|x_ny_n|\le\|x\|_p\|y\|_q$; for measurable functions on $[a,b]$, $\int_a^b|fg|\le\|f\|_p\|g\|_q$.
- Minkowski: $\|x+y\|_p\le\|x\|_p+\|y\|_p$, and $\|f+g\|_p\le\|f\|_p+\|g\|_p$.
Hence $\|\cdot\|_p$ is a norm on $\ell^p$ and on $L^p[a,b]$, and these are vector spaces.
Proof. The cases $p=1$ or $p=\infty$ follow from $|x_ny_n|\le|x_n|\,\|y\|_\infty$ and $|x_n+y_n|\le|x_n|+|y_n|$. Let $1\lt p\lt\infty$. Young's inequality: for $a,b\ge0$, $ab\le\frac{a^p}{p}+\frac{b^q}{q}$. This is clear if $ab=0$; otherwise, since $\log$ is concave and $\tfrac1p+\tfrac1q=1$, $$\log\Big(\tfrac1pa^p+\tfrac1qb^q\Big)\ge\tfrac1p\log a^p+\tfrac1q\log b^q,$$ and the right-hand side is $\log(ab)$. Hölder: if $\|x\|_p=0$ or $\|y\|_q=0$ there is nothing to prove. Otherwise apply Young to $a=|x_n|/\|x\|_p$, $b=|y_n|/\|y\|_q$ and sum over $n$: $$\frac{\sum|x_ny_n|}{\|x\|_p\|y\|_q}\le\frac1p\cdot\frac{\sum|x_n|^p}{\|x\|_p^p}+\frac1q\cdot\frac{\sum|y_n|^q}{\|y\|_q^q},$$ and the right-hand side equals $\tfrac1p+\tfrac1q=1$. Minkowski: first, $x+y\in\ell^p$, because $|x_n+y_n|^p\le\big(2\max(|x_n|,|y_n|)\big)^p$ and this is at most $2^p\big(|x_n|^p+|y_n|^p\big)$. Write $$\begin{aligned}|x_n+y_n|^p&\le|x_n|\,|x_n+y_n|^{p-1}\\&\quad+|y_n|\,|x_n+y_n|^{p-1}\end{aligned}$$ and apply Hölder to each sum; since $(p-1)q=p$, $$\begin{aligned}\|x+y\|_p^p&\le\big(\|x\|_p+\|y\|_p\big)\Big(\sum|x_n+y_n|^{p}\Big)^{1/q}\\&=\big(\|x\|_p+\|y\|_p\big)\|x+y\|_p^{p/q}.\end{aligned}$$ If $\|x+y\|_p\ne0$, divide by $\|x+y\|_p^{p/q}$ and use $p-\tfrac pq=1$. The function versions are proved word for word with sums replaced by integrals. ∎
Proof. ($\Rightarrow$) For $M\gt N$, $\|s_M-s_N\|\le\sum_{k=N+1}^M\|x_k\|$, which is small for large $N$; so $(s_N)$ is Cauchy and converges. ($\Leftarrow$) Let $(y_n)$ be Cauchy. Choose $n_1\lt n_2\lt\cdots$ with $\|y_m-y_n\|\lt2^{-k}$ for all $m,n\ge n_k$. The series $y_{n_1}+\sum_k(y_{n_{k+1}}-y_{n_k})$ is absolutely convergent ($\sum2^{-k}\lt\infty$), so it converges; its partial sums are $y_{n_{k+1}}$. Thus the subsequence $(y_{n_k})$ converges to some $y$, and a Cauchy sequence with a convergent subsequence converges to the same limit: $\|y_n-y\|\le\|y_n-y_{n_k}\|+\|y_{n_k}-y\|$. ∎
- $\ell^p$ ($1\le p\le\infty$) is a Banach space. $c$ and $c_0$ are closed subspaces of $\ell^\infty$, hence Banach spaces.
- $c_{00}$ is not complete in any of the norms $\|\cdot\|_p$; its closure is $\ell^p$ in $\ell^p$ ($p\lt\infty$) and $c_0$ in $\ell^\infty$.
- $(C[a,b],\|\cdot\|_\infty)$ is a Banach space.
- Riesz–Fischer: $L^p[a,b]$ ($1\le p\lt\infty$) is a Banach space; so is $L^\infty[a,b]$.
- A subspace of a Banach space is a Banach space (with the restricted norm) if and only if it is closed.
Proof. (5) A complete subset of a metric space is closed (a limit of points of the subset is the limit of a Cauchy sequence in it), and a closed subset of a complete space is complete (its Cauchy sequences converge in the big space, and the limit stays in the closed subset).
(1) Let $p\lt\infty$ and let $(x^{(k)})_k$ be Cauchy in $\ell^p$. Since $|x^{(k)}_n-x^{(m)}_n|\le\|x^{(k)}-x^{(m)}\|_p$, each coordinate sequence is Cauchy in $\mathbb{F}$; let $x_n=\lim_kx^{(k)}_n$. Given $\varepsilon\gt0$ choose $K$ with $\|x^{(k)}-x^{(m)}\|_p\lt\varepsilon$ for $k,m\ge K$. For each fixed $N$, $$\sum_{n\le N}\big|x^{(k)}_n-x^{(m)}_n\big|^p\lt\varepsilon^p\qquad(k,m\ge K).$$ Let $m\to\infty$ (a finite sum), then $N\to\infty$: $\|x^{(k)}-x\|_p\le\varepsilon$ for $k\ge K$. So $x^{(K)}-x\in\ell^p$, hence $x=x^{(K)}-(x^{(K)}-x)\in\ell^p$, and $x^{(k)}\to x$. For $\ell^\infty$ the same argument works with "$\sup_{n\le N}$" in place of the sum. If $x^{(k)}\in c_0$ and $x^{(k)}\to x$ in $\ell^\infty$, pick $k$ with $\|x-x^{(k)}\|_\infty\lt\varepsilon$; then $|x_n|\le\varepsilon+|x^{(k)}_n|\lt2\varepsilon$ for large $n$, so $x\in c_0$. Similarly, if all $x^{(k)}\in c$, then for large $m,n$ we have $|x_m-x_n|\le2\varepsilon+|x^{(k)}_m-x^{(k)}_n|\lt3\varepsilon$, so $(x_n)$ is Cauchy and $x\in c$.
(2) The truncations $x^{(k)}=(1,\tfrac12,\dots,\tfrac1k,0,0,\dots)\in c_{00}$ converge in $\|\cdot\|_\infty$ to $(\tfrac1n)\notin c_{00}$, since $\|x^{(k)}-(\tfrac1n)\|_\infty=\tfrac1{k+1}$; in $\ell^p$ use $(n^{-2})$ instead. So $c_{00}$ is not closed in the Banach space, hence not complete by (5). For $x\in\ell^p$ ($p\lt\infty$), the truncations $P_kx=(x_1,\dots,x_k,0,\dots)$ satisfy $\|x-P_kx\|_p^p=\sum_{n\gt k}|x_n|^p\to0$ (tail of a convergent series), so $c_{00}$ is dense in $\ell^p$; for $x\in c_0$, $\|x-P_kx\|_\infty=\sup_{n\gt k}|x_n|\to0$. In $\ell^\infty$ the closure of $c_{00}$ is $c_0$, because $c_0$ is closed.
(3) A Cauchy sequence in $\|\cdot\|_\infty$ is uniformly Cauchy, so it converges uniformly; a uniform limit of continuous functions is continuous (§4.2).
(4) We use Theorem 8.2. Let $f_k\in L^p$ with $\sum_k\|f_k\|_p=S\lt\infty$, and put $g_N=\sum_{k\le N}|f_k|$. By Minkowski $\|g_N\|_p\le S$. The functions $g_N$ increase to $g=\sum_k|f_k|$ (possibly $+\infty$), and the monotone convergence theorem (§4.3) gives $\int g^p=\lim\int g_N^p\le S^p$. Hence $g\lt\infty$ almost everywhere, so the series $\sum f_k(x)$ converges absolutely for almost every $x$; call its sum $f(x)$ (and $f=0$ elsewhere). Then $|f|\le g$, so $f\in L^p$, and with $s_N=\sum_{k\le N}f_k$ we have $|f-s_N|^p\le(2g)^p$, an integrable bound, while $|f-s_N|^p\to0$ a.e. By dominated convergence $\|f-s_N\|_p\to0$. For $L^\infty$: if $(f_k)$ is Cauchy, discard the null set where some $|f_k-f_m|\gt\|f_k-f_m\|_\infty$; off it the convergence is uniform. ∎
Bounded Linear Operators and the Operator Norm
Let $X,Y$ be normed spaces. A linear map $T:X\to Y$ is bounded if there is a constant $C$ with $\|Tx\|\le C\|x\|$ for all $x\in X$. Its operator norm is
$$\|T\|=\sup_{\|x\|\le1}\|Tx\|.$$$B(X,Y)$ is the vector space of bounded linear maps $X\to Y$, and $B(X)=B(X,X)$. A linear map $X\to\mathbb{F}$ is a linear functional; the dual space of $X$ is $X^*=B(X,\mathbb{F})$, with the norm $\|f\|=\sup_{\|x\|\le1}|f(x)|$.
Proof. (iv)$\Rightarrow$(iii): $\|Tx-Ty\|=\|T(x-y)\|\le C\|x-y\|$. (iii)$\Rightarrow$(ii)$\Rightarrow$(i) is clear. (i)$\Rightarrow$(iv): continuity at $0$ with $\varepsilon=1$ gives $\delta\gt0$ with $\|Tz\|\le1$ whenever $\|z\|\le\delta$. For $x\ne0$ put $z=\delta x/\|x\|$; by linearity $\|Tx\|=\tfrac{\|x\|}{\delta}\|Tz\|\le\tfrac1\delta\|x\|$. For the formulas: if $x\ne0$ then $x/\|x\|$ is a unit vector, so $\|Tx\|/\|x\|=\|T(x/\|x\|)\|$; this shows $\sup_{x\ne0}\|Tx\|/\|x\|=\sup_{\|x\|=1}\|Tx\|=:s$, and $\|Tx\|\le s\|x\|$, so $s$ is the least admissible $C$ (any admissible $C$ satisfies $C\ge s$). Finally $\sup_{\|x\|\le1}\|Tx\|=s$: the unit sphere is inside the ball, and for $0\lt\|x\|\le1$, $\|Tx\|=\|x\|\,\|T(x/\|x\|)\|\le s$. ∎
Proof. The norm axioms: $\|T\|=0$ means $Tx=0$ for all $\|x\|\le1$, hence for all $x$; $\|(\lambda T)x\|=|\lambda|\|Tx\|$; and $\|(S+T)x\|\le\|Sx\|+\|Tx\|\le\|S\|+\|T\|$ for $\|x\|\le1$. Also $\|STx\|\le\|S\|\,\|Tx\|\le\|S\|\,\|T\|\,\|x\|$.
Completeness: let $(T_n)$ be Cauchy in $B(X,Y)$. For each $x$, $\|T_nx-T_mx\|\le\|T_n-T_m\|\,\|x\|$, so $(T_nx)$ is Cauchy in $Y$; let $Tx=\lim T_nx$. $T$ is linear (limits respect linear combinations). Given $\varepsilon\gt0$ choose $N$ with $\|T_n-T_m\|\lt\varepsilon$ for $n,m\ge N$; then $\|T_nx-T_mx\|\le\varepsilon\|x\|$, and letting $m\to\infty$ (the norm is continuous) gives $\|T_nx-Tx\|\le\varepsilon\|x\|$ for $n\ge N$. Thus $T_n-T$ is bounded, so $T=T_n-(T_n-T)\in B(X,Y)$, and $\|T_n-T\|\le\varepsilon$ for $n\ge N$. The last statement is the case $Y=\mathbb{F}$, which is complete. ∎
Proof. (a) Fix a basis $e_1,\dots,e_n$ and write $x=\sum a_ie_i$, $\|x\|_1:=\sum|a_i|$. The equivalence of all norms with $\|\cdot\|_1$ (proved by the compactness of the $\|\cdot\|_1$-unit sphere; see CSIR Unit 1 · §7.4) gives completeness, since $(\mathbb{F}^n,\|\cdot\|_1)$ is complete. For linear $T$, $\|Tx\|\le\sum|a_i|\,\|Te_i\|$, which is at most $\big(\max_i\|Te_i\|\big)\|x\|_1\le C\|x\|$. A finite-dimensional subspace is complete in the restricted norm, hence closed (Theorem 8.3(5)). (b) Choose linearly independent unit vectors $u_1,u_2,\dots$ and extend them to a Hamel basis $\{u_i\}\cup\{v_j\}$ of $X$ (Zorn's lemma). Define $f$ on the basis by $f(u_n)=n$, $f(v_j)=0$, and extend linearly. Then $|f(u_n)|=n$ with $\|u_n\|=1$, so $f$ is unbounded. ∎
Part (b) is an existence statement — nobody can write such an $f$ down on, say, $\ell^2$. In practice, the unbounded operators one meets are defined on non-complete spaces or on dense subspaces: differentiation on $(C^1[0,1],\|\cdot\|_\infty)$, or $x\mapsto\sum_nnx_n$ on $(c_{00},\|\cdot\|_\infty)$. Section 8.2 explains why a "natural" unbounded operator can never be defined everywhere on a Banach space with a closed graph.
Dual Spaces of the Classical Spaces
For a concrete space we want to describe $X^*$: every $y$ in a suitable sequence space defines a functional on $\ell^p$ by "pairing", and the question is whether all functionals arise this way.
Let $1\le p\lt\infty$ with conjugate exponent $q$. For a sequence $y$ put $\varphi_y(x)=\sum_nx_ny_n$.
- $y\mapsto\varphi_y$ is an isometric isomorphism of $\ell^q$ onto $(\ell^p)^*$: every bounded functional on $\ell^p$ is $\varphi_y$ for exactly one $y\in\ell^q$, and $\|\varphi_y\|=\|y\|_q$. In short, $(\ell^p)^*=\ell^q$; in particular $(\ell^1)^*=\ell^\infty$ and $(\ell^2)^*=\ell^2$.
- The same map is an isometric isomorphism of $\ell^1$ onto $c_0^*$: $\ c_0^*=\ell^1$.
- (Statement.) $(L^p[a,b])^*=L^q[a,b]$ for $1\le p\lt\infty$, every functional being $f\mapsto\int_a^bfg$ for a unique $g\in L^q$, with norm $\|g\|_q$.
- $y\mapsto\varphi_y$ maps $\ell^1$ isometrically into $(\ell^\infty)^*$, but not onto (Example 7); likewise $L^1\subsetneq(L^\infty)^*$.
Proof. (1), case $1\lt p\lt\infty$. By Hölder, $|\varphi_y(x)|\le\|x\|_p\|y\|_q$, so the series converges and $\|\varphi_y\|\le\|y\|_q$. For the reverse inequality fix $N$ and let $x^{(N)}_n=|y_n|^{q-1}\,\overline{\operatorname{sgn}y_n}$ for $n\le N$ and $0$ for $n\gt N$, where $\operatorname{sgn}z=z/|z|$ ($\operatorname{sgn}0=0$). Since $(q-1)p=q$, $$\varphi_y(x^{(N)})=\sum_{n\le N}|y_n|^q=:S_N,\qquad\|x^{(N)}\|_p=S_N^{1/p}.$$ So $\|\varphi_y\|\ge S_N^{1-1/p}=S_N^{1/q}$ whenever $S_N\gt0$; letting $N\to\infty$ gives $\|\varphi_y\|\ge\|y\|_q$. Onto: let $\varphi\in(\ell^p)^*$ and put $y_n=\varphi(e_n)$. For $x\in\ell^p$ the truncations $\sum_{n\le N}x_ne_n$ converge to $x$ in $\ell^p$ (Theorem 8.3(2) — here $p\lt\infty$ is essential), so by continuity and linearity $\varphi(x)=\lim_N\sum_{n\le N}x_ny_n=\sum_nx_ny_n$. It remains to see $y\in\ell^q$: with $x^{(N)}$ as above, $S_N=\varphi(x^{(N)})\le\|\varphi\|\,S_N^{1/p}$, so $S_N^{1/q}\le\|\varphi\|$ for every $N$. Uniqueness: $y_n=\varphi_y(e_n)$ is determined by $\varphi_y$.
Case $p=1$, $q=\infty$: $|\varphi_y(x)|\le\|y\|_\infty\|x\|_1$, and $|\varphi_y(e_n)|=|y_n|$ with $\|e_n\|_1=1$ gives $\|\varphi_y\|=\|y\|_\infty$. For $\varphi\in(\ell^1)^*$, $y_n=\varphi(e_n)$ satisfies $|y_n|\le\|\varphi\|$, and $\varphi=\varphi_y$ by the same truncation argument.
(2) For $y\in\ell^1$, $|\varphi_y(x)|\le\|x\|_\infty\|y\|_1$. The vector $x^{(N)}=(\overline{\operatorname{sgn}y_1},\dots,\overline{\operatorname{sgn}y_N},0,\dots)\in c_0$ has norm at most $1$ and $\varphi_y(x^{(N)})=\sum_{n\le N}|y_n|$, so $\|\varphi_y\|=\|y\|_1$. Given $\varphi\in c_0^*$, set $y_n=\varphi(e_n)$; then $\sum_{n\le N}|y_n|=\varphi(x^{(N)})\le\|\varphi\|$, so $y\in\ell^1$, and since truncations converge in $c_0$, $\varphi=\varphi_y$. (3) needs the Radon–Nikodym theorem and is beyond our scope; (4) is proved in Example 7. ∎
Notice where $p\lt\infty$ entered: the vectors $e_n$ span a dense subspace of $\ell^p$ and of $c_0$, so a bounded functional is determined by its values on them. In $\ell^\infty$ they do not: the constant sequence $(1,1,1,\dots)$ is at distance $1$ from every finitely supported sequence.
The Hahn–Banach Theorem
Does a normed space have any nonzero bounded functionals at all? For $\ell^p$ and $C[a,b]$ we can write them down, but for an abstract space we need a theorem. The Hahn–Banach theorem builds functionals by extending them one dimension at a time, controlled by a "sublinear" bound.
Proof. Step 1: one more dimension. Let $x_0\notin M$ and $M_1=M+\mathbb{R}x_0$. Every element of $M_1$ is uniquely $m+tx_0$, so an extension is determined by the number $c=F(x_0)$, and we need $g(m)+tc\le p(m+tx_0)$ for all $m\in M$, $t\in\mathbb{R}$. Dividing by $|t|$ and using positive homogeneity, this means $$c\le p(m+x_0)-g(m)\quad(m\in M),$$ $$c\ge g(m')-p(m'-x_0)\quad(m'\in M).$$ Such a $c$ exists if and only if $g(m')-p(m'-x_0)\le p(m+x_0)-g(m)$ for all $m,m'$. And this holds: $$\begin{aligned}g(m)+g(m')&=g(m+m')\le p(m+m')\\&\le p(m+x_0)+p(m'-x_0).\end{aligned}$$ So $a=\sup_{m'}\big[g(m')-p(m'-x_0)\big]$ is at most $b=\inf_m\big[p(m+x_0)-g(m)\big]$, and any $c\in[a,b]$ works.
Step 2: Zorn's lemma. Let $\mathcal{E}$ be the set of pairs $(N,h)$ with $M\subseteq N$ a subspace, $h:N\to\mathbb{R}$ linear, $h|_M=g$ and $h\le p$ on $N$, ordered by extension: $(N,h)\preceq(N',h')$ if $N\subseteq N'$ and $h'|_N=h$. $\mathcal{E}\ni(M,g)$ is nonempty, and every chain $\{(N_i,h_i)\}$ has an upper bound: $N=\bigcup N_i$ is a subspace (any two of its elements lie in a common $N_i$) and $h=h_i$ on $N_i$ is well defined, linear and $\le p$. By Zorn's lemma there is a maximal $(N,h)$. If $N\ne X$, Step 1 extends $h$ to $N+\mathbb{R}x_0$, contradicting maximality. So $N=X$ and $F=h$. ∎
For a separable normed space Zorn is not needed: extend step by step along a dense sequence $x_1,x_2,\dots$ to the subspace they span with $M$, and then by continuity to its closure, which is $X$.
Proof. (a) Real case: Theorem 8.8 gives $F\le p$, and then $-F(x)=F(-x)\le p(-x)=p(x)$, so $|F|\le p$. Complex case: $u=\operatorname{Re}g$ is real-linear on $M$ with $u\le|g|\le p$, and $g$ is recovered from $u$, because $\operatorname{Im}g(m)=-\operatorname{Re}\big(ig(m)\big)=-u(im)$: $$g(m)=u(m)-i\,u(im).$$ Regard $X$ as a real space, extend $u$ to a real-linear $U\le p$ (Theorem 8.8), and define $F(x)=U(x)-iU(ix)$. Then $F$ is real-linear, and $F(ix)=U(ix)-iU(-x)$ $=U(ix)+iU(x)=iF(x)$, so $F$ is complex-linear; on $M$ it equals $g$. Finally, given $x$, write $F(x)=|F(x)|e^{i\theta}$; then $|F(x)|=F(e^{-i\theta}x)$ is real, so it equals $U(e^{-i\theta}x)\le p(e^{-i\theta}x)=p(x)$. (b) Apply (a) with the seminorm $p(x)=\|g\|\,\|x\|$: $|F(x)|\le\|g\|\|x\|$ gives $\|F\|\le\|g\|$, and $\|F\|\ge\|g\|$ because $F$ extends $g$. ∎
- For every $x_0\ne0$ there is $f\in X^*$ with $\|f\|=1$ and $f(x_0)=\|x_0\|$. In particular $X^*\ne\{0\}$ when $X\ne\{0\}$, and $X^*$ separates points: if $x\ne y$, some $f\in X^*$ has $f(x)\ne f(y)$.
- $\|x\|=\max\{|f(x)|:f\in X^*,\ \|f\|\le1\}$ — the maximum is attained.
- Let $M$ be a subspace and $x_0\in X$ with $d=\operatorname{dist}(x_0,M)\gt0$. Then there is $f\in X^*$ with $f|_M=0$, $\|f\|=1$ and $f(x_0)=d$. Consequently a subspace $M$ is dense in $X$ if and only if the only $f\in X^*$ vanishing on $M$ is $f=0$.
- The canonical map $J:X\to X^{**}$, $(Jx)(f)=f(x)$, is a linear isometry.
- If $X^*$ is separable, then $X$ is separable.
Proof. (1) On $M=\mathbb{F}x_0$ define $g(tx_0)=t\|x_0\|$; then $|g(tx_0)|=\|tx_0\|$, so $\|g\|=1$. Extend by Theorem 8.9(b). For separation apply this to $x_0=x-y$. (2) $|f(x)|\le\|f\|\|x\|\le\|x\|$ when $\|f\|\le1$, and (1) gives equality (for $x=0$ take $f=0$).
(3) Every element of $N=M+\mathbb{F}x_0$ is uniquely $m+tx_0$ (because $x_0\notin M$, as $d\gt0$). Define $g(m+tx_0)=td$. For $t\ne0$, since $-m/t\in M$, $$|g(m+tx_0)|=|t|\,d\le|t|\,\big\|x_0+\tfrac mt\big\|=\|m+tx_0\|,$$ so $\|g\|\le1$. Choosing $m_k\in M$ with $\|x_0-m_k\|\to d$ gives $g(x_0-m_k)=d$ and $\|g\|\ge d/\|x_0-m_k\|\to1$. Extend $g$ to $f$ with $\|f\|=1$. For the density criterion: if $\overline{M}\ne X$, pick $x_0\notin\overline M$; then $d\gt0$ and $f\ne0$ vanishes on $M$. Conversely, if $M$ is dense and $f$ is continuous and zero on $M$, then $f=0$ on $\overline M=X$.
(4) $|(Jx)(f)|=|f(x)|\le\|x\|\,\|f\|$, so $Jx\in X^{**}$ with $\|Jx\|\le\|x\|$, and (2) gives $\|Jx\|=\|x\|$. Linearity is clear.
(5) Let $\{f_n\}$ be dense in $X^*$ and choose unit vectors $x_n$ with $|f_n(x_n)|\ge\tfrac12\|f_n\|$. Let $M$ be the closed linear span of $\{x_n\}$; it is separable (finite rational linear combinations are dense in it). If $M\ne X$, (3) gives $f\in X^*$ with $\|f\|=1$ and $f|_M=0$. Pick $f_n$ with $\|f-f_n\|\lt\tfrac13$. Then $\|f_n\|\gt\tfrac23$, while $|f_n(x_n)|=|(f_n-f)(x_n)|\lt\tfrac13$, contradicting $|f_n(x_n)|\ge\tfrac12\|f_n\|\gt\tfrac13$. So $M=X$. ∎
For example, $\ell^1$ is not reflexive: it is separable, but its dual $\ell^\infty$ is not (the uncountably many $0$–$1$ sequences are at mutual distance $1$). If $\ell^1$ were reflexive, $(\ell^\infty)^*\cong(\ell^1)^{**}\cong\ell^1$ would be separable, and Theorem 8.10(5) applied to $X=\ell^\infty$ would make $\ell^\infty$ separable — a contradiction. Likewise $c_0^{**}=(\ell^1)^*=\ell^\infty\ne c_0$.
Separation of convex sets
The geometric form of Hahn–Banach replaces the norm by a convex set. A real hyperplane in $X$ is a set $\{x:\operatorname{Re}f(x)=t\}$ with $f\in X^*\setminus\{0\}$ and $t\in\mathbb{R}$; it separates $A$ and $B$ if they lie in the two closed half-spaces it bounds.
- If $A$ is open, there are $f\in X^*$ and $t\in\mathbb{R}$ with $\operatorname{Re}f(a)\lt t\le\operatorname{Re}f(b)$ for all $a\in A$, $b\in B$.
- If $A$ is closed and $B$ is compact, there are $f\in X^*$ and $t_1\lt t_2$ with $\operatorname{Re}f(a)\le t_1\lt t_2\le\operatorname{Re}f(b)$: strict separation. In particular, a point outside a closed convex set can be strictly separated from it, and every closed convex set is the intersection of the closed half-spaces containing it.
Proof. Work first with real scalars. Gauge lemma: if $C$ is open and convex with $B(0,r)\subseteq C$, then $p_C$ is sublinear, $0\le p_C(x)\le\|x\|/r$, and $C=\{x:p_C(x)\lt1\}$. Indeed, $\tfrac{r}{\|x\|+\varepsilon}x\in B(0,r)\subseteq C$ gives $p_C(x)\le(\|x\|+\varepsilon)/r$. If $x\in sC$ and $s\lt t$, then $x/t=\tfrac st(x/s)+(1-\tfrac st)0\in C$, so $x\in tC$. Given $\varepsilon\gt0$ put $s=p_C(x)+\varepsilon$, $s'=p_C(y)+\varepsilon$; then $x/s,\,y/s'\in C$ and, by convexity, $$\frac{x+y}{s+s'}=\frac{s}{s+s'}\cdot\frac xs+\frac{s'}{s+s'}\cdot\frac y{s'}\in C,$$ so $p_C(x+y)\le p_C(x)+p_C(y)+2\varepsilon$. Positive homogeneity is clear. If $x\in C$, openness gives $(1+\delta)x\in C$, so $p_C(x)\le\tfrac1{1+\delta}\lt1$; if $p_C(x)\lt1$, then $x\in tC$ for some $t\lt1$, hence $x\in C$.
A point and an open convex set. Let $C$ be open convex and $x_0\notin C$; translating, assume $0\in C$. On $\mathbb{R}x_0$ let $g(sx_0)=s$. Then $g\le p_C$ there: for $s\gt0$, $p_C(sx_0)=s\,p_C(x_0)\ge s$ because $x_0\notin C$; for $s\le0$, $g(sx_0)\le0\le p_C$. Theorem 8.8 gives a linear $F\le p_C$ extending $g$; $F$ is bounded since $|F(x)|\le\max(p_C(x),p_C(-x))\le\|x\|/r$, and $F(x)\le p_C(x)\lt1=F(x_0)$ for $x\in C$.
(1) $C=A-B=\bigcup_{b\in B}(A-b)$ is open and convex, and $0\notin C$. The previous step (with $x_0=0$, after translating $C$) gives $F\in X^*$ with $F(a-b)\lt F(0)=0$, i.e. $F(a)\lt F(b)$. Let $t=\sup_AF\le\inf_BF$. The set $F(A)$ is open in $\mathbb{R}$ (a nonzero functional maps open sets to open sets: if $F(z)=1$ then $F(a+sz)=F(a)+s$), so the supremum is not attained: $F(a)\lt t\le F(b)$. (2) The function $b\mapsto\operatorname{dist}(b,A)$ is continuous and positive on the compact set $B$ ($A$ is closed), so it has a minimum $\delta\gt0$. The set $A_\delta=A+B(0,\delta/2)$ is open, convex and disjoint from $B$; by (1) there is $F\ne0$ with $F(a)+F(z)\lt t\le F(b)$ whenever $\|z\|\lt\delta/2$. Taking the supremum over $z$, $F(a)+\tfrac\delta2\|F\|\le t$, so $t_1=t-\tfrac\delta2\|F\|\lt t_2=t$ works.
Complex scalars: apply the real result to $X$ regarded as a real space to get a real functional $u$, and put $f(x)=u(x)-iu(ix)$; as in Theorem 8.9, $f\in X^*$ and $\operatorname{Re}f=u$. ∎
- Upper bound first: estimate $\|Tx\|\le C\|x\|$ with Hölder (sequences, $L^p$), the kernel bound $\max_x\int|K(x,t)|\,dt$ ($C[a,b]$), or row/column sums (matrices).
- Then an extremal vector: $e_n$ for $\ell^1$; the sign pattern $\overline{\operatorname{sgn}y_n}$ for $c_0$/$\ell^\infty$; $|y_n|^{q-1}\overline{\operatorname{sgn}y_n}$ for $\ell^p$; $f\equiv1$ when the kernel is $\ge0$; a smoothed $\overline{\operatorname{sgn}g}$ on $C[a,b]$.
- Read off known formulas: $\|\varphi_y\|_{(\ell^p)^*}=\|y\|_q$, $\|\varphi_y\|_{c_0^*}=\|y\|_1$, $\|\varphi_g\|_{C[a,b]^*}=\int|g|$, point evaluations $\delta_t(f)=f(t)$ have norm $1$, so $\|\sum c_i\delta_{t_i}\|=\sum|c_i|$ for distinct $t_i$.
- Attained? Check whether the extremal vector lies in the space: it fails for sign changes on $C[a,b]$ and for infinitely many nonzero $y_n$ on $c_0$; it always succeeds on $\ell^p$, $1\lt p\lt\infty$.
- Unbounded? Exhibit unit vectors with $\|Tx_n\|\to\infty$ ($x^n$ for $d/dx$, $e_n$ for $x\mapsto\sum nx_n$).
- Incomplete normed spaces are everywhere. $(c_{00},\|\cdot\|_p)$, $(C[0,1],\|\cdot\|_1)$, polynomials with $\|\cdot\|_\infty$, $(C^1[0,1],\|\cdot\|_\infty)$ and $(\ell^1,\|\cdot\|_\infty)$ are not complete. A subspace of a Banach space is Banach iff it is closed.
- Inclusions go opposite ways. $\ell^p\subseteq\ell^r$ for $p\lt r$ (sequences), but $L^r[0,1]\subseteq L^p[0,1]$ for $p\lt r$ (finite measure), and on $\mathbb{R}$ no inclusion holds: $x^{-1/2}\mathbf 1_{(0,1)}\in L^1\setminus L^2$, $x^{-1}\mathbf 1_{(1,\infty)}\in L^2\setminus L^1$.
- Norms need not be attained. $f\mapsto\int_0^1(2t-1)f$ on $C[0,1]$ (norm $\tfrac12$); $x\mapsto\sum x_n2^{-n}$ on $c_0$ (norm $1$); $f\mapsto\int_0^1f-f(0)$ (norm $2$).
- Linear does not imply bounded in infinite dimensions: $d/dx$ on $(C^1[0,1],\|\cdot\|_\infty)$, $x\mapsto\sum nx_n$ on $c_{00}$, and (by Zorn) functionals on every infinite-dimensional normed space. A functional is bounded iff its kernel is closed; an unbounded one has a dense kernel.
- Pointwise vs norm convergence of operators. The left shift $L$ on $\ell^2$ has $L^nx\to0$ for every $x$, yet $\|L^n\|=1$ for all $n$. The truncations $P_k$ satisfy $P_kx\to x$ in $\ell^2$ but $\|I-P_k\|=1$.
- The duality is not symmetric. $(\ell^1)^*=\ell^\infty$ but $(\ell^\infty)^*\ne\ell^1$; $c_0^*=\ell^1$ although $c_0\ne\ell^\infty$; $(L^1)^*=L^\infty$ but $(L^\infty)^*\ne L^1$. $\ell^1$, $c_0$, $\ell^\infty$, $L^1$, $C[a,b]$ are not reflexive.
- Hahn–Banach extensions are not unique in general: in $(\mathbb{R}^2,\|\cdot\|_\infty)$, $g(t,t)=t$ has the extensions $sx+(1-s)y$, $s\in[0,1]$ (unique in Hilbert spaces).
- Functionals extend, operators need not. Hahn–Banach extends scalar-valued functionals. The identity $c_0\to c_0$ has no bounded extension $\ell^\infty\to c_0$ (Phillips' theorem, quoted): $c_0$ is not complemented in $\ell^\infty$.
- Separation needs openness or compactness. $A=\{(x,y):x\gt0,\ y\ge1/x\}$ and $B=\{(x,0):x\in\mathbb{R}\}$ are disjoint closed convex sets in $\mathbb{R}^2$ at distance $0$; the line $y=0$ separates them, but no line separates them strictly.
- $X^*$ is always complete, even when $X$ is not: $(c_{00},\|\cdot\|_\infty)^*=\ell^1$ (via the completion $c_0$).
Exercises
- 1 Which of the following are norms on $\mathbb{R}^2$? (a) $|x|+2|y|$; (b) $\max(|x+y|,|x-y|)$; (c) $|x|^2+|y|$; (d) $\big(\sqrt{|x|}+\sqrt{|y|}\big)^2$; (e) $|x-y|$.
- 2 For $x=(1,-2,2)\in\mathbb{R}^3$ compute $\|x\|_1$, $\|x\|_2$ and $\|x\|_\infty$.
- 3 For which $\alpha\gt0$ is $(n^{-\alpha})$ in $\ell^3$? For which $p\in[1,\infty]$ is $(n^{-1/2})$ in $\ell^p$?
- 4 For which $p\in[1,\infty)$ is $f(x)=x^{-1/3}$ in $L^p[0,1]$? Compute $\|f\|_2$.
- 5 Show that $M=\{x\in\ell^\infty:x_1=x_2\}$ is a closed subspace of $\ell^\infty$ and $N=\{x\in\ell^2:\sum_nx_n/n=0\}$ is a closed subspace of $\ell^2$.
- 6 Prove that $N(f)=|f(0)|+\|f'\|_\infty$ is a norm on $C^1[0,1]$ equivalent to $\|f\|_{C^1}=\|f\|_\infty+\|f'\|_\infty$, and deduce that $(C^1[0,1],N)$ is a Banach space.
- 7 Prove that $\ell^1\subsetneq\ell^2$ and that the inclusion map $(\ell^1,\|\cdot\|_1)\to(\ell^2,\|\cdot\|_2)$ is bounded with norm $1$.
- 8 Use Theorem 8.2 to give a second proof that $\ell^1$ is complete.
- 9 Show that $C[0,1]$ with $\|f\|_2=\big(\int_0^1|f|^2\big)^{1/2}$ is not complete.
- 1 For $A=\begin{pmatrix}3&-1\\2&2\end{pmatrix}$ find $\|A\|_1$, $\|A\|_\infty$ and $\|A\|_2$.
- 2 On $\ell^2$ let $R(x_1,x_2,\dots)=(0,x_1,x_2,\dots)$ and $L(x_1,x_2,\dots)=(x_2,x_3,\dots)$. Find $\|R\|$, $\|L\|$, $LR$ and $RL$, and show that $L^nx\to0$ for every $x$ while $\|L^n\|=1$.
- 3 For a sequence $\lambda$ let $D_\lambda x=(\lambda_nx_n)$. Prove that $D_\lambda$ maps $\ell^p$ into itself boundedly if and only if $\lambda\in\ell^\infty$, and then $\|D_\lambda\|=\|\lambda\|_\infty$.
- 4 Find the norm of $(Tf)(x)=\int_0^1e^{x-t}f(t)\,dt$ on $C[0,1]$.
- 5 Find the norm of $\phi(f)=f(\tfrac12)-2f(1)$ on $C[0,1]$. Is it attained?
- 6 Find the norm of $\phi(f)=\int_0^1f(t)\,dt-f(0)$ on $C[0,1]$. Is it attained?
- 7 Prove that a linear functional $f$ on a normed space is bounded if and only if $\ker f$ is closed.
- 8 For $g\in C[0,1]$ let $M_gf=gf$ on $C[0,1]$. Prove $\|M_g\|=\|g\|_\infty$ and evaluate it for $g(x)=x-x^2$.
- 9 Let $X$ be a Banach space and $T\in B(X)$ with $\|T\|\lt1$. Prove that $I-T$ is invertible in $B(X)$, with $(I-T)^{-1}=\sum_{n\ge0}T^n$. Use it to solve $u(x)-\tfrac12\int_0^1xt\,u(t)\,dt=x$ in $C[0,1]$.
- 1 Find the norm of $\phi(x)=x_1-x_2+x_3$ on $\ell^1$, on $\ell^2$ and on $\ell^\infty$.
- 2 Let $\phi(x)=\sum_nx_n/n$. On which of the spaces $\ell^1$, $\ell^2$, $\ell^p$ ($1\lt p\lt\infty$), $c_0$ is $\phi$ a bounded functional? Find $\|\phi\|$ on $\ell^1$ and on $\ell^2$.
- 3 Find the norm of $\phi(x)=\sum_nx_n3^{-n}$ on $\ell^2$ and on $c_0$, and decide whether each is attained.
- 4 Find the norm of $x\mapsto x_1+x_2+x_3+x_4$ on $\ell^4$.
- 5 Show that $\lim:c\to\mathbb{F}$, $x\mapsto\lim_nx_n$, is a bounded functional of norm $1$, and that it is not of the form $x\mapsto\sum x_ny_n$ for any $y\in\ell^1$.
- 6 Which of the following are reflexive: $\ell^3$, $c_0$, $L^2[0,1]$, $\ell^1$, $C[0,1]$, $\mathbb{R}^5$ with $\|\cdot\|_\infty$?
- 7 Show that every $\phi\in(\ell^p)^*$ attains its norm when $1\lt p\lt\infty$, while $\varphi_y\in c_0^*$ ($y\in\ell^1$) attains its norm if and only if $y$ has only finitely many nonzero terms.
- 1 Let $M=\{(t,2t)\}\subseteq\mathbb{R}^2$. (a) With $\|\cdot\|_1$ on $\mathbb{R}^2$ and $g(t,2t)=3t$, find $\|g\|$ and all norm-preserving extensions. (b) With $\|\cdot\|_\infty$ and $g(t,2t)=2t$, do the same. Explain the answers with the shape of the unit balls.
- 2 Prove that if $x\in X$ and $f(x)=0$ for every $f\in X^*$, then $x=0$.
- 3 In $C[0,1]$ let $M=\{h:h(0)=0\}$. Find $\operatorname{dist}(\mathbf 1,M)$ and an explicit $f\in C[0,1]^*$ with $\|f\|=1$, $f|_M=0$ and $f(\mathbf 1)=\operatorname{dist}(\mathbf 1,M)$.
- 4 Prove that $\operatorname{dist}(x_0,\ker f)=|f(x_0)|/\|f\|$ for $f\in X^*\setminus\{0\}$. Compute $\operatorname{dist}(e_1,H)$ for $H=\{x:x_1+x_2+x_3=0\}$ in $\ell^1$, in $\ell^2$ and in $\ell^\infty$.
- 5 Show that the Minkowski functional of the open unit ball of a normed space is the norm, and compute the Minkowski functional of $C=\{(x,y):|x|\lt1,\ |y|\lt3\}$.
- 6 Prove that every finite-dimensional subspace $M$ of a normed space $X$ is complemented: there is a closed subspace $N$ with $X=M\oplus N$.
- 7 For $T\in B(X,Y)$ prove that $\|T\|$ equals the supremum of $|g(Tx)|$ over $\|x\|\le1$ and $g\in Y^*$ with $\|g\|\le1$, and deduce that the adjoint $T^*:Y^*\to X^*$, $T^*g=g\circ T$, has $\|T^*\|=\|T\|$.
- 8 In $(\mathbb{R}^2,\|\cdot\|_2)$ let $C$ be the closed unit disc and $x_0=(3,4)$. Find a unit vector $n$ such that $f(x)=n\cdot x$ strictly separates $x_0$ from $C$, and compute $\sup_Cf$ and $f(x_0)$.
E1. GATE MA · MCQ Let $\phi:C[0,1]\to\mathbb{R}$ be $\phi(f)=\int_0^1t\,f(t)\,dt-f(1)$, where $C[0,1]$ carries the sup norm. Then $\|\phi\|$ equals (A) $\tfrac12$ (B) $1$ (C) $\tfrac32$ (D) $2$.
E2. GATE MA · MCQ Which one of the following normed spaces is not a Banach space? (A) $\{x\in\ell^\infty:x_1=x_2\}$ with $\|\cdot\|_\infty$ (B) $c_0$ with $\|\cdot\|_\infty$ (C) the space of sequences with only finitely many nonzero terms, with $\|\cdot\|_1$ (D) $C[0,1]$ with $\|f\|=\max_{[0,1]}|f|+|f(0)|$.
E3. GATE MA · MSQ CSIR Part C Let $X$ be a normed space and $M$ a proper closed subspace of $X$. Which of the following statements are true? (One or more options may be correct.) (A) There is $f\in X^*$, $f\ne0$, with $f=0$ on $M$. (B) For every $x_0\notin M$ there is $f\in X^*$ with $\|f\|=1$, $f|_M=0$ and $f(x_0)=\operatorname{dist}(x_0,M)$. (C) Every $g\in M^*$ has exactly one extension $F\in X^*$ with $\|F\|=\|g\|$. (D) Every $f\in X^*$ attains its norm on the closed unit ball of $X$.
E4. GATE MA · MSQ Let $T:\ell^2\to\ell^2$ be $T(x_1,x_2,x_3,\dots)=\big(0,\,x_1,\,\tfrac{x_2}2,\,\tfrac{x_3}3,\dots\big)$. Which of the following are true? (One or more options may be correct.) (A) $\|T\|=1$. (B) $T$ is injective. (C) $T$ is surjective. (D) $\|T^2\|=\tfrac12$.
E5. GATE MA · NAT Let $\phi:\ell^{3/2}\to\mathbb{R}$, $\phi(x)=\sum_{n=1}^{\infty}x_n\,2^{-n}$. The value of $\|\phi\|$, correct to two decimal places, is ______.
E6. GATE MA · NAT On $C[0,1]$ with the sup norm let $(Tf)(x)=\int_0^1\sin\big(\pi(x+t)\big)f(t)\,dt$. The operator norm $\|T\|$, correct to three decimal places, is ______.
Suggested plan — 3 lectures × 60 min.
- Banach spaces. Definitions 8.1–8.2 with the "zoo" of spaces on the board; Hölder and Minkowski (Theorem 8.1) in full; Theorem 8.2 and the $\ell^p$ completeness proof (the template for every completeness proof); Riesz–Fischer as an application of MCT/DCT. Example 1 as a class poll ("complete or not?") and Example 2 for the inclusions. Project the chapter teaser (unit balls) for two minutes at the start.
- Operators and duals. Theorems 8.4–8.6; Example 3 with Interactive 1 (ask the class to predict where the maximum is reached before switching $p$); Example 4 — insist on the "smoothed sign" trick and on checking attainment; Theorem 8.7 with the extremal vector $|y_n|^{q-1}\overline{\operatorname{sgn}y_n}$; Example 5 done as rapid NAT drill.
- Hahn–Banach. Theorem 8.8 (Step 1 slowly, Zorn quickly), Theorem 8.9, Example 6 with Interactive 2 in extension mode at $p=\infty$, angle $45^\circ$; Theorem 8.10 (prove (1), (3), (4)); separation (Theorem 8.11) with the widget in separation mode; Example 7. End with GATE corner E3 and E6 live.
Discussion questions. (1) Why does the proof that $(\ell^p)^*=\ell^q$ break down for $p=\infty$, and which step uses $p\lt\infty$? (2) Hahn–Banach produces a functional on $\ell^\infty$ that vanishes on $c_0$; can you "write it down"? What does that say about proofs that use Zorn's lemma? (3) In $\mathbb{R}^2$, for which norms are all Hahn–Banach extensions unique? Relate the answer to corners of the unit ball.
Misconceptions to watch for. "Every linear map is continuous"; "$\ell^p$ gets smaller as $p$ grows" (it gets larger; $L^p[0,1]$ gets smaller); "the norm of a functional is always attained"; using $f\equiv1$ as the extremal function when the kernel changes sign; "the dual of $\ell^\infty$ is $\ell^1$"; "Hahn–Banach gives a unique extension"; forgetting that $X^*$ is complete even when $X$ is not.
Suggested homework. I(1, 3, 4, 6, 9), II(1, 2, 5, 6, 7, 9), III(1, 2, 3, 7), IV(1, 3, 4, 6); GATE corner E1, E4, E5.
Research question. How does the norm $\|A\|_{p}$ of a fixed matrix, acting on $(\mathbb{R}^n,\|\cdot\|_p)$, change as $p$ runs from $1$ to $\infty$ — and is there a hidden regularity in the curve?
Why it matters. Engineers who design digital filters, image-deblurring kernels or numerical schemes for PDEs need to know how much an operator can amplify a signal measured in different norms: $\ell^\infty$ (peak value, relevant for clipping in audio and for maximum stress in structures), $\ell^2$ (energy) or $\ell^1$ (total variation, used in compressed sensing for medical MRI). The Riesz–Thorin interpolation theorem says that $\log\|A\|_p$ is a convex function of $1/p$ — so the cheap end-point norms $\|A\|_1$ (column sums) and $\|A\|_\infty$ (row sums) control every $\|A\|_p$ in between.
What to do.
- Write a short program that estimates $\|A\|_p=\max_{\|x\|_p=1}\|Ax\|_p$ for a $2\times2$ matrix by sampling the unit sphere finely (parametrise as in Interactive 1), and for a $3\times3$ matrix by random search plus local refinement.
- For $A=\begin{pmatrix}1&2\\0&2\end{pmatrix}$ tabulate $\|A\|_p$ for $1/p=0,\tfrac14,\tfrac12,\tfrac34,1$ and plot $\log\|A\|_p$ against $1/p$. Check convexity (second differences) and the Riesz–Thorin bound $\|A\|_p\le\|A\|_1^{1/p}\|A\|_\infty^{1-1/p}$.
- For a symmetric matrix, show that $\|A\|_p=\|A\|_q$ for conjugate exponents (use $\|A^T\|_q=\|A\|_p$, a consequence of Exercise IV.7) and verify it numerically; where is the minimum of the curve?
- Repeat for a $1$-D blurring kernel (a circulant matrix with rows $\tfrac14,\tfrac12,\tfrac14$) and explain why its norm is $1$ for every $p$ (Young's inequality $\|k*x\|_p\le\|k\|_1\|x\|_p$).
Tools: Python with NumPy (or any language), a plotting tool.
Hand in: A one-page note with your table and plot, the convexity check, and one sentence explaining what an engineer gains from knowing $\|A\|_1$ and $\|A\|_\infty$ only.
Going further. Read about the Riesz–Thorin theorem and its proof by the three-lines lemma from complex analysis; computing $\|A\|_p$ exactly is NP-hard in general for $p\ne1,2,\infty$, which is why the interpolation bound matters in practice.
🧪 Self-check quiz
Q1. Which of these normed spaces is not complete?
Q2. The dual space of $\ell^3$ is (isometrically isomorphic to)
Q3. The norm of $f\mapsto f(0)+f(1)$ on $C[0,1]$ (sup norm) is
Q4. The Hahn–Banach theorem guarantees that
Q5. For a linear map $T$ between normed spaces, boundedness is equivalent to