A self-inverse function is a function that is equal to its own inverse. Applying the function twice returns the original input, so and .
The Reasoning
For a function and its inverse , the defining relationship is
If is self-inverse, then can be replaced by :
Equivalently, using the identity function ,
Consider , with domain and range . Composing the function with itself gives
Therefore, , so the function is self-inverse.
Another example is , defined on . Then . The exclusion of matters because the formula is undefined there; self-inverse claims must use a domain on which both compositions are valid.
Graphically, the graphs of a function and its inverse are reflections in the line . A self-inverse function is unchanged by this reflection, meaning its graph is symmetric about .
| Test | What to show |
|---|---|
| Composition test | Simplify (f(f(x))) and obtain for every value in the domain. |
| Algebraic inverse test | Find and show that . |
A function must be one-to-one to have an inverse function, and its domain and range must be handled carefully. For example, on is not one-to-one, so it cannot be self-inverse.
The composition test is usually strongest because it proves both directions at once. However, checking only a few numerical inputs is not a proof; the simplification must hold algebraically for every permitted input. Also confirm that every output remains in the stated domain.
A common misconception is that . This is false: denotes the inverse function, not the reciprocal.
Exam Technique
This is AA HL content in AHL 2.14 and may be tested analytically on Paper 1 or with graphical support on Paper 2. For the command term verify, show the composition ; simply stating that the function is self-inverse is insufficient.
