Question

could anyone tell me what are injective,bijective and surjective functions with an example?

Answer 1

fancy terms for one to one, onto, one to one and onto

Answer 2

there are specific definitions of courses

\(f\) is one to one "injective" if \(f(a)=f(b)\implies a=b\)

\(f\) is onto "surjective" if given any \(b\) in the codomain of \(f\) there exists an \(a\) in the domain of \(f\) with \(f(a)=b\)

Answer 3

function is some rule that asigns elements from one set to elements of other set, with only restriction that the asignement should be one to one, many to one. When each element from 1º set is asigned only one elemnt from 2º set it's called injection. When all the elements from the 2º set are being asigned, is called surjection. When bouth cases , is coled bijection

Answer 4

Thank you!
So that said if a function has many values in the domain for one value in the co-domain (onto) would not be invertible right?

Answer 5

tumblr

Answer 6

yes a function needs to be one to one "injective" to be invertible

Answer 7

Thanks!

Answer 8

yw