Chapter 7 · Metric and Normed Spaces

7.4 Normed Linear Spaces and Spaces of Continuous Functions

Vector spaces with a length: $\ell^p$, $C[a,b]$ with $\|\cdot\|_\infty$ (complete) and $\|\cdot\|_1$ (not complete), why all norms on $\mathbb{R}^n$ are equivalent, bounded operators and their norms, and the two great theorems about $C(K)$ — Arzelà–Ascoli and Stone–Weierstrass.

In Chapter 5 we measured the distance between two functions by $\sup_x|f(x)-g(x)|$ and discovered that uniform convergence is just convergence in that distance. This is the starting point of functional analysis: a function is a point in a vector space, and the size of the point is measured by a norm. Once functions are points, the geometric language of Chapter 7 applies to them — open balls, Cauchy sequences, completeness, compactness — and familiar theorems become statements about these spaces: "a uniform limit of continuous functions is continuous" says that $C[a,b]$ is a closed subset of the bounded functions; the Weierstrass approximation theorem says that the polynomials are dense in $C[a,b]$.

The surprise is how different infinite-dimensional spaces are from $\mathbb{R}^n$. On $\mathbb{R}^n$ all norms are equivalent, every linear map is continuous, and closed bounded sets are compact. In $C[0,1]$ or $\ell^2$ every one of these statements fails, and the failures are exactly what CSIR NET tests: "is $(C[0,1],\|\cdot\|_1)$ complete?", "are these two norms equivalent?", "find the norm of this operator", "is the closed unit ball compact?", "which of these families has a uniformly convergent subsequence?". This section proves the positive results in full and builds the standard counterexamples alongside them.

Norms, Normed Spaces and Banach Spaces

Throughout, $\mathbb{F}$ denotes $\mathbb{R}$ or $\mathbb{C}$, and all vector spaces are over $\mathbb{F}$.

📘 Definition 7.21 — Norm, normed linear space, Banach space

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}$:

Definiteness$\|x\|=0\iff x=0$.
Homogeneity$\|\lambda x\|=|\lambda|\,\|x\|$.
Triangle inequality$\|x+y\|\le\|x\|+\|y\|$.

A function satisfying the last two properties (but possibly $\|x\|=0$ for some $x\ne0$) is a seminorm. A normed linear space $(X,\|\cdot\|)$ is a vector space with a norm; it is a metric space with the induced metric $d(x,y)=\|x-y\|$. A normed space that is complete in this metric is a Banach space.

📐 Theorem 7.32 — Basic properties of normed spaces
Let $(X,\|\cdot\|)$ be a normed space.
  1. $\big|\|x\|-\|y\|\big|\le\|x-y\|$; so the norm is a $1$-Lipschitz, hence continuous, function on $X$.
  2. Addition $X\times X\to X$ and scalar multiplication $\mathbb{F}\times X\to X$ are continuous: if $x_n\to x$, $y_n\to y$, $\lambda_n\to\lambda$, then $x_n+y_n\to x+y$ and $\lambda_nx_n\to\lambda x$.
  3. The induced metric is translation invariant, $d(x+z,y+z)=d(x,y)$, and homogeneous, $d(\lambda x,\lambda y)=|\lambda|\,d(x,y)$. Conversely, a metric on a vector space with these two properties is induced by the norm $\|x\|=d(x,0)$.
  4. Every ball is convex, $B(x,r)=x+rB(0,1)$, and if $X\ne\{0\}$ the closure of the open ball $B(x,r)$ is the closed ball $\{y:\|y-x\|\le r\}$. A metric induced by a norm on $X\ne\{0\}$ is unbounded.

Proof. (1) $\|x\|=\|(x-y)+y\|\le\|x-y\|+\|y\|$, so $\|x\|-\|y\|\le\|x-y\|$; exchange $x$ and $y$. (2) $\|(x_n+y_n)-(x+y)\|$ is at most $\|x_n-x\|+\|y_n-y\|\to0$, and $\|\lambda_nx_n-\lambda x\|$ is at most $|\lambda_n|\,\|x_n-x\|+|\lambda_n-\lambda|\,\|x\|\to0$, as $(\lambda_n)$ is bounded. (3) The two identities follow from $\|(x+z)-(y+z)\|=\|x-y\|$ and $\|\lambda x-\lambda y\|=|\lambda|\|x-y\|$. Conversely, given such a $d$, the function $\|x\|=d(x,0)$ is definite, $\|\lambda x\|=d(\lambda x,\lambda0)=|\lambda|\|x\|$, and $\|x+y\|=d(x+y,0)$ is at most $d(x+y,y)+d(y,0)=d(x,0)+d(y,0)$, while $d(x,y)=d(x-y,0)=\|x-y\|$. (4) If $\|y_1-x\|,\|y_2-x\|\lt r$ and $0\le t\le1$ then $\|(1-t)y_1+ty_2-x\|$ is at most $(1-t)\|y_1-x\|+t\|y_2-x\|\lt r$. If $\|y-x\|=r$, the points $x+(1-\tfrac1n)(y-x)$ lie in $B(x,r)$ and converge to $y$; the closed ball is closed by (1). Finally $d(tx,0)=|t|\,\|x\|\to\infty$ for $x\ne0$. ∎

Part (4) is often the quickest test: the discrete metric, and $\frac{|x-y|}{1+|x-y|}$ on $\mathbb{R}$, are bounded metrics, so they come from no norm. And in the discrete metric the closure of the open ball $B(x,1)=\{x\}$ is $\{x\}$, not the closed ball $X$ — a phenomenon that never happens in a normed space.

✏️ Example 1 — The standard normed spaces, and some impostors
(a) List the standard norms on $\mathbb{F}^n$, on sequence spaces and on $C[a,b]$. (b) Which of the following are norms? (i) $N(x,y)=\big(\sqrt{|x|}+\sqrt{|y|}\big)^2$ on $\mathbb{R}^2$; (ii) $N(x,y)=\max(|x|,|x-y|)$ on $\mathbb{R}^2$; (iii) $N(f)=\sup_{[0,1]}|f'|$ on $C^1[0,1]$; (iv) $N(f)=|f(0)|+\sup_{[0,1]}|f'|$ on $C^1[0,1]$; (v) $N(f)=\int_0^1x|f(x)|\,dx$ on $C[0,1]$.
(a) $\mathbb{F}^n$ $\|x\|_p=\big(\sum_{i=1}^n|x_i|^p\big)^{1/p}$ for $1\le p\lt\infty$ and $\|x\|_\infty=\max_i|x_i|$. The triangle inequality for $\|\cdot\|_p$ is Minkowski's inequality (§7.1); for $p=1,\infty$ it follows from $|x_i+y_i|\le|x_i|+|y_i|$.
(a) Sequences $\ell^p=\{x=(x_n):\sum|x_n|^p\lt\infty\}$ with $\|x\|_p=(\sum|x_n|^p)^{1/p}$ ($1\le p\lt\infty$); $\ell^\infty$ = bounded sequences with $\|x\|_\infty=\sup_n|x_n|$; inside $\ell^\infty$, the null sequences $c_0$ and the finitely supported sequences $c_{00}$. Note $c_{00}\subseteq\ell^1\subseteq\ell^2\subseteq c_0\subseteq\ell^\infty$, all inclusions strict ($\tfrac1n\in\ell^2\setminus\ell^1$).
(a) Functions On $C[a,b]$: $\|f\|_\infty=\max|f|$ (the sup norm of §5.1), $\|f\|_1=\int_a^b|f|$, $\|f\|_2=\big(\int_a^b|f|^2\big)^{1/2}$. Definiteness of $\|\cdot\|_1$ uses continuity: if $f(x_0)\ne0$, then $|f|\gt\tfrac12|f(x_0)|$ on an interval around $x_0$ and $\int|f|\gt0$. On $C^1[a,b]$: $\|f\|_{C^1}=\|f\|_\infty+\|f'\|_\infty$.
(b) (i) No: $N(1,0)=N(0,1)=1$ but $N(1,1)=4\gt2$. Its unit ball is the non-convex "star" $\sqrt{|x|}+\sqrt{|y|}\le1$ (the $p=\tfrac12$ ball of Interactive 1). (ii) Yes: $|x|$ and $|x-y|$ are seminorms, a maximum of seminorms is a seminorm, and $N=0$ forces $x=0$ and then $y=0$. (Its unit ball is a parallelogram.) (iii) No, only a seminorm: $N(1)=0$. (iv) Yes: if $N(f)=0$ then $f'\equiv0$, so $f$ is constant, equal to $f(0)=0$. (v) Yes: if $\int_0^1x|f(x)|\,dx=0$, the continuous non-negative integrand vanishes, so $f=0$ on $(0,1]$, and $f(0)=0$ by continuity.
📐 Theorem 7.33 — $C(K)$, $\ell^\infty$ and $\ell^p$ are Banach spaces
(a) Let $K$ be a compact metric space (e.g. $K=[a,b]$). Then $C(K)$, the space of continuous $f:K\to\mathbb{F}$, is a Banach space under $\|f\|_\infty=\max_K|f|$. (b) $\ell^\infty$ and $\ell^p$ ($1\le p\lt\infty$) are Banach spaces, and $c_0$ is a closed subspace of $\ell^\infty$.

Proof. (a) $\|f\|_\infty$ is finite because a continuous function on a compact set is bounded (§7.2), and the norm axioms are those of the sup norm (§5.1). Let $(f_n)$ be Cauchy: for $\varepsilon\gt0$ there is $N$ with $|f_n(x)-f_m(x)|\le\|f_n-f_m\|_\infty\lt\varepsilon$ for all $m,n\ge N$ and all $x$. So $(f_n)$ is uniformly Cauchy; by the Cauchy criterion (§5.1) it converges uniformly to some $f$, and $f$ is continuous because uniform limits of continuous functions are continuous (§5.2; the $\varepsilon/3$ proof works verbatim on a metric space). Uniform convergence is $\|f_n-f\|_\infty\to0$.

(b) Let $x^{(k)}=(x^{(k)}_n)_n$ be Cauchy in $\ell^p$. For each fixed $n$, $|x^{(k)}_n-x^{(m)}_n|\le\|x^{(k)}-x^{(m)}\|_p$, so the $n$-th coordinates form a Cauchy sequence in $\mathbb{F}$ with a limit $x_n$. Given $\varepsilon\gt0$ choose $N$ with $\|x^{(k)}-x^{(m)}\|_p\lt\varepsilon$ for $k,m\ge N$. For every finite $M$, $$\sum_{n=1}^M|x^{(k)}_n-x^{(m)}_n|^p\lt\varepsilon^p\quad(k,m\ge N).$$ Let $m\to\infty$ (a finite sum of continuous functions): $\sum_{n\le M}|x^{(k)}_n-x_n|^p\le\varepsilon^p$; now let $M\to\infty$: $\|x^{(k)}-x\|_p\le\varepsilon$ for $k\ge N$. In particular $x^{(N)}-x\in\ell^p$, so $x=x^{(N)}-(x^{(N)}-x)\in\ell^p$ (Minkowski), and $x^{(k)}\to x$ in $\ell^p$. The same argument with $\sup_{n\le M}$ in place of the sum handles $\ell^\infty$. Finally, if $x^{(k)}\in c_0$ and $x^{(k)}\to x$ in $\ell^\infty$, then given $\varepsilon$ fix $k$ with $\|x^{(k)}-x\|_\infty\lt\varepsilon$; since $x^{(k)}_n\to0$, $|x_n|\lt2\varepsilon$ for large $n$. So $x\in c_0$: $c_0$ is closed, hence complete. ∎

