SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

VADAPALANI CAMPUS, CHENNAI – 600 026

Department of Mathematics
Title: -DISCRETE MATHEMATICS FOR ENGINEERS

Unit -I - SET THEORY

- Set and examples

- Operations on sets
- Laws of set theory
- Partition of a set
- Cartesian product of sets
- Relations, Equivalence relation and partial order relation
- Poset
- Hasse diagram
- Closures of relations
- Warshalls algorithm
- Functions
- Composition of functions
- Inverse of a function, composition

SET

Definition:
-A set is an unordered collection of different elements.
-That is a collection of distinct and well defined objects is called set.
-These objects are called elements or members.
-sets are usually denoted by capital letters A,B,C,… and the elements are denoted by small
letters.
-A set can be written explicitly by listing its elements using set bracket.
-If the order of the elements is changed or any element of a set is repeated, it does not make any
changes in the set.
-If A is a set and x is a elements of the set A, we write it as xϵA.

Some Example of Sets

 A set of all positive integers

 A set of all the planets in the solar system
 A set of all the states in India
 A set of all the lowercase letters of the alphabet

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 1

Representation of a Set

Sets can be represented in two ways −

 Roster or Tabular Form

 Set Builder Notation

Roster or Tabular Form

The set is represented by listing all the elements comprising it. The elements are enclosed within
braces and separated by commas.
Example 1 − Set of vowels in English alphabet, A={a,e,i,o,u}
Example 2 − Set of odd numbers less than 10, B={1,3,5,7,9}

Set Builder Notation

The set is defined by specifying a property that elements of the set have in common. The set is
described as A={x:p(x)}
Example 1 − The set {a,e,i,o,u} is written as − A={x:x is a vowel in English alphabet}
Example 2 − The set {1,3,5,7,9} is written as − B={x:1≤x<10 and x≠0}
If an element x is a member of any set S, it is denoted by x∈S and if an element y is not a
member of set S, it is denoted by y∉S
Example − If S={1,1.2,1.7,2},1∈S but 1.5∉S

Some Important Sets

R − the set of all real numbers

Q − the set of all rational numbers
Z − the set of all integers = {.....,−3,−2,−1,0,1,2,3,.....}
Z+ − the set of all positive integers
W − the set of all whole numbers
N − the set of all natural numbers = {1,2,3,4,.....}

Cardinality of a Set

Cardinality of a set S, denoted by |S|, is the number of elements of the set. The number is also
referred as the cardinal number. If a set has an infinite number of elements, its cardinality is ∞.
Example − |{1,4,3,5}|=4,|{1,2,3,4,5,…}|=∞|
If there are two sets X and Y,
 |X|=|Y| denotes two sets X and Y having same cardinality. It occurs when the number of
elements in X is exactly equal to the number of elements in Y. In this case, there exists a
bijective function ‘f’ from X to Y.

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 2

  |X|≤|Y| denotes that set X’s cardinality is less than or equal to set Y’s cardinality. It occurs
when number of elements in X is less than or equal to that of Y. Here, there exists an
injective function ‘f’ from X to Y.

 |X|<|Y| denotes that set X’s cardinality is less than set Y’s cardinality. It occurs when
number of elements in X is less than that of Y. Here, the function ‘f’ from X to Y is
injective function but not bijective.

 If |X|≤|Y| and |X|≥|Y| then |X|=|Y|. The sets X and Y are commonly referred as equivalent
sets.

Types of Sets
Sets can be classified into many types. Some of which are finite, infinite, subset, universal,
proper, singleton set, etc.

Finite Set

A set which contains a definite number of elements is called a finite set.

Example − S={x|x∈N and 70>x>50}

Infinite Set
A set which contains infinite number of elements is called an infinite set.
Example − S={x|x∈N and x>10}

