Let \(f : N → N\) be defined by \[f(n) =\begin {cases}\dfrac{n+1}{2}, \text {if n is odd}\\\text {for all n\(\in\) N}.\\ \dfrac{n}{2},\text{if n is even}\end {cases}\]
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a machine that takes any counting number and gives back another number. Odd numbers go through one door, even numbers through another. Both doors sometimes spit out the same result, so two different inputs can share one output. That means the machine is not perfectly one-to-one. But every possible counting number can come out of the machine eventually, so nothing is left out. Because two inputs can share an output but every output is reachable, the function is onto but not one-one.
Answer: The function \( f \) is onto (surjective) but not one-one (not injective). Hence it is not bijective and not invertible. For example, \( f(1) = f(2) = 1 \) shows failure of one-one, while \( f(2m) = m \) for every \( m \in N \) shows it is onto.
A function \( f : A \to B \) is one-one (injective) if different inputs always give different outputs, that is \( f(a) = f(b) \Rightarrow a = b \). It is onto (surjective) if every element of the codomain \( B \) is the image of at least one element of \( A \). If a function is both one-one and onto, it is called bijective (invertible). Here the function is defined piecewise: it treats odd numbers and even numbers by two different rules. To test surjectivity we check whether every natural number can be produced as an output, and to test injectivity we check whether any two different inputs can produce the same output.
\[ f(n) = \begin{cases} \dfrac{n+1}{2}, & n \text{ is odd} \\ \dfrac{n}{2}, & n \text{ is even} \end{cases} \]
The function \( f \) is onto (surjective) but not one-one (not injective). Hence it is not bijective and not invertible. For example, \( f(1) = f(2) = 1 \) shows failure of one-one, while \( f(2m) = m \) for every \( m \in N \) shows it is onto.
A common mistake is to conclude that because the odd rule and even rule look different, the function must be one-one. Students forget to actually test pairs like \( n = 1 \) and \( n = 2 \), which both map to \( 1 \), proving the function is not one-one.
The function \( f \) is onto (surjective) but not one-one (not injective). Hence it is not bijective and not invertible. For example, \( f(1) = f(2) = 1 \) shows failure of one-one, while \( f(2m) = m \) for every \( m \in N \) shows it is onto.
One common mistake: students check only the odd-rule inputs (or only the even-rule inputs) when verifying injectivity, missing the fact that an odd input and an even input can produce the same output — for instance, \( f(1) = f(2) = 1 \) involves one odd and one even number, so comparing within just one case is not enough.
Answer: The function \( f \) is onto (surjective) but not one-one (not injective). Hence it is not bijective and not invertible. For example, \( f(1) = f(2) = 1 \) shows failure of one-one, while \( f(2m) = m \) for every \( m \in N \) shows it is onto.
Question: Let \( g : \mathbb{N} \to \mathbb{N} \) be defined by \[g(n) = \begin{cases} \dfrac{n+3}{2} & \text{if } n \text{ is odd} \\ \dfrac{n}{2} & \text{if } n \text{ is even} \end{cases}\] Determine whether \( g \) is one-one and/or onto.
Solution: Step 1 — Check one-one (injective). Consider two odd values: \( g(1) = \dfrac{1+3}{2} = 2 \) and \( g(3) = \dfrac{3+3}{2} = 3 \). Now consider even values: \( g(2) = \dfrac{2}{2} = 1 \) and \( g(4) = \dfrac{4}{2} = 2 \). Notice that \( g(1) = 2 \) and \( g(4) = 2 \), yet \( 1 \ne 4 \). So two distinct inputs give the same output. Therefore \( g \) is NOT one-one. Step 2 — Check onto (surjective). We need every \( y \in \mathbb{N} \) to be attained. For even values, \( g(n) = \dfrac{n}{2} \) gives \( 1, 2, 3, \ldots \) as \( n = 2, 4, 6, \ldots \) However, the odd-input rule \( g(n) = \dfrac{n+3}{2} \) gives outputs starting from \( \dfrac{1+3}{2} = 2 \). So the output \( y = 1 \) is only reachable via the even rule: \( g(2) = 1 \). The output \( y = 2 \) is reached by both \( g(1) = 2 \) and \( g(4) = 2 \). In general, every natural number \( y \in \mathbb{N} \) equals \( g(2y) = \dfrac{2y}{2} = y \). Hence every \( y \) is attained and \( g \) is onto. Conclusion: \( g \) is onto but NOT one-one, so it is NOT bijective.
Answer: g is onto but not one-one (not bijective).
Question: Let \( h : \mathbb{N} \to \mathbb{Z} \) be defined by \[h(n) = \begin{cases} \dfrac{n-1}{2} & \text{if } n \text{ is odd} \\ -\dfrac{n}{2} & \text{if } n \text{ is even} \end{cases}\] Show that \( h \) is both one-one and onto (i.e., bijective).
Solution: Step 1 — Identify the outputs for small values to understand the pattern. For odd \( n \): \( h(1) = 0,\; h(3) = 1,\; h(5) = 2,\; h(7) = 3, \ldots \) For even \( n \): \( h(2) = -1,\; h(4) = -2,\; h(6) = -3,\; h(8) = -4, \ldots \) So the range is \( \{0, 1, -1, 2, -2, 3, -3, \ldots\} = \mathbb{Z} \). Step 2 — Check one-one (injective). Case A: Both \( a \) and \( b \) odd. If \( h(a) = h(b) \), then \( \dfrac{a-1}{2} = \dfrac{b-1}{2} \), so \( a = b \). Case B: Both \( a \) and \( b \) even. If \( h(a) = h(b) \), then \( -\dfrac{a}{2} = -\dfrac{b}{2} \), so \( a = b \). Case C: \( a \) odd, \( b \) even. Then \( h(a) = \dfrac{a-1}{2} \ge 0 \) (since \( a \ge 1 \)), while \( h(b) = -\dfrac{b}{2} \le -1 < 0 \). So \( h(a) \ne h(b) \). In all cases distinct inputs give distinct outputs. Therefore \( h \) is one-one. Step 3 — Check onto (surjective). Let \( y \in \mathbb{Z} \) be arbitrary. If \( y \ge 0 \): take \( n = 2y + 1 \) (which is odd). Then \( h(2y+1) = \dfrac{(2y+1)-1}{2} = \dfrac{2y}{2} = y \). If \( y < 0 \): take \( n = -2y \) (which is a positive even number since \( y < 0 \)). Then \( h(-2y) = -\dfrac{-2y}{2} = y \). Every integer \( y \) is the image of some \( n \in \mathbb{N} \). Therefore \( h \) is onto. Conclusion: \( h \) is both one-one and onto, hence \( h \) is bijective.
Answer: h is bijective (one-one and onto).
Question: Let \( g : \mathbb{N} \to \mathbb{N} \) be defined by \[ g(n) = \begin{cases} \dfrac{n-1}{2} + 1, & \text{if } n \text{ is odd} \\ \dfrac{n}{2}, & \text{if } n \text{ is even} \end{cases} \] for all \( n \in \mathbb{N} \). Determine whether \( g \) is one-one (injective), onto (surjective), bijective, and invertible. Justify your answer.
Answer: The function \( g \) is onto (surjective) but NOT one-one (not injective). Since \( g(1) = g(2) = 1 \) with \( 1 \ne 2 \), it fails injectivity. Since \( g(2m) = m \) for every \( m \in \mathbb{N} \), it is surjective. Hence \( g \) is not bijective and not invertible.