Disjoint Sets
Disjoint
Sets
Non-Overlapping Sets
Two or more sets which have no elements in common. For example, the sets A = {a,b,c} and B = {d,e,f} are disjoint.
Key Formula
A∩B=∅
Where:
- A,B = Two sets being compared
- ∩ = The intersection operator (elements common to both sets)
- ∅ = The empty set, meaning no elements
Worked Example
Problem: Determine whether the sets A = {2, 4, 6, 8} and B = {1, 3, 5, 7} are disjoint.
Step 1: Find the intersection of A and B — that is, list every element that appears in both sets.
A∩B={2,4,6,8}∩{1,3,5,7}
Step 2: Check each element of A against B. The number 2 is not in B, 4 is not in B, 6 is not in B, and 8 is not in B. No element is shared.
A∩B=∅
Answer: Since the intersection is empty, A and B are disjoint sets.
Why It Matters
Disjoint sets appear whenever you need to split a group into non-overlapping categories. In probability, if two events are disjoint (mutually exclusive), you can add their probabilities directly: P(A or B)=P(A)+P(B). This makes recognizing disjoint sets a practical skill in statistics, counting problems, and data classification.
Common Mistakes
Mistake: Confusing disjoint sets with sets that are simply not equal.
Correction: Two sets can be different yet still share elements (e.g., {1,2,3} and {2,3,4} are not equal but are also not disjoint because they share 2 and 3). Disjoint specifically means zero overlap.
Related Terms
- Set — The basic structure disjoint sets are built from
- Element of a Set — Individual objects checked for overlap
- Intersection — Disjoint sets have an empty intersection
- Empty Set — The result when disjoint sets are intersected
- Venn Diagrams — Visually shows disjoint sets as non-overlapping circles