# Power set

In mathematics, the power set (or powerset) of a set S is the set of all subsets of S, including the empty set and S itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is postulated by the axiom of power set. The powerset of S is variously denoted as P(S), 𝒫(S), P(S), $\mathbb {P} (S)$, or 2$^S$. Any subset of P(S) is called a family of sets over S.

## Example

If S is the set {x, y, z}, then all the subsets of S are
* (also denoted $\varnothing$ or $\emptyset$, the empty set or the null set)
* {x}
* {y}
* {z}
* {x, y}
* {x, z}
* {y, z}
* {x, y, z}
and hence the power set of S is {, {x}, {y}, {z}, {x, y}, {x, z}, {y, z}, {x, y, z}}.

## Properties

If S is a finite set with the cardinality |S| = n (i.e., the number of all elements in the set S is n), then the number of all the subsets of S is |P(S)| = 2$^n$. This fact as well as the reason of the notation 2$^S$ denoting the power set P(S) are demonstrated in the below.
    An indicator function or a characteristic function of a subset A of a set S with the cardinality |S| = n is a function from S to the two-element set {0, 1}, denoted as I$_A$ : S → {0, 1}, and it indicates whether an element of S belongs to A or not; If x in S belongs to A, then I$_A$(x) = 1, and 0 otherwise. Each subset A of S is identified by or equivalent to the indicator function I$_A$, and {0,1}$^S$ as the set of all the functions from S to {0, 1} consists of all the indicator functions of all the subsets of S. In other words, {0, 1}$^S$ is equivalent or bijective to the power set P(S). Since each element in S corresponds to either 0 or 1 under any function in {0, 1}$^S$, the number of all the functions in {0, 1}$^S$ is 2$^n$. Since the number 2 can be defined as {0, 1} (see, for example, von Neumann ordinals), the P(S) is also denoted as 2$^S$. Obviously |2$^S$| = 2$^{|S|}$ holds. Generally speaking, X$^Y$ is the set of all functions from Y to X and |X$^Y$| = |X|$^{|Y|}$.
