0% found this document useful (1 vote)
878 views

1.relations and Functions Assignment Solutions

The document contains solutions to 12 questions related to relations and functions. Question 1 involves mappings and binary operations on sets. Question 2 calculates compositions of functions. Questions 3-5 determine if given functions are one-to-one or onto. Questions 6-8 prove various properties of functions. Question 9 determines if given functions have inverses. Questions 10-11 find inverses of functions. Question 12 examines properties of a binary operation on a set.

Uploaded by

Siobhan Reed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (1 vote)
878 views

1.relations and Functions Assignment Solutions

The document contains solutions to 12 questions related to relations and functions. Question 1 involves mappings and binary operations on sets. Question 2 calculates compositions of functions. Questions 3-5 determine if given functions are one-to-one or onto. Questions 6-8 prove various properties of functions. Question 9 determines if given functions have inverses. Questions 10-11 find inverses of functions. Question 12 examines properties of a binary operation on a set.

Uploaded by

Siobhan Reed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

TutorBreeze.

com

RELATIONS AND FUNCTIONS


Revision Assignment
Class 12 Chapter 1
QUESTION 1 (i).In the given

mapping , is f a not a bijection, give reason for your answer .

SOLUTION: In the given mapping f is not a bijection because it is a one-one


one but into
mapping in N
QUESTION 1 (ii).:TheNumber of binary operations on the sset
et {1, 2} are_________

SOLUTION : The number of binary operations on a sset


et of n elements n elementss is n n

The number of binary operations from a set of 2 elements 2 elementss is 22 = 24 = 16ways


16

QUESTION 2(i). If f(x) = x + 7 and g(x) = x 7, x R, find (fog)(7).


SOLUTION: Here, f(x) = x + 7 and g(x) = x 7, x R.
fog(x) = f(g(x)) = f(x 7) = x 7 + 7 = x.
Now, fog(7) = 7

QUESTION 2 (ii).Find the number of all onto functions ffrom


rom the set {1, 2, 3, ... , 10} to itself.
itsel
SOLUTION:.Here , A = { 1,2,3,....,10}
For f to be an onto function , Range of f = A
The number of ways in which n elements can be arranged taken , n at a time = n Pn = n !

The number of ways in which 10 elements can be arranged taken , 10 at a time = 10 P10 = 10!
1

QUESTION 3Show that the Relation R in the set A = { x Z : 0 x 12} is an equivalence


relation. Where the relation R is given by
{( a, b ) : a b is a multiple of 4 } .

SOLUTION: The set A = [ x 2 : 0 x 12] = [ 0,1, 2,......12]


Here, R = {( a, b ) : a b s a multiple of 4 }

a b = 4k or b = a + 4k
(1,5 ) , (1,9 )( 2, 6 )( 2,10 ) , ( 3, 7 )( 3,11)( 4,8 )( 4,12 )( 5,9 )( 6,10 )( 7,11)( 8,12 ) ,
R=

( 0, 0 ) , (1,1) , ( 2, 2 ) , ( 4, 4 ) ,................... (12,12 )

Contact for Online Tutoring at TutorBreeze.com

TutorBreeze.com
A relation R is an equivalence relation if it is ,
1. reflexive,
2.symmetric and
3.transitive.

(a) a a = 0 = 4k R is reflexive
(b) If a b = 4k then b a = 4k

a c = a b + b c R is symmetric
(c) When ( a c ) and ( b c ) both are multiples of 4 the ( a c ) is also multiple of 4
R is Transitive
From a, b and c : R is an equivalence relation

QUESTION 4:Prove that the Greatest Integer Function f : R R, given by f (x) =


[x], is neither one-one nor onto, where [x] denotes the greatest integer less than or
equal to x.
SOLUTION: From any integer x to the next integer (x +1), the function value
f (x) = [x] = x
i.e at infinitely many values of x , [x] = x
i.e f(x) is a many one and not a one-one function.
The function[x] = x where x is an integer only and not any real number
Rf = Z, Z being the set of integers.
f(x) is an into function rather than an onto function as R R.
QUESTION 5:
Show that the Signum Function f : R R, given by

