Skip to content

Bounded Linear Operators

A linear operator T:X→YT : X \to Y between normed spaces is bounded if there exists C≥0C \geq 0 such that ∥Tx∥Y≤C∥x∥X\|Tx\|_Y \leq C\|x\|_X for all x∈Xx \in X. The operator norm is

∥T∥=sup⁡{∥Tx∥Y:∥x∥X≤1}=sup⁡{∥Tx∥Y:∥x∥X=1}\|T\| = \sup\{\|Tx\|_Y : \|x\|_X \leq 1\} = \sup\{\|Tx\|_Y : \|x\|_X = 1\}

Proposition 3.1. A linear operator is bounded if and only if it is continuous.

Proposition 3.2. TT is bounded if and only if it maps bounded sets to bounded sets.

The space B(X,Y)\mathcal{B}(X, Y) of all bounded linear operators from XX to YY is a Banach space when YY is complete, with the operator norm.

Example 1. The identity operator I:X→XI : X \to X has ∥I∥=1\|I\| = 1.

Example 2. The zero operator 0:X→Y0 : X \to Y has ∥0∥=0\|0\| = 0.

Example 3. Let T:ℓ2→ℓ2T : \ell^2 \to \ell^2 be defined by T(x1,x2,…)=(0,x1,x2,…)T(x_1, x_2, \ldots) = (0, x_1, x_2, \ldots) (right shift). Then ∥T∥=1\|T\| = 1.

Example 4. The multiplication operator (Mgf)(x)=g(x)f(x)(M_g f)(x) = g(x)f(x) on L2L^2 is bounded with ∥Mg∥=∥g∥∞\|M_g\| = \|g\|_\infty.

The dual space of XX is X∗=B(X,R)X^* = \mathcal{B}(X, \mathbb{R}) (or B(X,C)\mathcal{B}(X, \mathbb{C})), the space of all bounded linear functionals.

Theorem 3.3. X∗X^* is always a Banach space.

Theorem 3.4. (ℓ1)∗≅ℓ∞(\ell^1)^* \cong \ell^\infty via φ(x)=∑xnyn\varphi(x) = \sum x_n y_n for y∈ℓ∞y \in \ell^\infty.

Theorem 3.5. (ℓp)∗≅ℓq(\ell^p)^* \cong \ell^q for 1≤p<∞1 \leq p < \infty where 1/p+1/q=11/p + 1/q = 1.

Theorem 3.6. (c0)∗≅ℓ1(c_0)^* \cong \ell^1 where c0={(xn):xn→0}c_0 = \{(x_n) : x_n \to 0\}.

Let MM be a subspace of a normed space XX. The annihilator of MM is

M⊥={φ∈X∗:φ(x)=0 for all x∈M}M^\perp = \{\varphi \in X^* : \varphi(x) = 0 \text{ for all } x \in M\}

Let NN be a subspace of X∗X^*. The pre-annihilator of NN is

⊥N={x∈X:φ(x)=0 for all φ∈N}{}^\perp N = \{x \in X : \varphi(x) = 0 \text{ for all } \varphi \in N\}

Proposition 3.7. If M⊆XM \subseteq X is a subspace, then M⊥M^\perp is a closed subspace of X∗X^*. If N⊆X∗N \subseteq X^* is a subspace, then ⊥N{}^\perp N is a closed subspace of XX.

The page states fifteen results; the proofs below are the ones that carry the subject, chosen because their arguments; linearity converts boundedness to continuity at a point, completeness passes to operator spaces, Hölder identifies duals; are the ones every later page reuses.

Proposition 3.1 (bounded iff continuous). A linear operator TT between normed spaces is bounded iff it is continuous.

Proof. (⇒\Rightarrow) If ∥T∥≤C\|T\| \leq C then ∥Tx−Ty∥=∥T(x−y)∥≤C∥x−y∥\|Tx - Ty\| = \|T(x-y)\| \leq C\|x-y\|, and ϵ\epsilon–δ\delta continuity follows with δ=ϵ/C\delta = \epsilon/C.

