Union Set Operation
(Redirected from Combination Operation)
Jump to navigation
Jump to search
A Union Set Operation is a Set Operation that combines the Members of Two or more sets into One set.
- AKA: Union, Union Operation, ∪, Set Union, Set Union Operation, Set Sum, Set Maximum.
- Example(s):
- Counter-Example(s):
- ∩({1,2}, {2,3}) ⇒ {2}, the Intersection Set Operation.
- A^C({1}) ⇒ {2,3,4,5,..}, the Complement Set Operation.
References
- (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Union_(set_theory)
- In set theory, the term Union (denoted as ∪) refers to a set operation used in the convergence of set elements to form a resultant set containing the elements of both sets. As a simple example, a union of two disjoint sets, which do not have elements in common results in a set containing all elements from both sets.