Equal sets

Two lists that look completely different on paper can still be the exact same set. "The letters in ALLOY" and "the letters in LOYAL" are spelled differently, repeat letters a different number of times, and are written in a different order — yet as sets they are identical, because a set only cares which elements are in it, never how many times they were mentioned or in what sequence. That single idea is what CBSE Class 11 calls equal sets, and it sits right after finite and infinite sets in the "Sets" chapter, feeding directly into subsets. This article gives the formal double-inclusion definition of set equality, shows why counting elements is not enough to prove two sets are equal, and walks through the two classic exam patterns: solving a set-builder condition down to a roster, and comparing sets built from the letters of a word. By the end you should be able to test any pair of sets — however they are described — for equality with confidence.

The core insight

Two sets $A$ and $B$ are equal exactly when every element of $A$ lies in $B$ and every element of $B$ lies in $A$ , so equal sets always have the same size but sets of the same size need not be equal.

The core idea

A set is fully described by its membership, nothing else. Order of listing, how many times an element is mentioned, and the particular words used to describe the condition are all irrelevant — only which objects belong matters. Set equality makes this precise.

The double-inclusion definition. Sets $A$ and $B$ are equal, written $A = B$ , when each is a subset of the other:

A = B \iff A \subseteq B \text{ and } B \subseteq A

where: $A \subseteq B$ means every element of $A$ is also an element of $B$ , and $B \subseteq A$ means the reverse. Requiring both directions together is what rules out one set merely containing the other without being identical to it.

Repetition and order never matter. Because a set is just a membership test, the following three descriptions are all the same set:

\{1, 2, 3\} = \{3, 1, 2\} = \{1, 1, 2, 3, 3\}

Listing an element twice, or in a different position, changes nothing about which set is being described.

Size is necessary but not sufficient. If $A = B$ , then certainly $n(A) = n(B)$ — equal sets have the same cardinal number. But the converse fails: $\{1, 2\}$ and $\{3, 4\}$ both have exactly two elements, yet they share nothing and are not equal. Matching sizes is only a first, weak check; the real test is matching elements.

Equality chains like ordinary equality. If $A = B$ and $A = C$ , then $B = C$ as well. This lets you resolve a chain of claimed equalities in a single sweep rather than re-checking every pair separately, which matters when a question strings together several set-builder or roster descriptions.

Figure

Two overlapping outlines drawn on top of each other showing that set A and set B enclose exactly the same points, illustrating that equal sets are two descriptions of one identical collection

Equality is most useful when two sets arrive in different forms — one as a set-builder condition, one as a roster, or both as word conditions — and you must decide if they secretly describe the same collection. The safe method is always the same: simplify each description down to an explicit roster (solving any equation or inequality, or listing distinct letters), then compare element by element. Comparing two unsimplified descriptions "by eye" is the single most common source of error, since very differently worded conditions can still define identical sets.

Derivation AWhy matching elements both ways is the correct test for set equality

The goal is to show, using nothing beyond the definition of a subset, that the double-inclusion condition $A \subseteq B \text{ and } B \subseteq A$ is exactly equivalent to the intuitive idea that $A$ and $B$ "contain the same elements," so that checking two inclusions is a fully reliable way to prove or disprove equality of any two sets, however they are described.

Step 1. Suppose $A$ and $B$ contain exactly the same elements — this is what we mean intuitively by "equal." Take any element $x \in A$ . Since $A$ and $B$ have the same elements, $x$ must also belong to $B$ . As $x$ was an arbitrary element of $A$ , this shows every element of $A$ lies in $B$ , which is precisely the statement $A \subseteq B$ .

Step 2. Run the identical argument the other way. Take any $y \in B$ . Since $A$ and $B$ have the same elements, $y \in A$ too. Because $y$ was arbitrary, every element of $B$ lies in $A$ , giving $B \subseteq A$ . Together, Step 1 and Step 2 give both inclusions.

Step 3. Now go the other direction: assume both $A \subseteq B$ and $B \subseteq A$ hold, and show the sets must have the same elements. Pick any element $z$ . If $z \in A$ , then $A \subseteq B$ forces $z \in B$ . If instead $z \in B$ , then $B \subseteq A$ forces $z \in A$ . So $z$ belongs to $A$ exactly when it belongs to $B$ — the two sets accept and reject exactly the same elements.

