SOLVER7 Study. Nothing Else.
Chapter 1 Examples Q25

Consider the identity function \(I_{_N}: N → N\) defined as \(I_{_N}(x) = x ∀x \in N.\) Show that although \(I_{_N}\) is onto but \(I_{_N}+I_{_N}: N → N\) defined as \((I_{_N} + I_{_N}) (x) = I_{_N} (x) + I_{_N} (x) = x + x = 2x\) is not onto.

CBSE Class 12 Maths · Relations and Functions

Solution

👶 Simple Explanation

Simple Explanation

Imagine a machine that doubles every number you put in. If you put in 1, it gives 2. If you put in 2, it gives 4. But it will never give you 3, or 5, or any odd number. Now think of a simpler machine that just returns whatever you give it — put in 7, get 7. That machine can reach every number. The doubling machine misses all the odd numbers, so it cannot be called onto.

Answer: The identity function \( I_{N}(x) = x \) is onto because every \( y \in N \) has pre-image \( x = y \). But \( (I_{N} + I_{N})(x) = 2x \) produces only even natural numbers, so odd numbers like \( 3 \) have no pre-image. Hence \( I_{N} + I_{N} \) is not onto.

📖 Onto Nature of Identity Function vs Its Sum

Detailed Explanation

A function \( f: A \to B \) is called onto (surjective) if every element of the codomain \( B \) is the image of at least one element of the domain \( A \). In other words, for every \( y \in B \) there must exist some \( x \in A \) such that \( f(x) = y \). Here we work with the set of natural numbers \( N \). The identity function \( I_{N} \) simply maps every number to itself, so its outputs cover all of \( N \). But when we add the identity function to itself, the outputs become \( 2x \), which are only even numbers. Odd numbers of \( N \) can never appear as outputs, so the function fails to be onto.

Formula Used

A function \( f: N \to N \) is onto if for every \( y \in N \), there exists \( x \in N \) such that \( f(x) = y \). Given: \( I_{N}(x) = x \) and \( (I_{N} + I_{N})(x) = 2x \).

Solution

  1. Step 1: Recall the definition of the identity function on natural numbers: \( I_{N}: N \to N \) with \( I_{N}(x) = x \) for all \( x \in N \).
  2. Step 2: Check whether \( I_{N} \) is onto. Take any element \( y \in N \) in the codomain. Choose \( x = y \) in the domain. Then \( I_{N}(x) = I_{N}(y) = y \). So every \( y \in N \) has a pre-image, which means \( I_{N} \) is onto.
  3. Step 3: Now define the new function \( (I_{N} + I_{N}): N \to N \). By the given rule, \[ (I_{N} + I_{N})(x) = I_{N}(x) + I_{N}(x) = x + x = 2x. \] So this function sends each natural number \( x \) to \( 2x \).
  4. Step 4: Find the range of this function. Since \( x \) runs over \( N = \{1, 2, 3, \dots\} \), the outputs are \( 2, 4, 6, 8, \dots \), which are exactly the even natural numbers. So the range is the set of even natural numbers only.
  5. Step 5: Check onto by looking for an unreached codomain element. Consider \( y = 3 \in N \). If it were an image, we would need \( 2x = 3 \), giving \( x = \tfrac{3}{2} \), which is not a natural number. So \( 3 \) has no pre-image in \( N \).
  6. Step 6: Since at least one element of the codomain (in fact every odd number) has no pre-image, the function \( (I_{N} + I_{N}) \) is not onto, even though \( I_{N} \) itself was onto.

Final Answer

The identity function \( I_{N}(x) = x \) is onto because every \( y \in N \) has pre-image \( x = y \). But \( (I_{N} + I_{N})(x) = 2x \) produces only even natural numbers, so odd numbers like \( 3 \) have no pre-image. Hence \( I_{N} + I_{N} \) is not onto.

Common Mistake

