Quelltext der Seite Serlo: EN: Accumulation points of sets

{{#invoke:Mathe für Nicht-Freaks/Seite|oben}}

== Motivation ==

in the article [[Mathe für Nicht-Freaks: Häufungspunkt einer Folge|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 <math>M\subseteq \R</math> "accumulate" there. Let us make this intuition mathematically precise.

What does it mean that elements of <math> M </math> "accumulate" around <math>p\in \R</math>? When we put a small interval around <math>p</math>, there should still be an element of the set inside it. I this was not the case, we could choose some <math>\epsilon>0</math> , such that each <math>m\in M</math> is outside the interval <math> (p-\epsilon, p+\epsilon) </math>, i.e. <math>|p-m|\geq \epsilon</math>. [[File:Zeichnung-5b.svg|center|500px|point]]. So there are no points inside the interval and the set elements intuitively do not "accumulate" around <math>p</math>.

So we could use the following (preliminary) definition: We have a ''kind of accumulation point'' <math>p\in \R</math> of <math>M</math> , whenever for each <math>\epsilon > 0 </math> there is an <math>m\in M</math>, such that <math> |p-m|< \epsilon </math>. 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: <math>M=\{1\}</math> . The above definition tells us that <math>p=1</math> is a ''kind of accumulation point'' of <math>M</math>. This can easily be checked: Let <math>\epsilon>0</math>. As <math>p\in M</math> , we can directly take <math>m =p \in M</math> as the element of <math>M</math> which is included inside the y<math> \epsilon </math>-interval. There is <math>|p-p|= 0 <\epsilon </math> and <math>p=1</math> is a ''kind of accumulation point'' of the set. But intuitively, the sequence 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 <math>p</math> (i.e. "more people").

We therefore introduce a new definition: we call <math>p\in \R</math> an ''accumulation point'' of <math>M\subset \R</math>, whenever for each <math>\epsilon >0 </math> there is another point <math>m\in M</math> ''not equal to'' <math>p</math> , such that <math>|p-m|< \epsilon</math> . With this definition, the ''kind of accumulation point'' <math>p=1</math> is no longer a real ''accumulation point'' of  <math>M=\{1\}</math> . For instance, take <math>\epsilon =  1/2 </math> . The set <math>M</math> has no element <math> m \neq p = 1</math>, so in particular, there cannot be any element <math> m \neq p </math> in <math>M</math> with <math>|p-m|< 1/2</math> . This argument would also work with any other  <math>\epsilon >0 </math>. 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 amount of points, we can never have an accumulation point.

If the <math> M </math> 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. <math> M= \{1 \} \cup [2,3] </math>. This set contains an interval with infinitely many points. Following the above arguments, the "extra single point" <math> p=1 </math> is not an accumulation point, since there are no points around it.
And how about the other points? Let us consider some <math> p \in [2,3] </math> with <math> \max(|2-p|,|3-p|)> \epsilon>0 </math> . If we choose <math> 1/2 > \epsilon > 0 </math> arbitrarily small, the point <math> p-\epsilon/2 </math> or <math> p+\epsilon/2 </math> will always be an element of <math> [2,3] </math> . These points also lie inside the interval, if we choose <math> \epsilon > 0 </math> arbitrarily big. So every point <math> p \in [2,3] </math> has another point of the interval in each <math> \epsilon </math>-neighbourhood around it and must be an accumulation point. [[File:Häufungspunkt schnitte.svg|center|600px|An accumulation point of the set M]] Those are exactly all accumulation points, since all points outside of <math> M </math> cannot be approached by points in <math> M </math> (You may shortly think about this fact by choosing a suitably small <math> \epsilon > 0 </math> ). Similarly, any closed interval <math> [a,b] </math> 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 <math> f\colon M \to \R </math> at <math> x \in M </math> . This can be done if <math> x </math> is an accumulation point within the domain of definition, so it can be approached by other points, which are not <math> x </math>.

== Accumulation point of a set ==

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

 {{:Mathe für Nicht-Freaks: Vorlage:Definition
 |titel=accumulation point of a set
 |definition=
A number <math>p\in \R</math> is called accumulation point of a set <math>M</math>, if for each <math>\epsilon >0 </math> there is some <math>m\in M</math> with <math>m\neq p</math> and <math>|m-p|<\epsilon</math>.
}}

== Properties of accumulation points  ==

First, we note that accumulation points of sets and sequences are closely related:
{{:Mathe für Nicht-Freaks: Vorlage:Satz
 |titel= 
Accumulation points of a set are limits of set elements sequences
 |satz=
A point <math>p\in \R</math> is exactly an accumulation point of a set <math>M</math>, if there is a sequence <math>(m_n)_{n\in\mathbb{N}}</math> in <math>M</math> which are distinct from <math> p </math> (i.e. <math> m_n \neq p </math> for all <math> n \in \mathbb{N} </math>) and <math>\lim_{n\to\infty} m_n = p</math> .
 |beweis = "exactly" means an equivalence "<math> \Leftrightarrow </math>", so we need to show both the directions "<math> \Rightarrow </math>" and "<math> \Leftarrow </math>".

"<math>\Rightarrow </math>": Let <math>p\in \R</math> be an accumulation point of the set <math>M</math>. For a fixed <math>n\in \mathbb{N}</math> we set <math>\epsilon_n := 1/n </math>. Since <math>p</math> is an accumulation point, there must be an element <math>m\in M</math> with <math> m \neq p </math> and <math>|p- m| < \epsilon_n = 1/n </math>. This element depends on <math>\epsilon_n</math> and hence on <math>n</math> , so we can call it <math>m_n</math>. Taking such an element for each <math>n\in \mathbb{N}</math>, we obtain a sequence <math>(m_n)_{n\in\mathbb{N}}</math>. This sequence converges to <math>p</math> (see also the [[Mathe_für_Nicht-Freaks:_Grenzwert:_Konvergenz_und_Divergenz#Definition_des_Grenzwerts|definition of convergence]]). Let <math>\epsilon>0</math> arbitrary. If we choose an <math>N\in\mathbb{N}</math> with <math>N>1/\epsilon</math> , then for <math>n\geq N</math> there is also <math> 1/n \leq 1/N< \epsilon</math>. Hence, the distance of <math> m_n </math> to the suspected limit <math> p </math> is <math>|m_n-p|<\epsilon_n = 1/n \leq  1/N < \epsilon</math>. As this holds for all <math>n\geq N</math>, we have proven convergence of <math>(m_n)_{n\in\mathbb{N}}</math> to <math>p</math>.

Now, we prove the other direction.

"<math>\Leftarrow</math>": Let <math>\epsilon >0</math> be fixed and <math>(m_n)_{n\in\mathbb N}</math> a sequence of elements in <math>M</math> converging to <math>p\in\R</math> and not including <math> p </math>( i.e. <math> m_n \neq p</math> for all <math> n\in\mathbb{N}</math>) Since <math>\lim_{n\to\infty} m_n =p</math> , we may choose some <math>n_0 \in\mathbb{N}</math> with <math>|m_n - p | <\epsilon</math>. This is exactly the <math>m_n \neq p</math> we need for the <math>\epsilon >0</math>. And since we can find such an <math>m_n</math> for each <math>\epsilon >0</math>, the limit <math> p </math> is an accumulation point.
}}

The next theorem justifies the name "accumulation point" <math> p </math> by proving that points indeed "accumulate" around <math> p </math>. More precisely, there are infinitely many points accumulating around <math> p </math> 
{{:Mathe für Nicht-Freaks: Vorlage:Satz
 |titel= Sequence elements accumulate around accumulation points
 |satz=
Let <math>p\in \R</math> be an accumulation point of the set <math>M\subset \R</math>. For each <math>\epsilon >0</math> there is a set <math>N\subset M</math>, such that for all <math>m\in N</math> there is <math>|m-p|<\epsilon </math>, and <math>N</math> contains infinitely many (!) elements.
 |beweis= The proof goes by contradiction. We assume that the statement of the proof is not true, meaning that there is an <math>\epsilon >0</math>, such that each set <math>N\subset M</math> containing infinitely elements contains some <math>m\in N</math> with <math>|p-m|\geq \epsilon</math>. Or equivalently, for some <math>\epsilon >0</math>, the set <math>N_\epsilon:= \{m\in M: |m-p|<\epsilon, m\neq p\}</math> (all elements in <math> M </math>, which are closer to <math> p </math> than <math> \epsilon </math>) is finite. Why are both equivalent? If <math> N_\epsilon </math> had infinitely many elements, then there would have to be some <math>m\in N_\epsilon</math> with <math>|p-m|\geq \epsilon</math> (further away than <math> \epsilon </math>), which is not allowed by the definition of <math> N_{\epsilon} </math> .
Now we choose <math>\tilde\epsilon:= \min\{|p-m|: m\in N_\epsilon\}</math> (the closest distance of any element in <math> M </math> to <math> p </math>). Since the set <math>N_\epsilon</math> is finite and <math> p\notin N_\epsilon,</math> this must be <math>\tilde\epsilon >0</math> (so the minimal distance is strictly bigger than zero). Hence, for all <math>m\in M</math> with <math>m\neq p</math> there is <math>|p-m|\geq \tilde \epsilon </math>, which contradicts <math>p</math> being an accumulation point of <math>M</math>. ↯
}}

What if <math> M </math> has only finitely many elements? Then each <math> \epsilon </math>-neighbourhood <math>\N_\epsilon</math> around <math> p </math> with elements in <math> M </math> has only finitely many elements. So the condition for the second theorem is violated and we cannot have an accumulation point:
{{:Mathe für Nicht-Freaks: Vorlage:Satz
 |titel= Finite sets cannot have accumulation points
 |satz= A set <math> M </math> 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 ==

Sometimes, we have points <math> p \in M </math>, which are no accumulation point, but still included in <math> M </math>. So there is a sequence in <math> M </math> converging to <math> p </math>, e.g. the constant sequence <math> (m_n)_{n \in \N}, m_n = p </math>. 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''. 

{{:Mathe für Nicht-Freaks: Vorlage:Definition
|titel= adherent point
|definition= Let <math>M\subset\R</math> be a set. A number <math>p\in\R</math> is called '''adherent point'' of <math> M</math>, if there is a sequence in <math> M</math> converging to <math>p</math>. 
}}

Naturally, all accumulation points are adherent points: Whenever there is a sequence <math> (m_n)_{n \in \N}, m_n \in M, m_n \neq p </math> converging to <math> p </math>, then we automatically have a sequence in <math> M </math> converging to <math> p </math>.

== Properties of adherent points ==
Let us verify some properties of adherent points. We have already seen that each point of a set <math>p \in M\subset \R</math> is an adherent point, since the constant sequence <math> m_n = p </math> converges to <math> p </math>. Let us put this into a theorem:
{{:Mathe für Nicht-Freaks: Vorlage:Satz
 |titel= Every point of a set is an adherent point
 |satz= Every point <math>p</math> of a set <math>M\subset \R</math> is an adherent point of <math>M</math>.
 |beweis= 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 <math> M </math>, which are not equal to <math> p </math> and "adherent point" mean just limit of a sequence in <math> M </math>. Let us also put this into a theorem:
{{:Mathe für Nicht-Freaks: Vorlage:Satz
 |titel= Every accumulation point is an adherent point
 |satz= Every accumulation point <math>p</math> of a set <math>M\subset \R</math> is an adherent point of <math>M</math>.
 |beweis= 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 to difficult: we just take <math> p </math> out of <math> M </math> and ask again, whether there is a sequence in <math> M \setminus \{p\} </math> converging to <math> p </math>.
{{:Mathe für Nicht-Freaks: Vorlage:Satz
 |titel= Condition that an adherent point is also an accumulation point
 |satz= Every point <math>p</math> of a set <math>M\subset \R</math> is an accumulation point of <math> M </math>, wif and only if it is an adherent point of <math>M \setminus \{ p\}</math>.
 |beweis= If <math> p </math> is an adherent point of <math> M \setminus \{ p \} </math> , then there is a sequence in <math> M \setminus \{p \} </math>, converging to <math> p </math> . Hence, <math> p </math> is an accumulation point of <math> M </math> . Conversely, let <math> p </math> be an accumulationn point of <math> M </math> . Then, there is a sequence <math>(m_n)_{n \in \mathbb{N}} </math> in <math> M </math> with <math> m_n \neq p</math> for all <math> n \in \mathbb{N} </math> and <math> \lim\nolimits_{n \to \infty} m_n = p </math> . Therefore, <math> p </math> is an adherent point of <math>M \setminus \{ p\}</math>.
}}

== Examples ==
{{:Mathe für Nicht-Freaks: Vorlage:Beispiel
 |titel=accumulation points and adherent points of intervals
 |beispiel= Let <math>I=(a,b)\subset \R</math> (<math>a<b</math>) be an open interval. The set of its accumulation points is the closed interval <math>[a,b]</math>, which is also the set of its adherent points.
}}

{{:Mathe für Nicht-Freaks: Vorlage:Beispiel
 |titel=accumulation points and adherent points of a union of sets
 |beispiel= The set of adherent points and accumulation points of the set <math> (1,2] </math> are given by the closed interval <math>[1,2]</math>. The set <math> \{4\} </math> consisting of only a single point has only <math> 4 </math> as adherent point and no accumulation point. If we take the union <math> (1,2] \cup \{ 4\} </math> then the adherent points are given by the union of both adherent point sets <math>[1,2] \cup \{4\}</math>. The same holds for accumulation points: they are given by the union of <math>[1,2]</math> with the empty set <math> \emptyset </math>, which is again <math>[1,2]</math>. 
}}
{{:Mathe für Nicht-Freaks: Vorlage:Satz
 |titel=accumulation points of the rational numbers
 |satz=The set of accumulation points of the rational numbers <math> \mathbb{Q} </math> is given by the real numbers <math>\R</math>.
 |beweis= Let <math>p\in \R</math> and <math>\epsilon >0</math> be given. The rational numbers <math>\mathbb Q</math> are dense in <math>\R</math> , which means that there has to be an <math>r \in \mathbb Q</math> with <math>r\neq p</math> and <math>|r-p|<\epsilon</math>. Therefore, <math>p</math> is an accumulation point of <math>\mathbb Q</math> . So the set of accumulation points (and hence also adherent points) of <math>\mathbb Q</math> is given by the real numbers <math>\R</math>. }}

{{:Mathe für Nicht-Freaks: Vorlage:Frage
 |einrückung=nein
 |frage=What are the adherent and accumulation points of the following sets in <math>\R</math>?

# <math>(4,\infty)</math>
# <math>\mathbb N</math>
# <math> \{ 1/n: n\in \mathbb N \}</math>
# <math>\R\setminus\mathbb Q</math>

 |antwort=

# adherent points: <math>[4,\infty)</math>, accumulation points: <math>[4,\infty)</math>
# adherent points: <math>\mathbb{N}</math>, accumulation points: <math>\emptyset</math>
# adherent points: <math>\{\tfrac{1}{n}: n\in\mathbb N \} \cup \{0\}</math>, accumulation points: <math>\{0\}</math>
# adherent points: <math>\R</math>, accumulation points: <math>\R</math>
}}

{{#invoke:Mathe für Nicht-Freaks/Seite|unten}}