ICAI Notes- Sets, Relations and Functions | Quantitative Aptitude for CA Foundation PDF Download

 Page 1


SETS, RELATIONS AND
FUNCTIONS
7
CHAPTER
In our mathematical language, everything in this universe, whether living or non-living, is
called an object.
If we consider a collection of objects given in such a way that it is possible to tell beyond doubt
whether a given object is in the collection under consideration or not, then such a collection of
objects is called a well-defined collection of objects.
After reading this chapter, students will be able to understand:
? Understand the concept of set theory.
? Appreciate the basics of functions and relations.
? Understand the types of functions and relations.
? Solve problems relating to sets, functions and relations.
The Concept of Set Theory
Subset Types of Sets
Types of
Relations
Relations
Types of
Functions
Functions
CHAPTER OVERVIEW
© The Institute of Chartered Accountants of India
Page 2


SETS, RELATIONS AND
FUNCTIONS
7
CHAPTER
In our mathematical language, everything in this universe, whether living or non-living, is
called an object.
If we consider a collection of objects given in such a way that it is possible to tell beyond doubt
whether a given object is in the collection under consideration or not, then such a collection of
objects is called a well-defined collection of objects.
After reading this chapter, students will be able to understand:
? Understand the concept of set theory.
? Appreciate the basics of functions and relations.
? Understand the types of functions and relations.
? Solve problems relating to sets, functions and relations.
The Concept of Set Theory
Subset Types of Sets
Types of
Relations
Relations
Types of
Functions
Functions
CHAPTER OVERVIEW
© The Institute of Chartered Accountants of India
BUSINESS MATHEMATICS
7.2
A set is defined to be a collection of well-defined distinct objects. This collection may be listed
or described. Each object is called an element of the set. We usually denote sets by capital
letters and their elements by small letters.
Example: A = {a, e, i, o, u}
B = {2, 4, 6, 8, 10}
C = {pqr, prq, qrp, rqp, qpr, rpq}
D = {1, 3, 5, 7, 9}
E = {1,2}
etc.
This form is called Roster or Braces form. In this form we make a list of the elements of the set
and put it within braces { }.
Instead of listing we could describe them as follows :
A = the set of vowels in the alphabet
B = The set of even numbers between 2 and 10 both inclusive.
C = The set of all possible arrangements of the letters p, q and r
D = The set of odd digits between 1 and 9 both inclusive.
E = The set of roots of the equation x
2 
– 3x + 2 = 0
Set B, D and E can also be described respectively as
B = {x : x = 2m and m being an integer lying in the interval 0 < m < 6}
D = {2x – 1 : 0 < x < 5 and x is an integer}
E = {x : x
2
 – 3x + 2 = 0}
This form is called set-Builder or Algebraic form or Rule Method. This method of writing the
set is called Property method. The symbol : or/reads 'such that'. In this method, we list the
property or properties satisfied by the elements of the set.
We write, {x:x satisfies properties P}. This means, "the set of all those x such that x satisfies the
properties P".
A set may contain either a finite or an infinite number of members or elements. When the
number of members is very large or infinite it is obviously impractical or impossible to list them
all. In such case.
we may write as :
N = The set of natural numbers = {1, 2, 3…..}
W = The set of whole numbers = {0, 1, 2, 3,…)
etc.
© The Institute of Chartered Accountants of India
Page 3