Subset
A set X is a subset of set Y (Written as X⊆Y if every element of X is an element of set Y.
Example 1 –
Let, X={1,2,3,4,5,6} and Y={1,2}. Here set Y is a subset of set X as all the elements of set
Y is in set X. Hence, we can write Y⊆X.
Example 2 –
Let, X={1,2,3} and Y={1,2,3}. Here set Y is a subset (Not a proper subset) of set X as all
the elements of set Y is in set X. Hence, we can write Y⊆X.

Proper Subset
The term “proper subset” can be defined as “subset of but not equal to”. A Set X is a proper
subset of set Y (Written as X⊂Y) if every element of X is an element of set Y and |X|<|Y|.
Example –
Let, X={1,2,3,4,5,6} and Y={1,2}. Here set Y⊂X since all elements in Y are contained
in X too and X has at least one element is more than set Y.

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 3

Universal Set

It is a collection of all elements in a particular context or application. All the sets in that context
or application are essentially subsets of this universal set. Universal sets are represented as U.
Example –
We may define U as the set of all animals on earth. In this case, set of all mammals is a
subset of U, set of all fishes is a subset of U, set of all insects is a subset of U, and so on.

Empty Set or Null Set

An empty set contains no elements. It is denoted by ∅. As the number of elements in an empty

set is finite, empty set is a finite set. The cardinality of empty set or null set is zero.
Example − S={x|x∈N and 7<x<8}=∅

Singleton Set or Unit Set

Singleton set or unit set contains only one element. A singleton set is denoted by {s}.
Example − S={x|x∈N, 7<x<9} = {8}

Equal Set

If two sets contain the same elements they are said to be equal.
Example –
If A={1,2,6} and B={6,1,2}, they are equal as every element of set A is an element of set B
and every element of set B is an element of set A.

Equivalent Set

If the cardinalities of two sets are same, they are called equivalent sets.
Example –
If A={1,2,6} and B={16,17,22}, they are equivalent as cardinality of A is equal to the
cardinality of B. i.e. |A|=|B|=3

Overlapping Set

Two sets that have at least one common element are called overlapping sets.
In case of overlapping sets −
 n(A∪B) = n(A) + n(B) − n(A∩B)

 n(A∪B) = n(A−B) + n(B−A) + n(A∩B)

 n(A) = n(A−B) + n(A∩B)

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 4

  n(B) = n(B−A) + n(A∩B)

Example –
Let, A={1,2,6} and B={6,12,42}. There is a common element ‘6’, hence these sets are
overlapping sets.

Disjoint Set

Two sets A and B are called disjoint sets if they do not have even one element in common.
Therefore, disjoint sets have the following properties −
 n(A∩B) = ∅

 n(A∪B) = n(A) + n(B)

Example –
Let, A={1,2,6} and B={7,9,14} there is not a single common element, hence these sets are
disjoint sets.

Types of Sets

 Finite set: The number of elements is finite

 Infinite set: The number of elements are infinite
 Empty set: It has no elements
 Singleton set: It has one only element
 Equal set: Two sets are equal if they have same elements
 Equivalent set: Two sets are equivalent if they have same number of elements
 Power set: A set of every possible subset.
 Universal set: Any set that contains all the sets under consideration.
 Subset: When all the elements of set A belong to set B, then A is subset of B

Venn Diagrams

Venn diagram, invented in 1880 by John Venn, is a schematic diagram that shows all possible
logical relations between different mathematical sets.
Examples

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 5

Set Operations
Set Operations include Set Union, Set Intersection, Set Difference, Complement of Set, and
Cartesian Product.

Set Union
The union of sets A and B (denoted by A∪B) is the set of elements which are in A, in B, or in
both A and B. Hence, A∪B={x|x∈A OR x∈B}.
Example –
If A={10,11,12,13} and B = {13,14,15} then A∪B={10,11,12,13,14,15}. (The common element
occurs only once)

Set Intersection

The intersection of sets A and B (denoted by A∩B) is the set of elements which are in both A
and B. Hence, A∩B={x|x∈A and x∈B}.
Example –
If A={11,12,13} and B={13,14,15} then A∩B={13}.

Set Difference/ Relative Complement

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 6

The set difference of sets A and B (denoted by A–B) is the set of elements which are only in A
but not in B. Hence, A−B={x|x∈A and x∉B}
Example –
If A={10,11,12,13} and B={13,14,15} then (A−B) = {10,11,12} and (B−A)={14,15} Here, we
can see (A−B)≠(B−A)

Complement of a Set

The complement of a set A (denoted by A′) is the set of elements which are not in set A.
Hence, A′={x|x∉A}.
More specifically, A’′=(U−A) where U is a universal set which contains all objects.
Example − If A={x|x belongs to set of odd integers} then A’′={y | y does not belong to set of
odd integers}

Cartesian Product / Cross Product

Let A and B be 2 sets. Then the Cartesian products of A and B denoted by A×B is set of all
ordered pairs (a,b). where a ∈A and b∈B.
In symbols A×B = {(a,b) / a ∈A , b∈B}
ie., The Cartesian product of n number of sets A1,A2,…An denoted as A1×A2⋯×An can be
defined as all possible ordered pairs (x1,x2,…xn) where x1∈A1, x2∈A2,…xn ∈An .
Note: A×B ≠ B×A.
Example –
1). If we take two sets A={a,b} and B={1,2}
The Cartesian product of A and B is written as : A×B ={(a,1),(a,2),(b,1),(b,2)} The Cartesian
product of B and A is written as : B×A = {(1,a),(1,b),(2,a),(2,b)}
2). If A={a,b,c} and B={1,2,3} compute A×B, B×A and A×A.

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 7

