Home page for accesible maths 3 Limitpoints of sequences and closed sets

Style control - access keys in brackets

Font (2 3) - + Letter spacing (4 5) - + Word spacing (6 7) - + Line spacing (8 9) - +

3.3 Closed sets

Kind Reminder 3.3.1

We have seen above that

  • any finite set of real numbers,

  • the set {1n}n=1{0} ,

  • the set of all real numbers,

can be viewed as the set of limitpoints for some sequences. However, the set Q cannot be the set of limitpoints of any ANY sequence.

This begs for the question: If we come across with a set S of real numbers, can we decide whether there exists some sequence x¯={xn}n=1 such that LIM(x¯)=S. The following proposition gives an important condition for being limitset.

Proposition 3.3.1

[How limitsets look like] Let x¯={xn}n=1 be a sequence. Suppose that {yk}k=1 is a convergent set of limitpoints of x¯ tending to the number y. Then y is also a limitpoint of x¯.

Proof:  We already had versions of this proposition: in the example when we showed that Q is not a limitset and in the proof of the fact that Limsup is always a limitpoint. We use exactly the same idea. Since {yk}k=1 are limitpoints, we have a sequence n1<n2<n3 such that |xnk-yk|<1k. So, by the Sum Rule limkxnk=y. That is it.

By the previous proposition any limitset S must have the following property: Now matter how we choose a convergent sequence x¯={xn}n=1 from S the limit of x¯ is in the set S. This was of course true for the three examples in Kind Reminder 3.3.1. Also, it does not hold for the set of rational numbers and the set of irrational numbers as well (yes, you can approximate irrational numbers by rationals AND any rational number q by the sequence of irrationals :{1n2+q}n=1. The following definition is extremely important.

Definition 3.3.1

A set SR is closed if for any convergent sequence {sn}n=1, limnsnS provided that for any n1, sn is in S.

Example 3.3.1

The intervals [a,b] are closed sets. Finite sets are closed sets. The empty set is a closed set by convention (and yes, the empty set is the set of limitpoints of the sequence {n3}n=1). The set of all real numbers, and the set of all positive real numbers are closed as well. The set {1n}n=1{0} is also closed.

Example 3.3.2 (A Very Cool Closed Set)

Let S be the set of all real numbers x in between 0 and 1 such that all the digits of x are either 1 or 2. This is a closed set that is
” not countable” and does not contain intervals.

The following two propositions help you to find even more complicated closed sets.

Proposition 3.3.2

Let F1,F2, be a sequence of closed sets. Then their intersection k=1Fk is a closed set as well.

Proof:  We only need to show that if {an}n=1 is a convergent sequence tending to a such that for any n1 ank=1Fk, then ak=1Fk as well. This is almost trivial. For any n1 and k1 anFk, so aFk since Fk is closed. The fact that a is an element of all the Fk’s means exactly that ak=1Fk.

Proposition 3.3.3

If F and G are both closed sets then FG is a closed set as well.

Proof:  Let {an}n=1 be a convergent sequence tending to a such that anFG. We need to show that aFG. Clearly, either there is a subsequence {ank}k=1 so that all the ank’s are in F or there is a subsequence {ank}k=1 so that all the ank’s are in G. The limit of this subsequences is a of course. So a is either in F or in G, that is aFG.

Proposition 3.3.4

If x¯={xn}n=1 is an arbitrary sequence in R, then 𝐿𝐼𝑀(x¯) is a closed set.

Proof:  This seems like a new proposition. It is not. It is just Proposition 3.3.1 in a new cloth. We proved that the limit of a convergence sequence of limitpoints of x¯ is again a limitpoint. This means that the set of limitpoints of x¯ is a closed set, not less, not more.

Theorem 3.3.1

Let F be a closed non-empty set inside the interval [0,1]. Then there exists a sequence x¯={xn}n=1F so that the 𝐿𝐼𝑀(x¯)=F. The theorem actually holds for all closed sets but the proof is a bit more (not much, a bit, it will be a workshop question) complicated.

Proof:  The proof is given by an algorithm. We take first the ten 110-intervals, then the hundred 1100-intervals and so on. So, we will have the system of intervals I1,I2,I3,. Our algorithm works the following way. Let us pick the first interval Ik1 that contains an element of F and let this element be x1. Then go further, pick the next interval Ik2 that contains an element of F and let this element be x2. Continuing the process we will obtain a sequence x¯={xn}n=1. Then LIM(x¯)=F. Why? We need to show two things.

  1. 1.

    All elements of F are limitpoints of x¯.

  2. 2.

    If xF then x is not a limitpoint of F.

The second statement is trivial. Indeed, if {xnk}k=1 a convergent subsequence tending to x then all the xnks are in our closed set F, so by the very definition of closedness x must be in F as well. The first statement is a bit more trickier, but not much. Let xF. Then x is in the 110 -interval Im1, in the 1100 -interval Im2, in the 11000 and so on. When our algorithm run we cannot avoid this intervals. We must pick a point from each of them. So we will have a subsequence {xnk}k=1 such that xnkImk. That is |xnk-x|110k, hence {xnk}k=1 converges to x.

We have seen many kind of closed sets. Simple ones, complicated ones, finite ones and infinite ones. There is a very simple way to construct closed sets from arbitrary sets. As we have seen above for any closed set F, there exists a sequence of elements of F such that the set of limitpoints of the sequence is exactly F. So, it we start with this sequence, we can reconstruct F. The following theorem is a variation of this theme.

Theorem 3.3.2

Let SR be an arbitrary set. Let CL(S) be the set of all points that can be attained as a limit of a convergent sequence {sn}n=1S. Then

  • The set CL(S) contains S.

  • The set CL(S) is closed.

  • Any closed set C that contains S will contain CL(S) as well. Hence CL(S) is the smallest closed set containing S and it is called the closure of S.

Proof:  Let sS. Then s,s,s,s,s,s,s, is a perfectly legitimate convergence sequence of elements of S and its limitpoint is s of course. So, SCL(S). Now, we prove that CL(S) is closed. Let {ln}n=1 be a sequence from CL(S) tending to l. We need to prove that lCL(S). Since, ln is in CL(S), there exists snS such that |sn-ln|<1n. By the Sum Rule, the sequence {sn}n=1 is convergent and its limit is l. Hence, l is element of CL(S). Finally, suppose that SC, where C is some closed set. We need to prove that if lCL(S) then lC. What does it mean that lCL(S)? It means, that there exists a convergent sequence {sn}n=1 of elements of S tending to l. This convergent sequence is in C, C is closed, hence l must be in C.

Definition 3.3.2

Let C be a closed set and SC. Suppose that CL(S)=C. Then we say that S is dense in C.

Theorem 3.3.3 (Dense subsets)
  1. 1.

    is dense in .

  2. 2.

    The set of irrational numbers is also dense in .

  3. 3.

    The numbers in the form a10n, where a is an integer is dense in .

  4. 4.

    Every closed set contains a countable dense set.

Proof:  As we have seen before, for all real number r, there is a sequence of rationals {qn}n=1 tending to r. Indeed, if r=x0.x1x2x3 then the sequence {yn=x0,x1x2xn}n=1 tends to r. This observation takes care of (1) AND (3) as well!!! If q is a rational number and r is an irrational number, then q+r is an irrational number. Hence if {qn}n=1 is a convergent sequence of rational numbers tending to r, then {qn+1n2}n=1 is a convergent sequence of irrational numbers tending to r. The statement (4) is just the reformulation of Theorem 3.3.1.