Algebra · Functions
1 / 8
Inverse functions
Why f⁻¹ runs the machine backwards (and is NOT 1/f), the write-swap- rearrange recipe for finding it, and the ff⁻¹(x) = x check that catches every error.
Algebra · Functions
Inverse functions
Why f⁻¹ runs the machine backwards (and is NOT 1/f), the write-swap- rearrange recipe for finding it, and the ff⁻¹(x) = x check that catches every error.
Why it works
The inverse function runs the machine backwards: if turns 5 into 11, then turns 11 back into 5. The notation is a whole symbol — is NOT and the is not a power; it's the "undo" badge.The recipe: write, swap, rearrange. For :
- Write the machine as an equation: .
- Undo it — make the subject: .
- The inverse machine, written in the usual letter:
Every rearranging skill transfers — including factorising out when the variable appears twice: for , clearing the fraction and collecting gives .
The check that never lies: feed one through the other — must return plain . Quick numeric version: , so had better be 5: . ✓ Ten seconds, and it catches swapped signs, unflipped operations, all of it.
Evaluating an inverse at a number needs no formula-hunting if you think backwards: asks "what input gives 20?" — solve . With the formula in hand it's substitution as usual.
Some machines are their own undo. : subtracting from 4 twice returns the start — — so , a self-inverse. ( behaves the same way.) If your rearranging lands back on the original formula, that's not an error; it's a property worth stating.