2.2.3 · D5Functions
Question bank — Function notation — f(x), g(x)
Before we start, three shared pictures to hold in your head.

The two trap pictures you will need — composition order and the shift transformations — are shown here so the geometry is concrete before you test yourself.


True or false — justify
True or false: If then .
False. is the rule (a machine); is a number-valued expression. You may only write , equating the output to the expression, never the machine itself to a number.
True or false: is a function.
False. is the function; is a single number — the output of that function at the one input .
True or false: The letters and carry meaning, so I must always use exactly those.
False. They are just names. defines the same machine as ; only the rule matters, not the letters chosen for name or input.
True or false: for the rule .
False. , but . The first changes the input before squaring; the second changes the output after.
True or false: always equals .
False in general. For , but . Only special ("linear through origin") rules like let the multiplier slide out.
True or false: and describe the same combined machine.
False. Composition is not commutative — does first then , while does first then ; different order, generally different output (see figure s02).
True or false: and describe the same object.
True. They are the same relationship seen two ways: the equation stresses the – link (with the output height), the notation stresses the named rule. Write to bridge them.
True or false: If then must equal .
False. Different inputs can share an output — e.g. gives . (Only one-to-one functions forbid this, which is why they alone have inverses; see Inverse functions.)
True or false: means .
False. is the inverse machine that undoes , not a reciprocal. The is a "reverse the process" mark, not an exponent. (See Inverse functions.)
True or false: The name inside tells you what to compute.
False. The name tells you which rule; the thing in the slot (the dot) is the input fed to that rule. Same input, different name → different answer.
Spot the error
", so ." — find the flaw.
Wrong: the whole input is squared, so . Squaring does not distribute across a sum.
", and I want of the number , so I write ." — flaw?
The notation is wrong even though the number is right. means "apply rule to input ", written with brackets; would mean multiplying the machine by , which is meaningless.
"To find I compute first, then feed it to ." — flaw?
Order reversed. is read inside-out: evaluate first, then apply to that result (see figure s02). The function closest to the input acts first.
", therefore ." — flaw?
is not in the domain of over the reals, so is simply undefined — you cannot substitute an input the machine does not accept. (See Function definition and domain.)
"Since and is a variable, I can also write ." — flaw?
You cannot subtract from the machine . To isolate the input you'd write , treating (the output number) as the quantity, not .
" isn't a real function because there's no on the right." — flaw?
It is a perfectly valid function — the constant function that outputs for every input. A rule is allowed to ignore its input.
" means multiply the whole function by ." — flaw?
No — replaces the input by before the rule runs. Multiplying the output by would be , a different thing.
Why questions
Why do we bother naming the rule instead of always writing ?
So we can name several rules at once (), combine them like , and talk about a function's properties without picking specific numbers.
Why must we substitute the entire input expression, brackets and all, into the rule?
Because the machine acts on whatever single quantity you hand it; treating as one input keeps the substitution unambiguous and prevents dropping cross-terms like in .
Why is reading composition right-to-left the correct habit?
Because in the input physically enters first (the innermost bracket) and only the result travels outward to ; the layout mirrors the flow of the data (figure s02).
Why can't we write ""?
It equates a process (the machine) to a number-valued expression. A process has no numeric value until fed an input, so the equation is a category error; write instead.
Why does "" being a number, not a rule, actually matter in practice?
Because once is a number, you can drop it into another machine — that is exactly what makes composition, e.g. , legal and unambiguous (see Composite functions).
Why does swapping the input letter (e.g. instead of ) not change the function?
The input letter is a placeholder — the empty slot filled with any letter; the rule pattern ("square it, add one") is what defines the machine, so any consistent letter names the same function.
Edge cases
What is for , and what does it mean geometrically?
; every term with vanishes, leaving the constant, which is the -intercept — where the curve crosses the vertical () axis (see Graphing functions).
If is a constant function , what is ?
Still . Feeding back into a machine that always returns changes nothing — constant functions absorb any input.
Can the input to itself be another function's output that is undefined?
If the inner output is undefined (input outside its domain), the whole composition is undefined — you cannot feed a machine something that never came out. Domains must line up (see Composite functions).
For , is different from ?
Yes. , then , so nesting applies the rule twice — very different from applying it once.
Is (the identity machine) a "real" function, and what does it do in composition?
Yes; it outputs its input unchanged, so and — it acts like the number does for multiplication, leaving other machines untouched.
What happens to versus as a graph transformation?
shifts the graph left by 2 (input changed first); shifts it up by 2 (output changed after). Same , perpendicular effects — compare the two shifted curves in figure s03 (see Function transformations).
Recall One-line summary to carry away
is the machine, is the input, is the output number — mix these up and every trap above springs shut.
Connections
- Parent — the notation this bank stress-tests
- Composite functions — order and domain-matching traps (figure s02)
- Inverse functions — the -is-not-reciprocal trap
- Function definition and domain — domain, codomain and undefined-input edge cases (figure s01)
- Graphing functions · Function transformations — geometric meaning of , and vs (figure s03)