Cantor's diagonal argument shows that the power set of a set (whether infinite or not) always has strictly higher cardinality than the set itself (or informally, the power set must be larger than the original set). In particular, Cantor's theorem shows that the power set of a countably infinite set is uncountably infinite. The power set of the set of natural numbers can be put in a one-to-one correspondence with the set of real numbers (see Cardinality of the continuum).
The power set of a set S, together with the operations of union, intersection and complement, is a Σ-algebra over S and can be viewed as the prototypical example of a Boolean algebra. In fact, one can show that any finite Boolean algebra is isomorphic to the Boolean algebra of the power set of a finite set. For infinite Boolean algebras, this is no longer true, but every infinite Boolean algebra can be represented as a subalgebra of a power set Boolean algebra (see Stone's representation theorem).
The power set of a set S forms an abelian group when it is considered with the operation of symmetric difference (with the empty set as the identity element and each set being its own inverse), and a commutative monoid when considered with the operation of intersection (with the entire set S as the identity element). It can hence be shown, by proving the distributive laws, that the power set considered together with both of these operations forms a Boolean ring.

## Representing subsets as functions

In set theory, X$^Y$ is the notation representing the set of all functions from Y to X. As "2" can be defined as {0, 1} (see, for example, von Neumann ordinals), 2$^S$ (i.e., {0, 1}$^S$) is the set of all functions from S to {0, 1}. As shown above, 2$^S$ and the power set of S, P(S), are considered identical set-theoretically.
This equivalence can be applied to the example above, in which S = {x, y, z}, to get the isomorphism with the binary representations of numbers from 0 to 2$^n$ − 1, with n being the number of elements in the set S or |S| = n. First, the enumerated set { (x, 1), (y, 2), (z, 3) } is defined in which the number in each ordered pair represents the position of the paired element of S in a sequence of binary digits such as {x, y} = 011$_{(2)}$; x of S is located at the first from the right of this sequence and y is at the second from the right, and 1 in the sequence means the element of S corresponding to the position of it in the sequence exists in the subset of S for the sequence while 0 means it does not.
For the whole power set of S, we get:
| Subset | Sequence of binary digits | Binary interpretation | Decimal equivalent |
| { } | 0, 0, 0 | 000$_{(2)}$ | 0$_{(10)}$ |
| { x } | 0, 0, 1 | 001$_{(2)}$ | 1$_{(10)}$ |
| { y } | 0, 1, 0 | 010$_{(2)}$ | 2$_{(10)}$ |
| { x, y } | 0, 1, 1 | 011$_{(2)}$ | 3$_{(10)}$ |
| { z } | 1, 0, 0 | 100$_{(2)}$ | 4$_{(10)}$ |
| { x, z } | 1, 0, 1 | 101$_{(2)}$ | 5$_{(10)}$ |
| { y, z } | 1, 1, 0 | 110$_{(2)}$ | 6$_{(10)}$ |
| { x, y, z } | 1, 1, 1 | 111$_{(2)}$ | 7$_{(10)}$ |
Such an injective mapping from P(S) to integers is arbitrary, so this representation of all the subsets of S is not unique, but the sort order of the enumerated set does not change its cardinality. (E.g., { (y, 1), (z, 2), (x, 3) } can be used to construct another injective mapping from P(S) to the integers without changing the number of one-to-one correspondences.)
However, such finite binary representation is only possible if S can be enumerated. (In this example, x, y, and z are enumerated with 1, 2, and 3 respectively as the position of binary digit sequences.) The enumeration is possible even if S has an infinite cardinality (i.e., the number of elements in S is infinite), such as the set of integers or rationals, but not possible for example if S is the set of real numbers, in which case we cannot enumerate all irrational numbers.

## Relation to binomial theorem

The binomial theorem is closely related to the power set. A k–elements combination from some set is another name for a k–elements subset, so the number of combinations, denoted as C(n, k) (also called binomial coefficient) is a number of subsets with k elements in a set with n elements; in other words it's the number of sets with k elements which are elements of the power set of a set with n elements.
For example, the power set of a set with three elements, has:
* C(3, 0) = 1 subset with 0 elements (the empty subset),
* C(3, 1) = 3 subsets with 1 element (the singleton subsets),
* C(3, 2) = 3 subsets with 2 elements (the complements of the singleton subsets),
* C(3, 3) = 1 subset with 3 elements (the original set itself).
Using this relationship, we can compute |2$^S$| using the formula: $\left|2^{S}\right|=\sum _{k=0}^{|S|}{\binom {|S|}{k}}$
Therefore, one can deduce the following identity, assuming |S| = n: $\left|2^{S}\right|=2^{n}=\sum _{k=0}^{n}{\binom {n}{k}}$

## Recursive definition

If S is a finite set, then a recursive definition of P(S) proceeds as follows:
* If S =, then P(S) = { }.
* Otherwise, let e ∈ S and T = S ∖ {e}; then P(S) = P(T) ∪ {t ∪ {e} : t ∈ P(T)}.
In words:
* The power set of the empty set is a singleton whose only element is the empty set.
* For a non-empty set S, let $e$ be any element of the set and T its relative complement; then the power set of S is a union of a power set of T and a power set of T whose each element is expanded with the e element.

## Subsets of limited cardinality

The set of subsets of S of cardinality less than or equal to κ is sometimes denoted by P$_κ$(S) or [S]$^κ$, and the set of subsets with cardinality strictly less than κ is sometimes denoted P$_{<κ}$(S) or [S]$^{<κ}$. Similarly, the set of non-empty subsets of S might be denoted by P$_{≥1}$(S) or P$^+$(S).

## Power object

A set can be regarded as an algebra having no nontrivial operations or defining equations. From this perspective, the concept of the power set of X as the set of all subsets of X generalizes naturally to the set to all subalgebras of an algebraic structure or algebra.
The power set of a set, when ordered by inclusion, is always a complete atomic Boolean algebra, and every complete atomic Boolean algebra arises as the lattice of all subsets of some set. The generalization to arbitrary algebras is that the set of subalgebras of an algebra, again ordered by inclusion, is always an algebraic lattice, and every algebraic lattice arises as the lattice of subalgebras of some algebra. So in that regard, subalgebras behave analogously to subsets.
However, there are two important properties of subsets that do not carry over to subalgebras in general. First, although the subsets of a set form a set (as well as a lattice), in some classes it may not be possible to organize the subalgebras of an algebra as itself an algebra in that class, although they can always be organized as a lattice. Secondly, whereas the subsets of a set are in bijection with the functions from that set to the set {0, 1} = 2, there is no guarantee that a class of algebras contains an algebra that can play the role of 2 in this way.
Certain classes of algebras enjoy both of these properties. The first property is more common; the case of having both is relatively rare. One class that does have both is that of multigraphs. Given two multigraphs G and H, a homomorphism h : G → H consists of two functions, one mapping vertices to vertices and the other mapping edges to edges. The set H$^G$ of homomorphisms from G to H can then be organized as the graph whose vertices and edges are respectively the vertex and edge functions appearing in that set. Furthermore, the subgraphs of a multigraph G are in bijection with the graph homomorphisms from G to the multigraph Ω definable as the complete directed graph on two vertices (hence four edges, namely two self-loops and two more edges forming a cycle) augmented with a fifth edge, namely a second self-loop at one of the vertices. We can therefore organize the subgraphs of G as the multigraph Ω$^G$, called the power object of G.
What is special about a multigraph as an algebra is that its operations are unary. A multigraph has two sorts of elements forming a set V of vertices and E of edges, and has two unary operations s, t : E → V giving the source (start) and target (end) vertices of each edge. An algebra all of whose operations are unary is called a presheaf. Every class of presheaves contains a presheaf Ω that plays the role for subalgebras that 2 plays for subsets. Such a class is a special case of the more general notion of elementary topos as a category that is closed (and moreover cartesian closed) and has an object Ω, called a subobject classifier. Although the term "power object" is sometimes used synonymously with exponential object Y$^X$, in topos theory Y is required to be Ω.

## Functors and quantifiers

There is both a covariant and contravariant power set functor, P: Set → Set and P: Set $^{op}$ → Set. The covariant functor is defined more simply. as the functor which sends a set S to P(S) and a morphism f: S → T (here, a function between sets) to the image morphism. That is, for $A=\{x_{1},x_{2},...\}\in {\mathsf {P}}(S),{\mathsf {P}}f(A)=\{f(x_{1}),f(x_{2}),...\}\in {\mathsf {P}}(T)$. Elsewhere in this article, the power set was defined as the set of functions of S into the set with 2 elements. Formally, this defines a natural isomorphism ${\overline {\mathsf {P}}}\cong {\text{Set}}(-,2)$. The contravariant power set functor is different from the covariant version in that it sends f to the preimage morphism, so that if $f(A)=B\subseteq T,{\overline {\mathsf {P}}}f(B)=A$. This is because a general functor ${\text{C}}(-,c)$ takes a morphism $h:a\rightarrow b$ to precomposition by h, so a function $h^{*}:C(b,c)\rightarrow C(a,c)$, which takes morphisms from b to c and takes them to morphisms from a to c, through b via h.
In category theory and the theory of elementary topoi, the universal quantifier can be understood as the right adjoint of a functor between power sets, the inverse image functor of a function between sets; likewise, the existential quantifier is the left adjoint.