Prove that there are uncountably many surjective functions f : N → N

169 Views Asked by At

Can you help me determine what I am doing wrong in this proof? Is this sufficient? enter image description here

1

There are 1 best solutions below

0
On

Your proof is perfect.

Even more than sufficient, as you state once that $g$ is clearly surjective, as already its restriction to even numbers is so, and then in the end you spell it out again.