What Are Equal Sets?
Equal sets are two or more sets that contain exactly the same elements, with nothing in one that is missing from the other. A set is a collection of distinct objects, and two sets count as equal only when their collections match member for member. The order the elements are written in does not matter, and neither does how many times an element is repeated.
Take $A = {1, 2, 3}$ and $B = {3, 2, 1}$. Every element of $A$ appears in $B$, and every element of $B$ appears in $A$, so the two describe the same collection. We write this as $A = B$.
Compare that with $C = {1, 2, 3}$ and $D = {1, 2, 4}$. Here $3$ is in $C$ but not in $D$, and $4$ is in $D$ but not in $C$. One mismatch is enough, so $C$ and $D$ are not equal.
What Is The Symbol For Equal Sets?
The symbol for equal sets is the ordinary equals sign, $=$, placed between the two set names: $A = B$ reads "set $A$ is equal to set $B$." When the sets are not equal, the symbol is $\neq$, so $A \neq B$ reads "$A$ is not equal to $B$."
Sets written with the not-equal sign are often called unequal sets. They fail the match in at least one place:
$${5, 6, 7} \neq {5, 6, 8}$$
The two sets above disagree on a single element, and that single disagreement is all it takes. Set equality is strict: there is no "almost equal." Either every element lines up both ways, or the sets are unequal.
What Are Some Examples Of Equal Sets?
The clearest way to feel the definition is to see it pass and fail on real collections. In each pair below, the test is the same: does every element of the first set sit inside the second, and every element of the second sit inside the first?
${a, e, i, o, u} = {u, o, i, e, a}$. Same five vowels, different order. Equal.
${2, 4, 6, 8} = {8, 6, 4, 2}$. Same four even numbers. Equal.
${1, 2, 2, 3} = {1, 2, 3}$. The repeated $2$ is still just the element $2$, counted once. Equal.
${1, 2, 3} \neq {1, 2, 3, 4}$. The second set has an extra element, $4$. Not equal.
${c, a, t} = {t, a, c}$. Same three letters. Equal, even though one spells a word and the other does not, because a set does not care about arrangement.
Two of those pairs are worth a second look. The order swap (${a, e, i, o, u}$ against ${u, o, i, e, a}$) and the repeat (${1, 2, 2, 3}$ against ${1, 2, 3}$) are the two cases students most often misread, and both come out equal.
How Do You Prove Two Sets Are Equal?
To prove two sets are equal, show that each is a subset of the other: prove $A \subseteq B$ and prove $B \subseteq A$. If both hold, then $A = B$. This two-way check is the formal version of "every element matches both ways," and it is the method that survives when the sets are described by a rule rather than listed out.
Example 1: Prove that $A = B$, where $A = {x : x \text{ is a solution of } x^{2} - 5x + 6 = 0}$ and $B = {2, 3}$.
First find the elements of $A$ by solving the equation:
$$x^{2} - 5x + 6 = 0$$
$$(x - 2)(x - 3) = 0$$
$$x = 2 \quad \text{or} \quad x = 3$$
So the described set is $A = {2, 3}$. Now run the two-way check against a subset in each direction:
$A \subseteq B$: the elements of $A$ are $2$ and $3$, and both belong to $B$.
$B \subseteq A$: the elements of $B$ are $2$ and $3$, and both belong to $A$.
Since $A \subseteq B$ and $B \subseteq A$, the two sets contain exactly the same elements.
Final answer: $A = B$.
The lesson here is that a set can hide behind a description. You cannot judge equality by how the two sets look on the page. You judge it by the elements they actually hold once the rule is worked out.
What Is The Difference Between Equal And Equivalent Sets?
Equal sets and equivalent sets are the pair most often mixed up, so it helps to fix the split in one line: equal sets have the same elements, while equivalent sets only have the same number of elements. The size measure that equivalent sets rely on is called cardinality, written $n(A)$, the count of elements in a set.
Equivalent sets are written with a tilde, $A \sim B$ (some textbooks use $A \equiv B$). Two sets are equivalent when their cardinality matches, even if their elements are completely different.
Table: How equal sets and equivalent sets compare.
Feature | Equal sets | Equivalent sets |
|---|---|---|
Test | Same elements | Same number of elements |
Symbol | $A = B$ | $A \sim B$ |
Do the elements match? | Yes, exactly | Not necessarily |
Is the cardinality the same? | Yes | Yes |
One-way rule | Every equal set is also equivalent | Not every equivalent set is equal |
Example | ${1, 2, 3}$ and ${3, 2, 1}$ | ${1, 2, 3}$ and ${a, b, c}$ |
The one-way rule in that table is the piece worth memorising. If two sets are equal, they must also be equivalent, because identical elements are automatically the same in number. The reverse fails: ${1, 2, 3}$ and ${a, b, c}$ both have three elements, so they are equivalent, but they share no elements at all, so they are not equal.
What Are The Properties Of Equal Sets?
Set equality behaves the way equality behaves everywhere in mathematics, which makes its properties easy to trust once you name them.
Order-free: rearranging the elements never changes a set, so ${1, 2, 3} = {2, 1, 3}$.
Repetition-free: listing an element twice adds nothing, so ${5, 5, 9} = {5, 9}$.
Two-way subset: $A = B$ exactly when $A \subseteq B$ and $B \subseteq A$ both hold.
Reflexive: every set equals itself, $A = A$.
Symmetric: if $A = B$, then $B = A$.
Transitive: if $A = B$ and $B = C$, then $A = C$.
Same subsets: equal sets have identical subsets and the same power set, since the subsets depend only on the elements.
The last three properties together are what mathematicians mean when they call equality an equivalence relation. Even the empty set obeys all of this: there is only one empty set, so any two empty sets are equal.
Why Does The Definition Of Equal Sets Matter?
The definition of equal sets looks almost too simple to need a reason, but "same elements" is a deliberate choice that holds all of set theory together. A set is defined by one thing only: which objects belong to it. Nothing else about how a set is written or built is allowed to count.
That single decision has a name. It is the axiom of extensionality, one of the founding rules of modern set theory, and it says two sets are equal if and only if they have the same members.
Membership is the only test. Two descriptions that pick out the same objects describe the same set, full stop. This is why ${x : x \text{ is an even prime}}$ and ${2}$ are the same set.
Order is irrelevant because a set is not a sequence. A set records who is a member, not who came first. A list cares about order; a set does not.
Repetition is irrelevant because membership is yes-or-no. An object either belongs to a set or it does not. Saying "yes" twice is no different from saying it once.
Without this rule, the same collection written two ways could count as two different sets, and every proof that relies on rewriting a set would collapse. The plain-looking definition is the load-bearing wall. It is what lets you prove, rearrange, and simplify sets and know the answer has not quietly changed underneath you.
Who Discovered That Sets Can Be Equal Or Just Equivalent?
The idea that two collections can match in size without matching in content came from one person wrestling with infinity. Georg Cantor measured the size of a set by pairing its elements one-to-one with another set, which is exactly the one-to-one correspondence behind equivalent sets, and that tool led him somewhere nobody expected.
Two other mathematicians shaped the everyday tools in this article:
Ernst Zermelo (1871–1953, Germany) wrote down the axiom of extensionality in 1908 as part of the first careful list of rules for set theory. That axiom is the formal statement of when two sets are equal.
John Venn (1834–1923, England) introduced the overlapping-circle diagrams in 1880 that let anyone picture equal, unequal, and overlapping sets at a glance.
Where Are Equal Sets Used In The Real World?
Set equality quietly runs a surprising amount of the software people use every day, because so much of computing is really about comparing collections.
Databases: checking whether two queries return the same result set is a set-equality test, and it is how systems confirm that a rewritten query still produces the same rows.
Deduplication: contact lists, playlists, and mailing lists are stored as sets of unique items, so adding a duplicate leaves the collection unchanged, exactly like ${5, 5, 9} = {5, 9}$.
Access and permissions: confirming that a user's set of permissions equals the set a role requires is a two-way subset check in disguise.
Spelling and search tools: comparing the set of letters in two strings, or the set of tags on two articles, decides whether they should be treated as the same.
Logic and proof: showing that two definitions describe the same collection, by proving each is a subset of the other, is how mathematicians confirm two ideas are really one.
One quiet rule about matching collections shows up in code, in databases, and in pure logic alike. The math a student meets on paper is the same math the machines run.
What Are The Most Common Equal Sets Mistakes?
These are the errors that cost the most marks on sets, confirmed against equal-vs-equivalent lessons and published set-theory guidance rather than guessed at.
Treating equal and equivalent sets as the same thing.
Where it slips in:
A student sees that two sets have the same number of elements and writes $A = B$, when the two sets share no actual elements.
Don't do this:
Do not read "same size" as "equal." Same cardinality is the test for equivalent sets, not equal sets.
The correct way:
Check the elements themselves. For equality, every element of each set must appear in the other; for equivalence, only the counts need to match. So ${1, 2, 3}$ and ${a, b, c}$ are equivalent but not equal.
Thinking the order of elements matters.
Where it slips in:
A student decides ${1, 2, 3}$ and ${3, 2, 1}$ are different because the numbers appear in a different order.
Don't do this:
Do not treat a set like a sequence. A set has no first or last element.
The correct way:
Compare membership, not position. Both sets contain $1$, $2$, and $3$, so ${1, 2, 3} = {3, 2, 1}$.
Counting repeated elements as extra.
Where it slips in:
A student writes that ${4, 4, 7}$ has three elements and so cannot equal ${4, 7}$.
Don't do this:
Do not count an element twice. Membership is yes-or-no, not a tally.
The correct way:
Collapse repeats before comparing. The set ${4, 4, 7}$ is really ${4, 7}$, so the two sets are equal and both have two elements.
Checking the subset rule in one direction only.
Where it slips in:
A student confirms $A \subseteq B$, sees that it holds, and concludes $A = B$ without checking the other way.
Don't do this:
Do not stop after one direction. $A \subseteq B$ alone allows $B$ to have extra elements.
The correct way:
Prove both $A \subseteq B$ and $B \subseteq A$. Only when each set sits inside the other are they equal.
Practice Problems On Equal Sets
Decide whether each pair is equal, and give a one-line reason. Answers follow each problem.
$A = {2, 4, 6}$ and $B = {6, 4, 2}$.
(Answer: Equal. Same elements, order does not matter.)$A = {1, 2, 3}$ and $B = {1, 2, 3, 4}$.
(Answer: Not equal. $B$ has an extra element, $4$.)$A = {m, a, t, h, s}$ and $B = {s, m, a, t, h}$.
(Answer: Equal. Same five letters rearranged.)$A = {1, 2, 2, 3}$ and $B = {1, 2, 3}$.
(Answer: Equal. The repeated $2$ counts once.)$A = {1, 2, 3}$ and $B = {p, q, r}$: equal, equivalent, or neither?
(Answer: Equivalent, not equal. Same cardinality, different elements.)$A = {x : x^{2} = 9}$ and $B = {-3, 3}$.
(Answer: Equal. Solving $x^{2} = 9$ gives $x = -3$ or $x = 3$, so $A = {-3, 3} = B$.)
Where Should You Go Next After Equal Sets?
Equal sets are one gate into set theory, and a few natural doors open straight from here.
Types of sets. Meet finite, infinite, singleton, and other families, and see where equal and equivalent sets sit among them.
Subsets. The two-way subset check is the engine behind every equality proof, so this is the idea to sharpen next.
Operations on sets. Union, intersection, and difference are where set equality starts doing real work, since many identities are equalities you can prove.
If your child is building these foundations, a live Bhanzu trainer teaches sets starting from the "why" behind the definitions in the Bhanzu algebra program.
Was this article helpful?
Your feedback helps us write better content