Singleton (mathematics)

From Wikipedia, the free encyclopedia

Jump to: navigation, search

In mathematics, a singleton is a set with exactly one element. For example, the set {0} is a singleton.

Contents

Note that a set such as {{1, 2, 3}} is also a singleton: the only element is a set (which itself is however not a singleton).

A set is a singleton if and only if its cardinality is 1. In the set-theoretic construction of the natural numbers, the number 1 is defined as the singleton {0}.

In axiomatic set theory, the existence of singletons is a consequence of the axiom of empty set and the axiom of pairing: the former yields the empty set {}, and the latter, applied to the pairing of {} and {}, yields the singleton {{}}.

If A is any set and S is any singleton, then there exists precisely one function from A to S, the function sending every element of A to the one element of S.

In topology, a space is a T1 space if and only if every singleton is closed.

Structures built on singletons often serve as terminal objects or zero objects of various categories:

  • The statement above shows that the singleton sets are precisely the terminal objects in the category Set of sets. No other sets are terminal.
  • Any singleton can be turned into a topological space in just one way (all subsets are open). These singleton topological spaces are terminal objects in the category of topological spaces and continuous functions. No other spaces are terminal in that category.
  • Any singleton can be turned into a group in just one way (the unique element serving as identity element). These singleton groups are zero objects in the category of groups and group homomorphisms. No other groups are terminal in that category.

Let S be a class defined by a Boolean-valued function b: X \to \{0, 1\}. Then S is called a singleton if and only if b is equal to some function c: X \to \{0, 1\}, with c(x) = (x = y) for some y \in X.

Traditionally, this definition was introduced by Whitehead and Russell [1] along with the definition of the natural number 1, as 1 \ \overset{\underset{\mathrm{def}}{}}{=} \ \hat{\alpha}\{(\exists x) . \alpha = \iota \jmath x\}, where \iota \jmath x \ \overset{\underset{\mathrm{def}}{}}{=} \ \hat{y}(y = x).

  1. ^ Whitehead, Alfred North; Bertrand Russell (1861). Principia Mathematica, 37. 
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.