 Disjoint union

In mathematics, the term disjoint union may refer to one of two different concepts:
 In set theory, a disjoint union (or discriminated union) is a modified union operation that indexes the elements according to which set they originated in; disjoint sets have no element in common.
 In probability theory (or more generally in measure theory), a disjoint union is the usual union of sets that are, however, themselves pairwise disjoint.
Contents
Set theory definition
Formally, let {A_{i} : i ∈ I} be a family of sets indexed by I. The disjoint union of this family is the set
The elements of the disjoint union are ordered pairs (x, i). Here i serves as an auxiliary index that indicates which A_{i} the element x came from. Each of the sets A_{i} is canonically embedded in the disjoint union as the set
For i ≠ j, the sets A_{i}* and A_{j}* are disjoint even if the sets A_{i} and A_{j} are not.
In the extreme case where each of the A_{i} are equal to some fixed set A for each i ∈ I, the disjoint union is the Cartesian product of A and I:
One may occasionally see the notation
for the disjoint union of a family of sets, or the notation A + B for the disjoint union of two sets. This notation is meant to be suggestive of the fact that the cardinality of the disjoint union is the sum of the cardinalities of the terms in the family. Compare this to the notation for the Cartesian product of a family of sets.
In the language of category theory, the disjoint union is the coproduct in the category of sets. It therefore satisfies the associated universal property. This also means that the disjoint union is the categorical dual of the Cartesian product construction. See coproduct for more details.
For many purposes, the particular choice of auxiliary index is unimportant, and in a simplifying abuse of notation, the indexed family can be treated simply as a collection of sets. In this case is referred to as a copy of A_{i} and the notation is sometimes used.
Probability theory definition
Let C be a collection of pairwise disjoint sets. That is, for all sets A≠B in C, the intersection of these sets is empty: A∩B = ∅. Then the union of all sets in collection C is called the disjoint union of sets:
As such, the term “disjoint union” is simply a shorthand for “union of sets which are pairwise disjoint”.
See also
 Coproduct
 Disjoint union (topology)
 Disjoint union of graphs
 Tagged union
 Union (computer science)
References
 Weisstein, Eric W., "Disjoint Union" from MathWorld.
Categories: Basic concepts in set theory
Wikimedia Foundation. 2010.
Look at other dictionaries:
Disjoint union (topology) — In general topology and related areas of mathematics, the disjoint union (also called the direct sum, free union, free sum, topological sum, or coproduct) of a family of topological spaces is a space formed by equipping the disjoint union of the… … Wikipedia
Disjoint — may refer to: Disjoint sets Disjoint union This disambiguation page lists articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the intende … Wikipedia
Union (set theory) — Union of two sets … Wikipedia
Disjoint sets — Two 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.[1] Explanation Formally, two sets A and … Wikipedia
Unión disjunta — En teoría de conjuntos, la unión disjunta de dos o más conjuntos es un conjunto que prácticamente contiene copias disjuntas de los conjuntos originales, y nada además de eso. Un ejemplo trivial es cuando A y B son disjuntos, quedando la unión… … Wikipedia Español
Unionfind — Étant donné un ensemble d éléments, il est souvent utile de le partitionner en un certain nombre de classes disjointes, c est à dire de représenter une relation d équivalence. Une structure de données pour le problème des classes disjointes… … Wikipédia en Français
Disjointset data structure — In computing, a disjoint set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union find algorithm is an algorithm that performs two useful operations on… … Wikipedia
UnionFind — Étant donné un ensemble d éléments, il est souvent utile de le partitionner en un certain nombre de classes disjointes, c est à dire de représenter une relation d équivalence. Une structure de données pour le problème des classes disjointes… … Wikipédia en Français
Tagged union — In computer science, a tagged union, also called a variant, variant record, discriminated union , or disjoint union, is a data structure used to hold a value that could take on several different, but fixed types. Only one of the types can be in… … Wikipedia
Discriminated union — The term discriminated union may refer to: Disjoint union in set theory. Tagged union in computer science. This disambiguation page lists articles associated with the same title. If an internal link led you here … Wikipedia