Skip to content

The Fundamental Theorems

Infinite-dimensional analysis fails in ways finite-dimensional analysis does not. A linear functional on every finite-dimensional space is automatically continuous; on an infinite-dimensional normed space it need not be. A linear operator between finite-dimensional spaces is automatically bounded, and on infinite-dimensional ones it need not be. Compactness, closedness and continuity come apart in ways that have no finite-dimensional analogue.

The four theorems in this section are the repairs. Each one says that a plausible pathology cannot occur, provided the spaces are complete:

  • an everywhere-defined linear functional on a Banach space is bounded;
  • a surjective bounded operator between Banach spaces is open;
  • an everywhere-defined linear operator between Banach spaces with a closed graph is bounded;
  • a pointwise bounded family of bounded operators is uniformly bounded.

Completeness is not decoration. Every one of these is false on an incomplete space, and section 4.9 shows why: the proofs all consume the same ingredient, Baire’s theorem, which is a theorem about complete metric spaces and nothing else.

The shared idea is this. Completeness means a convergent Cauchy sequence lands somewhere in the space. Baire’s theorem turns that single property into: a complete space cannot be a countable union of thin sets. Once you have that, the three Baire-based theorems below all follow from the same three moves — assume a pathology, write the space as a countable union of closed sets, invoke Baire to find one with interior, and use the interior to bootstrap a uniform estimate out of a pointwise one.

This is the standard “principle of uniform boundedness” pattern, and seeing it three times in a row is the point of the section. What makes it feel like a trick the first time and like a tool the third time is that the pointwise-to-uniform gap is exactly what completeness closes.

Definition. A subset AA of a topological space is nowhere dense if its closure has empty interior. A space is meagre (or of first category) if it is a countable union of nowhere dense sets.

Theorem 4.1 (Baire Category Theorem). A complete metric space is not meagre in itself. Equivalently, if {Fn}n≥1\{F_n\}_{n \geq 1} are closed subsets of a complete metric space and their interiors are dense, then ⋂nFn\bigcap_n F_n is dense — and in particular nonempty.

Proof. Let (xn)(x_n) be a Cauchy sequence and suppose all FnF_n are closed with dense interior. Define

N0=∅,Nn={x:d(x,{x1,…,xn−1})≤2−n}.N_0 = \emptyset, \qquad N_n = \{x : d(x, \{x_1, \dots, x_{n-1}\}) \leq 2^{-n}\}.

Each NnN_n is closed, and NnN_n has empty interior: Nn−1∘N_{n-1}^\circ is dense and disjoint from NnN_n, because a point of NnN_n is within 2−n2^{-n} of some xn−1x_{n-1}, so a small ball about any point of Nn−1∘N_{n-1}^\circ avoids NnN_n. Hence NnN_n is nowhere dense.

Since XX is complete and not meagre, X≠⋃nNnX \neq \bigcup_n N_n, so there is y∈X∖⋃nNny \in X \setminus \bigcup_n N_n. As y∉N1y \notin N_1 there is x1∈F1x_1 \in F_1 with d(y,x1)<1/2d(y, x_1) < 1/2. Having x1,…,xn−1x_1, \dots, x_{n-1} with d(xn−1,y)<2−(n−1)d(x_{n-1}, y) < 2^{-(n-1)} and y∉Nny \notin N_n, there is xn∈Fnx_n \in F_n with d(xn,y)<2−nd(x_n, y) < 2^{-n}. So (xn)(x_n) is Cauchy and lies in FnF_n for all nn.

For each nn, FnF_n is closed and contains all xmx_m for m≥nm \geq n, so Fn∋lim⁡m→∞xm=yF_n \ni \lim_{m\to\infty} x_m = y. Completeness is used precisely here, and nowhere else. Hence y∈⋂nFny \in \bigcap_n F_n. ■\blacksquare

That completeness is load-bearing is not a rhetorical point: an incomplete metric space can be meagre in itself. Q⊂R\mathbb{Q} \subset \mathbb{R} is a countable union of singletons, each nowhere dense. So Baire fails, and with it the open mapping theorem. This is why “Banach” appears in every hypothesis below.

Theorem 4.2 (Hahn-Banach, analytic form). Let XX be a real vector space and p:X→Rp : X \to \mathbb{R} sublinear, meaning p(x+y)≤p(x)+p(y)p(x+y) \leq p(x) + p(y) and p(tx)=tp(x)p(tx) = tp(x) for t≥0t \geq 0. Let M≤XM \leq X be a subspace and f:M→Rf : M \to \mathbb{R} linear with f(m)≤p(m)f(m) \leq p(m) for all m∈Mm \in M. Then there is a linear F:X→RF : X \to \mathbb{R} with F∣M=fF|_M = f and F(x)≤p(x)F(x) \leq p(x) for all x∈Xx \in X.

