Product Code Database
» » Wiki: Power Set
Tag

# Power set  ( Abstract Algebra )

C O N T E N T S
Rank: 100%

In , the power set (or powerset) of any set is the set of all of , including the and itself, variously denoted as (), 𝒫(), ℘() (using the ""), , , or, identifying the powerset of with the set of all functions from to a given set of two elements, . In axiomatic set theory (as developed, for example, in the axioms), the existence of the power set of any set is by the axiom of power set.

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

Example
If is the set , then the subsets of are

• (also denoted $\varnothing$ or $\empty$, the or the null set)
and hence the power set of is .

Properties
If is a finite set with elements, then the number of subsets of is . This fact, which is the motivation for the notation , may be demonstrated simply as follows,
First, order the elements of in any manner. We write any subset of in the format } where , can take the value of or . If , the -th element of is in the subset; otherwise, the -th element is not in the subset. Clearly the number of distinct subsets that can be constructed this way is as .

Cantor's diagonal argument shows that the power set of a set (whether infinite or not) always has strictly higher 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 set is infinite. The power set of the set of can be put in a with the set of (see Cardinality of the continuum).

The power set of a set , 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 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 of a power set Boolean algebra (see Stone's representation theorem).

The power set of a set forms an 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 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 .

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

This notion can be applied to the example above in which to see the isomorphism with the binary numbers from 0 to with being the number of elements in the set. In , a "1" in the position corresponding to the location in the set indicates the presence of the element. So .

For the whole power set of we get:

Relation to binomial theorem
The power set is closely related to the . The number of subsets with elements in the power set of a set with elements is given by the number of , , 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).

Algorithms
If is a , there is a recursive algorithm to calculate ().

Define the operation }.

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

• If , then is returned.
• Otherwise:
*Let be any single element of .
*Let , where denotes the relative complement of in .
*And the result: 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 of less than is denoted by or . Similarly, the set of non-empty subsets of might be denoted by .

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 as the set of subsets of 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 . Given two multigraphs and , a consists of two functions, one mapping vertices to vertices and the other mapping edges to edges. The set of homomorphisms from to 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 are in bijection with the graph homomorphisms from to the multigraph definable as the 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 as the multigraph , called the power object of .

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 of vertices and of edges, and has two unary operations giving the source (start) and target (end) vertices of each edge. An algebra all of whose operations are unary is called a . 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 as a category that is (and moreover cartesian closed) and has an object , called a subobject classifier. Although the term "power object" is sometimes used synonymously with exponential object , in topos theory is required to be .

Functors and quantifiers
In and the theory of , the universal quantifier can be understood as the of a between power sets, the functor of a function between sets; likewise, the existential quantifier is the .Saunders Mac Lane, , (1992) Sheaves in Geometry and Logic Springer-Verlag. See page 58

• Axiomatic set theory
• Family of sets
• Field of sets

Notes

 Page 1 of 1 1
 Page 1 of 1 1

### Account

Social:
Pages:  ..   ..
Items:  ..

General: Atom Feed  ..
Help:  ..   ..
Category:  ..   ..
Media:  ..   ..
Posts:  ..   ..   ..

Page:  ..
Summary:  ..
1 Tags
10/10 Page Rank
5 Page Refs
1s Time