Function

Let A = {a, b, c}, B = {u, v, w} and let f and g be two functions from A to B and from B to A, respectively, defined as: f = {(a, v), (b, u), (c, w)}, g = {(u, b), (v, a), (w, c)}. Show that f and g both are bijections and find fog and gof.

Given f = {(a, v), (b, u), (c, w)}, g = {(u, b), (v, a), (w, c)}. Also given that A = {a, b, c}, B = {u, v, w} Now we have to show f and g both are bijective. Consider f = {(a, v), (b, u), (c, w)}...

read more

Are the following set of ordered pair of a function? If so, examine whether the mapping is injective or surjective: (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}

Let f = {(x, y): x is a person, y is the mother of x} As, for each element x in domain set, there is a unique related element y in co-domain set. So, f is the function. Injection test: As, y can be...

read more