A power set is a set that contains all of the possible subsets of a given set and is denoted by or
In other words:
In plain English this reads the collection of X such that X is a subset of A.
As an example, the power set of would be:
From this we find that if the original set has n members then the Power Set will have members. In the case of the preceding example:
Note that the number of members in a set is often denoted . In the preceding example
can be translated the number of mebers in the power set of S.
Another interesting way to look at the various subsets within a power set is to relate them to binary digits like so:
Next time we’ll look at sample spaces and events and you won’t want to miss that!