What is an Inverse?
An inverse undoes a function.
If f takes you from a to b, then f−1 takes you from b back to a.
f:A→B,f−1:B→A
The Defining Property
f−1(f(a))=a,f(f−1(b))=b
Applying f then f−1 (or vice versa) gets you back to where you started.
In terms of composition:
f−1∘f=idA,f∘f−1=idB
Example
f(x)=x+3,f−1(x)=x−3
Check:
- f(5)=8
- f−1(8)=5
Back to start.
When Does an Inverse Exist?
Only when f is bijective.
Why not injective?
Two inputs map to the same output — you can’t reverse it.
Why not surjective?
Some output is never hit — f−1 has nowhere to send it.
Bijective = invertible.
Example: No Inverse
f(x)=x2 where f:R→R
This is not injective:
- f(3)=9
- f(−3)=9
So f−1(9) is undefined — two possible answers.
Fix: Restrict the domain to R≥0. Then f−1(x)=x works.
Finding an Inverse
To find f−1:
- Write y=f(x)
- Solve for x in terms of y
- Swap x and y
Example:
f(x)=2x+1
- y=2x+1
- x=2y−1
- f−1(x)=2x−1
Key Facts
- Only bijective functions have inverses
- (f−1)−1=f (inverse of inverse is original)
- (g∘f)−1=f−1∘g−1 (reverse order)