0% found this document useful (0 votes)
35 views

Anil.S.C Jnnce, Shivamogga

Uploaded by

Dhanyashree B
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 (0 votes)
35 views

Anil.S.C Jnnce, Shivamogga

Uploaded by

Dhanyashree B
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/ 19

ANIL.S.

C
JNNCE, SHIVAMOGGA

𝐑𝐄𝐋𝐀𝐓𝐈𝐎𝐍𝐒 𝐀𝐍𝐃 𝐅𝐔𝐍𝐂𝐓𝐈𝐎𝐍𝐒

𝐂𝐚𝐫𝐭𝐞𝐬𝐢𝐚𝐧 𝐩𝐫𝐨𝐝𝐮𝐜𝐭 𝐨𝐟 𝐬𝐞𝐭𝐬:


Let A and B be two sets, then the set of all ordered pairs (a, b) where a ∈ A, b ∈ B is

called cartesian product or cross product of A and B.

A × B = {(a, b): a ∈ A, b ∈ B}

 A × B is not same as B × A
 B × A = {(b, a): b ∈ B, a ∈ A}

𝐏𝐫𝐨𝐛𝐥𝐞𝐦𝐬:

1) Let A = {1,3,5}, B = {2,3}and C = {4,6}. Write down the following


a) A × B b) B × A c) B × C d) A × C e) (A ∪ B) × C f) A ∪ (B × C)
g)(A × B) ∪ C h) A ∩ (B × C) i) (A × B) ∪ (B × C) j) (A × B) ∩ (B × A)
k) (A × B) ∩ (B × C)

Solution: A × B = {(1,2)(1,3)(3,2)(3,3)(5,2)(5,3)}

B × A = {(2,1)(2,3)(2,5)(3,1)(3,3)(3,5)}

B × C = {(2,4)(2,6)(3,4)(3,6)}

A × C = {(1,4)(1,6)(3,4)(3,6)(5,4)(5,6)}

(A ∪ B) × C = {1,2,3,5} × {4,6} = {(1,4)(1,6)(2,4)(2,6)(3,4)(3,6)(5,4)(5,6)}

A ∪ (B × C) = {1,3,5} ∪ {(2,4)(2,6)(3,4)(3,6)} = {1,3,5, (2,4)(2,6)(3,4)(3,6)}

(A × B) ∪ C = {(1,2)(1,3)(3,2)(3,3)(5,2)(5,3), 4,6}

A ∩ (B × C) = ∅

(A × B) ∪ (B × C) = {(1,2)(1,3)(3,2)(3,3)(5,2)(5,3)(2,4)(2,6)(3,4)(3,6)}

(A × B) ∩ (B × A) = {(3,3)}

(A × B) ∩ (B × C) = ∅
ANIL.S.C
JNNCE, SHIVAMOGGA

2) Let A = {1,2,3,4}, B = {3,4,5,6}, C = {2,4,6}. Find A × B, B × A, A × (B ∪ C)


(A ∩ B) × C, (A × B) ∩ (B × C) , (A × B) − (B × C)

Solution:

A×B
= {(1,3(1,4)(1,5)(1,6)(2,3)(2,4)(2,5)(2,6)(3,3)(3,4)(3,5)(3,6)(4,3)(4,4)(4,5)(4,6)}

B×A
= {(3,1)(3,2)(3,3)(3,4)(4,1)(4,2)(4,3)(4,4)(5,1)(5,2)(5,3)(5,4)(6,1)(6,2)(6,3)(6,4)}

A × (B ∪ C) = {1,2,3,4} × {2,3,4,5,6}
= {(1,2)(1,3)(1,4)(1,5)1,6)(2,2)(2,3)(2,4)(2,5)(2,6)(3,2)(3,3)(3,4)
(3,5)(3,6)(4,2)(4,3)(4,4)(4,5)(4,6)}

(A ∩ B) × C = {3,4} × {2,4,6} = {(3,2)(3,4)(3,6)(4,2)(4,4)(4,6)}

B × C = {(3,2)(3,4)(3,6)(4,2)(4,4)(4,6)(5,2)(5,4)(5,6)(6,2)(6,4)(6,6)}

