Let and . A function is defined by the set of ordered pairs:
Determine whether the function is one-to-one, into, or onto.
To solve this, we must understand the definitions of function mappings. A function is one-to-one (injective) if every element in the domain maps to a unique element in the codomain. It is onto (surjective) if the range equals the codomain, and into if the range is a proper subset of the codomain (i.e., there is at least one element in the codomain not mapped to by the domain).
To determine the nature of the function, we analyze the mapping of each element from domain to codomain .
A function is one-to-one if implies . From the given set of ordered pairs:
Since and , we have two different inputs ( and ) mapping to the same output (). Therefore, the function is not one-to-one (it is a many-to-one function).
To decide if a function is onto or into, we compare the Range of the function with the Codomain .
We can see that the element does not have a corresponding pre-image in set . In mathematical terms: Since the Range is a proper subset of the Codomain (), the function is into.
Conclusion: The function is not one-to-one and it is into.