📐 Theorem 7.34 — Completeness via absolutely convergent series
A normed space $X$ is a Banach space if and only if every absolutely convergent series converges, i.e. $\sum_{n}\|x_n\|\lt\infty$ implies that $\sum_n x_n$ converges in $X$. In that case $\big\|\sum x_n\big\|\le\sum\|x_n\|$.

Proof. ($\Rightarrow$) The partial sums $s_N=\sum_{n\le N}x_n$ satisfy $\|s_M-s_N\|\le\sum_{N\lt n\le M}\|x_n\|$, which is small for large $N\lt M$ because $\sum\|x_n\|$ converges. So $(s_N)$ is Cauchy and converges. The inequality follows from $\|s_N\|\le\sum_{n\le N}\|x_n\|$ and continuity of the norm.

($\Leftarrow$) Let $(y_n)$ be Cauchy. Choose $n_1\lt n_2\lt\cdots$ with $\|y_m-y_n\|\lt2^{-k}$ for $m,n\ge n_k$. The series $y_{n_1}+\sum_{k\ge1}(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 $(y_n)$ has a convergent subsequence, and a Cauchy sequence with a convergent subsequence converges to the same limit (§7.1). ∎

This criterion is the natural tool for $L^1$-type spaces (it is how the completeness of $L^1$ is proved, §4.5), and it gives the Weierstrass M-test a one-line proof: in the Banach space of bounded functions on $D$ with the sup norm, $\sum\|u_n\|_\infty\lt\infty$ implies that $\sum u_n$ converges in that norm, i.e. uniformly.

📐 Theorem 7.35 — $(C[0,1],\|\cdot\|_1)$ is not complete
The space $C[0,1]$ with $\|f\|_1=\int_0^1|f|$ is a normed space that is not a Banach space. (Its completion is $L^1[0,1]$, §4.5.)

Proof. Let $f_n(x)=\min\big(1,\max(0,n(x-\tfrac12))\big)$: $0$ on $[0,\tfrac12]$, rising linearly to $1$ on $[\tfrac12,\tfrac12+\tfrac1n]$, then $1$. For $m\gt n$ the functions $f_n\le f_m$ differ only on $[\tfrac12,\tfrac12+\tfrac1n]$, and $$\|f_m-f_n\|_1=\tfrac12\Big(\tfrac1n-\tfrac1m\Big)\lt\tfrac1{2n},$$ so $(f_n)$ is Cauchy. Suppose $\|f_n-f\|_1\to0$ for some $f\in C[0,1]$. Then $\int_0^{1/2}|f|=\int_0^{1/2}|f_n-f|\le\|f_n-f\|_1\to0$, so $\int_0^{1/2}|f|=0$ and $f=0$ on $[0,\tfrac12]$. For $\delta\gt0$ and $n\gt1/\delta$, $f_n=1$ on $[\tfrac12+\delta,1]$, so $\int_{1/2+\delta}^1|1-f|\le\|f_n-f\|_1\to0$, and $f=1$ on $[\tfrac12+\delta,1]$. As $\delta$ is arbitrary, $f=1$ on $(\tfrac12,1]$, and $f$ is discontinuous at $\tfrac12$ — a contradiction. ∎

The same sequence is Cauchy in $\|\cdot\|_2$ (with $\|f_m-f_n\|_2^2\le\tfrac1n$), so $(C[0,1],\|\cdot\|_2)$ is not complete either. But it is not Cauchy in $\|\cdot\|_\infty$: $\|f_{2n}-f_n\|_\infty=\tfrac12$. One vector space, three norms, and completeness depends on the norm.

✏️ Example 2 — Complete or not?
Decide whether each normed space is complete: (a) $c_{00}$ with $\|\cdot\|_\infty$; (b) the polynomials $\mathcal{P}[0,1]$ with $\|\cdot\|_\infty$; (c) $C^1[0,1]$ with $\|\cdot\|_\infty$; (d) $C^1[0,1]$ with $\|f\|_{C^1}=\|f\|_\infty+\|f'\|_\infty$; (e) $\{f\in C[0,1]:f(0)=0\}$ with $\|\cdot\|_\infty$.
Principle A subspace of a Banach space is complete iff it is closed (complete subsets of a metric space are closed, closed subsets of a complete space are complete — §7.1). So decide whether each space is closed in a bigger Banach space.
(a) No $x^{(k)}=(1,\tfrac12,\dots,\tfrac1k,0,0,\dots)\in c_{00}$ converges in $\ell^\infty$ to $(\tfrac1n)_n\notin c_{00}$, since $\|x^{(k)}-(\tfrac1n)\|_\infty=\tfrac1{k+1}$. So $c_{00}$ is not closed in $\ell^\infty$; its closure is $c_0$.
(b) No The Taylor polynomials $p_k(x)=\sum_{j\le k}x^j/j!$ converge uniformly on $[0,1]$ to $e^x$ (remainder $\le e/(k+1)!$), and $e^x$ is not a polynomial (all its derivatives are nonzero). By Weierstrass (§5.2), the closure of $\mathcal{P}[0,1]$ is all of $C[0,1]$.
(c) No $g_n(x)=\sqrt{(x-\tfrac12)^2+\tfrac1{n^2}}\in C^1[0,1]$ and $0\le g_n(x)-|x-\tfrac12|\le\tfrac1n$, so $g_n\to|x-\tfrac12|\notin C^1$ uniformly.
(d) Yes If $(f_n)$ is Cauchy in $\|\cdot\|_{C^1}$, then $(f_n)$ and $(f_n')$ are uniformly Cauchy, with uniform limits $f$ and $g$ (both continuous). By the theorem on differentiating uniformly convergent sequences (§5.2), $f$ is differentiable with $f'=g$; so $f\in C^1$ and $\|f_n-f\|_{C^1}\to0$.
(e) Yes It is the zero set of the continuous map $f\mapsto f(0)$ (continuous because $|f(0)-g(0)|\le\|f-g\|_\infty$), so it is closed in the Banach space $C[0,1]$.

Equivalent Norms; Finite-Dimensional Spaces

📘 Definition 7.22 — Equivalent norms
Two norms $\|\cdot\|$ and $\|\cdot\|'$ on the same vector space $X$ are equivalent if there are constants $0\lt c\le C$ with $$c\|x\|\le\|x\|'\le C\|x\|\quad\text{for all }x\in X.$$
📐 Theorem 7.36 — What equivalence means
For two norms on $X$ the following are equivalent: (1) they are equivalent; (2) they have the same open sets; (3) they have the same convergent sequences (with the same limits); (4) a sequence tends to $0$ in one norm iff it does in the other. Equivalent norms have the same Cauchy sequences, the same bounded sets and the same compact sets, and one is complete iff the other is.

Proof. (1)$\Rightarrow$(2): $B'(x,cr)\subseteq B(x,r)$ and $B(x,r/C)\subseteq B'(x,r)$, where $B'$ denotes $\|\cdot\|'$-balls; so every $\|\cdot\|$-open set is $\|\cdot\|'$-open and conversely. (2)$\Rightarrow$(3): convergence is defined by open sets ($x_n\to x$ iff every open set containing $x$ contains $x_n$ for large $n$). (3)$\Rightarrow$(4) is a special case. (4)$\Rightarrow$(1): suppose there is no $C$ with $\|x\|'\le C\|x\|$. Then for each $n$ there is $x_n$ with $\|x_n\|'\gt n\|x_n\|$; put $y_n=x_n/(\sqrt n\,\|x_n\|)$ (note $x_n\ne0$). Then $\|y_n\|=1/\sqrt n\to0$ but $\|y_n\|'\gt\sqrt n\to\infty$, contradicting (4). The lower bound is symmetric. The final statements follow because the inequalities in (1) transfer Cauchy sequences and bounded sets, and compactness depends only on convergent sequences. ∎

📐 Theorem 7.37 — All norms on a finite-dimensional space are equivalent
If $X$ is a finite-dimensional vector space, any two norms on $X$ are equivalent.

Proof. Fix a basis $e_1,\dots,e_n$ and write $x=\sum a_ie_i$. Then $\|x\|_*=\sum_i|a_i|$ is a norm on $X$. Since equivalence of norms is an equivalence relation (compose the inequalities), it suffices to show that an arbitrary norm $\|\cdot\|$ is equivalent to $\|\cdot\|_*$.

Upper bound. $\|x\|\le\sum|a_i|\,\|e_i\|\le M\|x\|_*$ with $M=\max_i\|e_i\|$.

Lower bound. Consider $g(a)=\big\|\sum a_ie_i\big\|$ on $\mathbb{F}^n$ (with the Euclidean metric, $\mathbb{F}^n=\mathbb{R}^n$ or $\mathbb{C}^n\cong\mathbb{R}^{2n}$). By the upper bound and Theorem 7.32(1), $|g(a)-g(b)|\le M\sum|a_i-b_i|$, so $g$ is continuous. The set $S=\{a:\sum|a_i|=1\}$ is closed and bounded in $\mathbb{F}^n$, hence compact (Heine–Borel, §7.2). So $g$ attains a minimum $m$ on $S$ (extreme value theorem, §7.2), and $m\gt0$ because $g(a)=0$ would mean $\sum a_ie_i=0$ with $a\ne0$, contradicting linear independence. For $x\ne0$, $a/\|x\|_*\in S$, so $\|x\|=\|x\|_*\,g(a/\|x\|_*)\ge m\|x\|_*$. ∎

📐 Theorem 7.38 — Consequences of finite dimension
Let $X$ be a finite-dimensional normed space.
  1. $X$ is complete (a Banach space).
  2. Every finite-dimensional subspace of any normed space is closed.
  3. (Heine–Borel) A subset of $X$ is compact iff it is closed and bounded.
  4. Every linear map $T$ from $X$ to any normed space $Y$ is continuous (indeed Lipschitz).

Proof. By Theorem 7.37 we may use $\|x\|_*=\sum|a_i|$ for the norm of $X$. (1) If $(x^{(k)})$ is Cauchy, each coordinate sequence $(a^{(k)}_i)_k$ is Cauchy in $\mathbb{F}$ (as $|a_i|\le\|x\|_*$), with limit $a_i$; then $x=\sum a_ie_i$ satisfies $\|x^{(k)}-x\|_*=\sum_i|a^{(k)}_i-a_i|\to0$. (2) A finite-dimensional subspace $Y$ of a normed space $Z$ is complete in the restricted norm by (1), and a complete subset of a metric space is closed. (3) The coordinate map $x\mapsto(a_1,\dots,a_n)$ is a bijection $X\to\mathbb{F}^n$ which, by Theorem 7.37, distorts distances by at most constant factors in both directions; so it preserves closedness, boundedness and compactness, and Heine–Borel in $\mathbb{F}^n$ applies. (4) $\|Tx\|=\|\sum a_iTe_i\|\le\big(\max_i\|Te_i\|\big)\|x\|_*$; apply Theorem 7.39 below. ∎

✏️ Example 3 — Comparing $\|\cdot\|_1$, $\|\cdot\|_2$, $\|\cdot\|_\infty$
(a) Prove that for $x\in\mathbb{R}^n$, $$\|x\|_\infty\le\|x\|_2\le\|x\|_1\le\sqrt n\,\|x\|_2\le n\|x\|_\infty,$$ and that each constant is best possible. Evaluate all three norms and $\|x\|_3$ for $x=(3,-4,12)$. (b) On $C[0,1]$, show $\|f\|_1\le\|f\|_2\le\|f\|_\infty$ but that no two of these norms are equivalent.
(a) Chain $\max|x_i|^2\le\sum|x_i|^2$; $\big(\sum|x_i|\big)^2=\sum|x_i|^2+\sum_{i\ne j}|x_i||x_j|\ge\sum|x_i|^2$; Cauchy–Schwarz with $(1,\dots,1)$: $\sum|x_i|\le\sqrt n\big(\sum|x_i|^2\big)^{1/2}$; and $\sum|x_i|^2\le n\max|x_i|^2$.
(a) Sharpness For $x=e_1$ the first two inequalities are equalities ($1=1=1$); for $x=(1,\dots,1)$ the last two are ($n=\sqrt n\cdot\sqrt n=n\cdot1$). So $\|x\|_\infty\le\|x\|_1\le n\|x\|_\infty$ with best constants $1$ and $n$ — the ratio of the constants grows with the dimension, a first hint of what happens in infinite dimensions.
(a) Numbers $x=(3,-4,12)$: $\|x\|_1=19$, $\|x\|_2=\sqrt{9+16+144}=13$, $\|x\|_\infty=12$, $\|x\|_3=(27+64+1728)^{1/3}=1819^{1/3}\approx12.207$. Check the chain: $12\le13\le19\le\sqrt3\cdot13\approx22.52\le36$. Note $\|x\|_p$ decreases from $19$ towards $12$ as $p$ increases (Exercise II.6).
(b) $\int|f|\le\big(\int|f|^2\big)^{1/2}\big(\int1\big)^{1/2}$ by Cauchy–Schwarz, and $\int|f|^2\le\max|f|^2$. For $f_n(x)=x^n$: $\|f_n\|_\infty=1$, $\|f_n\|_2=\tfrac1{\sqrt{2n+1}}$, $\|f_n\|_1=\tfrac1{n+1}$. The ratios $\|f_n\|_\infty/\|f_n\|_2=\sqrt{2n+1}$ and $\|f_n\|_2/\|f_n\|_1=\tfrac{n+1}{\sqrt{2n+1}}$ are unbounded, so no reverse inequality $\|f\|_\infty\le C\|f\|_2$ or $\|f\|_2\le C\|f\|_1$ can hold. Equivalently: $x^n\to0$ in $\|\cdot\|_1$ and $\|\cdot\|_2$ but not in $\|\cdot\|_\infty$ (Theorem 7.36(4)).
Interactive 1 — Unit Balls of $\|\cdot\|_p$ in the Plane

The purple region is the unit ball $\{x:\|x\|_p\le1\}$ of $\|x\|_p=(|x_1|^p+|x_2|^p)^{1/p}$; for reference the balls of $\|\cdot\|_1$ (red diamond), $\|\cdot\|_2$ (blue circle) and $\|\cdot\|_\infty$ (green square) are outlined. The dashed purple square of half-side $2^{-1/p}$ always fits inside the purple ball, which always fits inside the green square: that is the equivalence $\|x\|_\infty\le\|x\|_p\le2^{1/p}\|x\|_\infty$. Rotate the direction $x$ (Play) and watch the norms. Drag $p$ below $1$: the ball stops being convex and $\|\cdot\|_p$ is no longer a norm.

p—
‖x‖₁—
‖x‖₂—
‖x‖∞—
‖x‖_p and ‖x‖_p / ‖x‖∞—

In infinite dimensions the theorem fails completely: Example 3(b) gives three pairwise non-equivalent norms on $C[0,1]$, and on any infinite-dimensional space one can construct a norm not equivalent to a given one. Correspondingly, Theorem 7.38(2)–(4) all fail: $c_{00}$ is a non-closed subspace of $\ell^\infty$, the closed unit ball of $\ell^2$ is closed and bounded but not compact (Theorem 7.43), and there are discontinuous linear maps (Example 5).

Bounded Linear Operators and the Operator Norm

📘 Definition 7.23 — Bounded linear operator; operator norm; dual space

Let $X,Y$ be normed spaces. A linear map $T:X\to Y$ is bounded if there is $M\ge0$ with $\|Tx\|\le M\|x\|$ for all $x\in X$. The operator norm of a bounded $T$ is $$\|T\|=\sup_{\|x\|\le1}\|Tx\|=\sup_{x\ne0}\frac{\|Tx\|}{\|x\|},$$ the smallest admissible $M$ (and, if $X\ne\{0\}$, also $\sup_{\|x\|=1}\|Tx\|$). The bounded operators form the space $B(X,Y)$; we write $B(X)=B(X,X)$. A bounded linear map $X\to\mathbb{F}$ is a bounded linear functional, and $X^*=B(X,\mathbb{F})$ is the dual space.

"Bounded" here does not mean that $T(X)$ is a bounded set (only $T=0$ has that property); it means that $T$ maps bounded sets to bounded sets.

📐 Theorem 7.39 — Bounded $\iff$ continuous
For a linear map $T:X\to Y$ between normed spaces the following are equivalent: (1) $T$ is continuous at $0$; (2) $T$ is continuous; (3) $T$ is Lipschitz (hence uniformly continuous); (4) $T$ is bounded. Then $\|Tx-Ty\|\le\|T\|\,\|x-y\|$.

Proof. (4)$\Rightarrow$(3): $\|Tx-Ty\|=\|T(x-y)\|\le\|T\|\,\|x-y\|$. (3)$\Rightarrow$(2)$\Rightarrow$(1) is clear. (1)$\Rightarrow$(4): with $\varepsilon=1$ there is $\delta\gt0$ such that $\|x\|\le\delta$ implies $\|Tx\|=\|Tx-T0\|\le1$. For $x\ne0$, the vector $\delta x/\|x\|$ has norm $\delta$, so $$\|Tx\|=\frac{\|x\|}{\delta}\Big\|T\Big(\frac{\delta x}{\|x\|}\Big)\Big\|\le\frac1\delta\|x\|.$$ So $T$ is bounded with $\|T\|\le1/\delta$. ∎

📐 Theorem 7.40 — The space $B(X,Y)$; Neumann series
  1. The operator norm is a norm on $B(X,Y)$, and $\|ST\|\le\|S\|\,\|T\|$ for $T\in B(X,Y)$, $S\in B(Y,Z)$.
  2. If $Y$ is a Banach space, so is $B(X,Y)$. In particular the dual $X^*$ of every normed space is a Banach space.
  3. (Neumann series) If $X$ is a Banach space, $T\in B(X)$ and $\sum_n\|T^n\|\lt\infty$ (e.g. $\|T\|\lt1$), then $I-T$ is invertible in $B(X)$ with $(I-T)^{-1}=\sum_{n\ge0}T^n$; if $\|T\|\lt1$, then $\|(I-T)^{-1}\|\le\dfrac1{1-\|T\|}$.

Proof. (1) $\|(S+T)x\|\le\|Sx\|+\|Tx\|\le(\|S\|+\|T\|)\|x\|$ and $\|(\lambda T)x\|=|\lambda|\|Tx\|$ give the triangle inequality and homogeneity; $\|T\|=0$ forces $Tx=0$ for all $x$. Also $\|STx\|\le\|S\|\|Tx\|\le\|S\|\|T\|\|x\|$.

(2) 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 sums and scalar multiples). Given $\varepsilon\gt0$ choose $N$ with $\|T_n-T_m\|\lt\varepsilon$ for $m,n\ge N$; then $\|T_nx-T_mx\|\le\varepsilon\|x\|$, and letting $m\to\infty$, $\|T_nx-Tx\|\le\varepsilon\|x\|$ for all $x$ and $n\ge N$. Hence $T_n-T$ is bounded, so $T=T_n-(T_n-T)$ is bounded, and $\|T_n-T\|\le\varepsilon$ for $n\ge N$. $\mathbb{F}$ is complete, so $X^*$ is a Banach space.

(3) $B(X)$ is a Banach space by (2), so the absolutely convergent series $S=\sum T^n$ converges (Theorem 7.34). With $S_N=\sum_{n\le N}T^n$ we have $(I-T)S_N=S_N(I-T)=I-T^{N+1}$, and $\|T^{N+1}\|\to0$ (terms of a convergent series). Letting $N\to\infty$ (multiplication is continuous by (1)): $(I-T)S=S(I-T)=I$. If $\|T\|\lt1$, $\|S\|\le\sum\|T\|^n=\frac1{1-\|T\|}$. ∎

📐 Theorem 7.41 — Norms of matrices and of integral operators
  1. Let $A=(a_{ij})$ be an $m\times n$ matrix, viewed as a map $\mathbb{F}^n\to\mathbb{F}^m$. Then the largest column sum $$\|A\|_{1\to1}=\max_j\sum_i|a_{ij}|,$$ the largest row sum $$\|A\|_{\infty\to\infty}=\max_i\sum_j|a_{ij}|,$$ and the largest singular value $$\|A\|_{2\to2}=\sqrt{\lambda_{\max}(A^*A)}.$$ Every eigenvalue $\lambda$ of a square $A$ satisfies $|\lambda|\le\|A\|$ for each of these norms.
  2. Let $K:[0,1]^2\to\mathbb{R}$ be continuous and $(\mathcal{K}f)(x)=\int_0^1K(x,t)f(t)\,dt$. Then $\mathcal{K}$ maps $C[0,1]$ into itself and, with the sup norm, $$\|\mathcal{K}\|\le\kappa:=\max_{x\in[0,1]}\int_0^1|K(x,t)|\,dt,$$ with equality when $K\ge0$ (or $K\le0$). (Equality holds for every continuous kernel; see Exercise III.8.)

Proof. (1) Let $c_j=\sum_i|a_{ij}|$ and $r_i=\sum_j|a_{ij}|$. Then $\|Ax\|_1=\sum_i\big|\sum_ja_{ij}x_j\big|$ is at most $\sum_j|x_j|c_j\le(\max_jc_j)\|x\|_1$, with equality at $x=e_{j_0}$ for a column $j_0$ of largest sum. Next $|(Ax)_i|\le\sum_j|a_{ij}||x_j|\le r_i\|x\|_\infty$, with equality in row $i_0$ of largest sum for $x_j=\overline{\operatorname{sgn}a_{i_0j}}$ (a vector with $\|x\|_\infty\le1$). For the $2$-norm, $A^*A$ is Hermitian and positive semidefinite, so by the spectral theorem (§10.2) it has an orthonormal eigenbasis $v_k$ with eigenvalues $\mu_k\ge0$; for $x=\sum c_kv_k$, $\|Ax\|_2^2=\langle A^*Ax,x\rangle=\sum\mu_k|c_k|^2\le\mu_{\max}\|x\|_2^2$, with equality at an eigenvector for $\mu_{\max}$. If $Av=\lambda v$ with $v\ne0$, then $|\lambda|\|v\|=\|Av\|\le\|A\|\|v\|$.

(2) $K$ is uniformly continuous on the compact square (§7.2), so $|\mathcal{K}f(x)-\mathcal{K}f(y)|$ is at most $\|f\|_\infty\max_t|K(x,t)-K(y,t)|$, which tends to $0$ as $y\to x$: $\mathcal{K}f$ is continuous. For every $x$, $|\mathcal{K}f(x)|\le\int_0^1|K(x,t)|\,|f(t)|\,dt\le\kappa\|f\|_\infty$, so $\|\mathcal{K}\|\le\kappa$. If $K\ge0$, take $f\equiv1$: $\mathcal{K}1(x)=\int_0^1K(x,t)\,dt$, whose maximum is $\kappa$; so $\|\mathcal{K}\|\ge\kappa$. ∎

✏️ Example 4 — Computing operator norms
(a) For $A=\begin{pmatrix}1&-2\\3&4\end{pmatrix}$ find $\|A\|_{1\to1}$, $\|A\|_{\infty\to\infty}$, $\|A\|_{2\to2}$ and compare with the eigenvalues. (b) The Volterra operator on $(C[0,1],\|\cdot\|_\infty)$ is $(Vf)(x)=\int_0^xf(t)\,dt$. Find $\|V\|$ and $\|V^n\|$, and deduce that $I-V$ is invertible. (c) Find the norm of $(\mathcal{K}f)(x)=\int_0^1(x-t)f(t)\,dt$ on $(C[0,1],\|\cdot\|_\infty)$. (d) For $g\in C[0,1]$ find the norm of the multiplication operator $M_gf=gf$.
(a) Column sums $1+3=4$, $2+4=6$: $\|A\|_{1\to1}=6$. Row sums $1+2=3$, $3+4=7$: $\|A\|_{\infty\to\infty}=7$. $A^TA=\begin{pmatrix}10&10\\10&20\end{pmatrix}$ has eigenvalues $15\pm5\sqrt5$, so $\|A\|_{2\to2}=\sqrt{15+5\sqrt5}\approx5.1167$. The eigenvalues of $A$ are $\tfrac{5\pm i\sqrt{15}}{2}$, of modulus $\sqrt{\det A}=\sqrt{10}\approx3.162$ — smaller than all three norms, as Theorem 7.41 predicts. (Checked numerically.)
(b) $V$ has the kernel $K(x,t)=\mathbf 1_{t\le x}\ge0$ (discontinuous on the diagonal, but the estimate of Theorem 7.41(2) goes through): $|Vf(x)|\le x\|f\|_\infty$, with equality for $f\equiv1$ at $x=1$. So $\|V\|=1$. By induction (Cauchy's formula for repeated integrals) $(V^nf)(x)=\int_0^x\frac{(x-t)^{n-1}}{(n-1)!}f(t)\,dt$, a non-negative kernel with $\max_x\int_0^x\frac{(x-t)^{n-1}}{(n-1)!}dt=\max_x\frac{x^n}{n!}=\frac1{n!}$. So $\|V^n\|=\frac1{n!}$, and $\sum\|V^n\|=e\lt\infty$: by Theorem 7.40(3), $I-V$ is invertible. Concretely, $(I-V)u=f$ is the integral equation $u(x)-\int_0^xu=f(x)$, solved by $u=\sum V^nf$ — for $f\equiv1$, $u=\sum\frac{x^n}{n!}=e^x$.
(c) $\int_0^1|x-t|\,dt=\frac{x^2}2+\frac{(1-x)^2}2$, maximal at $x=0$ and $x=1$ with value $\frac12$. So $\|\mathcal{K}\|\le\frac12$. Although the kernel changes sign, $f\equiv1$ gives $\mathcal{K}1(x)=x-\frac12$, of sup norm $\frac12$. Hence $\|\mathcal{K}\|=\frac12$.
(d) $\|gf\|_\infty\le\|g\|_\infty\|f\|_\infty$, and $f\equiv1$ gives equality: $\|M_g\|=\|g\|_\infty$.
✏️ Example 5 — Unbounded functionals and norms that are not attained: prove or disprove
(a) The evaluation $\delta_0(f)=f(0)$ is a bounded functional on $(C[0,1],\|\cdot\|_\infty)$ and on $(C[0,1],\|\cdot\|_1)$. (b) Differentiation $D:f\mapsto f'$ from $(C^1[0,1],\|\cdot\|_\infty)$ to $(C[0,1],\|\cdot\|_\infty)$ is bounded. (c) The functional $\varphi(f)=\int_0^{1/2}f-\int_{1/2}^1f$ on $(C[0,1],\|\cdot\|_\infty)$ attains its norm, i.e. $|\varphi(f)|=\|\varphi\|$ for some $f$ with $\|f\|_\infty=1$. (d) On a finite-dimensional space every linear operator attains its norm.
(a) Half true With the sup norm, $|f(0)|\le\|f\|_\infty$ and $f\equiv1$ gives equality: $\|\delta_0\|=1$. With $\|\cdot\|_1$ it is unbounded: the tents $f_n(x)=\max(0,1-nx)$ have $f_n(0)=1$ but $\|f_n\|_1=\frac1{2n}\to0$. The same linear map is continuous for one norm and not for the other.
(b) False $f_n(x)=x^n$ has $\|f_n\|_\infty=1$ but $\|Df_n\|_\infty=n$. Differentiation — the most important operator in analysis — is unbounded in the sup norm. (It is bounded from $(C^1,\|\cdot\|_{C^1})$, with norm $1$.)
(c) False $|\varphi(f)|\le\int_0^1|f|\le\|f\|_\infty$, so $\|\varphi\|\le1$. The functions $f_n$ equal to $1$ on $[0,\frac12-\frac1n]$, $-1$ on $[\frac12+\frac1n,1]$, linear in between, have $\|f_n\|_\infty=1$ and $\varphi(f_n)=1-\frac1n$; so $\|\varphi\|=1$. If $\|f\|_\infty\le1$ and $\varphi(f)=1$ (replace $f$ by $-f$ if $\varphi(f)=-1$), then $\int_0^{1/2}(1-f)+\int_{1/2}^1(1+f)=1-\varphi(f)=0$ with continuous non-negative integrands, so $f=1$ on $[0,\frac12]$ and $f=-1$ on $[\frac12,1]$ — impossible at $x=\frac12$. The supremum defining $\|\varphi\|$ is not a maximum.
(d) True In finite dimensions $T$ is continuous (Theorem 7.38(4)) and the unit sphere is compact (Theorem 7.38(3)), so $x\mapsto\|Tx\|$ attains its maximum on it. Part (c) is a genuinely infinite-dimensional phenomenon.
One more On $(c_{00},\|\cdot\|_\infty)$ the functional $\sigma(x)=\sum_nx_n$ is linear but unbounded: $x=(1,\dots,1,0,\dots)$ with $k$ ones has $\|x\|_\infty=1$, $\sigma(x)=k$. Every infinite-dimensional normed space carries discontinuous linear functionals (built from a Hamel basis), so Theorem 7.38(4) characterises finite dimension.

Infinite Dimensions: Riesz's Lemma and the Unit Ball

In $\mathbb{R}^n$ the closed unit ball is compact. The next two results show that this single property characterises finite-dimensional spaces.

📐 Theorem 7.42 — Riesz's lemma
Let $Y$ be a closed proper subspace of a normed space $X$, and let $0\lt\theta\lt1$. Then there is $x\in X$ with $\|x\|=1$ and $\|x-y\|\ge\theta$ for all $y\in Y$. (If $Y$ is finite-dimensional one may take $\theta=1$.)

Proof. Pick $x_0\in X\setminus Y$ and let $d=\inf_{y\in Y}\|x_0-y\|$. Then $d\gt0$: otherwise $x_0$ would be a limit of points of $Y$, and $Y$ is closed. Since $d/\theta\gt d$, there is $y_0\in Y$ with $\|x_0-y_0\|\le d/\theta$. Put $x=\dfrac{x_0-y_0}{\|x_0-y_0\|}$, so $\|x\|=1$. For $y\in Y$, the vector $y_0+\|x_0-y_0\|\,y$ lies in $Y$, hence $$\|x-y\|=\frac{\big\|x_0-\big(y_0+\|x_0-y_0\|y\big)\big\|}{\|x_0-y_0\|}\ge\frac{d}{d/\theta}=\theta.$$ (For finite-dimensional $Y$ the infimum $d$ is attained by compactness, and $\theta=1$ works.) ∎

📐 Theorem 7.43 — The closed unit ball is compact iff the dimension is finite
For a normed space $X$ the following are equivalent: (1) $\dim X\lt\infty$; (2) the closed unit ball $\overline B=\{x:\|x\|\le1\}$ is compact; (3) every closed bounded subset of $X$ is compact. In an infinite-dimensional normed space, every compact set has empty interior.

Proof. (1)$\Rightarrow$(3) is Theorem 7.38(3), and (3)$\Rightarrow$(2) is clear. (2)$\Rightarrow$(1): suppose $\dim X=\infty$. Choose $x_1$ with $\|x_1\|=1$. Having chosen unit vectors $x_1,\dots,x_n$, the subspace $Y_n=\operatorname{span}\{x_1,\dots,x_n\}$ is finite-dimensional, hence closed (Theorem 7.38(2)), and proper. Riesz's lemma with $\theta=\tfrac12$ gives a unit vector $x_{n+1}$ with $\|x_{n+1}-y\|\ge\tfrac12$ for all $y\in Y_n$, in particular $\|x_{n+1}-x_k\|\ge\frac12$ for $k\le n$. The sequence $(x_n)$ in $\overline B$ has no Cauchy subsequence, hence no convergent subsequence, so $\overline B$ is not (sequentially) compact (§7.2). Finally, if a compact $K$ contained a ball $B(x,r)$, then $\overline B(x,r/2)$, a closed subset of $K$, would be compact, and so would its image $\overline B$ under the homeomorphism $y\mapsto(2/r)(y-x)$. ∎

In concrete spaces one does not need Riesz: in $\ell^p$ the unit vectors $e_n$ satisfy $\|e_n-e_m\|_p=2^{1/p}$ ($\|e_n-e_m\|_\infty=1$ in $\ell^\infty$ and $c_0$), and in $C[0,1]$ tents of height $1$ with disjoint supports are at mutual distance $1$. Each of these is a sequence in the closed unit ball with no convergent subsequence.

Spaces of Continuous Functions: Arzelà–Ascoli and Stone–Weierstrass

Since the closed bounded subsets of $C(K)$ are not compact in general, which ones are? The answer — the Arzelà–Ascoli theorem — is one of the most used compactness criteria in analysis (existence theorems for ODEs, compact operators, calculus of variations). It needs one new notion.

📘 Definition 7.24 — Equicontinuous family; relatively compact set

Let $(K,d)$ be a metric space and $\mathcal{F}$ a family of functions $K\to\mathbb{F}$. $\mathcal{F}$ is equicontinuous at $x_0$ if for every $\varepsilon\gt0$ there is $\delta\gt0$ such that $$d(x,x_0)\lt\delta\ \Longrightarrow\ |f(x)-f(x_0)|\lt\varepsilon$$ for all $f\in\mathcal{F}$; it is equicontinuous if it is equicontinuous at every point, and uniformly equicontinuous if one $\delta$ works for all points and all $f$: $d(x,y)\lt\delta\Rightarrow|f(x)-f(y)|\lt\varepsilon$ for all $x,y\in K$ and $f\in\mathcal{F}$.

$\mathcal{F}$ is pointwise bounded if $\sup_{f\in\mathcal{F}}|f(x)|\lt\infty$ for each $x$, and uniformly bounded if $\sup_{f\in\mathcal{F}}\|f\|_\infty\lt\infty$. A subset of a metric space is relatively compact if its closure is compact; in a complete metric space this holds iff every sequence in it has a Cauchy (hence convergent) subsequence.

The key word is "for all $f$": one $\delta$ must serve every member of the family. A uniformly Lipschitz family ($|f(x)-f(y)|\le L\,d(x,y)$ for all $f\in\mathcal{F}$) is uniformly equicontinuous with $\delta=\varepsilon/L$; so is, by the mean value theorem, any family of $C^1$ functions on an interval with $\sup_{\mathcal{F}}\|f'\|_\infty\lt\infty$. On a compact $K$, equicontinuity implies uniform equicontinuity (the proof of the Heine–Cantor theorem, §3.2, goes through word for word — Exercise IV.3). The family $\{x^n\}$ on $[0,1]$ is not equicontinuous at $1$: for any $\delta$, $1-(1-\tfrac\delta2)^n\to1$.

📐 Theorem 7.44 — Arzelà–Ascoli theorem
Let $K$ be a compact metric space and $\mathcal{F}\subseteq C(K)$. Then $\mathcal{F}$ is relatively compact in $(C(K),\|\cdot\|_\infty)$ — every sequence in $\mathcal{F}$ has a uniformly convergent subsequence — if and only if $\mathcal{F}$ is pointwise bounded and equicontinuous. In that case $\mathcal{F}$ is uniformly bounded. In particular a closed subset of $C(K)$ is compact iff it is bounded and equicontinuous.

Proof sketch. ($\Leftarrow$) Step 1: a countable dense set. A compact metric space is totally bounded (§7.2), so for each $k$ it is covered by finitely many balls of radius $\frac1k$; the centres of all these balls form a countable dense set $D=\{d_1,d_2,\dots\}$. Step 2: the diagonal argument. Let $(f_n)$ be a sequence in $\mathcal{F}$. The numbers $f_n(d_1)$ are bounded, so by Bolzano–Weierstrass some subsequence converges at $d_1$; from it extract a further subsequence converging at $d_2$; and so on. The diagonal sequence $g_k$ ($k$-th term of the $k$-th subsequence) converges at every point of $D$. Step 3: uniformly Cauchy. Let $\varepsilon\gt0$ and take $\delta$ from uniform equicontinuity (compact $K$) for $\varepsilon/3$. Finitely many points $d_{i_1},\dots,d_{i_r}$ of $D$ are $\delta$-dense in $K$ (cover $K$ by $\delta$-balls around points of $D$ and use compactness). Choose $N$ with $|g_k(d_{i_s})-g_l(d_{i_s})|\lt\varepsilon/3$ for $k,l\ge N$ and all $s$. Every $x$ is within $\delta$ of some $d_{i_s}$, so $$\begin{aligned}|g_k(x)-g_l(x)|&\le|g_k(x)-g_k(d_{i_s})|\\&\quad+|g_k(d_{i_s})-g_l(d_{i_s})|\\&\quad+|g_l(d_{i_s})-g_l(x)|\lt\varepsilon .\end{aligned}$$ So $(g_k)$ is uniformly Cauchy, and converges in the Banach space $C(K)$ (Theorem 7.33).

($\Rightarrow$) A relatively compact set is totally bounded: for $\varepsilon\gt0$ there are $f_1,\dots,f_m\in\mathcal{F}$ with every $f\in\mathcal{F}$ within $\varepsilon/3$ of some $f_i$. In particular $\|f\|_\infty\le\max_i\|f_i\|_\infty+\varepsilon/3$ — uniformly bounded. Each $f_i$ is uniformly continuous on $K$; take $\delta$ working for all $m$ of them with $\varepsilon/3$. Then for $d(x,y)\lt\delta$ and $f$ within $\varepsilon/3$ of $f_i$: $|f(x)-f(y)|\le\frac\varepsilon3+|f_i(x)-f_i(y)|+\frac\varepsilon3\lt\varepsilon$. So $\mathcal{F}$ is (uniformly) equicontinuous. ∎

✏️ Example 6 — Which families have uniformly convergent subsequences?
Decide for each family whether every sequence in it has a uniformly convergent subsequence: (a) $\{x^n:n\in\mathbb{N}\}$ on $[0,1]$; (b) $\{\sin nx:n\in\mathbb{N}\}$ on $[0,\pi]$; (c) $\{\sin(x+n):n\in\mathbb{N}\}$ on $[0,1]$; (d) $\{nxe^{-nx}:n\in\mathbb{N}\}$ on $[0,1]$; (e) $\mathcal{F}=\{f\in C^1[0,1]:|f(0)|\le1,\ \|f'\|_\infty\le1\}$; (f) $\{V f:\|f\|_\infty\le1\}$ where $V$ is the Volterra operator of Example 4.
(a) No Any subsequence converges pointwise to $\mathbf 1_{\{1\}}$, which is discontinuous, so no subsequence converges uniformly (a uniform limit would be continuous and equal the pointwise limit). Arzelà–Ascoli's diagnosis: bounded but not equicontinuous at $1$.
(b) No For distinct $m,n$, $\int_0^\pi(\sin mx-\sin nx)^2dx=\frac\pi2+\frac\pi2-0=\pi$ (the cross term vanishes by orthogonality), while the integral is at most $\pi\|\sin m\cdot-\sin n\cdot\|_\infty^2$. So any two members are at sup-distance $\ge1$, and no subsequence is Cauchy. (Not equicontinuous: $\sin nx$ climbs from $0$ to $1$ on $[0,\frac\pi{2n}]$.)
(c) Yes $|\sin(x+n)|\le1$ and $|\sin(x+n)-\sin(y+n)|\le|x-y|$: uniformly bounded and uniformly Lipschitz, so Arzelà–Ascoli applies. The sequence itself does not converge (at $x=0$, $\sin n$ has no limit), but a subsequence does. Explicitly: the points $n\bmod2\pi$ are dense in $[0,2\pi]$ ($\pi$ is irrational), so there are $n_k$ and integers $m_k$ with $|n_k-2\pi m_k|\to0$, and then $\|\sin(\cdot+n_k)-\sin\|_\infty\le|n_k-2\pi m_k|\to0$.
(d) No Pointwise limit $0$, but $\|nxe^{-nx}\|_\infty=e^{-1}$ (at $x=\frac1n$), so no subsequence converges uniformly (its limit would have to be $0$). Not equicontinuous at $0$: $f_n(\frac1n)-f_n(0)=e^{-1}$.
(e) Yes By the mean value theorem $|f(x)-f(y)|\le|x-y|$ and $|f(x)|\le|f(0)|+x\le2$: uniformly bounded and equicontinuous. (The limits need not be $C^1$ — e.g. functions $f$ with $f'$ approximating $\operatorname{sgn}(x-\frac12)$ converge to $|x-\frac12|-\frac12$ — so $\mathcal{F}$ is relatively compact but not closed.)
(f) Yes $|Vf(x)|\le1$ and $|Vf(x)-Vf(y)|=\big|\int_y^xf\big|\le|x-y|$. So $V$ maps the unit ball to a relatively compact set — $V$ is a compact operator, the infinite-dimensional operators that behave most like matrices.
Interactive 2 — An Equicontinuity Meter

For the first $N$ members of a family the meter computes $$\omega_N(\delta)=\max_{n\le N}\ \sup_{|x-y|\le\delta}|f_n(x)-f_n(y)|,$$ the worst change of any $f_n$ over a window of width $\delta$ (shaded amber, on the worst function, drawn red). The family is uniformly equicontinuous exactly when $\sup_N\omega_N(\delta)\to0$ as $\delta\to0$. Press Play to add members one at a time: for an equicontinuous family $\omega_N(\delta)$ settles at a small value; otherwise it climbs, however small you make $\delta$. Arzelà–Ascoli then predicts whether uniformly convergent subsequences exist.

N, δ—
ω_N(δ)—
worst member—
max ‖fₙ‖∞ (n ≤ N)—

The second great theorem about $C(K)$ tells us when a family of "simple" functions is rich enough to approximate everything. It generalises the Weierstrass approximation theorem (§5.2) from polynomials on $[a,b]$ to any algebra of functions on any compact metric space.

📐 Theorem 7.45 — Stone–Weierstrass theorem
Let $K$ be a compact metric space and $\mathcal{A}\subseteq C(K,\mathbb{R})$ a subalgebra (closed under addition, multiplication and multiplication by real scalars) such that
  1. $\mathcal{A}$ contains the constant functions, and
  2. $\mathcal{A}$ separates points: for $x\ne y$ in $K$ there is $f\in\mathcal{A}$ with $f(x)\ne f(y)$.
Then $\mathcal{A}$ is dense in $(C(K,\mathbb{R}),\|\cdot\|_\infty)$: every continuous real function on $K$ is a uniform limit of functions in $\mathcal{A}$. For complex scalars the same holds for a subalgebra of $C(K,\mathbb{C})$ that contains the constants, separates points and is closed under complex conjugation.

Idea of the proof. The closure $\overline{\mathcal{A}}$ is again an algebra. Since $|t|$ is a uniform limit of polynomials on any bounded interval (Weierstrass), $f\in\overline{\mathcal{A}}$ implies $|f|\in\overline{\mathcal{A}}$, hence $\max(f,g)=\frac{f+g+|f-g|}2$ and $\min(f,g)$ lie in $\overline{\mathcal{A}}$. Point separation and constants give, for any $x\ne y$ and any target values $a,b$, a function $h\in\mathcal{A}$ with $h(x)=a$, $h(y)=b$. Given $F\in C(K)$ and $\varepsilon\gt0$, a compactness argument then builds, from finitely many such two-point interpolants, first $\max$'s that are $\gt F-\varepsilon$ everywhere and agree with $F$ at a point, and then a $\min$ of finitely many of those that lies within $\varepsilon$ of $F$ everywhere. In the complex case, conjugation-closure ensures that $\operatorname{Re}f=\frac{f+\bar f}2$ and $\operatorname{Im}f$ lie in $\mathcal{A}$, reducing to the real case. ∎

📐 Theorem 7.46 — Separability of the classical spaces
A metric space is separable if it has a countable dense subset. (a) $C(K)$ is separable for every compact $K\subseteq\mathbb{R}^n$; in particular $C[a,b]$. (b) $\ell^p$ is separable for $1\le p\lt\infty$, and so is $c_0$. (c) $\ell^\infty$ is not separable.

Proof. (a) Polynomials in $x_1,\dots,x_n$ form an algebra containing the constants and separating points (the coordinate functions do), so they are dense by Stone–Weierstrass; polynomials with rational coefficients are a countable set, and any polynomial on the bounded set $K$ is uniformly approximated by one with rational coefficients. (b) Given $x\in\ell^p$ and $\varepsilon\gt0$, choose $N$ with $\sum_{n\gt N}|x_n|^p\lt\varepsilon^p/2$ and rationals (or Gaussian rationals) $q_n$ with $\sum_{n\le N}|x_n-q_n|^p\lt\varepsilon^p/2$; then $q=(q_1,\dots,q_N,0,\dots)$ satisfies $\|x-q\|_p\lt\varepsilon$, and the finitely supported rational sequences are countable. (c) The $0$–$1$ sequences form an uncountable subset of $\ell^\infty$ (§1.1) whose points are at mutual distance $1$. The balls of radius $\frac12$ around them are pairwise disjoint, and a dense set must meet each of them — so it is uncountable. ∎

✏️ Example 7 — Dense or not?
Which of the following sets of functions are dense in the indicated space with the sup norm? (a) The polynomials in $x^2$ (i.e. $\operatorname{span}\{1,x^2,x^4,\dots\}$) in $C[0,1]$; (b) the same set in $C[-1,1]$; (c) $\operatorname{span}\{e^{nx}:n=0,1,2,\dots\}$ in $C[0,1]$; (d) $\{p\text{ polynomial}:p(0)=0\}$ in $C[0,1]$; (e) the polynomials in $z$ in $C(S^1,\mathbb{C})$, $S^1=\{|z|=1\}$; (f) the polynomials in $x$ and $y$ in $C(K)$ for the closed unit disc $K\subseteq\mathbb{R}^2$.
(a) Dense An algebra ($x^{2j}x^{2k}=x^{2(j+k)}$) containing $1$; $x^2$ is injective on $[0,1]$, so it separates points. Stone–Weierstrass applies. Consequence: if $f\in C[0,1]$ and $\int_0^1f(x)x^{2n}dx=0$ for all $n\ge0$, then $\int f\,p=0$ for all $p$ in the algebra, hence (uniform limits) $\int f^2=0$ and $f=0$.
(b) Not dense Every member is even, and uniform limits of even functions are even; so the closure consists of even functions (in fact it is exactly the even continuous functions) and misses $f(x)=x$. The hypothesis that fails: $x^2$ does not separate $1$ from $-1$.
(c) Dense $e^{mx}e^{nx}=e^{(m+n)x}$, so the span is an algebra; it contains $e^{0x}=1$; and $e^x$ is injective. Note this span contains no nonconstant polynomial, yet it approximates everything.
(d) Not dense It is an algebra separating points but missing the constants; all its members vanish at $0$, and so do their uniform limits. Its closure is $\{f\in C[0,1]:f(0)=0\}$ (approximate $f-f(0)$ by polynomials and subtract the constant term).
(e) Not dense For every polynomial $p$, $\int_0^{2\pi}p(e^{i\theta})e^{i\theta}d\theta=0$ (each $\int_0^{2\pi}e^{i(k+1)\theta}d\theta=0$ for $k\ge0$). If $p_n\to\bar z$ uniformly on $S^1$, then $0=\int p_n(e^{i\theta})e^{i\theta}d\theta\to\int e^{-i\theta}e^{i\theta}d\theta=2\pi$, absurd. The missing hypothesis is closure under conjugation; adding $\bar z$ gives the trigonometric polynomials $\sum_{|k|\le N}c_ke^{ik\theta}$, which are dense.
(f) Dense An algebra with constants, and the coordinate functions $x,y$ separate points of the plane.
🧭 Problem-solving strategy — normed-space questions
  1. Is it a norm? Check definiteness first (seminorms such as $\sup|f'|$ or $|f(0)|$ fail it), then the triangle inequality on simple vectors like $e_1,e_2$; a bounded metric never comes from a norm.
  2. Complete? Finite-dimensional: always. Otherwise, is the space a closed subspace of a known Banach space ($\ell^p$, $C(K)$, $C^1$ with the $C^1$ norm)? To disprove, build a Cauchy sequence whose limit leaves the space: ramps in $\|\cdot\|_1$, truncations in $c_{00}$, Taylor polynomials in $\mathcal{P}$, $\sqrt{x^2+1/n^2}$ in $C^1$ with the sup norm.
  3. Equivalent norms? Finite dimension: yes. Otherwise test a sequence like $x^n$, tents of shrinking width, or $(1,\dots,1,0,\dots)$, and compare the ratio of the two norms.
  4. Operator norm: find an upper bound $M$ by estimating $\|Tx\|$, then a vector (or a sequence of vectors) showing $\|Tx\|/\|x\|$ reaches (or approaches) $M$. Matrices: column sums ($\|\cdot\|_1$), row sums ($\|\cdot\|_\infty$), singular values ($\|\cdot\|_2$). Positive kernels: test $f\equiv1$.
  5. Uniformly convergent subsequence? Check boundedness and equicontinuity (a uniform Lipschitz or derivative bound is the usual certificate). To disprove, show the pointwise limit is discontinuous, or that sup-distances stay bounded below.
  6. Dense? For an algebra, check constants, point separation, and (complex case) conjugation; otherwise look for a continuous linear functional (an integral against a weight, an evaluation) that vanishes on the set but not on the target.
⚠️ Counterexamples and pitfalls
  1. Completeness depends on the norm. $C[0,1]$ is complete in $\|\cdot\|_\infty$ but not in $\|\cdot\|_1$ or $\|\cdot\|_2$ (Theorem 7.35).
  2. Norms in infinite dimensions need not be equivalent ($\|\cdot\|_1$, $\|\cdot\|_2$, $\|\cdot\|_\infty$ on $C[0,1]$ via $x^n$). On a finite-dimensional space they always are.
  3. Closed and bounded $\not\Rightarrow$ compact. The closed unit balls of $\ell^2$ and $C[0,1]$; the set $\{e_n\}$ in $\ell^2$ is closed, bounded and discrete.
  4. Linear does not mean continuous. $D=d/dx$ in the sup norm, $f\mapsto f(0)$ in $\|\cdot\|_1$, $\sum x_n$ on $(c_{00},\|\cdot\|_\infty)$.
  5. Subspaces need not be closed. $c_{00}\subset\ell^2$, polynomials $\subset C[0,1]$ — both dense and proper. Finite-dimensional subspaces are always closed.
  6. The operator norm need not be attained (Example 5(c)); in finite dimensions it always is.
  7. $\|\cdot\|_p$ for $0\lt p\lt1$ is not a norm: $\|e_1+e_2\|_p=2^{1/p}\gt2$; its unit ball is not convex.
  8. Spectral radius is not a norm. $\begin{pmatrix}0&1\\0&0\end{pmatrix}$ has all eigenvalues $0$ but norm $1$; in general $\max|\lambda|\le\|A\|$, often strictly.
  9. Arzelà–Ascoli needs a compact domain. The bumps $f_n(x)=e^{-(x-n)^2}$ on $\mathbb{R}$ are bounded and uniformly equicontinuous, converge pointwise to $0$, but $\|f_n\|_\infty=1$: no uniformly convergent subsequence.
  10. Pointwise convergence plus boundedness is not enough ($x^n$, $nxe^{-nx}$): equicontinuity is the missing ingredient.
  11. Stone–Weierstrass needs every hypothesis. No constants: polynomials vanishing at $0$. No separation: even polynomials on $[-1,1]$. No conjugation (complex): polynomials in $z$ on the circle.
  12. Isometries need not be onto. The right shift $(x_1,x_2,\dots)\mapsto(0,x_1,x_2,\dots)$ on $\ell^2$ preserves norms but is not surjective — impossible for a linear map of $\mathbb{F}^n$ into itself.
  13. Bigger is not less separable. $C[0,1]$ is separable; $\ell^\infty$, which looks "smaller", is not.

Exercises

I
Norms and completeness.
  • 1 For which real $a,b$ is $N(x,y)=\max(|x+ay|,|by|)$ a norm on $\mathbb{R}^2$?
  • 2 Prove that $N(f)=|f(0)|+\int_0^1|f'|$ is a norm on $C^1[0,1]$ and that $\|f\|_\infty\le N(f)$.
  • 3 Show that $\|x\|_p=(|x_1|^p+|x_2|^p)^{1/p}$ is not a norm on $\mathbb{R}^2$ when $0\lt p\lt1$.
  • 4 Show that the discrete metric on $\mathbb{R}$ is not induced by any norm, in two ways.
  • 5 Prove that $c_0$ is a Banach space and that $c_{00}$ is dense in it.
  • 6 Show that $f_n(x)=x^n$ is Cauchy in $(C[0,1],\|\cdot\|_1)$. Does it converge there? Is it Cauchy in $\|\cdot\|_\infty$?
  • 7 In $(C[0,1],\|\cdot\|_\infty)$ find the distance from $f(x)=x$ to the subspace of constant functions, and from $g(x)=x^2$ to the subspace $\operatorname{span}\{1,x\}$.
  • 8 Prove that a normed space $X$ is a Banach space if its closed unit ball is complete. Is a normed space in which every closed ball is compact necessarily finite-dimensional?
1 Homogeneity and the triangle inequality hold for all $a,b$ (maximum of two seminorms $|x+ay|$, $|by|$). Definiteness: $N=0\iff by=0$ and $x+ay=0$. If $b\ne0$ this forces $y=0$, $x=0$; if $b=0$, $(x,y)=(-a,1)\ne0$ has $N=0$. So: a norm iff $b\ne0$ ($a$ arbitrary).
2 Seminorm properties are clear. If $N(f)=0$ then $f'=0$ (continuous, non-negative $|f'|$ with zero integral) and $f(0)=0$, so $f=0$. Also $|f(x)|=\big|f(0)+\int_0^xf'\big|\le|f(0)|+\int_0^1|f'|$.
3 $\|e_1\|_p=\|e_2\|_p=1$ but $\|e_1+e_2\|_p=2^{1/p}\gt2$ since $1/p\gt1$.
4 (i) It is bounded (all distances $\le1$), while a norm metric is unbounded (Theorem 7.32(4)). (ii) It is not homogeneous: $d(2,0)=1\ne2=2d(1,0)$.
5 $c_0$ is closed in $\ell^\infty$ (Theorem 7.33). For $x\in c_0$, the truncations $x^{(k)}=(x_1,\dots,x_k,0,\dots)$ satisfy $\|x-x^{(k)}\|_\infty=\sup_{n\gt k}|x_n|\to0$.
6 For $m\gt n$, $\|x^n-x^m\|_1=\frac1{n+1}-\frac1{m+1}\lt\frac1{n+1}$: Cauchy; and $\|x^n\|_1=\frac1{n+1}\to0$, so it converges to the zero function in $\|\cdot\|_1$. In $\|\cdot\|_\infty$: $\|x^n-x^{2n}\|_\infty=\max_{t\in[0,1]}(t-t^2)=\frac14$ (with $t=x^n$), so it is not Cauchy.
7 $\max_{[0,1]}|x-c|=\max(|c|,|1-c|)\ge\frac12$ with equality at $c=\frac12$: distance $\frac12$. For $x^2$: $x^2-(x-\frac18)$ takes the values $\frac18,-\frac18,\frac18$ at $0,\frac12,1$ and has sup norm $\frac18$; if a line $\ell$ had $\|x^2-\ell\|_\infty\lt\frac18$, then $(x^2-\ell)-(x^2-x+\frac18)=x-\frac18-\ell$ would be negative at $0$, positive at $\frac12$, negative at $1$ — a linear function cannot change sign twice. Distance $\frac18$ (Chebyshev equioscillation).
8 If $(x_n)$ is Cauchy it is bounded, say $\|x_n\|\le R$; then $(x_n/R)$ is a Cauchy sequence in the closed unit ball, converging to some $u$, so $x_n\to Ru$. Yes: if every closed ball is compact, in particular the unit ball is, and Theorem 7.43 gives finite dimension.
II
Equivalent norms and finite dimension.
  • 1 Find the best constants $c,C$ in $c\|x\|_\infty\le\|x\|_1\le C\|x\|_\infty$ on $\mathbb{R}^n$.
  • 2 Show that on $C[0,1]$ the norms $\|f\|_\infty$ and $\|f\|'=\|f\|_\infty+|f(0)|$ are equivalent, but $\|f\|_\infty$ and $\|f\|_\infty+|f'(0)|$ cannot be compared on $C^1[0,1]$ in this way.
  • 3 Show that on $C^1[0,1]$ the norms $\|f\|_\infty$ and $\|f\|_{C^1}=\|f\|_\infty+\|f'\|_\infty$ are not equivalent.
  • 4 Let $p_k$ be polynomials of degree at most $5$ converging uniformly on $[0,1]$ to $f$. Prove that $f$ is a polynomial of degree at most $5$ and that the coefficients of $p_k$ converge.
  • 5 Prove that $\lim_{p\to\infty}\|x\|_p=\|x\|_\infty$ for $x\in\mathbb{R}^n$, and that $p\mapsto\|x\|_p$ is non-increasing.
  • 6 Let $\|\cdot\|$ be any norm on $\mathbb{R}^2$. Show that its closed unit ball is compact, convex, symmetric ($x\in B\Rightarrow-x\in B$) and contains a Euclidean disc around $0$.
  • 7 Prove that every linear functional on $\mathbb{R}^n$ is continuous, and compute the norm of $\varphi(x)=x_1-2x_2+3x_3$ on $(\mathbb{R}^3,\|\cdot\|_1)$, $(\mathbb{R}^3,\|\cdot\|_2)$ and $(\mathbb{R}^3,\|\cdot\|_\infty)$.
1 $c=1$ (equality at $e_1$) and $C=n$ (equality at $(1,\dots,1)$).
2 $\|f\|_\infty\le\|f\|'\le2\|f\|_\infty$ since $|f(0)|\le\|f\|_\infty$. On $C^1[0,1]$, $\|f\|_\infty+|f'(0)|$ is a norm, but $f_n(x)=\frac{\sin nx}{n}$ has $\|f_n\|_\infty\le\frac1n$ and $f_n'(0)=1$: no inequality $\|f\|_\infty+|f'(0)|\le C\|f\|_\infty$ holds.
3 $f_n=x^n$: $\|f_n\|_\infty=1$, $\|f_n\|_{C^1}=1+n$. The ratio is unbounded.
4 $\mathcal{P}_5$ is a $6$-dimensional subspace of $C[0,1]$, hence closed (Theorem 7.38(2)): $f\in\mathcal{P}_5$. On $\mathcal{P}_5$ the sup norm is equivalent to the norm "sum of absolute values of coefficients" (Theorem 7.37), so $\|p_k-f\|_\infty\to0$ forces the coefficients to converge.
5 Let $M=\|x\|_\infty$, attained at $m\ge1$ coordinates. Then $M m^{1/p}\le\|x\|_p\le Mn^{1/p}$, and both bounds tend to $M$. Monotonicity: for $x\ne0$ scale to $\|x\|_p=1$; then $|x_i|\le1$, so for $q\gt p$, $\sum|x_i|^q\le\sum|x_i|^p=1$, i.e. $\|x\|_q\le1=\|x\|_p$.
6 By Theorem 7.37, $c\|x\|_2\le\|x\|\le C\|x\|_2$. So $B=\{\|x\|\le1\}$ is closed (norm continuous) and bounded (inside the Euclidean disc of radius $\frac1c$), hence compact; it contains the disc of radius $\frac1C$. Convexity: Theorem 7.32(4); symmetry: $\|-x\|=\|x\|$.
7 Continuity: Theorem 7.38(4). With $a=(1,-2,3)$, $\varphi(x)=a\cdot x$. In $\|\cdot\|_1$: $|\varphi(x)|\le\|a\|_\infty\|x\|_1$, equality at $x=e_3$: norm $3$. In $\|\cdot\|_2$: Cauchy–Schwarz, equality at $x=a$: norm $\|a\|_2=\sqrt{14}$. In $\|\cdot\|_\infty$: $|\varphi(x)|\le\|a\|_1\|x\|_\infty$, equality at $x=(1,-1,1)$: norm $6$. (The dual of $\|\cdot\|_1$ is $\|\cdot\|_\infty$ and vice versa.)
III
Bounded operators.
  • 1 Compute $\|A\|_{1\to1}$, $\|A\|_{\infty\to\infty}$, $\|A\|_{2\to2}$ for $A=\begin{pmatrix}2&1\\1&2\end{pmatrix}$.
  • 2 Show that $\|A\|_{2\to2}=\frac{1+\sqrt5}{2}$ for $A=\begin{pmatrix}1&1\\0&1\end{pmatrix}$, although both eigenvalues equal $1$.
  • 3 On $(C[0,1],\|\cdot\|_\infty)$ let $(Tf)(x)=xf(x)$. Find $\|T\|$ and show that $T$ is injective but not surjective.
  • 4 Find the norm of $\psi(f)=\int_0^1tf(t)\,dt$ on $(C[0,1],\|\cdot\|_\infty)$ and on $(C[0,1],\|\cdot\|_1)$. Is it attained?
  • 5 Let $S(x_1,x_2,\dots)=(0,x_1,x_2,\dots)$ and $L(x_1,x_2,\dots)=(x_2,x_3,\dots)$ on $\ell^2$. Find $\|S\|$, $\|L\|$, $LS$ and $SL$.
  • 6 Find the norm of $(\mathcal{K}f)(x)=\int_0^1e^{x-t}f(t)\,dt$ on $(C[0,1],\|\cdot\|_\infty)$.
  • 7 Prove that a linear functional $\varphi$ on a normed space is continuous if and only if $\ker\varphi$ is closed.
  • 8 Show that for every continuous kernel $K$ the integral operator of Theorem 7.41(2) has $\|\mathcal{K}\|=\max_x\int_0^1|K(x,t)|\,dt$.
1 Column and row sums are all $3$: $\|A\|_{1\to1}=\|A\|_{\infty\to\infty}=3$. $A$ is symmetric with eigenvalues $3,1$, so $A^TA=A^2$ has eigenvalues $9,1$ and $\|A\|_{2\to2}=3$.
2 $A^TA=\begin{pmatrix}1&1\\1&2\end{pmatrix}$, eigenvalues $\frac{3\pm\sqrt5}2$; $\sqrt{\frac{3+\sqrt5}2}=\frac{1+\sqrt5}2\approx1.618$ (square the right side: $\frac{6+2\sqrt5}4$). The norm exceeds the spectral radius $1$ because $A$ is not normal.
3 $\|xf\|_\infty\le\|f\|_\infty$, equality at $f\equiv1$: $\|T\|=1$. If $xf(x)\equiv0$ then $f=0$ on $(0,1]$ and by continuity at $0$: injective. Every $Tf$ vanishes at $0$, so the constant $1$ is not in the range.
4 Sup norm: positive kernel, $\|\psi\|=\int_0^1t\,dt=\frac12$, attained at $f\equiv1$. $\|\cdot\|_1$: $|\psi(f)|\le\int t|f|\le\|f\|_1$, and $f_n=$ a tent of integral $1$ supported in $[1-\frac1n,1]$ gives $\psi(f_n)\ge1-\frac1n$: $\|\psi\|=1$. Not attained: $\psi(f)=\|f\|_1$ with $f\ne0$ would need $\int(1-t)|f|=0$, forcing $f=0$ on $[0,1)$.
5 $\|Sx\|_2=\|x\|_2$, so $\|S\|=1$ (an isometry). $\|Lx\|_2\le\|x\|_2$ with equality when $x_1=0$: $\|L\|=1$. $LS=I$, but $SL(x)=(0,x_2,x_3,\dots)\ne x$ in general: $S$ has a left inverse but is not surjective, $L$ is surjective but not injective.
6 Positive kernel: $\|\mathcal{K}\|=\max_x\int_0^1e^{x-t}dt=\max_xe^x(1-e^{-1})=e-1\approx1.718$, at $x=1$.
7 If $\varphi$ is continuous, $\ker\varphi=\varphi^{-1}(\{0\})$ is closed. Conversely suppose $\ker\varphi$ is closed and $\varphi$ is unbounded (so $\varphi\ne0$). Pick $y_n$ with $|\varphi(y_n)|\gt n\|y_n\|$ and put $x_n=y_n/\varphi(y_n)$: $\varphi(x_n)=1$, $\|x_n\|\lt\frac1n$. Fix $z$ with $\varphi(z)=1$. Then $z-x_n\in\ker\varphi$ and $z-x_n\to z$, so $z\in\ker\varphi$ — contradiction.
8 Let $x_0$ maximise $x\mapsto\int|K(x,t)|dt$ (a continuous function). Put $f_n(t)=\dfrac{K(x_0,t)}{|K(x_0,t)|+1/n}$, continuous with $\|f_n\|_\infty\le1$. Then $\mathcal{K}f_n(x_0)=\int\frac{K(x_0,t)^2}{|K(x_0,t)|+1/n}dt\to\int|K(x_0,t)|dt$ (monotone, or dominated, convergence). So $\|\mathcal{K}\|\ge\kappa$.
IV
Compactness, approximation and separability.
  • 1 Show that $\{e_n\}$ has no convergent subsequence in $\ell^2$, but that the "Hilbert cube" $Q=\{x\in\ell^2:|x_n|\le\frac1n\text{ for all }n\}$ is compact.
  • 2 Construct a sequence in the closed unit ball of $C[0,1]$ with $\|f_n-f_m\|_\infty=1$ for all $n\ne m$.
  • 3 Prove that an equicontinuous family on a compact metric space is uniformly equicontinuous.
  • 4 Decide whether each sequence is equicontinuous on $[0,1]$: (a) $\frac{\sin nx}{\sqrt n}$; (b) $\arctan(nx)$; (c) $\sqrt{x+\frac1n}$; (d) $x^n(1-x)$.
  • 5 Let $\mathcal{L}$ be the set of $f\in C[0,1]$ with $f(0)=0$ and $|f(x)-f(y)|\le|x-y|$ for all $x,y$. Prove that $\mathcal{L}$ is compact in $(C[0,1],\|\cdot\|_\infty)$, and find $\max_{f\in\mathcal{L}}\int_0^1f$.
  • 6 Show that functions of the form $\sum_{i=1}^kg_i(x)h_i(y)$, with $g_i,h_i\in C[0,1]$, are dense in $C([0,1]^2)$.
  • 7 Prove that $\ell^1$ is separable and $\ell^\infty$ is not.
  • 8 Let $f\in C[0,1]$ satisfy $\int_0^1f(x)e^{nx}\,dx=0$ for all $n=0,1,2,\dots$. Prove that $f\equiv0$.
1 $\|e_n-e_m\|_2=\sqrt2$ for $n\ne m$, so no subsequence is Cauchy. $Q$ is closed (each condition $|x_n|\le\frac1n$ is closed, coordinates being continuous). Given a sequence in $Q$, a diagonal argument gives a subsequence converging in every coordinate to some $x\in Q$; for $\varepsilon\gt0$ choose $N$ with $\sum_{n\gt N}\frac4{n^2}\lt\varepsilon^2/2$; the first $N$ coordinates eventually differ by less than $\varepsilon/\sqrt{2N}$, so the subsequence converges in $\ell^2$. ($Q$ is compact but has empty interior, as Theorem 7.43 requires.)
2 Let $f_n$ be the tent of height $1$ on $[\frac1{n+1},\frac1n]$ (peak at the midpoint, $0$ outside). Supports overlap only at end points, so for $n\ne m$, $\|f_n-f_m\|_\infty=1$.
3 If not, there are $\varepsilon\gt0$, $x_k,y_k$ with $d(x_k,y_k)\lt\frac1k$ and $f_k\in\mathcal{F}$ with $|f_k(x_k)-f_k(y_k)|\ge\varepsilon$. By compactness a subsequence $x_{k_j}\to x$, so $y_{k_j}\to x$ too. Equicontinuity at $x$ gives $\delta$ with $|f(z)-f(x)|\lt\frac\varepsilon2$ for $d(z,x)\lt\delta$ and all $f$; for large $j$ both $x_{k_j},y_{k_j}$ are that close, so $|f_{k_j}(x_{k_j})-f_{k_j}(y_{k_j})|\lt\varepsilon$ — contradiction.
4 (a) Yes: $\|f_n\|_\infty\le n^{-1/2}\to0$, so $f_n\to0$ uniformly; the set $\{f_n\}\cup\{0\}$ is compact, hence equicontinuous by Arzelà–Ascoli ($\Rightarrow$) — even though $\|f_n'\|_\infty=\sqrt n$ is unbounded. (b) No: $\arctan(n\cdot\frac1n)-\arctan0=\frac\pi4$ for every $n$, at points $\frac1n\to0$. (c) Yes: $\sqrt{x+1/n}\to\sqrt x$ uniformly ($0\le\sqrt{x+h}-\sqrt x\le\sqrt h$), same argument. (d) Yes: $\|x^n(1-x)\|_\infty\lt\frac1{n+1}$ (§5.1), uniform convergence to $0$.
5 $|f(x)|=|f(x)-f(0)|\le x\le1$ and the family is $1$-Lipschitz: bounded and equicontinuous, so relatively compact; it is closed because both defining conditions pass to uniform (even pointwise) limits. Hence compact. $f\mapsto\int_0^1f$ is continuous, so it attains a maximum on $\mathcal{L}$; since $f(x)\le x$, $\int f\le\frac12$, with equality for $f(x)=x$. Maximum $\frac12$.
6 These sums form an algebra (a product of two such sums is again one), containing the constants ($g=h=1$) and separating points: $(x,y)\ne(x',y')$ are separated by $x$ (take $h=1$) or by $y$. Stone–Weierstrass on the compact square.
7 $\ell^1$: Theorem 7.46(b) with $p=1$ — the finitely supported rational sequences are countable and dense. $\ell^\infty$: Theorem 7.46(c) — uncountably many $0$–$1$ sequences at mutual distance $1$.
8 By Example 7(c), there are $q_k\in\operatorname{span}\{e^{nx}\}$ with $q_k\to f$ uniformly. By hypothesis $\int fq_k=0$, and $\big|\int f q_k-\int f^2\big|\le\|f\|_\infty\|q_k-f\|_\infty\to0$. So $\int_0^1f^2=0$ and $f\equiv0$ by continuity.
🎯 Exam corner CSIR Part BCSIR Part CGATE MA

E1. CSIR Part B GATE MA On the vector space $C[0,1]$ consider the norms (A) $\|f\|_1=\int_0^1|f|$; (B) $\|f\|_2=\big(\int_0^1|f|^2\big)^{1/2}$; (C) $\|f\|_\infty=\max|f|$; (D) $\|f\|=|f(0)|+\int_0^1|f|$. With which of them is $C[0,1]$ a Banach space?

Idea The ramp sequence $f_n$ of Theorem 7.35 (with $f_n(0)=0$) is Cauchy in (A), (B) and (D) — in (D) $\|f_m-f_n\|=\|f_m-f_n\|_1$ — and the limit would have to be the discontinuous step.
Options (A), (B), (D) incomplete; (C) complete (Theorem 7.33).
Answer (C).

E2. CSIR Part B Let $T:(C[0,1],\|\cdot\|_\infty)\to(C[0,1],\|\cdot\|_\infty)$, $(Tf)(x)=\int_0^1\min(x,t)\,f(t)\,dt$. Then $\|T\|$ equals (A) $\frac14$; (B) $\frac12$; (C) $1$; (D) $2$.

Idea The kernel $\min(x,t)$ is continuous and non-negative, so $\|T\|=\max_x\int_0^1\min(x,t)\,dt$ (Theorem 7.41(2)).
Compute $\int_0^1\min(x,t)\,dt=\int_0^xt\,dt+\int_x^1x\,dt=x-\frac{x^2}2$, increasing on $[0,1]$, maximal at $x=1$: $\frac12$. (Checked symbolically.)
Answer (B).

E3. CSIR Part B Let $A=\begin{pmatrix}0&2\\1&0\end{pmatrix}$ act on $\mathbb{R}^2$ with the Euclidean norm. The operator norm of $A$ is (A) $1$; (B) $\sqrt2$; (C) $2$; (D) $3$.

Compute $A^TA=\begin{pmatrix}1&0\\0&4\end{pmatrix}$, so $\|A\|_{2\to2}=\sqrt4=2$, attained at $x=e_2$ ($Ae_2=(2,0)$).
Trap The eigenvalues are $\pm\sqrt2$; the spectral radius $\sqrt2$ is only a lower bound for the norm of a non-normal matrix. $3$ is the sum of all entries, $1$ a column norm of the wrong column.
Answer (C).

E4. CSIR Part C Let $X$ be an infinite-dimensional normed linear space. Which of the following statements are true? (A) The closed unit ball of $X$ is not compact. (B) Every linear functional on $X$ is continuous. (C) Every finite-dimensional subspace of $X$ is closed. (D) Any two norms on $X$ are equivalent.

(A) True Theorem 7.43 (Riesz's lemma).
(B) False E.g. $f\mapsto f'(0)$ on $(C^1[0,1],\|\cdot\|_\infty)$ ($f_n=\frac{\sin nx}n$), or $\sum x_n$ on $c_{00}$; in general a Hamel basis produces discontinuous functionals on every infinite-dimensional space.
(C) True Theorem 7.38(2).
(D) False $\|\cdot\|_1$ and $\|\cdot\|_\infty$ on $C[0,1]$ (Example 3(b)); on every infinite-dimensional space there are non-equivalent norms.
Answer (A) and (C).

E5. CSIR Part C Which of the following subsets of $(C[0,1],\|\cdot\|_\infty)$ have compact closure? (A) $\{x^n:n\in\mathbb{N}\}$; (B) $\{\frac{\sin(nx)}{n}:n\in\mathbb{N}\}$; (C) $\{f:\|f\|_\infty\le1\}$; (D) $\{f\in C^1[0,1]:\|f\|_\infty\le1,\ \|f'\|_\infty\le5\}$.

(A) No No subsequence converges uniformly (discontinuous pointwise limit); not equicontinuous at $1$.
(B) Yes $\|\frac{\sin nx}n\|_\infty\le\frac1n\to0$; the closure is the set together with $0$, a convergent sequence with its limit — compact. (Also $1$-Lipschitz and bounded.)
(C) No The closed unit ball of an infinite-dimensional space (Theorem 7.43; tents of Exercise IV.2).
(D) Yes Uniformly bounded and $5$-Lipschitz (mean value theorem): Arzelà–Ascoli.
Answer (B) and (D).

E6. CSIR Part C Which of the following sets are dense in $(C[0,1],\|\cdot\|_\infty)$? (A) The polynomials with rational coefficients. (B) $\{p\text{ polynomial}:p(0)=0\}$. (C) $\operatorname{span}\{1,x^3,x^6,x^9,\dots\}$. (D) $\operatorname{span}\{\sin(n\pi x):n\in\mathbb{N}\}$.

(A) Dense Weierstrass, then approximate coefficients by rationals (Theorem 7.46(a)).
(B) Not dense Every uniform limit vanishes at $0$; the constant $1$ is at distance $\ge1$ from the set.
(C) Dense The polynomials in $x^3$: an algebra with constants, and $x^3$ is injective. Stone–Weierstrass.
(D) Not dense Every member vanishes at $0$ and at $1$, hence so does every uniform limit; the constant $1$ is not approximable.
Answer (A) and (C).
🧑‍🏫 For the teacher

Suggested plan — 3 lectures × 60 min.

  1. Norms and completeness. Definition 7.21 and Theorem 7.32; Example 1(b) as a class poll. Theorem 7.33 (do the $\ell^p$ proof — it is the template for every "this space is complete" argument), Theorem 7.34, and Theorem 7.35 with a picture of the ramps. Example 2 as a rapid-fire round; end with the principle "complete = closed in a Banach space".
  2. Finite dimension and operators. Theorems 7.36–7.38 with the compactness proof of 7.37; Example 3 and Interactive 1 (start at $p=2$, slide to $p=1$, $p=\infty$, then below $1$). Theorems 7.39–7.41; Example 4 on the board (the Volterra computation and the Neumann series solving an integral equation are worth the time), Example 5 as "prove or disprove".
  3. Infinite dimensions and $C(K)$. Riesz's lemma and Theorem 7.43 with the explicit $e_n$ and tent sequences. Definition 7.24, Arzelà–Ascoli with the diagonal argument; Example 6 with Interactive 2 projected (families 1, 3, 2, then 4 and 5). Stone–Weierstrass (statement and idea), Theorem 7.46, Example 7. Close with E4 and E6.

Discussion questions. (1) Why is the sup norm the "right" norm on $C[a,b]$, and when would an engineer prefer $\|\cdot\|_2$? (2) The proof of Theorem 7.37 uses compactness of the unit sphere of $\mathbb{F}^n$. Which step breaks for $c_{00}$ with $\|\cdot\|_\infty$? (3) Arzelà–Ascoli and Bolzano–Weierstrass both say "bounded + something ⇒ convergent subsequence". What plays the role of "something" in $\mathbb{R}^n$, and why is nothing extra needed there?

Misconceptions to watch for. Assuming every norm on $C[0,1]$ is complete; "bounded operator" meaning bounded range; confusing spectral radius with operator norm; thinking closed and bounded implies compact in every normed space; believing every linear map is continuous; forgetting the constants (or conjugation) in Stone–Weierstrass; thinking pointwise convergence plus boundedness yields a uniformly convergent subsequence.

Suggested homework. I(1, 4, 6, 7), II(1, 3, 4, 7), III(1, 2, 4, 5, 7), IV(1, 4, 5, 8); Exam corner E2, E4, E5.

🔬 Research–Teaching NexusResearch-tutored · optional, about 60 minutes

Research question. How well can a polynomial of degree $n$ approximate the function $|x|$ on $[-1,1]$ in the sup norm, and is the error of the best polynomial much smaller than that of the Bernstein polynomials used to prove the Weierstrass theorem?

Why it matters. Every time a calculator, a graphics card or an embedded controller evaluates $\sqrt x$, $e^x$ or $\sin x$, it actually evaluates a polynomial (or rational function) chosen to minimise the maximum error over an interval — a best approximation in $(C[a,b],\|\cdot\|_\infty)$. The same minimax problem designs the digital filters in mobile phones and hearing aids. The kink of $|x|$ is the hardest case, and the rate at which its best error decays was a famous problem solved by S. N. Bernstein in 1914.

What to do.

  1. Write the best-approximation problem "minimise $t$ subject to $|p(x_j)-|x_j||\le t$ at many points $x_j$" as a linear programme in the coefficients of $p$ (use Chebyshev polynomials as the basis for numerical stability) and solve it for even degrees $n=2,4,6,10,20,40$.
  2. Tabulate the best error $E_n$ and the product $nE_n$. Check $E_2$ by hand: the best quadratic is $x^2+\frac18$.
  3. For the same $n$, compute the sup-norm error of the Bernstein polynomial of $|x|$ (after mapping $[-1,1]$ to $[0,1]$); it is largest at the kink.
  4. Plot the error curve $|x|-p^*(x)$ for $n=10$ and count its equioscillation points — compare with Chebyshev's alternation theorem.

Tools: Python with numpy and scipy.optimize.linprog (or any LP solver); a plotting library.

Hand in: The table of $E_n$, $nE_n$ and the Bernstein errors, a log–log plot of both errors against $n$, and two sentences on what the slopes tell you.

Going further. Read about Bernstein's constant $\beta=\lim_{n\to\infty}2nE_{2n}(|x|)$ and the high-precision computation by Varga and Carpenter that disproved Bernstein's guess $\beta=\frac1{2\sqrt\pi}$; try the Remez exchange algorithm instead of linear programming.

Instructor note: with 4001 Chebyshev points the LP gives $E_2=0.125$, $E_4\approx0.06762$, $E_{10}\approx0.02785$, $E_{20}\approx0.01399$, $E_{40}\approx0.00700$, so $nE_n$ climbs $0.250,\ 0.270,\ 0.278,\ 0.2797,\ 0.2800$ towards $\beta\approx0.28017$ (slightly below $\frac1{2\sqrt\pi}\approx0.28209$). The Bernstein error at the kink is about $\sqrt{2/(\pi n)}$: $0.2461$, $0.1254$, $0.0630$ for $n=10,40,160$ — slope $-\frac12$ against the best error's slope $-1$ on the log–log plot. The best degree-$n$ error curve equioscillates at $n/2+2$ points of $[0,1]$ (counting the even symmetry), as the alternation theorem for the even subspace predicts.

🧪 Self-check quiz

0/5 correct

Q1. Which of these normed spaces is not complete?

Q2. Which statement about norms on $\mathbb{R}^n$ is correct?

Q3. The closed unit ball of a normed space $X$ is compact if and only if

Q4. For $A=\begin{pmatrix}1&-3\\2&1\end{pmatrix}$ acting on $(\mathbb{R}^2,\|\cdot\|_\infty)$, the operator norm is

Q5. The sequence $f_n(x)=x^n$ in $(C[0,1],\|\cdot\|_\infty)$