A common mistake is to assume that adding two onto functions must give an onto function. Onto-ness is not preserved under addition; you must always re-check by examining whether every codomain element (here, the odd numbers) actually has a pre-image.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Recall the identity function: \( I_{N}: N \to N \) is defined by \( I_{N}(x) = x \) for every \( x \in N \). — Reason: Knowing exactly what \( I_{N} \) does (maps each number to itself) is the starting point before checking any property.
  2. Step 2: Verify that \( I_{N} \) is onto. Pick any arbitrary element \( y \in N \) in the codomain. Choose \( x = y \) in the domain. Then \( I_{N}(x) = x = y \), so \( y \) is indeed hit. Since \( y \) was arbitrary, every element of \( N \) has a pre-image. — Reason: The definition of onto requires that no element of the codomain is left uncovered; showing a valid pre-image for every \( y \) confirms this.
  3. Step 3: Form the new function \( I_{N} + I_{N} \) using the addition rule for functions: \[ (I_{N} + I_{N})(x) = I_{N}(x) + I_{N}(x) = x + x = 2x. \] So the combined function sends each \( x \in N \) to \( 2x \). — Reason: We apply the definition of function addition pointwise to find the explicit rule for the new function before analysing its range.
  4. Step 4: Identify the range of \( (I_{N} + I_{N}) \). Since \( x \) takes values in \( N = \{1, 2, 3, \ldots\} \), the outputs \( 2x \) are \( \{2, 4, 6, 8, \ldots\} \), i.e., only even natural numbers. — Reason: Listing the actual outputs reveals which elements of the codomain \( N \) are reachable and which are not.
  5. Step 5: Check whether every element of the codomain \( N \) is covered. Consider \( y = 3 \in N \). For \( (I_{N} + I_{N})(x) = 3 \) we would need \( 2x = 3 \), giving \( x = \frac{3}{2} \), which is not a natural number. Hence \( 3 \) has no pre-image in \( N \). — Reason: Finding even one element of the codomain with no pre-image is enough to conclude the function is NOT onto.
  6. Step 6: Conclude: \( I_{N} \) is onto, but \( I_{N} + I_{N} \) is not onto. The range of \( I_{N} + I_{N} \) is only the set of even natural numbers, which is a proper subset of \( N \). Odd numbers are entirely missing from the range. — Reason: This comparison directly answers the question by showing that the sum of two onto functions need not be onto.

Final Answer

The identity function \( I_{N}(x) = x \) is onto because every \( y \in N \) has pre-image \( x = y \). But \( (I_{N} + I_{N})(x) = 2x \) produces only even natural numbers, so odd numbers like \( 3 \) have no pre-image. Hence \( I_{N} + I_{N} \) is not onto.

Common Mistake

One common mistake: Students assume that if both \( f \) and \( g \) are onto, then \( f + g \) must also be onto. This is false — as this example shows, adding two onto functions can restrict the range to a proper subset of the codomain, destroying surjectivity.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Identity function: \( I_{N} : N \to N \), \( I_{N}(x) = x \). For any \( y \in N \), take \( x = y \): \( I_{N}(x) = y \). So \( I_{N} \) is onto.
  2. Step 2: Define \( (I_{N} + I_{N})(x) = I_{N}(x) + I_{N}(x) = x + x = 2x \).
  3. Step 3: Range of \( (I_{N} + I_{N}) \) = \( \{2, 4, 6, \ldots\} \) (even natural numbers only). Odd numbers, e.g. \( 3 \in N \), have no pre-image. Hence \( I_{N} + I_{N} \) is not onto.

Answer: The identity function \( I_{N}(x) = x \) is onto because every \( y \in N \) has pre-image \( x = y \). But \( (I_{N} + I_{N})(x) = 2x \) produces only even natural numbers, so odd numbers like \( 3 \) have no pre-image. Hence \( I_{N} + I_{N} \) is not onto.

➕ More Examples

More Examples

Example 1

Question: Let \ f: \mathbb{N} \to \mathbb{N} \ be defined by \( f(x) = x \) for all \( x \in \mathbb{N} \). Show that \( f \) is onto, but the function \( g: \mathbb{N} \to \mathbb{N} \) defined by \( g(x) = 3f(x) = 3x \) is NOT onto.

Solution: Step 1: Show that f is onto. For every \( y \in \mathbb{N} \), we need to find \( x \in \mathbb{N} \) such that \( f(x) = y \). Since \( f(x) = x \), choosing \( x = y \) gives \( f(y) = y \). Since \( y \in \mathbb{N} \) implies \( x = y \in \mathbb{N} \), every element of \( \mathbb{N} \) has a pre-image. Hence \( f \) is onto. Step 2: Show that g is NOT onto. The function is \( g(x) = 3x \). The range of \( g \) is the set of all multiples of 3 in \( \mathbb{N} \), i.e., \( \{3, 6, 9, 12, \ldots\} \). Consider \( y = 2 \in \mathbb{N} \). For \( g(x) = 2 \), we would need: \[ 3x = 2 \] which gives \( x = \dfrac{2}{3} \), and \( \dfrac{2}{3} \notin \mathbb{N} \). Since there is no \( x \in \mathbb{N} \) with \( g(x) = 2 \), the element \( 2 \in \mathbb{N} \) has no pre-image under \( g \). Therefore \( g \) is not onto. Conclusion: Although \( f: \mathbb{N} \to \mathbb{N} \) defined by \( f(x) = x \) is onto, the function \( g: \mathbb{N} \to \mathbb{N} \) defined by \( g(x) = 3x \) is not onto, because elements of \( \mathbb{N} \) that are not multiples of 3 (such as 1, 2, 4, 5, ...) have no pre-image in \( \mathbb{N} \) under \( g \).

