Let and the relation is defined by , . Then, this function is:
Previous Year Questions · Question 9 of 37
Let X = x² : x N and the relation f : N X is defined by f(x) = x² , x N . Then, this function is:
(A) injective only
(B) not bijective
(C) surjective only
- Correct answer
(D) bijective
Option (D) is correct.
Explanation: Read the codomain carefully before anything else. It is not ; it is , the set of perfect squares of natural numbers. That single fact decides the question.
One-one (injective). Let with . Then
Since , both are at least , so . The first factor can never be zero, so the second one must be: , i.e. . Hence is one-one.
Onto (surjective). Take any in the codomain . By the very definition of , there is some with . For that we have . So every element of the codomain has a pre-image, and is onto. (This is why was defined the way it was: the codomain has been trimmed down to exactly the set of outputs.)
One-one and onto together mean is bijective, so (D) is correct.

Why the other options are wrong:
| Option | The mistake |
|---|---|
| (A) injective only | Reading the codomain as instead of . On the map really is injective only, because , , , are then in the codomain and have no pre-image. But and , so they are not in this codomain at all and cannot witness a failure of ontoness. |
| (B) not bijective | The same codomain slip, stated as a negation. is bijective here. |
| (C) surjective only | Onto is right, but injectivity is then wrongly denied — usually by arguing and forgetting that is not a natural number. |
