For every a ∈ X. (a. a) ∈ R as f (a) = f (a),
∴ R is reflexive.
Similarly. (a, b) ∈ R ⇒ f(a) = f(b) ⇒ f(b) = f(a) ⇒ (b, a) ∈ R ∴ R is symmetric.
Further, (a, b) ∈ R and (b, c) ∈ R
⇒ f (a) = f (b) and f (b) = f(c) ⇒ f (a) = f (c) ⇒ (a, c) ∈ R ∴ R is transitive.
∴ R is an equivalence relation.
Let f : Z → Z, g : Z → Z be functions defined by
f = {(n, n2): n ∈ Z} and g = {(n | n |2): n ∈ Z}. Show that f = g.
Let f : R → R be defined as f (x) = x4 Choose the correct answer.
(A) f is one-one onto (B) f is many-one onto
(C) f is one-one but not onto (D)f is neither one-one nor onto.
Let f : R → R be defined as f (x) = 3 x. Choose the correct answer. (A) f is one-one onto (B) f is many-one onto
(C) f is one-one but not onto (D) f is neither onc-one nor onto.