Surjective, injective, bijective how to tell apart

[haki]

Hi,

I have no problems with recognising a bijective function -> one-to-one mapping e.g. x^3 is bijective wheras x^2 is not.

But how do you tell weather a function is injective or surjective? I was reading various "math" stuff on this but it has left me only puzzled. Can somebody explain injective and surjective in plain english. How do you tell weather a function is injective or surjective or none?

 

[Perturbation]

f:A\rightarrow B is surjective if f maps on to the whole of B. For example, x^2:\mathbb{R}\rightarrow\mathbb{R} is not surjective because x^2 only maps R onto the positive reals. So f:A\rightarrow B is surjective iff f(x)=y, x\in A, \forall y\in B. x^2:\mathbb{R}\rightarrow\mathbb{R}^+ is however surjective. It's all about the domains and ranges.

Injective is if f maps each member of A onto one and only one unique element of B, injective is just another word for one-to-one. Again, x^2:\mathbb{R}\rightarrow\mathbb{R} isn't injective because both the -x and +x map onto x^2, so it is many to one. x^2:\mathbb{R}^+\rightarrow\mathbb{R} is injective though. x^3:\mathbb{R}\rightarrow\mathbb{R} is injective and surjective, and thus bijective (bijective being both injective and surjective). x^2:\mathbb{R}^+\rightarrow\mathbb{R}^+ is then bijective. The important property of injective maps is that they are invertable, surjective maps aren't necessarilly so.

 

[matt grime]

Hi,

I have no problems with recognising a bijective function -> one-to-one mapping e.g. x^3 is bijective wheras x^2 is not.

But how do you tell weather a function is injective or surjective?

you look at the definition, look at the function and try to figure out if the function satisfies the definition.

More on the definition in the next post.

 

[matt grime]

Injective is if f maps each member of A onto one and only one unique element of B

No, this is not correct. f is injective if f(x)=f(y) implies x=y. This is not what you have written down here.

With that correction, is the OP now ok with the definition?

 

[haki]

Ok, I did some more reading and thinking.

If I understand correctly, the point of injection is that it is focused on the mapping that is only one value from domain must be mapped by another value at the codomain. Soo there is one-to-one mapping - injective.

The point or surjectivity is a bit trickier. The trick lies in the domain and codomain definitions. Here I don't get it. e.g. x^2 is a surjective function if you define the codomain to consist of only positive real numbers R+True?. Meaning - in a surjective function the codomain must not include values that are not mapped to corresponding values of the domain.

For example if a function is injective(one-to-one mapping) but if its codomain is defined to include values that the function never mapps then the function is not surjective? But if we modify the definition of the codomain we can get a surjective function aswell? Meaning a bijective function should the function be injective in the first place?

 

[Nimz]

Bijective means both injective and surjective. Or, in other parlance, one-to-one and onto, respectively. Wiki can be very helpful: http://en.wikipedia.org/wiki/Bijective

 

[matt grime]

One thing to remember is that formally part of the definition of a funtion is the specification of domain and codomain. If you change those you change the function so of course you're going to potentially change its properties. For instance x^2 isn't actually a function until you tell me what is domain and codomain are. Now I'm confused because I thought you said you knew what a bijection was. A bijection is a map that is injective and surjective (one-to-one and onto). So what definition of bijection were you using?

 

[Perturbation]

No, this is not correct. f is injective if f(x)=f(y) implies x=y. This is not what you have written down here.

With that correction, is the OP now ok with the definition?

Ah, thank you for that correction. I wasn't sure how to write it mathematically, though now that you've written that it does ring a bell.

 

[matt grime]

What you wrote essentially specified what it means to be a function: given some element in the domain we associate a unique element in the codomain, and we write something like f(x) for the element that we associate to x.

 

[mathwonk]

another useful, tip: up, down, sideways, how to tell them apart? nose, toes and elbows.

 

[haki]

now I am a bit more confused.

a bijective function is for me a function that is mapped one-to-one. That means that if you make an inverse function that is for a given value of y you get back only one x. E.g. the inverse of x^2, would be sqrt(x) but that gives to answers +/- sqrt(x). Soo that is not one-to-one and not bijective.

injective - that is the property of bijective functions -> one-to-one mapping

surjective - a bit tricky, means the codomain is of same "power" as the domain.

is any of this correct?

 

[Muzza]

A bijective function is a function which is BOTH injective and surjective.

 

[matt grime]

You cannot define an inverse function if the function is not surjective: how do you define the inverse function on elements of the codomain that are not mapped to?

 

[mathwonk]

here is another point of view: given a map f:X-->Y, another map g:Y-->X is a left inverse of f iff gf = id(Y), a right inverse iff fg = id(X), and a 2 sided inverse if both hold.

then f is injective iff it has a left inverse, surjective iff it has a right inverse (assuming AxCh), and bijective iff it has a 2 sided inverse.