Proof (one-dimensional extension, then Zorn). Given x0∉Mx_0 \notin M, we seek α∈R\alpha \in \mathbb{R} so that F(m+λx0)=f(m)+λαF(m + \lambda x_0) = f(m) + \lambda\alpha stays below pp on all of M+Rx0M + \mathbb{R}x_0. The constraint f(m)+λα≤p(m+λx0)f(m) + \lambda\alpha \leq p(m + \lambda x_0) must hold for every m∈Mm \in M and every λ∈R\lambda \in \mathbb{R}, so

λ>0:α≤p(m+λx0)−f(m)λ,λ<0:α≥p(m+λx0)−f(m)λ,\lambda > 0:\quad \alpha \leq \frac{p(m + \lambda x_0) - f(m)}{\lambda}, \qquad \lambda < 0:\quad \alpha \geq \frac{p(m + \lambda x_0) - f(m)}{\lambda},

the inequality flipping when dividing by a negative number. Hence we need α∈[a,b]\alpha \in [a, b] where

a=sup⁡m∈Mλ<0p(m+λx0)−f(m)λ,b=inf⁡m∈Mλ>0p(m+λx0)−f(m)λ.a = \sup_{\substack{m \in M \\ \lambda < 0}} \frac{p(m + \lambda x_0) - f(m)}{\lambda}, \qquad b = \inf_{\substack{m \in M \\ \lambda > 0}} \frac{p(m + \lambda x_0) - f(m)}{\lambda}.

Sublinearity gives a≤ba \leq b. To see it, fix λ>0\lambda > 0 and write λ=λ′+λ′′\lambda = \lambda' + \lambda'' with λ′,λ′′>0\lambda', \lambda'' > 0. By sublinearity of pp and linearity of ff,

f(λ′′x0)=f(m+λx0)−f(m+λ′x0)+f(m)≤p(m+λx0)−f(m+λ′x0)+f(m).f(\lambda'' x_0) = f(m + \lambda x_0) - f(m + \lambda' x_0) + f(m) \leq p(m + \lambda x_0) - f(m + \lambda' x_0) + f(m).

Dividing by λ′′>0\lambda'' > 0, the λ′′\lambda''-quotient is at most bb by definition, and the λ′\lambda'-quotient is at least aa. Since a≤p(m+λx0)−f(m)λ−f(m+λ′x0)−f(m)λ′′a \leq \frac{p(m+\lambda x_0) - f(m)}{\lambda} - \frac{f(m+\lambda'x_0)-f(m)}{\lambda''} and the right-hand term is at most bb, we get a≤ba \leq b. Choose α∈[a,b]\alpha \in [a,b]; then FF on M+Rx0M + \mathbb{R}x_0 is linear and bounded above by pp.

Order the set of pairs (N,F)(N, F) where NN is a subspace with M≤N≤XM \leq N \leq X and FF is linear on NN with F∣M=fF|_M = f and F≤pF \leq p on NN, ordered by extension. This set is inductive by the one-dimensional step. By Zorn there is a maximal element (N,F)(N, F). If N≠XN \neq X, pick x0∈X∖Nx_0 \in X \setminus N; the one-dimensional step produces a strictly larger element, a contradiction. So N=XN = X. ■\blacksquare

Theorem 4.3 (Hahn-Banach, normed form). If M≤XM \leq X is a subspace of a normed space and f∈M∗f \in M^*, then ff extends to F∈X∗F \in X^* with ∥F∥=∥f∥\|F\| = \|f\|.

Proof. Apply 4.2 with p(x)=∥f∥ ∥x∥p(x) = \|f\|\,\|x\|. Then f(m)≤∣f(m)∣≤∥f∥ ∥m∥=p(m)f(m) \leq |f(m)| \leq \|f\|\,\|m\| = p(m), so the hypothesis holds, and we get F≤pF \leq p. Applying the same to −f-f gives −F≤p-F \leq p, so ∣F(x)∣≤p(x)=∥f∥ ∥x∥|F(x)| \leq p(x) = \|f\|\,\|x\|, i.e. ∥F∥≤∥f∥\|F\| \leq \|f\|. Since FF extends ff, ∥f∥≤∥F∥\|f\| \leq \|F\|, hence ∥F∥=∥f∥\|F\| = \|f\|. ■\blacksquare

Corollary 4.4 (separating functionals). For x0≠0x_0 \neq 0 there is φ∈X∗\varphi \in X^* with ∥φ∥=1\|\varphi\| = 1 and φ(x0)=∥x0∥\varphi(x_0) = \|x_0\|.

