---
title: "Power Set in Combinatorics"
description: "Power set in Combinatorics means the set of every subset of a given set, including the empty set and the set itself, with 2^n total subsets."
canonical: "https://fiveable.me/combinatorics/key-terms/power-set"
type: "key-term"
subject: "Combinatorics"
unit: "Unit 8"
---

# Power Set in Combinatorics

## Definition

A power set is the set of all subsets of a given set, including the empty set and the whole set. In combinatorics, it shows how many different groupings you can make from a set with n elements: 2^n.

## What It Is

In combinatorics, a power set is the collection of every possible subset you can form from a set. If your original set is S, then its power set is usually written as P(S) or 2^S. That means you include the empty set, every one-element subset, every two-element subset, and so on, all the way up to S itself.

The fastest way to think about it is this: for each element in the original set, you have two choices, include it or leave it out. Those choices multiply together. So if a set has n elements, the power set has 2^n subsets. That counting idea shows up all over combinatorics because it turns a messy listing problem into a clean exponential pattern.

Here is a tiny example. If S = {a, b}, then P(S) = {∅, {a}, {b}, {a, b}}. There are 4 subsets, which matches 2^2. If you add a third element, the number doubles again to 8. This doubling is why power sets grow so fast, even when the original set is small.

The empty set is always in the power set because choosing nothing is still a valid subset. The original set is also in the power set because you can choose every element. Those two extremes help you check whether a list of subsets is complete.

In this course, power sets often show up as the background idea behind more advanced counting problems, especially when you compare subsets with partitions. A subset is a choice of elements, while a set partition splits the set into non-empty blocks. Those are different structures, but both start from the same finite set and force you to count every possible arrangement carefully.

## Why It Matters

Power sets matter in combinatorics because they turn a basic yes-or-no choice into a counting pattern you can use again and again. Once you see that each element has two options, include it or exclude it, you can count subsets without listing them one by one. That same logic shows up in probability, computer science, and any problem where you are counting possible selections from a set.

This term also gives you a clean way to check your work. If a set has 3 elements, you should be able to account for 8 subsets. If your list has 7 or 9, something went wrong. That kind of self-check is especially useful on problem sets that ask you to enumerate subsets or compare them to other counting objects.

Power sets also connect naturally to Bell numbers and set partitions. A power set counts all possible subsets, while Bell numbers count all possible ways to partition a set into non-empty blocks. Students often mix those up because both ideas involve breaking a set into smaller pieces, but they count very different structures. Knowing the difference helps you pick the right counting tool instead of forcing a formula that does not fit.

## Connections

### Subset

A power set is built from subsets, so you need to know what a subset is first. Any selection of elements from a set counts as a subset, including the empty set and the whole set. The power set is just the complete collection of all of those selections, organized as a set of sets.

### [Counting Partitions](/combinatorics/key-terms/counting-partitions)

Counting partitions asks a different question from a power set question. A power set counts every possible subset, while partitions count ways to split the original set into non-empty groups with no overlap. If you confuse the two, you will get the wrong total because the structures being counted are not the same.

### Bell Number

Bell numbers count the number of set partitions for a given size. Power sets do not give Bell numbers directly, but they often appear nearby when you compare subset counting with partition counting. The link is conceptual: both start with a finite set, but one tracks choices of elements and the other tracks ways to group them.

### [Bell's Recurrence](/combinatorics/key-terms/bells-recurrence)

Bell's recurrence is one way to compute Bell numbers from smaller cases. Power sets are not the recurrence itself, but the same kind of recursive thinking appears when you build subsets by deciding whether to include a chosen element. That include or exclude move is one of the simplest counting patterns in combinatorics.

## On the AP Exam

A set-counting problem may ask you to list the power set of a small set, state how many subsets it has, or explain why the answer is 2^n. For a short-answer item, you should be ready to write out the empty set, the single-element subsets, and the full set without skipping any cases.

If the question compares subsets to partitions, use the right language. A subset is a selection, while a partition splits the set into non-empty blocks. That distinction is where a lot of points are won or lost, especially when the problem mixes power sets with Bell numbers or counting partitions.

On homework or quizzes, you may also use the power set as a check for completeness. If a set has n elements, your final count should double each time you add one more element. That pattern is often the fastest route to the answer.

## Power Set vs Set Partition

A power set lists every possible subset, while a set partition breaks the set into non-empty groups that cover every element exactly once. In a power set, subsets can overlap in meaning and can be any size, including empty. In a partition, the blocks must be disjoint and together use every element.

## Key Takeaways

- A power set is the set of all subsets of a given set, including the empty set and the original set.
- If a set has n elements, its power set has 2^n subsets because each element has two choices: included or excluded.
- Power sets grow very fast, so even a small original set can produce a large number of subsets.
- A power set is about selecting elements, not splitting them into groups, so it is different from a set partition.
- In combinatorics, power sets often show up as the counting idea behind more advanced subset and partition problems.

