Course contentsShow
← Mathematics
Lesson 2531 of 3,12151. Discrete Math — Sets, Relations, FunctionsFree lesson

Introduction to Power Sets

Define the power set of a set as the collection of all its subsets, including the empty set and the set itself.

Introduction to Power Sets

You'll learn: What the power set of a set is and how it collects all possible subsets into one comprehensive structure.


What Is a Power Set?

The power set of a set is the collection of all possible subsets of that set. This includes two special members you might overlook: the empty set (which is a subset of every set) and the set itself (which is also considered its own subset).

If we have a set A, we denote its power set as P(A) or sometimes 2^A.

Understanding Through an Example

Let's say you have a set A = {1, 2}.

What are all the possible subsets?

  • The empty set: ∅ (taking no elements)
  • Single elements: {1} and {2}
  • Both elements: {1, 2}

So the power set is: P(A) = {∅, {1}, {2}, {1, 2}}

Notice that P(A) has 4 elements, even though A only had 2 elements.

The Size Pattern

If a set has n elements, its power set has 2^n elements. This is why the notation 2^A makes sense: each element can either be "in" or "out" of a subset, giving us 2 choices per element.

For A = {1, 2}: 2² = 4 subsets ✓

Think of It This Way

Imagine you're packing for a trip and have 3 shirts. The power set represents every possible combination you could pack: no shirts, just shirt 1, shirts 1 and 3 together, all three shirts, and so on.

Key Takeaway: The power set P(A) of any set A is the set containing all subsets of A, including the empty set and A itself; if |A| = n, then |P(A)| = 2^n.