(⇐\Leftarrow) Continuity at 00 gives δ>0\delta > 0 with ∥x∥≤δ⇒∥Tx∥≤1\|x\| \leq \delta \Rightarrow \|Tx\| \leq 1. Every nonzero xx can be scaled to x/(∥x∥/δ)=δx/∥x∥x/(\|x\|/\delta) = \delta x/\|x\|, which has norm δ\delta, so ∥Tx∥≤∥x∥/δ\|Tx\| \leq \|x\|/\delta; bounded with C=1/δC = 1/\delta. Linearity enters in the scaling step: without it, continuity at a point says nothing about other points. ■\blacksquare

Theorem 3.3 (B(X,Y)\mathcal{B}(X,Y) is Banach). If YY is complete, then B(X,Y)\mathcal{B}(X, Y) with the operator norm is a Banach space.

Proof. B(X,Y)\mathcal{B}(X,Y) is a vector space, and the operator norm is a norm: homogeneity and the triangle inequality come from the norm on YY, and ∥T∥=0⇒Tx=0\|T\| = 0 \Rightarrow Tx = 0 for all ∥x∥≤1⇒T=0\|x\| \leq 1 \Rightarrow T = 0.

For completeness, let (Tn)(T_n) be Cauchy in operator norm. Then for each xx, ∥Tnx−Tmx∥≤∥Tn−Tm∥ ∥x∥\|T_nx - T_mx\| \leq \|T_n - T_m\|\,\|x\| shows (Tnx)(T_nx) is Cauchy in YY, which is complete, so Tnx→SxT_nx \to Sx for some SxSx. Define TT by Tx=SxTx = Sx; linearity passes to the limit. The Cauchy condition gives, for each ϵ\epsilon an NN with ∥Tn−Tm∥<ϵ\|T_n - T_m\| < \epsilon for n,m≥Nn, m \geq N; letting m→∞m \to \infty in ∥Tnx−Tmx∥≤ϵ∥x∥\|T_nx - T_mx\| \leq \epsilon\|x\|; legitimate because YY‘s norm is continuous; gives ∥(Tn−T)x∥≤ϵ∥x∥\|(T_n - T)x\| \leq \epsilon\|x\| for all xx and n≥Nn \geq N. So T−Tn∈B(X,Y)T - T_n \in \mathcal{B}(X,Y) with norm at most ϵ\epsilon: TT is bounded and Tn→TT_n \to T in operator norm. ■\blacksquare

The proof is the completeness transfer pattern; pointwise Cauchy, identify the limit, then upgrade the convergence using the operator-norm structure; and it is the same argument that makes the space of bounded bilinear forms, and every B(X,Y)\mathcal{B}(X,Y) variant, complete. Note that completeness of YY is essential: B(X,Y)\mathcal{B}(X, Y) inherits Cauchy limits pointwise, and without YY‘s completeness the pointwise limits need not exist.

Theorem 3.5 ((ℓp)∗≅ℓq( \ell^p)^* \cong \ell^q). For 1≤p<∞1 \leq p < \infty with 1/p+1/q=11/p + 1/q = 1, every φ∈(ℓp)∗\varphi \in (\ell^p)^* is φ(x)=∑nxnyn\varphi(x) = \sum_n x_n y_n for a unique y∈ℓqy \in \ell^q, and the map y↦φy \mapsto \varphi is an isometric isomorphism.

Proof. Let ene_n be the standard basis. Set yn=φ(en)y_n = \varphi(e_n). For x∈ℓpx \in \ell^p define the truncations x(N)=(x1,…,xN,0,… )x^{(N)} = (x_1, \dots, x_N, 0, \dots); by linearity φ(x(N))=∑n≤Nxnyn\varphi(x^{(N)}) = \sum_{n \leq N} x_n y_n.

Bound on the tail coefficients. For fixed nn, consider the vector x(α)=(…,0,eiαn∣yn∣q−1sgn⁡(yn),0,… )x(\alpha) = (\dots, 0, e^{i\alpha_n}|y_n|^{q-1}\operatorname{sgn}(y_n), 0, \dots) with the phase chosen so ∣yn∣q=e−iαnyn∣yn∣q−1|y_n|^q = e^{-i\alpha_n}y_n|y_n|^{q-1}, supported at nn and scaled to make ∥x(α)∥p=∣yn∣q−1\|x(\alpha)\|_p = |y_n|^{q-1}. Then

