Session 3

Definition of Functions, Domain, Codomain and Range,

Composition of Mapping, Equivalence Classes,
Partition of Set, Congruences

Functions which is read as f is a mapping from A to B.

The other terms used for functions are operators or
transformations.
Introduction A B

If two variable quantities x and y according to some law x

are so related that corresponding to each value of x y=f(x)
(considered only real), which belongs to set E, there
corresponds one and only one finite value of the quantity Remark
y (i.e., unique value of y). Then, y is said to be a function 1. If x Î A, y = [ f ( x )] Î B, then ( x, y ) Î f .
(single valued) of x, defined by y = f ( x ), where x is the 2. If ( x1, y1 ) Î f and ( x 2, y2 ) Î f , then y1 = y2.
argument or independent variable and y is the
dependent variable defined on the set E.
For example, If r is the radius of the circle and A its area,
then r and A are related by A = pr 2 or A = f (r ). Then,
Domain, Codomain and Range
Domain The set of A is called the domain of f (denoted
we say that the area A of the circle is the function of
by D f ).
the radius r. Graphically,
Codomain The set of B is called the codomain of f
(denoted by C f ).
x Input y = f(x)
Output Range The range of f denoted by R f is the set consisting
of all the images of the elements of the domain A.
Range of f = [ f ( x ) : x Î A ]
Where, y is the image of x and x is the pre-image of y
under f . The range of f is always a subset of codomain B.

Remark
1. If to each value of x, which belongs to set E there Onto and Into Mappings
corresponds one or more than one values of the quantity y.
In the mapping f : A ® B such
Then, y is called the multiple valued function of x defined on
the set E. f (A) = B
2. The word ‘FUNCTION’ is used only for single valued function. i.e., Range = Codomain
For example, y = x is single valued functions but y 2 = x is a
multiple valued function.
Then, the function is Onto and if f ( A ) Ì B, i.e. Range Ì
\ y 2 = x Þ y = ± x for one value of x, y gives two values.
Codomain, then the function is Into.

Remark
Definition of Functions Onto functions is also known as surjective.

