Exercise 2.13

Exercise 13: Construct a compact set of real numbers whose limit points form a countable set.

Answers

Note that | 1 n 1 n 1 | = 1 n ( n 1 ) > 1 n 2 , so that the sets

S n = { 1 n + 1 m : m n 2 } { 1 n }

are disjoint. Consider the set S = n S n { 0 } . The set is clearly bounded, so we need to show that it is closed, and that the limit points are countable.

We claim that the limit points are precisely L = { 1 n : n } 0 . Since L is contained in S and is countable, that will suffice to prove our claim. It is easy to see that these points are limit points. To see that there are no other, observe that any point not in [ 0 , 2 ] or the previously mentioned set is either strictly greater than the lub or strictly smaller than the glb of all but at most one of the disjoint sets S j . It would consequently have to be a limit point of S j , but all such limit points are contained in L . Lastly, we can easily see that 0 is a limit point, but 2 is not.

User profile picture
2023-08-07 00:00
Comments

Theorem 1 (Sequential Compactness). If the metric space X is separable, then K X is compact if and only if every sequence { x n } K has a convergent subsequence that converges to an element of K . This property will be referred to as “sequential compactness.”

Proof. First prove the compactness K implies sequential compactness. Suppose not. Then, for every k K we can find an r k > 0 such that the ball centered at k of radius r k , B ( k , r k ) , has only finitely many x n ’s. These balls form an open cover of K , and by the compactness of K , there is a finite subcover. This implies { x n } is a finite sequence, which is a contradiction.

Now prove sequential compactness implies compactness. There is a countable open cover of K , that is, K j = 1 U j , which is possible because X is assumed to be separable, and therefore we can construct an open set U j which is a ball around every member of the countable subset of K with radius δ > 0 , whose union forms an open cover of K . Suppose, to get a contradiction, that for every N , K j = 1 N U j , which implies for every N there is an x n K such that x n j = 1 N U j ; { x n } forms an infinite sequence in K . By sequential compactness, there is a subsequence of this sequence { x nj } such that x nj x K as j . This implies x is a member of some set U j 0 which is part of the open cover of K . By the definition of convergence, this implies there is some M such that | x nm x | < δ for m > M with δ as given above, and therefore x nm U j 0 for m > M . This is a contradiction, since { x n } was constructed such that all x n j = 1 N U j . □

Construct our set X as follows. First, let X be defined as

X = { 1 2 j } j = 1 { 0 } .

Then let X be the union of X and smaller versions of X in between each 1 2 n , i.e.:

X = X n = 1 { 1 2 m + n + 1 + 1 2 n + 1 } m = 1 .

This X is our compact set of real numbers whose limit points form a countable set.

Proof. The limit points of X form a countable set because by construction, the limit points are the points in X , which is countable since j .

Now prove X is compact. Given any sequence { x i } X , every x i is within the neighborhood of the closest number in the set X . This implies there is a subsequence { x ik } that converges to itself (if it is constant), or to a member of X . By the Sequential Compactness Theorem, this implies compactness since is separable. □

User profile picture
2023-09-01 19:51
Comments