Ask your own question, for FREE!
Mathematics 7 Online
OpenStudy (loser66):

Please, help; f, g are functions f:A--> B g: B--> C show that if gof is injective, then f is injective.

OpenStudy (loser66):

My attempt: gof : A --> C let z in C , there exists unique x in A such that gof (x) = z

OpenStudy (loser66):

gof(x) = g(f(x) ) = z x is unique--> f(x) is unique --> f is injective but It sounds weak.

OpenStudy (anonymous):

i would start by picking \(a_1, a_2\in A\) and then show if \(f(a_1)=f(a_2)\) then \(a_1=a_2\) as that is the definition of injective

OpenStudy (loser66):

Thank you, let me try.

OpenStudy (anonymous):

ok it should take one very short line

OpenStudy (loser66):

Oh, yeah, It's easier,

OpenStudy (loser66):

Thank you so much

OpenStudy (anonymous):

very yw

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!