Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective:
{(a, b) : a is a person, b is an ancestor of a}
TIP: – One – One Function: – A function is said to be a one – one functions or an injection if different elements of A have different images in B.
So, is One – One function
⇔ a≠b
⇒ f(a)≠f(b) for all
⇔ f(a) = f(b)
⇒ a = b for all
Onto Function: – A function is said to be a onto function or surjection if every element of A i.e, if f(A) = B or range of f is the co – domain of f.
So, is Surjection iff for each
, there exists
such that f(a) = b
Here, It is given (a, b): a is a person, b is an ancestor of a
As we know any person “a” has more than one ancestor
Thus,
Given relation is not a function