SOLVER7 Study. Nothing Else.
Exercise 1.2 Q1

Show that the function \(f : R_{\ast} → R{_\ast}\) defined by \(f(x) =\dfrac{1}{x}\) is one-one and onto, where \(R{_\ast}\) is the set of all non-zero real numbers. Is the result true, if the domain \(R{_\ast}\) is replaced by \(N\) with co-domain being same as \(R{_\ast}?\)

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a magic machine that takes any non-zero number and gives back its flip — so 2 becomes one-half, and one-half becomes 2. Every number gets a unique flip, and every possible output can be traced back to some input. That makes the machine a perfect two-way match, called a bijection. But if we only allow whole numbers like 1, 2, 3 into the machine, the output one-half has nowhere to come from. The machine still gives different outputs for different inputs, yet many outputs are left unclaimed.

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.

📖 One-One and Onto Nature of f(x) = 1/x

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

  1. 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 \).
  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} \).
  3. 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} \).
  4. 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} \).
  5. 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.
  6. 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.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Understand the domain and function: The function \( f : R_{\ast} \to R_{\ast} \) is defined by \( f(x) = \dfrac{1}{x} \). Since \( R_{\ast} \) excludes zero, division by \( x \) is always valid, so the function is well-defined on its entire domain. — Reason: Before checking any property, we must confirm the function is well-defined everywhere on its domain.
  2. Step 2: Test injectivity (one-one) for \( f : R_{\ast} \to R_{\ast} \): Suppose \( f(x_1) = f(x_2) \) for some \( x_1, x_2 \in R_{\ast} \). Then \[\frac{1}{x_1} = \frac{1}{x_2}.\] Taking reciprocals of both sides gives \( x_1 = x_2 \). — Reason: The definition of injectivity requires us to start by assuming equal outputs and then deduce equal inputs; the reciprocal step is the key algebraic move here.
  3. Step 3: Conclude injectivity: Since \( f(x_1) = f(x_2) \) necessarily implies \( x_1 = x_2 \), the function \( f \) is one-one (injective) on \( R_{\ast} \). — Reason: The implication in Step 2 is exactly the criterion for a function to be injective, so we can confirm this property directly.
  4. Step 4: Test surjectivity (onto) for \( f : R_{\ast} \to R_{\ast} \): Take any arbitrary \( y \in R_{\ast} \), meaning \( y \ne 0 \). We need an \( x \in R_{\ast} \) such that \( f(x) = y \), i.e. \( \dfrac{1}{x} = y \). Solving for \( x \) gives \( x = \dfrac{1}{y} \). Since \( y \ne 0 \), we have \( x = \dfrac{1}{y} \in R_{\ast} \), and indeed \( f\!\left(\dfrac{1}{y}\right) = y \). — Reason: To verify surjectivity we must show every co-domain element has at least one pre-image; here we explicitly construct that pre-image.
  5. Step 5: Conclude bijection for \( f : R_{\ast} \to R_{\ast} \): Because \( f \) is both one-one (Step 3) and onto (Step 4), the function \( f : R_{\ast} \to R_{\ast} \) defined by \( f(x) = \dfrac{1}{x} \) is a bijection. — Reason: A bijection requires both properties simultaneously; having verified each separately, we combine the conclusions.
  6. Step 6: Re-examine injectivity when the domain is changed to \( N \): Now consider \( g : N \to R_{\ast} \) defined by \( g(n) = \dfrac{1}{n} \). Suppose \( g(n_1) = g(n_2) \) for \( n_1, n_2 \in N \). Then \( \dfrac{1}{n_1} = \dfrac{1}{n_2} \), which again gives \( n_1 = n_2 \). So \( g \) is still one-one. — Reason: Restricting to a smaller domain never introduces new collisions in output, so injectivity is inherited.
  7. Step 7: Check surjectivity when the domain is \( N \): For \( g : N \to R_{\ast} \) to be onto, every element of \( R_{\ast} \) would need a pre-image in \( N \). Consider \( y = 2 \in R_{\ast} \). A pre-image would require some \( n \in N \) with \( \dfrac{1}{n} = 2 \), i.e. \( n = \dfrac{1}{2} \). But \( \dfrac{1}{2} \notin N \), so \( y = 2 \) has no pre-image. Therefore \( g \) is NOT onto. — Reason: A single counterexample is sufficient to disprove surjectivity; the natural numbers are too sparse to cover all non-zero reals as outputs of \( \dfrac{1}{n} \).
  8. Step 8: Final verdict on the changed domain: With domain \( N \), the function \( g : N \to R_{\ast} \), \( g(n) = \dfrac{1}{n} \), is injective but not surjective, hence it is not a bijection. The claim that \( f(x) = \dfrac{1}{x} \) is a bijection breaks down when the domain is restricted to \( N \). — Reason: Bijection requires both injectivity and surjectivity; losing surjectivity means the full result no longer holds.

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

