Summary
In mathematics, a point x is called an isolated point of a subset S (in a topological space X) if x is an element of S and there exists a neighborhood of x that does not contain any other points of S. This is equivalent to saying that the singleton {x} is an open set in the topological space S (considered as a subspace of X). Another equivalent formulation is: an element x of S is an isolated point of S if and only if it is not a limit point of S. If the space X is a metric space, for example a Euclidean space, then an element x of S is an isolated point of S if there exists an open ball around x that contains only finitely many elements of S. A set that is made up only of isolated points is called a discrete set (see also discrete space). Any discrete subset S of Euclidean space must be countable, since the isolation of each of its points together with the fact that rationals are dense in the reals means that the points of S may be mapped injectively onto a set of points with rational coordinates, of which there are only countably many. However, not every countable set is discrete, of which the rational numbers under the usual Euclidean metric are the canonical example. A set with no isolated point is said to be dense-in-itself (every neighbourhood of a point contains other points of the set). A closed set with no isolated point is called a perfect set (it contains all its limit points and no isolated points). The number of isolated points is a topological invariant, i.e. if two topological spaces X, Y are homeomorphic, the number of isolated points in each is equal. Topological spaces in the following three examples are considered as subspaces of the real line with the standard topology. For the set the point 0 is an isolated point. For the set each of the points \tfrac 1 k is an isolated point, but 0 is not an isolated point because there are other points in S as close to 0 as desired. The set of natural numbers is a discrete set.
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related courses (3)
MATH-329: Continuous optimization
This course introduces students to continuous, nonlinear optimization. We study the theory of optimization with continuous variables (with full proofs), and we analyze and implement important algorith
MATH-301: Ordinary differential equations
Le cours donne une introduction à la théorie des EDO, y compris existence de solutions locales/globales, comportement asymptotique, étude de la stabilité de points stationnaires et applications, en pa
MATH-105(a): Advanced analysis II
Etudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles de plusieurs variables.
Related publications (51)