Subset Calculator
Generate all subsets of a set, count total and proper subsets, and view subsets by size with step-by-step combinatorics.
What Is a Subset?
A set $A$ is a subset of a set $B$ if every element of $A$ is also an element of $B$. We write $A \subseteq B$ when $A$ may equal $B$, and $A \subsetneq B$ (or $A \subset B$) when $A$ is a proper subset, meaning $A \subseteq B$ but $A \neq B$.
The empty set $\emptyset$ is a subset of every set. Every set is also a subset of itself, but not a proper subset of itself.
How Many Subsets Does a Set Have?
If a finite set $S$ has $n$ elements, the total number of subsets is:
$$| \text{subsets of } S | = 2^n$$
Each element is independently either included or excluded, giving two choices per element and $2^n$ combinations overall.
The number of proper subsets excludes the set itself:
$$| \text{proper subsets} | = 2^n - 1$$
Subsets by Size and Binomial Coefficients
The number of subsets of $S$ with exactly $k$ elements is the binomial coefficient:
$$\binom{n}{k} = \frac{n!}{k!(n-k)!}$$
Summing over all sizes from $0$ to $n$ reproduces $2^n$ via the binomial theorem. For example, a 4-element set has subset counts $1, 4, 6, 4, 1$ by size.
Related tools: Power Set Calculator, Binomial Coefficient Calculator, and Combinations Permutations Calculator.
Frequently Asked Questions
Is the empty set a subset of every set?
Yes. A subset must contain only elements from the parent set. Since $\emptyset$ has no elements, the condition is vacuously true for any set $B$.
What is the difference between a subset and a proper subset?
A subset $A$ of $B$ may equal $B$. A proper subset must be strictly smaller: $A \subseteq B$ and $A \neq B$. Every set has exactly one more subset than proper subsets.
How many subsets does a set with 10 elements have?
A 10-element set has $2^{10} = 1{,}024$ subsets and $1{,}023$ proper subsets.
How is a subset different from a power set?
A subset is one collection of elements taken from a set. The power set is the set of all possible subsets. If $|S| = n$, then $|\mathcal{P}(S)| = 2^n$.