SETS, RELATIONS AND
FUNCTIONS
7
CHAPTER
In our mathematical language, everything in this universe, whether living or non-living, is
called an object.
If we consider a collection of objects given in such a way that it is possible to tell beyond doubt
whether a given object is in the collection under consideration or not, then such a collection of
objects is called a well-defined collection of objects.
After reading this chapter, students will be able to understand:
? Understand the concept of set theory.
? Appreciate the basics of functions and relations.
? Understand the types of functions and relations.
? Solve problems relating to sets, functions and relations.
The Concept of Set Theory
Subset Types of Sets
Types of
Relations
Relations
Types of
Functions
Functions
CHAPTER OVERVIEW
© The Institute of Chartered Accountants of India
BUSINESS MATHEMATICS
7.2
A set is defined to be a collection of well-defined distinct objects. This collection may be listed
or described. Each object is called an element of the set. We usually denote sets by capital
letters and their elements by small letters.
Example: A = {a, e, i, o, u}
B = {2, 4, 6, 8, 10}
C = {pqr, prq, qrp, rqp, qpr, rpq}
D = {1, 3, 5, 7, 9}
E = {1,2}
etc.
This form is called Roster or Braces form. In this form we make a list of the elements of the set
and put it within braces { }.
Instead of listing we could describe them as follows :
A = the set of vowels in the alphabet
B = The set of even numbers between 2 and 10 both inclusive.
C = The set of all possible arrangements of the letters p, q and r
D = The set of odd digits between 1 and 9 both inclusive.
E = The set of roots of the equation x
2 
– 3x + 2 = 0
Set B, D and E can also be described respectively as
B = {x : x = 2m and m being an integer lying in the interval 0 < m < 6}
D = {2x – 1 : 0 < x < 5 and x is an integer}
E = {x : x
2
 – 3x + 2 = 0}
This form is called set-Builder or Algebraic form or Rule Method. This method of writing the
set is called Property method. The symbol : or/reads 'such that'. In this method, we list the
property or properties satisfied by the elements of the set.
We write, {x:x satisfies properties P}. This means, "the set of all those x such that x satisfies the
properties P".
A set may contain either a finite or an infinite number of members or elements. When the
number of members is very large or infinite it is obviously impractical or impossible to list them
all. In such case.
we may write as :
N = The set of natural numbers = {1, 2, 3…..}
W = The set of whole numbers = {0, 1, 2, 3,…)
etc.
© The Institute of Chartered Accountants of India
7.3 SETS, RELATIONS AND FUNCTIONS
I. The members of a set are usually called elements. In A = {a, e, i, o, u}, a is an element and
we write a ?A i.e. a belongs to A. But 3 is not an element of B = {2, 4, 6, 8, 10} and we write
3 ?B. i.e. 3 does not belong to B.
II. If every element of a set P is also an element of set Q we say that P is a subset of Q. We write
P ? Q . Q is said to be a superset of P. For example {a, b} ? {a, b, c}, {2, 4, 6, 8, 10} ? N. If
there exists even a single element in A, which is not in B then A is not a subset of B.
III. If P is a subset of Q but P is not equal to Q then P is called a proper subset of Q.
IV.
?
 has no proper subset.
Illustration: {3} is a proper subset of {2, 3, 5}. But {1, 2} is not a subset of {2, 3, 5}.
Thus if P = {1, 2} and Q = {1, 2 ,3} then P is a subset of Q but P is not equal to Q. So, P is a proper
subset of Q.
To give completeness to the idea of a subset, we include the set itself and the empty set. The
empty set is one which contains no element. The empty set is also known as null or void set
usually denoted by { } or Greek letter 
?
, to be read as phi. For example the set of prime numbers
between 32 and 36 is a null set. The subsets of {1, 2, 3} include {1, 2, 3}, {1, 2}, {1, 3}, {2, 3}, {1},
{2}, {3} and { }.
A set containing n elements has 2
n
 subsets. Thus a set containing 3 elements has 2
3
 (=8) subsets.
A set containing n elements has 2 –1 proper subsets. Thus a set containing 3 elements has
n
1 =7 subsets. The proper subsets of { 1,2,3} include {1, 2}, {1, 3}, {2, 3}, {1}, {2}, {3], { } .
Suppose we have two sets A and B. The intersection of these sets, written as A
?
B contains
those elements which are in A and are also in B.
For example A = {2, 3, 6, 10, 15}, B = {3, 6, 15, 18, 21, 24} and C = { 2, 5, 7}, we have A
?
B =
{ 3, 6, 15}, A
?
C = {2}, B
?
C = 
?
, where the intersection of B and C is empty set. So, we say B
and C are disjoint sets since they have no common element. Otherwise sets are called overlapping
or intersecting sets. The union of two sets, A and B, written as A
?
B contain all these elements
which are in either A or B or both.
So A
?
B = {2, 3, 6, 10, 15, 18, 21, 24}
A
?
C = {2, 3, 5, 6, 7, 10, 15}
A set which has at least one element is called non-empty set . Thus the set { 0 } is non-empty set.
It has one element say 0.
Singleton Set: A set containing one element is called Singleton Set.
For example {1} is a singleton set, whose only element is 1.
Equal Set: Two sets A & B are said to be equal, written as A = B if every element of A is in B
and every element of B is in A.
Illustration: If A = {2, 4, 6} and B = {2, 4, 6} then A = B.
Remarks : (I) The elements of the two sets may be listed in any order.
 2 –
