Let be a function defined as , where and . Then f is:
We are given the function with the definition , where the domain is and the codomain is . Our task is to decide whether the function is invertible and, if it is, to compute its inverse explicitly.
First, we check injectivity. We take two arbitrary points and assume . That equality means
Because both denominators are non-zero (each ), we cross-multiply:
We expand each side completely:
Now we cancel the common term on both sides and gather the remaining terms. Subtract the right side from the left side:
Simplifying the expression inside the brackets, we get
The constants and cancel, leaving
Combining like terms, we have
which is
Thus . Because the only way occurs is when the two inputs are identical, the function is injective.
Next, we verify surjectivity onto . Let an arbitrary be given. We must find an satisfying , that is,
We now solve this equation for . First we write the relation in the equivalent cross-multiplied form:
Expanding the left side gives
We want to gather all terms containing on one side, so we subtract from both sides:
We factor out from the two terms containing it, using the distributive law :
Now we add to both sides, yielding
Because every satisfies , the coefficient is never zero, so we can safely divide by it. Doing so gives us the explicit solution
The obtained expression is defined for every , and that is precisely the set . We also observe that the value can never equal , for if it did we would have
Cross-multiplying that hypothetical equality yields which simplifies to an impossibility. Hence , so . Therefore, for every we have located an satisfying , and surjectivity is proved.
Having shown both injectivity and surjectivity, we conclude that is bijective, i.e., invertible. The algebraic manipulation above already produced the inverse correspondence. We merely rewrite it in the standard inverse notation. By definition of an inverse, if , then . The equation we derived was
So the inverse function is
This formula matches exactly what is written in Option D. No other option provides the correct inverse expression, and we have rigorously demonstrated both the bijectivity and the precise inverse.
Hence, the correct answer is Option D.
Tagged Inverse functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.