Subsets — Definition, Types, Examples

A Container Inside a Container

Sets are the foundation of modern mathematics. Subsets are how sets relate to each other. Almost every theorem in set theory, probability, and logic is a statement about whether one collection sits inside another.

Recognising a subset is the entry point into every later set-theoretic topic. Once a student knows how to spot a subset, the union, intersection, complement, and power set follow naturally.

What a Subset Is

A set $B$ is a subset of a set $A$ — written $B \subseteq A$ — if every element of $B$ is also an element of $A$.

$$B \subseteq A \iff (\forall x)(x \in B \implies x \in A).$$

Two key edge cases:

• The empty set is a subset of every set. $\emptyset \subseteq A$ for any $A$. (Vacuously true — there are no elements in $\emptyset$ to check.)

• Every set is a subset of itself. $A \subseteq A$. (Every element of $A$ is in $A$.)

Quick facts:

• Symbol: $\subseteq$ (subset, possibly equal). $\subset$ (proper subset, strictly smaller).

• Empty set: $\emptyset$ is a subset of every set.

• Self-subset: every set is a subset of itself.

• Number of subsets: an $n$-element set has $2^n$ subsets.

• Number of proper subsets: $2^n - 1$ (exclude the set itself).

• Grade introduced: CBSE Class 11 (sets); CCSS-M HSS-CP.A.1 (events as subsets of sample space); NCERT Class 11 Chapter 1 — Sets.

Types of Subsets

Proper subset ($\subset$). A subset that is not equal to the original set. ${1, 2} \subset {1, 2, 3}$ — every element of the first is in the second, but the second has an extra element.

Improper subset ($=$, sometimes written $\subseteq$ to emphasise the equality case). The set itself. Every set has exactly one improper subset: itself.

Empty subset ($\emptyset \subset A$). The empty set is a (proper) subset of every non-empty set.

Power set ($\mathcal{P}(A)$). The set of all subsets of $A$. If $A$ has $n$ elements, $\mathcal{P}(A)$ has $2^n$ elements.

Worked Examples of Subsets

Quick. List all subsets of $A = {1, 2}$.

The subsets are: $\emptyset, {1}, {2}, {1, 2}$.

Final answer: four subsets. Confirms the formula: $2^2 = 4$.

Standard (Wrong Path First — Where Students Lose the Mark). How many proper subsets does ${a, b, c, d}$ have?

The wrong path. The memorizer recalls "$2^n$ subsets" and computes $2^4 = 16$. They report 16 proper subsets.

The flaw: $2^n$ counts all subsets, including the set itself. A proper subset excludes the set itself.

The rescue. Total subsets: $2^4 = 16$. Proper subsets exclude the original set: $16 - 1 = 15$.

Final answer: 15 proper subsets.

Stretch. Find the power set of $A = {x, y, z}$.

Systematically list all subsets by size.

• Size 0: $\emptyset$.

• Size 1: ${x}, {y}, {z}$.

• Size 2: ${x, y}, {x, z}, {y, z}$.

• Size 3: ${x, y, z}$.

$$\mathcal{P}(A) = {\emptyset, {x}, {y}, {z}, {x, y}, {x, z}, {y, z}, {x, y, z}}.$$

Final answer: $\mathcal{P}(A)$ has $2^3 = 8$ elements.

Why Subsets Matter — From Probability to Database Queries

Subsets are not just a vocabulary item. They are a load-bearing concept in every quantitative field.

• Probability. An event is a subset of the sample space. "Rolling an even number" is the subset ${2, 4, 6}$ of the die's sample space ${1, 2, 3, 4, 5, 6}$.

• Combinatorics. "Choosing $k$ items from $n$" is counting the $k$-element subsets of an $n$-element set. The binomial coefficient $\binom{n}{k}$ counts these.

• Database queries. A SQL SELECT returns a subset of rows from a table — the rows satisfying the WHERE clause.

• Logic. "All cats are mammals" is the statement that the set of cats is a subset of the set of mammals.

• Topology. Open sets, closed sets, neighbourhoods — all defined as specific kinds of subsets.

The destination, in every direction: any time you describe "a part of" something, the subset is the formal name for that part.

Subsets Mistakes Students Make Most Often

1. Confusing proper and improper subsets.

Where it slips in: Asked for "proper subsets," the student includes the set itself.

Don't do this: Count the set itself as a proper subset.

The correct way: A proper subset is strictly smaller than the original set. The original set is an improper subset of itself.

2. Forgetting the empty set.

Where it slips in: Listing the subsets of ${a, b}$, the student writes ${a}, {b}, {a, b}$ — three, not four.

Don't do this: Skip the empty set.

The correct way: $\emptyset$ is a subset of every set. Always include it in the count.

3. Confusing "is a subset of" with "is an element of."

Where it slips in: $1 \subseteq {1, 2}$ — student writes this, mixing $\in$ and $\subseteq$.

Don't do this: Use $\subseteq$ between an element and a set.

The correct way: $1 \in {1, 2}$ (element). ${1} \subseteq {1, 2}$ (subset). The difference is the curly braces around the 1.

4. Treating ${ \emptyset }$ as the empty set.

Where it slips in: ${ \emptyset }$ — student calls this empty.

Don't do this: Confuse "the set containing the empty set" with "the empty set."

The correct way: ${ \emptyset }$ has one element (the empty set is its only element). The empty set $\emptyset$ has zero elements.

The real-world version. In 1903, Bertrand Russell discovered the paradox now bearing his name: "consider the set of all sets that do not contain themselves as a subset." If such a set $R$ contains itself, then by definition it doesn't; if it doesn't, then by definition it does.

The contradiction shattered the foundation of naive set theory and forced the axiomatic reconstruction (ZFC) that underlies modern mathematics. The subset definition you are learning is part of the rebuild — careful enough to avoid Russell's paradox.

The Mathematicians Who Built Set Theory

Georg Cantor (1845–1918, Germany) founded set theory in the 1870s, including the formal subset definition and the proof that the power set $\mathcal{P}(A)$ is always strictly larger than $A$ — Cantor's theorem.

Bertrand Russell (1872–1970, England) discovered the paradox that exposed the gap in naive set theory in 1903, forcing the development of axiomatic set theory.

Ernst Zermelo (1871–1953, Germany) built the first axiomatic set theory in 1908, fixing Russell's paradox and giving the subset definition the rigorous foundation it needed.

Conclusion

• A subset $B \subseteq A$ contains only elements that are also in $A$.

• The empty set is a subset of every set; every set is a subset of itself.

• The number of subsets of an $n$-element set is $2^n$; the number of proper subsets is $2^n - 1$.

• The single most common mistake is conflating subsets with elements, or counting the set itself as a proper subset.

• Subsets are the foundation for probability, combinatorics, database theory, and modern logic.

Practice These Three Before Moving On

1. List all subsets of ${a, b, c}$. There should be $2^3 = 8$.

2. How many proper subsets does a set with 5 elements have?

3. Is ${2, 4}$ a subset of ${1, 2, 3, 4, 5}$? Is it a proper subset?

Want a live Bhanzu trainer to walk through more subset problems? Book a free demo class — online globally.