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. Binary union. The union of two sets "A" and "B" is the set of elements which are in "A", in "B", or in both "A" and "B". In set-builder notation, formula_1. 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" = formula_2 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 . Multiple occurrences of identical elements have no effect on the cardinality of a set or its contents. Finite unions. One can take the union of several sets simultaneously. For example, the union of three sets "A", "B", and "C" contains all elements of "A", all elements of "B", and all elements of "C", and nothing else. Thus, "x" is an element of "A" ∪ "B" ∪ "C" if and only if "x" is in at least one of "A", "B", and "C". A finite union is the union of a finite number of sets; the phrase does not imply that the union set is a finite set. Notation. The notation for the general concept can vary considerably. For a finite union of sets formula_3 one often writes formula_4 or formula_5. Various common notations for arbitrary unions include formula_6, formula_7, and formula_8. The last of these notations refers to the union of the collection formula_9, where "I" is an index set and formula_10 is a set for every . In the case that the index set "I" is the set of natural numbers, one uses the notation formula_11, 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. Notation encoding. In Unicode, union is represented by the character . In TeX, formula_12 is rendered from codice_1 and formula_13 is rendered from codice_2. Arbitrary union. The most general notion is the union of an arbitrary collection of sets, sometimes called an "infinitary union". If M is a set or class whose elements are sets, then "x" is an element of the union of M if and only if there is at least one element "A" of M such that "x" is an element of "A". In symbols: formula_14 This idea subsumes the preceding sections—for example, "A" ∪ "B" ∪ "C" is the union of the collection . Also, if M is the empty collection, then the union of M is the empty set. Formal derivation. 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 formula_15, there exists a set formula_16, whose elements are exactly those of the elements of formula_15. Sometimes this axiom is less specific, where there exists a formula_16 which contains the elements of the elements of formula_15, but may be larger. For example if formula_20 then it may be that formula_21 since formula_16 contains 1 and 2. This can be fixed by using the axiom of specification to get the subset of formula_16 whose elements are exactly those of the elements of formula_15. Then one can use the axiom of extensionality to show that this set is unique. For readability, define the binary predicate formula_25 meaning "formula_26 is the union of formula_27" or "formula_28" as: formula_29 Then, one can prove the statement "for all formula_30, there is a unique formula_26, such that formula_26 is the union of formula_27": formula_34 Then, one can use an extension by definition to add the union operator formula_35 to the language of ZFC as: formula_36 or equivalently: formula_37 After the union operator has been defined, the binary union formula_38 can be defined by showing there exists a unique set formula_39 using the axiom of pairing, and defining formula_40. Then, finite unions can be defined inductively as: formula_41 Algebraic properties. Binary union is an associative operation; that is, for any sets , formula_42 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 formula_43 and union distributes over intersection formula_44 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 formula_45 where the superscript formula_46 denotes the complement in the universal set . Alternatively, intersection can be expressed in terms of union and complementation in a similar way: formula_47. These two expressions together are called De Morgan's laws. History and etymology. The english word "union" comes from the term in middle French meaning "coming together", which comes from the post-classical Latin "unionem", "oneness". The original term for union in set theory was "Vereinigung" (in german), which was introduced in 1895 by Georg Cantor. The english use of "union" of two sets in mathematics began to be used by at least 1912, used by James Pierpont. The symbol formula_12 used for union in mathematics was introduced by Giuseppe Peano in his "Arithmetices principia" in 1889, along with the notations for intersection formula_49, set membership formula_50, and subsets formula_51.