Relation & Function
Relation & Function
Relation & Function
CONNECTING CONCEPTS
1. In general gof fog.
2. f : A B, be one-one, onto then
f–1 of = IA and fof–1 = IB
3. f : A B, g : B C, h : C D
then (hog) of = ho (gof).
4. f : A B, g : B C be one-one and onto then gof : A C is also one-one onto and (gof)–1 = f–1 o g–1.
5. Let : A B, then IB of = f and foIA = f. It should be noted that foIB is not defined since for
(foIB) (x) = fo {IB (x)} = f (x)
IB (x) exist when x B and f (x) exist when x A
6. f : A B, g : B C are both one-one, then gof : A C is also one-one it should be noted that for gof to
be one-one f must be one-one.
7. If f : A B g : B C are both onto then gof must be onto. However, the converse is not true. But for gof
to be onto g must be onto.
8. The domain of the functions
(f + g) (x) = f (x) + g (x)
(f – g) (x) = f (x) – g (x)
(fg) (x) = f (x) g (x)
f (x)
is given by (dom. f) (dom g) while domain of the function (f/g) (x) = is given by..
g (x)
(dom f) (dom. g) – {x : g (x) = 0}
9. If O (A) = m, O (B) = n, then total number of mappings from A to B is nm.
10. If A and B are finite sets and O (A) = m, O (B) = n, m n.
n!
Then number of injection (one-one) from A to B is nPm = (n m)!
11. If f : A B is injective (one-one), then O(A) O (B).
12. If f : A B is surjective (onto), then O (A) O (B).
13. If f : A B is bijective (one-one onto), then O (A) = O (B).
14. Let f : A B and O (A) = O (B), then f is one-one it is onto.
15. Let f : A B and X1, X2 A, then f is one-one iff f (X1 X2) = f (X1) f (X2)
16. Let f : A B and X A, Y B, then in general f–1 (f (x)) X, f (f–1 (y)) Y
If f is one-one onto f–1 (f (x)) = x, f (f–1 (y)) = Y.