Power set

For the search engine developer, see Powerset (company).

The elements of the power set of the set {x, y, z} ordered with respect to inclusion.

In mathematics, the power set (or powerset) of any set S is the set of all subsets of S, including the empty set and S itself, variously denoted as P(S), 𝒫(S), ℘(S) (using the "Weierstrass p"), P(S), ℙ(S), or, identifying the powerset of S with the set of all functions from S to a given set of two elements, 2^S. 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.^[1]

Any subset of P(S) is called a family of sets over S.

Contents

• 
  1 Example
  


• 
  2 Properties
  


• 
  3 Representing subsets as functions
  


• 
  4 Relation to binomial theorem
  


• 
  5 Algorithms
  


• 
  6 Subsets of limited cardinality
  


• 
  7 Power object
  


• 
  8 Functors and quantifiers
  


• 
  9 See also
  


• 
  10 Notes
  


• 
  11 References
  


• 
  12 External links
  

Example

If S is the set {x, y, z}, then the subsets of S are

• 
  {} (also denoted ∅{displaystyle varnothing } or ∅{displaystyle 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}}.^[2]

Properties

If S is a finite set with |S| = n elements, then the number of subsets of S is |P(S)| = 2ⁿ. This fact, which is the motivation for the notation 2^S, may be demonstrated simply as follows,

First, order the elements of S in any manner. We write any subset of S in the format {γ₁, γ₂, ..., γ_n} where γ_i , 1 ≤ i ≤ n, can take the value of 0 or 1. If γ_i = 1, the i-th element of S is in the subset; otherwise, the i-th element is not in the subset. Clearly the number of distinct subsets that can be constructed this way is 2ⁿ as γ_i ∈ {0, 1} .

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. 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 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 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. 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 set of all functions from Y to X. As "2" can be defined as {0,1} (see natural number), 2^S (i.e., {0,1}^S) is the set of all functions from S to {0,1}. By identifying a function in 2^S with the corresponding preimage of 1, we see that there is a bijection between 2^S and P(S), where each function is the characteristic function of the subset in P(S) with which it is identified. Hence 2^S and P(S) could be considered identical set-theoretically. (Thus there are two distinct notational motivations for denoting the power set by 2^S: the fact that this function-representation of subsets makes it a special case of the X^Y notation and the property, mentioned above, that |2^S| = 2^|S|.)

This notion can be applied to the example above in which S = {x, y, z} to see the isomorphism with the binary numbers
from 0 to 2ⁿ − 1 with n being the number of elements in the set.
In S, a "1" in the position corresponding to the location in the set indicates the presence of the
element. So {x, y} = 110.

For the whole power set of S we get:

• {} = 000 (Binary) = 0 (Decimal)


• {x} = 100 = 4


• {y} = 010 = 2


• {z} = 001 = 1


• {x, y} = 110 = 6


• {x, z} = 101 = 5


• {y, z} = 011 = 3


• {x, y, z} = 111 = 7

Relation to binomial theorem

The power set is closely related to the binomial theorem. The number of subsets with k elements in the power set of a set with n elements is given by the number of combinations, C(n, k), also called binomial coefficients.

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 |2S|{textstyle left|2^{S}right|} using the formula:

|2S|=∑k=0|S|(|S|k){displaystyle left|2^{S}right|=sum _{k=0}^{|S|}{binom {|S|}{k}}}

Therefore one can deduce the following identity, assuming |S|=n{textstyle |S|=n}:

|2S|=2n=∑k=0n(nk){displaystyle left|2^{S}right|=2^{n}=sum _{k=0}^{n}{binom {n}{k}}}

Algorithms

If S is a finite set, there is a recursive algorithm to calculate P(S).

Define the operation F (e, T) = {X ∪ {e} | X ∈ T}.

In English, return the set with the element e added to each set X in T.

• If S = { }, then P(S) = { { } } is returned.


• Otherwise:

• Let e be any single element of S.


• Let T = S {e}, where S {e} denotes the relative complement of e in S.


• And the result: P(S) = P(T) ∪ F (e, P(T)) is returned.

In other words, the power set of the empty set is the set containing the empty set and the power set of any other set is all the subsets of the set containing some specific element and all the subsets of the set not containing that specific element.

Subsets of limited cardinality

The set of subsets of S of cardinality less than κ is denoted by P_κ(S) or P_{< κ}(S). Similarly, the set of non-empty subsets of S might be denoted by P_{≥ 1}(S).

Power object

A set can be regarded as an algebra having no nontrivial operations or defining equations. From this perspective the idea of the power set of X as the set of subsets of X generalizes naturally to the subalgebras of an algebraic structure or algebra.

Now 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

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.^[3]

See also

• Set theory


• Axiomatic set theory


• Family of sets


• Field of sets

Notes

1. 
   ^ Devlin 1979, p. 50
   


2. 
   ^ Puntambekar 2007, pp. 1–2
   


3. 
   ^ Saunders Mac Lane, Ieke Moerdijk, (1992) Sheaves in Geometry and Logic Springer-Verlag. .mw-parser-output cite.citation{font-style:inherit}.mw-parser-output q{quotes:"""""""'""'"}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}
   ISBN 0-387-97710-4 See page 58
   

References

• 
  Devlin, Keith J. (1979). Fundamentals of contemporary set theory. Universitext. Springer-Verlag. ISBN 0-387-90441-7. Zbl 0407.04003.
  


• 
  Halmos, Paul R. (1960). Naive set theory. The University Series in Undergraduate Mathematics. van Nostrand Company. Zbl 0087.04403.
  


• 
  Puntambekar, A. A. (2007). Theory Of Automata And Formal Languages. Technical Publications. ISBN 978-81-8431-193-8.
  

External links

Look up power set in Wiktionary, the free dictionary.

• Weisstein, Eric W. "Power Set". MathWorld.


• 
  "Power set". PlanetMath.
  


• 
  Power set in nLab
  


• 
  Power object in nLab
  


• 
  Power set Algorithm in C++
  

v t e Mathematical logic
General	Formal language Formation rule Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Rule of inference Relation Theorem Logical consequence Type theory Symbol Syntax Theory
Systems	Formal system Deductive system Axiomatic system Hilbert style systems Natural deduction Sequent calculus
Traditional logic	Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram
Propositional calculus and Boolean logic	Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables Many-valued logic
Predicate logic	First-order Quantifiers Predicate Second-order Monadic predicate calculus
Naive set theory	Set Empty set Element Enumeration Extensionality Finite set Infinite set Subset Power set Countable set Uncountable set Recursive set Domain Codomain Image Map Function Relation Ordered pair
Set theory	Foundations of mathematics Zermelo–Fraenkel set theory Axiom of choice General set theory Kripke–Platek set theory Von Neumann–Bernays–Gödel set theory Morse–Kelley set theory Tarski–Grothendieck set theory
Model theory	Model Interpretation Non-standard model Finite model theory Truth value Validity
Proof theory	Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax
Computability theory	Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function

v t e Set theory
Axioms	Choice countable dependent Constructibility (V=L) Determinacy Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement De Morgan's laws Disjoint union Intersection Power set Set difference Symmetric difference Union
Concepts Methods	Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Transfinite induction Venn diagram
Set types	Countable Empty Finite (hereditarily) Fuzzy Infinite Recursive Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Abraham Fraenkel Bertrand Russell Ernst Zermelo Georg Cantor John von Neumann Kurt Gödel Paul Bernays Paul Cohen Richard Dedekind Thomas Jech Thoralf Skolem Willard Quine

This page is only for reference, If you need detailed information, please check here