Power Set

Power set of a set S is the set of all subsets of S including the empty set. The cardinality of a
power set of a set S of cardinality n is 2n. Power set is denoted as P(S).
Example −
For a set S={a,b,c,d} let us calculate the subsets −
 Subsets with 0 elements − {∅} (the empty set)

 Subsets with 1 element − {a},{b},{c},{d}{a},{b},{c},{d}

 Subsets with 2 elements − {a,b},{a,c},{a,d},{b,c},{b,d},{c,d}

 Subsets with 3 elements − {a,b,c},{a,b,d},{a,c,d},{b,c,d}

 Subsets with 4 elements − {a,b,c,d}

Hence, P(S)=
{{∅},{a},{b},{c},{d},{a,b},{a,c},{a,d},{b,c},{b,d},{c,d},{a,b,c},{a,b,d},{a,c,d},{b,c,d},{a,b,c,
d}}
|P(S)|=24=16
Note − The power set of an empty set is also an empty set.
|P({∅})|=20=1

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 8

Partitioning of a Set

Partition of a set, say S, is a collection of n disjoint subsets, say P1,P2,…Pn that satisfies the
following three conditions −
 Pi does not contain the empty set.

[Pi≠{∅} for all 0<i≤n]

 The union of the subsets must equal the entire original set.
[P1∪P2∪⋯∪Pn=S][P1∪P2∪⋯∪Pn=S]
 The intersection of any two distinct sets is empty.
[Pa∩Pb={∅}, for a≠b where n ≥ a,b ≥ 0]

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 9

Example
1).Let S={a,b,c,d,e,f,g,h} One probable partitioning is {{a},{b,c,d},{e,f,g,h}}
Another probable partitioning is {{a,b},{c,d},{e,f,g,h}}.
2). Find the partition of the set A = {1,2,3}.

Min set:
Let A be set and let B1, B2, B3, B4,……… Bn be the subsets of ‘A’, A set of form D1∩D2∩
D3,∩…..∩Dn where each Di may be either Bi or Bic is called min terms or minset generated by
Bi.

Max Set:
Let A be set and let B1, B2, B3, B4,……… Bn be the subsets of ‘A’, A set of form
D1UD2UD3U,…..UDn where each Di may be either Bi or Bic is called max terms or maxset
generated by Bi.

Qn. 1

2. Simplify the following using set theoretical laws: (𝐴 ∩ 𝐵) ∪ [𝐵 ∩ (𝐶 ∩ 𝐷) ∪ (𝐶 ∩ D )]

