# Disjoint sets

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

[itex]A\cap B = \varnothing.\,[itex]

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 : iI} is pairwise disjoint if for any i and j in I with ij,

[itex]A_i \cap A_j = \varnothing.\,[itex]

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:

[itex]\bigcap_{i\in I} A_i = \varnothing.\,[itex]

However, the converse is not true: the intersection of the collection {{1, 2, 3}, {4, 5, 6}, {3, 4}} is empty, but the collection is not pairwise disjoint.

A partition of a set X is any collection of non-empty subsets {Ai : iI} of X such that {Ai} are pairwise disjoint and

[itex]\bigcup_{i\in I} A_i = X.\,[itex]

• Art and Cultures
• Countries of the World (http://www.academickids.com/encyclopedia/index.php/Countries)
• Space and Astronomy