Skip to content
Official PYQ · 2025

GATE CS 2025 Set 1 Q7 — Sets, Relations and Functions

Explain with AI

g(⋅)g(\cdot) is a function from AA to BB, f(⋅)f(\cdot) is a function from BB to CC, and their composition defined as f(g(⋅))f(g(\cdot)) is a mapping from AA to CC.

If f(⋅)f(\cdot) and f(g(⋅))f(g(\cdot)) are onto (surjective) functions, which ONE of the following is TRUE about the function g(⋅)g(\cdot) ?

Choose one option
View worked solution

Answer: D

To determine the properties of the function g:A→Bg: A \to B, we can construct a simple counterexample where both ff and f∘gf \circ g are onto, but gg is neither one-to-one (injective) nor onto (surjective).

Let the sets be:

  • A={1,2,3}A = \{1, 2, 3\}
  • B={x,y,z}B = \{x, y, z\}
  • C={p,q}C = \{p, q\}

Define the function g:A→Bg: A \to B as:

  • g(1)=xg(1) = x
  • g(2)=xg(2) = x
  • g(3)=yg(3) = y

Here, gg is not one-to-one (since g(1)=g(2)=xg(1) = g(2) = x) and not onto (since z∈Bz \in B has no preimage in AA).

Define the function f:B→Cf: B \to C as:

  • f(x)=pf(x) = p
  • f(y)=qf(y) = q
  • f(z)=qf(z) = q

Here, ff is onto because the range of ff is {p,q}=C\{p, q\} = C.

Now, let us find the composition (f∘g):A→C(f \circ g): A \to C:

  • (f∘g)(1)=f(g(1))=f(x)=p(f \circ g)(1) = f(g(1)) = f(x) = p
  • (f∘g)(2)=f(g(2))=f(x)=p(f \circ g)(2) = f(g(2)) = f(x) = p
  • (f∘g)(3)=f(g(3))=f(y)=q(f \circ g)(3) = f(g(3)) = f(y) = q

The composition f∘gf \circ g is onto because its range is {p,q}=C\{p, q\} = C.

Since both ff and f∘gf \circ g are onto, but gg is neither one-to-one nor onto, we conclude that gg is not required to be one-to-one or onto.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Sets, Relations and Functions questions