3. Write the dual of 𝐴 = ( B ∩ 𝐴) ∩ (𝐴 ∩ 𝐵)

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 10

 4. If A and B are any two sets prove analytically, a) A×(BՈC)=(A×B) Ո(A×C) b) AՈ(B-
C)=(AՈB)-(AՈC)
5. State and prove De Morgan’s law in set theory.
6. Prove that (A-C)∩(C-B)=(AᴜB)∩(AᴜC)= Ø analytically, where A,B,C are sets
7. Prove that A-(B∩C) = (A-B)ᴜ(A-C) analytically, where A, B and C are sets.

Function
Relation

“Relations and Functions” are the most important topics in algebra. Relations and functions –
these are the two different words having different meanings mathematically. You might get
confused about their difference. Before we go deeper, let’s understand the difference between
both with a simple example.
An ordered pair is represented as (INPUT, OUTPUT):
The relation shows the relationship between INPUT and OUTPUT. Whereas, a function is a
relation which derives one OUTPUT for each given INPUT.
Note: All functions are relations, but not all relations are functions.

Relation:
Definition: A relation R from a set A into another set B is a subset of A×B.
It is a subset of the Cartesian product. Or simply, a bunch of points (ordered pairs). In other
words, the relation between the two sets is defined as the collection of the ordered pair, in which
the ordered pair is formed by the object from each set.
Note: If a set A has m elements and a set B has n elements then there are mn elements in A×B
and 2mn subsets for A×B.
Example: {(-2, 1), (4, 3), (7, -3)}, usually written in set notation form with curly brackets.
Types of Relations
1. Universal Relations
2. Reflexive Relations
3. Symmetric Relations

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 11

 4. Anti Symmetric Relations
5. Transitive Relations
6. Equivalence Relation

1. Universal Relation
A universal (or full relation) is a type of relation in which every element of a set is related to each
other. Consider set A = {a, b, c}. Now one of the universal relations will be R = {x, y} where, |x
– y| ≥ 0. For universal relation, R = A × A

2. Reflexive Relation
In a reflexive relation, every element maps to itself. For example, consider a set A = {1, 2,}. Now
an example of reflexive relation will be R = {(1, 1), (2, 2), (1, 2), (2, 1)}. The reflexive relation is
given by- (a, a) ∈ R

3. Symmetric Relation
In a symmetric relation, if a=b is true then b=a is also true. In other words, a relation R is
symmetric only if (b, a) ∈ R is true when (a,b) ∈ R. An example of symmetric relation will be R
= {(1, 2), (2, 1)} for a set A = {1, 2}. So, for a symmetric relation, aRb ⇒ bRa, ∀ a, b ∈ A

4. Anti symmetric
Let R be a relation on a set A then R is called antisymmetric, ., if xRy and yRx, then x = y. or it
can be defined as, relation R is antisymmetric if either (x,y)∉R or (y,x)∉R whenever x ≠ y.

5. Transitive Relation
For transitive relation, if (x, y) ∈ R, (y, z) ∈ R, then (x, z) ∈ R. For a transitive relation,
aRb and bRc ⇒ aRc ∀ a, b, c ∈ A.

6. Equivalence Relation
If a relation is reflexive, symmetric and transitive at the same time it is known as an equivalence
relation.
Partially Ordered Set (poset)

Consider a relation R on a set S satisfying the following properties:

1. R is reflexive, i.e., xRx for every x ∈ S.

2. R is antisymmetric, i.e., if xRy and yRx, then x = y.

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 12

 3. R is transitive, i.e., xRy and yRz, then xRz.

Then R is called a partial order relation, and the set S together with partial order is called a
partially order set or POSET and is denoted by (S, ≤).