3
© The Institute of Chartered Accountants of India
Page 4


SETS, RELATIONS AND
FUNCTIONS
7
CHAPTER
In our mathematical language, everything in this universe, whether living or non-living, is
called an object.
If we consider a collection of objects given in such a way that it is possible to tell beyond doubt
whether a given object is in the collection under consideration or not, then such a collection of
objects is called a well-defined collection of objects.
After reading this chapter, students will be able to understand:
? Understand the concept of set theory.
? Appreciate the basics of functions and relations.
? Understand the types of functions and relations.
? Solve problems relating to sets, functions and relations.
The Concept of Set Theory
Subset Types of Sets
Types of
Relations
Relations
Types of
Functions
Functions
CHAPTER OVERVIEW
© The Institute of Chartered Accountants of India
BUSINESS MATHEMATICS
7.2
A set is defined to be a collection of well-defined distinct objects. This collection may be listed
or described. Each object is called an element of the set. We usually denote sets by capital
letters and their elements by small letters.
Example: A = {a, e, i, o, u}
B = {2, 4, 6, 8, 10}
C = {pqr, prq, qrp, rqp, qpr, rpq}
D = {1, 3, 5, 7, 9}
E = {1,2}
etc.
This form is called Roster or Braces form. In this form we make a list of the elements of the set
and put it within braces { }.
Instead of listing we could describe them as follows :
A = the set of vowels in the alphabet
B = The set of even numbers between 2 and 10 both inclusive.
C = The set of all possible arrangements of the letters p, q and r
D = The set of odd digits between 1 and 9 both inclusive.
E = The set of roots of the equation x
2 
– 3x + 2 = 0
Set B, D and E can also be described respectively as
B = {x : x = 2m and m being an integer lying in the interval 0 < m < 6}
D = {2x – 1 : 0 < x < 5 and x is an integer}
E = {x : x
2
 – 3x + 2 = 0}
This form is called set-Builder or Algebraic form or Rule Method. This method of writing the
set is called Property method. The symbol : or/reads 'such that'. In this method, we list the
property or properties satisfied by the elements of the set.
We write, {x:x satisfies properties P}. This means, "the set of all those x such that x satisfies the
properties P".
A set may contain either a finite or an infinite number of members or elements. When the
number of members is very large or infinite it is obviously impractical or impossible to list them
all. In such case.
we may write as :
N = The set of natural numbers = {1, 2, 3…..}
W = The set of whole numbers = {0, 1, 2, 3,…)
etc.
© The Institute of Chartered Accountants of India
7.3 SETS, RELATIONS AND FUNCTIONS
I. The members of a set are usually called elements. In A = {a, e, i, o, u}, a is an element and
we write a ?A i.e. a belongs to A. But 3 is not an element of B = {2, 4, 6, 8, 10} and we write
3 ?B. i.e. 3 does not belong to B.
II. If every element of a set P is also an element of set Q we say that P is a subset of Q. We write
P ? Q . Q is said to be a superset of P. For example {a, b} ? {a, b, c}, {2, 4, 6, 8, 10} ? N. If
there exists even a single element in A, which is not in B then A is not a subset of B.
III. If P is a subset of Q but P is not equal to Q then P is called a proper subset of Q.
IV.
?
 has no proper subset.