(A × B) ∩ (B × C) = {(3,4)(3,6)(4,4)(4,6)}

(A × B) − (B × C) = {Set of all elements of A × B which are not in B × C}


= {(1,3)(1,4)(1,5)(1,6)(2,3)(2,4)(2,5)(2,6)(3,3)(3,5)(4,3)(4,5)}

3) Suppose A, B, C ⊆ Z × Z with A = {(x, y): y = 5x − 1} , B = {(x, y): y = 6x}


C = {(x, y): 3x − y = −7}. Find A ∩ B, B ∩ C, ̅̅̅̅̅̅̅
̅ ∪ C̅ , B
A ̅ ∪ C̅

Solution:
Let (x, y) ∈ A ∩ B
 (x, y) ∈ A and (x, y) ∈ B
 y = 5x − 1 and y = 6x
 5x − 1 = 6x
 x = −1 and y = −6
 A ∩ B = {(−1, −6)}

Let (x, y) ∈ B ∩ C
 (x, y) ∈ B and (x, y) ∈ C
 y = 6x and 3x − y = −7
 6x = 3x + 7
7
 x = 3 , not possible because x ∈ Z
 B∩C=∅
ANIL.S.C
JNNCE, SHIVAMOGGA

A A ∩ C and ̅̅̅̅̅̅̅
̅ ∪ C̅ = ̅̅̅̅̅̅̅ ̅ ∪ C̅ = ̿̿̿̿̿̿̿
A A∩C=A∩C
Let (x, y) ∈ A ∩ C
 (x, y) ∈ A and (x, y) ∈ C
 y = 5x − 1 and 3x − y = −7
 5x − 1 = 3x + 7
 x = 4 and y = 19
 ̅̅̅̅̅̅̅
̅ ∪ C̅ = A ∩ C = {(4,19)}
A

̅ ∪ C̅ = ̅̅̅̅̅̅̅
B B ∩ C but B ∩ C = ∅

̅ ∪ C̅ = ̅̅̅̅̅̅̅
 B B ∩ C = Z × Z, Universal set.

4) For any non empty sets A, B, C prove the following:

a) A × (B ∪ C) = (A × B)U(A × C) (JAN 2020)

Let (x, y) ∈ A × (B ∪ C) ⇔ x ∈ A and y ∈ (B ∪ C)


⇔ x ∈ A and y ∈ B or y ∈ C
⇔ x ∈ A and y ∈ B or x ∈ A and y ∈ C
⇔ (x, y) ∈ A × B or (x, y) ∈ (A × C)
⇔ (x, y) ∈ (A × B)U(A × C)
 A × (B ∪ C) = (A × B)U(A × C)

b) A × (B − C) = (A × B) − (A × C) (JAN 2020)

Let (x, y) ∈ A × (B − C) ⇔ x ∈ A and y ∈ (B − C)


⇔ x ∈ A and[ y ∈ B and y ∉ C]
⇔ x ∈ A and y ∈ B and x ∈ A and y ∉ C
⇔ (x, y) ∈ A × B and (x, y) ∉ (A × C)
⇔ (x, y) ∈ (A × B) − (A × C)
 A × (B − C) = (A × B) − (A × C)

c) (A ∪ B) × C = (A × C) ∪ (B × C) (JAN 2021)

Let (x, y) ∈ (A ∪ B) × C ⇔ x ∈ A ∪ B and y ∈ C


⇔ [x ∈ A or x ∈ B] and y ∈ C]
⇔ x ∈ A and y ∈ C or x ∈ B and y ∈ C
⇔ (x, y) ∈ A × C or (x, y) ∈ (B × C)
⇔ (x, y) ∈ (A × C) ∪ (B × C)
 (A ∪ B) × C = (A × C) ∪ (B × C)
ANIL.S.C
JNNCE, SHIVAMOGGA

d) A × (B ∩ C) = (A × B) ∩ (A × C) (JAN 2021)

Let (x, y) ∈ A × (B ∩ C) ⇔ x ∈ A and y ∈ (B ∩ C)


⇔ x ∈ A and [y ∈ B and y ∈ C]
⇔ x ∈ A and y ∈ B and x ∈ A and y ∈ C
⇔ (x, y) ∈ A × B and (x, y) ∈ (A × C)
⇔ (x, y) ∈ (A × B) ∩ (A × C)
 A × (B ∩ C) = (A × B) ∩ (A × C)

e) (A ∩ B) × C = (A × C) ∩ (B × C)

Let (x, y) ∈ (A ∩ B) × C ⇔ x ∈ A ∩ B and y ∈ C


⇔ [x ∈ A and x ∈ B] and y ∈ C]
⇔ x ∈ A and y ∈ C and x ∈ B and y ∈ C
⇔ (x, y) ∈ A × C and (x, y) ∈ (B × C)
⇔ (x, y) ∈ (A × C) ∩ (B × C)
 (A ∩ B) × C = (A × B) ∩ (B × C)

𝐑𝐄𝐋𝐀𝐓𝐈𝐎𝐍𝐒
Let A and B be two sets then A × B is a relation from A to B.

If |A| = m and |B| = n then A × B has 2mn relations from A to B and |A × B| = mn

Problems:

1) Let A and B be finite sets with |B| = 3. If there are 4096 relations from A to B,
then what is|A|?

Let |A| = m and |B| = n = 3

2mn = 4096

=> 23m = 4096

=> 3m × log e 2 = log e 4096

loge 4096
=> m = =4
3loge 2
ANIL.S.C
JNNCE, SHIVAMOGGA

Functions
A function f from a non empty set A to a non empty set B is a relation from A to B
such that for each a ∈ A there is a unique b ∈ B and (a, b) ∈ f ie b = f(a).
Here b is called image and a is called preimage of b.

* Every function is a relation, every relation need not be a function.


* A is called domain and B is called codomain.
* The range of f: A → B is given by f(A) = {f(x): x ∈ A}
* If there are m elements in A and n elements in B the f: A → B has nm
elements.

1) Let A = {1,2,3}, B = {−1,0} and R is a relation from A to B defined by


R = {(1, −1)(1,0)(2, −1)(3,0)}. Is R a relation from A to B

Here 1 is related to − 1 and 0, two different elements hence R is not a function

2) Let A = {1,2,3}, B = {−1,0} and S be a relation from A to B defined by


R = {(1, −1)(2, −1)(3,0). Is R a function?

Each element of A is related to a unique element of B, R is a function from A to B

3) Let A = {1,2,3,4}, determine whether or not the following relations on A are


functions?
a) f = {(2,3)(1,4)(2,1)(3,2)(4,4)}
b) g = {(3,1)(4,2)(1,1)}
c) h = {(2,1)(3,4)(1,4)(2,1)(4,4)}
a) Here 2 is related to two different elements, f is not a function.

b) Here 2 is not related to any element of A, g is not a function.

c) Every element of A is related to a unique element of A, h is a function from A to A

4) Let {1,2,3,4,5,6}, B = {6,7,8,9,10}, if a function f: A → B is defined by (JAN 2021)


f = {(1,7)(2,7)(3,8)(4,6)(5,9)(6,9)}
−1 (6), −1 (9).
Determine f f
If B1 = {7,8}, B2 = {8,9,10} find f −1 (B1 ), f −1 (B2 )

f −1 (6) = {x ∈ A: f(x) = 6} = {4}, f −1 (9) = {x ∈ A: f(x) = 9} = {5,6}


f −1 (B1 ) = {x ∈ A: f(x) ∈ B1 } = {1,2,3}
f −1 (B2 ) = {x ∈ A: f(x) ∈ B2 } = {3,5,6}
ANIL.S.C
JNNCE, SHIVAMOGGA

3x − 5, x > 0
5) Let f: R → R be defined by f(x) = {
−3x + 1, x ≤ 0
(JAN 2020, APR 2022, AUG 2021)
5 5
a) Determine f(0), f(−1), f (3) , f (− 3)

b) Find f −1 (0), f −1 (1), f −1 (−1), f −1 (3), f −1 (−3), f −1 (−6)

c) What are f −1 ([−5,5]) and f −1 ([−6,5])

5 5
a) f(0) = 1, f(−1) = 4 , f (3) = 0, f (− 3) = 6

5
b) f −1 (0) = {x ∈ R: f(x) = 0} = {3}

