# Singleton (mathematics)

__: Set with exactly one element__

**Short description**Part of a series on statistics |

Probability theory |
---|

In mathematics, a **singleton**, also known as a **unit set**,^{[1]} is a set with exactly one element. For example, the set [math]\displaystyle{ \{0\} }[/math] is a singleton whose single element is [math]\displaystyle{ 0 }[/math].

The term is also used for a 1-tuple (a sequence with one member).

## Properties

Within the framework of Zermelo–Fraenkel set theory, the axiom of regularity guarantees that no set is an element of itself. This implies that a singleton is necessarily distinct from the element it contains,^{[1]} thus 1 and {1} are not the same thing, and the empty set is distinct from the set containing only the empty set. A set such as [math]\displaystyle{ \{\{1, 2, 3\}\} }[/math] is a singleton as it contains a single element (which itself is a set, however, not a singleton).

A set is a singleton if and only if its cardinality is 1. In von Neumann's set-theoretic construction of the natural numbers, the number 1 is *defined* as the singleton [math]\displaystyle{ \{0\}. }[/math]

In axiomatic set theory, the existence of singletons is a consequence of the axiom of pairing: for any set *A*, the axiom applied to *A* and *A* asserts the existence of [math]\displaystyle{ \{A, A\}, }[/math] which is the same as the singleton [math]\displaystyle{ \{A\} }[/math] (since it contains *A*, and no other set, as an element).

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 single element of *S*. Thus every singleton is a terminal object in the category of sets.

A singleton has the property that every function from it to any arbitrary set is injective. The only non-singleton set with this property is the empty set.

Every singleton set is an ultra prefilter. If [math]\displaystyle{ X }[/math] is a set and [math]\displaystyle{ x \in X }[/math] then the upward of [math]\displaystyle{ \{x\} }[/math] in [math]\displaystyle{ X, }[/math] which is the set [math]\displaystyle{ \{S \subseteq X : x \in S\}, }[/math] is a principal ultrafilter on [math]\displaystyle{ X. }[/math]^{[2]} Moreover, every principal ultrafilter on [math]\displaystyle{ X }[/math] is necessarily of this form.^{[2]} The ultrafilter lemma implies that non-principal ultrafilters exist on every infinite set (these are called *free ultrafilters*).
Every net valued in a singleton subset [math]\displaystyle{ X }[/math] of is an ultranet in [math]\displaystyle{ X. }[/math]

The Bell number integer sequence counts the number of partitions of a set (OEIS: A000110), if singletons are excluded then the numbers are smaller (OEIS: A000296).

## In category theory

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 admits a unique topological space structure (both 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 admits a unique group structure (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.

## Definition by indicator functions

Let S be a class defined by an indicator function
[math]\displaystyle{ b : X \to \{0, 1\}. }[/math]
Then S is called a *singleton* if and only if there is some [math]\displaystyle{ y \in X }[/math] such that for all [math]\displaystyle{ x \in X, }[/math]
[math]\displaystyle{ b(x) = (x = y). }[/math]

## Definition in *Principia Mathematica*

The following definition was introduced by Whitehead and Russell^{[3]}

- [math]\displaystyle{ \iota }[/math]
**‘**[math]\displaystyle{ x = \hat{y}(y = x) }[/math]**Df.**

The symbol [math]\displaystyle{ \iota }[/math]**‘**[math]\displaystyle{ x }[/math] denotes the singleton [math]\displaystyle{ \{x\} }[/math] and [math]\displaystyle{ \hat{y}(y = x) }[/math] denotes the class of objects identical with [math]\displaystyle{ x }[/math] aka [math]\displaystyle{ \{y : y=x\} }[/math].
This occurs as a definition in the introduction, which, in places, simplifies the argument in the main text, where it occurs as proposition 51.01 (p.357 ibid.).
The proposition is subsequently used to define the cardinal number 1 as

- [math]\displaystyle{ 1=\hat{\alpha}((\exists x)\alpha=\iota }[/math]
**‘**[math]\displaystyle{ x) }[/math]**Df.**

That is, 1 is the class of singletons. This is definition 52.01 (p.363 ibid.)

## See also

- Class (set theory) – Collection of sets in mathematics that can be defined based on a property of its members
- Uniqueness quantification – Logical property of being the one and only object satisfying a condition

## References

- ↑
^{1.0}^{1.1}Stoll, Robert (1961).*Sets, Logic and Axiomatic Theories*. W. H. Freeman and Company. pp. 5–6. - ↑
^{2.0}^{2.1}Dolecki & Mynard 2016, pp. 27–54. - ↑ Whitehead, Alfred North; Bertrand Russell (1910).
*Principia Mathematica*.**I**. p. 37.

- Dolecki, Szymon; Mynard, Frederic (2016).
*Convergence Foundations Of Topology*. New Jersey: World Scientific Publishing Company. ISBN 978-981-4571-52-4. OCLC 945169917.

Original source: https://en.wikipedia.org/wiki/Singleton (mathematics).
Read more |