Definition:Power Set

Definition
The power set of a set $S$ is the set defined and denoted as:


 * $\powerset S := \set {T: T \subseteq S}$

That is, the set whose elements are all of the subsets of $S$.

Note that this is a set all of whose elements are themselves sets.

It is clear from the definition that:
 * $T \in \powerset S \iff T \subseteq S$

Axiomatic Set Theory
The concept of the power set is axiomatised in the Axiom of Powers in Zermelo-Fraenkel set theory:

Also known as
The rendition powerset is frequently seen.

Some sources do not use the term power set, merely referring to the term set of all subsets.

Variants of $\PP$ are seen throughout the literature: $\mathfrak P, P, \mathscr P, \mathrm P, \mathbf P$, etc.

Some sources, for example, use $\mathscr B$.

Another significant notation is:
 * $2^S := \set {T: T \subseteq S}$

This is used by, for example,.

The relevance of this latter notation is clear from the fact that if $S$ has $n$ elements, then $2^S$ has $2^n$ elements‎.

Also see

 * Cardinality of Power Set of Finite Set


 * Definition:Set of All Mappings