Answer: f(x) = x is onto; g(x) = 3x is not onto since, for example, y = 2 has no pre-image in N under g.

Example 2

Question: Let \( h: \mathbb{N} \to \mathbb{N} \) be the identity function \( h(x) = x \) for all \( x \in \mathbb{N} \). Define a new function \( p: \mathbb{N} \to \mathbb{N} \) by \( p(x) = h(x) + h(x) + h(x) = 3h(x) \). Show that although \( h \) is onto, \( p \) is not onto. Also, separately define \( q: \mathbb{N} \to \mathbb{N} \) by \( q(x) = 2h(x) + h(x) = 3x \) and verify the same conclusion for \( q \).

Solution: Part A: Show h is onto. For any \( y \in \mathbb{N} \), taking \( x = y \in \mathbb{N} \) gives \( h(x) = x = y \). So every element of \( \mathbb{N} \) has a pre-image under \( h \), and \( h \) is onto. Part B: Show p is not onto, where \( p(x) = 3h(x) = 3x \). The range of \( p \) is: \[ \text{Range}(p) = \{p(x) : x \in \mathbb{N}\} = \{3, 6, 9, 12, \ldots\} \] This set contains only multiples of 3. Consider any natural number that is not a multiple of 3, for instance \( y = 4 \). For \( p(x) = 4 \): \[ 3x = 4 \implies x = \frac{4}{3} \] Since \( \dfrac{4}{3} \notin \mathbb{N} \), the element \( 4 \in \mathbb{N} \) has no pre-image under \( p \). Hence \( p \) is NOT onto. Part C: Show q is not onto, where \( q(x) = 2h(x) + h(x) = 3x \). Since \( q(x) = 3x \) is the same function as \( p(x) \), the same reasoning applies. The range of \( q \) consists only of multiples of 3. For example, \( y = 5 \in \mathbb{N} \) would require: \[ 3x = 5 \implies x = \frac{5}{3} \notin \mathbb{N} \] So \( 5 \in \mathbb{N} \) has no pre-image under \( q \), confirming that \( q \) is NOT onto. Conclusion: The identity function \( h: \mathbb{N} \to \mathbb{N} \) is onto, but forming \( p(x) = 3h(x) \) or equivalently \( q(x) = 2h(x) + h(x) \) gives functions that are not onto, since their ranges are proper subsets of \( \mathbb{N} \) (containing only multiples of 3).

Answer: h(x) = x is onto; p(x) = q(x) = 3x is not onto since natural numbers that are not multiples of 3 (e.g. 4, 5) have no pre-image in N.

🎯 Try a Similar Question

Try a Similar Question

Question: Consider the identity function \( I_{N}: N \to N \) defined as \( I_{N}(x) = x \) for all \( x \in N \). Show that although \( I_{N} \) is onto, the function \( g: N \to N \) defined by \( g(x) = 2 \cdot I_{N}(x) + I_{N}(x) = 3x \) is not onto.

Solution

  1. Step 1: Recall the definition of an onto function: A function \( f: N \to N \) is onto (surjective) if for every \( y \in N \), there exists at least one \( x \in N \) such that \( f(x) = y \).
  2. Step 2: Show that \( I_{N} \) is onto: The identity function is defined as \( I_{N}(x) = x \) for all \( x \in N \). For any \( y \in N \), we can choose \( x = y \in N \), and then \( I_{N}(x) = y \). Since every \( y \in N \) has a pre-image, \( I_{N} \) is onto.
  3. Step 3: Define the new function g: Define \( g: N \to N \) by combining two scalar multiples of the identity: \( g(x) = 2 \cdot I_{N}(x) + I_{N}(x) \). Simplifying: \[ g(x) = 2x + x = 3x \] So \( g(x) = 3x \) for all \( x \in N \).
  4. Step 4: Find the range of g: The range of \( g \) is \( \{g(x) : x \in N\} = \{3, 6, 9, 12, \ldots\} \), which is the set of all positive multiples of 3.
  5. Step 5: Show that g is NOT onto: Consider \( y = 1 \in N \). For \( g(x) = 1 \), we would need \( 3x = 1 \), giving \( x = \frac{1}{3} \), which is not a natural number. Therefore, \( 1 \in N \) has no pre-image in \( N \) under \( g \). Similarly, any natural number that is not a multiple of 3 (such as 1, 2, 4, 5, ...) has no pre-image. Hence, \( g \) is not onto.

Answer: The identity function \( I_{N}(x) = x \) is onto because every \( y \in N \) has pre-image \( x = y \). However, \( g(x) = 3x \) maps \( N \) only to the set of multiples of 3, i.e., \( \{3, 6, 9, \ldots\} \). Natural numbers that are not multiples of 3, such as 1 and 2, have no pre-image in \( N \) under \( g \). Hence \( g \) is not onto.

Everything you get with Solver7

More questions in Relations and Functions