A system of \(n\) linear equations in \(n\) unknowns obeys a simple law: either it has exactly one solution for every right-hand side, or the homogeneous system has a nonzero solution. Around 1900 Fredholm discovered that the integral equation
obeys the same law, although it is an equation in infinitely many unknowns, the values of \(u\) . The shifts of Chapter 2 showed that nothing of the kind holds for bounded operators in general. What is special about the integral operator?
The answer is that it sends bounded sets into sets with compact closure. Such an operator is, in a precise sense, almost finite-dimensional: on a Hilbert space it is a limit in norm of operators of finite rank, and it turns weakly convergent sequences into convergent ones. The first part of this chapter develops these operators; the next chapter completes Fredholm’s law for them. The second part treats a related question for nonlinear maps. When does an equation of the form \(u=T(u)\) have a solution? Three theorems answer under progressively weaker assumptions on \(T\) : Banach’s contraction principle, which is constructive and needs only completeness; Schauder’s theorem, which needs compactness and convexity and gives existence without uniqueness; and Kakutani’s theorem, which allows \(T\) to be set-valued.
9.1 Operators that compress bounded sets
Definition 9.1 (compact operator). A linear operator \(T:X\to Y\) between normed spaces is compact if every bounded sequence \((x_n)\) in \(X\) has a subsequence \((x_{n_j})\) for which \((Tx_{n_j})\) converges in \(Y\) . Equivalently, the image \(T(B_X)\) of the unit ball has compact closure. The set of compact operators is denoted \(\mathcal K(X,Y)\) .
A compact operator is bounded, since otherwise there would be unit vectors \(x_n\) with \(\lVert Tx_n\rVert\to\infty\) , and no subsequence of \((Tx_n)\) could converge. Three observations set the scene. A bounded operator of finite rank, meaning one whose range is finite-dimensional, is compact: it maps bounded sets to bounded subsets of a finite-dimensional space, where bounded sequences have convergent subsequences (Theorem 1.10). Sums and scalar multiples of compact operators are compact, and so is a product \(ST\) in which one factor is compact and the other bounded; so \(\mathcal K(X)\) is a two-sided ideal in \(\mathcal B(X)\) . And the identity operator on an infinite-dimensional space is not compact, by Theorem 1.10 again. Consequently a compact operator on an infinite-dimensional space is never invertible: if \(T\) were compact with bounded inverse, then \(I=T^{-1}T\) would be compact.
Theorem 9.2 (norm limits of compact operators). Let \(X\) be a normed space and \(Y\) a Banach space. If \(T_n\in\mathcal K(X,Y)\) and \(\lVert T_n-T\rVert\to 0\) , then \(T\) is compact.
Proof. Let \((x_j)\) be a sequence in \(X\) with \(\lVert x_j\rVert\le C\) . Since \(T_1\) is compact, a subsequence of \((x_j)\) has convergent image under \(T_1\) ; a further subsequence has convergent image under \(T_2\) ; and so on. The diagonal subsequence, which we again call \((x_j)\) , has \((T_nx_j)_j\) convergent for every \(n\) . Given \(\varepsilon>0\) choose \(n\) with \(\lVert T-T_n\rVert\le\varepsilon\) . Then
where the final term drops below \(\varepsilon\) once \(j\) and \(k\) are large enough. So \((Tx_j)\) is Cauchy, and it converges because \(Y\) is complete.
In particular every norm limit of finite-rank operators is compact. In a Hilbert space the converse holds, and compactness has a description in terms of weak convergence.
Theorem 9.3 (compact operators on Hilbert space). Let \(H\) be a separable Hilbert space with orthonormal basis \((e_k)\) , let \(P_n\) be the orthogonal projection onto the span of \(e_1,\dots,e_n\) , and let \(T\in\mathcal B(H)\) . The following are equivalent: (a) \(T\) is compact; (b) whenever \(x_j\rightharpoonup x\) weakly, \(Tx_j\to Tx\) in norm; (c) \(\lVert T-P_nT\rVert\to 0\) ; in particular \(T\) is a norm limit of finite-rank operators.
Proof. (a) implies (b). Let \(x_j\rightharpoonup x\) . The sequence is bounded, and \(Tx_j\rightharpoonup Tx\) by Proposition 6.2. If \(Tx_j\) did not converge to \(Tx\) in norm, there would be \(\varepsilon>0\) and a subsequence with \(\lVert Tx_{j_i}-Tx\rVert\ge\varepsilon\) . By compactness a further subsequence of \((Tx_{j_i})\) converges in norm to some \(y\) ; then it also converges weakly to \(y\) , so \(y=Tx\) by uniqueness of weak limits, contradicting \(\lVert Tx_{j_i}-Tx\rVert\ge\varepsilon\) .
(b) implies (a). A bounded sequence has a weakly convergent subsequence by Corollary 8.2, and (b) makes its image converge in norm.
(a) implies (c). Suppose \(\lVert T-P_nT\rVert\) does not tend to \(0\) . These norms are nonincreasing in \(n\) , since \(I-P_{n+1}=(I-P_{n+1})(I-P_n)\) , so there are \(\varepsilon>0\) and unit vectors \(x_n\) with \(\lVert(I-P_n)Tx_n\rVert\ge\varepsilon\) for all \(n\) . By compactness a subsequence \(Tx_{n_j}\) converges to some \(y\) . Then
because \(P_ny\to y\) for each fixed \(y\) (Theorem 7.7). This is a contradiction.
(c) implies (a). Each \(P_nT\) has finite rank; apply Theorem 9.2.
Condition (b) is the cleanest way to think about a compact operator on a Hilbert space: it upgrades weak convergence to norm convergence. Condition (c) explains why compact operators behave like matrices. The equivalence of (a) and (b) did not use separability.
Corollary 9.4 (adjoints of compact operators). If \(T\in\mathcal B(H)\) is compact on a Hilbert space \(H\) , then \(T^*\) is compact.
Proof. Let \(\lVert x_j\rVert\le C\) . The operator \(TT^*\) is compact, so after passing to a subsequence \((TT^*x_j)\) converges. Then
so \((T^*x_j)\) is Cauchy and converges.
Example 9.1: Which diagonal operators are compact
Let \((Dx)_k=d_kx_k\) on \(\ell^2\) with \((d_k)\) bounded. Truncating to the first \(n\) coordinates gives the finite-rank operator \(P_nD\) , and \(D-P_nD\) is again diagonal, with entries \(0,\dots,0,d_{n+1},d_{n+2},\dots\) , so by Exercise 3 of Chapter 2Chapter 2
By Theorem 9.3, \(D\) is compact if and only if this tends to \(0\) , that is, if and only if \(d_k\to 0\) . For \(d_k=1/k\) the operator is compact and \(\lVert D-P_nD\rVert=1/(n+1)\) ; the rank-\(9\) truncation is within \(0.1\) of \(D\) in operator norm. For \(d_k=1-1/k\) the operator of Example 2.3 is not compact: \(\lVert D-P_nD\rVert=1\) for every \(n\) . One sees the failure directly on the bounded sequence \((e_k)\) , whose images \((1-\tfrac1k)e_k\) are mutually orthogonal with norms tending to \(1\) .
For integral operators the corresponding criterion is a single integral.
Proposition 9.5 (Hilbert–Schmidt operators). Let \(k\) be a measurable function on \([0,1]^2\) with \(\lVert k\rVert_{L^2}^2=\int_0^1\!\!\int_0^1\lvert k(x,y)\rvert^2\,dy\,dx<\infty\) . Then \((Kf)(x)=\int_0^1k(x,y)f(y)\,dy\) defines a compact operator on \(L^2[0,1]\) with \(\lVert K\rVert\le\lVert k\rVert_{L^2}\) .
Proof. By the Cauchy–Schwarz inequality in the variable \(y\) , \(\lvert Kf(x)\rvert^2\le\int_0^1\lvert k(x,y)\rvert^2\,dy\cdot\lVert f\rVert_2^2\) , and integrating in \(x\) gives \(\lVert Kf\rVert_2\le\lVert k\rVert_{L^2}\lVert f\rVert_2\) . For compactness let \((e_i)\) be an orthonormal basis of \(L^2[0,1]\) . The products \(e_i(x)\overline{e_j(y)}\) form an orthonormal basis of \(L^2([0,1]^2)\) , a consequence of the Fubini theorem, so \(k=\sum_{i,j}c_{ij}\,e_i(x)\overline{e_j(y)}\) with convergence in \(L^2\) of the square. The partial sum \(k_n\) over \(i,j\le n\) is the kernel of a finite-rank operator \(K_n\) , and by the bound just proved, applied to \(k-k_n\) , we get \(\lVert K-K_n\rVert\le\lVert k-k_n\rVert_{L^2}\to 0\) . Theorem 9.2 finishes the proof.
Example 9.2: Two compact integral operators
For \(k(x,y)=\min\{x,y\}\) ,
so the operator \(K\) with this kernel is compact on \(L^2[0,1]\) and \(\lVert K\rVert\le 1/\sqrt6\approx 0.4082\) . The bound is close: Chapter 10 computes \(\lVert K\rVert=4/\pi^2\approx 0.4053\) .
The Volterra operator has the kernel equal to \(1\) for \(y\le x\) and \(0\) otherwise, with \(\lVert k\rVert_{L^2}^2=\tfrac12\) . So \(V\) is compact on \(L^2[0,1]\) and \(\lVert V\rVert\le 1/\sqrt2\approx 0.7071\) ; the exact value, also found in Chapter 10, is \(2/\pi\approx 0.6366\) . Recall that on \(C[0,1]\) the norm of the same formula was \(1\) .
Example 9.3: A bounded operator that is not compact
Let \((Mf)(x)=xf(x)\) on \(L^2[0,1]\) , a bounded operator with \(\lVert M\rVert\le 1\) . The functions \(s_k(x)=\sqrt2\sin(k\pi x)\) are orthonormal, so \(s_k\rightharpoonup 0\) . If \(M\) were compact, Theorem 9.3 would give \(\lVert Ms_k\rVert_2\to 0\) . But
For \(k=5\) the value is about \(0.3313\) . So \(M\) is not compact. Multiplication changes the size of a function point by point and does nothing to damp oscillation, whereas integration against a kernel averages oscillation away.
Common mistake. Assuming that a bounded operator maps the unit ball to a compact set, or that a bounded sequence of approximate solutions has a convergent subsequence. Both are true in finite dimensions and false in general. In an infinite-dimensional space, compactness of an operator must be proved, typically by Proposition 9.5, by Theorem 9.2, or by the Arzelà–Ascoli theorem, and it fails for the identity, for shifts, and for multiplication operators.
9.2 The contraction principle
We turn to fixed points, beginning with the theorem that needs least and gives most.
Theorem 9.6 (Banach fixed-point theorem). Let \((X,d)\) be a nonempty complete metric space and \(T:X\to X\) a map for which there is a constant \(q<1\) with
Then \(T\) has exactly one fixed point \(x^\star\) . For any starting point \(x_0\) the iterates \(x_{n+1}=Tx_n\) converge to \(x^\star\) , and
Proof. By induction \(d(x_{n+1},x_n)\le q^nd(x_1,x_0)\) . For \(m>n\) the triangle inequality and the geometric series give
so \((x_n)\) is Cauchy and converges to some \(x^\star\) , since \(X\) is complete. A contraction is continuous, so \(Tx^\star=\lim Tx_n=\lim x_{n+1}=x^\star\) . If \(Ty=y\) as well, then \(d(x^\star,y)=d(Tx^\star,Ty)\le q\,d(x^\star,y)\) , which forces \(d(x^\star,y)=0\) . Letting \(m\to\infty\) in the displayed estimate gives the first error bound. For the second, \(d(x_n,x^\star)\le d(x_n,x_{n+1})+d(x_{n+1},x^\star)\le q\,d(x_{n-1},x_n)+q\,d(x_n,x^\star)\) .
The map \(T\)
need not be linear and \(X\)
need not be a vector space; a closed subset of a Banach space is the usual setting. The first error bound is known before any iteration beyond the first has been carried out, the second after each step. The Neumann series of Chapter 2 is the special case of an affine map \(Tx=Ax+b\)
on a Banach space with \(\lVert A\rVert<1\)
. The most famous application is the existence and uniqueness theorem for the initial value problem \(u'=F(x,u)\)
, \(u(x_0)=u_0\)
, with \(F\)
continuous and Lipschitz in \(u\)
, which Differential Equations proves by applying Theorem 9.6 to an integral operator (math.differential-equations.picard-lindelof).
Example 9.4: Successive approximation for a nonlinear equation
Consider \(u'=\cos u\) with \(u(0)=0\) , rewritten as the fixed-point equation \(u=T(u)\) with
on the Banach space \(C[0,\tfrac12]\) with the supremum norm. Since \(\lvert\cos a-\cos b\rvert\le\lvert a-b\rvert\) ,
so \(T\) is a contraction with \(q=\tfrac12\) . Starting from \(u_0=0\) , the iterates are \(u_1(x)=x\) , \(u_2(x)=\sin x\) , and \(u_3(x)=\int_0^x\cos(\sin t)\,dt\) . The exact solution can be found by separating variables: \(u(x)=2\arctan(\tanh(x/2))\) , for which \(u(\tfrac12)\approx 0.48038\) .
With \(\lVert u_1-u_0\rVert_\infty=\tfrac12\) , the a priori bound of Theorem 9.6 is \(\lVert u_n-u\rVert_\infty\le 2^{-n}\) , giving \(0.5\) , \(0.25\) , \(0.125\) for \(n=1,2,3\) . The true errors are about \(0.0196\) , \(0.00096\) , and \(0.000033\) . The guarantee is valid and pessimistic, as worst-case bounds usually are; here the errors behave like those of the Volterra operator in Example 2.5, shrinking factorially.
Example 9.5: Why the constant must be less than one, and the space complete
On the complete space \([1,\infty)\) let \(T(x)=x+1/x\) . For \(x\ne y\) ,
so \(T\) strictly decreases distances. But \(T(x)>x\) for all \(x\) , so there is no fixed point. No single \(q<1\) works: the factor \(1-1/(xy)\) approaches \(1\) as \(x,y\to\infty\) , and the iterates \(x_{n+1}=x_n+1/x_n\) increase without bound, passing \(10\) after about fifty steps from \(x_0=1\) .
On the incomplete space \((0,1]\) the map \(T(x)=x/2\) is a contraction with \(q=\tfrac12\) and has no fixed point; its iterates converge to \(0\) , which has been removed. Each hypothesis of Theorem 9.6 is needed.
9.3 Fixed points from compactness
The contraction principle demands a quantitative hypothesis. The next family of theorems demands none, only continuity, at the price of compactness and convexity of the domain. The finite-dimensional case is a theorem of topology which we quote.
Theorem 9.7 (Brouwer). Let \(C\) be a nonempty compact convex subset of a finite-dimensional normed space. Every continuous map \(f:C\to C\) has a fixed point.
In one dimension \(C\) is an interval \([a,b]\) and the theorem follows from the intermediate value theorem applied to \(f(x)-x\) . In higher dimensions the proof requires tools from algebraic or combinatorial topology and belongs to no course in this library; we use the theorem as a black box. It gives no uniqueness and no algorithm. In infinite dimensions the statement is false for closed balls, as Example 9.7 will show, and the extra ingredient that restores it is compactness.
Lemma 9.8 (finite-dimensional approximation of a compact set). Let \(K\) be a compact subset of a normed space \(X\) and \(\varepsilon>0\) . There are points \(y_1,\dots,y_m\in K\) and a continuous map \(P_\varepsilon\) from \(K\) into the convex hull of \(\{y_1,\dots,y_m\}\) with \(\lVert P_\varepsilon x-x\rVert<\varepsilon\) for all \(x\in K\) .
Proof. By compactness choose \(y_1,\dots,y_m\in K\) such that the balls \(B(y_i,\varepsilon)\) cover \(K\) . Let \(\phi_i(x)=\max\{0,\varepsilon-\lVert x-y_i\rVert\}\) , a continuous function that is positive exactly on \(B(y_i,\varepsilon)\) . For \(x\in K\) the sum \(\sum_i\phi_i(x)\) is positive, and
is a convex combination of those \(y_i\) with \(\lVert x-y_i\rVert<\varepsilon\) . Hence \(\lVert P_\varepsilon x-x\rVert<\varepsilon\) , and \(P_\varepsilon\) is continuous.
Theorem 9.9 (Schauder fixed-point theorem). Let \(C\) be a nonempty closed convex subset of a Banach space \(X\) , and let \(T:C\to C\) be a continuous map whose image \(T(C)\) is contained in a compact subset of \(C\) . Then \(T\) has a fixed point. In particular every continuous map of a nonempty compact convex set into itself has a fixed point.
Proof. Let \(K\) be the closure of \(T(C)\) ; it is compact and, \(C\) being closed, contained in \(C\) . For each \(n\) apply Lemma 9.8 with \(\varepsilon=1/n\) to get points \(y_1,\dots,y_m\in K\) and a map \(P_n\) into their convex hull \(C_n\) . Since \(C\) is convex, \(C_n\subseteq C\) ; and \(C_n\) is a compact convex subset of the finite-dimensional space spanned by the \(y_i\) . The map \(P_n\circ T\) sends \(C_n\) continuously into itself, so by Theorem 9.7 there is \(x_n\in C_n\) with \(P_n(Tx_n)=x_n\) . Then
The points \(Tx_n\) lie in the compact set \(K\) , so a subsequence \(Tx_{n_j}\) converges to some \(z\in K\) , and then \(x_{n_j}\to z\) as well. By continuity \(Tx_{n_j}\to Tz\) . Hence \(Tz=z\) .
The proof shows what compactness is for: it makes the nonlinear problem approximable by finite-dimensional ones, uniformly, and then lets the approximate fixed points accumulate. A nonlinear map that is continuous and sends bounded sets into sets with compact closure is itself called compact; by the Arzelà–Ascoli theorem, which says that a bounded and equicontinuous family in \(C[0,1]\) has compact closure, integral operators are the standard source.
Example 9.6: An integral equation beyond the reach of the contraction principle
Consider, in \(C[0,1]\) with the supremum norm,
A smooth solution satisfies \(-u''=3\cos u\) with \(u(0)=0\) and \(u'(1)=0\) , as differentiation shows. The map \(T\) is continuous, and it is Lipschitz with constant at most \(3\cdot\tfrac12=\tfrac32\) , using \(\max_x\int_0^1\min\{x,y\}\,dy=\tfrac12\) from Example 2.5. The constant exceeds \(1\) , so Theorem 9.6 does not apply.
Schauder’s theorem does. Since \(\lvert\cos\rvert\le 1\) , every \(Tu\) satisfies \(\lVert Tu\rVert_\infty\le\tfrac32\) , so \(T\) maps the closed ball \(C\) of radius \(\tfrac32\) into itself. And \(\lvert Tu(x)-Tu(x')\rvert\le 3\lvert x-x'\rvert\) for every \(u\) , because \(\lvert\min\{x,y\}-\min\{x',y\}\rvert\le\lvert x-x'\rvert\) . So \(T(C)\) is bounded and equicontinuous, and by the Arzelà–Ascoli theorem its closure is compact. Theorem 9.9 gives a fixed point: the equation has at least one continuous solution.
The theorem says nothing about how many solutions there are or how to find one. A numerical computation, discretising the integral at \(400\) midpoints and solving the resulting nonlinear system, finds a solution that increases from \(u(0)=0\) to \(u(1)\approx 0.986\) , and the same solution is reached from several different starting guesses. That is evidence about this particular equation, not a consequence of the theorem.
Example 9.7: A continuous self-map of the unit ball with no fixed point
Let \(B\) be the closed unit ball of \(\ell^2\) and define
This map is continuous, being built from the norm and the right shift, and
so \(T\) maps \(B\) into the unit sphere. Suppose \(T(x)=x\) . Then \(\lVert x\rVert=1\) , so the first coordinate of \(T(x)\) is \(0\) , giving \(x_1=0\) ; comparing second coordinates, \(x_2=x_1=0\) ; and so on. Thus \(x=0\) , contradicting \(\lVert x\rVert=1\) . There is no fixed point. For instance \(x=(\tfrac35,0,0,\dots)\) is sent to \((\tfrac45,\tfrac35,0,\dots)\) , at distance \(\sqrt{(1/5)^2+(3/5)^2}=\sqrt{10}/5\approx 0.632\) from \(x\) .
The ball \(B\) is closed, bounded, and convex, and \(T\) is continuous. What fails is compactness: \(T(B)\) contains the orthonormal sequence \(T(e_k)=e_{k+1}\) , which has no convergent subsequence, so \(T(B)\) lies in no compact set. Brouwer’s theorem does not extend to the unit ball of an infinite-dimensional space, and the compactness hypothesis in Theorem 9.9 cannot be dropped.
9.4 Fixed points of set-valued maps
In some problems the natural map assigns to each point not one value but a set of values. If \(x\) describes the behaviour of the participants in an economic model, the set \(F(x)\) might consist of all best replies to \(x\) , and a point with \(x\in F(x)\) is an equilibrium. Let \(K\) be a subset of \(\mathbb R^n\) . A correspondence \(F\) from \(K\) to \(K\) assigns to each \(x\in K\) a nonempty subset \(F(x)\subseteq K\) . It has closed graph if \(x_j\to x\) , \(y_j\in F(x_j)\) , and \(y_j\to y\) together imply \(y\in F(x)\) . A fixed point of \(F\) is a point with \(x\in F(x)\) .
Theorem 9.10 (Kakutani fixed-point theorem). Let \(K\) be a nonempty compact convex subset of \(\mathbb R^n\) , and let \(F\) be a correspondence from \(K\) to \(K\) such that every \(F(x)\) is nonempty and convex and \(F\) has closed graph. Then there is \(x^\star\in K\) with \(x^\star\in F(x^\star)\) .
Proof. Approximating maps. For each \(k\ge 1\) choose points \(x_1,\dots,x_m\in K\) such that the balls \(B(x_i,1/k)\) cover \(K\) , put \(\phi_i(x)=\max\{0,1/k-\lVert x-x_i\rVert\}\) , and choose \(y_i\in F(x_i)\) . Define
As in Lemma 9.8, \(f_k\) is continuous, and \(f_k(x)\) is a convex combination of those \(y_i\) for which \(\lVert x-x_i\rVert<1/k\) ; since \(K\) is convex, \(f_k\) maps \(K\) into \(K\) . By Theorem 9.7 there is \(x^k\in K\) with \(f_k(x^k)=x^k\) . By compactness a subsequence of \((x^k)\) converges to some \(x^\star\in K\) .
A neighbourhood property. Fix \(\delta>0\) and let \(N_\delta=\{y\in\mathbb R^n:\operatorname{dist}(y,F(x^\star))\le\delta\}\) , which is closed, and convex because \(F(x^\star)\) is convex. We claim there is \(\eta>0\) such that \(F(x)\subseteq N_\delta\) whenever \(x\in K\) and \(\lVert x-x^\star\rVert<\eta\) . If not, there are \(x_j\to x^\star\) and \(y_j\in F(x_j)\) with \(\operatorname{dist}(y_j,F(x^\star))>\delta\) . Passing to a subsequence, \(y_j\to y\in K\) , and the closed graph gives \(y\in F(x^\star)\) , which contradicts \(\operatorname{dist}(y,F(x^\star))\ge\delta\) .
Conclusion. Take \(k\) in the subsequence so large that \(1/k<\eta/2\) and \(\lVert x^k-x^\star\rVert<\eta/2\) . Every index \(i\) with \(\phi_i(x^k)>0\) has \(\lVert x_i-x^\star\rVert<\eta\) , so \(y_i\in F(x_i)\subseteq N_\delta\) . Thus \(x^k=f_k(x^k)\) is a convex combination of points of the convex set \(N_\delta\) , and \(x^k\in N_\delta\) . Letting \(k\to\infty\) , \(x^\star\in N_\delta\) . This holds for every \(\delta>0\) , and \(F(x^\star)\) is closed because the graph is closed; hence \(x^\star\in F(x^\star)\) .
When \(F(x)=\{f(x)\}\)
is single-valued, a closed graph into a compact set is the same as continuity of \(f\)
, and the theorem reduces to Brouwer’s. The principal application lies outside this course: the existence of a Nash equilibrium in mixed strategies, proved in Game Theory by applying Theorem 9.10 to the best-reply correspondence on a product of simplices (math.game-theory.nash-existence-theorem).
Example 9.8: A best-reply correspondence on an interval
On \(K=[0,1]\) let
Every value is a nonempty convex set, and the graph, consisting of two horizontal segments joined by a vertical one, is closed. Theorem 9.10 promises a fixed point, and \(x^\star=\tfrac12\) is one, since \(\tfrac12\in F(\tfrac12)\) ; it is the only one.
Both hypotheses on \(F\) matter. Replace \(F(\tfrac12)\) by the two-point set \(\{0,1\}\) : the graph is still closed, but the value at \(\tfrac12\) is not convex, and no point satisfies \(x\in F(x)\) . Replace \(F(\tfrac12)\) instead by \(\{1\}\) : the values are convex, but the graph is not closed, because the points \((\tfrac12+\tfrac1j,0)\) of the graph converge to \((\tfrac12,0)\) , which is not in it; again there is no fixed point. The second variant is an ordinary discontinuous function, \(1\) up to \(\tfrac12\) and \(0\) after, and the full interval \(F(\tfrac12)=[0,1]\) is exactly what must be added to its graph to close the gap in a convex way.
The construction in the proof can be followed numerically. With centres \(x_i\) at the \(k\) midpoints of a uniform partition and selections \(y_i\in F(x_i)\) , the continuous map \(f_k\) equals \(1\) on the left, \(0\) on the right, and descends steeply near \(\tfrac12\) ; its fixed point is at distance less than \(1/k\) from \(\tfrac12\) .
The three theorems form a ladder, summarised below.
| Theorem | Domain | Map | Conclusion |
|---|---|---|---|
| Banach | complete metric space | contraction with constant \(q<1\) | unique fixed point, convergent iteration, error bounds |
| Schauder | closed convex subset of a Banach space | continuous, image in a compact set | at least one fixed point |
| Kakutani | compact convex subset of \(\mathbb R^n\) | convex-valued correspondence with closed graph | at least one fixed point |
Moving down the table, the hypothesis on the map weakens and the hypothesis on the domain strengthens, and uniqueness and computability are lost. The linear theory of the final chapter returns to compact operators and shows that for them the questions of existence and uniqueness are tied together.
Exercises
-
For \(a,b\) in a Hilbert space \(H\) let \(Tx=\langle x,a\rangle b\) . Show that \(T\) is compact, find \(\lVert T\rVert\) , and find \(T^*\) .
Answer
\(T\) has rank at most one, so it is compact. \(\lVert Tx\rVert=\lvert\langle x,a\rangle\rvert\lVert b\rVert\le\lVert a\rVert\lVert b\rVert\lVert x\rVert\) with equality at \(x=a\) , so \(\lVert T\rVert=\lVert a\rVert\lVert b\rVert\) . From \(\langle Tx,y\rangle=\langle x,a\rangle\langle b,y\rangle=\langle x,\langle y,b\rangle a\rangle\) we get \(T^*y=\langle y,b\rangle a\) .
-
Let \((Dx)_k=x_k/\sqrt k\) on \(\ell^2\) . Is \(D\) compact? Compute \(\lVert D-P_nD\rVert\) , and determine how large \(n\) must be for the finite-rank truncation to approximate \(D\) within \(0.1\) in operator norm.
Answer
Yes: \(d_k=1/\sqrt k\to 0\) . \(\lVert D-P_nD\rVert=\sup_{k>n}k^{-1/2}=1/\sqrt{n+1}\) , which is at most \(0.1\) exactly when \(n\ge 99\) . Compare \(d_k=1/k\) in Example 9.1, where \(n=9\) suffices: the slower the diagonal decays, the larger the rank needed.
-
Let \(T\in\mathcal K(X)\) and \(S\in\mathcal B(X)\) . Prove that \(ST\) and \(TS\) are compact.
Hint
If \((x_n)\) is bounded, pick a subsequence along which \(Tx_n\) converges; then \(STx_n\) converges because \(S\) is continuous. For \(TS\) , the sequence \((Sx_n)\) is bounded, so \(T(Sx_n)\) has a convergent subsequence.
-
Let \(X\) and \(Y\) be Banach spaces with \(Y\) infinite-dimensional, and let \(T\in\mathcal K(X,Y)\) . Prove that \(T\) is not surjective.
Solution
Suppose \(T\) were surjective. Since \(X\) and \(Y\) are Banach spaces, the open mapping theorem (Theorem 5.1) gives \(\delta>0\) with
\[ B_Y(0,\delta)\subseteq T(B_X(0,1)) . \]Because \(T\) is compact, the closure of \(T(B_X(0,1))\) is a compact subset of \(Y\) . The closed ball \(\{y:\lVert y\rVert\le\delta/2\}\) is a closed subset of that compact set, hence compact. Scaling by \(2/\delta\) , which is a homeomorphism of \(Y\) , the closed unit ball of \(Y\) is compact. By Theorem 1.10, \(Y\) is finite-dimensional, contrary to hypothesis. So \(T\) is not surjective.
The argument combines three chapters: the open mapping theorem turns surjectivity into the statement that the image of the unit ball is large, compactness says that it is small, and the theorem of Riesz on the unit ball says that the two are incompatible in infinite dimensions. A sharper statement is true and follows from the same reasoning applied to the closure of the range: the range of a compact operator contains no closed infinite-dimensional subspace. The diagonal operator of Example 5.2 illustrates it, with a dense range that is not closed.
-
Show that the inclusion of \(\ell^1\) into \(\ell^2\) is bounded but not compact, and explain how the Arzelà–Ascoli theorem shows that the inclusion of \(C^1[0,1]\) , with the norm \(\lVert f\rVert_\infty+\lVert f'\rVert_\infty\) , into \(C[0,1]\) is compact.
Hint
The unit vectors \(e_k\) are bounded in \(\ell^1\) and their images in \(\ell^2\) are at mutual distance \(\sqrt2\) . For the second inclusion, a set bounded in \(C^1[0,1]\) is bounded in the supremum norm and, by the mean value theorem, uniformly Lipschitz, hence equicontinuous.
-
Compute \(\lVert k\rVert_{L^2}\) for the kernels \(k(x,y)=xy\) and \(k(x,y)=x+y\) on \([0,1]^2\) . For the first, compare with the exact operator norm on \(L^2[0,1]\) found in Exercise 7 of Chapter 2Chapter 2 and explain why they agree.
Solution
For \(k(x,y)=xy\) ,
\[ \lVert k\rVert_{L^2}^2=\int_0^1x^2\,dx\int_0^1y^2\,dy=\tfrac13\cdot\tfrac13=\tfrac19,\qquad\lVert k\rVert_{L^2}=\tfrac13 . \]For \(k(x,y)=x+y\) ,
\[ \lVert k\rVert_{L^2}^2=\int_0^1\!\!\int_0^1(x^2+2xy+y^2)\,dy\,dx=\tfrac13+\tfrac12+\tfrac13=\tfrac76,\qquad\lVert k\rVert_{L^2}=\sqrt{7/6}\approx 1.080 . \]Exercise 7 of Chapter 2Chapter 2 found that the operator with kernel \(xy\) has norm exactly \(\tfrac13\) on \(L^2[0,1]\) . So the bound \(\lVert K\rVert\le\lVert k\rVert_{L^2}\) of Proposition 9.5 is an equality in this case. The reason is that the operator has rank one: \(Kf=\langle f,u\rangle u\) with \(u(x)=x\) , whose operator norm is \(\lVert u\rVert_2^2\) , while \(\lVert k\rVert_{L^2}=\lVert u\rVert_2\lVert u\rVert_2\) because the kernel is a product.
For \(x+y\) the operator has rank two and the inequality is strict. On the invariant subspace spanned by \(1\) and \(x\) one computes \(K1=x+\tfrac12\) and \(Kx=\tfrac12x+\tfrac13\) , and the resulting \(2\times 2\) matrix has eigenvalues \(\tfrac12\pm\tfrac1{\sqrt3}\) . Since the kernel is symmetric the operator is self-adjoint and its norm is the largest absolute eigenvalue, \(\tfrac12+\tfrac1{\sqrt3}\approx 1.077\) , slightly below \(1.080\) . The squares of the two eigenvalues add up to \(2(\tfrac14+\tfrac13)=\tfrac76\) , which is \(\lVert k\rVert_{L^2}^2\) : the Hilbert–Schmidt bound measures all the eigenvalues together, the operator norm only the largest.
-
Use the Arzelà–Ascoli theorem to prove that the Volterra operator is compact on \(C[0,1]\) with the supremum norm.
Hint
For \(\lVert f\rVert_\infty\le 1\) : \(\lvert Vf(x)\rvert\le 1\) and \(\lvert Vf(x)-Vf(x')\rvert\le\lvert x-x'\rvert\) . So the image of the unit ball is bounded and equicontinuous.
-
Show that \(T(x)=\cos x\) maps \([0,1]\) into itself and is a contraction there, give its constant, and use the a priori bound of Theorem 9.6 to find a number of iterations from \(x_0=1\) that guarantees an error below \(10^{-3}\) .
Solution
For \(0\le x\le 1\) we have \(\cos 1\le\cos x\le 1\) , and \(\cos 1\approx 0.5403>0\) , so \(T\) maps \([0,1]\) into itself. The interval is a complete metric space. If \(f\) is differentiable on an interval then \(\lvert f(x)-f(y)\rvert\le\sup\lvert f'\rvert\,\lvert x-y\rvert\) , by the mean value theorem (
math.real-analysis.mean-value-theorem). Here \(\lvert f'(x)\rvert=\sin x\le\sin 1\) on \([0,1]\) , so\[ \lvert\cos x-\cos y\rvert\le q\,\lvert x-y\rvert,\qquad q=\sin 1\approx 0.8415<1 . \]By Theorem 9.6 there is a unique fixed point \(x^\star\in[0,1]\) ; numerically \(x^\star\approx 0.739085\) .
From \(x_0=1\) , \(x_1=\cos 1\) and \(\lvert x_1-x_0\rvert=1-\cos 1\approx 0.4597\) . The a priori bound requires
\[ \frac{q^n}{1-q}\cdot 0.4597<10^{-3},\qquad\text{that is}\qquad q^n<3.45\times 10^{-4},\qquad n>\frac{\ln(3.45\times 10^{-4})}{\ln 0.8415}\approx 46.2 . \]So \(n=47\) iterations are guaranteed to suffice. In fact the error first drops below \(10^{-3}\) at \(n=15\) . The discrepancy has a clear source: the contraction constant \(\sin 1\) is the worst case over the whole interval, while near the fixed point the map contracts by about \(\sin(0.739)\approx 0.674\) per step. The a posteriori bound, which uses the actual step \(\lvert x_n-x_{n-1}\rvert\) , would detect convergence much earlier.
-
Solve \(u(x)=x+\lambda\int_0^1xy\,u(y)\,dy\) in \(C[0,1]\) exactly for every real \(\lambda\ne 3\) . For which \(\lambda\) does Theorem 9.6 guarantee a unique solution in \(C[0,1]\) with the supremum norm, and what happens at \(\lambda=3\) ?
Solution
The integral \(\int_0^1y\,u(y)\,dy\) is a number, so any solution has the form \(u(x)=cx\) with \(c=1+\lambda\int_0^1y\,u(y)\,dy\) . Substituting \(u=cx\) : \(\int_0^1y\cdot cy\,dy=c/3\) , so
\[ c=1+\frac{\lambda c}{3},\qquad c=\frac{3}{3-\lambda}\quad(\lambda\ne 3),\qquad u(x)=\frac{3x}{3-\lambda} . \]For every \(\lambda\ne 3\) this is the one and only solution. For example \(\lambda=1\) gives \(u=\tfrac32x\) , and indeed \(x+\int_0^1xy\cdot\tfrac32y\,dy=x+\tfrac12x\) .
Write the equation as \(u=T(u)\) with \(T(u)=g+\lambda Ku\) , \(g(x)=x\) , and \(K\) the operator with kernel \(xy\) . Then \(\lVert T(u)-T(v)\rVert_\infty\le\lvert\lambda\rvert\lVert K\rVert\lVert u-v\rVert_\infty\) , and \(\lVert K\rVert=\tfrac12\) on \(C[0,1]\) (Exercise 7 of Chapter 2Chapter 2). So Theorem 9.6 applies when \(\lvert\lambda\rvert<2\) . For \(2\le\lvert\lambda\rvert\) with \(\lambda\ne 3\) the theorem is silent in this norm, but the explicit formula shows that a unique solution exists anyway: being a contraction is sufficient for unique solvability, not necessary.
At \(\lambda=3\) the equation for \(c\) reads \(c=1+c\) , which is impossible, so there is no solution. At the same time the homogeneous equation \(u=3\int_0^1xy\,u(y)\,dy\) has the nonzero solution \(u(x)=x\) . Loss of existence and loss of uniqueness occur at the same value of \(\lambda\) , namely the reciprocal of the eigenvalue \(\tfrac13\) of \(K\) . Chapter 10 proves that this coincidence is a general law for compact operators.
-
Find the flaw: “The map \(T(x)=x+1/x\) on \([1,\infty)\) satisfies \(\lvert Tx-Ty\rvert<\lvert x-y\rvert\) for \(x\ne y\) , so it is a contraction on a complete metric space and has a unique fixed point.”
Answer
A contraction requires one constant \(q<1\) with \(\lvert Tx-Ty\rvert\le q\lvert x-y\rvert\) for all \(x,y\) . Here the ratio \(\lvert Tx-Ty\rvert/\lvert x-y\rvert=1-1/(xy)\) is less than \(1\) for each pair but has supremum \(1\) . The map has no fixed point, since \(T(x)>x\) .
-
Prove the a posteriori bound \(d(x_n,x^\star)\le\frac{q}{1-q}d(x_n,x_{n-1})\) of Theorem 9.6 in detail, and explain why it is usually sharper in practice than the a priori bound.
Hint
Start from \(d(x_n,x^\star)\le d(x_n,x_{n+1})+d(x_{n+1},x^\star)\) , bound the first term by \(q\,d(x_{n-1},x_n)\) and the second by \(q\,d(x_n,x^\star)\) , and solve for \(d(x_n,x^\star)\) . It uses the observed step size instead of the initial one, so it reflects the actual, often faster, local rate of contraction.
-
Let \(T:X\to X\) be a map on a complete metric space such that some power \(T^m\) is a contraction. Prove that \(T\) has exactly one fixed point, and apply this to \((Tu)(x)=1+\int_0^xu(t)\,dt\) on \(C[0,1]\) with the supremum norm.
Solution
Let \(S=T^m\) , a contraction of the complete metric space \(X\) . By Theorem 9.6, \(S\) has a unique fixed point \(x^\star\) . Then
\[ S(Tx^\star)=T^{m+1}x^\star=T(Sx^\star)=Tx^\star , \]so \(Tx^\star\) is also a fixed point of \(S\) . By uniqueness \(Tx^\star=x^\star\) . Conversely any fixed point of \(T\) is a fixed point of \(S=T^m\) , hence equals \(x^\star\) . So \(T\) has exactly one fixed point. Moreover the iterates of \(T\) from any starting point converge to it, since each of the \(m\) subsequences \((T^{mj+r}x_0)_j\) , \(r=0,\dots,m-1\) , is a sequence of iterates of \(S\) .
For \((Tu)(x)=1+\int_0^xu\) on \(C[0,1]\) we have \(Tu-Tv=V(u-v)\) , where \(V\) is the Volterra operator, so the best Lipschitz constant of \(T\) is \(\lVert V\rVert=1\) and \(T\) is not a contraction for the supremum norm on \([0,1]\) . But \(T^2u-T^2v=V^2(u-v)\) , and \(\lVert V^2\rVert=\tfrac12\) by Example 2.5. So \(T^2\) is a contraction with \(q=\tfrac12\) , and \(T\) has a unique fixed point in \(C[0,1]\) . It is the solution of \(u'=u\) , \(u(0)=1\) , namely \(u(x)=e^x\) . The same device proves global existence for linear initial value problems on any bounded interval, where a single application of the integral operator need not contract.
-
Deduce the one-dimensional case of Theorem 9.7 from the intermediate value theorem, and give a continuous map of the open interval \((0,1)\) into itself with no fixed point.
Answer
Let \(f:[a,b]\to[a,b]\) be continuous and \(g(x)=f(x)-x\) . Then \(g(a)\ge 0\) and \(g(b)\le 0\) , so \(g\) vanishes somewhere. On \((0,1)\) the map \(f(x)=x/2\) has no fixed point; the interval is not compact.
-
Let \(k\) be continuous on \([0,1]^2\) and \(g:\mathbb R\to\mathbb R\) continuous and bounded. Prove that the equation \(u(x)=\int_0^1k(x,y)\,g(u(y))\,dy\) has at least one solution \(u\in C[0,1]\) .
Solution
Let \(m=\sup\lvert g\rvert\) and \(\kappa=\max\lvert k\rvert\) , and let \(C\) be the closed ball of radius \(R=m\kappa\) in \(C[0,1]\) , a closed convex set. Define \((Tu)(x)=\int_0^1k(x,y)g(u(y))\,dy\) .
\(T\) maps \(C[0,1]\) into \(C\) . \(\lvert Tu(x)\rvert\le\kappa m=R\) , and \(Tu\) is continuous by the estimate that follows.
Equicontinuity. Given \(\varepsilon>0\) , uniform continuity of \(k\) on the compact square gives \(\delta>0\) with \(\lvert k(x,y)-k(x',y)\rvert\le\varepsilon\) whenever \(\lvert x-x'\rvert\le\delta\) . Then \(\lvert Tu(x)-Tu(x')\rvert\le\varepsilon m\) for every \(u\) . So \(T(C)\) is bounded and equicontinuous, and by the Arzelà–Ascoli theorem its closure is compact; that closure lies in the closed set \(C\) .
Continuity of \(T\) . Let \(u_n\to u\) uniformly. All these functions take values in some bounded interval \([-r,r]\) , on which \(g\) is uniformly continuous, so \(g\circ u_n\to g\circ u\) uniformly, and \(\lVert Tu_n-Tu\rVert_\infty\le\kappa\lVert g\circ u_n-g\circ u\rVert_\infty\to 0\) .
The hypotheses of Theorem 9.9 hold, so \(T\) has a fixed point \(u\in C\) , which is a continuous solution of the equation. No Lipschitz condition on \(g\) was needed, and none is available in general; correspondingly the solution need not be unique.
-
For the map \(T\) of Example 9.7, verify continuity, compute \(T(x)\) and \(\lVert T(x)-x\rVert\) for \(x=0\) and for \(x=e_1\) , and state which hypothesis of Theorem 9.9 fails.
Hint
Continuity: \(x\mapsto\lVert x\rVert\) and the shift are continuous, and \(t\mapsto\sqrt{1-t^2}\) is continuous on \([0,1]\) . \(T(0)=e_1\) at distance \(1\) from \(0\) ; \(T(e_1)=e_2\) at distance \(\sqrt2\) from \(e_1\) . The image \(T(B)\) is not contained in a compact set.
-
On \(K=[0,1]\) find all fixed points of the correspondences \(F(x)=[0,1-x]\) and \(G(x)=\{1-\tfrac12x\}\) , and verify the hypotheses of Theorem 9.10 for each.
Answer
\(x\in F(x)\) means \(0\le x\le 1-x\) , so the fixed points of \(F\) are the points of \([0,\tfrac12]\) . \(x\in G(x)\) means \(x=1-\tfrac12x\) , so \(x=\tfrac23\) . In both cases the values are closed intervals or points, hence convex, and the graphs are closed sets; \(G\) is a continuous function.
-
Let \(K\subseteq\mathbb R^n\) be compact and \(f:K\to K\) a function. Prove that the correspondence \(F(x)=\{f(x)\}\) has closed graph if and only if \(f\) is continuous.
Hint
If \(f\) is continuous and \(x_j\to x\) , \(f(x_j)\to y\) , then \(y=f(x)\) . Conversely, if the graph is closed and \(x_j\to x\) , every subsequence of \((f(x_j))\) has, by compactness of \(K\) , a further subsequence converging to some \(y\) , and the closed graph forces \(y=f(x)\) ; so \(f(x_j)\to f(x)\) .
-
Let \(T\) be a compact operator on a Hilbert space and \((e_k)\) an orthonormal sequence. Prove that \(Te_k\to 0\) , and deduce that if \(Te_k=\lambda_ke_k\) for all \(k\) then \(\lambda_k\to 0\) .
Solution
An orthonormal sequence converges weakly to \(0\) : for every \(y\in H\) , Bessel’s inequality (Proposition 7.6) gives \(\sum_k\lvert\langle y,e_k\rangle\rvert^2\le\lVert y\rVert^2\) , so \(\langle e_k,y\rangle\to 0\) , and by Corollary 8.2 this is weak convergence. A compact operator maps weakly convergent sequences to norm convergent ones; this is the implication from (a) to (b) in Theorem 9.3, whose proof did not use separability. Hence \(Te_k\to T0=0\) in norm.
If moreover \(Te_k=\lambda_ke_k\) , then \(\lvert\lambda_k\rvert=\lVert\lambda_ke_k\rVert=\lVert Te_k\rVert\to 0\) .
Two consequences are worth recording. First, a compact operator cannot have infinitely many orthonormal eigenvectors with eigenvalues bounded away from \(0\) ; in particular each eigenspace for a nonzero eigenvalue of a compact self-adjoint operator is finite-dimensional. Second, the criterion gives quick proofs of non-compactness: for multiplication by \(x\) on \(L^2[0,1]\) , Example 9.3 found an orthonormal sequence with \(\lVert Ms_k\rVert_2^2\to\tfrac13\) , and for the identity \(\lVert Ie_k\rVert=1\) .