Categories
  Encyclosphere.org ENCYCLOREADER
  supported by EncyclosphereKSF

Union of sets

From Encyclopedia of Mathematics - Reading time: 1 min

sum of sets

One of the basic operations on (collections of) sets. Suppose one has some (finite or infinite) collection K of sets. Then the collection of all elements that belong to at least one of the sets in K is called the union, or, more rarely, the sum, of (the sets in) K; it is denoted by K.


Comments[edit]

In case K={Aα:αI}, the union is also denoted by αAα, αIAα, AKA, or, more rarely, by αAα.

In the Zermelo–Fraenkel axiom system for set theory, the sum-set axiom expresses that the union of a set of sets is a set.

If the sets Aα are disjoint, then in the category Set the union of the objects Aα is the sum of these objects in the categorical sense. In general, the sum of objects Xα is the disjoint union αXα={(x,α):xXα}. The natural imbeddings iα:XααXα are given by iα(x)=(x,α). Thus, αXα together with the iα, αI, satisfies the universal property for categorical sums: For every family of mappings fα:XαY there is a unique mapping f:αXαY such that fiα=fα.

References[edit]

[1] K. Kuratowski, "Introduction to set theory and topology" , Pergamon (1961) pp. 25 (Translated from French)

How to Cite This Entry: Union of sets (Encyclopedia of Mathematics) | Licensed under CC BY-SA 3.0. Source: https://encyclopediaofmath.org/wiki/Union_of_sets
17 views |
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF