What Are Disjoint Sets?
Disjoint sets are two or more sets that share no element in common. Two sets $A$ and $B$ are disjoint when their intersection is the empty set: $A \cap B = \emptyset$. If even one element belongs to both, the sets are not disjoint.
Take $A = {1, 2, 3}$ and $B = {4, 5, 6}$. No number appears in both lists, so $A$ and $B$ are disjoint. Swap $B$ for ${3, 4, 5}$ and the two sets now share the element $3$, which makes them overlapping instead.
The idea reaches past two sets. A whole family of sets can be disjoint when no element is shared across the group, and that clean separation is what makes disjointness so useful for counting and sorting.
How Do You Check If Two Sets Are Disjoint?
To check whether two sets are disjoint, find their intersection. If the intersection is empty, the sets are disjoint; if it holds even one element, they are not.
Example 1: Are $A = {2, 4, 6, 8}$ and $B = {1, 3, 5, 7}$ disjoint?
Look for any element in both. Every member of $A$ is even and every member of $B$ is odd, so $A \cap B = \emptyset$.
Final answer: yes, $A$ and $B$ are disjoint sets.
Example 2: Are $P = {c, a, t}$ and $Q = {t, a, p}$ disjoint?
Both sets contain $a$ and $t$, so $P \cap Q = {a, t}$, which is not empty.
Final answer: no, $P$ and $Q$ are not disjoint, they overlap.
What Does The Venn Diagram Of Disjoint Sets Look Like?
On a Venn diagram, disjoint sets appear as two separate circles that do not touch or overlap. The blank space between the circles is the visual signal that the sets share nothing.
Compare that with overlapping sets, whose circles cross to make a shared lens-shaped region in the middle. For disjoint sets there is no such region, because there is no common element to place inside it.
What Are Pairwise Disjoint Sets?
A collection of three or more sets is pairwise disjoint when every possible pair of sets in it is disjoint. Checking the overall intersection alone is not enough, since each pair has to share nothing on its own.
The sets $A = {1, 2}$, $B = {3, 4}$, and $C = {5, 6}$ are pairwise disjoint, because $A \cap B$, $A \cap C$, and $B \cap C$ are all empty.
Now look at $X = {1, 2}$, $Y = {2, 3}$, and $Z = {4, 5}$. The triple intersection $X \cap Y \cap Z$ is empty, which tempts you to call the whole collection disjoint. But $X \cap Y = {2}$, so the pair $X$ and $Y$ overlap, and the collection is not pairwise disjoint.
How Do You Find The Union Of Disjoint Sets?
When two sets are disjoint, the number of elements in their union is just the sum of the two sizes. There is no overlap to subtract, so:
$$n(A \cup B) = n(A) + n(B) \qquad \text{when } A \cap B = \emptyset$$
For sets that do overlap, the general rule subtracts the shared part: $n(A \cup B) = n(A) + n(B) - n(A \cap B)$. Disjoint sets are the clean case where $n(A \cap B) = 0$, so that last term vanishes.
Example 3: Find $n(A \cup B)$ for $A = {1, 2, 3}$ and $B = {4, 5, 6}$.
Each set has $3$ elements, and the two are disjoint. So $n(A \cup B) = 3 + 3 = 6$, which matches $A \cup B = {1, 2, 3, 4, 5, 6}$ counted directly.
What Is The Difference Between Joint And Disjoint Sets?
Joint sets share at least one element; disjoint sets share none. That single line is the whole distinction, and a table makes the contrast concrete.
Table: How joint (overlapping) sets compare with disjoint sets.
Feature | Joint (overlapping) sets | Disjoint sets |
|---|---|---|
Common elements | At least one | None |
Intersection | $A \cap B \neq \emptyset$ | $A \cap B = \emptyset$ |
Venn diagram | Circles overlap | Circles stay separate |
Union size | $n(A) + n(B) - n(A \cap B)$ | $n(A) + n(B)$ |
Example | ${1, 2, 3}$ and ${3, 4}$ | ${1, 2, 3}$ and ${4, 5}$ |
How Are Disjoint Sets Different From Set Difference And Complement?
Disjoint is a relationship between two sets, while the difference of sets and the complement of a set are operations that build a brand-new set. Being disjoint answers a yes-or-no question: do these two sets share anything? The difference $A - B$ and the complement $A'$ each hand you back a set as their result.
The mix-up is understandable, because all three involve elements being left out. But $A \cap B = \emptyset$ is a statement you verify, while $A - B$ and $A'$ are sets you can list. Keep the question separate from the operation and the confusion clears up.
Why Do Disjoint Sets Matter?
Disjoint sets are the mathematical version of putting things into separate, non-overlapping boxes, an idea also called a partition when the pieces cover everything. That simple property does a surprising amount of work.
Counting without double-counting. When groups are disjoint you add their sizes directly, which is exactly why $n(A \cup B) = n(A) + n(B)$ holds and why careful counting starts by splitting things into disjoint pieces.
Clean classification. Sorting objects into categories only works when the categories are disjoint. A whole number is even or odd and never both, so those two sets partition the integers.
Mutually exclusive events. In probability, two outcomes that cannot happen together are disjoint, and the chance of one or the other is just the sum of their separate chances.
Each use rests on the same guarantee, that separate boxes never share contents. Once groups are disjoint, plain addition replaces the messier bookkeeping that overlap forces on you.
Who Are The Mathematicians Behind Disjoint Sets?
Sets feel so natural that it is easy to forget someone had to invent the mathematics of them. That someone was Georg Cantor, who built set theory almost single-handedly in the 1870s, giving us the language of intersections, unions, and disjointness we still use.
Two more mathematicians shaped how we see disjoint sets today:
John Venn (1834–1923, England) introduced the overlapping-circle diagram in 1880, the picture that makes disjoint sets instantly readable as two separate loops.
Richard Dedekind (1831–1916, Germany) worked in step with Cantor's ideas and helped turn sets into a rigorous foundation for the number system itself.
Where Are Disjoint Sets Used In The Real World?
The same one idea, separate groups that never overlap, runs quietly under a wide range of systems.
Databases. Splitting a huge table across servers (sharding) only works if the pieces are disjoint, so no record is stored, or counted, twice.
Probability and statistics. Rolling a $2$ versus rolling a $5$ on one die are disjoint events, and their probabilities add straight away because they cannot both happen.
Computer science. The union-find (disjoint-set) data structure tracks which items sit in separate groups and merges them quickly, powering network-connectivity checks and image-segmentation algorithms.
Biology and classification. Scientific taxonomies sort living things into disjoint categories, so a species sits in exactly one group at each level.
Scheduling. Two events can share a room only when their time slots are disjoint, which is how a calendar flags a clash.
Databases, dice, calendars, and family trees run on the same quiet promise, that separate groups never overlap. One small idea about sets keeps very different systems honest.
What Are The Most Common Disjoint Sets Mistakes?
These four errors cost most of the lost marks on disjoint-set questions, and they turn up in the same order every year. Each one comes from treating a relationship as if it were an operation, or from skipping a check.
Calling two sets disjoint without checking the intersection.
Where it slips in:
A student glances at ${1, 2, 3}$ and ${3, 4, 5}$, sees mostly different numbers, and calls them disjoint, missing the shared $3$. Many students who lose marks here never actually wrote the intersection down.
Don't do this:
Do not judge disjointness by how different the two sets look.
The correct way:
Compute $A \cap B$ every time. Only an empty intersection makes the sets disjoint.
Confusing disjoint with set difference or complement.
Where it slips in:
Asked to show that two sets are disjoint, a student computes $A - B$ or the complement $A'$ instead, which answers a different question.
Don't do this:
Do not turn a yes-or-no relationship into a subtraction. $A \cap B = \emptyset$ is a fact to verify, not a set to build.
The correct way:
To test disjointness, check the intersection. Save $A - B$ and $A'$ for when the question actually asks for a resulting set.
Assuming a set and its subset are disjoint.
Where it slips in:
A student treats $A = {1, 2, 3}$ and its subset $B = {1, 2}$ as disjoint, because $B$ looks smaller and separate.
Don't do this:
Do not read "smaller" as "separate." A non-empty subset shares every one of its elements with the parent set.
The correct way:
Remember that two sets are disjoint only when they share nothing. A set and its non-empty subset always overlap.
Assuming an empty overall intersection means pairwise disjoint.
Where it slips in:
For three sets, a student checks that $A \cap B \cap C = \emptyset$ and concludes the whole collection is pairwise disjoint.
Don't do this:
Do not let the triple intersection stand in for the pairwise check. The overall intersection can be empty while two of the sets still overlap.
The correct way:
Test every pair on its own: $A \cap B$, $A \cap C$, and $B \cap C$. The collection is pairwise disjoint only when all three pairs are empty.
Practice Problems On Disjoint Sets
Use $A = {1, 2, 3, 4}$, $B = {5, 6, 7}$, and $C = {4, 8}$ unless a problem says otherwise. Answers follow each line.
Are $A$ and $B$ disjoint?
(Answer: yes, $A \cap B = \emptyset$.)Are $A$ and $C$ disjoint?
(Answer: no, they share $4$, so $A \cap C = {4}$.)Find $n(A \cup B)$ using the disjoint-union rule.
(Answer: $4 + 3 = 7$.)Is the collection ${1}$, ${2}$, ${3}$ pairwise disjoint?
(Answer: yes, every pair has an empty intersection.)Give one set $D$ that is disjoint from $B = {5, 6, 7}$.
(Answer: any set with no $5$, $6$, or $7$, for example $D = {1, 2}$.)Two sets satisfy $n(A) = 8$ and $n(B) = 5$ and are disjoint. Find $n(A \cup B)$.
(Answer: $8 + 5 = 13$.)
Where Should You Go Next After Disjoint Sets?
Disjoint sets are one relationship among the many that sets can have, and the next steps branch straight out from here.
Operations on sets. Union, intersection, and difference are the machinery behind every disjointness check.
Types of sets. See where disjoint sits among equal, equivalent, and overlapping sets.
Intersection of sets. The one operation that settles whether any two sets are disjoint.
If your child is building these foundations, a live Bhanzu trainer teaches sets from the ground up, starting with what the pieces mean before the symbols arrive, in the Bhanzu algebra program.
Was this article helpful?
Your feedback helps us write better content