2.2.1 · D5Functions

Question bank — Concept of a function — input, output, mapping

1,405 words6 min readBack to topic

This page is a stress-test for the idea of a function. Every question below hides a common trap: a place where beginners quietly break the definition without noticing. Read the parent idea first — Concept of a function — input, output, mapping — then try each item before you flip the answer.

Reveal each answer only after committing to your own. The answer side always gives the reason, not just a verdict — that reasoning is the whole point.


True or false — justify

A function can send two different inputs to the same output.
True. "Exactly one output per input" restricts inputs, not outputs. sends both and to — perfectly legal.
A function can send one input to two different outputs.
False. That is exactly what "exactly one output" forbids; must be a single, predictable value, or the machine is not well-defined.
Every equation in and defines a function of .
False. gives , so yields two -values. An equation is only a function if it pins down one for each allowed .
If a rule's formula is written down clearly, it must be a function.
False. is a clear formula but still assigns two outputs to each positive ; clarity of formula does not guarantee single-valuedness.
A function and its formula are the same thing.
False. The function is the pairing input→output; a formula is just one way to describe it. Tables, graphs, and word-rules describe functions too.
The range of a function always equals its codomain.
False. The codomain is where outputs are allowed to live; the range is what actually comes out. For , codomain is but range is .
A constant rule like is a function.
True. Every input gets exactly one output (always ). "Each input one output" says nothing about outputs having to differ.
If a graph passes the vertical line test, it is a function of .
True. A vertical line at collects every output for that input; hitting the curve once means one output, which is precisely the definition.
Swapping the domain and codomain labels never changes whether something is a function.
False. Direction matters: is a function from to , but reversing it () makes one correspond to two 's — no longer a function.

Spot the error

" is not a function because square roots have a ."
Error. The symbol means the principal (non-negative) root only, so , one value. The appears only when you write it explicitly; alone is single-valued.
"The domain of is since outputs are never negative."
Error. That describes the range. You can square any real number, so the domain is ; the non-negative set is what comes out, not what goes in.
" is a function since all pairs are distinct."
Error. Distinct pairs are not enough. Input appears with two different outputs ( and ), so exactly-one-output is violated.
"Any curve you can draw is a function."
Error. A full circle or a sideways parabola fails the vertical line test — some hits the curve twice, giving two outputs for one input.
"Since and , the functions and are equal."
Error. Agreeing at one input proves nothing. Two functions are equal only if they agree on every input in a shared domain (and have the same domain).
"A relation with a missing input can still be a function if the rest is fine."
Error. "Each element of the domain" must be assigned an output. If input has no output, either it isn't in the domain, or the rule fails to be a function on that domain.

Why questions

Why does a function need "exactly one" output rather than "at least one"?
Because we want determinism should be a single predictable answer so we can compute, substitute, and reason without ambiguity. "At least one" would allow two answers and break every calculation.
Why is a vertical line, not a horizontal line, used to test whether a graph is a function of ?
A vertical line gathers all outputs for a single input ; more than one intersection means that input has multiple outputs. A horizontal line tests something different (whether outputs repeat — relevant to invertibility, not to being a function).
Why is a piecewise rule like still one function, not two?
For any given input you fire only one branch (based on its sign), so each input still produces exactly one output. The branches partition the domain; they never overlap on a single input.
Why can we "fix" the circle into a function by taking ?
Choosing the root discards the lower half of the circle, so each in now keeps just one . Restricting outputs to one branch restores single-valuedness.
Why do we distinguish the function from the value ?
is the whole machine (the rule and its domain); is the single number produced when input is fed in. Confusing them is like confusing a vending machine with the snack it just dispensed.

Edge cases

Is the empty function (domain is the empty set) a function?
Yes. "Each input has exactly one output" is vacuously true when there are no inputs to check — nothing violates the rule, so it counts as a (trivial) function.
Can a function's domain and range be different kinds of things (e.g. names to numbers)?
Yes. Nothing requires inputs and outputs to be the same type; "length of a word" maps strings to numbers and is a perfectly valid function.
For , is in the domain?
No. has no defined value, so cannot be assigned an output; the domain is . Every listed input must actually produce a legal output.
Can two different inputs and the output all be equal, e.g. at ?
The question mixes ideas: for each input maps to itself, one output each, so it is a function. Input equalling its output () is allowed and common (a fixed point).
If a rule gives one output for some inputs and none for others, is it a function?
Only on the restricted domain where outputs exist. As a function on that smaller set it is valid; claiming it as a function on a larger set that includes the gap-inputs is false.
Is a function still a function if we never actually compute any of its values?
Yes. Being a function depends on the definition (each input has one output), not on whether anyone evaluates it. Existence of the rule is enough.
Recall Which two words does almost every trap attack?

"Each" (every input handled — no gaps) and "exactly one" (no input handing back two answers). Diagnose any tricky case by asking which of these two is at risk.


Where to go next

  • Types of Functions — once single-valuedness is secure, classify by injective/surjective behaviour.
  • Inverse Functions — reversing a function needs the horizontal line test, the natural sequel to these traps.
  • Composition of Functions — chaining machines while keeping "one output per input."
  • Graphs of Functions — the vertical line test lives here visually.
  • Real-world Applications — where determinism actually matters.
  • 🇮🇳 Ise Hinglish mein padho →