Let be defined by
State whether the function is bijective. Justify your answer.
Confirming your payment
Exercise 1.2 · Question 9 of 12
Let be defined by
State whether the function is bijective. Justify your answer.
It helps to compute the first few values before arguing. The table below lists them.
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | |
|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 2 | 2 | 3 | 3 | 4 | 4 |
The pattern is already visible: the values come in equal pairs.
is not one-one.
Take (odd) and (even). Then
So although , and is not one-one. (The same clash happens at every pair: .)
is onto.
Let be any natural number in the co-domain. Consider . Since , the number is a natural number, and it is even, so the second line of the definition applies:
So has the pre-image . As was arbitrary, every element of the co-domain is an image, and is onto.
This one line settles surjectivity for every at once — odd or even, and including , which takes the pre-image — so no case split is needed.
Conclusion.
is onto but not one-one. A bijective function must be both, so is not bijective.

The right-hand panel of the picture is exactly this function drawn for to : each of the targets to has two arrows coming into it, so the map is onto but not one-one. The left-hand panel shows a different parity rule that is a bijection, which is worth comparing so that "the definition splits into odd and even" is not mistaken for a reason either way.