172 views
0 votes
0 votes

Let $f \: \circ \: g$ denote function composition such that $(f \circ g)(x) = f(g(x))$. Let $f: A \rightarrow B$ such that for all $g \: : \: B \rightarrow A$ and $h \: : \: B \rightarrow A$ we have $f \: \circ \: g = f \: \circ \: h \: \Rightarrow g = h$. Which of the following must be true?

  1. $f$ is onto (surjective)
  2. $f$ is one-to-one (injective)
  3. $f$ is both one-to-one and onto (bijective)
  4. the range of $f$ is finite
  5. the domain of $f$ is finite

https://gateoverflow.in/95289/tifr2017-a-11


i'm not able to understand why f should be one-to-one 

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
1 answer
2
Abhipsa asked Jan 23, 2019
533 views
What is the number of relations S over set {0,1,2,3} such that (x,y) $\epsilon$ S $\Rightarrow x = y$ ? Thanks.
0 votes
0 votes
1 answer
3
Abhipsa asked Jan 23, 2019
384 views
What Is The Total Number Of Boolean Functions Possible Over N Boolean Variables?