Illustration: {3} is a proper subset of {2, 3, 5}. But {1, 2} is not a subset of {2, 3, 5}.
Thus if P = {1, 2} and Q = {1, 2 ,3} then P is a subset of Q but P is not equal to Q. So, P is a proper
subset of Q.
To give completeness to the idea of a subset, we include the set itself and the empty set. The
empty set is one which contains no element. The empty set is also known as null or void set
usually denoted by { } or Greek letter 
?
, to be read as phi. For example the set of prime numbers
between 32 and 36 is a null set. The subsets of {1, 2, 3} include {1, 2, 3}, {1, 2}, {1, 3}, {2, 3}, {1},
{2}, {3} and { }.
A set containing n elements has 2
n
 subsets. Thus a set containing 3 elements has 2
3
 (=8) subsets.
A set containing n elements has 2 –1 proper subsets. Thus a set containing 3 elements has
n
1 =7 subsets. The proper subsets of { 1,2,3} include {1, 2}, {1, 3}, {2, 3}, {1}, {2}, {3], { } .
Suppose we have two sets A and B. The intersection of these sets, written as A
?
B contains
those elements which are in A and are also in B.
For example A = {2, 3, 6, 10, 15}, B = {3, 6, 15, 18, 21, 24} and C = { 2, 5, 7}, we have A
?
B =
{ 3, 6, 15}, A
?
C = {2}, B
?
C = 
?
, where the intersection of B and C is empty set. So, we say B
and C are disjoint sets since they have no common element. Otherwise sets are called overlapping
or intersecting sets. The union of two sets, A and B, written as A
?
B contain all these elements
which are in either A or B or both.
So A
?
B = {2, 3, 6, 10, 15, 18, 21, 24}
A
?
C = {2, 3, 5, 6, 7, 10, 15}
A set which has at least one element is called non-empty set . Thus the set { 0 } is non-empty set.
It has one element say 0.
Singleton Set: A set containing one element is called Singleton Set.
For example {1} is a singleton set, whose only element is 1.
Equal Set: Two sets A & B are said to be equal, written as A = B if every element of A is in B
and every element of B is in A.
Illustration: If A = {2, 4, 6} and B = {2, 4, 6} then A = B.
Remarks : (I) The elements of the two sets may be listed in any order.
 2 –
3
© The Institute of Chartered Accountants of India
BUSINESS MATHEMATICS
7.4
P
(a)
P
Q
Thus, {1, 2, 3} = {2, 1, 3} = {3, 2, 1} etc.
(II) The repetition of elements in a set is meaningless.
Example: {x : x is a letter in the word "follow"} = {f, o, l, w}
Example: Show that 
?
, {0} and 0 are all different.
Solution: 
?
 is a set containing no element at all; {0} is a set containing one element, namely 0.
And 0 is a number, not a set.
Hence 
?
,{0} and 0 are all different.
The set which contains all the elements under consideration in a particular problem is called
the universal set denoted by S. Suppose that P is a subset of S. Then the complement of P,
written as P
c
 (or P') contains all the elements in S but not in P. This can also be written as S – P
or S ~ P. S – P = {x : x ? S, x ? P}.
For example let S = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
P = {0, 2, 4, 6, 8}
Q = {1, 2, 3, 4, 5)
Then P' = {1, 3 ,5 ,7, 9} and Q'= {0 , 6 , 7, 8, 9}
Also P
?
Q = {0, 1, 2, 3, 4, 5, 6, 8}, (P
?
Q) = {7, 9}
P
?
Q = {2, 4}
P
?
Q' = {0, 2, 4, 6, 7, 8, 9}, (P
?
Q)' = {0, 1, 3, 5, 6, 7, 8, 9}
P'
?
Q' = {0, 1, 3, 5, 6, 7, 8, 9}
P'
?
Q' = {7, 9}
So it can be noted that (P
?
Q)' = P'
?
Q' and (P
?
Q)' = P'
?
Q'. These are known as De Morgan’s
laws.
We may represent the above operations on sets by means of Euler - Venn diagrams.
Fig. 1
S
(b)
'
© The Institute of Chartered Accountants of India
Page 5


