This preview shows page 1. Sign up to view the full content.
Unformatted text preview: constructing such a function g; in other words you should clearly say what g ( t ) is for a given t 2 T: The problem is trivial if f is a bijection. ‹t is a good idea to try to understand what is happenning by just writing a simple example where f is 1-1 or onto (but not both!) and work out to see how g; h could be de&ned. 4. Find a bijection f : Z ! N : (i.e. de&ne such a function and make sure that you check that f is 1-1 and onto.) 1...
View Full Document
This note was uploaded on 06/25/2010 for the course MATH MATH 301 taught by Professor Alberterkip during the Fall '08 term at Sabancı University.
- Fall '08