One common mistake: students assume that because the function rule \( f(x) = \dfrac{1}{x} \) is the same, the bijection property automatically carries over to the new domain \( N \); they forget that surjectivity depends heavily on the domain — natural numbers produce only outputs of the form \( \dfrac{1}{n} \), which cannot cover all non-zero reals.

✍️ Exam-ready Answer

Exam-ready Answer

  1. One-one check for \( f : R_{\ast} \to R_{\ast} \), \( f(x) = \dfrac{1}{x} \): \( f(x_1) = f(x_2) \Rightarrow \dfrac{1}{x_1} = \dfrac{1}{x_2} \Rightarrow x_1 = x_2 \), so \( f \) is one-one.
  2. Onto check for \( f : R_{\ast} \to R_{\ast} \): For any \( y \in R_{\ast} \), set \( x = \dfrac{1}{y} \in R_{\ast} \); then \( f(x) = y \), so \( f \) is onto. Hence \( f \) is a bijection.
  3. Domain changed to \( N \): check \( g : N \to R_{\ast} \), \( g(x) = \dfrac{1}{x} \): One-one: same argument holds. Onto: \( 2 \in R_{\ast} \) requires \( x = \dfrac{1}{2} \notin N \), so \( g \) is NOT onto.

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.

➕ More Examples

More Examples

Example 1

Question: Show that the function \( f : R_{*} \to R_{*} \) defined by \( f(x) = \dfrac{3}{x} \) is one-one and onto, where \( R_{*} \) is the set of all non-zero real numbers. Is the result true if the domain \( R_{*} \) is replaced by \( \mathbb{N} \) (natural numbers) with the codomain remaining \( R_{*} \)?

Solution: We check whether \( f(x) = \dfrac{3}{x} \) is one-one and onto on \( R_{*} \). \nStep 1 — One-one: Suppose \( f(a) = f(b) \) for \( a, b \in R_{*} \). Then \[ \frac{3}{a} = \frac{3}{b} \] Multiplying both sides by \( \dfrac{ab}{3} \): \[ b = a \] So \( f(a) = f(b) \Rightarrow a = b \). Hence \( f \) is one-one. \nStep 2 — Onto: Let \( y \in R_{*} \) be arbitrary. We need \( x \in R_{*} \) such that \( f(x) = y \), i.e., \[ \frac{3}{x} = y \Rightarrow x = \frac{3}{y} \] Since \( y \ne 0 \), we have \( x = \dfrac{3}{y} \in R_{*} \). Also, \[ f\\!\left(\frac{3}{y}\right) = \frac{3}{\\,3/y\\,} = y \] So every \( y \in R_{*} \) has a pre-image in \( R_{*} \). Hence \( f \) is onto. \nConclusion for \( f : R_{*} \to R_{*} \): \( f \) is both one-one and onto, i.e., \( f \) is a bijection. \nStep 3 — When domain is \( \mathbb{N} \): Consider \( f : \mathbb{N} \to R_{*} \) defined by \( f(n) = \dfrac{3}{n} \). \nOne-one check: If \( f(a) = f(b) \) then \( \dfrac{3}{a} = \dfrac{3}{b} \Rightarrow a = b \). So \( f \) is still one-one. \nOnto check: Consider \( y = \dfrac{1}{2} \in R_{*} \). We need \( n \in \mathbb{N} \) such that \[ \frac{3}{n} = \frac{1}{2} \Rightarrow n = 6 \] That works. But consider \( y = \dfrac{1}{2} \) — wait, let us try \( y = 2 \in R_{*} \). We need \( n \in \mathbb{N} \) such that \[ \frac{3}{n} = 2 \Rightarrow n = \frac{3}{2} = 1.5 \] But \( 1.5 \notin \mathbb{N} \). So \( y = 2 \) has no pre-image in \( \mathbb{N} \). Hence \( f \) is NOT onto when the domain is \( \mathbb{N} \). \nTherefore, when the domain is replaced by \( \mathbb{N} \), the function remains one-one but is no longer onto.

