Let be a function defined as , where for some . Show that f is invertible and its inverse is
The function is defined by , where and .
Step 1: Verify injectivity
Assume . Then
.
Hence is one-one (injective).
Step 2: Verify surjectivity
Take any . By definition of , there exists some such that
.
Thus every element of is an image of some element of , so is onto (surjective).
Since is both injective and surjective, it is bijective, therefore invertible.
Step 3: Find the inverse rule
Start with .
Solve for :
.
Define by
.
Step 4: Verify that is the inverse
1. for every .
2. for every .
Both compositions give the respective identity functions, so .
Therefore the inverse of is .
Option D which is:
Tagged Inverse functions. Machine-assigned, so read it as a strong shortlist rather than a verdict.