Injevtive/surjective Problem - Algebra

  • Thread starter Thread starter SclayP
  • Start date Start date
  • Tags Tags
    Algebra
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
4 replies · 2K views
SclayP
Messages
27
Reaction score
0
So, i have to analyze the next function and see if it is injective and surjective
f: NXN → N
f(x,y)=x+y

i know that a function to be injective f(a)=f(b) → a=b

but here i have that f(a,c)=f(b,d) → (a,c)=(b,d)

next thing i do: a+c =b+d

now i don't know what to do...PLEASE HELP ME
 
Physics news on Phys.org
If the function were injective, it would mean that for every element b in N there's no more than one element a in NXN such that f(a)=b. This is not the case here. For example, f(1,0)=f(0,1).

Surjectivity means here that for every element b of N there's at least one element a in NXN such that f(a)=b. This function is surjective, because if x is an element of N, then f(x,0)=x+0=x.
 
hilbert2 said:
If the function were injective, it would mean that for every element b in N there's no more than one element a in NXN such that f(a)=b. This is not the case here. For example, f(1,0)=f(0,1).

Surjectivity means here that for every element b of N there's at least one element a in NXN such that f(a)=b. This function is surjective, because if x is an element of N, then f(x,0)=x+0=x.

Isn't a way to prove this without a counterexample. The injectivity it's all right if i doi it that way, but to prove that the function it it surjective i have that: [itex]\forall[/itex]yB,[itex]\exists[/itex]xA/y=f(x)
 
SclayP said:
Isn't a way to prove this without a counterexample. The injectivity it's all right if i doi it that way, but to prove that the function it it surjective i have that: [itex]\forall[/itex]yB,[itex]\exists[/itex]xA/y=f(x)

Write down precisely what you need to show for your function. Are you sure you can't think of a simple way to write any [itex]x \in \mathbb{N}[/itex] as [itex]n+m[/itex]?

If the function were injective, it would mean that for every element b in N there's no more than one element a in NXN such that f(a)=b. This is not the case here. For example, f(1,0)=f(0,1).

Surjectivity means here that for every element b of N there's at least one element a in NXN such that f(a)=b. This function is surjective, because if x is an element of N, then f(x,0)=x+0=x.

Please don't do all of the work for the OP, especially when the question is clearly homework.
 
To clarify, are you defining N to include 0?