document.write( "Question 1103170: Let f : A ——> B and g : B ——> C , two bijective functions. Prove that g•f is bijective \n" ); document.write( "
Algebra.Com's Answer #717956 by robertb(5830)![]() ![]() You can put this solution on YOUR website! Let a, b be elements of A such that \r \n" ); document.write( "\n" ); document.write( "g(f(a)) = g(f(b)).\r \n" ); document.write( "\n" ); document.write( "g 1-to-1 ==> f(a) = f(b).\r \n" ); document.write( "\n" ); document.write( "f 1-to-1 ==> a = b.\r \n" ); document.write( "\n" ); document.write( "==> g(f(x)) is 1-to-1 also.-------------(1)\r \n" ); document.write( "\n" ); document.write( "Now let z be an element of C.\r \n" ); document.write( "\n" ); document.write( "g DISABLED_event_onto= => there is y an element of B such that g(y) = z.\r \n" ); document.write( "\n" ); document.write( "f DISABLED_event_onto= => there is x an element of A such that f(x) = y. \r \n" ); document.write( "\n" ); document.write( "===> g(f(x)) = z.\r \n" ); document.write( "\n" ); document.write( "===> g o f is also onto.--------------(2)\r \n" ); document.write( "\n" ); document.write( "Therefore g o f is also bijective, from (1) and (2). \n" ); document.write( " |