To determine which of the given relations is a function, we need to check if each input (the first element of the ordered pair) corresponds to exactly one output (the second element of the ordered pair). In other words, for a relation to be a function, there should be no two ordered pairs with the same first element and different second elements.
Let's evaluate each relation:
-
Relation 1: \({(4, 2), (3, 3), (2, 4), (3, 2)}\)
- Here, the input "3" corresponds to two different outputs (3 and 2).
- Not a function.
-
Relation 2: \({(1, -1), (-2, 2), (-1, 2), (1, -2)}\)
- The input "1" corresponds to two different outputs (-1 and -2).
- Not a function.
-
Relation 3: \({(1, 4), (2, 3), (3, 2), (4, 1)}\)
- Each input (1, 2, 3, and 4) has a unique output.
- This is a function.
-
Relation 4: \({(1, 2), (2, 3), (3, 2), (2, 1)}\)
- The input "2" corresponds to two different outputs (3 and 1).
- Not a function.
Based on the evaluations, the relation that is a function is:
Relation 3: \({(1, 4), (2, 3), (3, 2), (4, 1)}\)