Proof. Let M=Rx0M = \mathbb{R}x_0 and f(λx0)=λ∥x0∥f(\lambda x_0) = \lambda\|x_0\|. Then f≤∥⋅∥f \leq \|\cdot\| on MM and ∥f∥=1\|f\| = 1; extend. ■\blacksquare

Consequence. X∗X^* separates points, so {0}\{0\} is the only vector annihilated by every φ∈X∗\varphi \in X^*. Equivalently, the canonical embedding J:X→X∗∗J : X \to X^{**}, Jx(φ)=φ(x)Jx(\varphi) = \varphi(x), is injective. Recall from Bounded Linear Operators that JJ is an isometry, so it is also a homeomorphism onto its image. For a Hilbert space JJ is onto — that is the Riesz representation theorem. For a general Banach space it is onto only for reflexive spaces, and the Hahn-Banach corollary is exactly the “one half” that always holds.

Hahn-Banach builds the objects the theory needs. On ℓ∞\ell^\infty consider

L=lim⁡n→sup⁡sn,sn=x1+⋯+xnL = \lim_{n \to \sup} s_n, \qquad s_n = x_1 + \dots + x_n

where lim⁡n→sup⁡\lim_{n\to\sup} means lim sup⁡\limsup. This is bounded: ∣sn∣≤n∥x∥∞|s_n| \leq n\|x\|_\infty, and ∣L∣≤lim sup⁡∣sn∣|L| \leq \limsup |s_n| is finite but not ≤∥x∥∞\leq \|x\|_\infty, so LL does not yet dominate ∥⋅∥∞\|\cdot\|_\infty and Hahn-Banach cannot be applied directly to it.

The fix is to define the limiting set A={y:y1≥0, yn+1≥yn−1, lim inf⁡(y1+⋯+yn)≥0}A = \{y : y_1 \geq 0,\ y_{n+1} \geq y_n - 1, \ \liminf (y_1 + \dots + y_n) \geq 0\} in a larger space, show AA is convex and does not absorb nn, and apply Hahn-Banach to obtain φ\varphi dominated by ∥⋅∥∞\|\cdot\|_\infty and dominating LL. Then LIM(x)=φ(L(x))\mathrm{LIM}(x) = \varphi(L(x)) extends the ordinary limit, is linear, satisfies LIM(x)=LIM(Sx)\mathrm{LIM}(x) = \mathrm{LIM}(Sx) for the shift SS, and is positive. Such an object cannot be a multiple of the usual limit: it agrees with the limit on convergent sequences yet is non-zero on others, which is possible precisely because ℓ∞\ell^\infty has no continuous extension of the limit functional. That non-uniqueness is the phenomenon Banach limits were invented to exhibit.

Theorem 4.5 (Open Mapping, surjective form). Let X,YX, Y be Banach spaces and T∈B(X,Y)T \in \mathcal{B}(X, Y) surjective. Then there is C>0C > 0 with

BY(0,1)⊆T(BX(0,C))B_Y(0, 1) \subseteq T(B_X(0, C))

Theorem 4.6 (Open Mapping). Under the same hypotheses TT maps open sets to open sets.

Proof. Set Yn=T(BX(0,1/n))‾Y_n = \overline{T(B_X(0, 1/n))} for n≥1n \geq 1. Surjectivity gives Y=T(X)⊆⋃nYnY = T(X) \subseteq \bigcup_n Y_n.

Each YnY_n is closed: if yk→yy_k \to y with yk∈Yny_k \in Y_n and yk=lim⁡jT(xk,j)y_k = \lim_j T(x_{k,j}) for xk,j∈BX(0,1/n)x_{k,j} \in B_X(0, 1/n), then (xk,j)j(x_{k,j})_{j} is Cauchy, so XX being complete gives xk,j→xkx_{k,j} \to x_k with ∥xk∥≤1/n\|x_k\| \leq 1/n and T(xk)=ykT(x_k) = y_k. Hence xk→xx_k \to x with x∈BX(0,1/n)‾x \in \overline{B_X(0,1/n)} and Tx=yTx = y, so y∈Yny \in Y_n.

By Baire, some YnY_n has nonempty interior: Ym−Ym⊆Y2mY_m - Y_m \subseteq Y_{2m}, so Yn−YnY_n - Y_n contains Yn−y0Y_n - y_0 for y0∈Yn∘y_0 \in Y_n^\circ, and Yn−y0Y_n - y_0 contains a ball BY(y0,δ)B_Y(y_0, \delta) with y0∈Yny_0 \in Y_n. Thus BY(0,δ)⊆Yn−Yn⊆Y2nB_Y(0, \delta) \subseteq Y_n - Y_n \subseteq Y_{2n}.

