advanced33 min studyLesson 788 in Mathematics

Compact operators and approximation properties

Separate compactness from finite rank and state precisely when compact maps admit finite-rank approximation in operator norm.

On this page

What you’ll understand

  • Recognize compact operators by images of bounded sequences.
  • Compute an exact finite-rank approximation error for a diagonal map.
  • Explain why a target-space approximation property is needed for a general finite-rank approximation claim.

A compact operator turns bounded sets into sets with norm-compact closure. Bounded finite-rank maps always do this, but compact maps can retain infinitely many nonzero directions while damping their tails. On Hilbert spaces such operators can be approximated in operator norm by finite-rank maps. Extending that assertion to arbitrary Banach spaces requires an approximation property and is false without qualification. The distinction matters whenever a numerical truncation is justified by an abstract compactness theorem: compactness alone does not automatically validate the chosen finite-dimensional approximation scheme.

Compactness describes the image of the unit ball

For Banach spaces X and Y, a bounded linear operator T is compact when the closure of T(B_X) is norm compact in Y. Equivalently, images of every bounded sequence have a norm-convergent subsequence. Bounded finite-dimensional images have compact closure, so bounded finite-rank operators are compact. The identity on an infinite-dimensional Banach space is not compact, since Riesz’s lemma constructs separated unit vectors. Hence boundedness of an operator, or boundedness of its image, is much weaker than compactness.

The operator-norm limit of compact maps into Banach Y is compact. A finite net for one approximating image, together with a uniform norm-error estimate on the unit ball, gives a finite net for the limiting image; completeness turns total boundedness into compact closure. A compact map also sends a weakly convergent sequence to a norm-convergent sequence with the corresponding image limit. Otherwise a subsequence staying away from that limit would have a compact image subsequence with another norm limit, contradicting weak continuity of a bounded linear map.

T compact  ⟺  T(BX)‾ is norm compact,xn⇀x ⟹ ∥Txn−Tx∥→0(T compact)T\text{ compact}\iff\overline{T(B_X)}\text{ is norm compact},\qquad x_n\rightharpoonup x\ \Longrightarrow\ \|Tx_n-Tx\|\to0\quad(T\text{ compact})
The sequential conclusion combines compact image subsequences with uniqueness of their weak limit; it does not say every bounded operator has this property.↔ Scroll wide equations horizontally.

Approximation properties add a missing hypothesis

A Banach space Y has the approximation property when for every norm-compact subset K and every positive error, some bounded finite-rank map R:Y→Y approximates the identity uniformly on K. This definition does not require one bound on all the chosen operator norms. Requiring such a common bound gives the stronger bounded approximation property. The approximation is on compact sets, not uniformly on the entire unit ball; in infinite dimension the latter would incorrectly make the identity compact.

If the target Y has this property and T:X→Y is compact, apply it to the compact closure of T(B_X). Then RT has finite rank and approximates T in operator norm. This proves the stated sufficient condition with the property placed on the target, without an unjustified claim about an arbitrary domain. Hilbert spaces have the property through finite-dimensional orthogonal projections, and spaces with a Schauder basis have the bounded approximation property. Enflo’s counterexample shows that not every Banach space has even the unbounded approximation property, so the general converse to finite-rank compactness fails.

∀K⊂Y norm compact, ∀ε>0 ∃R∈F(Y,Y):sup⁡y∈K∥Ry−y∥<ε⟹∥RT−T∥<ε(K=T(BX)‾)\forall K\subset Y\text{ norm compact},\ \forall\varepsilon>0\ \exists R\in\mathcal F(Y,Y):\sup_{y\in K}\|Ry-y\|<\varepsilon\quad\Longrightarrow\quad\|RT-T\|<\varepsilon\quad(K=\overline{T(B_X)})
Here 𝓕 denotes bounded finite-rank maps. The displayed implication applies the target-space approximation property to a compact operator image.↔ Scroll wide equations horizontally.

Strong truncation and norm truncation differ

Coordinate projections on ℓ² converge strongly to the identity: every fixed square-summable vector has a small tail. Their operator-norm error from the identity is nevertheless one, because a unit vector beyond the cutoff remains untouched by the projection. Adding diagonal weights that tend to zero changes the situation. The largest omitted weight then controls the truncation error uniformly over the entire input unit ball, giving a compact diagonal operator as an operator-norm limit of finite-rank maps.

