Unions
Revision as of 13:00, 29 June 2015 by Scott Roby1 (talk | contribs) (Created page with "== Definition == Let <math>X</math> and <math>Y</math> be subsets of some universal set <math>U</math>. The '''''union of <math>X</math> and <math>Y</math>''''', written <math...")
Definition
Let and be subsets of some universal set . The union of and , written , is the set of all in which are in at least one of the sets or .
Symbolically, .
Examples
Example 1
Determine the union of the sets and .
Solution By definition, we wish to find the set of all elements which are in at least one of the two sets. Thus, we will collect all unique elements into a set as long as they appear once or more between the sets. Our solution is .
Example 2
Prove that for any sets and , .
Proof Let . We wish to show that , so this means showing that such that or . Since , we have that and by definition of we know that . Thus the “or” statement is true and hence . This shows that .