#jsDisabledContent { display:none; } My Account |  Register |  Help

Clopen set

Article Id: WHEBN0000233398
Reproduction Date:

 Title: Clopen set Author: World Heritage Encyclopedia Language: English Subject: Collection: Publisher: World Heritage Encyclopedia Publication Date:

Clopen set

A graph with several clopen sets. Each of the three large pieces (i.e. components) is a clopen set, as is the union of any two or all three.

In topology, a clopen set (a portmanteau of closed-open set) in a topological space is a set which is both open and closed. That this is possible may seem counter-intuitive, as the common meanings of open and closed are antonyms. But their mathematical definitions are not mutually exclusive. A set is closed if its complement is open, which leaves the possibility of an open set whose complement is itself also open, making both sets both open and closed, and therefore clopen.

• Examples 1
• Properties 2
• Notes 3
• References 4

Examples

In any topological space X, the empty set and the whole space X are both clopen.[1][2]

Now consider the space X which consists of the union of the two open intervals (0,1) and (2,3) of R. The topology on X is inherited as the subspace topology from the ordinary topology on the real line R. In X, the set (0,1) is clopen, as is the set (2,3). This is a quite typical example: whenever a space is made up of a finite number of disjoint connected components in this way, the components will be clopen.

As a less trivial example, consider the space Q of all rational numbers with their ordinary topology, and the set A of all positive rational numbers whose square is bigger than 2. Using the fact that \sqrt 2 is not in Q, one can show quite easily that A is a clopen subset of Q. (Note also that A is not a clopen subset of the real line R; it is neither open nor closed in R.)

Properties

• A topological space X is connected if and only if the only clopen sets are the empty set and X.
• A set is clopen if and only if its boundary is empty.[3]
• Any clopen set is a union of (possibly infinitely many) connected components.
• If all connected components of X are open (for instance, if X has only finitely many components, or if X is locally connected), then a set is clopen in X if and only if it is a union of connected components.
• A topological space X is discrete if and only if all of its subsets are clopen.
• Using the union and intersection as operations, the clopen subsets of a given topological space X form a Boolean algebra. Every Boolean algebra can be obtained in this way from a suitable topological space: see Stone's representation theorem for Boolean algebras.

Notes

1. ^ (regarding the real numbers and the empty set in R)
2. ^ Hocking, John G.; Young, Gail S. (1961). Topology. NY: Dover Publications, Inc. p. 56. (regarding topological spaces)
3. ^ Mendelson, Bert (1990) [1975]. Introduction to Topology (Third ed.). Dover. p. 87. (Given as Exercise 7)

References

• Morris, Sidney A. "Topology Without Tears". Archived from the original on 19 April 2013.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.

Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.