Given
with
. We need to show that
is not one-to-one, not onto, and not bijective.
To show that
is not one-to-one, we need to demonstrate that there exist two distinct elements
and
in the domain
such that
.
Let's consider
and
. Plugging these values into the equation for
, we have:


Since both
and
evaluate to
, we can conclude that
is not one-to-one.
Next, to show that
is not onto, we need to find an element
in the domain
for which there is no corresponding element
in the codomain
.
Let's consider
. Plugging this value into the equation for
, we have:

Since the denominator is non-zero, we can see that
is undefined. Therefore, there is no corresponding element in the codomain
for
, indicating that
is not onto.
Finally, since
is neither one-to-one nor onto, it is not bijective.
Hence, we have shown with justification that
is not one-to-one, not onto, and not bijective.