is neither one-one nor onto.


SOLUTION
f(x) =1 , when, xR and x>0
just like f(x) =-1 , when, xR and x<0
i.e for infinitely many values of x , f(x) takes the same value
i.e f(x) is a many one and not a one-one function
The function only takes the values : -1, 0 , 1
Rf = {-1,0,1}
f(x) is an into function rather than an onto function as R R.

Contact for Online Tutoring at TutorBreeze.com

TutorBreeze.com

QUESTION 6:
Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function
from A to B. Show that f is one-one.
SOLUTION
f = {(1, 4), (2, 5), (3, 6)}f(1) = 4, f(2) = 5, f(3) = 6
i.e points of the domain give rise to a different point in the co-domain
In other words , the second entry of no ordered pair is repeated .
f is a one-one function.
QUESTION 7:
Let A = R {3} and B = R {1}. Consider the function f : AB defined by
x2
f ( x) =
x3
Is f one-one and onto? Justify your answer.
SOLUTION

Contact for Online Tutoring at TutorBreeze.com

TutorBreeze.com
x2
; x A = R {3}
x3
Let x = x1andx2 ; x1 , x2 A = R {3}

(i ) f ( x) =

andf ( x1 ) = f ( x)

x1 2 x2 2
=
x1 3 x2 3

( x1 2 )( x2 3) = ( x2 2 )( x1 3)
x1 x2 3 x1 2 x2 + 6 = x1 x2 2 x1 3 x2 + 6
3 x1 2 x2 = 2 x1 3 x2
x1 = x2
=> f is a one-one function.
(ii)Let y= f ( x) =

x2
; y B = R {1}
x 3

x2
x3
xy 3 y = x 2
y=

xy x = 3 y 2
x( y 1) = 3 y 2
x=

3y 2
( y 1)

3y 2
( y 1)
3 y 3 + 1 3( y 1) + 1
1
=
= 3+
as
( y 1)
( y 1)
( y 1)
3 + a Real number 3
Now note that , we may write

3y 2
3
( y 1)
3y 2

A
( y 1)
Thus, to each y B , there corresponds an x A

Thus , f is an onto function

Contact for Online Tutoring at TutorBreeze.com

TutorBreeze.com
QUESTION 8:
Let f, g and h be functions from R to R. Show that
(f + g)oh = foh + goh
(f . g)oh = (foh) . (goh)
SOLUTION
Here x R
(i)
(f + g)oh =(f + g)[h (x)]= f[h (x)] + g[h (x)]= foh(x) + goh(x)= foh + goh
(f + g)oh = foh + goh
(ii)(f . g)oh =(f . g) [h (x)] =(f[h (x)] . g[h (x)]) =(foh(x)) . (goh(x))= (foh) . (goh)
QUESTION 9:
State with reason whether following functions have inverse
(i) f : {1, 2, 3, 4} {10} with
f = {(1, 10), (2, 10), (3, 10), (4, 10)}
(ii) g : {5, 6, 7, 8} {1, 2, 3, 4} with
g = {(5, 4), (6, 3), (7, 4), (8, 2)}
(iii) h : {2, 3, 4, 5} {7, 9, 11, 13} with
h = {(2, 7), (3, 9), (4, 11), (5, 13)}
SOLUTION
(i) f = {(1, 10), (2, 10), (3, 10), (4, 10)}
f(1) =10 , f(2) = 10 ,f(3) =10 , f(4) = 10
For more than one value x there is the same image in the range.
f is a not a one-one function.
Even though the function is onto , it is not invertible
(ii) g = {(5, 4), (6, 3), (7, 4), (8, 2)}
g(5) = 4 and g(7) = 4
For more than one value x there is the same image in the range.
f is a not a one-one function.
R={2,3,4}{1, 2, 3, 4}
f is not an onto function
f is neither one-one nor onto
function does not have an inverse
(iii) h = {(2, 7), (3, 9), (4, 11), (5, 13)}
h(2) = 7 , h(3) =9 , h(4) =11, h(5) = 13
Different points in the domain have different images in the range
Also, range ={7, 9, 11, 13}= codomain
f is an onto function
f is both one-one and onto
function has an inverse

