Sources
Help build the largest human-edited directory on the web.
Submit a site - Become an editor
Wikipedia. Licensed under the GNU Free Documentation License.
Are you an expert in this subject? Join the discussion and share your knowledge at Wikipedia.org.
Disjoint sets
From Wikipedia, the free encyclopedia
In mathematics, 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.
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 Ai be a set. Then the family of sets {Ai : 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 {Ai} is a pairwise disjoint collection, 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 {Ai : i ∈ I} of X such that {Ai} are pairwise disjoint and
