User Tools

Site Tools


math104-f21:compactness

Equivalences of two definitions of compactness

\gdef\In\subset

Let (X,d)(X,d) be a metric space, KXK \In X a subspace. Recall that we had the following definitions:

(Compactness) : KK is compact if for any open cover of KK, there exists a finite sub-cover.

(Sequential Compactness) : KK is sequentially compact, if for any sequences (xn)(x_n) in KK, there exists a subsequence xnkx_{n_k} that converges to xx, for some xx in KK.

In this note, we prove that they are equivalent.

Compactness \Rightarrow Sequential Compactness

Assume KK is compact. Let (xn)(x_n) be a sequence in KK, and assume xnx_n has no subsequence that converges. That means, for any xKx \in K, there exists a radius rx>0r_x>0, such that the sequence (xn)(x_n) visits Ux=Brx(x)U_x = B_{r_x}(x) finitely many times. Since KxKUxK \In \cup_{x \in K} U_x, and KK is compact, we may find a finite sub-cover, indexed by {x1,,xn}K\{x_1, \cdots, x_n\} \In K Ki=1nUxi. K \In \bigcup_{i=1}^n U_{x_i}. This is impossible, since the infinite sequence (xn)(x_n) visits each UxiU_{x_i} finitely many times, and the sequences is contained in the KK.

Sequential Compactness \Rightarrow Compactness

Assume KK is sequentially compact, we will prove the following two lemma.

Lemma 1

Assume KK is sequentially compact, then for any ϵ>0\epsilon>0, there exists a finite subset SKS \In K, such that KxSBϵ(x).K \In \bigcup_{x \in S} B_\epsilon(x).

Proof: Suppose the Lemma is false, then there exists an ϵ>0\epsilon>0, such that there does not exist a finite subset SKS \In K with KBϵ(S):=xSBϵ(x)K \In B_\epsilon(S) := \bigcup_{x \in S} B_\epsilon(x) . Then, we may produce a sequence iteratively: pick any x1Kx_1 \in K. Assume xkx_k for knk \leq n is picked, then we may pick xn+1K\i=1nBϵ(xi)x_{n+1} \in K \RM \cup_{i=1}^n B_\epsilon(x_i). This process can go on forever, and we have obtained a sequence x1,x2,,x_1, x_2, \cdots, with the property that d(xi,xj)>ϵd(x_i, x_j) > \epsilon. This sequence cannot have convergent subsequence, hence we have a contradition with sequential compactness.

Lemma 2

Assume KK is sequentially compact, then for any open cover {Uα}\{U_\alpha\} of KK, there exists δ>0\delta>0, such that for any xKx \in K, Bδ(x)B_\delta(x) is contained in some open set UαU_\alpha in the given cover.

Proof: Assume the conclusion is false. Then for each positive integer nn, let Vn={xKB1/n(x)⊄UααI}V_n = \{ x \in K \mid B_{1/n}(x) \not \In U_\alpha \forall \alpha \in I \}, and VnV_n is non-empty. Pick xnVnx_n \in V_n and form a sequence. By sequential compactness, we have a convergent subsequence xnkx_{n_k}, converging to xKx \in K.

Say Uα0xU_{\alpha_0} \ni x. Then, we may pick ϵ>0\epsilon>0, such that Bϵ(x)Uα0B_\epsilon(x) \In U_{\alpha_0}. For for NN large enough, such that 1/nk<ϵ/21/{n_k} < \epsilon /2, and d(xnk,x)<ϵ/2d(x_{n_k}, x) < \epsilon/2 for k>Nk > N, we have B1/nk(xnk)Bϵ(x)Uα0 B_{1/{n_k}} (x_{n_k}) \In B_\epsilon(x) \In U_{\alpha_0} contradicting with the construction of xnx_n.

Finish the proof of the theorem

Now that we have the two lemmas, we can finish the proof. Take any open cover {Uα}\{U_\alpha\} of KK. By Lemma 2, we find a δ\delta such that any radius δ\delta ball, with center in KK, is contained in UαU_\alpha. Then, use Lemma 1, we can produce a finite covering of KK with radius δ\delta balls. Then, for each such ball, we can find a 'parent' open set in {Uα}\{U_\alpha\}, that forms the desired finite subcover of {Uα}\{U_\alpha\}.

math104-f21/compactness.txt · Last modified: 2022/01/21 21:33 by pzhou