The Gateway to Computer Science Excellence
0 votes
23 views

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 

in Set Theory & Algebra by Boss (35.4k points) | 23 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,650 questions
56,242 answers
194,284 comments
95,929 users