Example:
1. The set N of natural numbers form a poset under the relation '≤' because firstly x ≤ x,
secondly, if x ≤ y and y ≤ x, then we have x = y and lastly if x ≤ y and y ≤ z, it implies x ≤
z for all x, y, z ∈ N.
2. The set N of natural numbers under divisibility i.e., 'x divides y' forms a poset because x/x
for every x ∈ N. Also if x/y and y/x, we have x = y. Again if x/y, y/z we have x/z, for
every x, y, z ∈ N.
3. Show whether the relation (x, y) ∈ R, if, x ≥ y defined on the set of +ve integers is a partial
order relation.
Solution:
Consider the set A = {1, 2, 3, 4} containing four +ve integers. Find the relation for this set
such as R = {(2, 1), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3), (1, 1), (2, 2), (3, 3), (4, 4)}.
Reflexive: The relation is reflexive as for every a ∈ A. (a, a) ∈ R, i.e. (1, 1), (2, 2), (3, 3),
(4, 4) ∈ R.
Antisymmetric: The relation is antisymmetric as whenever (a, b) and (b, a) ∈ R, we have
a = b.
Transitive: The relation is transitive as whenever (a, b) and (b, c) ∈ R, we have (a, c) ∈ R.

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 13

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 14
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 15
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 16
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 17
1. Determine whether the relation R on the set of all integers is reflexive,
symmetric and or transitive, where aRb if and only if 𝑎𝑏 ≥ 0.
2. If R is a relation on the set of positive integers such that (𝑎, 𝑏) ∈ 𝑅 if and only if
ab is a perfect square Prove the above relation is an equivalence relation.
3. Let R is the relation on A={1, 2, 3} such that (a, b) ∈ 𝑅 if and only if a+b is even,
find the relational matrix 𝑀𝑅 and 𝑅2 . Also find the relational matrices R-1 and
R’.
4. Let R={(1,2), (3,4), (2,2)},and S={(4,2), (2,5), (3,1),(1,3)}be relations on{1,2,3,4}.
Find R◦S,S◦R, (R◦S)◦R, R◦(S◦R), R◦R,S◦S ,R◦R◦R.
5. For the relation R={(1,3),(1,4),(2,1),(2,3),(2,4),(3,4)} defined on X={1,2,3,4}. find
the properties of the relation R.
6. If R is the relation on the set of integers such that (x, y) ∈ R, if and only if 3x +
4y = 7n for some integer n, prove that R is an equivalence relation.
7. The relation R on the set A = { 1, 2, 3, 4, 5} is defined by the rule (a, b) ∈ R, if 3
divides a – b then list the elements of R and R-1 , also find domain and range of
R and R-1 .
8. If R is a relation from A= {1,2,3} to B={4,5} given by R={(1,4),(2,4),(1,5),(3,5)},

find R-1 and R .
Poset(Partition of a set), Hasse diagram
1. Define partial order relation and give an example.
2. Obtain all the partitions of the set B = {a, b, c}.
3. Let R be the following equivalence relation on the set A={1,2,3,4,5,6} . 𝑅 = {(1,1),
(1,5), (2,2), (2,3), (2,6), (3,2), (3,3), (3,6), (4,4), (5,1), (5,5), (6,2), (6,3), (6,6)} Find
the partition of A induced by R i.e., find the equivalence classes of R.
4. For the poset {3,5,9,15,24,45}
a) find the maximal and minimal elements. b) the greatest and the least elements.
c)the upper bounds and LUB of {3,5} d)the lower bounds and GLB of {15,45}
5. Draw the Hasse diagram for D30 (relation “x divides y”)
6. Draw the Hasse diagram for ({3, 4, 12, 24, 48, 72}, /)

Closures of relations, Warshalls algorithm

1. For the relation R={(1,1),(1,2),(1,3),(2,1),(2,2),(2,3),(3,1),(3,3),(4,4)} defined on
X={1,2,3,4},find the transitive closure of R using Warshall’s algorithm.

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 18

2. Define closure of a relation. Find reflexive and symmetric closure of R ={(1,2),(2,2),
(2,3), (3,2), (4,1), (4,4)}defined on A= {1, 2, 3, 4}.
3. Let A={1,2,3,4,5} and the relation R={ (1,1), (1,3), (1,5), (2,3), (2,4), (3,3), (3,5),
(4,2), (4,4), (5,4)} defined on A. Find the transitive closure of the relation R using
Warshall’s algorithm..
4. Let A={1,2,3,4} and the relation R={ (1,1),(1,3),(1,4),(2,2),(3,4),(4,1)} defined on
A. Find the transitive closure of the relation R using Warshall’s algorithm.
5. Using Warshall’s algorithm find the transitive closure if
0 1 0 0
1 0 1 0

