Skip to main content

Section 4.1 Sequential Compactness

Definition 4.1.

A subset K of a metric space (X,d) is called sequentially compact if every sequence in K has subsequence which converges to a limit in K. If K=X is sequentially compact, we say the metric space (X,d) is sequentially compact.

Example 4.2.

An interval of the form [a,b] with a<b, considered as a subset of R with the usual metric, is sequentially compact by the theorem of Bolzano–Weierstrass.
The following are some basic properties of sequentially compact sets.

Proof.

Let (xn)nN be a sequence of points in K, and let x0K. Then a subsequence (xnk)kN converges to x0 as a sequence in (X,d) if and only if it converges to x0 as a sequence in (K,d). The result follows.

Proof.

In a sequentially compact space (X,d), let (xn)nN be a Cauchy sequence. Then there exists a convergent subsequence (xnk)kN. Let x0X be its limit. We claim that xnx0 as n.
Let ε>0. Then there exists NN such that d(xm,xn)<ε2 when m,nN. Moreover, as xnkx0, there exists KN such that nKN and d(xnK,x0)<ε2. Now
d(xn,x0)d(xn,xnK)+d(xnK,x0)<ε
for nN.

Proof.

Consider a sequence (xn)nN in K that converges in X to a limit x0X. By Theorem 1.35, it suffices to show that x0K.
As K is sequentially compact, there exists a subsequence (xnk)kN that converges to a limit y0K. The same subsequence also converges to x0, and by the uniqueness of limits, we infer that x0=y0K.

Proof.

Let (xn)nN be a sequence in S. As it is also a sequence in X, there exists a subsequence (xnk)kN with a limit x0X. Since S is closed, Theorem 1.35 then implies that x0S, and the proof is complete.

Exercises Exercises

1. (PS8) Compactness and minimisation.

Let (X,d) be a non-empty metric space and f:XR a function. A minimising sequence for f is a sequence (xn)nN in X with
infxXf(x)=limnf(xn),
where we allow limnf(xn)= if necessary.
(a)
Show that every function f:XR has a minimising sequence.
Hint 1.
Exercise B.2 is useful here.
Hint 2.
Note that question asks you to consider the possibility that infxXf(x)=.
Solution.
If
infxXf(x)>,
then this follows from Exercise B.2. Indeed, the definition of the infimum implies that for every nN, there exists a point xnX such that
f(xn)1ninfxXf(x)f(xn).
Thus we obtain a sequence (xn)nN with the required property. If
infxXf(x)=,
then for any nN there exists xnX with f(xn)n. Then
limnf(xn)=
as well. (Note that infxXf(x)=+ is not possible as X.)
Comment.
Note that the question explicitly mentions the possibility that infxXf(x)=. Many students did not treat this case; on an exam this would have cost marks.
(b)
Show that the infimum of f is attained, i.e., there exists a point x0X with
f(x0)=infxXf(x),
if (X,d) is sequentially compact and f is continuous.
Hint.
Argue that the minimising sequence from the previous part has a convergent subsequence.
Solution.
Let (xn)nN be a minimising sequence. If (X,d) is sequentially compact, then there exists a convergent subsequence (xnk)kN. Let x0 be its limit. If f is continuous, then it follows (from Theorem 1.34 and Theorem 1.46) that
f(x0)=limkf(xnk)=limnf(xn)=infxXf(x).
Comment.
It’s easy to see to find counterexamples if we weaken the requirement that X is compact. For instance, the function xx does not attains its minimum over either X=(0,1) or X=R.

2. Bounding functions on compact spaces.

Let (X,d) be a metric space and KX be sequentially compact. Suppose f:XR is continuous. Show that f is bounded on K. That is, show that there exists a real number M>0 such that |f(x)|M for every xK.
Hint.
Try an argument by contradiction.

3. Weierstrass extreme value theorem.

Let X be a metric space and KX be compact. Let fCb(K). Show that there exists xsupK and xinfK such that supxKf(x)=f(xsup) and infxKf(x)=f(xinf).
Hint.

4. Nested compact sets.

In a metric space (X,d), consider a sequence of sets CnX for nN. Suppose that Cn is non-empty and sequentially compact, and Cn+1Cn for every nN. Show that the intersection nNCn is not empty.
Hint 1.
For each nN, pick a point xnCn. Argue that (xn)nN is then a sequence in the sequentially compact set C1.
Hint 2.
Theorem 4.5 is useful.