A function f is defined from \(R\rightarrow R\) as \(f(x) = ax + b,\) such that \(f(1)=1\) and \(f(2) = 3.\) Find function \(f(x).\) Hence, check whether function \(f(x)\) is one-one and onto or not.
CBSE Class 12 Maths · Relations and Functions
CBSE Class 12 Maths · Relations and Functions
Imagine a machine that takes a number, doubles it, and then subtracts one. Put in 1, you get 1. Put in 2, you get 3. That matching tells us exactly what the machine does. No two different numbers ever give the same result, so the machine never confuses inputs. Also, every possible output has exactly one input that produces it, so nothing is left out.
Answer: The function is \( f(x) = 2x - 1 \). It is both one-one (injective) and onto (surjective), hence a bijection from \( R \) to \( R \).
A function of the form \( f(x) = ax + b \) is a linear function. Here \( a \) and \( b \) are unknown constants. If we are given two output values, we can form two equations and solve for \( a \) and \( b \). Once the function is known, we test two properties. A function is one-one (injective) if different inputs always give different outputs, that is \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \). A function is onto (surjective) from \( R \) to \( R \) if every element \( y \) in the codomain \( R \) has some pre-image \( x \) in the domain such that \( f(x) = y \).
\( f(x) = ax + b \); one-one: \( f(x_1) = f(x_2) \Rightarrow x_1 = x_2 \); onto: for every \( y \in R \), there exists \( x \in R \) with \( f(x) = y \).
The function is \( f(x) = 2x - 1 \). It is both one-one (injective) and onto (surjective), hence a bijection from \( R \) to \( R \).
A common mistake is to conclude a function is onto without actually solving \( f(x) = y \) for \( x \) and confirming that \( x \) lies in the domain \( R \). Just showing it is one-one does not prove it is onto; both properties must be checked separately.
The function is \( f(x) = 2x - 1 \). It is both one-one (injective) and onto (surjective), hence a bijection from \( R \) to \( R \).
One common mistake: students often verify injectivity or surjectivity for only a few specific values instead of using a general argument (arbitrary \( x_1, x_2 \) or arbitrary \( y \)), which does not constitute a valid proof.
Answer: The function is \( f(x) = 2x - 1 \). It is both one-one (injective) and onto (surjective), hence a bijection from \( R \) to \( R \).
Question: A function f: R → R is defined as \( f(x) = ax + b \). Given that \( f(2) = 5 \) and \( f(4) = 9 \), find \( f(x) \). Hence check whether \( f \) is one-one and onto.
Solution: Step 1 — Set up equations using the given conditions. From \( f(2) = 5 \): \[ 2a + b = 5 \quad \text{...(i)} \] From \( f(4) = 9 \): \[ 4a + b = 9 \quad \text{...(ii)} \] Step 2 — Solve the system. Subtracting (i) from (ii): \[ 2a = 4 \implies a = 2 \] Substituting \( a = 2 \) into (i): \[ 4 + b = 5 \implies b = 1 \] Step 3 — Write the function. Therefore \[ f(x) = 2x + 1 \] Step 4 — Check one-one. Let \( f(x_1) = f(x_2) \) for \( x_1, x_2 \in \mathbb{R} \). Then \[ 2x_1 + 1 = 2x_2 + 1 \implies 2x_1 = 2x_2 \implies x_1 = x_2 \] Since \( f(x_1) = f(x_2) \) implies \( x_1 = x_2 \), the function is one-one. Step 5 — Check onto. Let \( y \in \mathbb{R} \) be arbitrary. We need \( x \in \mathbb{R} \) such that \( f(x) = y \). \[ 2x + 1 = y \implies x = \frac{y - 1}{2} \] Since \( y \in \mathbb{R} \), we get \( x = \frac{y-1}{2} \in \mathbb{R} \) and \( f(x) = y \). Hence every element of the codomain has a pre-image, so \( f \) is onto.
Answer: \( f(x) = 2x + 1 \); \( f \) is both one-one and onto (bijective).
Question: A function f: R → R is defined as \( f(x) = ax + b \). Given that \( f(0) = -3 \) and \( f(3) = 6 \), find \( f(x) \). Hence check whether \( f \) is one-one and onto.
Solution: Step 1 — Set up equations using the given conditions. From \( f(0) = -3 \): \[ a(0) + b = -3 \implies b = -3 \quad \text{...(i)} \] From \( f(3) = 6 \): \[ 3a + b = 6 \quad \text{...(ii)} \] Step 2 — Solve the system. Substituting \( b = -3 \) into (ii): \[ 3a - 3 = 6 \implies 3a = 9 \implies a = 3 \] Step 3 — Write the function. Therefore \[ f(x) = 3x - 3 \] Step 4 — Check one-one. Let \( f(x_1) = f(x_2) \) for \( x_1, x_2 \in \mathbb{R} \). Then \[ 3x_1 - 3 = 3x_2 - 3 \implies 3x_1 = 3x_2 \implies x_1 = x_2 \] Since \( f(x_1) = f(x_2) \) implies \( x_1 = x_2 \), the function is one-one. Step 5 — Check onto. Let \( y \in \mathbb{R} \) be arbitrary. We need \( x \in \mathbb{R} \) such that \( f(x) = y \). \[ 3x - 3 = y \implies x = \frac{y + 3}{3} \] Since \( y \in \mathbb{R} \), we get \( x = \frac{y+3}{3} \in \mathbb{R} \) and \( f(x) = y \). Hence every element of the codomain has a pre-image, so \( f \) is onto.
Answer: \( f(x) = 3x - 3 \); \( f \) is both one-one and onto (bijective).
Question: A function f is defined from \( \mathbb{R} \to \mathbb{R} \) as \( f(x) = ax + b \), such that \( f(2) = 1 \) and \( f(4) = 7 \). Find the function \( f(x) \). Hence, check whether \( f(x) \) is one-one and onto.
Answer: The function is \( f(x) = 3x - 5 \). It is both one-one (injective) and onto (surjective), hence a bijection from \( \mathbb{R} \) to \( \mathbb{R} \).