Write u=a−bu = a - b with a,b∈Y2na, b \in Y_{2n}, so ∥a∥,∥b∥≤1/(2n)\|a\|, \|b\| \leq 1/(2n) and a−b=Txa - b = Tx for some x∈BX(0,1/n)x \in B_X(0, 1/n). Given yy with ∥y∥<δ/2k\|y\| < \delta/2^{k} for some kk, choose a1,b1∈Y4na_1, b_1 \in Y_{4n} with y=a1−b1y = a_1 - b_1 and ∥a1∥,∥b1∥<1/(4n)\|a_1\|, \|b_1\| < 1/(4n), so y=Tx1y = Tx_1 with ∥x1∥<1/(2n)\|x_1\| < 1/(2n). Then y/2=(a1−b1)/2y/2 = (a_1 - b_1)/2, and

y2=(a1−a12)+(a12−b1)=Tx2+Tx3\frac{y}{2} = \Big(a_1 - \frac{a_1}{2}\Big) + \Big(\frac{a_1}{2} - b_1\Big) = Tx_2 + Tx_3

with a1−a1/2=a1/2∈Y4n⊆Y2na_1 - a_1/2 = a_1/2 \in Y_{4n} \subseteq Y_{2n} and a1/2−b1=(a1−2b1)/2∈Y2na_1/2 - b_1 = (a_1 - 2b_1)/2 \in Y_{2n} because a1∈Y4n⊆Y2na_1 \in Y_{4n} \subseteq Y_{2n} and 2b1∈Y2n2b_1 \in Y_{2n}, so a1−2b1∈Y2na_1 - 2b_1 \in Y_{2n}. Thus y/2=Tx′y/2 = Tx' with ∥x′∥<1/n\|x'\| < 1/n. Applying this kk times, y=Txy = Tx with ∥x∥<2k/n\|x\| < 2^k/n.

Since ∥y∥<δ/2k\|y\| < \delta/2^k and ∥x∥<2k/n\|x\| < 2^k/n, we get ∥x∥<2δ−1∥y∥\|x\| < 2\delta^{-1}\|y\|. Taking C=2/δC = 2/\delta gives BY(0,1)⊆T(BX(0,C))B_Y(0,1) \subseteq T(B_X(0, C)). This is 4.5.

For 4.6, let U⊆XU \subseteq X be open and u0∈Uu_0 \in U. With r=d(u0,X∖U)>0r = d(u_0, X \setminus U) > 0, u0+BX(0,r)⊆Uu_0 + B_X(0, r) \subseteq U, so T(u0)+T(BX(0,r))⊆T(U)T(u_0) + T(B_X(0, r)) \subseteq T(U). For CC as above, BY(0,r/C)⊆T(BX(0,r))B_Y(0, r/C) \subseteq T(B_X(0, r)), so T(U)T(U) contains a ball about T(u0)T(u_0), i.e. T(U)T(U) is open. ■\blacksquare

Corollary 4.7 (Bounded Inverse). If T∈B(X,Y)T \in \mathcal{B}(X, Y) is bijective and X,YX, Y are Banach, then T−1∈B(Y,X)T^{-1} \in \mathcal{B}(Y, X).

Proof. By 4.6, TT is open. So T−1T^{-1} is continuous at 00, hence everywhere; and linear. Its norm is ∥T−1∥=sup⁡∥y∥≤1∥T−1y∥≤C<∞\|T^{-1}\| = \sup_{\|y\| \leq 1}\|T^{-1}y\| \leq C < \infty. ■\blacksquare

Theorem 4.8. Let XX be a vector space that is Banach under both norms ∥⋅∥1\|\cdot\|_1 and ∥⋅∥2\|\cdot\|_2. Suppose for some C>0C > 0, ∥x∥1≤C∥x∥2\|x\|_1 \leq C\|x\|_2 for all x∈Xx \in X. Then ∥x∥2≤C′∥x∥1\|x\|_2 \leq C'\|x\|_1 for some C′>0C' > 0; the norms are equivalent.

Proof. Let I:(X,∥⋅∥2)→(X,∥⋅∥1)I : (X, \|\cdot\|_2) \to (X, \|\cdot\|_1) be the identity. It is linear and bijective, and ∥Ix∥1≤C∥Ix∥2\|Ix\|_1 \leq C\|Ix\|_2, so I∈B(X2,X1)I \in \mathcal{B}(X_2, X_1). Both spaces are Banach, so 4.7 gives I−1∈B(X1,X2)I^{-1} \in \mathcal{B}(X_1, X_2) with ∥I−1∥=C′<∞\|I^{-1}\| = C' < \infty. Then ∥x∥2≤C′∥x∥1\|x\|_2 \leq C'\|x\|_1. ■\blacksquare

