Subsets

Ask whether one collection of things is fully contained inside another, and you are asking the single question this article answers: is $A$ a subset of $B$ ? Every element of $A$ must show up in $B$ — nothing more, nothing less. It sounds trivial, but this one relation, $A \subseteq B$ , is the quiet workhorse behind set equality, interval notation, and eventually the domains and ranges of functions. This topic sits right after equal sets in the CBSE Class 11 chapter "Sets," and it hands you three tools: testing $A \subseteq B$ for two given sets, telling a plain subset apart from a proper subset, and counting how many subsets a finite set has — the power set. We stay entirely within what the syllabus expects: no deep power-set theory, just the count $2^{n(A)}$ and the idea behind it.

The core insight

$A \subseteq B$ means every element of $A$ is also an element of $B$ , and a finite set with $n$ elements has exactly $2^n$ subsets because each element independently is either included or excluded.

The core idea

Subset. $A$ is a subset of $B$ , written $A \subseteq B$ , if every $x \in A$ also satisfies $x \in B$ . Symbolically:

A \subseteq B \iff \big(x \in A \implies x \in B \text{ for all } x\big)

where: $x$ ranges over every element under discussion, and the implication must hold for all such $x$ — a single element of $A$ missing from $B$ is enough to make $A \not\subseteq B$ . Two facts follow immediately from the definition and are worth memorising outright:

Every set is a subset of itself: $A \subseteq A$ (the implication $x \in A \implies x \in A$ is trivially true).
The empty set is a subset of every set: $\varnothing \subseteq A$ (there is no element of $\varnothing$ to violate the condition, so it holds vacuously).

Proper subset. $A$ is a proper subset of $B$ , written $A \subsetneq B$ , if $A \subseteq B$ and $A \ne B$ — that is, $B$ has at least one element $A$ does not. Every set is a subset of itself but never a proper subset of itself, and if $A \subseteq B$ and $B \subseteq A$ both hold, then $A = B$ : this is exactly the antisymmetry that defines set equality.

Transitivity. If $A \subseteq B$ and $B \subseteq C$ , then $A \subseteq C$ . Every element of $A$ lands in $B$ , and every element of $B$ lands in $C$ , so every element of $A$ lands in $C$ — a chain of subset relations can be linked without re-checking each element from scratch.

Figure

A Venn diagram showing set A drawn entirely inside a larger set B, illustrating that every point of A lies within B

Power set. For a finite set $A$ with $n(A) = m$ , the collection of all subsets of $A$ — including $\varnothing$ and $A$ itself — is the power set $P(A)$ :

P(A) = \{S : S \subseteq A\}, \qquad n(P(A)) = 2^{n(A)}

where: $n(A)$ is the number of elements in $A$ , and $n(P(A))$ counts the subsets, not their elements. The syllabus keeps the power set to this one fact — the count $2^{n(A)}$ — rather than a deep exploration of its structure.

Derivation AWhy a set with n elements has exactly 2 to the n subsets

The goal is to explain, from the plain act of building a subset one element at a time, why a finite set $A$ with $n(A) = m$ elements has exactly $2^m$ subsets in total — including the empty set and $A$ itself — and to connect that count to the everyday process of listing subsets by hand for a small set like $\{1,2,3\}$ .

Step 1. Line up the elements of $A$ in some fixed order, say $a_1, a_2, \dots, a_m$ . Building any subset $S \subseteq A$ is exactly the same as making $m$ independent yes-or-no decisions: for each element $a_i$ , decide "include $a_i$ in $S$ " or "leave $a_i$ out of $S$ ." No other choice is possible, and every combination of choices produces a valid subset.

Step 2. Count the outcomes using the multiplication principle. The first element has $2$ choices (in or out), the second element independently has $2$ choices, and so on through the $m$ -th element. Since each decision is made freely and independently of the others, the total number of ways to make all $m$ decisions is $2 \times 2 \times \cdots \times 2$ ( $m$ factors), which is $2^m$ .

Step 3. Check the extreme cases to make sure the count is sensible. Choosing "out" for every element gives $S = \varnothing$ — one specific outcome among the $2^m$ , confirming $\varnothing \subseteq A$ always. Choosing "in" for every element gives $S = A$ itself — another single outcome, confirming $A \subseteq A$ always. Both extremes are counted automatically inside the $2^m$ total, with no special-casing needed.