SETS, RELATIONS AND
FUNCTIONS
7
CHAPTER
In our mathematical language, everything in this universe, whether living or non-living, is
called an object.
If we consider a collection of objects given in such a way that it is possible to tell beyond doubt
whether a given object is in the collection under consideration or not, then such a collection of
objects is called a well-defined collection of objects.
After reading this chapter, students will be able to understand:
? Understand the concept of set theory.
? Appreciate the basics of functions and relations.
? Understand the types of functions and relations.
? Solve problems relating to sets, functions and relations.
The Concept of Set Theory
Subset Types of Sets
Types of
Relations
Relations
Types of
Functions
Functions
CHAPTER OVERVIEW
© The Institute of Chartered Accountants of India
BUSINESS MATHEMATICS
7.2
A set is defined to be a collection of well-defined distinct objects. This collection may be listed
or described. Each object is called an element of the set. We usually denote sets by capital
letters and their elements by small letters.
Example: A = {a, e, i, o, u}
B = {2, 4, 6, 8, 10}
C = {pqr, prq, qrp, rqp, qpr, rpq}
D = {1, 3, 5, 7, 9}
E = {1,2}
etc.
This form is called Roster or Braces form. In this form we make a list of the elements of the set
and put it within braces { }.
Instead of listing we could describe them as follows :
A = the set of vowels in the alphabet
B = The set of even numbers between 2 and 10 both inclusive.
C = The set of all possible arrangements of the letters p, q and r
D = The set of odd digits between 1 and 9 both inclusive.
E = The set of roots of the equation x
2 
– 3x + 2 = 0
Set B, D and E can also be described respectively as
B = {x : x = 2m and m being an integer lying in the interval 0 < m < 6}
D = {2x – 1 : 0 < x < 5 and x is an integer}
E = {x : x
2
 – 3x + 2 = 0}
This form is called set-Builder or Algebraic form or Rule Method. This method of writing the
set is called Property method. The symbol : or/reads 'such that'. In this method, we list the
property or properties satisfied by the elements of the set.
We write, {x:x satisfies properties P}. This means, "the set of all those x such that x satisfies the
properties P".
A set may contain either a finite or an infinite number of members or elements. When the
number of members is very large or infinite it is obviously impractical or impossible to list them
all. In such case.
we may write as :
N = The set of natural numbers = {1, 2, 3…..}
W = The set of whole numbers = {0, 1, 2, 3,…)
etc.
© The Institute of Chartered Accountants of India
7.3 SETS, RELATIONS AND FUNCTIONS
I. The members of a set are usually called elements. In A = {a, e, i, o, u}, a is an element and
we write a ?A i.e. a belongs to A. But 3 is not an element of B = {2, 4, 6, 8, 10} and we write
3 ?B. i.e. 3 does not belong to B.
II. If every element of a set P is also an element of set Q we say that P is a subset of Q. We write
P ? Q . Q is said to be a superset of P. For example {a, b} ? {a, b, c}, {2, 4, 6, 8, 10} ? N. If
there exists even a single element in A, which is not in B then A is not a subset of B.
III. If P is a subset of Q but P is not equal to Q then P is called a proper subset of Q.
IV.
?
 has no proper subset.
Illustration: {3} is a proper subset of {2, 3, 5}. But {1, 2} is not a subset of {2, 3, 5}.
Thus if P = {1, 2} and Q = {1, 2 ,3} then P is a subset of Q but P is not equal to Q. So, P is a proper
subset of Q.
To give completeness to the idea of a subset, we include the set itself and the empty set. The
empty set is one which contains no element. The empty set is also known as null or void set
usually denoted by { } or Greek letter 
?
, to be read as phi. For example the set of prime numbers
between 32 and 36 is a null set. The subsets of {1, 2, 3} include {1, 2, 3}, {1, 2}, {1, 3}, {2, 3}, {1},
{2}, {3} and { }.
A set containing n elements has 2
n
 subsets. Thus a set containing 3 elements has 2
3
 (=8) subsets.