The completeness hypothesis on both norms is essential, and it is easy to misread the theorem as saying that one domination suffices. It does not. If XX is complete under only ∥⋅∥1\|\cdot\|_1, one inequality gives a continuous bijection whose inverse may be discontinuous — the canonical embedding of c0c_0 into ℓ∞\ell^\infty, or the identity from ℓ1\ell^1 to c0c_0, are the standard examples. Equivalence requires both directions, and it is completeness that produces the second one.

Theorem 4.9 (Closed Graph). Let X,YX, Y be Banach spaces and T:X→YT : X \to Y linear (no boundedness assumed). Then TT is bounded if and only if its graph Γ(T)={(x,Tx)}\Gamma(T) = \{(x, Tx)\} is closed in X×YX \times Y.

Proof (⇒\Rightarrow). A continuous map has closed graph when the codomain is Hausdorff: if (xn,Txn)→(x,y)(x_n, Tx_n) \to (x, y) then Txn→TxTx_n \to Tx by continuity and also →y\to y, so y=Txy = Tx.

(⇐\Leftarrow) Suppose Γ(T)\Gamma(T) is closed. The naive route — restricting TT to {x:Tx∈BY(0,1)‾}\{x : Tx \in \overline{B_Y(0,1)}\} and recursing — is circular, because the recursive instance is a closed graph theorem in its own right. The way out is to make the restricted domain complete.

Let X0={x∈X:Tx∈BY(0,1)‾}X_0 = \{x \in X : Tx \in \overline{B_Y(0,1)}\}, a subspace, and let X0‾\overline{X_0} be its closure in XX (so X0‾\overline{X_0} is Banach). Define T^:X0‾→Y\hat{T} : \overline{X_0} \to Y on the closure by xk→x∈X0‾x_k \to x \in \overline{X_0} implies T^x=lim⁡Txk\hat{T}x = \lim Tx_k. This limit exists: TxkTx_k is Cauchy in YY, and YY is complete; and it is independent of the approximating sequence, since if xk→xx_k \to x and yk→xy_k \to x then (xk−yk)→0(x_k - y_k) \to 0, so T(xk−yk)→0T(x_k - y_k) \to 0 by continuity of TT, and lim⁡Txk=lim⁡Tyk\lim Tx_k = \lim Ty_k. So T^\hat{T} is well defined and continuous, and it extends TT on X0X_0. It is surjective, because TT is surjective and every y∈Yy \in Y has Tx=yTx = y for some xx, hence y∈T(X0‾)y \in T(\overline{X_0}).

Both X0‾\overline{X_0} and YY are Banach, so 4.5 gives CC with BY(0,1)⊆T^(BX0‾(0,C))B_Y(0,1) \subseteq \hat{T}(B_{\overline{X_0}}(0, C)). Since BX(0,C)⊆BX0‾(0,C)B_X(0, C) \subseteq B_{\overline{X_0}}(0, C), we get BY(0,1)⊆T(BX(0,C))B_Y(0,1) \subseteq T(B_X(0, C)) and therefore ∥Tx∥≤C∥x∥\|Tx\| \leq C\|x\| for x∈X0x \in X_0.

Finally, X=⋃n≥1nX0X = \bigcup_{n\geq 1} nX_0: for any x∈Xx \in X take n>1/∥x∥n > 1/\|x\|, so x/n∈BX(0,1)⊆X0x/n \in B_X(0,1) \subseteq X_0 and x∈nX0x \in nX_0. A vector space cannot be a finite union of proper subspaces — pick the largest index nn with nX0≠XnX_0 \neq X and a point outside it, and it lies in none of the others — so X0=XX_0 = X. Hence ∥Tx∥≤C∥x∥\|Tx\| \leq C\|x\| on all of XX. ■\blacksquare

Theorem 4.10 (Closed Range). For T∈B(X,Y)T \in \mathcal{B}(X, Y) with X,YX, Y Banach, these are equivalent: (i) R(T)R(T) is closed in YY; (ii) R(T∗)R(T^*) is closed in X∗X^*; (iii) there is c>0c>0 such that every y∈R(T)y \in R(T) has xx with Tx=yTx = y and ∥x∥≤c∥y∥\|x\| \leq c\|y\|.

Proof sketch. (iii) ⇒\Rightarrow (i) is immediate from the estimate. For (i) ⇒\Rightarrow (iii), TT is open onto R(T)R(T), giving (iii) with the norm of R(T)R(T); for (ii) ⇒\Rightarrow (i), apply the open mapping theorem to T∗T^* between X∗X^* and R(T∗)⊥R(T^*)^\perp and use R(T∗)‾=(T(X))⊥\overline{R(T^*)} = (T(X))^\perp. ■\blacksquare

