800 views

1 Answer

Best answer
0 votes
0 votes

For a function f to be bijective, we need to check 2 conditions ~

  1. It must be one-one
  2. It must be onto

Also, a function is invertible iff it is one-one.

So yes, a bijective function is invertible and bijective as well

Consider this screenshot from Rosen

You can also try an example and confirm.

selected by

Related questions

0 votes
0 votes
1 answer
1
dragonball asked May 2, 2017
766 views
No of one to one function from set A={1,2,3,4,5,6,7,8,9} to set B ={x1,x2,x3,x4,x5,x6,x7,.....,xn}
2 votes
2 votes
1 answer
3
anshu asked Feb 7, 2015
834 views
Total onto function from a to b with cardinality 4 and 3 respectively??
0 votes
0 votes
1 answer
4
dan31 asked Nov 8, 2018
584 views
Let R be set of all real numbers, and A = B = R*RA function A- B is defined byf(a,b) = (a+b,a-b)How to prove it is a bijective function?