f −1 (1) = {x ∈ R: f(x) = 1} = {2,0}

4
f −1 (−1) = {x ∈ R: f(x) = −1} = { }
3

8 2
f −1 (3) = {x ∈ R: f(x) = 3} = { , − }
3 3

2
f −1 (−3) = {x ∈ R: f(x) = −3} = { }
3

f −1 (−6) = {x ∈ R: f(x) = −6} = ∅

c) f −1 ([−5,5]) = {x ∈ R: f(x) ∈ [−5,5]} = {x ∈ R: −5 ≤ f(x) ≤ 5}

If x > 0, −5 ≤ 3x − 5 ≤ 5
or 0 ≤ 3x ≤ 10
10
or 0≤x≤
3

If x ≤ 0, −5 ≤ −3x + 1 ≤ 5
or − 6 ≤ −3x ≤ 4
4
or − 2 ≤ −x ≤
3
4
or −3≤x≤2
4 10
f −1 ([−5,5]) = {x ∈ R: [− ≤ 𝑥 ≤ 2 𝑜𝑟 0 ≤ 𝑥 ≤ }
3 3
ANIL.S.C
JNNCE, SHIVAMOGGA

4 10 4 10
= {x ∈ R: [− ≤ 𝑥 ≤ ]} = [− , ]
3 3 3 3

f −1 ([−6,5]) = {x ∈ R: f(x) ∈ [−6,5]} = {x ∈ R: −6 ≤ f(x) ≤ 5}

If x > 0, −6 ≤ 3x − 5 ≤ 5
or − 1 ≤ 3x ≤ 10
1 10
or − ≤x≤
3 3

If x ≤ 0, −6 ≤ −3x + 1 ≤ 5
or − 7 ≤ −3x ≤ 4
7 4
or − ≤ −x ≤
3 3
4 7
or −3≤x≤3
4 7 1 10
f −1 ([−6,5]) = {x ∈ R: [− ≤ x ≤ or − ≤ x ≤ }
3 3 3 3

4 10 4 10
= {x ∈ R: [− ≤ x ≤ ]} = [− , ]
3 3 3 3

6) If there are 2187 functions from A to B and |B| = 3, what is |A|?

If there are m elements in A and n elements in B the f: A → B has nm elements.


 2187 = 3m
 mlog3 = log(2187)
log(2187)
 m= =7
log3
 |A| = 7

Types of functions:
1) Identitiy function: A function f: A → A such that f(a) = a, ∀a ∈ A is called identity
function.

2) Constant function: A function f: A → A such that f(a) = c ∀a ∈ A where c is a fixed


element of B, is called a constant function (All the elements of A have the same image
in B)

3) Onto function: A function f: A → B is said to be onto function if ∀ b ∈ B, ∃a ∈ A such


that f(a) = b is called onto function. Onto function is also called Surjective function.

4) One to One function: A function f: A → B is said to be one to one function if different


ANIL.S.C
JNNCE, SHIVAMOGGA

elements of A have different images in B. One to one function is also called injuctive function.

5) One to one correspondence: A function which is both one to one and onto is called a
one to one correspondence or a Bijective function or Bijection.

Properties of functions:

1) Let A and B be finite sets and f be a function from A to B, then the following are true.
a) If f is one to one then |A| ≤ |B|
b) If f is onto then |B| ≤ |A|
d) If f is a one to one correspondence, then |A| = |B|
e) If |A| > |B| then atleast two different elements of A have the same image.

2) Suppose |A| = |B| and f: A → B then f is one to one iff f is onto


3) Suppose |A| = |B| and f: A → B then f bijective iff f is one to one and onto
4) Suppose |A| = m, |B| = n and f: A → B then there are nm functions from A to B and if
n!
m ≤ n then there are one to one functions from A to B
(n − m)!
5) Suppose |A| = m, |B| = n and f: A → B then there are nm functions from A to B and if
m ≥ n then the number of onto functions from A to B is given by
n

p(n, m) = ∑(−1)k (ncn−k )(n − k)m


k=0
If m < n, there will be no onto functions from A to B

Problems:

1) Find the nature of the following functions defined on A = {1,2,3}