## FAQs

### What is power set in Combinatorics?

A power set is the set of every subset you can make from a given set. That includes the empty set, all smaller subsets, and the set itself. If the original set has n elements, the power set has 2^n subsets.

### Why does a power set have 2^n subsets?

Each element in the original set has two choices: include it or leave it out. With n elements, those binary choices multiply to 2^n possible combinations. This is why the number of subsets doubles every time you add one more element.

### Is a power set the same as a subset?

No. A subset is one particular selection from a set, like {a, b}. The power set is the full collection of all possible subsets of that set. So the power set contains subsets, but it is not itself just one subset.

### How do power sets connect to Bell numbers?

They are related through counting ideas, but they count different things. Power sets count all subsets, while Bell numbers count all partitions of a set into non-empty blocks. They often appear in the same chapter because both deal with finite sets and careful counting.

## Related Study Guides

- [8.4 Bell numbers and their properties](/combinatorics/unit-8/bell-numbers-properties/study-guide/uEcwq3eONAZwHwus)

## About This Document

Canonical Fiveable pages are available as Markdown at the same path plus `.md`.

- [llms.txt](https://fiveable.me/llms.txt): index of Fiveable's sections and URL patterns
- [llms-full.txt](https://fiveable.me/llms-full.txt): complete subject and unit listing
- [MCP server](https://fiveable.me/mcp): call Fiveable as tools instead of fetching pages (`https://fiveable.me/api/mcp`)
- [MCP server for AP teachers](https://fiveable.me/mcp/teachers): a teacher's classes, assignments and AP-rubric grading (`https://fiveable.me/api/mcp/teacher`)

## Structured Data

```json
{"@context":"https://schema.org","@graph":[{"@type":"LearningResource","@id":"https://fiveable.me/combinatorics/key-terms/power-set#resource","name":"Power Set in Combinatorics","url":"https://fiveable.me/combinatorics/key-terms/power-set","learningResourceType":"Concept explainer","educationalLevel":"AP® / High School","about":{"@id":"https://fiveable.me/combinatorics/key-terms/power-set#term"},"audience":{"@type":"EducationalAudience","educationalRole":"student"},"dateModified":"2026-07-03T02:21:06.613Z","isPartOf":{"@type":"Collection","name":"Combinatorics Key Terms","url":"https://fiveable.me/combinatorics/key-terms"},"publisher":{"@type":"Organization","name":"Fiveable","url":"https://fiveable.me"}},{"@type":"DefinedTerm","@id":"https://fiveable.me/combinatorics/key-terms/power-set#term","name":"Power Set","description":"A power set is the set of all subsets of a given set, including the empty set and the whole set. In combinatorics, it shows how many different groupings you can make from a set with n elements: 2^n.","url":"https://fiveable.me/combinatorics/key-terms/power-set","inDefinedTermSet":{"@type":"DefinedTermSet","name":"Combinatorics Key Terms","url":"https://fiveable.me/combinatorics/key-terms"}},{"@type":"FAQPage","mainEntity":[{"@type":"Question","name":"What is power set in Combinatorics?","acceptedAnswer":{"@type":"Answer","text":"A power set is the set of every subset you can make from a given set. That includes the empty set, all smaller subsets, and the set itself. If the original set has n elements, the power set has 2^n subsets."}},{"@type":"Question","name":"Why does a power set have 2^n subsets?","acceptedAnswer":{"@type":"Answer","text":"Each element in the original set has two choices: include it or leave it out. With n elements, those binary choices multiply to 2^n possible combinations. This is why the number of subsets doubles every time you add one more element."}},{"@type":"Question","name":"Is a power set the same as a subset?","acceptedAnswer":{"@type":"Answer","text":"No. A subset is one particular selection from a set, like {a, b}. The power set is the full collection of all possible subsets of that set. So the power set contains subsets, but it is not itself just one subset."}},{"@type":"Question","name":"How do power sets connect to Bell numbers?","acceptedAnswer":{"@type":"Answer","text":"They are related through counting ideas, but they count different things. Power sets count all subsets, while Bell numbers count all partitions of a set into non-empty blocks. They often appear in the same chapter because both deal with finite sets and careful counting."}}]},{"@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Combinatorics","item":"https://fiveable.me/combinatorics"},{"@type":"ListItem","position":2,"name":"Key Terms","item":"https://fiveable.me/combinatorics/key-terms"},{"@type":"ListItem","position":3,"name":"Unit 8","item":"https://fiveable.me/combinatorics/unit-8"},{"@type":"ListItem","position":4,"name":"Power Set"}]}]}
```