Theorem 4.11 (Banach-Steinhaus). Let XX be a Banach space, YY a normed space, and {Tα}α∈A⊆B(X,Y)\{T_\alpha\}_{\alpha \in A} \subseteq \mathcal{B}(X, Y) with sup⁡α∥Tαx∥<∞\sup_\alpha \|T_\alpha x\| < \infty for each x∈Xx \in X. Then sup⁡α∥Tα∥<∞\sup_\alpha \|T_\alpha\| < \infty.

Proof. Let En={x∈X:sup⁡α∥Tαx∥≤n}E_n = \{x \in X : \sup_\alpha \|T_\alpha x\| \leq n\}. By hypothesis X=⋃n≥1EnX = \bigcup_{n\geq1} E_n. Each EnE_n is closed: if xk→xx_k \to x with xk∈Enx_k \in E_n then Tαxk→TαxT_\alpha x_k \to T_\alpha x for each α\alpha, so ∥Tαx∥≤n\|T_\alpha x\| \leq n.

By Baire, some EnE_n has nonempty interior, so BX(x0,r)⊆EnB_X(x_0, r) \subseteq E_n for some x0x_0 and r>0r > 0. Given x∈BX(0,r)x \in B_X(0, r), both x0+xx_0 + x and x0x_0 lie in EnE_n, so by linearity

∥Tαx∥=∥Tα(x0+x)−Tαx0∥≤n+n=2n\|T_\alpha x\| = \|T_\alpha(x_0 + x) - T_\alpha x_0\| \leq n + n = 2n

for every α\alpha. Rescaling, ∥Tα∥≤2nr\|T_\alpha\| \leq \frac{2n}{r}. ■\blacksquare

This is the Baire pattern in its purest form, and it is worth being explicit about where each hypothesis is used. Pointwise boundedness gives the cover X=⋃nEnX = \bigcup_n E_n; linearity makes each EnE_n closed; completeness gives Baire; Baire gives an interior point; and the interior is what turns a bound that may depend on xx into one that does not.

Corollary 4.12 (Resonance Theorem). If {Tn}⊆B(X,Y)\{T_n\} \subseteq \mathcal{B}(X, Y) and lim⁡nTnx\lim_n T_n x exists for every x∈Xx \in X, then Tx=lim⁡nTnxT x = \lim_n T_n x defines T∈B(X,Y)T \in \mathcal{B}(X, Y).

Proof. A convergent sequence is bounded, so sup⁡n∥Tnx∥<∞\sup_n \|T_n x\| < \infty for each xx, and 4.11 applies to give sup⁡n∥Tn∥=C\sup_n \|T_n\| = C. Then TT is linear (interchange limits and finite sums) and

∥Tx−Tnx∥=lim⁡m→∞∥Tmx−Tnx∥≤lim sup⁡m→∞2C∥x∥=0,\|Tx - T_n x\| = \lim_{m\to\infty} \|T_m x - T_n x\| \leq \limsup_{m\to\infty} 2C\|x\| = 0,

so ∥Tx∥≤C∥x∥\|Tx\| \leq C\|x\|, i.e. T∈B(X,Y)T \in \mathcal{B}(X,Y). ■\blacksquare

Fourier series diverge for some continuous functions. Let SnfS_n f be the nn-th partial sum operator on C[−π,π]C[-\pi,\pi]. If every continuous ff had ∥Snf∥∞\|S_n f\|_\infty bounded for each fixed ff, 4.11 would give sup⁡n∥Sn∥<∞\sup_n \|S_n\| < \infty. But Snf=12π∫−ππf(t)Dn(t) dtS_n f = \frac{1}{2\pi}\int_{-\pi}^{\pi} f(t) D_n(t)\,dt with Dn(t)=∑k=−nneiktD_n(t) = \sum_{k=-n}^n e^{ikt}, so

∥Sn∥=12π∫−ππ∣Dn(t)∣ dt∼2πlog⁡n→∞.\|S_n\| = \frac{1}{2\pi}\int_{-\pi}^{\pi}|D_n(t)|\,dt \sim \frac{2}{\pi}\log n \to \infty.

So sup⁡n∥Sn∥=∞\sup_n \|S_n\| = \infty, and by contraposition some f∈C[−π,π]f \in C[-\pi,\pi] has sup⁡n∥Snf∥∞=∞\sup_n \|S_n f\|_\infty = \infty: a continuous function whose Fourier series diverges. This is the classical existence proof, and it is worth noticing what it needed — no explicit bad function, only the failure of a uniform bound that the theorem makes unavoidable.

