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 empty, 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 collection of sets {A_i : i in I} is pairwise disjoint if for any i and j in I,

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

online math image

However, the converse is not true -- the intersection of the collection is empty, but the collection is not pairwise disjoint.

A collection of sets {A_i : i in I} is a partition of the set X if {A_i} is a pairwise disjoint collection not containing the empty set, and if

See also:

• Almost disjoint sets

The original article can be found at: http://en.wikipedia.org/wiki/Disjoint_sets.
All text is available under the terms of the GNU Free Documentation License.