0 0 0 1
 
0 0 0 0

Functions, Composition of functions and Inverse of a function, composition

1. Let f : R → R be defined by f(x) = 2x – 3 and find a formula for its inverse function
2. Let A={a, b, c} B={x, y, z} and C={r, s, t}. Let f: A → B and g:B → C be defined
by f={(a,y), (b,x), (c,y)} and g={(x,s), (y, t), (z,r)}. Find a) composition function g °
f: A→C b) Im(f), Im(g) and Im(g ° f)
3. Determine whether the function f : R → R given by f(x) = (x+1) / x is one-to one or
not.
4. Show that the function f : R → R defined by f(x) = x 2 is not bijective.
7. Let f : R → R and g : R → R be defined by f(x) = 2x +1 g(x) = x 2 -1 then find The
formula for the composition function (g ° f)(x).
8. Find (f ◦ g)(x) for f(x) = 3x + 4 and g(x) = (x2 + 1)/ x
9. At the end of the semester a teacher assigns letter grades to each of her students. Is
this a function? If so, what sets make up the domain and codomain, and is the
function injective, surjective, bijective, or neither.
ANS:Yes, this is a function, if you choose the domain and codomain correctly. The
domain will be the set of students, and the codomain will be the set of possible
grades. The function is almost certainly not injective, because it is likely that two
students will get the same grade. The function might be surjective – it will be if there
is at least one student who gets each grade.
10. Let f : X → Y and g : Y → Z be functions. We can define the composition of f
and g to be the function g ◦ f : X → Z which the image of each x ∈ X is g(f (x)). (a)

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 19

 If f and g are both injective, must g ◦ f be injective? Explain. (b) If f and g are both
surjective, must g ◦ f be surjective? Explain.
11. For the function F: {1, 2, 3, 4, 5}→ {a, b, c, d, e} defined as F(1)=a, F(2)=b,
F(3)=b, F(4)=d, F(5)=c, identify domain(F), codomain(F), range(F), F -1 (a), F-1 ({a,
b, c}) and F -1 (e).
12. If f and g are both defined on the set of real numbers and c is a constant f(x) =
cx – 3, g(x) = cx + 5. If (f ° g)(x) = (g ° f)(x) for all values of x, what is the value of
c?
13. Find (f ◦ g ◦ h)(x) if f(x) = 2x , g(x) = x2 + 2x and h(x) = 2x.
14. Consider the function g : Z → Z defined by g(n)= n 2 + 1. Find g −1 (1), g −1 (2),
g −1 (3) and g −1(10).
15. Find (g ◦ f ◦ q)(t) if q(t) = √ x, f(t) = x2 and g(t) = 5x9 .
16. Let f : X → Y and g : Y → Z be two bijective functions. Show that (g◦f) −1
exists and (g ◦ f) −1 = f −1 ◦ g−1 .
17. For the functions f(x) = x2 − 4 and g(x) = x  1 , find f(g(x)), g(f(x)), (f ◦ f)(x),
and (g ◦ g)(x).
18. If f, g : R → R where f(x) = ax+b, g(x)= 1 – x+x 2 and (g ° f)(x) = 9x2 – 9x+3.
Find the values of a and b.
19. If f, g, h : R → R where f(x) = x+2, g(x)= 1 / (x2+1) and h(x) = 3. Find g ◦ f – 1
◦ f(x) and f – 1 ◦ g ◦ f(x).
20. Verify f ◦ (g ◦ h) = (f ◦ g) ◦ h , when f, g, h : Z → Z defined by f(n) = n 2 , g(n)
= n+1 and h(x) = n – 1.
21. Show that the function F:RR defined by f (x) = x\(x4) is one-to-one and
onto.
22. If f : A B & g : B C are invertible functions, then prove that g ◦f : AC
is also invertible and (g ◦ f) −1 = f −1 ◦ g−1 .
23. If f:A→B and g:B→C are one-to-one functions. Then prove that (g◦f) is also
one-to-one

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 20

