Misplaced Pages

Separating set

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Property for sets of functions This article is about separating sets for functions. For use in graph theory, see connectivity (graph theory).

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

Separating sets can be used to formulate a version of the Stone–Weierstrass theorem for real-valued functions on a compact Hausdorff space X , {\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.

Examples

See also

References

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

This mathematical logic-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: