Which of the Following Is a True Statement About Functions?
The short version is: you’ve probably seen a list of “choose‑one” math facts and thought, “Which one actually holds up?”
Ever stared at a multiple‑choice question that reads, “Which of the following is a true statement about functions?” and felt your brain go blank? You’re not alone. In practice, those questions pop up in high‑school tests, college quizzes, even interview prep sheets for data‑science roles. The trick is that every option looks plausible until you peel back the layers and see what a function really does Simple, but easy to overlook..
In this post we’ll untangle the concept, walk through the logic that separates the true from the false, and give you a toolbox of tips you can actually use next time the question shows up. No fluff, just real talk and a few concrete examples.
It sounds simple, but the gap is usually here.
What Is a Function, Really?
At its core a function is a rule that assigns exactly one output to each input from a given set. If you press “A1” you always get the same chip bag—never a soda and never nothing. Think of it like a vending machine: you put in a code (the input) and you get a snack (the output). That guarantee of a single, well‑defined result is the heart of the definition Simple, but easy to overlook..
Mathematically we write it as
[ f : X \rightarrow Y ]
where X is the domain (all allowed inputs) and Y is the codomain (the “universe” of possible outputs). The key phrase is exactly one—a function can’t hand you two different answers for the same input. If it does, you’re looking at a relation, not a function Small thing, real impact..
Domain, Codomain, and Range
- Domain – every value you’re allowed to feed in.
- Codomain – the set you claim the outputs belong to (often larger than what you actually hit).
- Range – the actual set of outputs you see after applying the rule.
Why does this matter? In real terms, for instance, “Every function maps the domain onto the codomain” is false unless the function is onto (surjective). Because many “true‑statement” questions hinge on these subtle distinctions. Knowing the vocabulary saves you from the trap Small thing, real impact..
One‑to‑One vs. Many‑to‑One
A one‑to‑one (injective) function never sends two different inputs to the same output. A many‑to‑one function does—think of the absolute‑value function: both -3 and 3 become 3. But most true‑statement items will ask you to spot which property holds for a specific function, so keep the injective vs. non‑injective distinction front‑and‑center.
This changes depending on context. Keep that in mind.
Why It Matters
Understanding what makes a statement about functions true isn’t just test‑taking trivia. In practice, functions are the backbone of everything from programming APIs to statistical models. Misreading a property can lead to buggy code, misinterpreted data, or a failed proof Simple, but easy to overlook..
Take the statement “If f ∘ g is defined, then g ∘ f must also be defined.Now, ” In a programming context you might assume you can swap the order of two functions and still get a valid pipeline. Still, turns out that’s rarely true—order matters because the output type of the first must match the input type of the second. Knowing the correct rule saves you from runtime errors Still holds up..
How to Decide Which Statement Is True
Below is a step‑by‑step framework you can apply to any list of options.
1. Identify the type of claim
Is the statement about:
- Existence (e.g., “There exists a function …”)
- Uniqueness (e.g., “A function can have two different outputs for the same input”)
- Properties (injective, surjective, linear, etc.)
- Operations (composition, inversion, addition)?
2. Translate into plain language
Replace symbols with words.
So f(g(x)) → “apply g first, then f”. f⁻¹ → “the inverse of f, if it exists”.
3. Test with simple examples
Pick the smallest possible domain and codomain—often {0,1} or {a,b}—and construct a concrete function. Which means see if the statement holds. If it fails on a tiny example, the statement is false.
4. Check edge cases
What about empty sets? Constant functions? Functions that aren’t onto? Edge cases are where many “trick” statements hide their falsehood.
5. Use known theorems
- Composition:
f ∘ gis defined only when the range ofg⊆ domain off. - Inverse: A function has an inverse iff it’s bijective (both injective and surjective).
- Cardinality: If domain and codomain are finite and have the same size, a function is bijective iff it’s one‑to‑one iff it’s onto.
If the claim contradicts any of these, it’s a red flag Nothing fancy..
Common Mistakes / What Most People Get Wrong
“A function can have two outputs for the same input”
Everyone’s heard of “multivalued functions” in calculus, but those are technically relations. In pure function theory, that statement is false. Because of that, the confusion usually stems from looking at the graph of a circle, which fails the vertical line test. The fix? Remember the vertical line test: if any vertical line hits the graph more than once, you’re not looking at a function Which is the point..
“If f is onto, then f⁻¹ exists”
Only bijective (both onto and one‑to‑one) functions have true inverses. In practice, an onto function that collapses two inputs into one output (like f(x)=x² over ℝ) can’t be reversed uniquely. The correct claim is “If f is bijective, then f⁻¹ exists” It's one of those things that adds up..
“Composition is commutative”
People love to assume f ∘ g = g ∘ f. , when both functions are the identity, or when they happen to commute). g.It’s only true in very special cases (e.In practice, swapping order changes the result—think of “add 2 then double” versus “double then add 2”.
“Every function has a derivative”
Only functions that are differentiable at a point have a derivative there. A function can be perfectly valid (like the absolute‑value function) yet have a sharp corner where the derivative doesn’t exist. The statement is a classic over‑generalization.
Practical Tips – What Actually Works When You Face a True‑Statement Question
- Write the definitions down – A quick glance at “function”, “injective”, “surjective”, “bijection” can clear up most confusion.
- Sketch a tiny table – For a domain
{1,2}and codomain{a,b}, list possible mappings. See whether the claim survives. - Watch the word “always” – Any statement with “always” is suspect; look for a counterexample.
- Mind the quantifiers – “There exists” vs. “For all” changes the logical load dramatically.
- Eliminate the impossible – If an option contradicts a basic theorem (like the pigeonhole principle), cross it out immediately.
- Use the process of elimination – Often two options are mutually exclusive; picking one narrows the field.
- Don’t overthink the notation –
f(g(x))is just “apply g then f”. If you can describe it in words, you’ve already mastered the step.
FAQ
Q: Can a function have an empty domain?
A: Yes. The empty set maps to any codomain vacuously, and the function is considered both injective and surjective.
Q: Is the inverse of a non‑bijective function ever a function?
A: Only if you restrict the domain to make it bijective (think of restricting f(x)=x² to x≥0). The unrestricted inverse is a relation, not a function Not complicated — just consistent..
Q: Does “onto” guarantee that every element of the codomain is hit exactly once?
A: No. “Onto” (surjective) means every codomain element is hit at least once. It says nothing about uniqueness—that’s the job of “one‑to‑one” Most people skip this — try not to. No workaround needed..
Q: If two functions have the same graph, are they the same function?
A: As long as they share the same domain and codomain, yes. Different domains can produce identical graphs on the overlapping region, but they’re technically distinct functions Surprisingly effective..
Q: How do I know if a composition f ∘ g is defined?
A: Check that the range of g (the actual outputs) fits inside the domain of f. If you only know the codomain of g, you may need to verify that the specific outputs land where f expects input.
That’s it. That's why the next time you see a list of statements about functions, you’ll have a clear mental checklist: define, test with tiny examples, watch for “always”, and lean on the core theorems. Functions may look abstract, but they behave predictably once you respect the one‑output‑per‑input rule. Good luck, and may your answers always be true.