1) f = {(1,1)(2,2)(3,3)}
2) g = {(1,2)(2,2)(3,2)}
3) h = {(1,2)(2,2)(3,1)}
4) p = {(1,2)(2,3)(3,1)}

Solution:

1) ∀a ∈ A, (a, a) ∈ f, a = f(a) , therefore f is the identity function on A


2) ∀a ∈ A, 2 is the image. Every element of A has 2 as its image. g is a constant
function.
3) We note that 3 has no pre image under h , hence h is not onto.
Further, 1 and 2 have the same image under h, hence h is not one to one.
4) Every element of A has a unique image and every element of B has a preimage,
hence p is both one one and onto. Also a one to one correspondence.
ANIL.S.C
JNNCE, SHIVAMOGGA

2) Let A and B be finite sets, if there are 60 one to one functions from A to B and
|A| = 3, what is |B|?

n!
Here m = 3 and = 60, n is to be determined.
(n − m)!
n!
 (n−3)!
= 60

n(n−1)(n−2)×(n−3)!
 (n−3)!
= 60

 n(n − 1)(n − 2) = 60

 n=5

 |B| = 5

3) If A = {1,2,3,4,5} and there are 6720 one to one functions from A to B. What is |B|?
(AUG 2020)
n!
Here m = 5 and = 6720, n is to be determined.
(n − m)!
n!
 (n−5)!
= 6720

n(n−1)(n−2)(n−3)(n−4)×(n−5)!
 (n−5)!
= 6720

 n(n − 1)(n − 2)(n − 3)(n − 4) = 6720

 n=8

 |B| = 8

4) If A = {2,6,9}, B = {p, q, r, s, t}, find the number of one to one functions from A to B

Here m = 3, n = 5

n! 5!
Number of one to one functions from A to B = = = 5 × 4 × 3 = 60
(n − m)! 2!
ANIL.S.C
JNNCE, SHIVAMOGGA

5) If A = {1,2,3,4,5,6,7}, B = {w, x, y, z}, find the number of onto functions from A to B

Here m = 7, n = 4

p(n, m) = ∑(−1)k (ncn−k )(n − k)m


k=0

= ∑(−1)k (4c4−k )(n − k)7


k=0

= [4C4 × 47 ] + [−4C3 × 37 ] + [4C2 × 27 ] + [−4C1 × 17 ] = 8400

6) If A = {w, x, y, z}, B = {1,2,3}, find the number of onto functions from A to B (Ans: 36)

7) Let A = {a, b, c, d}and B = {1,2,3,4,5,6} (AUG 2021)


a) How many functions are there from A to B?
How many of these are one to one?
How many are onto?
b) How many functions are there from B to A?
How many of these are one to one?
How many are onto?

Here m = 4, n = 6

a) The number of functions possible from A to B is = nm = 64 = 1296

n! 6!
The number of one to one functions from A to B is = = = 360
(n − m)! 2!

There is no onto functions from A to B (n > m)

b) The number of functions possible from A to B is = mn = 46 = 4096

There is no one to one functions from B to A (m < n)

The number of onto functions from A to B is,


4

p(n, m) = ∑(−1)k (ncn−k )(n − k)m


k=0
4

= ∑(−1)k (4c4−k )(n − k)6


k=0
ANIL.S.C
JNNCE, SHIVAMOGGA

= [4C4 × 46 ] + [−4C3 × 36 ] + [4C2 × 26 ] + [−4C1 × 16 ] = 1560

There is no onto functions from A to B (n > m)

8) Let A = {1, b, c, d, e}and B = {1,2,3,4,5,6,7,8}


c) How many functions are there from A to B?
How many of these are one to one?
How many are onto?
d) How many functions are there from B to A?
How many of these are one to one?
How many are onto?

Ans: a) 85 , 160,0 b) 58 , 0,126000

9) Let f, g: Z + → Z + , ∀x ∈ Z + , f(x) = x + 1, g(x) = max(1, x − 1)


a) what is the range of f?
b) Is f 1 − 1?
c) Is f onto?
d) what is the range of g
e) Is g 1 − 1?
f) is g onto?

a) Range of f = {2,3,4 … . . } = Z + − {1}


