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

  • Thread starter Thread starter missavvy
  • Start date Start date
  • Tags Tags
    Surjection
Click For Summary
SUMMARY

The discussion focuses on constructing a surjection map from the set of natural numbers (N) to the set of integers (Z). The proposed function g(z) = -z for negative z and g(z) = z for positive z was identified as incorrect because it fails to be an injection. The correct approach involves creating a surjection directly from N to Z, which can be achieved using simple algorithms rather than relying on an injection from Z to N.

PREREQUISITES
  • Understanding of set theory and functions
  • Familiarity with surjective and injective functions
  • Basic knowledge of natural numbers (N) and integers (Z)
  • Experience with algorithmic problem-solving techniques
NEXT STEPS
  • Research algorithms for constructing surjective functions
  • Study the properties of injective and surjective mappings in set theory
  • Explore examples of surjection from N to Z in mathematical literature
  • Learn about the Cantor pairing function as a method for mapping between sets
USEFUL FOR

Mathematicians, computer scientists, and students studying discrete mathematics or set theory who are interested in function mapping and algorithm design.

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.
 

Similar threads

Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 8 ·
Replies
8
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K