In finite-dimensional linear algebra, every [linear map](/page/Linear%20Map) between normed spaces is automatically [continuous](/page/Continuity). This is a consequence of the equivalence of all norms on $\mathbb{R}^n$: if $T: \mathbb{R}^n \to \mathbb{R}^m$ is linear, then $T$ is represented by a matrix $A \in \mathbb{R}^{m \times n}$, and the estimate $\|Tx\| \le \|A\|_{\mathrm{op}} \|x\|$ holds for any choice of norms. The operator norm $\|A\|_{\mathrm{op}}$ is always finite because the unit sphere in $\mathbb{R}^n$ is [compact](/page/Compact%20Space) and $x \mapsto \|Ax\|$ is continuous, so it attains its supremum.

In infinite dimensions, this reasoning collapses. The closed unit ball of an infinite-dimensional [normed vector space](/page/Normed%20Vector%20Space) is never compact, and the supremum of a continuous function over a non-compact set need not be finite. As a result, there exist linear maps between infinite-dimensional normed spaces that send bounded sets to unbounded sets — maps that are algebraically well-defined but analytically useless.

[example: Differentiation Is Unbounded] Consider the space $X = C^1([0,1])$ of continuously differentiable functions on $[0,1]$, equipped with the supremum norm $\|f\|_\infty = \sup_{x \in [0,1]} |f(x)|$, and the target space $Y = C([0,1])$ with the same norm. Define the differentiation operator \begin{align*} D: C^1([0,1]) &\to C([0,1]) \\ f &\mapsto f'. \end{align*} This map is linear. However, consider the sequence $f_k \in C^1([0,1])$ defined by $f_k(x) = \sin(2\pi k x)$ for each $k \in \mathbb{N}$. Each $f_k$ satisfies $\|f_k\|_\infty = 1$, so the sequence is bounded in $X$. The image under $D$ is \begin{align*} Df_k(x) = 2\pi k \cos(2\pi k x), \end{align*} which satisfies $\|Df_k\|_\infty = 2\pi k \to \infty$ as $k \to \infty$. No constant $M \ge 0$ can satisfy $\|Df\|_\infty \le M \|f\|_\infty$ for all $f \in C^1([0,1])$: differentiation amplifies high-frequency oscillations without bound. [/example]

The example above exposes the central question of this page: **which linear maps between infinite-dimensional normed spaces are analytically well-behaved?** The answer is that a linear map is continuous if and only if it is *bounded* — if and only if it maps bounded sets to bounded sets. This equivalence, which is specific to the normed space setting and fails for general topological vector spaces, is the foundational result of operator theory. The bounded linear operators between two normed spaces $X$ and $Y$ form a normed space $\mathcal{L}(X, Y)$ under the operator norm, and when $Y$ is a [Banach space](/page/Banach%20Space), this operator space is itself complete. This construction is the gateway to the [dual space](/page/Dual%20Space), spectral theory, and the analytic framework of partial differential equations.

## Definition

The key insight behind the definition is that for a linear map, continuity — an infinitesimal, local condition — is equivalent to a single global bound. Linearity allows one to rescale: if a linear map is continuous at a single point (say the origin), then the same estimate, transported by linearity, gives continuity everywhere. Conversely, if a linear map sends bounded sets to bounded sets, then the image of any shrinking ball around the origin must also shrink, which is continuity at the origin.

[definition: Bounded Linear Operator] Let $(X, \|\cdot\|_X)$ and $(Y, \|\cdot\|_Y)$ be [normed vector spaces](/page/Normed%20Vector%20Space) over the same field $\mathbb{F} \in \{\mathbb{R}, \mathbb{C}\}$. A [linear map](/page/Linear%20Map) $T: X \to Y$ is a **bounded linear operator** if there exists a constant $M \ge 0$ such that \begin{align*} \|Tx\|_Y \le M \|x\|_X \quad \text{for all } x \in X. \end{align*} The **operator norm** of $T$ is \begin{align*} \|T\|_{\mathcal{L}(X,Y)} := \sup_{\substack{x \in X \\ x \neq 0}} \frac{\|Tx\|_Y}{\|x\|_X} = \sup_{\substack{x \in X \\ \|x\|_X \le 1}} \|Tx\|_Y = \sup_{\substack{x \in X \\ \|x\|_X = 1}} \|Tx\|_Y. \end{align*} The space of all bounded linear operators from $X$ to $Y$ is denoted $\mathcal{L}(X, Y)$. When $X = Y$, we write $\mathcal{L}(X) := \mathcal{L}(X, X)$. [/definition]

The three supremum expressions in the definition are equal for any linear map. The equivalence of the first two follows from linearity: $\sup_{\|x\| \le 1} \|Tx\| = \sup_{x \neq 0} \|T(x/\|x\|)\| \cdot \|x\| / \|x\| = \sup_{x \neq 0} \|Tx\|/\|x\|$. The third expression — restricting to the unit sphere — gives the same value because $x \mapsto \|Tx\|_Y$ is continuous on the unit ball and vanishes at the origin, so the supremum over the closed ball is achieved on the sphere (or in the limit as $\|x\| \to 1$).

