Compactness is the part of functional analysis where bounded sequences begin to behave as if they lived in finite-dimensional space. In a finite-dimensional normed space, closed bounded sets are compact, so every bounded sequence has a convergent subsequence after enclosing it in a closed bounded set. This single fact powers existence proofs, spectral arguments, and approximation methods. The first shock in infinite dimensions is that boundedness alone is too weak: the unit ball of an infinite-dimensional [Banach space](/page/Banach%20Space) need not contain any norm-convergent subsequence at all.

The theory of compact operators isolates a class of linear maps that restore this missing finite-dimensional behavior. A compact operator may act on an infinite-dimensional space, but it sends bounded sets into sets whose closure is compact. From the point of view of sequences, it turns bounded input sequences into output sequences with convergent subsequences. This is why compact operators appear wherever an infinite-dimensional problem has a hidden smoothing, averaging, or approximation mechanism.

[example: The Shift That Refuses Compactness] Let $H=\ell^2$ and define the right shift $S:H\to H$ by \begin{align*} S(a_1,a_2,a_3,\ldots)=(0,a_1,a_2,a_3,\ldots). \end{align*} For $x=(a_k)_{k=1}^\infty$ and $y=(b_k)_{k=1}^\infty$ in $\ell^2$, and scalars $\alpha,\beta$, we have \begin{align*} S(\alpha x+\beta y) &=S(\alpha a_1+\beta b_1,\alpha a_2+\beta b_2,\ldots)\\ &=(0,\alpha a_1+\beta b_1,\alpha a_2+\beta b_2,\ldots)\\ &=\alpha(0,a_1,a_2,\ldots)+\beta(0,b_1,b_2,\ldots)\\ &=\alpha Sx+\beta Sy, \end{align*} so $S$ is linear. Also, \begin{align*} \|Sx\|_{\ell^2}^2 &=|0|^2+|a_1|^2+|a_2|^2+|a_3|^2+\cdots\\ &=\sum_{k=1}^\infty |a_k|^2\\ &=\|x\|_{\ell^2}^2, \end{align*} so $\|Sx\|_{\ell^2}=\|x\|_{\ell^2}$ for every $x\in \ell^2$, and $S$ is bounded. Let $e_k$ be the sequence with $1$ in the $k$-th coordinate and $0$ elsewhere. Then \begin{align*} \|e_k\|_{\ell^2}^2=\sum_{n=1}^\infty |(e_k)_n|^2=1, \end{align*} so $(e_k)_{k=1}^\infty$ is bounded. Moreover, \begin{align*} Se_k=e_{k+1}, \end{align*} because the single nonzero coordinate of $e_k$ is shifted from position $k$ to position $k+1$. For $j\ne k$, the sequence $e_j-e_k$ has coordinate $1$ in position $j$, coordinate $-1$ in position $k$, and $0$ in every other position. Hence \begin{align*} \|e_j-e_k\|_{\ell^2}^2 &=\sum_{n=1}^\infty |(e_j-e_k)_n|^2\\ &=|1|^2+|-1|^2\\ &=2. \end{align*} Therefore, for $j\ne k$, \begin{align*} \|Se_j-Se_k\|_{\ell^2} &=\|e_{j+1}-e_{k+1}\|_{\ell^2}\\ &=\sqrt{2}. \end{align*} Every subsequence of $(Se_k)_{k=1}^\infty$ still has pairwise distances $\sqrt{2}$ between distinct terms, so no subsequence is Cauchy. Since every norm-convergent sequence is Cauchy, no subsequence of $(Se_k)_{k=1}^\infty$ converges in norm. Thus $S$ sends the bounded set $\{e_k:k\in\mathbb{N}\}$ to a set containing a sequence with no norm-convergent subsequence. Its image is not relatively compact, so the bounded linear right shift is not compact. [/example]

