Composite Functions and Inverse Functions
Chapter 1 established what a function is and how to find its domain and range. This chapter develops two ways of combining or undoing functions: building a new function by feeding the output of one function into another (composition), and reversing a function entirely so that effect and cause swap places (the inverse function). Both ideas recur constantly for the rest of the course — composition is the algebraic engine behind the chain rule in Block D, and the inverse-function relationship underlies logarithms, inverse trigonometric functions and every "solve for the input" problem you will meet.
You need the domain/range toolkit from Chapter 1, confident algebraic manipulation, and the horizontal line test. Nothing here requires calculus.
1. Composite Functions: Definition
Given two functions and , the composite function (read " of ", or " composed with ") is defined by
The instruction is to evaluate first, then feed that entire output into . Composition is not multiplication — is a new function built by chaining two machines, not by multiplying and together.
Worked example 1. Let and . Find and .
Key distinction. In general — composition is not commutative. The example above gives two different quadratics, which settles the question for this pair, but it is worth remembering as a general rule, not a coincidence of this example.
2. Evaluating a Composite Function at a Number
To evaluate for a specific number , two routes give the same answer: substitute into the simplified formula for , or work from the inside out, computing first and then applying to that result.
Worked example 2. Using and from Example 1, find by both routes.
Inside-out: , then .
Formula first: , so .
Both give . The inside-out method is usually faster for a single numerical evaluation; the simplified formula is better when must be evaluated repeatedly or analysed further (e.g. for its own domain or range).
3. The Domain of a Composite Function
The domain of is more subtle than it looks, because two conditions must both hold: must be a valid input to , and the resulting output must be a valid input to .
Definition. .
Worked example 3. Let (domain ) and (domain ). Find the domain of .
Every real is a valid input to , so the first condition imposes no restriction. But the output must lie in the domain of , i.e. :
So — exactly what direct inspection of would also give, confirming the two-condition rule is consistent with the shortcut of just finding the domain of the simplified formula. The shortcut can fail, however, when algebraic simplification removes a restriction that genuinely belongs to the composite (see the pitfalls section).
4. Decomposing a Function into Components
The reverse operation — recognising that a given function is really a composite of two simpler functions — is a skill needed constantly in Block D (the chain rule) and useful here for simplifying complicated expressions.
Worked example 4. Express as a composite of two simpler functions.
The "last operation performed" when evaluating at a number is taking a square root — everything else happens first, inside the root. So let the inner function be the expression under the root, and the outer function be the operation applied to it:
This decomposition is not unique — and also reconstruct correctly: . However, not every superficially plausible split works — e.g. and give — so always verify a proposed decomposition by recomposing it.
5. The Inverse of a Function: Definition and Existence
The inverse function of "undoes" : it takes an output of back to the input that produced it.
Definition. If is one-to-one, its inverse is the function satisfying for every in the domain of , and for every in the range of .
The requirement that be one-to-one (Chapter 1, the horizontal line test) is not a technicality — it is forced by the definition of a function. If some output were produced by two different inputs , then would have to equal both and simultaneously, which is impossible for a function (exactly one output per input). This is why on all of has no inverse function, while restricted to does.
Two further facts follow directly from the definition:
- and — inverting a function swaps the roles of domain and range exactly.
- The graphs of and are reflections of each other in the line , because if lies on the graph of (so ), then lies on the graph of (so ) — and reflecting a point in swaps its coordinates exactly.
6. Finding the Inverse of a Function Algebraically
The standard algebraic procedure has three steps: write ; swap and ; solve the new equation for .
Worked example 5 (the routine case). Find for .
So . Check: . ✓.
Worked example 6 (the edge case — domain restriction required). Find for , , and state its domain.
restricted to is one-to-one (Chapter 1), so an inverse exists on this restricted domain. Swap and solve:
Taking the positive square root when solving is the critical step — it is forced by the restriction carried over from the original domain of , not a free choice. Omitting this restriction gives , which is not even a function. So with domain — which, consistent with the domain/range-swapping rule above, is exactly .
7. Verifying an Inverse
Because the swap-and-solve procedure involves irreversible-looking algebraic steps (squaring, taking reciprocals), an inverse found this way should be checked by confirming both composition identities:
Checking only one direction is not sufficient in general (though for most functions met at this level, if one direction works algebraically the other does too) — but the habit of checking matters more for catching an arithmetic slip during the solve step than for a genuine logical gap.
Common Exam Pitfalls
- Writing as . Composition means substitution of one whole function into another, never multiplication of the two formulas.
- Assuming composition is commutative. and are generally different functions; always compute the one actually asked for, in the stated order.
- Ignoring the inner restriction on the domain of a composite. Even if the simplified formula for looks unrestricted, a restriction coming from on the output of can still apply before any algebraic simplification occurs.
- Treating as . The superscript on a function name denotes the inverse function, not a reciprocal — these are unrelated operations that happen to share notation.
- Forgetting that a function needs to be one-to-one before an inverse function exists. Applying the swap-and-solve procedure to a non-one-to-one function (like unrestricted ) produces a relation, not a function — check or impose one-to-one-ness first.
- Dropping the sign restriction carried from the original domain when solving for after a squaring step. This restriction is not optional — it is what makes the resulting inverse a genuine function rather than a two-valued relation.
Summary
- The composite function applies first, then to the result; composition is not commutative in general.
- — both the input to and the output of (as an input to ) must be valid.
- A function has an inverse function exactly when it is one-to-one; and .
- Domain and range swap under inversion: , ; the graphs of and are reflections of each other in .
- To find algebraically: write , swap and , solve for — carrying forward any sign restriction from the original domain when a square root appears.
- Verify an inverse by checking and .