A set containing n elements has 2 –1 proper subsets. Thus a set containing 3 elements has
n
1 =7 subsets. The proper subsets of { 1,2,3} include {1, 2}, {1, 3}, {2, 3}, {1}, {2}, {3], { } .
Suppose we have two sets A and B. The intersection of these sets, written as A
?
B contains
those elements which are in A and are also in B.
For example A = {2, 3, 6, 10, 15}, B = {3, 6, 15, 18, 21, 24} and C = { 2, 5, 7}, we have A
?
B =
{ 3, 6, 15}, A
?
C = {2}, B
?
C = 
?
, where the intersection of B and C is empty set. So, we say B
and C are disjoint sets since they have no common element. Otherwise sets are called overlapping
or intersecting sets. The union of two sets, A and B, written as A
?
B contain all these elements
which are in either A or B or both.
So A
?
B = {2, 3, 6, 10, 15, 18, 21, 24}
A
?
C = {2, 3, 5, 6, 7, 10, 15}
A set which has at least one element is called non-empty set . Thus the set { 0 } is non-empty set.
It has one element say 0.
Singleton Set: A set containing one element is called Singleton Set.
For example {1} is a singleton set, whose only element is 1.
Equal Set: Two sets A & B are said to be equal, written as A = B if every element of A is in B
and every element of B is in A.
Illustration: If A = {2, 4, 6} and B = {2, 4, 6} then A = B.
Remarks : (I) The elements of the two sets may be listed in any order.
 2 –
3
© The Institute of Chartered Accountants of India
BUSINESS MATHEMATICS
7.4
P
(a)
P
Q
Thus, {1, 2, 3} = {2, 1, 3} = {3, 2, 1} etc.
(II) The repetition of elements in a set is meaningless.
Example: {x : x is a letter in the word "follow"} = {f, o, l, w}
Example: Show that 
?
, {0} and 0 are all different.
Solution: 
?
 is a set containing no element at all; {0} is a set containing one element, namely 0.
And 0 is a number, not a set.
Hence 
?
,{0} and 0 are all different.
The set which contains all the elements under consideration in a particular problem is called
the universal set denoted by S. Suppose that P is a subset of S. Then the complement of P,
written as P
c
 (or P') contains all the elements in S but not in P. This can also be written as S – P
or S ~ P. S – P = {x : x ? S, x ? P}.
For example let S = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
P = {0, 2, 4, 6, 8}
Q = {1, 2, 3, 4, 5)
Then P' = {1, 3 ,5 ,7, 9} and Q'= {0 , 6 , 7, 8, 9}
Also P
?
Q = {0, 1, 2, 3, 4, 5, 6, 8}, (P
?
Q) = {7, 9}
P
?
Q = {2, 4}
P
?
Q' = {0, 2, 4, 6, 7, 8, 9}, (P
?
Q)' = {0, 1, 3, 5, 6, 7, 8, 9}
P'
?
Q' = {0, 1, 3, 5, 6, 7, 8, 9}
P'
?
Q' = {7, 9}
So it can be noted that (P
?
Q)' = P'
?
Q' and (P
?
Q)' = P'
?
Q'. These are known as De Morgan’s
laws.
We may represent the above operations on sets by means of Euler - Venn diagrams.
Fig. 1
S
(b)
'
© The Institute of Chartered Accountants of India
7.5 SETS, RELATIONS AND FUNCTIONS
Thus Fig. 1(a) shows a universal set S represented by a rectangular region and one of its subsets
P represented by a circular shaded region.
The un-shaded region inside the rectangle represents P'.
Figure 1(b) shows two sets P and Q represented by two intersecting circular regions. The total
shaded area represents PUQ, the cross-hatched "intersection" represents P
?
Q.
The number of distinct elements contained in a finite set A is called its cardinal number. It is
denoted by n(A). For example, the number of elements in the set R = {2, 3, 5, 7} is denoted by
n(R). This number is called the cardinal number of the set R.
Thus n(AUB) = n(A) + n(B) – n(A
?
B)
If A and B are disjoint sets, then n(AUB) = n(A) + n(B) as n (A
?
B) = 0
For three sets P, Q and R
n(PUQUR) = n(P) + n(Q) + n(R) – n(P
?
Q) – n(Q
?
R) – n(P
?
R) + n(P
?
Q
?
R)
When P, Q and R are disjoint sets
                              = n(P) + n(Q) + n(R)
Illustration: If A = {2, 3, 5, 7} , then n(A) = 4
Equivalent Set: Two finite sets A & B are said to be equivalent if n (A) = n(B).
Clearly, equal sets are equivalent but equivalent sets need not be equal.
A B
© The Institute of Chartered Accountants of India