Schauder’s theorem states that a bounded operator between Banach spaces is compact exactly when its adjoint is compact; this theorem does not require an approximation property. It should not be proved by assuming finite-rank approximation in arbitrary spaces, since that would use a false general premise. Such distinctions separate three ideas often conflated in applications: compact image geometry, strong convergence of a chosen approximation, and operator-norm convergence. An explicit tail bound can certify the last property in a concrete model even when the abstract compactness argument does not specify an approximation.

An exact compact diagonal tail

On ℓ² let (Dx)ₙ=xₙ/n and let D_N keep only its first N output coordinates. Find ∥D−D_N∥ and the least N giving error at most 1/25.

  1. Every omitted diagonal weight is at most 1/(N+1), so the squared output-tail norm is at most (N+1)⁻² times the squared input norm. This gives the upper bound 1/(N+1).

  2. The unit vector e_(N+1) attains that bound, proving the exact operator-norm error rather than only a pointwise estimate.

  3. The inequality 1/(N+1)≤1/25 first holds at N=24. Each D_N has finite rank, and the errors tend to zero, proving D compact.

The result

The exact error is 1/(N+1), with least qualifying cutoff 24. Infinitely many nonzero diagonal weights are compatible with compactness.

Explore the model

Interactive lab

Interactive lab · heat

Positive-time diffusion damps high Fourier directions

Pause and Reset, then set mode n=1,diffusivity κ=0.40 and take one Step, so t=0.5. Predict amplitude e⁻⁰·² and L² norm √π e⁻⁰·². For a fresh comparison Reset and set n=4,κ=0.40, then take one Step; predict amplitude e⁻³·² and norm √π e⁻³·². The analytic multipliers shrink with mode number at fixed positive time, the mechanism behind compact positive-time heat flow on the circle. The instrument displays one mode at a time, not an arbitrary compact-operator approximation.

Positive-time diffusion damps high Fourier directionsThe exact periodic heat-equation mode is u(x,t) = exp(−κn²t) sin(nx), on [0,2π]. Playback advances physical time. The initial sine is shown separately, and the unnormalized L² norm is √π exp(−κn²t). This analytic instrument does not run a finite-difference solver or test discretization stability. Current readings: Current amplitude: 1; Spatial L² norm: 1.772; Decay rate · κn²: 3.6 /s. All parameters are adjustable with the labeled controls below.Periodic heat equation mode 3 at time 0: the amplitude is 1.0π/2π3π/22π−1−0.500.51x · periodic intervalTemperature perturbation uExact mode · n = 3
Current temperature modeInitial sineCurrent amplitude
Current amplitude
1
Spatial L² norm
1.772
Decay rate · κn²
3.6 /s
t = 0 s

The exact periodic heat-equation mode is u(x,t) = exp(−κn²t) sin(nx), on [0,2π]. Playback advances physical time. The initial sine is shown separately, and the unnormalized L² norm is √π exp(−κn²t). This analytic instrument does not run a finite-difference solver or test discretization stability. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forUniform decay of omitted modal multipliers can give an operator-norm truncation bound; convergence of one mode alone cannot.

Check your understanding

Which assumption suffices to approximate every compact T:X→Y by finite-rank operators in operator norm?

Try it yourself

Show that the identity on infinite-dimensional ℓ² cannot be approximated in operator norm by finite-rank maps, although its coordinate truncations converge strongly.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Any finite-rank map from an infinite-dimensional space has a nonzero kernel. Normalize a vector in that kernel.

Compare with the solution

For any finite-rank R, choose a unit vector x in ker R. Then ∥(I−R)x∥=1, so ∥I−R∥≥1. Consequently no sequence of such maps converges to the identity in operator norm. For the standard coordinate projections P_N, every fixed x has ∥P_Nx−x∥₂→0 by square summability, so strong convergence still holds. This does not contradict the approximation property of ℓ², which asks for uniform approximation on each compact set rather than on the whole unit ball.

Take it with you

  • Finite rank implies compactness, while compact maps can have infinite rank.
  • A target approximation property justifies operator-norm finite-rank approximation of every compact map into it.
  • Strong approximation of the identity is weaker than operator-norm approximation.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.