This question was previously asked in

GATE CS 2014 Official Paper: Shift 3

Option 4 : For any subset S and T of Y, F^{-1}(S∪ T) = f^{-1}(S)∩ f^{-1}(T)

IBPS SO IT Officer Mains: Full Mock Test

5354

60 Questions
60 Marks
45 Mins

**Concept:**

First three statements can be proved invalid by taking a counter example. For example,

Suppose X = {p, q, r} and Y = (1, 2)

A function f maps each element of set X to exactly one element of set Y. The one element from Y is 1 to which each element of X is mapped.

This means,

f(p) = 1, f(q) = 1, f(r) = 1

Now, we take subsets of X as A = (p, q) and B = (q, r)

**Explanation: **

__Option_1 __- False

LHS = |f (A ∪ B)| = |f ({p, q, r})| = 3

RHS = |f(A)| + |F(B)| = 2 + 2 = 4

LHS ≠ RHS

__Option_2 __- False

LHS = f (A ∩ B) = f ({q}) = {1}

RHS = f(A) ∩ f(B) = {1, 1} ∩ {1, 1} = {1, 1}

LHS ≠ RHS

__Option_3 __- False

LHS = |f (A ∩ B)| = |f ({q})| = |{1}| = 1

RHS = min{|f(A)|, |f(B)|} = min(2, 2) = 2

LHS ≠ RHS

__Option_4__ - True

In a function, one value from domain set X can be mapped to exactly one value from range set Y.

This option assumes that the inverse of function f exists which is true.