Contact for Online Tutoring at TutorBreeze.com

TutorBreeze.com

QUESTION 10:
Show that f : [1, 1] R, given by f (x) =

x
is one-one. Find the inverse
x+2

of the function f : [1, 1] Range f.


SOLUTION
x
x+2
Let x1 and x 2 [-1, 1] , such that f (x1 ) = f (x 2 )

(i)f : [-1, 1] R, given by f (x) =

x1
x2
=
x1 +2
x 2 +2

x1 ( x 2 +2 ) = x 2 ( x1 +2 )
x1x 2 + 2x1 = x1x 2 + 2x 2
2x1 = 2x 2
x1 = x 2
f (x) is a one-one function.
(ii)Range of f (x)
x
x+2
y ( x + 2) = x
let y =

xy + 2 y = x
xy x = 2 y

f (x) = x( y 1) = 2 y
2y
x=
y 1
Obviously, y 1
Range f = R {1}

Contact for Online Tutoring at TutorBreeze.com

TutorBreeze.com

QUESTION 11:
Consider f : R+ [4, ) given by f (x) = x2 + 4. Show that f is invertible with the
inverse f 1 of f given by f 1(y) =( y 4) , where R+ is the set of all non-negative
real numbers.
SOLUTION
f (x) = x2 + 4
Let x1 , x2 R+, such that f (x1) =f(x2)
x12 + 4= x22 + 4
x12 = x22
But, x1 , x2 R+
x1 = x2
f is a one-one function.
Now let y [4, )and
y = x2 + 4
x=( y 4)
y [4, ) and x>0, ie x R+
f is an onto function
f is both one-one and onto
function has an inverse
Its inverse can be obtained as follows
y = x2 + 4
x2 = y -4
x=( y 4)
. QUESTION 12: Let A = Q x Q , Q being the set of rationals . Let * be a binary operation on
A , defined by (a, b) * (c , d) = ( ac , ad + b) . Show that
(i) * is not commutative
(ii) * is associative
(iii The Identity element w.r.t * is ( 1 , 0)

SOLUTION:
(i)

(a, b) * (c , d) = ( ac , ad + b)
(c , d) *(a, b) = ( ca , c b + d) , ( ac , ad + b) ( ca , c b + d)

So, * is not commutative


(ii)

[1 Mark]

Let (a,b ) ( c, d ) , ( e, f ) A, Then


(( a, b )* (c, d)) ( e*f) = (ac , ad + b) * (e,f) = ( (ac) e , (ac) f + (ad+b))
= ( ace , acf +ad +b)
(a,b) ((c,d)* (e,f)) = (a,b) * ( ce , cf +d) = ( a (ce) , a ( cf+d) +b) = ( ace , acf +ad +b)
Contact for Online Tutoring at TutorBreeze.com

TutorBreeze.com
(( a, b )* (c, d)) ( e*f) = (a,b) ((c,d)* (e,f))
(iii)

[1 Mark]

Let ( x , y) A. Then ( x , y) is an identity element, if and only if


(x, y ) * (a, b) = (a , b) = (a,b) * (x, y ), for every (a,b) A
(x, y ) * (a, b) = ( xa , xb + y)
(a,b) * (x, y )= ( ax, ay +b )
( xa , xb + y) = (a, b) = ( ax, ay +b )
[1 Mark]
ax = x a = a x = 1
bx + y = b = ay +b b + y = b = ay +b y = 0 = ay y = 0
Therefore , ( 1, 0) is the identity element
[1 Mark]

QUESTION 13:Let '*'be a binary operation on the set { 0,1,2,3,4,5} and


a+b if
a*b =
a+b-6 if

a+b<6
a+b 6

SOLUTION:
*
0
1
2
3
4
5

0
0
1
2
3
4
5

1
1
2
3
4
5
0

2
2
3
4
5
0
1

3
3
4
5
0
1
2

4
4
5
0
1
2
3

5
5
0
1
2
3
4

From the table , the second row and second column are the same as the original set .
0*0 = 0 , 1*) = 0*1 = 1 , 2*0= 0*2 = 2 , 3*0= 0*3 = 3 , 4*0 = 0*4 =4, 0*5 = 5*0 = 5
0is the identity element of the operation *
Now, the element 0 appears in the cell 1*5 = 5*1 =0, 2*4 = 4 *2= 0, 3*3 =0, 0* 0 = 0
Inverse element of 0 is 0, Inverse element of 1 is 5, Inverse element of 2 is 4, Inverse
element of 3 is 3, Inverse element of 4 is 2, Inverse element of 5 is 1.

