Definition:Set Union

Definition
Let $S$ and $T$ be sets.

The (set) union of $S$ and $T$ is the set $S \cup T$, which consists of all the elements which are contained in either (or both) of $S$ and $T$:
 * $x \in S \cup T \iff x \in S \lor x \in T$

or, slightly more formally:
 * $A = S \cup T \iff \forall z: \paren {z \in A \iff z \in S \lor z \in T}$

We can write:
 * $S \cup T := \set {x: x \in S \lor x \in T}$

It can be seen that, in this form, $\cup$ is a binary operation which acts on sets.

Axiomatic Set Theory
The concept of set union is axiomatised in the Axiom of Union in Zermelo-Fraenkel set theory:
 * $\forall A: \exists x: \forall y: \paren {y \in x \iff \exists z: \paren {z \in A \land y \in z} }$

Also known as
The union of sets is also known as the logical sum, or just sum, but these terms are usually considered old-fashioned nowadays.

The term join can also be seen, but this is usually reserved for specific contexts.

Some authors use the notation $S + T$ for $S \cup T$, but this is non-standard and can be confusing, so its use is not recommended.

Also, $S + T$ is sometimes used for disjoint union.

Also see

 * Definition:Set Intersection, a related operation.


 * Definition:Disjoint Union (Set Theory)


 * Union of Singleton, where it is shown that $\displaystyle \mathbb S = \set S \implies \bigcup \mathbb S = S$
 * Union of Empty Set, where it is shown that $\displaystyle \mathbb S = \O \implies \bigcup \mathbb S = \O$