Graph of a function only if first projection is bijective

[h.shin]

Homework Statement

If A and B are sets, prove that a subset \Gamma\subset A X B is the graph of some function from A to B if and only if the first projection \rho: \Gamma\rightarrow A is a bijection.

Homework Equations

The Attempt at a Solution

I first thought that i should define bijection by saying that a a bijection exists when there is both injection and surjection.

If \rho: \Gamma\rightarrow A is not a bijection then it is either
1)not surjective
2)not injective
3)both 1) and 2)

So,
I thought that i should prove that \Gamma is not the graph of some function A -> B when the first projection is not bijective by showing the non-surjective and non-injective cases separately. And then prove that it is, in fact, \Gamma is the graph of the function when the first projection is bijective.

So, i have to show the cases for when the first projection is not injective, when it's not surjective, and then when it is bijective.
But, how do i prove that the \Gamma is either the graph of the function or not? in any of the 3 cases?

I just don't know where to start. Is this the right approach or is there a shorter way to do this?

 

[micromass]

You're on the right way. Answer these:

What does it mean for \Gamma to be the graph of a function. What could go wrong?? (there are two things that could go wrong). What is the projection in the case that it goes wrong??

Maybe try some examples of \Gamma first to get used to it.

 

[h.shin]

what does a graph of a function mean. Well, doesn't it just mean that it represents the relationship between the domain and the co domain? and what could go wrong..?

Well, i feel like the only things that can go wrong are if there are two values of codomain for one value of domain. Or, there just might be values in the co domain that is not the image of any value in the domain.

I mean, don't these two things just mean, the function is not surjective and injective?