What Is a Superset?
A set $B$ is a superset of a set $A$ if $B$ contains every element of $A$. Written in symbols, $B \supseteq A$, read "$B$ is a superset of $A$" or "$B$ contains $A$."
Superset and subset are two views of the same fact. Saying $B \supseteq A$ (B is a superset of A) is exactly the same as saying $A \subseteq B$ (A is a subset of B). Nothing changes about the sets — only which one you name first.
Superset symbol: $\supseteq$ means "superset of or equal to"; $\supset$ means "proper (strict) superset of."
Proper vs Improper Superset
The two superset symbols mark a real difference, and it is the same distinction as $\geq$ versus $>$ for numbers.
An improper superset uses $\supseteq$ and allows equality. $B \supseteq A$ is true even when $B$ and $A$ are the same set. Every set is an improper superset of itself: $A \supseteq A$.
A proper (strict) superset uses $\supset$ and forbids equality. $B \supset A$ requires $B$ to contain every element of $A$ and at least one extra element that $A$ does not have, so $B$ is strictly larger.
Relationship | Symbol | Equality allowed? | Meaning |
|---|---|---|---|
Improper superset | $B \supseteq A$ | Yes | $B$ contains all of $A$, possibly equal |
Proper superset | $B \supset A$ | No | $B$ contains all of $A$ and is strictly larger |
For example, $\{1, 2, 3\} \supseteq \{1, 2, 3\}$ is true (improper), but $\{1, 2, 3\} \supset \{1, 2, 3\}$ is false, because the two sets are equal and neither has an extra element.
Examples of Superset
The examples build from checking the relationship to counting proper supersets.
Example 1
If $A = {1, 2}$ and $B = {1, 2, 3, 4}$, is $B$ a superset of $A$?
Check every element of $A$. $1 \in B$? Yes. $2 \in B$? Yes.
Every element of $A$ is in $B$, so $B \supseteq A$. $B$ is a superset of $A$.
Example 2
A student sees $A = {1, 2, 3}$ and $B = {1, 2}$ and writes $A \supseteq B$ and also $B \supseteq A$. Are both correct?
Take the tempting path first.
The student reasons that supersets go "both ways," the same way "$A$ is next to $B$" means "$B$ is next to $A$."
Watch it break. For $B \supseteq A$ to hold, every element of $A$ must be in $B$. But $3 \in A$ and $3 \notin B$, so $B$ is missing an element of $A$. That claim fails.
The correct way: check direction by direction. Every element of $B$ ($1$ and $2$) is in $A$, so $A \supseteq B$ is true. But $B \supseteq A$ is false. Superset is a one-directional claim unless the sets are equal.
Example 3
If $A = {1, 2, 3}$ and $B = {1, 2, 3}$, is $B$ a superset of $A$?
Every element of $A$ is in $B$ (they are identical). So $B \supseteq A$ is true.
Because $A = B$, this is an improper superset: $B \supseteq A$ holds, but $B \supset A$ (proper) does not.
Example 4
Is the set of natural numbers $\mathbb{N}$ a superset of the set of even numbers $E = {2, 4, 6, \dots}$?
Every even number is a natural number. So every element of $E$ is in $\mathbb{N}$.
$\mathbb{N} \supseteq E$, and since $\mathbb{N}$ contains odd numbers too, $\mathbb{N} \supset E$ (a proper superset).
Example 5
How many supersets does $A = {1}$ have inside the universal set $U = {1, 2, 3}$?
A superset of $A$ must contain $1$ and may contain any combination of the remaining elements ${2, 3}$. There are $2$ leftover elements, each in or out: $2^2 = 4$ choices.
The supersets are ${1}, {1,2}, {1,3}, {1,2,3}$: that is 4 supersets within $U$.
Example 6
Is every set a superset of the empty set $\varnothing$?
The empty set has no elements to check. So the condition "every element of $\varnothing$ is in $B$" is satisfied automatically (vacuously).
Yes — every set is a superset of the empty set. And every set is a superset of itself.
Why the Superset Idea Matters
The superset relation is the backbone of how mathematics organises "bigger" and "smaller" collections — and it is quieter but more fundamental than it first looks.
Number systems nest as supersets. The reals are a superset of the rationals, which are a superset of the integers, which are a superset of the naturals: $\mathbb{R} \supseteq \mathbb{Q} \supseteq \mathbb{Z} \supseteq \mathbb{N}$. That single chain of superset relations organises all of number theory.
The universal set is the ultimate superset. In any problem, the universal set $U$ is a superset of every set under discussion — that is what makes it "universal."
Supersets have no upper limit. Any set has infinitely many supersets, because you can always add one more element and get a larger one. Subsets, by contrast, are limited — you can only remove elements you already have.
The asymmetry between subset (bounded below by $\varnothing$) and superset (unbounded above) is why the two words, though describing one relationship, are not interchangeable in a proof.
Properties of Supersets
These rules capture how the superset relation behaves, and each one falls straight out of the definition "contains every element of."
Reflexive: every set is a superset of itself, $A \supseteq A$ (an improper superset).
Superset of the empty set: every set is a superset of $\varnothing$, because $\varnothing$ has no element that could fail the test.
Transitive: if $A \supseteq B$ and $B \supseteq C$, then $A \supseteq C$.
Antisymmetric: if $A \supseteq B$ and $B \supseteq A$, then $A = B$.
Mirror of subset: $B \supseteq A$ holds exactly when $A \subseteq B$ — the same fact read from the other end.
Unbounded count: every set has infinitely many supersets, since you can always add one more element.
Counting within a universe: in a universal set of $n$ elements, a set of $k$ elements has $2^{\,n-k}$ supersets.
Where Supersets Trip Students Up
Mistake 1: Reading the symbol backwards
Where it slips in: $\subseteq$ and $\supseteq$ look like mirror images, and under time pressure the mouth opens toward the wrong set.
Don't do this: Write $A \supseteq B$ when you mean "$A$ is contained in $B$."
The correct way: The open side of the symbol faces the larger set. In $B \supseteq A$, the open mouth faces $B$, so $B$ is the bigger (super) set. The reader who pictures the symbol "eating" the larger collection stops flipping it; the memorizer who learned it as a shape without meaning keeps guessing.
Mistake 2: Assuming superset means strictly bigger
Where it slips in: The prefix "super-" suggests "more than," so equality feels excluded.
Don't do this: Claim $B \supseteq A$ is false when $A = B$.
The correct way: $\supseteq$ allows equality (improper superset); only $\supset$ demands the superset be strictly larger (proper superset). This is the same confusion between $\geq$ and $>$, moved from numbers to sets — and it is the most common source of wrong answers on the topic.
Mistake 3: Forgetting the empty-set case
Where it slips in: "Every set is a superset of $\varnothing$" feels like it can't be true because $\varnothing$ has nothing in it.
Don't do this: Say $\varnothing$ has no superset because it is empty.
The correct way: The condition holds vacuously — there is no element of $\varnothing$ that could fail the test.
Conclusion
A superset $B \supseteq A$ contains every element of $A$; it is subset read from the other end.
The symbol $\supseteq$ allows equality; $\supset$ marks a strict (proper) superset.
Every set is a superset of itself and of the empty set.
Number systems nest as a superset chain: $\mathbb{R} \supseteq \mathbb{Q} \supseteq \mathbb{Z} \supseteq \mathbb{N}$.
The open side of the symbol always faces the larger set — a quick check against reading it backwards.
To take the superset relation further with a teacher, explore Bhanzu's algebra tutor, help with algebra, or math classes online. Want to work through set theory with a live trainer? Book a free demo class.
Now try these: with $U = {1,2,3,4}$, decide whether ${1,2,3,4} \supseteq {2,3}$, whether ${2,3} \supset {2,3}$, and how many supersets ${4}$ has in $U$. If the symbol direction slips, return to Mistake 1.
Read More
Was this article helpful?
Your feedback helps us write better content