7 Sep-2009 Rajiv Gandhi Institute of Technology, Versova, Andheri (W) Class/Sem: S.

E-III Subject: Discrete Structure Tutorial No: 6 FUNCTION Q: 1 Define Function. Explain with proper example. Q:2 Let A={a,b,c} B={1,2,3,4} and Let f={(a,1),(a,2),(b,3),(c,4)} g={(a,1),(c,3)} h={(a,1),(b,1),(c,3)} Draw the pictorial representations of these relations. Q: 3 what are the different types of functions. Q 4 Define Invertible functions with proper example. Q:5 Consider the function f={(-1,1),(1,1),(-2,4),(2,6)} what is f -1. Q: 6 Let f(x) =3x+1 and g(x) =x-1/3 where f:RR and g:RR.Prove that g=f -1. Q: 7 consider the function from x= {1, 2, 3} to Y= {a, b, c, d} defined by f (1) =a, f (2) =c, f (3) =b what is f -1 Q: 8 If f: RR where f(x) =x3 h: RR where h(x) =7x-2 g: RR where g(x)=4x2 +1 Find (hog) of go (hof).

Q: 9 let f(x) =2x+3, g(x) =3x+4, h(x) =4x for x R, Where r=set of real numbers find gof, fog, foh, hof, goh Q: 10 let A=B=C=R and let f:AB and g:BC be defined by f(a)=a-1,g(b)=b2, find 1](fog)(2) 2] gof(x) 3]fof(y) 4]gof(2) 5]gog(y) Q:11 If f is the mod-12 function compute each of the following(Dec2007) 1] f (1259+743) 2] f(1259)+f(743) 3] f (2.319) 4]2.f (319) Q: 12 Let f: AB be a function with finite domain and infinite range. Suppose further |Dom f|=n and |range f|=m prove that that 1] If f is one-to-one then m=n
1

2] If f is not one-to-one then m<n. 7 Sep-2009 Rajiv Gandhi Institute of Technology, Versova, Andheri (W) Class/Sem: S.E-III Subject: Discrete Structure Tutorial No: 6 FUNCTION Q: 1 Define Function explain with proper example. Defination1: Let A and B be non-empty sets. A relation from A to B such that to every element a of A there corresponds a unique element b of B is called a function f from A to B. Defination2: Let A and B be two non-empty sets. A function from A to B is a rule that assigns each element of A to a unique element of B. e.g. Let A= {1,2,3,4};B={a,b,c,d} and let f={(1,a),(2,b),(3,b),(4,d)} Here we have f(1)=a, f(2)=b, f(3)=b, f(4)=d. is a function.
1 2 3 4 f a b c d

Q:2 Let A={a,b,c} B={1,2,3,4} and Let f={(a,1),(a,2),(b,3),(c,4)} g={(a,1),(c,3)} h={(a,1),(b,1),(c,3)} Sol: The pictorial representations of these relations are as follows.

f a b c 1 2 3 4 a b c

g 1 2 3 4 a b c

h 1 2 3 4

f is not a function because there are two elements 1 and 2 in B which corresponds to the same element a of A. g is not a function because the element b of A is not associated with any element of B. h is function from A to B. Remark: In a function there cannot be any elements in A from which two arrows go and also there be any element in A from A which no arrow goes. Q: 3 what are the different types of functions. Sol: 1] Onto or Surjective 2] One-to-one or Injective 3] One-to-one and onto or bijective 1] Onto or Surjective Definition 1: A function f: AB is called onto or surjective if every element of b B is an image of at least one element a of A.f=B A function which is not onto is called into. Ex:1 If A={a,b,c,d} and B={x,y,z} and if f={(a,x),(b,y),(c,y),(d,z)}

a b c d

x y z

Then f is onto or surjective or surjection because every element x,y,z of B is an image of at least one element (per-image) of A

Ex:2 f: XY where X is the set of all integers and Y={0,1} and the rule is f(x)=0 if x is even and f(x)=1 if x is odd.
1 2 3 4 1 f 0 This is an ONTO Function

2] One-to-one or Injective A function f is said to be One-to-one or Injective if two distinct element of A corresponding to two distinct element of B In other word, a function f: X Y is one to one if x1x2 implies f(x1)f(x2) or f(x1)=f(x2) implies x1=x2.
4

Ex:1 Let A={a,b,c} and B={1,2,3} and let f1={(a,1),(b,3),(c,2)} Ex:2 Let C={x,y,z,u} and f2={(a,x),(b,z),(c,u)}
f1 a 2 b 3 c c u F2 is one to one but not onto b 1 a f2 x y z F1 is one to one and onto

3] One-to-one and onto or bijective: If f: AB is both one-to-one and onto then f is called bijective.such a function is also called one-to-one correspondence between A and B. In other word if f is a bijection then every element of B has a unique preimage in A. If A and B are finite set and if f is defined from A to B, it is clear that if f is bijective (one to one and onto) then A and B must have equal number of element. Q: 4 Define Invertible functions with proper example. Let f: XY suppose g is a function g: YX such that (gof) =x for every x

X and (fog)y=y for every y Y.Then g is called the inverse of f and is