b) f is 1 − 1
c) f is not onto
d) Range of g = {1,2,3 … . . } = Z +
e) g is not 1 − 1
f) g is onto
ANIL.S.C
JNNCE, SHIVAMOGGA

COMPOSITION OF FUNCTIONS
Let f: A → B, g: B → C be two functions then (g ∘ f)(x) = g[f(x)] for all x ∈ A

1) Let A = {1,2,3,4}, B = {a, b, c}, C = {w, x, y, z} with f: A → B, g: B → C given by


f = {(1, a)(2, a)(3, b)(4, c)}, g = {(a, x)(b, y)(c, z)}. Find (g ∘ f)

(g ∘ f)(1) = g[f(1)] = g(a) = x


(g ∘ f)(2) = g[f(2)] = g(a) = x
(g ∘ f)(3) = g[f(3)] = g(b) = y
(g ∘ f)(4) = g[f(4)] = g(c) = z

(g ∘ f) = {(1, x)(2, x)(3, y)(4, z)}

2) Consider the function f and g defined by f(x) = x 3 , g(x) = x 2 + 1, ∀x ∈ R.


Find (g ∘ f), (f ∘ g), f 2 , g 2 , Also show that that (g ∘ f) ≠ (f ∘ g)

(g ∘ f)(x) = g[f(x)] = g(x 3 ) = x 6 + 1


(f ∘ g)(x) = f[g(x)] = f(x 2 + 1) = (x 2 + 1)3
f 2 (x) = (f ∘ f)(x) = f[f(x)] = f(x 3 ) = x 9
g 2 (x) = (g ∘ g)(x) = g[g(x)] = g(x 2 + 1) = (x 2 + 1)2 + 1

3) Let f, g, h be functions from R to R defined by f(x) = x 2 , g(x) = x + 5, h(x) = √x 2 + 2.


Verify (h ∘ g ) ∘ f = h ∘ (g ∘ f) (FEB 2021)

[(h ∘ g ) ∘ f ](x) = (h ∘ g )f(x)


= (h ∘ g )x 2 = h[g(x 2 )]
= h(x 2 + 5) = √(x 2 + 5)2 + 2 = √x 4 + 10x 2 + 27

[h ∘ (g ∘ f) ](x) = h[(g ∘ f)(x)]


= h[g{f(x)}]
= h[g(x 2 )] = h(x 2 + 5) = √(x 2 + 5)2 + 2 = √x 4 + 10x 2 + 27
 (h ∘ g ) ∘ f = h ∘ (g ∘ f)

4) If f, g, h be functions from R to R defined by f(x) = x + 2, g(x) = x − 2, h(x) = 3x, find


g ∘ f , f ∘ g , f ∘ f, g ∘ g , f ∘ h, h ∘ g , h ∘ f , f ∘ g ∘ h (FEB 2022)

(g ∘ f)(x) = g[f(x)] = g(x + 2) = x + 2 − 2 = x

(f ∘ g)(x) = f[g(x)] = f(x − 2) = x − 2 + 2 = x

(f ∘ f)(x) = f[f(x)] = f(x + 2) = x + 2 + 2 = x + 4


ANIL.S.C
JNNCE, SHIVAMOGGA

(g ∘ g)(x) = g[g(x)] = g(x − 2) = x − 2 − 2 = x − 4

(f ∘ h)(x) = f[h(x)] = f(3x) = 3x + 2

(h ∘ g)(x) = h[g(x)] = h(x − 2) = 3x − 6

(h ∘ f)(x) = h[f(x)] = h(x + 2) = 3x + 6

(f ∘ h ∘ g)(x) = f[h{g(x)}] = f[h(x − 2)] = f[3x − 6] = [3x − 6 + 2] = 3x − 4

5) Let f and g be functions from R to R defined by f(x) = ax + b, g(x) = 1 − x + x 2 .


If (g ∘ f)(x) = 9x 2 − 9x + 3, determine a and b. (AUG 2022)

9x 2 − 9x + 3 = (g ∘ f)(x)

= g[f(x)]

= g[ax + b] = 1 − (ax + b) + (ax + b)2

= a2 x 2 + (2ab − a)x + (1 − b + b2 )
 a2 = 9 hence a = ±3, 2ab − a = x

Case i) when a = 3, b = −1
Case ii) when a = −3, b = 2