QUESTION 14

A relation R on the set of complex numbers is defined by

z1 Rz2 =
Show that R is an equivalence relation.

SOLUTION:

Contact for Online Tutoring at TutorBreeze.com

z1 z2
z1 + z2

TutorBreeze.com
z1 Rz2 =

z1 z2
isreal
z1 + z2

(i ) R is reflexive : z1 Rz2 =

z1 z2
z z
R z1 Rz1 = 1 1 = 0, 0 R
z1 + z2
z1 + z1

(ii ) R is symmetric: z1 Rz2 =

z1 z2
z z
R, 2 1 R z2 R z1 R
z1 + z2
z2 + z1

(iii ) R is transitive: Let z1 = a1 + ib1 , z2 = a2 + ib2 , z 3 = a3 + ib3 C ,


such that
z1 Rz2 =

z z
z1 z2
Rand z2 Rz3 = 2 3 R
z1 + z2
z 2 + z3

z1 Rz2 =

z1 z2
R
z1 + z2

( a1 + ib1 ) ( a2 + ib2 ) R ( a1 a2 ) + i ( b1 b2 ) R
( a1 + ib1 ) + ( a2 + ib2 )
( a1 + a2 ) + i ( b1 + b2 )
( a a ) + i ( b1 b2 ) ( a1 + a2 ) + i ( b1 + b2 )
1 2

R
+
+
+
+
+
+
a
a
i
b
b
a
a
i
b
b
(
)
(
)
(
)
(
)
1
2
1
2
1
2
1 2
The imaginary part = ( a1 a2 ) ( b1 + b2 ) + ( b1 b2 ) ( a1 + a2 ) = 0
2 [ a1b2 a2b1 ] = 0 [ a1b2 a2b1 ] a1b2 = a2b1...(i )

Similary, z2 Rz3 =

z 2 z3
R a2b3 = a3b2 ....(ii )
z 2 + z3

Multiplying , (i )and (ii ),


a1b2 a2b3 = a2b1a3b2
CaseI : When b2 a2 0
a1b2 a2b3 = a2b1a3b2 a1b3 = b1a3 z2 R
CaseII : When b2 a2 = 0 z2 = 0 R
R is transitive
The given relation R is (i) Reflexive (ii) Symmetric (iii)Transitive
The given relation R is an Equivalence relation

Contact for Online Tutoring at TutorBreeze.com

TutorBreeze.com
QUESTION 15:f: R R Is the function f(x) = 9x 3 injective?
SOLUTION:To check whether the function is injective.i.e1-1,
we need to check whether f(x1 ) = f(x 2 ) x1 =x 2
Here , f(x1 ) = f(x 2 ) 9x13 =9x 23 9 ( x13 - x 23 ) = 0 x13 - x 2 3 = 0
( x1 -x 2 ) ( x12 +x 2 2 + x1x 2 ) = 0
x1 =x 2
the function is injective

10

Contact for Online Tutoring at TutorBreeze.com

You might also like