Review the key concepts, formulae, and examples before starting your quiz.
🔑Concepts
Ordered Pairs: An ordered pair consists of two elements in a fixed order, written as . Two ordered pairs are equal if and only if their corresponding first and second elements are equal, i.e., if and only if and . Visually, these are represented as coordinates on a 2D Cartesian plane where the first element is the -coordinate and the second is the -coordinate.
Cartesian Product of Sets: For any two non-empty sets and , the Cartesian product is the set of all ordered pairs such that and . If has elements and has elements, then . Visually, this can be described as a grid of points where each point corresponds to a pairing from set and set .
Definition of a Relation: A relation from a set to a set is a subset of the Cartesian product . This subset is formed by linking elements of and based on a specific rule. Visually, relations are often represented by arrow diagrams, where an arrow points from an element in the source set to its related element in the target set .
Domain of a Relation: The domain of a relation is the set of all first elements of the ordered pairs belonging to . It is a subset of set . In an arrow diagram, the domain consists of all elements in set that have at least one outgoing arrow.
Range of a Relation: The range of a relation is the set of all second elements of the ordered pairs belonging to . It is a subset of set . Visually, in an arrow diagram, the range is the set of elements in the second oval (set ) that have at least one arrow pointing toward them.
Codomain: In a relation from to , the entire set is called the codomain. It is important to remember that the Range is always a subset of the Codomain (). Visually, while the range is only the 'hit' elements, the codomain is the entire destination set.
Total Number of Relations: If and , the total number of possible relations from to is . This is because a relation is any subset of , and a set with elements has possible subsets (the power set).
📐Formulae
Total relations from to
💡Examples
Problem 1:
If , find the values of and .
Solution:
Step 1: Since the ordered pairs are equal, equate the corresponding elements. Step 2: Solve the first equation for : Step 3: Solve the second equation for : Final Answer: and .
Explanation:
This solution relies on the fundamental property of ordered pairs: two pairs are identical if and only if their first components are equal and their second components are equal.
Problem 2:
Let and . Define a relation from to by . Write in roster form and find its domain.
Solution:
Step 1: Test the 'difference is odd' condition for all pairs . Recall that a difference is odd if one number is even and the other is odd. Step 2: Check for (odd): (odd), (odd), (even). Pairs: . Step 3: Check for (even): (even), (even), (odd). Pair: . Step 4: Check for (odd): (odd), (odd), (even). Pairs: . Step 5: Check for (odd): (odd), (odd), (even). Pairs: . Step 6: Write in roster form: Step 7: Find the domain (set of all first elements):
Explanation:
To solve this, we systematically verify the arithmetic condition for every possible pairing in the Cartesian product , then extract the unique first elements to define the domain.