6) If f, g, h be functions from Z to Z defined by f(x) = x − 1, g(x) = 3x and (FEB 2022)


0, x is even
h(x) = { ,
1, x is odd

Determine (f ∘ (g ∘ h))(x) , ((f ∘ g) ∘ h)(x) and verify f ∘ (g ∘ h) = (f ∘ g) ∘ h

(f ∘ (g ∘ h))(x) = f[(g ∘ h)(x)]


−1, x is even
= f[g{h(x)}] = f[3h(x)] = 3h(x) − 1 = {
2, x is odd
((f ∘ g) ∘ h)(x) = (f ∘ g)ℎ(𝑥)
−1, x is even
= f[g{h(x)}] = f[3h(x)] = 3h(x) − 1 = {
2, x is odd
 f ∘ (g ∘ h) = (f ∘ g) ∘ h

7) Let f: A → B, g: B → C h: C → D be three functions Verify (h ∘ g ) ∘ f = h ∘ (g ∘ f)

[(h ∘ g ) ∘ f ](x) = (h ∘ g )f(x)


= (h ∘ g )(y), where y = f(x)
ANIL.S.C
JNNCE, SHIVAMOGGA

= hg(y) = h(z), where z = g(y)

[h ∘ (g ∘ f) ](x) = h[(g ∘ f)(x)]


= h[g{f(x)}]
= h[g(𝑦)] = h(z)

 (h ∘ g ) ∘ f = h ∘ (g ∘ f)

INVERTIBLE FUNCTIONS
A function f: A → B is said to be invertible if there exists a function g: B → A such that
(g ∘ f) = IA and (f ∘ g) = IB , where IA is the identity function on A and IB is identity
function on B.

1) Let A = {1,2,3,4}and f, g are functions from A to A given by


f = {(1,4)(2,1)(3,2)(4,3)}and g = {(1,2)(2,3)(3,4)(4,1)}.
Prove that f and g are inverse of each other.

(g ∘ f)(1) = g[f(1)] = g(4) = 1 = IA (1)


(g ∘ f)(2) = g[f(2)] = g(1) = 2 = IA (2)
(g ∘ f)(3) = g[f(3)] = g(2) = 3 = IA (3)
(g ∘ f)(4) = g[f(4)] = g(3) = 4 = IA (4)

(f ∘ g)(1) = f[g(1)] = f(2) = 1 = IB (1)


(f ∘ g)(2) = f[g(2)] = f(3) = 2 = IB (2)
(f ∘ g)(3) = f[g(3)] = f(4) = 3 = IB (3)
(f ∘ g)(4) = f[g(4)] = f(1) = 4 = IB (4)

∀x ∈ A, (g ∘ f)(x) = IA (x) and (f ∘ g)(x) = IB (x)


 f and g are inverse of each other

1
2) Consider the functions f: R → R defined by f(x) = 2x + 5 and g(x) = 2 (x − 5)
Prove that g is an inverse of f.

1
(g ∘ f)(x) = g[f(x)] = g(2x + 5) = 2 × [2x + 5 − 5] = x = IR (𝑥)
2
1 1
(f ∘ g)(x) = f[g(x)] = f [ (x − 5)] = 2 × (x − 5)5 = x = IR (𝑥)
2 2
 f and g are inverse of each other
ANIL.S.C
JNNCE, SHIVAMOGGA

3) If f: A → B, g: B → C are invertible functions, then (g ∘ f): A → C is an invertible


function and (g ∘ f)−1 = f −1 ∘ g −1 (AUG 2021, AUG 2022)

Proof: If f: A → B, g: B → C are invertible functions


 f and g are one to one and onto functions
 g ∘ f is one to one and onto
 g ∘ f is invertible

 f −1 : B → A and g −1 : C → B and h=f −1 ∘ g −1 : C → A

h ∘ (g ∘ f) = (f −1 ∘ g −1 ) ∘ (g ∘ f) = f −1 ∘ (g −1 ∘ g) ∘ f = f −1 ∘ IB ∘ f = f −1 ∘ f = IA

