A [linear map](/page/Linear%20Map) can preserve addition and scalar multiplication while destroying every analytic estimate we hoped to use. Differentiation is the warning sign: it is linear, but if the domain norm only measures the height of a function, then rapidly oscillating functions can have small height and enormous derivative. The operator norm is the device that separates linear maps which are merely algebraic from linear maps that are controlled by the geometry of their spaces.

The central question is this: how large can $Tx$ be when $x$ has size at most one? Once that question has a finite answer, the map $T$ is stable under approximation, sends convergent sequences to convergent sequences, and can be used safely inside limiting arguments. Without such a bound, a linear formula may be unusable in analysis.

[example: Differentiation Without the Right Norm] Let $X=C^1([0,1])$ be equipped with the norm $\|f\|_{C^0}=\sup_{x\in[0,1]}|f(x)|$, let $Y=C([0,1])$ have the same supremum norm, and define $T:X\to Y$ by $Tf=f'$. This map is well-defined because every $f\in C^1([0,1])$ has derivative $f'\in C([0,1])$. If $f,g\in X$ and $\alpha,\beta$ are scalars, then $\alpha f+\beta g\in C^1([0,1])$, and for each $x\in[0,1]$, \begin{align*} T(\alpha f+\beta g)(x)=(\alpha f+\beta g)'(x)=\alpha f'(x)+\beta g'(x)=\alpha Tf(x)+\beta Tg(x). \end{align*} Thus $T(\alpha f+\beta g)=\alpha Tf+\beta Tg$, so $T$ is linear. For each positive integer $n$, put $f_n(x)=\sin(nx)$. Then $f_n\in C^1([0,1])$. Since $|\sin t|\le 1$ for every real $t$, we have $|\sin(nx)|\le 1$ for every $x\in[0,1]$, and therefore \begin{align*} \|f_n\|_{C^0}=\sup_{x\in[0,1]}|\sin(nx)|\le 1. \end{align*} Differentiating $f_n$ gives, for each $x\in[0,1]$, \begin{align*} (Tf_n)(x)=f_n'(x)=n\cos(nx). \end{align*} Because $n>0$, \begin{align*} \|Tf_n\|_{C^0}=\sup_{x\in[0,1]}|n\cos(nx)|=n\sup_{x\in[0,1]}|\cos(nx)|. \end{align*} For every $x\in[0,1]$, $|\cos(nx)|\le 1$, so \begin{align*} \sup_{x\in[0,1]}|\cos(nx)|\le 1. \end{align*} At $x=0$, we have $|\cos(n\cdot 0)|=|\cos 0|=1$, so the same supremum is at least $1$. Hence \begin{align*} \sup_{x\in[0,1]}|\cos(nx)|=1. \end{align*} Substituting this into the previous norm computation gives \begin{align*} \|Tf_n\|_{C^0}=n. \end{align*} Suppose, toward a contradiction, that $T$ were bounded for these norms. Then there would be a constant $C\ge 0$ such that \begin{align*} \|Tf\|_{C^0}\le C\|f\|_{C^0} \end{align*} for every $f\in X$. Applying this estimate to $f_n$ gives \begin{align*} n=\|Tf_n\|_{C^0}\le C\|f_n\|_{C^0}\le C\cdot 1=C. \end{align*} Thus $n\le C$ for every positive integer $n$. Choosing a positive integer $n>C$ contradicts this inequality. Therefore differentiation is not bounded from $(C^1([0,1]),\|\cdot\|_{C^0})$ to $(C([0,1]),\|\cdot\|_{C^0})$. The input norm controls only the height of a function, while differentiation can turn bounded oscillations into arbitrarily large outputs. [/example]

This failure gives the guiding theme of the page. A useful operator norm is not just a number attached to a formula; it records a compatibility between the domain norm, the codomain norm, and the operation being performed.

## Definition

The opening example shows that the real issue is not linearity itself, but whether a linear map has a finite worst-case amplification on unit-sized inputs. This is the number we want to name first: it is the quantity that later becomes a Lipschitz constant, an embedding constant, a stability constant, and the radius controlling perturbation arguments.

[definition: Operator Norm] Let $(X,\|\cdot\|_X)$ and $(Y,\|\cdot\|_Y)$ be normed vector spaces over the same scalar field. We write $\mathcal L(X,Y)$ for the space of bounded linear operators from $X$ to $Y$; before boundedness has been checked, the same subscript records the intended domain and codomain of the operator norm. For a linear map $T:X\to Y$, the operator norm of $T$ is \begin{align*} \|T\|_{\mathcal L(X,Y)}:=\sup\{\|Tx\|_Y:x\in X,\ \|x\|_X\le 1\}. \end{align*} [/definition]

This definition presupposes that the domain and codomain already have norms, so we record the ambient structure explicitly. Normed vector spaces are the setting where linear algebra meets approximation: they let us ask whether a sequence converges, whether an error is small, and whether a map respects those errors.

[definition: Normed Vector Space] A [normed vector space](/page/Normed%20Vector%20Space) is a [vector space](/page/Vector%20Space) $X$ over $\mathbb R$ or $\mathbb C$ together with a function $\|\cdot\|_X:X\to[0,\infty)$ such that $\|x\|_X=0$ if and only if $x=0$, $\|\lambda x\|_X=|\lambda|\|x\|_X$ for every scalar $\lambda$, and $\|x+y\|_X\le \|x\|_X+\|y\|_X$ for all $x,y\in X$. [/definition]

Once vectors have sizes, the next question is which linear maps have finite operator norm. The differentiation example failed because bounded inputs could produce unbounded outputs, so we isolate the exact condition that forbids that behaviour.