Weakly bounded implies norm bounded. For a single family, sup⁡α∣⟨Tαx,y⟩∣<∞\sup_\alpha |\langle T_\alpha x, y\rangle| < \infty for all x,yx, y implies sup⁡α∥Tα∥<∞\sup_\alpha \|T_\alpha\| < \infty. Weak convergence is weaker than norm convergence at the level of sequences, but for families the two notions of boundedness coincide on a Banach domain. That contrast is the content of Weak and Weak* Convergence.

Higher derivatives are unbounded, and nowhere-differentiable functions are generic. Let Dn:C1[0,1]→C[0,1]D^n : C^1[0,1] \to C[0,1], Dnf=f(n)D^n f = f^{(n)}. With the norm ∥f∥∞\|f\|_\infty on C1[0,1]C^1[0,1], each DnD^n is unbounded: take f(x)=xn/n!f(x) = x^n / n!, so ∥f∥∞=1/n!\|f\|_\infty = 1/n! while ∥Dnf∥∞=1\|D^n f\|_\infty = 1. The operator norms blow up like n!n!. This is a fact about the domain, not the operator — on C1C^1 with ∥f∥∞+∥f′∥∞\|f\|_\infty + \|f'\|_\infty, DD is bounded with norm 11. Which norm you equip a space with is part of specifying an operator.

The same Baire argument that proves uniform boundedness produces the classical consequence. Let EnE_n be the set of continuous ff that are not differentiable on any interval of length >1/n> 1/n. Each EnE_n is closed, and each is dense: a polynomial plus a small multiple of the Weierstrass nowhere-differentiable function stays inside EnE_n while being arbitrarily close to the polynomial. Baire gives ⋂nEn\bigcap_n E_n dense, so nowhere-differentiable continuous functions are residual — generic, not exotic.

They are not four independent facts.

  • Hahn-Banach is the odd one out: it needs no Baire and no completeness. Its content is that X∗X^* is large enough to separate points.
  • Open mapping, closed graph and uniform boundedness are all Baire, and all three share the skeleton: write the space as a countable union of closed sets indexed by a bound, let Baire select a set with interior, and use the interior to upgrade a pointwise estimate to a uniform one.
  • Closed graph is derived from open mapping in 4.4, by completing the domain and then showing the domain was already everything.
  • Hahn-Banach + the open mapping theorem give the closed range theorem, and Hahn-Banach + reflexivity give the Riesz representation theorem.

The one-line summary: completeness plus Baire is what stops a pointwise statement from being a uniform one, and the three Baire-based theorems are three faces of that single fact.

4.7 Applications in Partial Differential Equations

Section titled “4.7 Applications in Partial Differential Equations”

Weak solutions of the Dirichlet problem. Let Ω\Omega be bounded. The operator A:H01(Ω)→H−1(Ω)A : H^1_0(\Omega) \to H^{-1}(\Omega), Au=−ΔuAu = -\Delta u with zero trace, is bounded, and the form a(u,v)=∫Ω∇u⋅∇va(u, v) = \int_\Omega \nabla u \cdot \nabla v is continuous and coercive on H01(Ω)H^1_0(\Omega):

a(v,v)=∥∇v∥22≥λ∥v∥22a(v, v) = \|\nabla v\|_2^2 \geq \lambda \|v\|_2^2

with λ>0\lambda > 0 by Poincare. The Lax-Milgram lemma — which is Hahn-Banach for coercivity plus the Hilbert-space geometry — gives a unique u∈H01(Ω)u \in H^1_0(\Omega) with a(u,v)=⟨f,v⟩a(u,v) = \langle f, v\rangle for every vv. Existence, uniqueness and continuous dependence on ff all come from the functional-analytic theorems, not from regularity estimates on Δ\Delta.

Neumann series. If T∈B(X)T \in \mathcal{B}(X) with ∥T∥<1\|T\| < 1, then I−TI - T is invertible with

(I−T)−1=∑n=0∞Tn,(I-T)^{-1} = \sum_{n=0}^{\infty} T^n,

because the series converges in operator norm (so ∥S−TnS∥→0\|S - T^n S\| \to 0 by comparing geometric series) and I−TI - T is injective: (I−T)x=0(I-T)x = 0 gives x=Txx = Tx, so ∥x∥≤∥T∥∥x∥<∥x∥\|x\| \leq \|T\|\|x\| < \|x\| unless x=0x = 0; surjectivity then follows from 4.7. This is the resolvent of a bounded operator off the closed unit disc, and it is what makes spectral theory for bounded operators work.