Answer: f is one-one and onto on \( R_{*} \). When domain is \( \mathbb{N} \), f is one-one but NOT onto.

Example 2

Question: Consider the function \( g : R_{*} \to R_{*} \) defined by \( g(x) = \dfrac{5}{x} \), where \( R_{*} \) is the set of all non-zero real numbers. Prove that \( g \) is both one-one and onto. Also determine whether \( g \) remains bijective when its domain is restricted to the set of positive integers \( \mathbb{Z}^{+} \) with codomain \( R_{*} \).

Solution: We examine \( g(x) = \dfrac{5}{x} \) with domain and codomain both \( R_{*} \). \nStep 1 — One-one: Let \( a, b \in R_{*} \) and suppose \( g(a) = g(b) \). Then \[ \frac{5}{a} = \frac{5}{b} \] Cross-multiplying (both are non-zero): \[ 5b = 5a \Rightarrow a = b \] So \( g \) is one-one. \nStep 2 — Onto: Let \( y \in R_{*} \) be any element. We seek \( x \in R_{*} \) with \( g(x) = y \), i.e., \[ \frac{5}{x} = y \Rightarrow x = \frac{5}{y} \] Since \( y \ne 0 \), we get \( x = \dfrac{5}{y} \in R_{*} \). Verify: \[ g\\!\left(\frac{5}{y}\right) = \frac{5}{\\,5/y\\,} = y \] So every \( y \in R_{*} \) is achieved. Hence \( g \) is onto. \nConclusion: \( g : R_{*} \to R_{*} \) is a bijection. \nStep 3 — Domain restricted to \( \mathbb{Z}^{+} \): Consider \( g : \mathbb{Z}^{+} \to R_{*} \) defined by \( g(n) = \dfrac{5}{n} \). \nOne-one check: If \( g(a) = g(b) \) for \( a, b \in \mathbb{Z}^{+} \), then \( \dfrac{5}{a} = \dfrac{5}{b} \Rightarrow a = b \). So \( g \) is still one-one. \nOnto check: Take \( y = 3 \in R_{*} \). We need \( n \in \mathbb{Z}^{+} \) such that \[ \frac{5}{n} = 3 \Rightarrow n = \frac{5}{3} \approx 1.67 \] But \( \dfrac{5}{3} \notin \mathbb{Z}^{+} \). So \( y = 3 \) has no pre-image in \( \mathbb{Z}^{+} \). Hence \( g \) is NOT onto. \nTherefore, when the domain is \( \mathbb{Z}^{+} \), the function \( g \) is one-one but not onto, so it is not bijective.

Answer: g is one-one and onto on \( R_{*} \). When domain is \( \mathbb{Z}^{+} \), g is one-one but NOT onto, hence not bijective.

🎯 Try a Similar Question

Try a Similar Question

