Separating set

This article is about separating sets for functions. For use in graph theory, see connectivity (graph theory).

In mathematics, a set ${\displaystyle S}$ of functions with domain ${\displaystyle D}$ is called a separating set for ${\displaystyle D}$ and is said to separate the points of ${\displaystyle D}$ (or just to separate points) if for any two distinct elements ${\displaystyle x}$ and ${\displaystyle y}$ of ${\displaystyle D,}$ there exists a function ${\displaystyle f\in S}$ such that ${\displaystyle f(x)\neq f(y).}$^[1]

Separating sets can be used to formulate a version of the Stone–Weierstrass theorem for real-valued functions on a compact Hausdorff space ${\displaystyle X,}$ with the topology of uniform convergence. It states that any subalgebra of this space of functions is dense if and only if it separates points. This is the version of the theorem originally proved by Marshall H. Stone.^[1]

Examples

• The singleton set consisting of the identity function on ${\displaystyle \mathbb {R} }$ separates the points of ${\displaystyle \mathbb {R} .}$
• If ${\displaystyle X}$ is a T1 normal topological space, then Urysohn's lemma states that the set ${\displaystyle C(X)}$ of continuous functions on ${\displaystyle X}$ with real (or complex) values separates points on ${\displaystyle X.}$
• If ${\displaystyle X}$ is a locally convex Hausdorff topological vector space over ${\displaystyle \mathbb {R} }$ or ${\displaystyle \mathbb {C} ,}$ then the Hahn–Banach separation theorem implies that continuous linear functionals on ${\displaystyle X}$ separate points.

See also

• Dual system