Disjoint sets

From Wikipedia, the free encyclopedia

In mathematics and computer science, two sets are said to be disjoint if they have no element in common. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets.

[edit] Explanation

Formally, two sets A and B are disjoint if their intersection is the empty set, i.e. if

This definition extends to any collection of sets. A collection of sets is pairwise disjoint or mutually disjoint if any two distinct sets in the collection are disjoint.

Formally, let I be an index set, and for each i in I, let A_i be a set. Then the family of sets {A_i : i ∈ I} is pairwise disjoint if for any i and j in I with i ≠ j,

For example, the collection of sets { {1}, {2}, {3}, ... } is pairwise disjoint. If {A_i} is a pairwise disjoint collection (containing at least two sets), then clearly its intersection is empty:

However, the converse is not true: the intersection of the collection {{1, 2}, {2, 3}, {3, 1}} is empty, but the collection is not pairwise disjoint. In fact, there are no two disjoint sets in the collection.

A partition of a set X is any collection of non-empty subsets {A_i : i ∈ I} of X such that {A_i} are pairwise disjoint and

[edit] See also

• Almost disjoint sets
• Connectedness
• Disjoint union
• Disjoint-set data structure