union
The union of two sets A and B is the set which contains all x∈A and all x∈B, denoted A∪B. In the Venn diagram below, A∪B is the entire area shaded in blue.
We can extend this to any (finite or infinite) family (Ai)i∈I, writing ⋃i∈IAi for the union of this family. Formally, for a family (Ai)i∈I of sets:
x∈⋃i∈IAi⇔⋁i∈I(x∈Ai) |
Alternatively, and equivalently,
x∈⋃i∈IAi⇔∃i∈I such that x∈Ai |
This characterization makes it much clearer that if I is itself the empty set
(that is, if we are taking the union of an empty family), then the union is empty; that is,
⋃i∈∅Ai=∅ |
Often elements of sets are taken from some universe U of elements under consideration (for example, the real numbers ℝ, or living things on the planet, or words in a particular book). When this is the case, it is meaningful to discuss the complement of a set: if A is a set of elements from some universe U, then the complement of A is the set
AC=U\A={x∈U∣x∉A} |
From an axiomatic point of view, the existence of the union is guaranteed by the axiom of union.
Note that the sets Ai may be, but need not be, disjoint. Unions satisfy some basic properties that are obvious from the definitions:
-
•
Idempotency: A∪A=A
-
•
A∪AC=U where U is the universe of A
-
•
Commutativity: A∪B=B∪A
-
•
Associativity: (A∪B)∪C=A∪(B∪C)
Here are some examples of set unions:
{1,2}∪{3,4}={1,2,3,4} | ||
{blue,green}∪∅={blue,green} | ||
{x∈ℤ∣x⩾ | ||
The first three of these are the union of disjoint sets, while the latter three are not - in those cases, the sets overlap each other.
Title | union |
---|---|
Canonical name | Union |
Date of creation | 2013-03-22 12:14:19 |
Last modified on | 2013-03-22 12:14:19 |
Owner | rm50 (10146) |
Last modified by | rm50 (10146) |
Numerical id | 13 |
Author | rm50 (10146) |
Entry type | Definition |
Classification | msc 03E30 |
Related topic | Intersection![]() ![]() |