GATE CS 2023 (Forenoon) — Question 49

Discrete MathematicsSets, Relations, Functions, Partial Orders, LatticesMSQ2 marksHard

Let \(f : A \rightarrow B\) be an onto (or surjective) function, where \(A\) and \(B\) are non-empty sets. Define an equivalence relation \(\sim\) on the set \(A\) as \(a_1 \sim a_2\) if \(f(a_1) = f(a_2)\), where \(a_1, a_2 \in A\). Let \(\epsilon = \{[x] : x \in A\}\) be the set of all the equivalence classes under \(\sim\). Define a new mapping \(F : \epsilon \rightarrow B\) as \(F([x]) = f(x)\), for all the equivalence classes \([x]\) in \(\epsilon\). Which of the following statements is/are TRUE?
  1. A
    \(F\) is NOT well-defined.
  2. B
    \(F\) is an onto (or surjective) function.
  3. C
    \(F\) is a one-to-one (or injective) function.
  4. D
    \(F\) is a bijective function.
Practise the full 2023-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkDiscrete Mathematics and Its Applications (Rosen)Logic, sets, relations, combinatorics and graph theory, with worked examples.
Practise more on Sets, Relations, Functions, Partial Orders, LatticesTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group