In mathematics, given a set S, the power set (or powerset) of S, written , P(S), ℘(S) or 2, is the set of all subsets of S, including the empty set.. In axiomatic set theory (as developed e.g. in the ZFC axioms), the existence of the power set of any set is postulated by the axiom of power set.
Any subset F of is called a family of sets over S.
The set of non-empty subsets of S may be denoted by , P1(S) or similar.
If S is the set {x, y, z}, then...
more
In mathematics, given a set S, the power set (or powerset) of S, written , P(S), ℘(S) or 2, is the set of all subsets of S, including the empty set.. In axiomatic set theory (as developed e.g. in the ZFC axioms), the existence of the power set of any set is postulated by the axiom of power set.
Any subset F of is called a family of sets over S.
The set of non-empty subsets of S may be denoted by , P1(S) or similar.
If S is the set {x, y, z}, then the subsets of S are:
and hence the power set of S is
If S is a finite set with |S| = n elements, then the power set of S contains elements.
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 (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. For example, the power set of the set of natural numbers can be put in a one-to-one...
less