∣φ(x(α))∣≤∥φ∥ ∣yn∣q−1⇒∣yn∣q≤∥φ∥ ∣yn∣q−1⇒∣yn∣≤∥φ∥,|\varphi(x(\alpha))| \leq \|\varphi\|\,|y_n|^{q-1} \Rightarrow |y_n|^q \leq \|\varphi\|\,|y_n|^{q-1} \Rightarrow |y_n| \leq \|\varphi\|,

when yn≠0y_n \neq 0; for p=1p = 1 the same computation with the sup norm gives sup⁡n∣yn∣≤∥φ∥\sup_n |y_n| \leq \|\varphi\|. So y∈ℓ∞y \in \ell^\infty; for q<∞q < \infty, apply the same construction to the truncations: for x(N)x^{(N)} scaled by t=∥x(N)∥p1−p≥0t = \|x^{(N)}\|_p^{1-p} \geq 0,

∑n≤N∣yn∣q=φ(t x(N))-magnitude≤∥φ∥ ∥x(N)∥p⋅∥x(N)∥pp−1≤∥φ∥q,\sum_{n \leq N} |y_n|^q = \varphi\big(t\,x^{(N)}\big)\text{-magnitude} \leq \|\varphi\|\,\|x^{(N)}\|_p \cdot \|x^{(N)}\|_p^{p-1} \leq \|\varphi\|^q,

uniformly in NN, so y∈ℓqy \in \ell^q with ∥y∥q≤∥φ∥\|y\|_q \leq \|\varphi\|.

Representation and isometry. Hölder’s inequality says the map y↦φyy \mapsto \varphi_y, φy(x)=∑xnyn\varphi_y(x) = \sum x_ny_n, is bounded with ∥φy∥≤∥y∥q\|\varphi_y\| \leq \|y\|_q, and equality is attained by the phase-aligned sequence; so ∥φy∥=∥y∥q\|\varphi_y\| = \|y\|_q. The truncations x(N)→xx^{(N)} \to x in ℓp\ell^p (dominated convergence, since x∈ℓpx \in \ell^p), and φ\varphi is continuous, so

φ(x)=lim⁡Nφ(x(N))=lim⁡N∑n≤Nxnyn=∑nxnyn,\varphi(x) = \lim_N \varphi(x^{(N)}) = \lim_N \sum_{n\leq N} x_ny_n = \sum_n x_ny_n,

which is the representation, with isometry from ∥y∥q≤∥φ∥≤∥y∥q\|y\|_q \leq \|\varphi\| \leq \|y\|_q. Uniqueness: φ(en)=yn\varphi(e_n) = y_n determines yy. ■\blacksquare

The two estimates worth internalising: the phase-aligned truncation that bounds ℓq\ell^q-norms of the coefficients uniformly in NN; choosing signs to make each term contribute maximally is the standard move; and Hölder’s inequality providing both the boundedness and the isometry. The companion results, that (c0)∗=ℓ1(c_0)^* = \ell^1 and (Lp)∗=Lq(L^p)^* = L^q, follow the same proof with the approximating family changed: finitely supported sequences for c0c_0, simple functions for LpL^p. What has no such proof is (L∞)∗(L^\infty)^* and (ℓ∞)∗(\ell^\infty)^*: their duals are the ba spaces, strictly larger than L1L^1; a non-separability fact that marks the boundary of this theorem.

Proposition 3.7 (annihilators are closed) and the double-annihilator identity (M⊥)⊥=Mˉ(M^\perp)^\perp = \bar M.

Proof of closedness. For x∈Mx \in M, the map φ↦φ(x)\varphi \mapsto \varphi(x) is continuous on X∗X^*, and M⊥M^\perp is the intersection of its kernels; an intersection of closed sets is closed. The pre-annihilator is the same argument with roles swapped. ■\blacksquare

