Are the following sets of ordered pairs functions? If so, examine whether the mapping is surjective or injective: (i) {(x, y) : x is a person, y is the mother of x} (ii) {(a, b) : a is a person, b is an ancestor of a}
Open in App
Solution
Given: f :{(x,y) : x is a person, y is mother of x}
Let x1 and x2 be two persons.
Step 1: Injective or One-one function
f(x1)=f(x2) ⇒ both x1 and x2 have same mother but this does not imply x1 and x2 are same x1 need not be x2. They can be brother or sister.
Hence, f is not injective.
Step 2: Surjective or Onto function
For every mother defined by (x, y), there exists a person x for whom y is mother.