Union (set theory)
In set theory, the union (denoted by ∪) of a collection of sets is the set of all elements in the collection.
≈ 5 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In set theory, the union (denoted by ∪) of a collection of sets is the set of all elements in the collection. It is one of the fundamental operations through which sets can be combined and related to each other. A refers to a union of zero ( ) sets and it is by definition equal to the empty set.
For explanation of the symbols used in this article, refer to the table of mathematical symbols. A \cup B = \{ x: x \in A \text{ or } x \in B\} . For example, if A = {1, 3, 5, 7} and B = {1, 2, 4, 6, 7} then A ∪ B = {1, 2, 3, 4, 5, 6, 7}.
A more elaborate example (involving two infinite sets) is: A = B = A \cup B = \{2,3,4,5,6, \dots\} As another example, the number 9 is not contained in the union of the set of prime numbers and the set of even numbers , because 9 is neither prime nor even. Sets cannot have duplicate elements, so the union of the sets and is . The notation for the general concept can vary considerably.
For a finite union of sets S_1, S_2, S_3, \dots , S_n one often writes S_1 \cup S_2 \cup S_3 \cup \dots \cup S_n or \bigcup_{i=1}^n S_i . Various common notations for arbitrary unions include \bigcup \mathbf{M} , \bigcup_{A\in\mathbf{M}} A , and \bigcup_{i\in I} A_{i} . The last of these notations refers to the union of the collection \left\{A_i : i \in I\right\} , where I is an index set and A_i is a set for every .
In the case that the index set I is the set of natural numbers, one uses the notation \bigcup_{i=1}^{\infty} A_{i} , which is analogous to that of the infinite sums in series. When the symbol "∪" is placed before other symbols (instead of between them), it is usually rendered as a larger size. In Unicode, union is represented by the character .
In TeX, \cup is rendered from \cup and \bigcup is rendered from \bigcup ; In Typst, union renders \cup , where union.big renders \bigcup . In Zermelo–Fraenkel set theory (ZFC) and other set theories, the ability to take the arbitrary union of any sets is granted by the axiom of union, which states that, given any set of sets A , there exists a set B , whose elements are exactly those of the elements of A . Sometimes this axiom is less specific, where there exists a B which contains the elements of the elements of A , but may be larger.
For example if A = \{ \{1\}, \{2\} \}, then it may be that B = \{ 1, 2, 3\} since B contains 1 and 2. This can be fixed by using the axiom of specification to get the subset of B whose elements are exactly those of the elements of A . Then one can use the axiom of extensionality to show that this set is unique.
For readability, define the binary predicate \operatorname{Union}(X,Y) meaning " X is the union of Y " or " X = \bigcup Y " as: \operatorname{Union}(X,Y) \iff \forall x (x \in X \iff \exists y \in Y ( x \in y)) Then, one can prove the statement "for all Y , there is a unique X , such that X is the union of Y ": \forall Y \, \exists ! X (\operatorname{Union}(X,Y)) Then, one can use an extension by definition to add the union operator \bigcup A to the language of ZFC as: \begin{align} B = \bigcup A & \iff \operatorname{Union}(B,A) \\ & \iff \forall x (x \in B \iff \exists y \in Y(x \in y)) \end{align} or equivalently: x \in \bigcup A \iff \exists y \in A \, (x \in y) After the union operator has been defined, the binary union A \cup B can be defined by showing there exists a unique set C = \{A,B\} using the axiom of pairing, and defining A \cup B = \bigcup \{A,B\} .
Then, finite unions can be defined inductively as: \bigcup _ {i=1} ^ 0 A_i = \varnothing \text{, and } \bigcup_{i=1}^n A_i = \left(\bigcup_{i=1}^{n-1} A_i \right) \cup A_n A \cup (B \cup C) = (A \cup B) \cup C. Thus, the parentheses may be omitted without ambiguity: either of the above can be written as . Also, union is commutative, so the sets can be written in any order.
The empty set is an identity element for the operation of union. That is, , for any set . Also, the union operation is idempotent: .
All these properties follow from analogous facts about logical disjunction. Intersection distributes over union A \cap (B \cup C) = (A \cap B)\cup(A \cap C) and union distributes over intersection A \cup (B \cap C) = (A \cup B) \cap (A \cup C). The power set of a set , together with the operations given by union, intersection, and complementation, is a Boolean algebra.
In this Boolean algebra, union can be expressed in terms of intersection and complementation by the formula A \cup B = ( A^\complement \cap B^\complement )^\complement, where the superscript {}^\complement denotes the complement in the universal set . Alternatively, intersection can be expressed in terms of union and complementation in a similar way: A \cap B = ( A^\complement \cup B^\complement )^\complement .
These two expressions together are called De Morgan's laws.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1372773246 under CC BY-SA 4.0; modifications have been made.