Power Sets

What is a Power Set?

You have a set. What are all the possible subsets you could make from it?

Collect them all into one set — that’s the power set.

Symbol: P(A)\mathcal{P}(A) or 2A2^A


Example

A={1,2}A = \{1, 2\}

List all subsets of A:

  • \emptyset (empty set — always a subset)
  • {1}\{1\}
  • {2}\{2\}
  • {1,2}\{1, 2\} (the set itself — always a subset)

The power set collects them all:

P(A)={,{1},{2},{1,2}}\mathcal{P}(A) = \{\emptyset, \{1\}, \{2\}, \{1, 2\}\}

The power set is a set of sets.


How Many Subsets?

For a set with nn elements:

P(A)=2n|\mathcal{P}(A)| = 2^n

Why? For each element, you have 2 choices: include it or don’t.

SetElementsSubsets
{a}\{a\}121=22^1 = 2
{a,b}\{a, b\}222=42^2 = 4
{a,b,c}\{a, b, c\}323=82^3 = 8
{1,2,3,4}\{1, 2, 3, 4\}424=162^4 = 16

This is why the notation 2A2^A makes sense — the size is 2n2^n.


Larger Example

A={a,b,c}A = \{a, b, c\}

All 8 subsets:

Size 0Size 1Size 2Size 3
\emptyset{a}\{a\}{a,b}\{a, b\}{a,b,c}\{a, b, c\}
{b}\{b\}{a,c}\{a, c\}
{c}\{c\}{b,c}\{b, c\}

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\}\}


Special Cases

Power set of empty set:

P()={}\mathcal{P}(\emptyset) = \{\emptyset\}

The empty set has one subset: itself. That’s 20=12^0 = 1.

Power set of a singleton:

P({x})={,{x}}\mathcal{P}(\{x\}) = \{\emptyset, \{x\}\}

Two subsets: empty set and the set itself.


Key Facts

Every power set contains:

  • \emptyset (the empty set is a subset of everything)
  • AA itself (every set is a subset of itself)

So for any non-empty set A:

P(A)\emptyset \in \mathcal{P}(A)

The empty set is a subset of A, so it’s in the power set.

AP(A)A \in \mathcal{P}(A)

A is a subset of itself, so it’s in the power set.


The Formal Definition

P(A)={SSA}\mathcal{P}(A) = \{S \mid S \subseteq A\}

This reads: “The set of all S such that S is a subset of A.”

Power set = all possible subsets collected into one set.