To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.

Union (set theory)

From Wikipedia, the free encyclopedia

Union of two sets:   A ∪ B {\displaystyle ~A\cup B}
Union of two sets:
Union of three sets:   A ∪ B ∪ C {\displaystyle ~A\cup B\cup C}
Union of three sets:
The union of A, B, C, D, and E is everything except the white area.
The union of A, B, C, D, and E is everything except the white area.

In set theory, the union (denoted by ∪) of a collection of sets is the set of all elements in the collection.[1] It is one of the fundamental operations through which sets can be combined and related to each other.

For explanation of the symbols used in this article, refer to the table of mathematical symbols.

YouTube Encyclopedic

  • 1/5
    490 477
    724 069
    34 327
    406 071
    10 602
  • ✪ Sets: Union and Intersection
  • ✪ Intersection and union of sets | Probability and Statistics | Khan Academy
  • ✪ Intersection of Sets, Union of Sets and Venn Diagrams
  • ✪ Sets: Union, Intersection, Complement
  • ✪ Sets: Union, Intersection, Complement



Union of two sets

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 symbols,


For example, if A = {1, 3, 5, 7} and B = {1, 2, 4, 6} then AB = {1, 2, 3, 4, 5, 6, 7}. A more elaborate example (involving two infinite sets) is:

A = {x is an even integer larger than 1}
B = {x is an odd integer larger than 1}

As another example, the number 9 is not contained in the union of the set of prime numbers {2, 3, 5, 7, 11, …} and the set of even numbers {2, 4, 6, 8, 10, …}, because 9 is neither prime nor even.

Sets cannot have duplicate elements,[2][3] so the union of the sets {1, 2, 3} and {2, 3, 4} is {1, 2, 3, 4}. Multiple occurrences of identical elements have no effect on the cardinality of a set or its contents.

Algebraic properties

Binary union is an associative operation; that is, for any sets A, B, and C,

The operations can be performed in any order, and the parentheses may be omitted without ambiguity (i.e., either of the above can be expressed equivalently as ABC). Similarly, union is commutative, so the sets can be written in any order.[4]

The empty set is an identity element for the operation of union. That is, A ∪ ∅ = A, for any set A. This follows from analogous facts about logical disjunction.

Since sets with unions and intersections form a Boolean algebra, intersection distributes over union

and union distributes over intersection


Within a given universal set, union can be written in terms of the operations of intersection and complement as

where the superscript C denotes the complement with respect to the universal set.

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 ABC 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.[5][6]

Arbitrary unions

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.[7] In symbols:

This idea subsumes the preceding sections—for example, ABC is the union of the collection {A, B, C}. Also, if M is the empty collection, then the union of M is the empty set.


The notation for the general concept can vary considerably. For a finite union of sets one often writes or . Various common notations for arbitrary unions include , , and , the last of which refers to the union of the collection where I is an index set and is a set for every . In the case that the index set I is the set of natural numbers, one uses a notation analogous to that of the infinite series.[7]

When the symbol "∪" is placed before other symbols instead of between them, it is usually rendered as a larger size.

See also


  1. ^ Weisstein, Eric W. "Union". Wolfram's Mathworld. Archived from the original on 2009-02-07. Retrieved 2009-07-14.
  2. ^ a b Vereshchagin, Nikolai Konstantinovich; Shen, Alexander (2002-01-01). Basic Set Theory. American Mathematical Soc. ISBN 9780821827314.
  3. ^ deHaan, Lex; Koppelaars, Toon (2007-10-25). Applied Mathematics for Database Professionals. Apress. ISBN 9781430203483.
  4. ^ Halmos, P. R. (2013-11-27). Naive Set Theory. Springer Science & Business Media. ISBN 9781475716450.
  5. ^ Dasgupta, Abhijit (2013-12-11). Set Theory: With an Introduction to Real Point Sets. Springer Science & Business Media. ISBN 9781461488545.
  6. ^ "Finite Union of Finite Sets is Finite - ProofWiki". Archived from the original on 11 September 2014. Retrieved 29 April 2018.
  7. ^ a b Smith, Douglas; Eggen, Maurice; Andre, Richard St (2014-08-01). A Transition to Advanced Mathematics. Cengage Learning. ISBN 9781285463261.

External links

This page was last edited on 1 May 2019, at 11:34
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.