Question: Consider the function \( f: \mathbb{R}_{+} \to \mathbb{R}_{+} \) defined by \( f(x) = \dfrac{2}{x} \), where \( \mathbb{R}_{+} \) is the set of all positive real numbers. Show that \( f \) is both one-one and onto. Is the result true if the domain \( \mathbb{R}_{+} \) is replaced by the set of natural numbers \( \mathbb{N} \) with the co-domain remaining \( \mathbb{R}_{+} \)?

Solution

  1. Step 1: Check if f is one-one on \( \mathbb{R}_{+} \): Assume \( f(x_1) = f(x_2) \) for \( x_1, x_2 \in \mathbb{R}_{+} \). Then \( \dfrac{2}{x_1} = \dfrac{2}{x_2} \). Multiplying both sides by \( x_1 x_2 \) gives \( 2x_2 = 2x_1 \), so \( x_1 = x_2 \). Since \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \), the function \( f \) is one-one on \( \mathbb{R}_{+} \).
  2. Step 2: Check if f is onto on \( \mathbb{R}_{+} \): Let \( y \in \mathbb{R}_{+} \) be arbitrary. We need to find \( x \in \mathbb{R}_{+} \) such that \( f(x) = y \), i.e., \( \dfrac{2}{x} = y \). Solving, \( x = \dfrac{2}{y} \). Since \( y > 0 \), we have \( x = \dfrac{2}{y} > 0 \), so \( x \in \mathbb{R}_{+} \). Also, \( f\!\left(\dfrac{2}{y}\right) = \dfrac{2}{\,2/y\,} = y \). Since every \( y \in \mathbb{R}_{+} \) has a pre-image in \( \mathbb{R}_{+} \), \( f \) is onto.
  3. Step 3: Conclusion for Part 1: Since \( f: \mathbb{R}_{+} \to \mathbb{R}_{+} \) defined by \( f(x) = \dfrac{2}{x} \) is both one-one and onto, it is a bijection.
  4. Step 4: Consider the modified function \( g: \mathbb{N} \to \mathbb{R}_{+} \) defined by \( g(n) = \dfrac{2}{n} \): First check if \( g \) is one-one. Assume \( g(n_1) = g(n_2) \) for \( n_1, n_2 \in \mathbb{N} \). Then \( \dfrac{2}{n_1} = \dfrac{2}{n_2} \), which gives \( n_1 = n_2 \). So \( g \) is one-one.
  5. Step 5: Check if g is onto: Consider \( y = 3 \in \mathbb{R}_{+} \). For \( g(n) = 3 \), we need \( \dfrac{2}{n} = 3 \), giving \( n = \dfrac{2}{3} \). But \( \dfrac{2}{3} \notin \mathbb{N} \). Hence, \( 3 \in \mathbb{R}_{+} \) has no pre-image in \( \mathbb{N} \), so \( g \) is NOT onto.
  6. Step 6: Final Conclusion for Part 2: When the domain is replaced by \( \mathbb{N} \), the function \( g: \mathbb{N} \to \mathbb{R}_{+} \) given by \( g(n) = \dfrac{2}{n} \) is one-one but NOT onto. The result of \( f \) being a bijection does not hold for \( g \); \( g \) is only injective, not surjective.

Answer: The function \( f: \mathbb{R}_{+} \to \mathbb{R}_{+} \) defined by \( f(x) = \dfrac{2}{x} \) is both one-one and onto, hence a bijection. When the domain is replaced by \( \mathbb{N} \) (co-domain still \( \mathbb{R}_{+} \)), the function \( g: \mathbb{N} \to \mathbb{R}_{+} \) is one-one but NOT onto (for example, \( 3 \in \mathbb{R}_{+} \) has no pre-image in \( \mathbb{N} \) since \( \dfrac{2}{3} \notin \mathbb{N} \)). So the result is not fully true for the new domain; \( g \) is only injective, not bijective.

Everything you get with Solver7

More questions in Relations and Functions