ADVERTISEMENT

Power Set

The set of all possible subsets of a set S is called the power set of S, written as P(S).

Examples ⇒

The power set of { ‘a’ } is { ∅, {‘a’} }
The power set of { 2, 3 } is { ∅, {2}, {3}, {2,3} }
The power set of {1, 2, 3 } is { ∅, {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3} }

If there are n members in a set S i.e. cardinality of set |S| = n, then there are 2n subsets possible.
Hence the power set would contain 2n elements. Or we can say that the cardinality of the power set is |P| is 2n.

TAGS:

Comments

What do you think?

0 Comments

Submit a Comment

Your email address will not be published. Required fields are marked *

Learn More

Related Posts

De Morgan’s laws

De Morgan’s laws

De Morgan’s First Law The complement of the union of two sets is equal to the intersection of their complements i.e. (A ∪ B )' = A' ∩ B' De Morgan’s Second Law The complement of the intersection of two sets is equal to the union of their complements i.e. (A ∩ B )’ =...

read more

Cartesian Product of Sets

A cartesian product between two sets is defined as the set consisting of all possible ordered pairs that can be formed by taking one element from each of the sets at a given time. If A and B are two sets such that a ∈ A and b ∈ B, then the cartesian product between A...

read more

Ordered Pairs

An ordered pair is a 2-tuple formed by taking two elements (generally numbers but can be alphabets, characters, words, or symbols). The general form of representation is (a, b) where a and b represent two distinct objects. The important thing with ordered pairs is...

read more
Share This