Step 4. Steps 1–2 prove "same elements implies both inclusions," and Step 3 proves "both inclusions imply same elements." The two statements are therefore logically equivalent, which is why $A = B \iff A \subseteq B \text{ and } B \subseteq A$ is a safe, complete definition — checking it never misses a case, whether the sets are given as rosters, set-builder conditions, or word-letter lists.

Worked example

Are the sets $A = \{x : x \in \mathbb{N}, \; x^2 = x\}$ and $B = \{1\}$ equal? Then check $C$ = the distinct letters of "LOYAL" against $D$ = the distinct letters of "ALLOY."

Step 1. Solve the condition defining $A$ . Rearranging $x^2 = x$ gives $x^2 - x = 0$ , so $x(x - 1) = 0$ , meaning $x = 0$ or $x = 1$ .

Step 2. Apply the domain restriction. Under the NCERT convention $\mathbb{N} = \{1, 2, 3, \dots\}$ , so $x = 0$ is excluded and only $x = 1$ survives. Hence $A = \{1\}$ .

Step 3. Compare with $B = \{1\}$ by the double-inclusion test: the single element of $A$ is $1$ , which is in $B$ , so $A \subseteq B$ ; the single element of $B$ is $1$ , which is in $A$ , so $B \subseteq A$ . Both hold, so

A = B

Step 4. Now the word example. Writing out "LOYAL" gives letters L, O, Y, A, L, and removing the repeated L leaves $C = \{L, O, Y, A\}$ . Writing out "ALLOY" gives A, L, L, O, Y, and removing repeats leaves $D = \{A, L, O, Y\}$ . Every letter in $C$ appears in $D$ and every letter in $D$ appears in $C$ , so $C = D$ — even though the words themselves look different and repeat letters a different number of times. Final answer: $A = B = \{1\}$ , and $C = D = \{A, L, O, Y\}$ .

Competitive stretch

Are $E = \{x : x \in \mathbb{Z}, \; x^2 - 3x + 2 = 0\}$ and $F = \{1, 2\}$ equal? Factor the quadratic: $x^2 - 3x + 2 = (x-1)(x-2) = 0$ , so $x = 1$ or $x = 2$ , giving $E = \{1, 2\}$ . Comparing element by element with $F = \{1, 2\}$ , both inclusions hold, so $E = F$ . The pattern generalizes: any polynomial condition should first be solved to an explicit root list before it is compared to a given roster set.

Common traps

Assuming equal cardinal numbers, $n(A) = n(B)$ , prove equality — they only prove the sets are the same size, never that they share elements. $\{1,2\}$ and $\{3,4\}$ are the standard counterexample.
Treating order or repetition in a listing as meaningful — $\{a, b, c\}$ , $\{c, b, a\}$ and $\{a, a, b, c\}$ are all the identical set.
Forgetting to strip duplicate letters or digits before comparing sets built from words or numbers, which silently inflates the apparent size of one side.
Comparing two set-builder descriptions without first solving them down to an explicit roster — two very different-looking conditions can define the same set, or two similar-looking ones can differ.
Confusing equality (every element shared, both directions) with partial overlap, where some but not all elements match — partial overlap always means $A \ne B$ .

Ask the tutor: Try writing two set-builder conditions of your own and ask the AI tutor to check whether they define equal sets.

If two sets both have 3 elements, are they automatically equal?

No. Having the same cardinal number only means the sets are the same size, not that they contain the same objects. For example $\{1, 2, 3\}$ and $\{4, 5, 6\}$ each have three elements but share none of them, so they are not equal. To confirm equality you must check that every element of one set appears in the other, in both directions — size alone never settles it.

Do I need to check both A is a subset of B and B is a subset of A, or is one direction enough?

Both directions are required. Checking only $A \subseteq B$ tells you $A$ is contained in $B$ , but $B$ could still have extra elements $A$ lacks — for instance $A = \{1, 2\}$ and $B = \{1, 2, 3\}$ satisfy $A \subseteq B$ but are not equal. Only when both inclusions hold simultaneously are you guaranteed the sets share exactly the same elements with nothing extra on either side.

How should I compare two set-builder descriptions that look completely different?

Solve each condition down to an explicit roster first, then compare the rosters element by element — never compare the raw conditions "by eye." For example $\{x : x \in \mathbb{N}, x^2 = x\}$ looks nothing like $\{1\}$ until you solve the equation and apply the domain restriction, after which both sides reduce to the same single element. This solve-then-compare habit is the safest way to avoid missing a hidden equality or wrongly assuming one.

Equal sets

The core idea

Worked example

Competitive stretch

Common traps

Before this

Where this leads