[

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 21

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 22
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 23
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 24
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 25
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 26
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 27
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 28
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 29
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 30
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 31
6) Find the transitive closure of the relation R = { (1,1),(1,2),(2,1),(2,2),(3,3),(3,5),(4,3),(4,4),(4,5),(5,4),(5,5)} defined on
the set A = {1,2,3,4,5} using warshall’s algorithm.

1 1 0 0 0
 
1 1 0 0 0
M R  0 0 1 1 0
 
0 0 1 1 1
 0 0 0 1 1 


K In Wk-1

Position’s of 1’s in Position’s of 1’s in Wk has 1’s in Wk

column k row k

1 1 1 0 0 0
 
1 1 0 0 0
1, 2 1, 2 (1,1),(1,2),(2,1),(2,2) W1   0 0 1 1 0
 
0 0 1 1 1
 
 0 0 0 1 1

2 1, 2 1, 2 (1,1),(1,2),(2,1),(2,2) W1= W2
3 1 1 0 0 0
 
1 1 0 0 0
3,4 3 ,4 (3,3),(3,4),(4,3),(4,4) W3   0 0 1 1 0
 
0 0 1 1 1
 
 0 0 0 1 1

4 1 1 0 0 0
(3,3),(3,4),(3,5)  
1 1 0 0 0
3,4,5 3,4,5 (4,3),(4,4),(4,5) W4   0 0 1 1 1
 
0 0 1 1 1
(5,3),(5,4),(5,5)  
 0 0 1 1 1 

5 1 1 0 0 0
 
1 1 0 0 0
4,5 4,5 W5   0 0 1 1 1
 
0 0 1 1 1
(4,4),(4,5),(5,4),(5,5)  
 0 0 1 1 1 

 The transitive closure of R is { (1.1),(1.2),(2,1),(2,2),(3,3),(3,4),(3,5),(4,3) , (4,4),(4,5),(5,3),(5,4),(5,5)}

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 32

7) Find the transitive closure of the relation R = { (1,1),(1,3),(1,5),(2,3),(2,4),(3,3),(3,5),(4,2),(4,4),(5,4)} defined on the
set A = {1,2,3,4,5} using warshall’s algorithm.

1 0 1 0 1
 
0 0 1 1 0
M R  0 0 1 0 1
 
0 1 0 1 0
 0 0 0 1 0 


K In Wk-1

Position’s of 1’s in Position’s of 1’s in Wk has 1’s in Wk

column k row k

1 1 0 1 0 1
 
0 0 1 1 0
1 1, 3 , 5 (1,1),(1,3),(1,5) W1   0 0 1 0 1
 
0 1 0 1 0
 0 0 0 1 0 


2
1 0 1 0 1 
 
4 3, 4 (4,3),(4,4) 0 0 1 1
0 
W2   0 0 1 0 1 
 
0 1 1 1 0 
 0 0 0 1 0 


3 1 0 1 0 1 
 
(1,3),(1,5),(2,3),(2,5) 0 0 1 1 1 
1 , 2, 3 3 ,5 W3   0 0 1 0 1 
 
(3,3), ( 3,5) 0 1 1 1 0 
 0 0 0 1 0 


4 1 0 1 0 1
(2,2),(2,4)  
0 1 1 1 1
2,4,5 2,4 (4,2),(4,4) W4   0 0 1 0 1
 
0 1 1 1 0
(5,2),(5,4)  0 1 0 1 0 


5 1 0 1 1 1 
 
0 1 1 1 1 
1,3 4 W5   0 0 1 1 1 
 
0 1 1 1 0 
(1,4),(3,4)  0 1 0 1 0 


 The transitive closure of R is { (1.1),(1.3),(1,4),(1,5),(2,2),(2,3),(2,4), (2,5),(3,3),(3,4),(3,5),(4,2)(4,3) ,

(4,4),(5,1),(5,4)}

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 33

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 34
[

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 35

J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 36
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 37
J.BALAMURUGAN Assistant Professor, Department of Mathematics, SRMIST, Vadapapalani Page 38