# Power Set

The power set is a set which includes all the subsets including the empty set and the original set itself. It is also a type of sets. If set A = {x,y,z} is a set, then all its subsets {x}, {y}, {z}, {x,y}, {y,z}, {x,z}, {x,y,z} and {} are the elements of powerset, such as:

Power set of A, P(A) = {x}, {y}, {z}, {x,y}, {y,z}, {x,z}, {x,y,z} and {}

Where P(A) denotes the powerset.

Let us understand the concept with the help of examples and properties.

## Definition

In set theory, the power set (or powerset) of a Set A is defined as the set of all subsets of the Set A including the Set itself and the null or empty set. It is denoted by P(A). Basically, this set is the combination of all subsets including null set, of a given set.

### How is Power set Calculated?

If the given set has n elements, then its Power Set will contain 2n elements. It also represents the cardinality of powerset.

### Example

Let us say Set A = { a, b, c }

Number of elements: 3

Therefore, the subsets of the set are:

{ } which is the null or the empty set

{ a }

{ b }

{ c }

{ a, b }

{ b, c }

{ c, d }

{ a, b, c }

The power set P(A) = { { } , { a }, { b }, { c }, { a, b }, { b, c }, { c, d }, { a, b, c } }

Now, the Power Set should have 23 = 8 elements.

### Notation

The number of elements of a set is written as |A|, If A has n elements then it can be written as

|P(A)| = 2n

## Properties

• It is much larger than the original set.
• The number of elements in power set of A is 2n, where n is the number of elements in set A
• The powerset of a countable finite set is uncountable.
• For a set of natural numbers, we can do one-to-one mapping of the resulted set, P(S), with the real numbers.
• P(s) of set S, if operated with the union of sets, the intersection of sets and complement of sets, denotes the example of Boolean Algebra.

## Power Set of Empty Set

An empty set has zero element. Therefore, powerset of a empty set{ }, can be mentioned as;

• A set containing a null set.
• It contains zero or null elements.
• Empty set is the only subset.

## Recursive Algorithm

A recursive algorithm is used to generate the powerset P(S) of any finite set S.

The operation F (e, T) is defined as

F (e, T) = { X ∪ {e} | X ∈ T }

This returns each of the set X in T that has the element x.

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

If not, the following algorithm is followed.

If e is an element in Set S, T = S {e} such that S { e } forms the relative complement of the element e in Set S, the power set is generated by the following algorithm:

P(S) = P(T) ∪ F ( e, P(T))

To conclude, if the set S is empty then the only element in the power set will be the null set. If not, the powerset will the union of all the subsets containing the particular element and the subsets not containing the particular element.

## How is Power-Set Related to Binomial Theorem

It is closely related to the binomial theorem in terms of the notation.

Let us consider a set of three elements S = { a, b, c }

Number of subsets with zero elements (the null or the empty set) = 1

Number of subsets with one element (the singleton subsets) = 3

Number of subsets with two elements (the complements of singleton subsets) = 3

Number of subsets with three elements (the actual set) = 1

From the above relationship we can calculate |2s| as follows:

|2s| = $\sum_{k=0}^{|s|}(^{|s|}_{k})$

If |S| = n then,

|2s| = 2n = $\sum_{k=0}^{n}(^{n}_{k})$

This is the relationship between a power-set and the binomial theorem.

## Problems and Solutions

Q.1: Find the power set of Z = {2,7,9} and total number of elements.

Solution: Given, Z = {2,7,9}

Total number of elements in powerset = 2n

Here, n = 3 (number of elements in set Z)

So, 23 = 8, which shows there are eight elements of power set of Z

Therefore,

P(Z) = {{}, {2}, {7}, {9}, {2,7}, {7,9}, {2,9}, {2,7,9}}

Q.2: How many elements are there for power set of empty set?

Solution: An empty set has zero elements.

Therefore, no. of elements of powerset = 20 = 1

Hence, there is only one element of the powerset which is the empty set itself.

P(E) = {}

Learning about sets and related topics can be so much fun. Download BYJU’S – The Learning App and discover innovative ways to learn science and math.

Related Articles

## Frequently Asked Questions – FAQs

### What is the power set?

A power set is set of all subsets, empty set and the original set itself. For example, powerset of A={1,2} is PA = {}, {1}, {2}, {1,2}

### How many sets are there in a power set?

To calculate the total number of sets present in a power set we have to use the formula:
No. of sets in P(S) = 2n, where n is the number of elements in set S.

### What is the power set of empty set?

An empty set is a null set, which does not have any elements present in it. Therefore, the power set of empty set is a null set only.

### What are the elements of powerset?

If there are n elements in a set A, then the elements of power set are equal to 2n, which will include all the subsets of A along with empty set and set A itself.

### What is the power set of {1,2,3}?

Let A = {1,2,3}
Power set of A, P(A) = {{}, {1}, {2},{3},{1,2},{2,3},{1,3},{1,2,3}}
So you can see there are 8 elements of P(A).

### What is the cardinality of power set?

The cardinality of power set is the number of elements present in it. It is calculated by 2n where n is the number of elements of the original set.