Proof of (M⊥)⊥=Mˉ(M^\perp)^\perp = \bar M for a subspace MM of a normed space XX. Mˉ⊆(M⊥)⊥\bar M \subseteq (M^\perp)^\perp: if x∈Mˉx \in \bar M, take mk∈Mm_k \in M with mk→xm_k \to x; for φ∈M⊥\varphi \in M^\perp, continuity gives φ(x)=lim⁡φ(mk)=0\varphi(x) = \lim \varphi(m_k) = 0, so x∈(M⊥)⊥x \in (M^\perp)^\perp.

For the converse, suppose x∈(M⊥)⊥x \in (M^\perp)^\perp but x∉Mˉx \notin \bar M. Since Mˉ\bar M is closed and xx is at positive distance from it, the geometric form of Hahn–Banach separates: there is φ∈X∗\varphi \in X^* and cc with Re⁡φ(x)>c≥Re⁡φ(m)\operatorname{Re}\varphi(x) > c \geq \operatorname{Re}\varphi(m) for all m∈Mˉm \in \bar M. Scaling by a constant and using that MM is a subspace; so m/∥m∥m/ \|m\|-style scaling keeps φ(m)\varphi(m) at whatever value it has; gives φ∣M=0\varphi|_M = 0, i.e. φ∈M⊥\varphi \in M^\perp. But then φ(x)=0\varphi(x) = 0 by x∈(M⊥)⊥x \in (M^\perp)^\perp, contradicting Re⁡φ(x)>c≥0\operatorname{Re}\varphi(x) > c \geq 0 for the cc chosen positive. ■\blacksquare

This identity is why quotient-space duality works: (X/M)∗≅M⊥(X/M)^* \cong M^\perp, and combined with (M⊥)⊥=Mˉ(M^\perp)^\perp = \bar M it says the dual of the quotient is exactly the functionals vanishing on MM; the bridge between the quotient-space constructions of the abstract algebra track and the normed-space theory here.

Proposition 3.8. For a subspace M⊆XM \subseteq X, ⊥(M⊥)=M‾{}^\perp(M^\perp) = \overline{M} (the closure of MM).

Proposition 3.9. For finite-dimensional subspaces M⊆XM \subseteq X, (X/M)∗≅M⊥(X/M)^* \cong M^\perp.

The double dual (or bidual) of XX is X∗∗=(X∗)∗X^{**} = (X^*)^*. There is a natural embedding J:X↪X∗∗J : X \hookrightarrow X^{**} defined by (Jx)(φ)=φ(x)(Jx)(\varphi) = \varphi(x) for φ∈X∗\varphi \in X^*. The Hahn-Banach theorem guarantees that JJ is an isometric embedding: ∥Jx∥X∗∗=∥x∥X\|Jx\|_{X^{**}} = \|x\|_X.

Definition. A normed space XX is reflexive if the canonical embedding J:X→X∗∗J : X \to X^{**} is surjective, i.e., J(X)=X∗∗J(X) = X^{**}.

Proposition 3.10. Every reflexive space is a Banach space.

Example. ℓp\ell^p is reflexive for 1<p<∞1 < p < \infty since (ℓp)∗∗≅(ℓq)∗≅ℓp(\ell^p)^{**} \cong (\ell^q)^* \cong \ell^p.

Example. Lp(μ)L^p(\mu) is reflexive for 1<p<∞1 < p < \infty.

Example. ℓ1\ell^1, ℓ∞\ell^\infty, and c0c_0 are not reflexive. In particular, (ℓ1)∗∗≅(ℓ∞)∗⊋ℓ1(\ell^1)^{**} \cong (\ell^\infty)^* \supsetneq \ell^1, and (c0)∗∗≅ℓ∞⊋c0(c_0)^{**} \cong \ell^\infty \supsetneq c_0.

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

Theorem 3.12. If XX is reflexive, then every bounded sequence has a weakly convergent subsequence (Eberlein-Smulian theorem). In particular, every continuous linear functional achieves its norm on the closed unit ball.

