Jump to content

Accumulation points of sets – "Math for Non-Geeks"

From Wikibooks, open books for an open world

Motivation

[edit | edit source]

In the article accumulation point of a sequence we already mentioned that the accumulation point of a set is not to be confused with the accumulation point of a sequence. This article concerns the accumulation point of a set. Whenever we refer to an "accumulation point" within this article, we mean an "accumulation point of a set".

The name "accumulation point" of a set suggests that elements of a set M⊆ℝ "accumulate" there. Let us make this intuition mathematically precise.

What does it mean that elements of M "accumulate" around p∈ℝ? When we put a small interval around p, there should still be an element of the set inside it. If this was not the case, we could choose some ϵ>0 , such that each m∈M is outside the interval (p−ϵ,p+ϵ), i.e. |p−m|≥ϵ.

point
point

. So there are no points inside the interval, and the set elements intuitively do not "accumulate" around p.

So we could use the following (preliminary) definition: We have a kind of accumulation point p∈ℝ of M , whenever for each ϵ>0 there is an m∈M, such that |p−m|<ϵ. Does this kind of accumulation point match our intuition of an accumulation point?

Let us take the set only consisting of the number 1 as an example: M={1} . The above definition tells us that p=1 is a kind of accumulation point of M. This can easily be checked: Let ϵ>0. As p∈M , we can directly take m=p∈M as the element of M which is included inside the ϵ-interval. There is |p−p|=0<ϵ and p=1 is a kind of accumulation point of the set. But intuitively, the set elements do not "accumulate" around this single point, like a single person would also not be considered to be an "accumulation of people". We need a new definition with more points different from p (i.e. "more people").

We therefore introduce a new definition: we call p∈ℝ an accumulation point of M⊂ℝ, whenever for each ϵ>0 there is another point m∈M not equal to p , such that |p−m|<ϵ . With this definition, the kind of accumulation point p=1 is no longer a real accumulation point of M={1} . For instance, take ϵ=1/2 . The set M has no element m≠p=1, so in particular, there cannot be any element m≠p in M with |p−m|<1/2 . This argument would also work with any other ϵ>0. We will later see that each accumulation point has to have infinitely many points around it. So if there is just one point or a finite number of points, we can never have an accumulation point.

If the M above has no accumulation points, what does a set with an accumulation point look like, then? Let us take a set with infinitely many points, e.g. M={1}∪[2,3]. This set contains an interval with infinitely many points. Following the above arguments, the "extra single point" p=1 is not an accumulation point, since there are no points around it.

And how about the other points? Let p∈[2,3] and ϵ>0 be arbitrary. Choose δ=min⁡{ϵ/2,1/4}. At least one of p−δ and p+δ lies in [2,3], is distinct from p, and has distance δ<ϵ from p. So every point p∈[2,3] has another point of the interval in each ϵ-neighbourhood around it and must be an accumulation point.

An accumulation point of the set M
An accumulation point of the set M

Those are exactly all accumulation points, since all points outside of M cannot be approached by points in M (You may shortly think about this fact by choosing a suitably small ϵ>0 ). Similarly, any closed interval [a,b] with a<b has all of its points being accumulation points.

Later, the notion of an accumulation point will even become useful, if we mathematically define derivatives of a function f:M→ℝ at x∈M . This can be done if x is an accumulation point within the domain of definition, so it can be approached by other points, which are not x.

Accumulation point of a set

[edit | edit source]

Now, we formulate the thoughts above in a mathematical way.

Definition (accumulation point of a set)

A number p∈ℝ is called an accumulation point of a set M⊆ℝ, if for each ϵ>0 there is some m∈M with m≠p and |m−p|<ϵ.

Properties of accumulation points

[edit | edit source]

First, we note that accumulation points of sets and sequences are closely related:

Theorem (Accumulation points of a set are limits of sequences of set elements)

A point p∈ℝ is exactly an accumulation point of a set M, if there is a sequence (mn)n∈ℕ in M whose terms are distinct from p (i.e. mn≠p for all n∈ℕ) and limn→∞mn=p .

Proof (Accumulation points of a set are limits of sequences of set elements)

"exactly" means an equivalence "⇔", so we need to show both the directions "⇒" and "⇐".

"⇒": Let p∈ℝ be an accumulation point of the set M. For a fixed n∈ℕ we set ϵn:=1/n. Since p is an accumulation point, there must be an element m∈M with m≠p and |p−m|<ϵn=1/n. This element depends on ϵn and hence on n , so we can call it mn. Taking such an element for each n∈ℕ, we obtain a sequence (mn)n∈ℕ. This sequence converges to p (see also the definition of convergence). Let ϵ>0 be arbitrary. If we choose an N∈ℕ with N>1/ϵ , then for n≥N there is also 1/n≤1/N<ϵ. Hence, the distance of mn to the suspected limit p is |mn−p|<ϵn=1/n≤1/N<ϵ. As this holds for all n≥N, we have proven convergence of (mn)n∈ℕ to p.

Now, we prove the other direction.

"⇐": Let (mn)n∈ℕ be a sequence of elements in M converging to p∈ℝ, with mn≠p for all n∈ℕ. Let ϵ>0 be arbitrary. Convergence gives an index n0∈ℕ with |mn0−p|<ϵ. Thus, mn0∈M is distinct from p and lies within distance ϵ of p. This proves that p is an accumulation point.

The next theorem justifies the name "accumulation point" p by proving that points indeed "accumulate" around p. More precisely, there are infinitely many points accumulating around p.

Theorem (Set elements accumulate around accumulation points)

