Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

How to List the Power Set of a Set

The power set P(A)\mathcal{P}(A) is the set of all subsets of AA. List them in an order that cannot miss any: by size from the empty set up, or by doubling the list each time a new element is added. A set with nn elements has 2n2^n subsets, which checks the list.

Recognize the task

The question asks for P(A)\mathcal{P}(A), 2A2^A, "all subsets of AA", or whether something is an element of P(A)\mathcal{P}(A). AA is a small finite set, usually with 22 to 44 elements. Test: the answer is a set whose elements are themselves sets, so every entry needs its own braces.
The power set is defined in the power set lesson.

Two ways to do it

By sizeusual
∅; singletons; pairs; …; A\emptyset;\ \text{singletons};\ \text{pairs};\ \ldots;\ A
List the subsets with 00 elements, then 11, then 22, up to AA itself.
Doublingbuild up
P(A∪{c})=P(A)∪{S∪{c}:S∈P(A)}\mathcal{P}(A \cup \{c\}) = \mathcal{P}(A) \cup \{S \cup \{c\} : S \in \mathcal{P}(A)\}
Keep the list for the elements so far, then add a copy with the new element cc put into each subset.

Steps

StepOn A={a,b,c}A = \{a, b, c\}
1Count the elements. A set with nn elements has 2n2^n subsets; this is the target count.n=3n = 3, so 23=82^3 = 8 subsets
2Start with the empty set. The empty set is a subset of every set.∅\emptyset
3List the subsets by size. All singletons, then all pairs. Write each subset once; the order inside its braces does not matter.{a},{b},{c},{a,b},{a,c},{b,c}\{a\}, \{b\}, \{c\}, \{a, b\}, \{a, c\}, \{b, c\}
4End with the set itself and check the count. Every set is a subset of itself. Count the entries against 2n2^n.P(A)={∅,{a},{b},{c},{a,b},{a,c},{b,c},{a,b,c}}\mathcal{P}(A) = \{\emptyset, \{a\}, \{b\}, \{c\}, \{a, b\}, \{a, c\}, \{b, c\}, \{a, b, c\}\}

Worked examples

Example 1 · two elements

by size
A={x,y}A = \{x, y\}: 22=42^2 = 4 subsets
target count
P(A)={∅,{x},{y},{x,y}}\mathcal{P}(A) = \{\emptyset, \{x\}, \{y\}, \{x, y\}\}
sizes 00, 11, 11, 22

Example 2 · three elements by doubling

doubling
P({1,2})={∅,{1},{2},{1,2}}\mathcal{P}(\{1, 2\}) = \{\emptyset, \{1\}, \{2\}, \{1, 2\}\}
list for the first two
add 33 to each: {3},{1,3},{2,3},{1,2,3}\{3\}, \{1, 3\}, \{2, 3\}, \{1, 2, 3\}
copy with the new element
4+4=84 + 4 = 8 subsets of {1,2,3}\{1, 2, 3\}
old list plus new list

Example 3 · a set that contains the empty set

tricky
A={∅,1}A = \{\emptyset, 1\}: 22 elements, 44 subsets
∅\emptyset counts as an element here
∅\emptyset, {∅}\{\emptyset\}, {1}\{1\}, {∅,1}\{\emptyset, 1\}
by size
P(A)={∅,{∅},{1},{∅,1}}\mathcal{P}(A) = \{\emptyset, \{\emptyset\}, \{1\}, \{\emptyset, 1\}\}
∅\emptyset and {∅}\{\emptyset\} are different
Build power sets element by element in the power set tool.

See it happen

Each element of AA is a switch: in the subset or out of it. A subset is one setting of all the switches, so nn switches give 2⋅2⋯2=2n2 \cdot 2 \cdots 2 = 2^n subsets. Doubling follows the same picture: one more switch keeps every old setting with the new switch off and adds a copy of each with the switch on.

Common mistakes

Leaving out the empty set or the set itself

✗ P({x,y})={{x},{y}}\mathcal{P}(\{x, y\}) = \{\{x\}, \{y\}\}
✓ four subsets: {∅,{x},{y},{x,y}}\{\emptyset, \{x\}, \{y\}, \{x, y\}\}

Dropping the inner braces

✗ P({1,2})={∅,1,2,{1,2}}\mathcal{P}(\{1, 2\}) = \{\emptyset, 1, 2, \{1, 2\}\}
✓ 11 is an element, {1}\{1\} is a subset: {∅,{1},{2},{1,2}}\{\emptyset, \{1\}, \{2\}, \{1, 2\}\}

Taking the power set of the empty set to be empty

✗ P(∅)=∅\mathcal{P}(\emptyset) = \emptyset
✓ P(∅)={∅}\mathcal{P}(\emptyset) = \{\emptyset\}, with 11 element

Listing the same subset twice

✗ {1,2}\{1, 2\} and {2,1}\{2, 1\} as two entries
✓ order inside braces does not matter; they are one subset