research31 min studyLesson 83 in Mathematics

Compact operators and the Fredholm alternative

Understand finite-rank approximation, exceptional eigenvalues, and compatibility conditions for solvability.

On this page

What you’ll understand

  • Distinguish compactness of an operator from boundedness.
  • State the nonzero spectral structure of a compact operator.
  • Use an adjoint nullspace to check a Fredholm compatibility condition.

Finite matrices turn bounded input sets into sets whose closure is compact. In an infinite-dimensional space, a bounded operator need not do this: it may preserve infinitely many mutually separated directions. Compact operators restore some finite-dimensional behavior by squeezing the image of a bounded sequence into a set containing a convergent subsequence. Their spectral structure explains why many integral equations have isolated resonances and why an adjoint equation detects precisely which right-hand sides can be solved.

Compactness is stronger than a uniform norm bound

A compact linear operator maps every bounded sequence to an output sequence with a convergent subsequence. In normed spaces this is equivalent to relative compactness of the image of the unit ball. Every compact linear operator is bounded, and every finite-rank bounded operator is compact. On an infinite-dimensional Hilbert space, the identity is not compact: an orthonormal sequence stays a fixed distance apart. Calling its unit ball closed and bounded does not make that ball compact.

The diagonal map K on square-summable sequences defined by K e_n=e_n/n is compact. Truncate it after N coordinates to obtain a finite-rank map K_N. The operator-norm error is 1/(N+1), so K is a norm limit of compact operators and is itself compact. This example gives an explicit approximation certificate. Pointwise convergence of finite-rank maps alone would be weaker and would not prove compactness of the limit; projections onto the first N coordinates converge strongly to the noncompact identity.

Ken=1nen,∥K−KN∥=1N+1⟶0K e_n=\frac1n e_n,\qquad \|K-K_N\|=\frac1{N+1}\longrightarrow0
The sequence space is ℓ2 and K_N agrees with K in the first N coordinates, vanishing on the rest. The convergence is in operator norm, not only on each fixed input.↔ Scroll wide equations horizontally.

Nonzero spectrum behaves like matrix eigenvalues

For a compact operator on a complex infinite-dimensional Banach space, every nonzero spectral value is an eigenvalue with finite algebraic multiplicity. Such eigenvalues can accumulate only at zero. Zero is always in the spectrum on an infinite-dimensional space, since a compact invertible operator would make the identity compact after composition with its bounded inverse. Yet zero need not be an eigenvalue: the diagonal K above has zero kernel, although its inverse on its range is unbounded.

This distinction is easy to miss when extrapolating from matrices. Each nonzero coordinate multiplier 1/n can be inverted separately, but the inverse multipliers n have no uniform bound. The exceptional point zero records a stability failure without a nonzero vector killed by K. Compact self-adjoint operators admit a particularly strong orthonormal eigenvector description; general compact operators can have Jordan structure and do not inherit orthogonality merely because they are compact.

σ(K)={0}∪{1,1/2,1/3,…},ker⁡K={0}\sigma(K)=\{0\}\cup\{1,1/2,1/3,\ldots\},\qquad \ker K=\{0\}
For this specific diagonal compact operator, zero is spectral but is not an eigenvalue. The nonzero eigenvalues approach zero.↔ Scroll wide equations horizontally.

An alternative between invertibility and an obstruction

For compact K on a Hilbert space, I−K has closed range and finite-dimensional kernel and cokernel with equal dimensions. It is invertible exactly when its kernel is zero. At an exceptional eigenvalue, the equation (I−K)x=b is solvable precisely when b is perpendicular to the kernel of I−K*. If it is solvable, solutions differ by vectors in the kernel. This is the Fredholm alternative in a form that separates existence, uniqueness, and compatibility.

The statement concerns an identity minus a compact operator, not an arbitrary compact equation Kx=b and not every bounded linear map. In applications, a differential equation may first be transformed using a Green operator into this form. One must justify that transformation, its boundary conditions, and compactness in the selected function spaces. A finite discretization always has matrix rank conditions, but those alone do not certify the corresponding infinite-dimensional Fredholm hypotheses.

(I−K)x=b is solvable⟺b⊥ker⁡(I−K∗)(I-K)x=b\ \text{is solvable}\quad\Longleftrightarrow\quad b\perp\ker(I-K^*)
K is compact on the Hilbert space. At resonance a solution, when one exists, is determined only up to addition of a vector in ker(I−K).↔ Scroll wide equations horizontally.

A finite compatibility obstruction

Let K=diag(1,1/2) on real two-dimensional Euclidean space. Decide whether (I−K)x=(b₁,b₂) is solvable, then solve for b=(0,3).

  1. Compute I−K=diag(0,1/2). Its kernel and adjoint kernel are both the first coordinate axis.

  2. Compatibility requires b₁=0, since b must be perpendicular to that axis. When b₁ is nonzero, no choice of x can satisfy the first equation.

  3. For b=(0,3), the second equation gives x₂=6 and x₁ remains any real number. Thus all solutions are (t,6), with t real.

The result

The obstruction controls existence and the kernel controls nonuniqueness. For the compatible data there is an entire affine line of solutions.

Explore the model

Interactive lab

Interactive lab · spectral

Suppressing high-index coordinates

Pause playback, compare N=3 with a larger mode count, and raise coefficient decay p. The finite family Σ sin(nx−t)/nᵖ visually suppresses higher modes more strongly. It provides intuition for coordinate damping; it is not an eigenvalue solver, a compactness proof, or an implementation of the Fredholm equation.

Suppressing high-index coordinatesA finite sum of sin(nx − t)/nᵖ. Playback changes t; increasing the cutoff includes finer spatial scales. This is not a proof about a continuum limit or renormalization. Current readings: Sum at x = π/2: 0.867; Smallest wavelength: 2π / 5; Highest-mode coefficient: 0.2. All parameters are adjustable with the labeled controls below.01.573.144.716.28−2.56−1.2801.282.56x · radiansFinite sine sum
Finite sumHighest included mode
Sum at x = π/2
0.867
Smallest wavelength
2π / 5
Highest-mode coefficient
0.2
t = 0 s

A finite sum of sin(nx − t)/nᵖ. Playback changes t; increasing the cutoff includes finer spatial scales. This is not a proof about a continuum limit or renormalization. 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 forCompactness needs control of the entire tail in the chosen norm, not merely a finite picture.

Check your understanding

For K e_n=e_n/n on ℓ2, why is zero spectral even though K has no nonzero null vector?

Try it yourself

Replace the worked-example right-hand side by (2,3). Can adding a kernel vector to a candidate repair the equation?

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

Give me a hint

Inspect the first component of every possible output of I−K.

Compare with the solution

No solution exists: every output has first component zero, while the requested first component is 2. Adding a vector in the kernel leaves the output unchanged. Kernel freedom creates additional solutions only after compatibility has been satisfied; it cannot remove the adjoint-nullspace obstruction.

Take it with you

  • Compact operators squeeze bounded sequences enough to recover convergent subsequences.
  • Only nonzero compact spectral values are guaranteed to be eigenvalues.
  • Fredholm compatibility uses the adjoint kernel, while the kernel describes solution freedom.

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.