2.2.9 · D1Functions

Foundations — Inverse functions — finding f⁻¹(x), horizontal line test

2,800 words13 min readBack to topic

Before you can find the inverse or trust the horizontal line test, you need to read every mark on the page fluently. This note builds each symbol from nothing, in an order where each one leans only on the ones before it. Nothing here is assumed — if the parent note used it, we build it. (The notation for the reverse rule is earned in §7; until then we just say "the reverse rule" in words.)


0. The starting picture: input → box → output

Everything begins with the idea of a function. A relaxed way to picture it is a machine: an arrow goes in on the left carrying a number, a labelled box does something to it, and an arrow comes out on the right carrying a new number.

Figure — Inverse functions — finding f⁻¹(x), horizontal line test

But "machine" is just a picture. Here is the precise statement it stands for.

The whole chapter is careful bookkeeping about that rule and whether we can build a second rule that reverses it.


1. The symbol — the input


2. The symbol — the output


3. The notation and — naming the box

So when we write , that whole sentence says: the machine named takes an input, triples it, then subtracts . Setting just gives the output a short name, .


4. Ordered pairs and the graph

Collect every such dot and you get the graph of : a curve where each horizontal position has a dot sitting at height .

Figure — Inverse functions — finding f⁻¹(x), horizontal line test

Why does this matter for inverses? Because the whole trick of the reverse rule is a picture move: if is on , then is on the reverse rule. It just reads every dot backwards. Swapping the coordinates of a point is exactly reflecting it across the diagonal line — which is why the reverse rule's graph is 's graph flipped over that diagonal. See Domain and Range for how this swap moves the allowed inputs and outputs.


5. Domain and range — the allowed inputs and outputs

The key fact for this chapter: the inverse swaps them.

This is why (inputs , outputs ) has reverse rule restricted to inputs . Full detail lives in Domain and Range.


6. Set notation: , , , and "onto"

A careful warning about reversing the arrow. It is tempting to write "reverse rule ," but this is only fully correct when is a bijection (defined in §8): one-to-one and onto. In general the reverse rule can only accept the values actually produces — its range, which sits inside but need not fill it. So the honest statement is:

For example has codomain but range only ; its reverse rule accepts inputs , not every real. When is a bijection, range and the tidy form becomes exactly true.


7. The exponent notation — the reverse machine

From here on we write instead of "the reverse rule."

Chaining machines: the composition symbol . To say "run , then feed the result into " we write , read "== after ==", meaning — apply the inner machine first, then the outer. Notice the order reads right-to-left. The defining equations for the inverse are exactly two such chains, now that every symbol is earned:

Chaining two machines like this is called Function Composition — the operator is precisely the tool we use to verify an inverse.


8. One-to-one (injective), and bijection

Why this is the heart of the matter: if two inputs and both produce , then when the reverse machine is handed it cannot decide whether to return or . A machine that returns two answers for one input is not a function at all. So invertibility requires one-to-one.

Figure — Inverse functions — finding f⁻¹(x), horizontal line test

9. The horizontal line test — reading one-to-one off the graph

First a symbol we will lean on: (read "if and only if") joins two statements that are true together or false together — each one guarantees the other. With that in hand:

Why it works, in one sentence: a horizontal line collects all points sharing one output value, so two hits mean two inputs sharing that output — exactly the failure of one-to-one.

Figure — Inverse functions — finding f⁻¹(x), horizontal line test

The parabola on the left fails (the line hits twice); the cube-ish curve on the right passes (never more than one hit).


How these feed the topic

Read the map bottom-up: each box names a foundation, and the arrows show which idea depends on which.

x the input

f of x the machine

y the output

ordered pair a b

graph curve of dots

domain and range

horizontal line test

one to one no collisions

onto every value hit

bijection one to one plus onto

f inverse reverse machine

finding f inverse swap method

So the swap method (the actual skill) needs the reverse-machine idea, which needs a bijection — one-to-one plus onto — which rests on the one-to-one condition, read off the graph via the horizontal line test, which itself needs the graph, pairs, and the meanings of , , and .


Equipment checklist

Cover the right side and answer before revealing.

What three things make up a function?
A domain (allowed inputs), a codomain (a set holding the outputs), and a rule giving each input exactly one output.
What does mean, and what does it NOT mean?
It means "apply rule to input "; it does not mean " times ."
In the pair on the graph of , what equation does it encode?
— input gives output .
Where does the point move to on the graph of ?
To — coordinates swap, i.e. reflection across .
What does mean, and why is it NOT ?
It is the machine that undoes (); the reciprocal solves a totally different equation ().
What does the composition mean, and in what order?
— apply the inner machine first, then .
State the one-to-one condition in symbols.
.
What does "onto" mean?
Every value in the codomain is actually produced by some input — none is left unhit.
What two properties make a function a bijection?
One-to-one (no collisions) and onto (every codomain value is hit).
Why does a horizontal line hitting the graph twice mean no inverse?
Two inputs share one output, so the reverse machine can't pick one answer — not a function.
How do domain and range change when you invert, and where do the inputs of live?
They swap; the inputs of are the range of (inside ), not all of the codomain .
What does mean and when is it allowed?
The non-negative number whose square is ; only defined for .
What does stand for, and what does say?
is all real numbers; says is any point on the number line.
What does the symbol assert?
"If and only if" — both statements are true together or false together.

Next: with the vocabulary secured, move to the parent topic note and the swap-method worked examples.