Difference between revisions of "Cluster Points in 𝐑"
(4 intermediate revisions by one other user not shown) | |||
Line 16: | Line 16: | ||
Let <math>S</math> be a subset of a topological space <math>X.</math> | Let <math>S</math> be a subset of a topological space <math>X.</math> | ||
− | A point <math>x</math> in <math>X</math> is a '''limit point''' or '''cluster point''' or ''' | + | A point <math>x</math> in <math>X</math> is a '''limit point''' or '''cluster point''' or '''accumulation point of the set''' <math>S</math> if every neighbourhood of <math>x</math> contains at least one point of <math>S</math> different from <math>x</math> itself. |
It does not make a difference if we restrict the condition to open neighbourhoods only. It is often convenient to use the "open neighbourhood" form of the definition to show that a point is a limit point and to use the "general neighbourhood" form of the definition to derive facts from a known limit point. | It does not make a difference if we restrict the condition to open neighbourhoods only. It is often convenient to use the "open neighbourhood" form of the definition to show that a point is a limit point and to use the "general neighbourhood" form of the definition to derive facts from a known limit point. | ||
− | If <math>X</math> is a <math>T_1</math> space (such as a metric space), then <math>x \in X</math> is a limit point of <math>S</math> if and only if every neighbourhood of <math>x</math> contains infinitely many points of <math>S.</math> | + | If <math>X</math> is a <math>T_1</math> space (such as a metric space), then <math>x \in X</math> is a limit point of <math>S</math> if and only if every neighbourhood of <math>x</math> contains infinitely many points of <math>S.</math> In fact, <math>T_1</math> spaces are characterized by this property. |
If <math>X</math> is a Fréchet–Urysohn space (which all metric spaces and first-countable spaces are), then <math>x \in X</math> is a limit point of <math>S</math> if and only if there is a sequence of points in <math>S \setminus \{ x \}</math> whose limit is <math>x.</math> In fact, Fréchet–Urysohn spaces are characterized by this property. | If <math>X</math> is a Fréchet–Urysohn space (which all metric spaces and first-countable spaces are), then <math>x \in X</math> is a limit point of <math>S</math> if and only if there is a sequence of points in <math>S \setminus \{ x \}</math> whose limit is <math>x.</math> In fact, Fréchet–Urysohn spaces are characterized by this property. | ||
Line 44: | Line 44: | ||
Note that there is already the notion of limit of a sequence to mean a point <math>x</math> to which the sequence converges (that is, every neighborhood of <math>x</math> contains all but finitely many elements of the sequence). That is why we do not use the term limit point of a sequence as a synonym for accumulation point of the sequence. | Note that there is already the notion of limit of a sequence to mean a point <math>x</math> to which the sequence converges (that is, every neighborhood of <math>x</math> contains all but finitely many elements of the sequence). That is why we do not use the term limit point of a sequence as a synonym for accumulation point of the sequence. | ||
− | The concept of a net generalizes the idea of a sequence. A net is a function <math>f : (P,\leq) \to X,</math> where <math>(P,\leq)</math> is a directed set and <math>X</math> is a topological space. A point <math>x \in X</math> is said to be a '''cluster point''' or ''' | + | The concept of a net generalizes the idea of a sequence. A net is a function <math>f : (P,\leq) \to X,</math> where <math>(P,\leq)</math> is a directed set and <math>X</math> is a topological space. A point <math>x \in X</math> is said to be a '''cluster point''' or '''accumulation point of a net''' <math>f</math> if, for every neighbourhood <math>V</math> of <math>x</math> and every <math>p_0 \in P,</math> there is some <math>p \geq p_0</math> such that <math>f(p) \in V,</math> equivalently, if <math>f</math> has a subnet which converges to <math>x.</math> Cluster points in nets encompass the idea of both condensation points and ω-accumulation points. Clustering and limit points are also defined for filters. |
== Relation between accumulation point of a sequence and accumulation point of a set == | == Relation between accumulation point of a sequence and accumulation point of a set == | ||
Line 58: | Line 58: | ||
* Any <math>\omega</math>-accumulation point of <math>A</math> is an accumulation point of any of the corresponding sequences (because any neighborhood of the point will contain infinitely many elements of <math>A</math> and hence also infinitely many terms in any associated sequence). | * Any <math>\omega</math>-accumulation point of <math>A</math> is an accumulation point of any of the corresponding sequences (because any neighborhood of the point will contain infinitely many elements of <math>A</math> and hence also infinitely many terms in any associated sequence). | ||
− | * A point <math>x \in X</math> that is | + | * A point <math>x \in X</math> that is not an <math>\omega</math>-accumulation point of <math>A</math> cannot be an accumulation point of any of the associated sequences without infinite repeats (because <math>x</math> has a neighborhood that contains only finitely many (possibly even none) points of <math>A</math> and that neighborhood can only contain finitely many terms of such sequences). |
== Properties == | == Properties == | ||
Line 69: | Line 69: | ||
A point <math>x \in X</math> is a limit point of <math>S \subseteq X</math> if and only if it is in the closure of <math>S \setminus \{ x \}.</math> | A point <math>x \in X</math> is a limit point of <math>S \subseteq X</math> if and only if it is in the closure of <math>S \setminus \{ x \}.</math> | ||
− | |||
− | |||
− | |||
− | If we use <math>L(S)</math> to denote the set of limit points of <math>S,</math> then we have the following characterization of the closure of <math>S</math>: The closure of <math>S</math> is equal to the union of <math>S</math> and <math>L(S).</math> This fact is sometimes taken as the | + | Proof: |
− | + | : We use the fact that a point is in the closure of a set if and only if every neighborhood of the point meets the set. Now, <math>x</math> is a limit point of <math>S,</math> if and only if every neighborhood of <math>x</math> contains a point of <math>S</math> other than <math>x,</math> if and only if every neighborhood of <math>x</math> contains a point of <math>S \setminus \{x\},</math> if and only if <math>x</math> is in the closure of <math>S \setminus \{x\}.</math> | |
− | ("Left subset") Suppose <math>x</math> is in the closure of <math>S.</math> If <math>x</math> is in <math>S,</math> we are done. If <math>x</math> is not in <math>S,</math> then every neighbourhood of <math>x</math> contains a point of <math>S,</math> and this point cannot be <math>x.</math> In other words, <math>x</math> is a limit point of <math>S</math> and <math>x</math> is in <math>L(S).</math> | + | |
− | ("Right subset") If <math>x</math> is in <math>S,</math> then every neighbourhood of <math>x</math> clearly meets <math>S,</math> so <math>x</math> is in the closure of <math>S.</math> If <math>x</math> is in <math>L(S),</math> then every neighbourhood of <math>x</math> contains a point of <math>S</math> (other than <math>x</math>), so <math>x</math> is again in the closure of <math>S.</math> This completes the proof. | + | If we use <math>L(S)</math> to denote the set of limit points of <math>S,</math> then we have the following characterization of the closure of <math>S</math>: The closure of <math>S</math> is equal to the union of <math>S</math> and <math>L(S).</math> This fact is sometimes taken as the definition of closure. |
− | + | ||
+ | Proof: | ||
+ | : ("Left subset") Suppose <math>x</math> is in the closure of <math>S.</math> If <math>x</math> is in <math>S,</math> we are done. If <math>x</math> is not in <math>S,</math> then every neighbourhood of <math>x</math> contains a point of <math>S,</math> and this point cannot be <math>x.</math> In other words, <math>x</math> is a limit point of <math>S</math> and <math>x</math> is in <math>L(S).</math> | ||
+ | : ("Right subset") If <math>x</math> is in <math>S,</math> then every neighbourhood of <math>x</math> clearly meets <math>S,</math> so <math>x</math> is in the closure of <math>S.</math> If <math>x</math> is in <math>L(S),</math> then every neighbourhood of <math>x</math> contains a point of <math>S</math> (other than <math>x</math>), so <math>x</math> is again in the closure of <math>S.</math> This completes the proof. | ||
A corollary of this result gives us a characterisation of closed sets: A set <math>S</math> is closed if and only if it contains all of its limit points. | A corollary of this result gives us a characterisation of closed sets: A set <math>S</math> is closed if and only if it contains all of its limit points. | ||
− | |||
− | |||
− | ''Proof'' 2: Let <math>S</math> be a closed set and <math>x</math> a limit point of <math>S.</math> If <math>x</math> is not in <math>S,</math> then the complement to <math>S</math> comprises an open neighbourhood of <math>x.</math> Since <math>x</math> is a limit point of <math>S,</math> any open neighbourhood of <math>x</math> should have a non-trivial intersection with <math>S.</math> However, a set can not have a non-trivial intersection with its complement. Conversely, assume <math>S</math> contains all its limit points. We shall show that the complement of <math>S</math> is an open set. Let <math>x</math> be a point in the complement of <math>S.</math> By assumption, <math>x</math> is not a limit point, and hence there exists an open neighbourhood <math>U</math> of <math>x</math> that does not intersect <math>S,</math> and so <math>U</math> lies entirely in the complement of <math>S.</math> Since this argument holds for arbitrary <math>x</math> in the complement of <math>S,</math> the complement of <math>S</math> can be expressed as a union of open neighbourhoods of the points in the complement of <math>S.</math> Hence the complement of <math>S</math> is open. | + | Proofs: |
− | { | + | :''Proof'' 1: <math>S</math> is closed if and only if <math>S</math> is equal to its closure if and only if <math>S=S\cup L(S)</math> if and only if <math>L(S)</math> is contained in <math>S.</math> |
+ | |||
+ | :''Proof'' 2: Let <math>S</math> be a closed set and <math>x</math> a limit point of <math>S.</math> If <math>x</math> is not in <math>S,</math> then the complement to <math>S</math> comprises an open neighbourhood of <math>x.</math> Since <math>x</math> is a limit point of <math>S,</math> any open neighbourhood of <math>x</math> should have a non-trivial intersection with <math>S.</math> However, a set can not have a non-trivial intersection with its complement. Conversely, assume <math>S</math> contains all its limit points. We shall show that the complement of <math>S</math> is an open set. Let <math>x</math> be a point in the complement of <math>S.</math> By assumption, <math>x</math> is not a limit point, and hence there exists an open neighbourhood <math>U</math> of <math>x</math> that does not intersect <math>S,</math> and so <math>U</math> lies entirely in the complement of <math>S.</math> Since this argument holds for arbitrary <math>x</math> in the complement of <math>S,</math> the complement of <math>S</math> can be expressed as a union of open neighbourhoods of the points in the complement of <math>S.</math> Hence the complement of <math>S</math> is open. | ||
+ | |||
+ | :No isolated point is a limit point of any set. | ||
+ | |||
+ | Proof: | ||
+ | :If <math>x</math> is an isolated point, then <math>\{x\}</math> is a neighbourhood of <math>x</math> that contains no points other than <math>x.</math> | ||
+ | |||
+ | :A space <math>X</math> is discrete if and only if no subset of <math>X</math> has a limit point. | ||
− | + | Proof: | |
− | + | :If <math>X</math> is discrete, then every point is isolated and cannot be a limit point of any set. Conversely, if <math>X</math> is not discrete, then there is a singleton <math>\{ x \}</math> that is not open. Hence, every open neighbourhood of <math>\{ x \}</math> contains a point <math>y \neq x,</math> and so <math>x</math> is a limit point of <math>X.</math> | |
− | |||
− | |||
− | + | :If a space <math>X</math> has the trivial topology and <math>S</math> is a subset of <math>X</math> with more than one element, then all elements of <math>X</math> are limit points of <math>S.</math> If <math>S</math> is a singleton, then every point of <math>X \setminus S</math> is a limit point of <math>S.</math> | |
− | |||
− | |||
− | |||
− | + | Proof: | |
− | + | :As long as <math>S \setminus \{ x \}</math> is nonempty, its closure will be <math>X.</math> It is only empty when <math>S</math> is empty or <math>x</math> is the unique element of <math>S.</math> | |
− | As long as <math>S \setminus \{ x \}</math> is nonempty, its closure will be <math>X.</math> It is only empty when <math>S</math> is empty or <math>x</math> is the unique element of <math>S.</math> | ||
− | |||
− | == | + | == Licensing == |
− | * [https://en.wikipedia.org/wiki/Limit_point Limit point | + | Content obtained and/or adapted from: |
+ | * [https://en.wikipedia.org/wiki/Limit_point Limit point, Wikipedia] under a CC BY-SA license |
Latest revision as of 14:41, 6 November 2021
In mathematics, a limit point (or cluster point or accumulation point) of a set in a topological space is a point that can be "approximated" by points of in the sense that every neighbourhood of with respect to the topology on also contains a point of other than itself. A limit point of a set does not itself have to be an element of There is also a closely related concept for sequences. A cluster point or accumulation point of a sequence in a topological space is a point such that, for every neighbourhood of there are infinitely many natural numbers such that This definition of a cluster or accumulation point of a sequence generalizes the nets and filters. In contrast to sets, for a sequence, net, or filter, the term "limit point" is not synonymous with a "cluster/accumulation point"; by definition, the similarly named notion of a limit point of a filter (respectively, a limit point of a sequence, a limit point of a net) refers to a point that the filter converges to (respectively, the sequence converges to, the net converges to).
The limit points of a set should not be confused with adherent points for which every neighbourhood of contains a point of . Unlike for limit points, this point of may be itself. A limit point can be characterized as an adherent point that is not an isolated point.
Limit points of a set should also not be confused with boundary points. For example, is a boundary point (but not a limit point) of set in with standard topology. However, is a limit point (though not a boundary point) of interval in with standard topology (for a less trivial example of a limit point, see the first caption).
This concept profitably generalizes the notion of a limit and is the underpinning of concepts such as closed set and topological closure. Indeed, a set is closed if and only if it contains all of its limit points, and the topological closure operation can be thought of as an operation that enriches a set by uniting it with its limit points.
Contents
Definition
Accumulation points of a set
Let be a subset of a topological space A point in is a limit point or cluster point or accumulation point of the set if every neighbourhood of contains at least one point of different from itself.
It does not make a difference if we restrict the condition to open neighbourhoods only. It is often convenient to use the "open neighbourhood" form of the definition to show that a point is a limit point and to use the "general neighbourhood" form of the definition to derive facts from a known limit point.
If is a space (such as a metric space), then is a limit point of if and only if every neighbourhood of contains infinitely many points of In fact, spaces are characterized by this property.
If is a Fréchet–Urysohn space (which all metric spaces and first-countable spaces are), then is a limit point of if and only if there is a sequence of points in whose limit is In fact, Fréchet–Urysohn spaces are characterized by this property.
The set of limit points of is called the derived set of
Types of accumulation points
If every neighbourhood of contains infinitely many points of then is a specific type of limit point called an ω-accumulation point of
If every neighbourhood of contains uncountably many points of then is a specific type of limit point called a condensation point of
If every neighbourhood of satisfies then is a specific type of limit point called complete accumulation point of
Accumulation points of sequences and nets
In a topological space a point is said to be a cluster point or accumulation point of a sequence if, for every neighbourhood of there are infinitely many such that It is equivalent to say that for every neighbourhood of and every there is some such that If is a metric space or a first-countable space (or, more generally, a Fréchet–Urysohn space), then is cluster point of if and only if is a limit of some subsequence of The set of all cluster points of a sequence is sometimes called the limit set.
Note that there is already the notion of limit of a sequence to mean a point to which the sequence converges (that is, every neighborhood of contains all but finitely many elements of the sequence). That is why we do not use the term limit point of a sequence as a synonym for accumulation point of the sequence.
The concept of a net generalizes the idea of a sequence. A net is a function where is a directed set and is a topological space. A point is said to be a cluster point or accumulation point of a net if, for every neighbourhood of and every there is some such that equivalently, if has a subnet which converges to Cluster points in nets encompass the idea of both condensation points and ω-accumulation points. Clustering and limit points are also defined for filters.
Relation between accumulation point of a sequence and accumulation point of a set
Every sequence in is by definition just a map so that its image can be defined in the usual way.
- If there exists an element that occurs infinitely many times in the sequence, is an accumulation point of the sequence. But need not be an accumulation point of the corresponding set For example, if the sequence is the constant sequence with value we have and is an isolated point of and not an accumulation point of
- If no element occurs infinitely many times in the sequence, for example if all the elements are distinct, any accumulation point of the sequence is an -accumulation point of the associated set
Conversely, given a countable infinite set in we can enumerate all the elements of in many ways, even with repeats, and thus associate with it many sequences that will satisfy
- Any -accumulation point of is an accumulation point of any of the corresponding sequences (because any neighborhood of the point will contain infinitely many elements of and hence also infinitely many terms in any associated sequence).
- A point that is not an -accumulation point of cannot be an accumulation point of any of the associated sequences without infinite repeats (because has a neighborhood that contains only finitely many (possibly even none) points of and that neighborhood can only contain finitely many terms of such sequences).
Properties
Every limit of a non-constant sequence is an accumulation point of the sequence. And by definition, every limit point is an adherent point.
The closure of a set is a disjoint union of its limit points and isolated points :
A point is a limit point of if and only if it is in the closure of
Proof:
- We use the fact that a point is in the closure of a set if and only if every neighborhood of the point meets the set. Now, is a limit point of if and only if every neighborhood of contains a point of other than if and only if every neighborhood of contains a point of if and only if is in the closure of
If we use to denote the set of limit points of then we have the following characterization of the closure of : The closure of is equal to the union of and This fact is sometimes taken as the definition of closure.
Proof:
- ("Left subset") Suppose is in the closure of If is in we are done. If is not in then every neighbourhood of contains a point of and this point cannot be In other words, is a limit point of and is in
- ("Right subset") If is in then every neighbourhood of clearly meets so is in the closure of If is in then every neighbourhood of contains a point of (other than ), so is again in the closure of This completes the proof.
A corollary of this result gives us a characterisation of closed sets: A set is closed if and only if it contains all of its limit points.
Proofs:
- Proof 1: is closed if and only if is equal to its closure if and only if if and only if is contained in
- Proof 2: Let be a closed set and a limit point of If is not in then the complement to comprises an open neighbourhood of Since is a limit point of any open neighbourhood of should have a non-trivial intersection with However, a set can not have a non-trivial intersection with its complement. Conversely, assume contains all its limit points. We shall show that the complement of is an open set. Let be a point in the complement of By assumption, is not a limit point, and hence there exists an open neighbourhood of that does not intersect and so lies entirely in the complement of Since this argument holds for arbitrary in the complement of the complement of can be expressed as a union of open neighbourhoods of the points in the complement of Hence the complement of is open.
- No isolated point is a limit point of any set.
Proof:
- If is an isolated point, then is a neighbourhood of that contains no points other than
- A space is discrete if and only if no subset of has a limit point.
Proof:
- If is discrete, then every point is isolated and cannot be a limit point of any set. Conversely, if is not discrete, then there is a singleton that is not open. Hence, every open neighbourhood of contains a point and so is a limit point of
- If a space has the trivial topology and is a subset of with more than one element, then all elements of are limit points of If is a singleton, then every point of is a limit point of
Proof:
- As long as is nonempty, its closure will be It is only empty when is empty or is the unique element of
Licensing
Content obtained and/or adapted from:
- Limit point, Wikipedia under a CC BY-SA license