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 f−1 for the reverse rule is earned in §7; until then we just say "the reverse rule" in words.)
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.
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.
So when we write f(x)=3x−7, that whole sentence says: the machine named f takes an input, triples it, then subtracts 7. Setting y=f(x) just gives the output a short name, y.
Collect every such dot and you get the graph of f: a curve where each horizontal position x has a dot sitting at height f(x).
Why does this matter for inverses? Because the whole trick of the reverse rule is a picture move: if (a,b) is on f, then (b,a) 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 y=x — which is why the reverse rule's graph is f's graph flipped over that diagonal. See Domain and Range for how this swap moves the allowed inputs and outputs.
A careful warning about reversing the arrow. It is tempting to write "reverse rule :B→A," but this is only fully correct when f is a bijection (defined in §8): one-to-one and onto. In general the reverse rule can only accept the values f actually produces — its range, which sits insideB but need not fill it. So the honest statement is:
reverse rule:(range of f)→A.
For example f(x)=x−2 has codomain R but range only [0,∞); its reverse rule accepts inputs x≥0, not every real. When fis a bijection, range =B and the tidy form B→A becomes exactly true.
From here on we write f−1 instead of "the reverse rule."
Chaining machines: the composition symbol ∘. To say "run f, then feed the result into g" we write g∘f, read "==g after f==", meaning (g∘f)(x)=g(f(x)) — 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.
Why this is the heart of the matter: if two inputs 2 and −2 both produce 4, then when the reverse machine is handed 4 it cannot decide whether to return 2 or −2. A machine that returns two answers for one input is not a function at all. So invertibility requires one-to-one.
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.
The parabola on the left fails (the line hits twice); the cube-ish curve on the right passes (never more than one hit).
Read the map bottom-up: each box names a foundation, and the arrows show which idea depends on which.
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 x, y, and f.