Aller au contenu
Ludicademy
English
Thème Élan
ClairsSombres
S’inscrire
2de · Fonctions

Image and preimage

la machine et ses deux questions

≈ 5 min read · level 2de · three questions at the end

Version française English version

In brief
  • 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 QuestionThe DirectionThe MethodHow Many
ImageForward: x → f(x)REPLACE and computeExactly ONE per input
PreimageBackward: f(x) → xSOLVE the equation f(x) = ySeveral, one, or NONE
The examplef(x) = 2x + 1f(3) = 7 ; preimage of 7 is 3One-to-one here
Two preimagesx² = 9x = 3 or x = −3The square's two roots
No preimagex² = −4impossible in realsThe output is unreachable
The grammarTHE image, A preimageArticles carry the logicOne image, many preimages
Exercice

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

The direction fault, the chapter's root: confusing IMAGE with PREIMAGE — "the image of 3" computed by SOLVING, or "a preimage of 7" found by REPLACING: image is forward (replace, compute), preimage is backward (solve an equation); the question's phrasing sets the direction, and reversing it answers the wrong question entirely. The uniqueness confusion: expecting one preimage because there's one image — an input has exactly ONE image (deterministic machine), but an output may have many preimages: x² = 9 gives TWO; assuming one buries x = −3. The missing preimage: forgetting that some outputs have NONE — x² = −4 is unreachable, and "solving" it into a real answer invents a root; when the equation has no real solution, the honest count is zero. And the article slip: "THE preimage" when several exist — the definite article claims uniqueness the backward direction rarely has. Replace for images, solve for preimages, count honestly, mind the articles: the machine's two questions, kept straight.
Exercice

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

OscarFunctions file: image and preimage. Skelet, the toll machine charges f(x) = 2x + 1 crowns for x leagues — the toll for 3 leagues, for the register?
SkeletThe IMAGE, the forward question: replace and compute — f(3) = 2·3 + 1 = 7 crowns. The machine takes three leagues IN, puts seven crowns OUT: one input, exactly one image, the toll booth being a deterministic sort of machine. Seven crowns, no ambiguity — the forward direction never hesitates.
OscarThe clerk then asks which distance costs exactly 7 crowns, and "computes f(7)".
SkeletThe reversed direction: he's asking the BACKWARD question — a preimage — but reaching for the forward method. To find which x gives 7, SOLVE 2x + 1 = 7, so x = 3 leagues. Replacing gives images; solving gives preimages. His f(7) would answer a question no one asked (the toll for seven leagues, fifteen crowns). The phrasing sets the direction.
OscarThe direction is corrected. The surveyor's model is f(x) = x², and he seeks the distance giving area 9.
SkeletThe backward question with TWO answers: solve x² = 9 — x = 3 OR x = −3, two preimages. A square reaches 9 from both sides; "the preimage" would bury the negative root, and the indefinite article keeps both alive — A preimage, not THE. One image forward, possibly many backward: the machine's asymmetry, written in the articles.
OscarBoth roots are kept. Last query: he seeks the distance giving area −4.
SkeletThe unreachable output: x² = −4 has NO real preimage — no real square is negative, and the count is honestly ZERO. Forcing a real answer would invent a distance that doesn't exist; when the equation has no solution, the output is simply unreachable by this machine. Some outputs have two doors, some one, some none — the count is whatever the equation grants.
OscarThe impossible is left unsolved. Directions sorted, roots counted, articles minded: stamp — THE image apposed (one), and A preimage sought (perhaps many), as the machine's grammar commands.
SkeletThe two-direction stamp: forward it lands once, backward it may land twice or never. The tolls close at image 7 forward, preimages {−3 ; 3} backward, and −4 unreachable — replaced, solved, and counted with the honesty the machine demands.

Remember
  • 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.

Maintenant, jouez-la

Trois questions pour voir

La règle est lue. Voyons si elle est entrée : trois questions, ici même, sans compte.

102 exercices corrigés de maths en 2de → sans compte, corrigés à chaque réponse

La règle est lue ; il reste à la faire entrer. Trois minutes suffisent.

Jouer « le pont de cordes » → Quiz Express · sans compte

Ou choisissez votre salle :

Et côté jeux de société : 🎪 Jeu de calcul mental → les règles de jeu de calcul mental

Toutes les leçons 2de