Kreyszig Functional Analysis

Let and be normed spaces. A linear operator is called compact for every bounded subset of , is relatively compact in ; that is, the closure in is compact under the strong (norm) topology.

An equivalent formulation of operator compactness is that a linear operator between normed spaces is compact if and only if for every bounded sequence in the corresponding sequence in has a convergent subsequence.

We state the following elementary facts without proof:

  • If is a bounded linear operator between normed spaces and , the operator is compact.
  • A subset is relatively compact in if and only if every sequence in has a subsequence convergent in the ambient space .
  • Relative compactness implies total boundedness, and total boundedness implies separability.
  • If is a totally bounded subset of a complete metric space , then is relatively compact.
  • If is a compact linear operator and is a bounded linear operator on a normed space , and are both compact.

Theorem 1: Let be a normed space and be a compact linear operator. If , .

Proof) Assume for the sake of contradiction that . That is, has an inverse that is a bounded linear operator defined on a dense subspace of . For any , . If , by Riesz’s Lemma there exists an infinite sequence of elements such that and for any . Applying forces . Thus, cannot have a convergent subsequence, contradicting compactness.

Theorem 2: The set of eigenvalues of a compact linear operator on a normed space is at most countable, and the only possible accumulation point is .

Proof) It suffices to show for any real the set of all with is finite. FTSOC, assume such a exists such that there is an infinite sequence of distinct eigenvalues such that . If we associate each with an eigenvector such that , clearly the vectors are all linearly independent. Thus, taking supplies us with an infinite dimensional space spanned by eigenvectors scaled . We claim this contradicts compactness, as, intuitively, bounded subsets must map to clustered, relatively compact subsets and cannot be uniformly spread out.

For any , by Riesz’s Lemma we can take such that , , and for any . As , . For any , , and therefore,

Therefore, is bounded but doesn’t have a convergent subsequence, contradicting compactness.

Theorem 3: Let be a compact linear operator on a normed space . For any complex number , the null space of is finite-dimensional (and thus complete and closed).

Proof) It suffices to show the closed unit ball of , , is compact. Take any sequence in . By the compactness of , must have a convergent subsequence, and thus as , must also have a convergent subsequence. We are done.

Theorem 4: Let be a compact linear operator on a normed space . For any complex number , the range is closed.

Proof) Assume some element exists and take an arbitrary sequence such that . Note that cannot have a convergent subsequence as, if such a subsequence exists, by boundedness , creating an immediate contradiction. As , this implies also cannot have a convergent subsequence. As is compact, this is only possible if has no bounded subsequence; that is, .

Note that this is true for ANY sequence such that . This is important as it means, for any arbitrary sequence of vectors , as . Intuitively, this seems impossible as it means the component of the vectors orthogonal to the null space of (note “orthogonality” formally doesn’t exist here as is not an inner product space) go to infinity but the values are very neatly bounded and, in fact, convergent. We simply have to create a formal argument to express this incongruity.

We do so by first isolating the components of “orthogonal to ”. For any , we can define

and, for every , take some such that . The vector is about the best approximation of “row space component” we can get in non-inner product space. Clearly, and . The key insight here is taking the unit vectors . Clearly, and, as is bounded, there is a subsequence such that for some . As , this forces to be convergent in .

We are close to our desired contradiction. Let . As , this forces and thus . However, we obtained by isolating the “row space components” of and then normalizing them, so they clearly cannot converge to some point in the null space. This is shown formally as follows: for any ,

Therefore, no subsequence of can possibly converge to an element of . We are done.

Corollary of Theorems 3 & 4: For any compact operator and nonnegative integer , where is some bounded operator. is also compact, and thus by Theorems 3 and 4, has a finite dimensional null space and closed range. The following are also trivially true:

Theorem 5: Let be a compact linear operator on a normed space , and let be an arbitrary complex number. There exists a smallest integer (dependent on ) such that from onwards the null spaces are all equal. Furthermore, for all , the inclusions are all proper.

Proof) It suffices to show an exists such that . Assume there is some such that . Then, there is some such that and . must then satisfy and . This implies , a contradiction.

Assume, FTSOC, that is an infinite sequence of proper inclusions. By Riesz’s Lemma, we can take a sequence in such that , , and for any . For any :

as is clearly an element of . Thus, cannot have a convergent subsequence, contradicting compactness.

Theorem 6: Let be a compact linear operator on a normed space , and let be an arbitrary complex number. There exists a smallest integer (dependent on ) such that from onwards the ranges are all equal. Furthermore, for all , the inclusions are all proper.

Proof) It suffices to show a exists such that . Assume is an infinite sequence of proper inclusions. We can similarly take a sequence in such that , , and for all . For any :

as is clearly in . is therefore a bounded sequence but has no convergent subsequence, contradicting compactness.

Theorem 7: Let be a compact linear operator on a normed space , and let be an arbitrary complex number. Let be the power of where the null spaces first stabilize (Thm 5) and be the first power of where the ranges first stabilize (Thm 6). Then, .

Proof) Null space and range stabilization fit into the same geometric picture of sequentially applying to , and so it intuitively makes sense that .

We first show that . First, note that if and , then . This is because if , then for any arbitrarily large , there exists some such that and thus . The nullspaces thus cannot stabilize, an immediate contradiction. For any such that , and thus by above. Therefore, . If , this implies , and as is, by definition, , and we are done.

For the case where , we show that . Take an element . Then, there exists some such that . As the range stabilizes at , there must exist some such that . Thus, , but . As , we are done.