If A and B be two non-empty sets, then a function from A Method to Test Onto or Into Mapping
to B associates to each element x in A, a unique element Let f : A ® B be a mapping. Let y be an arbitrary element
f ( x ) in B and is written as
in B and then y = f ( x ), where x Î A. Then, express x in
f
f : A ® B or A ¾® B terms of y.
Now, if x Î A, " y Î B, then f is onto Let y = 2x , then x =
y
and if x Ï A, " y Î B, then f is into. 2
5
For into mapping Find an element of B which is not Now, if we put y = 5, then x = ÏN.
2
f -image of any element of A.
This show that 5 Î N has no pre-image in N . So, f is into.
Hence, f is one-one and into.
One-one and Many-one Mapping
y Example 22. Show that the mapping
(i) The mapping f : A ® B is called one-one mapping, if
f :R ® R : f ( x ) = cos x , " x ÎR is neither one-one nor
no two different elements of A have the same image
onto.
in B. Such a mapping is also known as injective
mapping or an injection or monomorphism. Sol. Let x 1, x 2 Î R.
Method to Test One-one If x 1 , x 2 Î A, Then, f ( x1 ) = f ( x 2 ) Þ cos x 1 = cos x 2
then f (x 1 ) = f (x 2 ) Þ x 1 = 2np ± x 2 Þ x 1 ¹ x 2
Þ x 1 = x 2 and x 1 ¹ x 2 \ f is not one-one.
Þ f (x 1 ) ¹ f (x 2 )
Let y = cos x , but -1 £ cos x £ 1
(ii) The mapping f : A ® B is called many-one mapping,
\ y Î [ -1, 1]
if two or more than two different elements in A have
the same image in B. [ -1, 1] Ì R
Method to Test Many-one So, f is into (not onto).
If x 1 , x 2 Î A, then f ( x 1 ) = f ( x 2 ) Hence, f is neither one-one nor onto.
Þ x1 ¹ x2
From above classification, we conclude that Constant Mapping
function is of four types The mapping f : A ® B is known as a constant mapping,
(i) One-one onto (bijective) if the range of B has only one element.
(ii) One-one into For all x Î A, f ( x ) = a, where as a Î B.
(iii) Many-one onto
(iv) Many-one into Identity Mapping
The mapping f : A ® B is known as an identity mapping,
Number of Functions (Mappings) at if f (a ) = a, " a Î A and it is denoted by I A .
One Place in a Table Remark
Let f : A ® B be a mapping such that A and B are finite IA is bijective or bijection.
sets having m and n elements respectively, then
Description of mappings Equal Mapping
(i) Total number of mappings from A to B Let A and B be two mappings are f : A ® B and g : A ® B
(ii) Total number of one-one mappings from A to B such that
(iii) Total number of many-one mappings from A to B f ( x ) = g ( x ), " x Î A
(iv) Total number of onto (surjective) mappings from A to B Then, the mappings f and g are equal and written as
f = g.
(v) Total number of one-one onto (bijective) mappings from A to B
(vi) Total number of into mappings from A to B Inclusion Mapping
The mapping f : A ® B is known as inclusion mapping.
y Example 21. Let N be the set of all natural numbers.
Consider f : N ® N : f ( x ) = 2x , " x Î N . Show that f is If A Í B, then f (a ) = a, " a Î A.
one-one into. Equivalent or Equipotent
Sol. Let x 1, x 2 Î N , then
or Equinumerous Set
f ( x1 ) = f ( x 2 )
The mapping f : A ® B is known as equivalent sets, if A
Þ 2x 1 = 2x 2 Þ x 1 = x 2
and B are both one-one and onto and written as A ~ B
\ f is one-one.
which is read as ‘A wiggle B ’.
Inverse Mapping 2. Let h : A ® B, g : B ® C and f : C ® D
be any three functions. Then, ( fog ) oh = fo( goh).
If f : A ® B be one-one and onto mapping, let b Î B, then 3. Let f : A ® B, g : B ® C be two functions, then
there exist exactly one element a Î A such that f (a ) = b, so (i) f and g are injective Þ gof is injective.
we may define (ii) f and g are surjective Þ gof is surjective.
f -1
:B ®A: f -1
(b ) = a (iii) f and g are bijective Þ gof is bijective.
4. An injective mapping from a finite set to itself in bijective.
Û f (a ) = b
-1
The function f is called the inverse of f . A functions is y Example 24. If f :R ® R and g :R ® R be two
invertible iff f is one-one onto. mapping such that f ( x ) = sin x and g ( x ) = x 2 , then
(i) prove that fog ¹ gof .
Remark p p
1. f -1 ( b) Í A (ii) find the values of ( fog ) and (gof ) æç ö÷ .
2 è3ø
2. If f : A ® B and g : B ® A, then f and g are said to be
invertible. Sol. (i) Let x Î R
\ ( fog )x = f { g ( x )} [Q g ( x ) = x 2 ]
y Example 23. Let f :R ® R be defined by
= f { x 2 } = sin x 2 …(i)
f ( x ) = cos ( 5x + 2). Is f invertible? Justify your answer.
[Q f ( x ) = sin x ]
Sol. For invertible of f , f must be bijective (i.e., one-one onto).
and ( gof ) x = g { f ( x )}
If x 1 , x 2 Î R, = g (sin x ) [Q f ( x ) = sin x ]
then f ( x1 ) = f ( x 2 ) = sin x2
…(ii)
Þ cos(5x 1 + 2) = cos(5x 2 + 2) [Q g ( x ) = x 2 ]
Þ 5x 1 + 2 = 2np ± (5x 2 + 2)
From Eqs. (i) and (ii), we get ( fog )x ¹ ( gof ) x , " x Î R
Þ x1 ¹ x 2 Hence, fog ¹ gof
\ f is not one-one. (ii) From Eq. (i), ( fog )x = sin x 2
But -1 £ cos(5x + 2) £ 1
p p 1
\ -1 £ f (x ) £ 1 \ ( fog ) = sin =
2 4 2
Range = [ - 1, 1] Ì R
and from Eq. (ii), ( gof ) x = sin 2 x
\ f is into mapping. 2
p p æ 3ö 3
Hence, the function f ( x ) is no bijective and so it is not \ ( gof ) = sin 2 = ç ÷ =
invertible. 3 3 è 2 ø 4

y Example 25. If the mapping f and g are given by

Composition of Mapping f = {(1, 2), (3, 5), (4, 1)}
Let A, B and C be three non-empty sets. Let f : A ® B and and g = {(2, 3),(5, 1), (1, 3)},
g : B ® C be two mappings, then gof : A ® C. This write down pairs in the mapping fog and gof.
function is called the product or composite of f and g, Sol. Domain f = {1, 3, 4 }, Range f = {2, 5, 1}
given by ( gof ) x = g { f ( x )}, " x Î A. Domain g = {2, 5, 1}, Range g = {1, 3}
A B C Range f = Dom g = {(2, 5, 1)}
f : A →B g : B→C Q
\ gof mapping is defined.
x
y = f(x) z=g{f(x)} Then, gof mapping defined following way
f g
{1, 3, 4} → {2, 5, 1} → {1, 3}
gof : A → C

