Lably
Skip to content

Disjoint union

In mathematics, operation on sets

  • 3 min read
  • 3 chapters

Related on Lably

Through Mathematics, Up to and Bijection

A disjoint union of an indexed family of sets (Ai:i∈I) is a set A, often denoted by ⨆i∈IAi, with an injection of each Ai into A, such that the images of these injections form a partition of A (that is, each element of A belongs to exactly one of these images). A disjoint union of a family of pairwise disjoint sets is their union.

In category theory, the disjoint union is the coproduct of the category of sets, and thus defined up to a bijection. In this context, the notation ∐i∈IAi is often used.

The disjoint union of two sets A and B is written with infix notation as A⊔B. Some authors use the alternative notation A⊎B or A∪⋅⁡B (along with the corresponding ⨄i∈IAi or ⋃⋅i∈I⁡Ai).

A standard way for building the disjoint union is to define A as the set of ordered pairs (x,i) such that x∈Ai, and the injection Ai→A as x↦(x,i).

Example

Consider the sets A0={5,6,7} and A1={5,6}. It is possible to index the set elements according to set origin by forming the associated sets A0∗={(5,0),(6,0),(7,0)}A1∗={(5,1),(6,1)},

where the second element in each pair matches the subscript of the origin set (for example, the 0 in (5,0) matches the subscript in A0, etc.). The disjoint union A0⊔A1 can then be calculated as follows: A0⊔A1=A0∗∪A1∗={(5,0),(6,0),(7,0),(5,1),(6,1)}.

Sign in to keep reading

2 more chapters are free with a Lably account.

More in Topics in mathematics