Disjoint union

from Wikipedia, the free encyclopedia

In the mathematical branch of set theory there are two slightly different uses of the term disjoint union .

definition

The following distinction corresponds exactly to the difference between inner and outer direct sum . The two definitions represent the different states of affairs, but both are referred to as disjoint union. Therefore, the term must be understood depending on its context. The notations in the article are not only used in this way in the literature, mostly the latter for the former.

Union of disjoint sets

A set is the disjoint union of a system of subsets , written

if the following two conditions are met:

  • if , that is to say, they are pairwise disjoint ;
  • , that is, is the union of all sets .

Disjoint union of arbitrary sets

Are sets of given, it means the amount

the disjoint union of the sets . It is roughly a union in which the sets are artificially disjointed beforehand.

properties

  • For the widths applies: . In cardinal number arithmetic , the sum is precisely defined by this relationship.
  • The disjoint union is the categorical coproduct in the category of sets. This means: images correspond to one-to-one systems of images with .
  • If the sets are disjoint, the canonical mapping is bijective.

Examples

Example of the union of disjoint sets

Disjoint union of and .

  • Both sets are disjoint
  • is the disjoint union of the sets and ⇒
  • The sets and form a partition of the set
  • The disjoint union in the second sense yields the pair set . The projection maps bijectively on .

Example of a disjoint union of arbitrary sets

Disjoint union of and .