- The IMAGE is forward (x → f(x)): REPLACE and compute — f(3) = 7. Exactly ONE per input.
- The PREIMAGE is backward (f(x) → x): SOLVE the equation f(x) = y. Several, one, or NONE.
- x² = 9 has TWO preimages (x = 3 or x = −3) ; x² = −4 has none.
The Machine and Its Two Questions
A FUNCTION is a machine: feed it x, it returns f(x) — and this year names the two questions you can ask it, in opposite directions. The IMAGE is the forward question — "what comes out for this input?" — you REPLACE and COMPUTE: f(3) = 2·3 + 1 = 7, the image of 3 is 7. The PREIMAGE (antecedent) is the backward question — "what input gives this output?" — you SOLVE an equation: 2x + 1 = 7 → x = 3, 3 is a preimage of 7. The asymmetry is the heart of the chapter: an input has EXACTLY ONE image (the machine is deterministic — one x in, one f(x) out), but an output may have SEVERAL preimages, ONE, or NONE. x² = 9 has TWO preimages (x = 3 or x = −3); x² = 0 has one; x² = −4 has NONE (no real square is negative). The grammar that summarises the course: "THE image" (there is only one), "A preimage" (there may be many) — the articles carry the whole logic, and swapping them is swapping the direction of the machine.
The Two Directions
| The Question | The Direction | The Method | How Many |
|---|---|---|---|
| Image | Forward: x → f(x) | REPLACE and compute | Exactly ONE per input |
| Preimage | Backward: f(x) → x | SOLVE the equation f(x) = y | Several, one, or NONE |
| The example | f(x) = 2x + 1 | f(3) = 7 ; preimage of 7 is 3 | One-to-one here |
| Two preimages | x² = 9 | x = 3 or x = −3 | The square's two roots |
| No preimage | x² = −4 | impossible in reals | The output is unreachable |
| The grammar | THE image, A preimage | Articles carry the logic | One image, many preimages |
f(x) = 2x + 1. The image of 3?
The image is the FORWARD question: replace x by 3, compute 2·3 + 1 = 7. The 3 is what you'd START from (a preimage of 7, the backward question); the machine takes 3 IN and puts 7 OUT — image and preimage are opposite directions.
Counting Preimages, the Grammar of Articles
Counting preimages: how many x give f(x) = 9 when f(x) = x²? SOLVE x² = 9 — TWO answers, x = 3 or x = −3 (both square to 9): 9 has two preimages. But f(x) = 0? x² = 0 has one (x = 0). And f(x) = −4? x² = −4 is impossible in the reals: ZERO preimages, the output −4 is unreachable by a square. The count is the answer, and it varies: solving is the only way to know.The grammar carries the logic: we say "THE image of 3" (definite article — there is exactly one) but "A preimage of 9" (indefinite — there may be several). The articles aren't decoration: they encode the machine's asymmetry, forward is deterministic, backward is not. A student who says "the preimage of 9" has already lost x = −3; the indefinite article keeps the door open for every root.
The Reversed Direction — and the Missing Preimages

How many preimages does 9 have for f(x) = x²?
Solve x² = 9 — TWO real roots, x = 3 AND x = −3 (both give 9 when squared). Answering "one" buries x = −3 (the negative root); a square reaches 9 from both directions. The output's preimage count is whatever the equation yields — here, two.
Case File: The Pricing Machine










- The IMAGE is forward (x → f(x)): REPLACE and compute — f(3) = 7. Exactly ONE per input.
- The PREIMAGE is backward (f(x) → x): SOLVE the equation f(x) = y. Several, one, or NONE.
- x² = 9 has TWO preimages (x = 3 or x = −3) ; x² = −4 has none.
- The grammar: "THE image" (unique), "A preimage" (possibly many) — the articles carry the logic.
- Replace for images, solve for preimages — reversing the method answers the wrong question.