gof
Important Remarks
1. (i) ( fog ) x = f {g ( x )} (ii) ( fof ) x = f {f ( x )} We see that, f (1) = 2, f (3) = 5, f ( 4 ) = 1
(iii) ( gog ) x = g{g( x )} (iv) ( fg ) x = f ( x ). g( x ) and g(2) = 3, g(5) = 1, g(1) = 3
æf ö f( x ) \ ( gof )(1) = g { f (1)} = g (2) = 3
(v) ( f ± g ) x = f ( x ) ± g( x ) (vi) ç ÷ x = ; g( x ) ¹ 0
ègø g( x ) ( gof )(3) = g { f (3)} = g (5) = 1
 ( gof )( 4 ) = g { f ( 4 )} = g (1) = 3 Continue this process, we see that the equivalence class
Hence, gof = {(1, 3), (3, 1), (4, 3)} [ 4 ] = [0], [5] = [1], [6] = [2], [7 ] = [3], [8] = [0]
Now, since Range of f Ì Dom f Hence, total equivalence relations are [0], [1], [2], [3] and
\ fog is defined. also clear
(i) I = [0] È [1] È [2] È [3]
Then, fog mapping defined following way (ii) every equivalence is a non-empty.
g f
{2, 5, 1} → {1, 3, 4} → {2, 5, 1} (iii) for any two equivalence classes [a ] Ç [b ] = f.

We see that,
fog
g (2) = 3 , g(5) = 1, g(1) = 3
Partition of a Set
f (1) = 2 , f (3) = 5, f ( 4 ) = 1 If A be a non-empty set, then a partition of A, if
\ ( fog )(2) = f { g (2)} = f (3) = 5 (i) A is a collection of non-empty disjoint subsets of A.
( fog )(5) = f { g (5)} = f (1) = 2 (ii) union of collection of non-empty sets is A.
( fog )(1) = f { g (1)} = f (3) = 5 i.e., If A be a non-empty set and A 1 , A 2 , A 3 , A 4 are
Hence, fog = {(2,5),(5,2),(1,5)} subsets of A, then the set { A 1 , A 2 , A 3 , A 4 } is called
partition, if
(i) A 1 È A 2 È A 3 È A 4 = A
Equivalence Classes (ii) A 1 Ç A 2 Ç A 3 Ç A 4 = f
For example,
If R be an equivalence relation on a set A, then [a ] is
equivalence class of a with respect to R. If A = {0, 1, 2, 3, 4 } and A 1 = {0 }, A 2 = {1}, A 3 = { 4 } and
A 4 = {2, 3 }, then we see that for P = { A 1 , A 2 , A 3 , A 4 }
Symbolically, X a or [a ] = { x : x Î X , x R a }.
(i) all A 1 , A 2 , A 3 , A 4 are non-empty subset of A
Remark (ii) A 1 È A 2 È A 3 È A 4 = {0, 1, 2, 3, 4 } = A and
1. Square brackets[ ] are used to denote the equivalence classes. (iii) Ai Ç A j ¹ f, " i ¹ j (i, j = 1, 2, 3, 4 )
2. a Î[ a] and a Î[ b] Þ[ a] = [ b] Hence, from definition P = { A 1 , A 2 , A 3 , A 4 } is
3. Either [ a] = [ b] or [ a] Ç [ b] = f partition of A.
4. Equivalence class of a also denoted by E( a) or a.
( a - b)
5. If a ~ b, = k, the total number of equivalence class is m.
m
Congruences
y Example 26. Let I = {0, ± 1, ± 2, ± 3, ± 4, ...} and Let m be a positive integer, then two integers a and b are
R = {(a, b ) :(a - b ) / 4 = k , k Î I} is an equivalence said to be congruent modulo m, if a - b is divisible by m.
relation, find equivalence class. i.e., m a -b l
a-b
Sol. Given, =k a -b
4 - +
Þ a = 4k + b, where 0 £ b < 4 0
It is clear b has only value in 0, 1, 2, 3. \ a - b = ml, where l is a positive integer.
(i) Equivalence class of [0] = {x : x Î I and x ~ 0} The congruent modulo ‘m’ is defined on all a b Î I by a º b
= { x : x - 0 = 4k } = {0, ± 4, ± 8, ± 12, ...) (mod m), if a - b = ml, l Î I + .
where, k = 0, ± 1, ± 2, ± 3, ...
(ii) Equivalence class of [1] = {x : x Î I and x ~ 1} y Example 27. Find congruent solutions of 155 º 7
= { x : x - 1 = 4k } = { x : x = 4k + 1} (mod 4).
= {..., - 11, - 7, - 3, 1, 5, 9, ...} æ 155 - 7 148 ö
Sol. Since, ç = = 37 ÷
(iii) Equivalence class of [2] = {x : x Î I and x ~ 2} è 4 4 ø
= { x : x - 2 = 4k } = { x : x = 4k + 2} and a = 155, b = 7, m = 4
= {..., - 10, - 6, - 2, 2, 6, 10, ...} a - b 155 - 7 148
\ l= = =
(iv) Equivalence class of [3] = {x : x Î I and x ~ 3} 4 4 4
= { x : x - 3 = 4k } = { x : x = 4k + 3} [here,a = 155,b = 7]
= {..., - 9, - 5, - 1, 5, 9, 13, ...} = 37 (integer)
y Example 28. Find all congruent solutions of 8 x º 6 7l + 3
Þ x=
4
(mod 14).
4 l + 3( l + 1)
Sol. Given, 8x º 6 (mod 14) =
4
8x - 6
\ l= , where l Î I + 3
x = l + ( l + 1), where l Î I +
14 4
\ 8x = 14 l + 6 and here greatest common divisor of 8 and 14 is 2, so there
14 l + 6 are two required solutions.
Þ x=
8 For l = 3 and 7, x = 6 and 13.