Step 4. Conclude: $n(P(A)) = 2^{n(A)} = 2^m$ . This single formula is the only power-set fact the syllabus expects — it is a direct consequence of counting independent include/exclude choices, not a separate rule to memorise blindly.

Worked example

Let $A = \{1, 2, 3\}$ and $B = \{1, 2, 3, 4, 5\}$ . Is $A \subseteq B$ ? Is it a proper subset? List $P(A)$ .

Step 1. Check each element of $A$ against $B$ : $1 \in B$ , $2 \in B$ , $3 \in B$ . Every element of $A$ is found in $B$ , so $A \subseteq B$ .

Step 2. Since $B$ contains elements ( $4$ and $5$ ) that are not in $A$ , $A \ne B$ . Combined with $A \subseteq B$ , this gives $A \subsetneq B$ — $A$ is a proper subset of $B$ .

Step 3. For the power set, $n(A) = 3$ , so by the derivation above $n(P(A)) = 2^3 = 8$ . Listing all $8$ subsets by running through the include/exclude choices for $1$ , $2$ , $3$ :

P(A) = \{\varnothing, \{1\}, \{2\}, \{3\}, \{1,2\}, \{1,3\}, \{2,3\}, \{1,2,3\}\}

Answer: $A \subsetneq B$ , and $P(A)$ has $8$ elements as listed above.

Competitive stretch

Let $C = \{x : x \in \mathbb{N}, \; x \text{ is even}\}$ and $D = \{x : x \in \mathbb{N}, \; x \text{ is a multiple of } 4\}$ . Which is a subset of which?

Step 1. Write a few elements of each: $C = \{2, 4, 6, 8, 10, 12, \dots\}$ , $D = \{4, 8, 12, 16, \dots\}$ .

Step 2. Test $D \subseteq C$ : take any element of $D$ , say $4k$ for a natural number $k$ . Since $4k = 2(2k)$ , it is always even, so $4k \in C$ . This holds for every element of $D$ , so $D \subseteq C$ .

Step 3. Test $C \subseteq D$ : take $2 \in C$ . Is $2 \in D$ ? No, $2$ is not a multiple of $4$ . So $C \not\subseteq D$ . Answer: $D \subsetneq C$ , but $C$ is not a subset of $D$ — infinite sets can still have a one-directional subset relation.

Common traps

Confusing $\in$ (element-to-set) with $\subseteq$ (set-to-set) — writing $2 \subseteq \{1,2,3\}$ instead of the correct $2 \in \{1,2,3\}$ or $\{2\} \subseteq \{1,2,3\}$ .
Forgetting that $\varnothing$ and $A$ itself both count as subsets of $A$ when listing $P(A)$ , or missing them when counting by hand.
Assuming $A \subseteq B$ automatically means $A \subsetneq B$ — proper subset additionally requires $A \ne B$ .
Believing the subset relation must go "one way" between any two sets — two sets can be incomparable, with neither a subset of the other.

Ask the tutor: Want to practice listing a power set for a 4- or 5-element set, or work through another pair of infinite sets to test which is a subset of which?

Is the empty set really a subset of every set, even itself?

Yes. The definition of $A \subseteq B$ only fails if some element of $A$ is missing from $B$ . The empty set has no elements at all, so there is nothing that could ever fail the test — the condition holds vacuously, for any $B$ whatsoever, including $B = \varnothing$ . That is why $\varnothing \subseteq A$ is listed as a fact you can quote directly, without checking anything.

Why does a set with n elements have 2 to the n subsets and not something else?

Because building a subset is $n$ independent yes-or-no decisions, one per element: include it or leave it out. Each decision has $2$ outcomes, and the decisions do not affect each other, so by the multiplication principle the total number of ways to make all $n$ decisions — and hence the total number of subsets — is $2 \times 2 \times \cdots \times 2$ , or $2^n$ . It is the same counting logic as flipping $n$ coins and counting the possible outcome sequences.

Can two sets be neither a subset of the other, and how do I recognise that?

Yes, this happens whenever each set has at least one element the other lacks. Take $A = \{1,2\}$ and $B = \{2,3\}$ : $1 \in A$ but $1 \notin B$ , so $A \not\subseteq B$ ; and $3 \in B$ but $3 \notin A$ , so $B \not\subseteq A$ . Neither containment holds, and the sets are called incomparable. To check, always test both directions separately — do not assume that failing $A \subseteq B$ means $B \subseteq A$ must hold instead.

Subsets

The core idea

Worked example

Competitive stretch

Common traps

Before this

Where this leads