Review the key concepts, formulae, and examples before starting your quiz.
🔑Concepts
Two sets and are said to be equal if they have exactly the same elements. We write this as .
If two sets are not equal, we write . This occurs if there is at least one element in that is not in , or vice-versa.
The order in which the elements are listed in a set does not change the set. For example, .
The repetition of elements in a set does not change the set. For example, .
Two sets and are equal if and only if and . This is a common method for proving equality in advanced set theory.
Equivalent Sets vs. Equal Sets: Two sets are equivalent if they have the same number of elements (). Equal sets must be equivalent, but equivalent sets are not necessarily equal.
📐Formulae
pieces
💡Examples
Problem 1:
Let and . Are and equal?
Solution:
Since every element of is in and every element of is in , .
Explanation:
In set notation, we ignore the repetition of letters like 'L' and 'O' in 'FOLLOW'. The distinct elements are the same for both words, so the sets are equal regardless of order.
Problem 2:
Given and , prove .
Solution:
First, solve the quadratic equation for : So, . Since , it follows that .
Explanation:
By solving the defining property of set , we find its elements are exactly the same as those listed in set .
Problem 3:
If and , are and equal? Also, find if they are equivalent.
Solution:
For set : For set : (after removing duplicates) Since and contain the same elements, . Cardinality: Since , they are also equivalent.
Explanation:
Sets are equal because they share the same unique elements. They are equivalent because their count of distinct elements is identical.