Exercise for Session 3

1. The values of b and c for which the identity f ( x + 1) - f ( x ) = 8x + 3 is satisfied, where f ( x ) = bx 2 + cx + d , are
(a) b = 2, c = 1 (b) b = 4, c = - 1 (c) b = - 1, c = 4 (d) b = - 1, c = 1
x -1
2. If f ( x ) = , then f (ax ) in terms of f ( x ) is equal to
x +1
f (x ) + a (a - 1)f (x ) + a + 1 (a + 1) f (x ) + a - 1
(a) (b) (c) (d) None of these
1 + af (x ) (a + 1)f (x ) + a - 1 (a - 1) f (x ) + a + 1

3. If f be a function satisfying f ( x + y ) = f ( x ) + f ( y ), " x, y Î R. If f (1) = k , then f (n ), n Î N is equal to

(a) k n (b) nk (c) k (d) None of these

4. If g = {(1, 1), (2, 3), (3, 5), (4, 7)} is a function described by the formula g ( x ) = ax + b, what values should be
assigned to a and b?
(a) a = 1,b = 1 (b) a = 2, b = - 1 (c) a = 1, b = - 2 (d) a = - 2, b = - 1

5. The values of the parameter a for which the function f ( x ) = 1 + ax , a ¹ 0 is the inverse of itself, is
(a) -2 (b) -1 (c) 1 (d) 2

6. If f ( x ) = (a - x )n 1/ n
, where a > 0 and n Î N, then fof ( x ) is equal to
(a) a (b) x (c) x n (d) a n

7. If f ( x ) = (ax 2 + b )3, the function g such that f ( g( x )) = g (f ( x )), is given by

1/ 2 1/ 2
æ b - x1/ 3 ö 1 æ x 1/ 3 - b ö
(a) g (x ) = çç ÷÷ (b) g (x ) = (c) g (x ) = (ax 2 + b )1/ 3 (d) g (x ) = çç ÷÷
è a ø (ax 2 + b )3 è a ø

8. Which of the following functions from I to itself are bijections?

(a) f (x ) = x 3 (b) f (x ) = x + 2 (c) f (x ) = 2x + 1 (d) f (x ) = x 2 + x
x -m
9. Let f : R - {n} ® R be a function defined by f ( x ) = , where m ¹ n. Then,
x -n
(a) f is one-one onto (b) f is one-one into (c) f is many-one onto (d) f is many-one into

10. If f ( x + 2y , x - 2y ) = xy , then f ( x , y ) equals

x2 - y2 x2 - y2 x2 + y2 x2 - y2
(a) (b) (c) (d)
8 4 4 2
 Answers
Exercise for Session 3
1. (b) 2. (c) 3. (b) 4. (b) 5. (b) 6. (b)
7. (d) 8. (b) 9. (b) 10. (a)