Let and be defined by
Compute both composites and then decide which one of the following statements is true.
Confirming your payment
Competency-Based Questions (CBQ) · Question 46 of 80
Let and be defined by
Compute both composites and then decide which one of the following statements is true.
(A) , but .
(B) is not defined, because the range of is not contained in the domain of .
(C) is injective but not surjective, so has no inverse.
(D) Both and are bijections, and each is the inverse of the other.
Option (D) is correct.
Step 1 — compute . Substitute into . Work on the numerator and the denominator of separately:
Dividing, the factors cancel:
Step 2 — compute . The same trick:
so as well.
Step 3 — read off the conclusion. Both composites are the identity on their own domains. That is exactly the definition of being invertible with inverse — and an invertible function is a bijection. So and are both bijections with and . That is option (D).
You can confirm the inverse directly: solving gives , so and — which is exactly , and it is defined for every .

Why each other option fails
| Option | The mistake behind it |
|---|---|
| (A) | Computing only and assuming the other order must differ. Here it does not — Step 2 shows too. |
| (B) | Not checking the codomains. lands in , which is exactly the domain of , so is defined. |
| (C) | Confusing " misses the value " with " is not onto". The declared codomain is , and hits every element of it, so is onto. |
Note that (A), (B) and (C) are three different errors, and each is false for a reason you can point to in the computation above.