Power Sets: All Subsets Explained Simply with Examples

A power set is the set of ALL subsets of a given set. For example, if A = {1, 2}, the subsets of A are the empty set, {1}, {2} and {1, 2} itself, so the power set P(A) = {empty set, {1}, {2}, {1, 2}}.

It matters because listing every possible subset is how we count choices. Every time each item can be either picked or not picked — features in a product, symptoms in a diagnosis, heads or tails on coins — the collection of all possibilities is a power set.

Key Concepts

• Power set P(A): the set whose elements are all the subsets of A.
• Empty set: the set with no elements; it is a subset of every set, so it is always the first member of a power set.
• Proper subset: a subset that leaves out at least one element of A. A set with n elements has 2^n minus 1 proper subsets.
• Cardinality: the number of elements. If A has n elements, written n(A) = n, then P(A) has 2^n elements.

Formulas

• n(P(A)) = 2^n, where n = n(A). Why: for each of the n elements we make an independent in-or-out decision, giving 2 times 2 times and so on, n times.
• Number of non-empty subsets = 2^n minus 1 (we drop the empty set from the count).
• Assumptions and limits: A must be finite and its elements distinct, so remove duplicates first. For infinite sets the formula does not apply; a famous result called Cantor's theorem says the power set of an infinite set is always strictly bigger than the set itself.

Worked Example

Find P(A) and n(P(A)) for A = {x, y, z}.

1. Count the elements: n = 3.
2. Count the subsets: 2^3 = 2 times 2 times 2 = 8.
3. List them by size: the empty set; the singletons {x}, {y}, {z}; the pairs {x, y}, {x, z}, {y, z}; and the whole set {x, y, z}.
4. So P(A) = {empty set, {x}, {y}, {z}, {x, y}, {x, z}, {y, z}, {x, y, z}}, and n(P(A)) = 8, matching the formula.

Common Misconceptions

• "The empty set is not a subset of anything." It is a subset of every set: there is no element of the empty set that fails to be in A, so the empty set is always a subset of A.
• "A set is not a subset of itself." Every set is a subset of itself, because every element of A is certainly in A. So A is always a member of P(A).
• "The power set of the empty set is empty." P of the empty set is the set containing the empty set, which has exactly one element. That matches the formula: 2^0 = 1.

Real-World Applications

• Computer science: every combination of on-or-off switches in a circuit, or every combination of optional features in software, is a member of a power set.
• Probability: when three coins are tossed, the sample space of heads-or-tails outcomes is the power set of {coin 1, coin 2, coin 3}.
• Data analysis: every possible combination of filters a shopper can tick on a shopping site is a subset, and the site must handle all of them.

The power set P(A) gathers every subset of A into one set, and its size is always 2^n. List subsets in order of size — empty set first, then singles, then pairs — and you will never accidentally skip or repeat one.