f: A x b --> A defined by f(x,y) = x

Injective: Here's what I did

Suppose f(x,y) = f(a,b). Then x = a. Thus not injective

Is this the correct approach?

surjective: Not sure how to go about this... Any advice? Thanks

Printable View

- Oct 9th 2010, 12:04 AMjzelltShow Injective/surjective
f: A x b --> A defined by f(x,y) = x

Injective: Here's what I did

Suppose f(x,y) = f(a,b). Then x = a. Thus not injective

Is this the correct approach?

surjective: Not sure how to go about this... Any advice? Thanks - Oct 9th 2010, 03:41 AMSwlabr
For injective, you need to say that is not equal to (you start with , but then you concluded that but not that ).

So, a proof would be: Note that for , but .

What you did was write down the working to find the proof, but it wasn't the proof itself per se.

For surjective, you start with something arbitrary in the image, A, and find something which maps to it. So, let . Can you think of some such that ? - Oct 9th 2010, 04:28 AMHallsofIvy
Well, what causes the "thus"? To show "not injective", you need to assert that two different pairs, and , can give the same value- you need to give a counterexample.

Quote:

Is this the correct approach?

surjective: Not sure how to go about this... Any advice? Thanks

If you are given a number b does there exist a pair (x, y) such that f(x,y)= b? If so, what is it?