If two sets X and Y have the same cardinality, can we assume that the f: X->Y is one to one? If not, and all Im given is that they're the same size, how can I prove that the function is injective? Thanks.
Are you given any information about ? Since , there /exists/ a bijective function between these sets. But there also exist functions which are neither surjective nor injective (assuming that they have more than one element).
Or maybe the assignment is to find such an ?