Review the key concepts, formulae, and examples before starting your quiz.
🔑Concepts
The union of two sets and , denoted by , is the set of all elements which are members of either or or both. Formally, .
The union operation is commutative, meaning .
The union operation is associative, meaning .
The Identity Law states that the union of any set with an empty set is the set itself: .
The Idempotent Law states that the union of a set with itself is : .
The Law of states that the union of any set with the Universal Set is the Universal Set: .
Cardinality Rule: For any two finite sets and , the number of elements in their union is given by the sum of their individual cardinalities minus the number of elements in their intersection.
📐Formulae
💡Examples
Problem 1:
Let and . Find .
Solution:
First, list the elements of each set in roster form: Now, find the union by combining all elements, ensuring no duplicates:
Explanation:
To find the union, we include every element that appears in at least one of the sets. The elements and are common to both but are listed only once.
Problem 2:
In a class of students, students like Mathematics and students like Science. If students like both subjects, find the number of students who like either Mathematics or Science.
Solution:
Let be the set of students who like Mathematics and be the set of students who like Science. Given: Using the formula:
Explanation:
We use the Principle of Inclusion-Exclusion. Adding and counts the students who like both subjects twice, so we subtract once to get the correct count of unique students.
Problem 3:
If , find .
Solution:
By definition, means every element of is also an element of . Since is the set of all elements in or , and all elements of are already in , the resulting set is simply . Therefore, .
Explanation:
This is a property of subsets. When one set is entirely contained within another, their union is the larger set (superset).