Detailed Explanation
A function is one-one (injective) if different inputs always give different outputs, i.e. whenever \( f(x_1) = f(x_2) \) we must have \( x_1 = x_2 \). A function is onto (surjective) if every element of the co-domain is the image of at least some element of the domain, i.e. for every \( y \) in the co-domain there exists an \( x \) in the domain with \( f(x) = y \). A function that is both one-one and onto is called a bijection. Here \( R_{\ast} \) is the set of all non-zero real numbers, and the function \( f(x) = \dfrac{1}{x} \) is well-defined on it because division by zero is excluded. We will check both properties, then re-examine them when the domain is changed to the set of natural numbers \( N \).
Formula Used
One-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). Onto: for every \( y \) in co-domain, there exists \( x \) in domain with \( f(x) = y \). Given function: \( f(x) = \dfrac{1}{x} \).
Solution
- Step 1: Check one-one for \( f : R_{\ast} \to R_{\ast} \). Assume two elements have the same image, so \( f(x_1) = f(x_2) \). This gives \[ \frac{1}{x_1} = \frac{1}{x_2}. \] Cross-multiplying, we get \( x_2 = x_1 \), that is \( x_1 = x_2 \).
- Step 2: Since \( f(x_1) = f(x_2) \) forces \( x_1 = x_2 \), the function \( f \) is one-one (injective) on \( R_{\ast} \).
- Step 3: Check onto for \( f : R_{\ast} \to R_{\ast} \). Take any element \( y \) in the co-domain \( R_{\ast} \), so \( y \ne 0 \). We must find \( x \) in \( R_{\ast} \) such that \( f(x) = y \). Setting \[ \frac{1}{x} = y \] gives \( x = \dfrac{1}{y} \).
- Step 4: Since \( y \ne 0 \), the value \( x = \dfrac{1}{y} \) is a non-zero real number, so \( x \in R_{\ast} \). Also \[ f\left(\frac{1}{y}\right) = \frac{1}{\frac{1}{y}} = y. \] So every \( y \) in \( R_{\ast} \) has a pre-image, hence \( f \) is onto (surjective). Therefore \( f \) is a bijection on \( R_{\ast} \).
- Step 5: Now replace the domain by \( N \) with the same co-domain \( R_{\ast} \). Define \( g : N \to R_{\ast} \) by \( g(x) = \dfrac{1}{x} \). Check one-one: if \( g(x_1) = g(x_2) \), then \( \dfrac{1}{x_1} = \dfrac{1}{x_2} \), giving \( x_1 = x_2 \). So \( g \) is still one-one.
- Step 6: Check onto for \( g \). The images are \( g(1) = 1, \ g(2) = \dfrac{1}{2}, \ g(3) = \dfrac{1}{3}, \dots \), all of the form \( \dfrac{1}{n} \) with \( n \in N \). But the co-domain \( R_{\ast} \) contains numbers like \( 2 \), which is not of the form \( \dfrac{1}{n} \) for any natural number \( n \). So \( 2 \) has no pre-image, and \( g \) is not onto.
Final Answer
The function \( f : R_{\ast} \to R_{\ast} \), \( f(x) = \dfrac{1}{x} \), is both one-one and onto, hence a bijection. When the domain is replaced by \( N \) (co-domain still \( R_{\ast} \)), the function \( g : N \to R_{\ast} \) is one-one but NOT onto (for example, \( 2 \in R_{\ast} \) has no pre-image in \( N \)). So the result is not fully true; \( g \) is only injective, not bijective.
Common Mistake
A common mistake is to assume that because the rule \( \dfrac{1}{x} \) is the same, the function stays onto after changing the domain to \( N \). Onto depends on both the domain and the co-domain: with domain \( N \), only reciprocals of natural numbers appear as outputs, so most elements of \( R_{\ast} \) (like \( 2 \) or \( -5 \)) are never reached.