[definition: Bounded Linear Operator] Let $(X,\|\cdot\|_X)$ and $(Y,\|\cdot\|_Y)$ be normed vector spaces over the same scalar field. A [bounded linear operator](/page/Bounded%20Linear%20Operator) from $X$ to $Y$ is a linear map $T:X\to Y$ for which there exists $C\ge 0$ such that \begin{align*} \|Tx\|_Y\le C\|x\|_X \end{align*} for every $x\in X$. [/definition]

The definition uses the closed unit ball, but computations often begin from a unit vector, a nonzero vector of arbitrary size, or a candidate constant in an inequality. The next result explains why all of those routes compute the same number, so it is the practical form of the definition.

[quotetheorem:9320]

The last formula says that proving an operator norm bound and proving a uniform estimate are the same act. The operational consequence is so common that it is worth isolating: once the norm of $T$ is known, every vector estimate follows by scaling from the unit ball.

[quotetheorem:9321]

This inequality is the form in which the operator norm is usually used inside a proof. The next example shows that the operator norm depends on the norms, not only on the underlying algebraic map.

[example: Identity Between Different Norms] Let $I:(\mathbb R^n,|\cdot|)\to(\mathbb R^n,\|\cdot\|_\infty)$ be the identity map, where \begin{align*} |x|=(x_1^2+\cdots+x_n^2)^{1/2} \end{align*} and \begin{align*} \|x\|_\infty=\max_{1\le i\le n}|x_i|. \end{align*} We compute the operator norm of $I$ and then compare it with the operator norm of the same identity map in the reverse direction. For $x=(x_1,\ldots,x_n)\in\mathbb R^n$ and each $i$, every term $x_k^2$ is nonnegative, so \begin{align*} |x_i|^2=x_i^2\le x_1^2+\cdots+x_n^2=|x|^2. \end{align*} Both $|x_i|$ and $|x|$ are nonnegative, so taking square roots gives $|x_i|\le |x|$ for every $i$. Hence the maximum of the coordinate absolute values also satisfies \begin{align*} \|Ix\|_\infty=\max_{1\le i\le n}|x_i|\le |x|. \end{align*} Therefore every $x$ with $|x|\le 1$ satisfies $\|Ix\|_\infty\le 1$, and the definition of the operator norm gives \begin{align*} \|I\|_{\mathcal L((\mathbb R^n,|\cdot|),(\mathbb R^n,\|\cdot\|_\infty))}\le 1. \end{align*} To see that the bound is sharp, take $e_1=(1,0,\ldots,0)$. Then \begin{align*} |e_1|=(1^2+0^2+\cdots+0^2)^{1/2}=1. \end{align*} Since $Ie_1=e_1$, \begin{align*} \|Ie_1\|_\infty=\max\{|1|,|0|,\ldots,|0|\}=1. \end{align*} Thus the supremum over the Euclidean unit ball is at least $1$. Combining this lower bound with the previous upper bound gives \begin{align*} \|I\|_{\mathcal L((\mathbb R^n,|\cdot|),(\mathbb R^n,\|\cdot\|_\infty))}=1. \end{align*} Now consider the reverse identity $J:(\mathbb R^n,\|\cdot\|_\infty)\to(\mathbb R^n,|\cdot|)$. For $x=(x_1,\ldots,x_n)$ and each coordinate $i$, \begin{align*} |x_i|\le \max_{1\le k\le n}|x_k|=\|x\|_\infty. \end{align*} Squaring this inequality gives \begin{align*} x_i^2=|x_i|^2\le \|x\|_\infty^2. \end{align*} Adding these $n$ coordinate inequalities yields \begin{align*} x_1^2+\cdots+x_n^2\le \|x\|_\infty^2+\cdots+\|x\|_\infty^2=n\|x\|_\infty^2. \end{align*} Since $Jx=x$, the left-hand side is $|Jx|^2$, so \begin{align*} |Jx|^2\le n\|x\|_\infty^2. \end{align*} Taking square roots, with both sides nonnegative, gives \begin{align*} |Jx|\le \sqrt n\,\|x\|_\infty. \end{align*} Therefore every $x$ with $\|x\|_\infty\le 1$ satisfies $|Jx|\le \sqrt n$, and hence \begin{align*} \|J\|_{\mathcal L((\mathbb R^n,\|\cdot\|_\infty),(\mathbb R^n,|\cdot|))}\le \sqrt n. \end{align*} For $u=(1,\ldots,1)$, every coordinate has absolute value $1$, so \begin{align*} \|u\|_\infty=\max\{|1|,\ldots,|1|\}=1. \end{align*} Since $Ju=u$, \begin{align*} |Ju|=(1^2+\cdots+1^2)^{1/2}=n^{1/2}=\sqrt n. \end{align*} Thus the supremum over the $\|\cdot\|_\infty$ unit ball is at least $\sqrt n$. Combining this lower bound with the upper bound gives \begin{align*} \|J\|_{\mathcal L((\mathbb R^n,\|\cdot\|_\infty),(\mathbb R^n,|\cdot|))}=\sqrt n. \end{align*} The underlying algebraic map is the identity in both directions, but its operator norm changes because the domain and codomain norms change. [/example]

## Boundedness and Continuity

The operator norm is powerful because, for linear maps, a single global inequality controls all local behaviour. Nonlinear maps can be continuous at one point and badly behaved elsewhere; a linear map transports every local question back to the origin.

The right theorem explains why bounded linear maps are the continuous linear maps of normed-space analysis. It is the reason the notation $\mathcal L(X,Y)$ means bounded linear maps rather than all algebraic linear maps.