Compactness of the embedding. In finite dimensions every bounded set is compact. The failure of that in infinite dimensions — the unit ball of ℓ2\ell^2 has no convergent subsequence — is what makes compactness arguments, and hence the Arzela-Ascoli and Rellich-Kondrachov theorems, carry real content here. The repairs are exactly the theorems above: a weakly convergent sequence that is bounded has a weakly convergent subsequence in a separable reflexive space, and the boundedness comes from uniform boundedness applied to the evaluation functionals.

Problem 1. Let MM be a closed subspace of a Hilbert space HH. Show that H=M⊕M⊥H = M \oplus M^\perp and that Px=x−PM⊥xP x = x - P_{M^\perp} x is the orthogonal projection, with ∥P∥=1\|P\| = 1 if M≠{0}M \neq \{0\}.

Problem 2. Show that T−1T^{-1} is bounded whenever TT is a bijective bounded operator between Banach spaces. Do not cite the open mapping theorem; prove it, and identify where completeness of both spaces is used.

Problem 3. Let fn∈X∗f_n \in X^* and suppose lim⁡nfn(x)\lim_n f_n(x) exists for every x∈Xx \in X. Show the limit functional is bounded. Which theorem applies, and what would fail if XX were only a normed space?

Problem 4. Show the differentiation operator D:C1[0,1]→C[0,1]D : C^1[0,1] \to C[0,1], Df=f′Df = f' is unbounded when C1[0,1]C^1[0,1] carries ∥⋅∥∞\|\cdot\|_\infty, and bounded when it carries ∥f∥∞+∥f′∥∞\|f\|_\infty + \|f'\|_\infty. What does this say about why a domain is part of an operator’s definition?

Problem 5. Prove that if T∈B(X,X)T \in \mathcal{B}(X, X) with ∥T∥<1\|T\| < 1 then I−TI - T is invertible, constructing the inverse explicitly.

Problem 6. Show the closed graph theorem follows from the open mapping theorem and the bounded inverse theorem.

Problem 7. Prove that if T:X→YT : X \to Y is linear between Banach spaces and xn→0x_n \to 0 with Txn→yTx_n \to y forces y=0y = 0, then TT is bounded.

Problem 8 (important). Someone claims: “for any closed subspace MM of a Banach space XX, the quotient map π:X→X/M\pi : X \to X/M has an isometric right inverse.” Find the flaw. The claim is true when XX is a Hilbert space (Problem 1), so the argument is to identify exactly which step uses Hilbert structure, and then to give an example of a Banach space with a closed subspace admitting no complement at all.

  • All three Baire-based theorems are one theorem applied three times, each following the pattern: assume a pathology, cover the space by level sets of a bound, get interior from Baire, upgrade pointwise to uniform.
  • Completeness is necessary and not decorative. Q\mathbb{Q} is meagre in itself, so Baire fails there and so does the open mapping theorem.
  • Hahn-Banach needs neither Baire nor completeness, and is the only one of the four that holds on a bare vector space with a sublinear gauge.
  • Closed graph follows from open mapping by completing the domain, then showing the domain was everything.
  • A bijective bounded operator between Banach spaces has a bounded inverse. Drop completeness on either side and this fails, which is the standard way to exhibit incomplete spaces.
  • One norm dominating another is not equivalence unless both norms make the space Banach.
  • Confusing Hahn-Banach with the open mapping theorem. Hahn-Banach extends functionals from subspaces while preserving the norm; the open mapping theorem is about surjectivity of operators and openness of images. Extension versus mapping. Substituting one for the other is the most common confusion in the subject.
  • Applying the open mapping theorem without checking hypotheses. Both spaces must be Banach and TT must be surjective. The identity from an incomplete normed space to its completion is bijective and continuous but not open.
  • Reading uniform boundedness as pointwise boundedness. UBP’s hypothesis is sup⁡α∥Tαx∥<∞\sup_\alpha \|T_\alpha x\| < \infty for each xx, with the bound allowed to depend on xx; the conclusion is a bound independent of xx. That gap is the content of the theorem, and it needs XX Banach.
  • Assuming one norm inequality gives equivalence. It gives continuity in one direction only. Equivalence needs both, and completeness is what manufactures the second from the first.
  • Claiming every closed subspace of a Banach space has a complement. True for Hilbert spaces via orthogonal complements; false in general. See Problem 8.
  • Proving the closed graph theorem by recursion on the graph. It is circular: the recursive step needs the theorem. Complete the domain and use openness, then argue the domain was everything.
  • Believing completeness is technical. Every Baire-based theorem above is false on an incomplete space. Q\mathbb{Q} shows the mechanism in one line.