# Singleton (mathematics)

Last updated

In mathematics, a singleton, also known as a unit set, [1] is a set with exactly one element. For example, the set {null} is a singleton containing the element null.

## Contents

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 {{1, 2, 3}} 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 {0}.

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 {A, A}, which is the same as the singleton {A} (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.

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

## 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

${\displaystyle b:X\to \{0,1\}.}$

Then S is called a singleton if and only if there is some yX such that for all xX,

${\displaystyle b(x)=(x=y).}$

## Definition in Principia Mathematica

The following definition was introduced by Whitehead and Russell [2]

${\displaystyle \iota }$${\displaystyle x={\hat {y}}(y=x)}$Df.

The symbol ${\displaystyle \iota }$${\displaystyle x}$ denotes the singleton ${\displaystyle \{x\}}$ and ${\displaystyle {\hat {y}}(y=x)}$ denotes the class of objects identical with ${\displaystyle x}$ aka ${\displaystyle \{y:y=x\}}$. 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

${\displaystyle 1={\hat {\alpha }}((\exists x)\alpha =\iota }$${\displaystyle x)}$Df.

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

## Related Research Articles

In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that a Cartesian product of a collection of non-empty sets is non-empty. Informally put, the axiom of choice says that given any collection of bins, each containing at least one object, it is possible to make a selection of exactly one object from each bin, even if the collection is infinite. Formally, it states that for every indexed family of nonempty sets there exists an indexed family of elements such that for every . The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem.

Naive set theory is any of several theories of sets used in the discussion of the foundations of mathematics. Unlike axiomatic set theories, which are defined using formal logic, naive set theory is defined informally, in natural language. It describes the aspects of mathematical sets familiar in discrete mathematics, and suffices for the everyday use of set theory concepts in contemporary mathematics.

In mathematics, the empty set is the unique set having no elements; its size or cardinality is zero. Some axiomatic set theories ensure that the empty set exists by including an axiom of empty set, while in other theories, its existence can be deduced. Many possible properties of sets are vacuously true for the empty set.

In category theory, a branch of mathematics, a Grothendieck topology is a structure on a category C that makes the objects of C act like the open sets of a topological space. A category together with a choice of Grothendieck topology is called a site.

In topology and related branches of mathematics, a Hausdorff space, separated space or T2 space is a topological space where for any two distinct points there exist neighbourhoods of each which are disjoint from each other. Of the many separation axioms that can be imposed on a topological space, the "Hausdorff condition" (T2) is the most frequently used and discussed. It implies the uniqueness of limits of sequences, nets, and filters.

In mathematics, an ordered pair is a pair of objects. The order in which the objects appear in the pair is significant: the ordered pair is different from the ordered pair unless a = b.

In mathematics, especially order theory, a partially ordered set formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order." The word partial in the names "partial order" and "partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable.

This is a glossary of some terms used in the branch of mathematics known as topology. Although there is no absolute distinction between different areas of topology, the focus here is on general topology. The following definitions are also fundamental to algebraic topology, differential topology and geometric topology.

In the mathematical field of set theory, an ultrafilter on a given partially ordered set (poset) P is a certain subset of P, namely a maximal filter on P, that is, a proper filter on P that cannot be enlarged to a bigger proper filter on P.

In the mathematical field of topology, a uniform space is a set with a uniform structure. Uniform spaces are topological spaces with additional structure that is used to define uniform properties such as completeness, uniform continuity and uniform convergence. Uniform spaces generalize metric spaces and topological groups, but the concept is designed to formulate the weakest axioms needed for most proofs in analysis.

In category theory, a branch of mathematics, group objects are certain generalizations of groups that are built on more complicated structures than sets. A typical example of a group object is a topological group, a group whose underlying set is a topological space such that the group operations are continuous.

In combinatorics, an abstract simplicial complex (ASC) is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family. It is a purely combinatorial description of the geometric notion of a simplicial complex. For example, in a 2-dimensional simplicial complex, the sets in the family are the triangles, their edges, and their vertices.

In mathematics, particularly category theory, a representable functor is a certain functor from an arbitrary category into the category of sets. Such functors give representations of an abstract category in terms of known structures allowing one to utilize, as much as possible, knowledge about the category of sets in other settings.

In category theory, a natural numbers object (NNO) is an object endowed with a recursive structure similar to natural numbers. More precisely, in a category E with a terminal object 1, an NNO N is given by:

1. a global element z : 1 → N, and
2. an arrow s : NN,

In mathematical logic, New Foundations (NF) is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica. Quine first proposed NF in a 1937 article titled "New Foundations for Mathematical Logic"; hence the name. Much of this entry discusses NFU, an important variant of NF due to Jensen (1969) and exposited in Holmes (1998). In 1940 and in a revision of 1951, Quine introduced an extension of NF sometimes called "Mathematical Logic" or "ML", that included proper classes as well as sets.

In mathematics, a topological space is usually defined in terms of open sets. However, there are many equivalent characterizations of the category of topological spaces. Each of these definitions provides a new way of thinking about topological concepts, and many of these have led to further lines of inquiry and generalisation.

This article examines the implementation of mathematical concepts in set theory. The implementation of a number of basic mathematical concepts is carried out in parallel in ZFC and in NFU, the version of Quine's New Foundations shown to be consistent by R. B. Jensen in 1969.

Tarski–Grothendieck set theory is an axiomatic set theory. It is a non-conservative extension of Zermelo–Fraenkel set theory (ZFC) and is distinguished from other axiomatic set theories by the inclusion of Tarski's axiom, which states that for each set there is a Grothendieck universe it belongs to. Tarski's axiom implies the existence of inaccessible cardinals, providing a richer ontology than that of conventional set theories such as ZFC. For example, adding this axiom supports category theory.

In mathematics, a topos is a category that behaves like the category of sheaves of sets on a topological space. Topoi behave much like the category of sets and possess a notion of localization; they are a direct generalization of point-set topology. The Grothendieck topoi find applications in algebraic geometry; the more general elementary topoi are used in logic.

In set theory, an ordinal number, or ordinal, is one generalization of the concept of a natural number that is used to describe a way to arrange a collection of objects in order, one after another.

## References

1. Stoll, Robert (1961). Sets, Logic and Axiomatic Theories. W. H. Freeman and Company. pp. 5–6.
2. Whitehead, Alfred North; Bertrand Russell (1910). Principia Mathematica . Vol. I. p. 37.