Consider f: ℝ → ℝ defined by f(x) = x². A student says 'we can just redefine the codomain to [0, ∞) to make this function surjective — the formula is the same either way.' What is the most precise response?
AThe student is wrong; surjectivity depends only on the formula, not the codomain
BThe student is correct; the codomain is just a label and doesn't affect whether the function is surjective
CBoth functions are valid, but f: ℝ → ℝ is not surjective while f: ℝ → [0, ∞) is a different, surjective function — codomain is part of the function's specification
DSurjectivity cannot be determined until you know the range, which is the same regardless of the codomain
The codomain is part of a function's formal definition, not merely a label. f: ℝ → ℝ and f: ℝ → [0, ∞), both defined by f(x) = x², are technically different mathematical objects — they differ in their codomain. The first is not surjective (negative reals are never outputs); the second is surjective (every nonnegative real is an output). Changing the codomain changes the function, and whether it is surjective depends on whether the range equals the declared codomain.
Question 2 Multiple Choice
Which of the following correctly identifies the range of f: ℝ → ℝ defined by f(x) = sin(x)?
Aℝ, because the codomain is ℝ and the range must equal the codomain
B[−1, 1], the set of all values actually produced as outputs of f
C[0, 1], since sine is nonnegative for inputs in [0, π]
DThe range cannot be determined without knowing the specific inputs
The range is the set of outputs actually attained: {f(x) : x ∈ ℝ} = [−1, 1]. The codomain (ℝ) is the declared target set, which is larger than the range. The range is always a subset of the codomain, but can be strictly smaller — as it is here. The function is not surjective precisely because the range does not equal the codomain.
Question 3 True / False
Two functions with the same formula but different declared codomains are the same mathematical function.
TTrue
FFalse
Answer: False
A function is formally specified by three things: its domain, its codomain, and its rule. Changing any one of these produces a different function. f: ℝ → ℝ and f: ℝ → [0, ∞), both given by f(x) = x², differ in codomain and are therefore different functions — most importantly, one is surjective and one is not. This distinction only matters in rigorous mathematics, but it is essential for correctly defining and reasoning about properties like surjectivity.
Question 4 True / False
The range of a function f: A → B is always a subset of its codomain B.
TTrue
FFalse
Answer: True
By definition, the range is {f(a) : a ∈ A} — the set of all outputs produced by elements of A. Every output must land in B (that is what it means for the function to map into B), so the range is contained in B. The range equals B if and only if f is surjective. In all other cases, the range is a proper subset of B.
Question 5 Short Answer
Why does the distinction between codomain and range matter for determining whether a function is surjective? Give an example.
Think about your answer, then reveal below.
Model answer: A function is surjective if and only if its range equals its codomain — every element of the codomain is achieved as an output. If the codomain and range are confused, surjectivity becomes undefined or circular. For example, f(x) = x² with codomain ℝ is not surjective (negative numbers are never outputs, so range ≠ codomain). But with codomain [0, ∞), the same formula gives a surjective function (every nonnegative real is achieved). The codomain is what you promise; the range is what you deliver — surjectivity asks whether the promise is kept.
This distinction also controls how function composition and inverses work. A surjective function can be right-inverted; one that is not surjective cannot. Without distinguishing codomain from range, you cannot meaningfully define or check surjectivity.