Go backward to Functions Go up to Top Go forward to Isomorphism |
f(x)=f(y) => x=y (for all x,y in R)
for every y in S there is some x in R such that f(x) in y
f: R => R
f(x)=x (for all x in R)
f:R => S injective and surjective
g:S => R, g(y) = x <=> f(x) = y
g=f-1