Disjoint sets (mathematics)

Simple examples

Concrete finite examples make the idea clear. The sets {1, 3} and {2, 4} share no members, so they are disjoint. By contrast, {1, 3} and {1, 5} are not disjoint because they both contain 1. Disjointness is a symmetric relation: if A is disjoint from B, then B is disjoint from A.

Properties and notation

Key ways to express disjointness include the intersection condition A ∩ B = ∅ and the statement "A and B have no common elements." For more than two sets, the phrase pairwise disjoint (or mutually disjoint) means every distinct pair among them is disjoint. A family of sets that are pairwise disjoint is often used when describing partitions: a partition of a set is a collection of nonempty, pairwise disjoint subsets whose union is the whole set.

Variations and related concepts

Closely related notions include the disjoint union and mutually exclusive events. A disjoint union is a union of sets together with information that keeps their elements distinguished even if the underlying sets overlap; it is common in algebra and category theory and sometimes written with a special symbol (⊔ or ⨿). In probability theory, events that cannot occur together are described as mutually exclusive, which corresponds to disjoint sets of outcomes.

Applications and significance

Disjointness appears in many mathematical contexts. In measure theory and probability, the measure of a union of disjoint measurable sets equals the sum of their measures. In combinatorics, counting often relies on partitioning objects into disjoint classes to avoid double counting. In computer science, the disjoint-set data structure (union–find) efficiently tracks a partition of elements into disjoint subsets and is used in algorithms for connectivity and clustering.

Further notes

• Two distinct empty sets are not distinct in standard set theory: there is only one empty set, and it is disjoint from every set.
• Disjointness is a simple but powerful tool for organizing mathematical objects and ensuring operations like summation or counting behave predictably.
• For an introduction to the broader context of sets and operations, see set theory basics.