Answer:
The function is injective (one-to-one).
Explanation:
The definition of an injective function follows.
Let be sets. Let be a function. We say is injective if, for all , implies .
This is the proof that is injective.
Let and assume . This means . Subtracting gives , then dividing by gives . Thus is injective.
4.7m questions
6.1m answers