Worked Example. Show that c0c_0 is not reflexive. Since (c0)∗≅ℓ1(c_0)^* \cong \ell^1 by Theorem 3.6, and (ℓ1)∗≅ℓ∞(\ell^1)^* \cong \ell^\infty by Theorem 3.4, we have (c0)∗∗≅ℓ∞(c_0)^{**} \cong \ell^\infty. The canonical embedding J:c0↪ℓ∞J : c_0 \hookrightarrow \ell^\infty is the inclusion map. Since ℓ∞\ell^\infty contains bounded sequences that do not converge to zero (e.g., the constant sequence (1,1,1,…)(1, 1, 1, \ldots)), JJ is not surjective, so c0c_0 is not reflexive.

  • Boundedness and continuity are equivalent for linear operators between normed spaces.
  • The operator norm is submultiplicative: ∥ST∥≤∥S∥∥T∥\|ST\| \leq \|S\|\|T\| for composable operators.
  • Reflexivity implies the Banach space property but not conversely.
  • The double dual X∗∗X^{**} is always reflexive when XX is a Banach space.
  • Assuming that every bounded linear functional on a subspace extends to the whole space without invoking the Hahn-Banach theorem. Extension requires the Hahn-Banach theorem and is not automatic.
  • Confusing weak convergence with strong convergence. A sequence can converge weakly but not strongly (e.g., the standard basis in ℓ2\ell^2).
  • Forgetting that B(X,Y)\mathcal{B}(X,Y) is a Banach space only when YY is complete. If YY is not complete, the space of bounded operators need not be.
  • Assuming reflexivity when only the canonical embedding is injective. Injectivity holds for all normed spaces by Hahn-Banach; reflexivity requires surjectivity.
  • Quantum mechanics: Observables are modelled as self-adjoint bounded operators on Hilbert spaces.
  • Numerical analysis: The spectral radius of an iteration matrix determines convergence of iterative methods.
  • Partial differential equations: Bounded operators on Sobolev spaces encode weak formulations of PDEs.
  • Signal processing: Bounded linear operators on L2L^2 spaces represent filters and transforms.

Theorem 3.13 (Open Mapping Theorem). If XX and YY are Banach spaces and T:X→YT : X \to Y is a surjective bounded linear operator, then TT is an open map (it maps open sets to open sets).

Corollary 3.14 (Bounded Inverse Theorem). If T:X→YT : X \to Y is a bijective bounded linear operator between Banach spaces, then T−1T^{-1} is also bounded.

Theorem 3.15 (Closed Graph Theorem). A linear operator T:X→YT : X \to Y between Banach spaces is bounded if and only if its graph {(x,Tx):x∈X}\{(x, Tx) : x \in X\} is closed in X×YX \times Y.

Bounded linear operators are the continuous linear maps between normed spaces, they do not blow up small inputs into large outputs. The operator norm measures the maximum stretching factor. The open mapping theorem says that surjective bounded operators between Banach spaces are automatically open maps, which implies the bounded inverse theorem: an invertible bounded operator has a bounded inverse. The closed graph theorem provides a practical test: a linear operator is bounded if and only if its graph is closed. These three results, open mapping, bounded inverse, and closed graph, are the fundamental theorems of functional analysis, guaranteeing that well-behaved operators behave as expected.

Problem. Let T:C[0,1]→C[0,1]T : C[0,1] \to C[0,1] be defined by (Tf)(x)=xf′(x)(Tf)(x) = xf'(x). Show that TT is unbounded.

Solution

Consider the sequence fn(x)=xnf_n(x) = x^n. Then ∥fn∥∞=1\|f_n\|_\infty = 1 for all n≥1n \geq 1.

(Tfn)(x)=x⋅nxn−1=nxn(Tf_n)(x) = x \cdot nx^{n-1} = nx^n, so ∥Tfn∥∞=n\|Tf_n\|_\infty = n.

Since ∥Tfn∥/∥fn∥=n→∞\|Tf_n\|/\|f_n\| = n \to \infty as n→∞n \to \infty, the operator TT is unbounded. ■\blacksquare