The operator norm captures the worst-case amplification factor: $\|T\|$ is the smallest constant $M$ for which the estimate $\|Tx\|_Y \le M\|x\|_X$ holds universally. This estimate is the single most useful inequality in operator theory — it says that a bounded operator cannot amplify the size of an input by more than the factor $\|T\|$.

[remark: Terminology] The term "bounded" in "bounded linear operator" does *not* mean that $T$ maps $X$ into a bounded subset of $Y$ (which would force $T = 0$ unless $X = \{0\}$). It means that $T$ maps the unit ball of $X$ into a bounded subset of $Y$. Equivalently, $T$ maps every bounded subset of $X$ to a bounded subset of $Y$. This usage is standard but can be confusing on first encounter. [/remark]

## The Equivalence of Boundedness and Continuity

For a general function between metric spaces, continuity (an $\varepsilon$-$\delta$ condition at every point) and boundedness (a global bound on images of bounded sets) are logically independent properties. The function $f(x) = x^2$ on $\mathbb{R}$ is continuous but unbounded on bounded sets only if we allow the domain to be unbounded; conversely, a discontinuous indicator function $\mathbb{1}_{\mathbb{Q}}$ is bounded but not continuous. For *linear* maps between normed spaces, however, these two conditions collapse into one. This is a genuinely nontrivial fact that relies on the interplay between the algebraic structure (linearity) and the geometric structure (the norm).

[quotetheorem:873]

The equivalence $(1) \Leftrightarrow (2)$ uses translation invariance: $T$ is continuous at $x_0$ if and only if $T(x_0 + h) - T(x_0) = Th \to 0$ as $h \to 0$, which is exactly continuity at $0$. The implication $(3) \Rightarrow (4)$ is immediate: $\|Tx - Ty\|_Y = \|T(x-y)\|_Y \le \|T\| \cdot \|x - y\|_X$. The key implication is $(2) \Rightarrow (3)$. If $T$ is continuous at $0$, then for $\varepsilon = 1$ there exists $\delta > 0$ such that $\|x\|_X < \delta$ implies $\|Tx\|_Y < 1$. For any $x \neq 0$, the rescaled vector $\frac{\delta}{2\|x\|_X} x$ has norm $\delta/2 < \delta$, so $\|T(\frac{\delta}{2\|x\|_X} x)\|_Y < 1$. By linearity, $\|Tx\|_Y < \frac{2}{\delta} \|x\|_X$. This gives boundedness with $M = 2/\delta$.

The theorem reveals why linearity is essential. A continuous nonlinear map can be locally bounded without being globally bounded (think of $x \mapsto x^2$). A linear map, by contrast, is "self-similar": its behavior at any scale determines its behavior at every other scale. Continuity at the single point $0$ propagates, via the scaling $x \mapsto \lambda x$ and the additivity $T(x + y) = Tx + Ty$, to a uniform estimate on all of $X$.

[example: An Unbounded Linear Functional] The equivalence above implies that to exhibit a *discontinuous* linear map, we must leave the comfortable setting of concrete function spaces and invoke the Axiom of Choice. Here is the standard construction. Let $X$ be an infinite-dimensional normed space. By Zorn's lemma, $X$ has a Hamel basis $\mathcal{B}$ — an algebraic (not topological) basis. Choose a countable linearly independent subset $\{e_1, e_2, e_3, \ldots\} \subset \mathcal{B}$, and normalize each vector: replace $e_k$ by $e_k / \|e_k\|_X$ so that $\|e_k\|_X = 1$ for every $k \in \mathbb{N}$. Define a linear functional $f: X \to \mathbb{R}$ by specifying its values on the Hamel basis: \begin{align*} f(e_k) &= k \quad \text{for each } k \in \mathbb{N}, \\ f(b) &= 0 \quad \text{for every } b \in \mathcal{B} \setminus \{e_1, e_2, \ldots\}. \end{align*} Then $\|e_k\|_X = 1$ but $|f(e_k)| = k \to \infty$. No constant $M$ can satisfy $|f(x)| \le M\|x\|_X$ for all $x$ in the span of $\{e_k\}$, so $f$ is unbounded and hence discontinuous. This construction is inherently non-constructive: one cannot write down an explicit discontinuous linear functional on a Banach space. In fact, under certain set-theoretic axioms (e.g., the Solovay model), every linear functional on a separable Banach space is continuous. The existence of discontinuous linear maps is thus a set-theoretic phenomenon, not an analytic one. [/example]

## The Operator Norm and the Space $\mathcal{L}(X, Y)$

Having identified the class of well-behaved linear maps, we now face a structural question: does the collection $\mathcal{L}(X, Y)$ of all bounded operators from $X$ to $Y$ form a useful mathematical object in its own right? The answer is yes — it is a normed space under the operator norm, and its completeness properties are controlled by the target space $Y$.

The operator norm is genuinely a norm. Positive definiteness ($\|T\| = 0$ implies $Tx = 0$ for all $\|x\| \le 1$, hence $T = 0$), homogeneity ($\|\lambda T\| = |\lambda| \|T\|$), and the triangle inequality ($\|(T + S)x\| \le \|Tx\| + \|Sx\| \le (\|T\| + \|S\|)\|x\|$) all follow from the corresponding properties of the norm on $Y$.

The fundamental completeness result shows that the analytic structure of $\mathcal{L}(X, Y)$ is inherited entirely from $Y$.