Power Set Calculator
Enter your set as a comma-separated list of elements (numbers, letters, or words). The calculator instantly shows you the total number of subsets, the number of proper subsets, a breakdown of how many subsets exist at each size, and for sets up to 12 elements it enumerates every subset grouped by cardinality. Use it to study set theory, verify combinatorics homework, or explore how quickly the power set grows.
What is a power set?
The power set of a set A, written P(A) or 2^A, is the collection of ALL possible subsets of A, including the empty set and A itself. For example, if A = {1, 2, 3} then P(A) = {{}, {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3}}. That is 8 subsets, and 8 = 2^3 because the set has 3 elements. The power set always contains at least the empty set, so even when A is empty, P(A) = {{}} and has exactly one member.
The 2^n formula and why it works
For every element in the original set you have exactly two choices: include it in a subset or leave it out. Because those choices are independent, the total number of subsets is 2 multiplied by itself once for each element: 2^n. This is also the sum of all binomial coefficients C(n,0) + C(n,1) + ... + C(n,n), a direct consequence of the binomial theorem. The number of k-element subsets specifically is the combination C(n, k) = n! / (k! x (n-k)!), which counts how many ways you can pick k items from n without regard to order.
Proper subsets, improper subsets, and the empty set
A proper subset of A is any subset that is not equal to A itself: every element of the subset is in A, but the subset is missing at least one element of A. There are 2^n - 1 proper subsets (all subsets minus A itself). An improper subset is exactly A - a set is always a subset of itself, just not a proper one. The empty set is a proper subset of every non-empty set, and it is always the first member listed in the power set. If A is the empty set, then A has zero proper subsets but still has one improper subset (A itself, which is the empty set).
Applications in mathematics and computer science
Power sets appear throughout discrete mathematics and computer science. In logic, the truth values of n propositions form a power set. In database theory, the set of all possible query combinations over n attributes is a power set. In machine learning, feature subset selection enumerates subsets of n features, motivating greedy search rather than brute force when n is large. In topology, a power set with certain operations forms a Boolean algebra. The exponential growth of 2^n is why algorithms that iterate over all subsets are only practical for small n: a set of 30 elements has over a billion subsets.
Power set size for common n values
| n (elements) | Power set size (2^n) | Proper subsets (2^n - 1) |
|---|---|---|
| 0 | 1 | 0 |
| 1 | 2 | 1 |
| 2 | 4 | 3 |
| 3 | 8 | 7 |
| 4 | 16 | 15 |
| 5 | 32 | 31 |
| 6 | 64 | 63 |
| 7 | 128 | 127 |
| 8 | 256 | 255 |
| 9 | 512 | 511 |
| 10 | 1024 | 1023 |
Each additional element doubles the number of subsets. The empty set is always included.
Frequently asked questions
What is the power set of the empty set?
The power set of the empty set contains exactly one element: the empty set itself. So P({}) = {{}}. Although the original set has 0 elements, its power set is not empty - it has 1 member. This is consistent with the formula: 2^0 = 1.
How many subsets does a set with 4 elements have?
A 4-element set has 2^4 = 16 subsets in total. These break down as: 1 subset with 0 elements (the empty set), 4 subsets with 1 element, 6 subsets with 2 elements, 4 subsets with 3 elements, and 1 subset with all 4 elements. The count at each level follows the binomial coefficients C(4,0) through C(4,4).
What is the difference between a subset and a proper subset?
A subset of A can be any collection of elements from A, including A itself and the empty set. A proper subset must be strictly smaller than A - it cannot equal A. So a set with n elements has 2^n subsets in total, but only 2^n - 1 proper subsets, because the set itself is excluded.
Can a power set contain duplicate elements?
No. A set by definition contains distinct elements, so duplicates in your input are treated as a single element. If you enter {1, 2, 2, 3}, the calculator treats it as {1, 2, 3} with n = 3, giving 8 subsets rather than 16. This calculator deduplicates your input automatically.
Why does the subset count double each time I add one element?
Each new element can either be included or excluded from any existing subset, effectively creating two copies of every previously existing subset: one without the new element (all the old subsets) and one with it. That doubling is why the formula is 2^n rather than, say, n^2 or n!.
How do I list all subsets of a set by hand?
Label each element with a position (bit). For a 3-element set {a, b, c}, write binary numbers from 000 to 111 (that is 0 to 7). Each bit position corresponds to one element: 1 means include it, 0 means exclude it. So 101 corresponds to the subset {a, c}. This systematic approach guarantees you list every subset exactly once and covers all 2^n possibilities.