(g ∘ f) ∘ h = (g ∘ f) ∘ (f −1 ∘ g −1 ) = g ∘ (f ∘ f −1 ) ∘ g −1 = g ∘ IA ∘ g −1 = g ∘ g −1 = IC

 h is the inverse of g ∘ f
 h = (g ∘ f)−1
 (g ∘ f)−1 = f −1 ∘ g −1

Matrix of the relation: Let R be a relation from A to B, then the matrix formed by

1, (a, b) ∈ R
mij = { is called matrix of the relation or relation matrix of R. It is denoted
0, (a, b) ∉ R

by MR or M(R).

Example:

1) A = {0,1,2} and B = {p, q}, R = {(0, p)(1, q)(2, p)}

1 0
M R = (0 1)
1 0

2) A = {1,2,3,4} and R = {(1,2)(1,3)(2,4)(3,2)}

0 1 1 0
0 0 0 1
MR = ( )
0 1 0 0
0 0 0 0
ANIL.S.C
JNNCE, SHIVAMOGGA

Digraph: The pictorial representation of R is called directed graph or digraph of R

Example: A = {a, b, c, d}, R = {(a, b)(b, b)(b, d)(c, b)(c, d)(d, a)(d, c)} defined on A

 Each element of A is called a node or vertex


 An arrow from a vertex to another vertex is called an edge.
 Loop: Initial and terminal points are same
 In degree: The no of edges entering a vertex is called in degree of the vertex.
 Out degree: The no of edges leaving a vertex is called out degree of the vertex.

Problems:

1) Let A = {1,2,3,4} and let R be the relation on A defined by xRy if and only if y = 2x.
a) Write down R as a set of ordered pair.
b) Draw the digraph of R
c) Determine the in − degrees and out − degrees of the vertces in the digraph.

a) R = {(1,2)(2,4)}
b)

c)
Vertex 1 2 3 4
In-degree 0 1 0 1
Our-degree 1 1 0 0
ANIL.S.C
JNNCE, SHIVAMOGGA

2) Let A = {1,2,3,4} and let R be the relation on A defined by xRy if and only if
′x divides y ′ , written as x/y (FEB 2021)
a) Write down R as a set of ordered pair.
b) Draw the digraph of R
c) Determine the in − degrees and out − degrees of the vertces in the digraph.

a) R = {(1,1)(1,2)(1,3)(1,4)(2,2)(2,4)(3,3)(4,4)}

b)

c)
Vertex 1 2 3 4
In-degree 1 2 2 3
Our-degree 4 2 1 1

3) Let A = {1,2,3,4,6} and let R be the relation on A defined by aRb if and only if
′a is a multiple of b′ . Represent the relation R as a matrix and draw its digraph.
(JAN 2020, FEB 2022)

R = {(1,1)(2,1)(2,2)(3,1)(3,3)(4,1)(4,2)(4,4)(6,1)(6,2)(6,3)(6,4)}

1 0 0 0 0
1 1 0 0 0
MR = 1 0 1 0 0
1 1 0 1 0
(1 1 1 0 1)
ANIL.S.C
JNNCE, SHIVAMOGGA

4) Let A = {u, v, x, y, z} and R be a relation on A whose matrix is given below.


Determine R and also draw the associated digraph.

0 1 1 0 0
1 0 1 0 0
MR = 1 1 0 0 1
1 0 0 0 1
(0 0 1 1 0)

R = {(u, v)(u, x)(v, u)(v, x)(x, u)(x, v)(x, z)(y, u)(y, z)(z, x)(z, y)}

Digrahp:

5) Find the relation represented by the digraph given below. Also write down its matrix.

A = {1,2,3,4}
R = {(1,2)(1,4)(2,2)(2,3)(4,1)(4,4)}

0 1 0 1
0 1 1 0
MR = ( )
0 0 0 0
1 0 0 1

6) For A = {a, b, c, d, e, f}, the below digraph represent a relation R on A. Determine R


as well as its associated relation matrix.

R = {(a, b)(b, e)(d, b)(d, c)(e, f)}


ANIL.S.C
JNNCE, SHIVAMOGGA

0 1 0 0 0 0
0 0 0 0 1 0
0 0 0 0 0 0
MR =
0 1 1 0 0 0
0 0 0 0 0 1
(0 0 0 0 0 0)

You might also like