Possible title: How to Construct a Surjection Map from N to Z

  • Thread starter Thread starter missavvy
  • Start date Start date
  • Tags Tags
    Surjection
missavvy
Messages
73
Reaction score
0
Surjection from N --> Z

Homework Statement



Find a surjection map,
f: N -> Z

Homework Equations





The Attempt at a Solution


I think this is equivalent to finding an injection map:
g: Z -> N

So I defined it:

g(z) =

-z, if z is negative
z, if z is positive

Is this incorrect?
 
Physics news on Phys.org


1. It's not -- exactly -- equivalent to finding an injection g: \mathbb{Z} \to \mathbb{N}, because the inverse of such a g is only a partial function \mathbb{N} \to \mathbb{Z}; you have to extend it to be defined on \mathbb{N} \setminus g(\mathbb{Z}). However, the result of that process is indeed a surjection \mathbb{N} \to \mathbb{Z}.

2. The function you give is not an injection; g(-1) = g(1) = 1.

It's probably easier to attack this problem by constructing the surjection you want "by hand". There are several simple algorithms which will work.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top