A disjoint set in mathematics is a set that has no elements in common with another set, or, more generally, a collection of sets in which no two distinct sets share any element. In symbols, two sets (A) and (B) are called disjoint if their intersection is empty:
[
A \cap B = \varnothing
]
This means there is no object (x) such that (x \in A) and (x \in B) at the same time Most people skip this — try not to. Took long enough..
Real talk — this step gets skipped all the time It's one of those things that adds up..
Introduction to Disjoint Sets
Disjoint sets are a basic but powerful idea in set theory, logic, probability, combinatorics, computer science, and many other areas of mathematics. The word “disjoint” comes from the idea of separation: two sets are disjoint if they are separate from each other in terms of their elements Nothing fancy..
To give you an idea, let
[
A = {1, 2, 3}
]
and
[
B = {4, 5, 6}.
]
These two sets are disjoint because they have no elements in common. Their intersection is the empty set:
[
A \cap B = \varnothing.
It sounds simple, but the gap is usually here Most people skip this — try not to..
By contrast, the sets
[
C = {1, 2, 3}
]
and
[
D = {3, 4, 5}
]
are not disjoint because they both contain the element (3). Their intersection is
[
C \cap D = {3}.
]
Formal Definition of Disjoint Sets
Two sets (A) and (B) are called disjoint if they have no common elements. This can be written as:
[ A \cap B = \varnothing ]
The symbol (\cap) represents intersection, which is the set of all elements that belong to both sets. The symbol (\varnothing) represents the empty set, which contains no elements It's one of those things that adds up..
So, (A) and (B) are disjoint exactly when there is no element (x) satisfying both conditions:
[ x \in A \quad \text{and} \quad x \in B. ]
In logical notation, this can be written as:
[ \forall x, ; x \notin A \cap B. ]
Equivalently:
[ \forall x, ; \text{if } x \in A, \text{ then } x \notin B. ]
What this tells us is every element of (A) is outside of (B), and every element of (B) is outside of (A).
Examples of Disjoint Sets
Example 1: Disjoint Sets of Numbers
Let
[
A = {2, 4, 6}
]
and
[
B = {1, 3, 5}.
]
These sets are disjoint because no even number is in (B), and no odd number is in (A). Their intersection is empty:
[ A \cap B = \varnothing. ]
Example 2: Disjoint Sets of Letters
Let
[
P = {a, b, c}
]
and
[
Q = {d, e, f}.
]
Since none of the letters in (P) appear in (Q), the sets are disjoint.
Example 3: Sets That Are Not Disjoint
Let
[
R = {apple, banana, cherry}
]
and
[
S = {banana, date, elderberry}.
]
These sets are not disjoint because they both contain (banana). Therefore:
[ R \cap S = {banana}. ]
Example 4: Disjoint Intervals
In real number mathematics, intervals can be disjoint. For example:
[ [1, 3] \quad \text{and} \quad [4, 6] ]
are disjoint because they do not overlap. On the flip side, the intervals
[ [1, 3] \quad \text{and} \quad [3, 5] ]
are not disjoint because they both contain the number (3) That's the whole idea..
This shows that endpoints matter. If two closed intervals share an endpoint, they are not disjoint.
Pairwise Disjoint Sets
The definition of disjoint sets can be extended to collections of more than two sets. A collection of sets is called pairwise disjoint if every pair of distinct sets in the collection has an empty intersection.
Suppose we have a collection:
[ \mathcal{F} = {A_1, A_2, A_3, \dots, A_n}. ]
This collection is pairwise disjoint if:
[ A_i \cap A_j = \varnothing ]
for every (i \neq j).
Take this: let:
[ A = {1, 2} ]
[ B = {3, 4} ]
[ C = {5, 6}. ]
This collection is pairwise disjoint because:
[ A \cap B = \varnothing, ]
[ B \cap C = \varnothing, ]
and
[ A \cap C = \varnothing. ]
That said, consider:
[ A = {1, 2} ]
[ B = {2, 3} ]
[ C = {3, 4}. ]
This collection is not pairwise disjoint because (A) and (B) share (2), and (B) and (C) share (3) That alone is useful..
It is important to distinguish between a collection being mutually disjoint and simply having an empty total intersection. A collection may have:
[ A \cap B \cap C = \varnothing ]
but still fail to be pairwise disjoint. For example:
[ A = {1, 2} ]
[ B = {2, 3} ]
[ C = {1, 3}. ]
The intersection of all three sets is empty because no single element belongs to all three sets. Even so, the sets are not pairwise disjoint because each pair shares an element.
Disjoint Sets and the Empty Set
The empty set is disjoint from every set. For any set (A),
[ A \cap \varnothing = \varnothing. ]
This is because the empty set contains no elements, so it cannot share an element with any other set.
For example:
[ {1, 2, 3} \cap \varnothing = \varnothing. ]
This property is useful in proofs and in defining partitions, where empty pieces may sometimes be allowed depending on the context.
Disjoint Sets in Set Operations
Disjoint sets play an important role in set operations, especially union and intersection.
The union of two sets (A) and (B), written (A \cup B), is the set of all elements that belong to (A), to (B), or to both And that's really what it comes down to..
If (A) and (B) are disjoint, then:
[ A \cup B ]
simply combines the