Let p∈ℝ be an accumulation point of the set M⊂ℝ. For each ϵ>0 there is a set N⊂M, such that for all m∈N there is |m−p|<ϵ, and N contains infinitely many (!) elements.

Proof (Set elements accumulate around accumulation points)

The proof goes by contradiction. We assume that the statement of the theorem is not true, meaning that there is an ϵ>0, such that each set N⊂M containing infinitely many elements contains some m∈N with |p−m|≥ϵ. Or equivalently, for some ϵ>0, the set Nϵ:={m∈M:|m−p|<ϵ,m≠p} (all elements in M, which are closer to p than ϵ) is finite. Why are both equivalent? If Nϵ had infinitely many elements, then there would have to be some m∈Nϵ with |p−m|≥ϵ (at least ϵ away), which is not allowed by the definition of Nϵ . Since p is an accumulation point, Nϵ is nonempty. Now we choose ϵ~:=min⁡{|p−m|:m∈Nϵ}, the closest distance from p to an element of Nϵ. Since the set Nϵ is finite and p∉Nϵ, this must be ϵ~>0 (so the minimal distance is strictly bigger than zero). Since ϵ~<ϵ and all points of M∖(Nϵ∪{p}) have distance at least ϵ from p, for all m∈M with m≠p there is |p−m|≥ϵ~, which contradicts p being an accumulation point of M. ↯

What if M has only finitely many elements? Then the set Nϵ of points in M lying within distance ϵ of p has only finitely many elements. So the condition for the second theorem is violated and we cannot have an accumulation point:

Theorem (Finite sets cannot have accumulation points)

A set M with finitely many elements has no accumulation points.

The proof is virtually given above: We assume that there was an accumulation point and show that the second theorem leads to a contradiction. For an exercise, you may think about the arguments needed and write them down in a mathematically understandable way.

Adherent points

[edit | edit source]

Sometimes, we have points p∈M, which are not accumulation points, but still included in M. So there is a sequence in M converging to p, e.g. the constant sequence (mn)n∈ℕ,mn=p. This is, for instance, the case for all elements of a finite set. We will introduce a different notation for these points and call them adherent points.

Definition (adherent point)

Let M⊂ℝ be a set. A number p∈ℝ is called an adherent point of M, if there is a sequence in M converging to p.

Naturally, all accumulation points are adherent points: Whenever there is a sequence (mn)n∈ℕ,mn∈M,mn≠p converging to p, then we automatically have a sequence in M converging to p.

Properties of adherent points

[edit | edit source]

Let us verify some properties of adherent points. We have already seen that each point of a set p∈M⊂ℝ is an adherent point, since the constant sequence mn=p converges to p. Let us put this into a theorem:

Theorem (Every point of a set is an adherent point)

Every point p of a set M⊂ℝ is an adherent point of M.

Proof (Every point of a set is an adherent point)

See above.

We have also argued above that each accumulation point is an adherent point: "accumulation point" means limit of a sequence of elements in M, which are not equal to p and "adherent point" means just limit of a sequence in M. Let us also put this into a theorem:

Theorem (Every accumulation point is an adherent point)

Every accumulation point p of a set M⊂ℝ is an adherent point of M.

Proof (Every accumulation point is an adherent point)

See above.

But is an adherent point also an accumulation point? Certainly not: for a set of finitely many elements, each point is an adherent point (as it is contained in the set), but no point is an accumulation point. Now, if we have an adherent point, how can we make sure that it is also an accumulation point? The answer is not too difficult: we just take p out of M and ask again, whether there is a sequence in M∖{p} converging to p.

Theorem (Condition that an adherent point is also an accumulation point)

Every point p of a set M⊂ℝ is an accumulation point of M, if and only if it is an adherent point of M∖{p}.

Proof (Condition that an adherent point is also an accumulation point)

If p is an adherent point of M∖{p} , then there is a sequence in M∖{p}, converging to p . Hence, p is an accumulation point of M . Conversely, let p be an accumulation point of M . Then, there is a sequence (mn)n∈ℕ in M with mn≠p for all n∈ℕ and limn→∞mn=p . Therefore, p is an adherent point of M∖{p}.

Examples

[edit | edit source]
Example (accumulation points and adherent points of intervals)

Let I=(a,b)⊂ℝ (a<b) be an open interval. The set of its accumulation points is the closed interval [a,b], which is also the set of its adherent points.

Example (accumulation points and adherent points of a union of sets)

The sets of adherent points and accumulation points of the set (1,2] are given by the closed interval [1,2]. The set {4} consisting of only a single point has only 4 as an adherent point and no accumulation point. If we take the union (1,2]∪{4} then the adherent points are given by the union of both adherent point sets [1,2]∪{4}. The same holds for accumulation points: they are given by the union of [1,2] with the empty set ∅, which is again [1,2].

Theorem (accumulation points of the rational numbers)

The set of accumulation points of the rational numbers ℚ is given by the real numbers ℝ.

Proof (accumulation points of the rational numbers)

Let p∈ℝ and ϵ>0 be given. The rational numbers ℚ are dense in ℝ , which means that there has to be an r∈ℚ with r≠p and |r−p|<ϵ. Therefore, p is an accumulation point of ℚ . So the set of accumulation points (and hence also adherent points) of ℚ is given by the real numbers ℝ.

Question: What are the adherent and accumulation points of the following sets in ℝ?
  1. (4,∞)
  2. ℕ
  3. {1/n:n∈ℕ}
  4. ℝ∖ℚ
  1. adherent points: [4,∞), accumulation points: [4,∞)
  2. adherent points: ℕ, accumulation points: ∅
  3. adherent points: {1n:n∈ℕ}∪{0}, accumulation points: {0}
  4. adherent points: ℝ, accumulation points: ℝ