denoted by f -1.thus g=f -1 and dom(f)=codom(f -1) and codom(f)=dom f -1 Ex: Consider the function f and g as given below. f(a)=1, f(b)=2 f(c)=3 f(d)=4 g(1)=a g(2)=b g(3)=c g(4)=d show that g is f -1 Sol:

f 1 a 2 b 3 c 4 d X Y d c b a

:
g 1 2 3 4

Now (gof)(a)=g(f(a))=g(1)=a; (gof)(b)=g(f(b))=g(2)=b; (gof)(c)=g(f(c))=g(3)=c; (gof)(d)=g(f(d))=g(4)=d; (gof)(x)=x for every x X similarly (fog) (y) =y for every y Y Hence g=f -1.
Note that f is one to one and onto. This is the condition for f to have an inverse
Q:5 Consider the function f={(-1,1),(1,1),(-2,4),(2,6)} what is f -1. 1 1

1 4

1
2

4 6

1
2

2 6

2 X Y X Y

The second diagram is obtained by reversing the arrows. In the second diagram we see that 1 is associated with two elements -1 and 1.Hence f -1. does not exist. This happen because f is not one to one. Q: 6 Let f(x) =3x+1 and g(x) =x-1/3 where f:RR and g:RR.Prove that g=f -1. sol: we have (gof)(x)=g(f(x))=g(3x+1)=3x+1-1/3=x (fog)(x)=f (g(x)) =f[x-1/3] =3(x-1)/3 + 1=x Hence (gof)(x)=(fog)(x) g=f -1.

Q: 7 consider the function from x= {1, 2, 3} to Y= {a, b, c, d} defined by f (1) =a, f (2) =c, f (3) =b what is f -1
f a 1 b 2 3 A c d B 1 2 3 a b c d B The second dia is obtained by reversing the arrows. In the second dia we see that d is not associated with any element with any element. Hence f -1 does not exist. This happens because f is not onto

Q: 8 If f: RR where f(x) =x3 g: RR where g(x)=4x2 +1 h: RR where h(x) =7x-2 Find (hog) of go (hof). Sol: since h(x) =7x-2 and f(x) = x3 hof=h(x3) =7 x3-2 go (hof) =g(7 x3-2) =4(7 x3-2)2+1 =4[49x6-28x3+4] =1 =196x6-112x3+17. But hog=h[4x2+1]=7[4x2+1]-2=28x2+5 (hog) og go (hof) = (hog)[ 196x6-112x3+17] =28[196x6-112x3+17]2+5. Q: 9 let f(x) =2x+3, g(x) =3x+4, h(x) =4x for x R, Where r=set of real numbers find gof, fog, foh, hof, goh Sol: gof(x) = g (f(x) = g (2x+3) = 3(2x+3) +4 = 6x+13 fog(x) = f(g(x)) = f(3x+4) =2(3x+4)+3 =6x+11 foh(x) = f(h(x)) = f(4x) =2(4x)+3 =8x+3 hof(x) = h(2x+3) = 4(2x+3) = 8x+12 goh(x)= g(4x) = 3(4x)+4 =12x+4
7

Q: 10 let A=B=C=R and let f:AB and g:BC be defined by f(a)=a-1,g(b)=b2, find 1](fog)(2) 2] gof(x) 3]fof(y) 4]gof(2) 5]gog(y) 2 Sol: Given f(a)=a-1 and g(b)= b 1] fog(2) =f(g(2))=f(4) =4-1 =3 2] fog(x) =g(f(x))=g(x-1)=(x-1)2 3] fof(y) =f (f(y)=f(y-1)=(y-1)-1=y-2 4] gof(2)=g(f(2))=g(2-1)=g(1)=1 5] gog(y) =g(g(g(y))=g(y2)=y4 Q: 11 If f is the mod-12 function compute each of the following (Dec2007) 1] f (1259+743) 2] f(1259)+f(743) 3] f (2.319) 4]2.f (319) sol: 1]f (1259+743) = f(2002) = 2002%12 =10 2] f(1259)+f(743)=1259%12+743%12=11+11=22 3] f (2.319)=2.319%12=2 4]2.f (319) =2x319%12=2x7=14 Q: 12 Let f: AB be a function with finite domain and infinite range. Suppose further |Dom f|=n and |range f|=m prove that that 1] If f is one-to-one then m=n 2] If f is not one-to-one then m<n. Sol : A function f from A to b is one to one if no two element of A have the same image in B.In other words for every x in A there is distinct and unique y in B.Hence,the number of element in A is equal to the number of element in B. Let A={a,b,c} and B={1,2,3} and let f1={(a,1),(b,3),(c,2)}
f1 a 2 b 3 c | Dom f | = |Range f | 1 F1 is one to one and onto

2] By definition again if f is not one to one more than one element in A correspond to the same element in B.
8

e.g. Let A= {1,2,3,4};B={a,b,c,d} and let f={(1,a),(2,b),(3,b),(4,d)} Here we have f(1)=a, f(2)=b, f(3)=b, f(4)=d. is a function.
1 2 3 4 f

a b c d m<n