Quote:
Originally Posted by oldguynewstudent This was a question on my last test. The whole class got it wrong. I understand the falacy of my argument because there might be other functions f defined other than the bijection I stipulated. Can anyone help solve this? Thanks.
Suppose f: A  B is a function between two finite sets A and B with the same cardinality. Prove that f is 1-1 iff f is onto. |
Let

:
1) Suppose f is 1-1 ==> the set

has as many elements as A (and as B) ==>

, otherwise B is a finite set having a proper subset with its same cardinality and this is the definition of INFINITE sets ==> f is onto.
2) Suppose now that f is onto ==>

; if

then

, which is impossible since

, thus it must be that

==> f is 1-1.
Tonio