disjoint union (original) (raw)

Disjoint union of two sets

Let A and B be sets. Then their disjoint union is the union

where ⋆ is an object chosen so thatA and B×{⋆} are disjoint. Normally B×{⋆} is identified with B in the obvious way. The element ⋆ is almost never mentioned; it serves only as a “tag” to make the two sets disjoint. If A and B are already disjoint, then A⁢∐B is isomorphic to A∪B; this is the most common situation in practice.

Disjoint union of many sets

Explanation

If one is working in some category, the term “disjoint union” often means “coproduct”.

For example, as sets, ℝ⁢∐ℝis two copies of the real line. As topological spaces, ℝ⁢∐ℝis again two copies of the real line with a topology whose open sets are pairs of real open sets, one for each copy of ℝ. This is the coproduct in the category of topological spaces.

Of course, there are many categories where this usage is unnatural. For example, in the category of pointed sets, the coproduct is the disjoint union with the distinguished points identified. In the category of abelian groups, the coproduct is the direct sum.

Another closely related usage should be mentioned. Occasionally an author will write “…and A∪B is a disjoint union…”. What this means is that A∪B is isomorphic to A⁢∐B, which is to say that A and B are already disjoint.