Separating set

In mathematics a set of functions S from a set D to a set C is called a separating set for D or said to separate the points of D if for any two distinct elements x and y of D, there exists a function f in S so that f(x) ≠ f(y).[1]

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

Separating sets can be used to formulate a version of the Stone-Weierstrass theorem for real-valued functions on a compact Hausdorff space 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 R separates the points of R.
  • If X is a T1 normal topological space, then Urysohn's lemma states that the set C(X) of continuous functions on X with real (or complex) values separates points on X.
  • If X is a locally convex Hausdorff topological vector space over R or C, then the Hahn–Banach separation theorem implies that continuous linear functionals on X separate points.
gollark: Besides, why would it have "sadness"?
gollark: That's incredibly hard, though?
gollark: ????????????
gollark: But my RNG also has no chess abilities.
gollark: The good chess players now have absolutely no skills in programming or AI research.

References
  1. Carothers, N. L. (2000), Real Analysis, Cambridge University Press, pp. 201–204, ISBN 9781139643160.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.