Given that , and the function is defined by the set of ordered pairs:
Check whether the function is one-to-one, onto and/or into.
A function is one-to-one (injective) if every distinct element in the domain maps to a distinct element in the codomain. A function is onto (surjective) if the range of the function is equal to its codomain, meaning every element in the codomain is mapped to by at least one element in the domain.
To determine the nature of the function, we first list the mappings provided by the set of ordered pairs:
A function is one-to-one if for every , implies . In this case, we observe that:
Since each value in the domain maps to a different, unique value in the codomain , the function is one-to-one.
A function is onto if the Range of the function is equal to the Codomain .
Since , every element in has a pre-image in . Therefore, the function is onto.
A function is called an "into" function if there is at least one element in the codomain that does not have a pre-image in the domain (i.e., the Range is a proper subset of the Codomain). Because this function is onto (), it is not an into function.