The shift example is the basic obstruction. Bounded linearity controls distances uniformly, but it does not create convergence. To state compactness without losing the distinction, we first need the ambient class of operators whose size can be measured uniformly on the whole unit ball. This operator norm is the language in which compact operators are compared, approximated, and composed.

The notation below is therefore more than bookkeeping. Compactness will later imply boundedness for linear maps, but most stability and approximation statements live inside the normed space of bounded operators, where operator-norm convergence and composition are available.

[definition: Bounded Linear Operator Space] Let $X$ and $Y$ be normed spaces. The space $\mathcal{L}(X,Y)$ consists of all bounded linear operators $T:X \to Y$, equipped with the operator norm \begin{align*} \|T\|_{\mathcal{L}(X,Y)}=\sup_{\|x\|_X \le 1}\|Tx\|_Y. \end{align*} When $X=Y$, write $\mathcal{L}(X)=\mathcal{L}(X,X)$. [/definition]

## Definition

The right definition must be phrased in terms of bounded sets rather than pointwise behavior. A [linear map](/page/Linear%20Map) can send each individual vector somewhere harmless while still moving an infinite bounded family around without creating any convergent subsequence. Compactness asks for a uniform sequential improvement on every bounded family.

[definition: Compact Operator] Let $X$ and $Y$ be normed spaces. A linear map $T: X \to Y$ is a compact operator if for every bounded set $B \subset X$, the set $T(B) \subset Y$ has compact closure in $Y$. [/definition]

With this notation in place, the geometric definition can be converted into the form used in most arguments. When we solve variational problems or extract limits from approximate solutions, we usually start with a bounded sequence rather than an arbitrary bounded set. The next result is needed because it turns compactness into the subsequence criterion used in proofs.

[quotetheorem:4919]

This sequential form explains the word compact: the operator converts boundedness in the domain into relative compactness in the codomain. It also shows why compactness is stronger than boundedness in infinite dimensions. Because compactness is defined before boundedness has been proved, the next theorem is needed to rule out a possible ambiguity: for linear maps, compactness already supplies the uniform estimate required for boundedness.

[quotetheorem:4890]

The theorem tells us that compactness is not an alternative to boundedness; for linear maps, it is a stronger regularity condition. The next examples establish the two extremes: finite-dimensional behavior is always compact, while the identity in infinite dimensions is not.

[example: Finite-Rank Operators Are Compact] Let $X$ and $Y$ be normed spaces, and suppose $T \in \mathcal{L}(X,Y)$ has finite-dimensional range. Let $B \subset X$ be bounded. Then there is $M \ge 0$ such that $\|x\|_X \le M$ for every $x \in B$. By the definition of the operator norm, \begin{align*} \|Tx\|_Y &\le \|T\|_{\mathcal{L}(X,Y)}\|x\|_X\\ &\le \|T\|_{\mathcal{L}(X,Y)}M \end{align*} for every $x \in B$. Hence $T(B)$ is bounded as a subset of the finite-dimensional normed space $\operatorname{Range}(T)$. The closure of $T(B)$ taken inside $\operatorname{Range}(T)$ is compact by *Heine-Borel for finite-dimensional normed spaces*. Since $\operatorname{Range}(T)$ is a finite-dimensional subspace of a normed space, it is closed in $Y$, so this same closure is also the closure of $T(B)$ in $Y$. Therefore $T(B)$ has compact closure in $Y$ for every bounded set $B \subset X$, and $T$ is compact. [/example]

Finite-rank operators are the model compact operators: they discard all but finitely many degrees of freedom. The opposite test case is the identity map, which discards no directions at all. The next theorem is needed because it separates genuine compactness from the finite-dimensional compactness of closed bounded sets.

[quotetheorem:4920]

This theorem is often the quickest way to detect a false compactness claim. If an argument would imply that every bounded sequence in an infinite-dimensional Banach space has a norm-convergent subsequence, it has imported finite-dimensional reasoning.

## Images of Bounded Sets

### The Unit Ball Test