Friday, 4 July 2014

functions - To prove mapping f is injective and the other f is bijective



There's a mapping f:XY.



1.for all A,BX, f(AB)=f(A)f(B), prove f is injective.




2.for all AX, f(Ac)=[f(A)]c, prove f is bijective.


Answer



For 1 you want to show that f(x)=f(y) implies x=y. So let f(x)=f(y). Then f({x})=f({y}) and hence f({x})f({y})=f({x})=f({y})=f({x}{y}). Hence x=y.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...