Sets-notes and Assignment
Sets-notes and Assignment
DEFINITION.
A set is a well-defined class or collection of objects. By a well defined collection we mean that there exists a rule with
the help of which it is possible to tell whether a given object belongs or does not belong to the given collection. The
objects in sets may be anything, numbers, people, mountains, rivers etc. The objects constituting the set are called
elements or members of the set.
A set is often described in the following two ways.
1.) ROSTER METHOD OR LISTING METHOD
In this method a set is described by listing elements, separated by commas, within braces {}. The set of vowels of
English alphabet may be described as {a, e, i, o, u}.
The set of even natural numbers can be described as {2, 4, 6..........}. Here the dots stand for ‘and so on’.
2.) SET-BUILDER METHOD OR RULE METHOD
In this method, a set is described by a characterizing property P(x) of its elements x. In such a case the set is described
by {x : P(x) holds} or {x | P(x) holds}, which is read as ‘the set of all x such that P(x) holds’. The symbol ‘|’ or ‘:’ is
read as ‘such that’.
The set E of all even natural numbers can be written as
E = {x | x is natural number and x = 2n for n N}
or E = {x | x N, x = 2n, n N}
or E = {x N | x = 2n, n N}
The set A {0, 1, 4 , 9, 16 ,....} can be written as A {x 2 | x Z}
TYPES OF SETS
NULL SET OR EMPTY SET
The set which contains no element at all is called the null set. This set is sometimes also called the ‘empty set’ or the
‘void set’. It is denoted by the symbol or {}.
A set which has at least one element is called a non-empty set.
Let A { x : x 2 1 0 and x is real)
Since there is no real number which satisfies the equation x 2 1 0 , therefore the set A is empty set.
If A and B are any two empty sets, then x A iff x B is satisfied because there is no element x in either A or B
to which the condition may be applied. Thus A = B. Hence, there is only one empty set and we denote it by .
Therefore, article 'the' is used before empty set.
SINGLETON SET
A set consisting of a single element is called a singleton set. The set {5} is a singleton set.
FINITE SET
A set is called a finite set if it is either void set or its elements can be listed (counted, labelled) by natural number 1, 2,
3, … and the process of listing terminates at a certain natural number n (say).
CARDINAL NUMBER OF A FINITE SET
The number n in the above definition is called the cardinal number or order of a finite set A and is denoted by n(A) or
O(A).
INFINITE SET
A set whose elements cannot be listed by the natural numbers 1, 2, 3, …., n, for any natural number n is called an
infinite set.
EQUIVALENT SET
Two finite sets A and B are equivalent if their cardinal numbers are same i.e. n(A) = n(B).
Example: A {1, 3, 5, 7} ; B {10 , 12, 14 , 16 } are equivalent sets [ O( A) O(B) 4 ]
EQUAL SET
Two sets A and B are said to be equal iff every element of A is an element of B and also every element of B is an
element of A. We write “A = B” if the sets A and B are equal and “A B” if the sets A and B are not equal.
Symbolically, A = B if x A x B.
The statement given in the definition of the equality of two sets is also known as the axiom of extension.
Example: If A {2, 3, 5, 6} and B {6, 5, 3, 2} . Then A B, because each element of A is an element of B and vice-
versa.
UNIVERSAL SET
A set containing of all possible elements which occur in the discussion is called a universal set and is denoted by U.
Thus in any particular discussion, no element can exist out of universal set. It should be noted that universal set is not
unique. It may differ in problem to problem.
POWER SET
If S is any set, then the family of all the subsets of S is called the power set of S.
The power set of S is denoted by P(S). Symbolically, P(S) = {T : T S}. Obviously and S are both elements of
P(S). Example : Let S = {a, b, c}, then P(S) = { , {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}}.
SUBSETS (SET INCLUSION)
Let A and B be two sets. If every element of A is an element of B, then A is called a subset of B.
If A is subset of B, we write A B, which is read as “A is a subset of B” or “A is contained in B”.
Thus, A B a A a B.
PROPER AND IMPROPER SUBSETS
If A is a subset of B and A B, then A is a proper subset of B. We write this as A B .
The null set is subset of every set and every set is subset of itself, i.e., A and A A for every set A. They are
called improper subsets of A. Thus every non-empty set has two improper subsets. It should be noted that has only
one subset which is improper. Thus A has two improper subsets iff it is non-empty.
All other subsets of A are called its proper subsets. Thus, if A B, A B , A , then A is said to be proper subset
of B.
Example: Let A {1, 2} . Then A has ;{1}, {2}, {1, 2} as its subsets out of which and {1, 2} are improper and {1}
and {2} are proper subsets.
Solution: x 2 16 x 4
2x 6 x 3
There is no value of x which satisfies both the above equations. Thus, A .
Example: Two finite sets have m and n elements. The total number of subsets of the first set is 56 more than the total number of
subsets of the second set. The values of m and n are
(a) 7, 6 (b) 6, 3 (c) 5, 1 (d) 8, 7
Solution: Since 2 m 2 n 56 8 7 2 3 7 2 n (2 m n 1) 2 3 7
n 3 and 2 m n 8 2 3
m n 3 m 3 3 m 6
m 6, n 3 .
2 6.
3
Solution: Number of proper subsets of the set {1, 2, 3) = 2
Venn Diagrams.
The combination of rectangles and circles are called Venn-Euler diagrams or simply Venn-diagrams.
In venn-diagrams the universal set U is represented by points within a rectangle and its subsets are represented by
points in closed curves (usually circles) within the rectangle. If a set A is a subset of a set B, then the circle
representing A is drawn inside the circle representing B. If A and B are not equal but they have some common
elements, then to represent A and B we draw two intersecting circles. Two disjoints sets are represented by two non-
intersecting circles.
OPERATIONS ON SETS
UNION OF SETS
Let A and B be two sets. The union of A and B is the set of all elements which are in set A or in B. We denote the
union of A and B by A B which is usually read as “A union B”.
symbolically, A B {x : x A or x B}.
VENN DIAGRAM
INTERSECTION OF SETS
Let A and B be two sets. The intersection of A and B is the set of all those elements that belong to both A and B.
The intersection of A and B is denoted by A B (read as “A intersection B”)
Thus, A B = {x : x A and x B}.
Clearly, x A B x A and x B.
VENN DIAGRAMS
DISJOINT SETS
Two sets A and B are said to be disjoint, if A B = . If A B , then A and B are said to be non-intersecting or
non-overlapping sets.
In other words, if A and B have no element in common, then A and B are called disjoint sets.
Example : Sets {1, 2}; {3, 4} are disjoint sets.
VENN DIAGRAM
DIFFERENCE OF SETS
Let A and B be two sets. The difference of A and B written as A – B, is the set of all those elements of A which do not
belong to B.
Thus, A – B = {x : x A and x B}
or A – B = {x A : x B}
Clearly, x A – B x A and x B. In fig. the shaded part represents A – B.
Similarly, the difference B A is the set of all those elements of B that do not belong to A i.e.
B A {x B : x A}
Example: Consider the sets A {1, 2, 3} and B {3, 4 , 5} , then A B {1, 2}; B A {4 , 5}
As another example, R Q is the set of all irrational numbers.
SYMMETRIC DIFFERENCE OF TWO SETS
Let A and B be two sets. The symmetric difference of sets A and B is the set ( A B) (B A) and is denoted
by A B . Thus, A B = ( A B) (B A) {x : x A B}
VENN DIAGRAM VENN DIAGRAM
COMPLEMENT OF A SET
Let U be the universal set and let A be a set such that A U. Then, the complement of A with respect to U is denoted
by A or Ac or C(A) or U – A and is defined the set of all those elements of U which are not in A.
Thus, A = {x U : x A}.
Clearly, x A x A
Example: Consider U {1, 2,......, 10 } and A {1, 3, 5, 7, 9} .
Then A {2, 4 , 6, 8, 10 }
Example: Given the sets A {1, 2, 3}, B {3,4} , C = {4, 5, 6}, then A (B C) is
(a) {3} (b) {1, 2, 3, 4} (c) {1, 2, 4, 5} (d) {1, 2, 3, 4, 5, 6}
Solution: B C {4} , A (B C) = {1, 2, 3, 4}.
Example: If A B , then A B is equal to
(a) A (b) BA (c) B (d) None of these
Solution: Since A B A B B .
Example: If A and B are any two sets, then A ( A B) is equal to
Solution: A ( A B)c A ( A c B c ) = ( A A c ) ( A B c ) = ( A B c ) A B c .
1
Example: If the sets A and B are defined as A {(x , y ) : y , 0 x R} and B {(x , y ) : y x , x R} ,
x
then show that A B
1 1
Solution: Since y , y x meet when x x 2 1 , which does not give any real value of x
x x
Hence A B .
Example: Let A [x : x R,| x | 1]; B [x : x R,| x 1 | 1] and A B R D, then find the set D.
Solution: A [x : x R, 1 x 1]
B [x : x R : x 1 1 or x 1 1] = [x : x R : x 0 or x 2]
ABRD
Where D = [x : x R,1 x 2]
ADDITION THEOREMS ON SETS
If A, B and C are finite sets and U be the finite universal set, then
(1) n(A B) = n(A) + n(B) – n(A B)
(2) n(A B) = n(A) + n(B) A, B are disjoint non-void sets.
(3) n(A – B) = n(A) – n(A B) i.e. n(A – B) + n(A B) = n(A)
(4) n(A B C) = n(A) + n(B) + n(C) – n(A B) – n(B C) – n(A C) + n(A B C)
(5) n(A B) = n(A B) = n(U) – n(A B)
(6) n(A B) = n(A B) = n(U) – n(A B)
LAWS OF ALGEBRA OF SETS
Idempotent laws
For any set A, we have
(i) A A = A (ii) A A = A
Identity laws
For any set A, we have
(i) A = A (ii) A U = A
i.e. and U are identity elements for union and intersection respectively.
Commutative laws
For any two sets A and B, we have
(i) A B = B A (ii) A B = B A
i.e. union, intersection and symmetric difference of two sets are commutative.
(iii) AB BA (iv) A B B A
i.e., difference and cartesian product of two sets are not commutative
Associative laws
If A, B and C are any three sets, then
(i) (A B) C = A (B C) (ii) A (B C) = (A B) C (iii) ( AB)C A(BC)
i.e., difference and cartesian product of two sets are not associative.
Distributive law
If A, B and C are any three sets, then
(i) A (B C) = (A B) (A C) (ii) A (B C) = (A B) (A C)
i.e. union and intersection are distributive over intersection and union respectively.
De-Morgan’s law
If A and B are any two sets, then
(i) (A B) = A B (ii) (A B) = A B
(iii) A (B C) ( A B) ( A C) (iv) A (B C) ( A B) ( A C)
Example: If A and B are two sets such that n( A) 70 , n(B) 60 and n( A B) 110 , then n( A B) is equal to
(a) 240 (b) 50 (c) 40 (d) 20
Solution: n( A B) n( A) n(B) n( A B)
110 = 70 + 60 – n(A B)
n( A B) 130 110 20 .
Example: Let n(U) 700 , n( A) 200 , n(B) 300 and n( A B) 100 , then n( A c B c )
(a) 400 (b) 600 (c) 300 (d) 200
n( A B ) = n[(A B)c] = n(U) n( A B) = n(U) [n( A) n(B) n( A B)] = 700 – [200 + 300 – 100] = 300.
c c
Solution:
Example: In a town of 10,000 families it was found that 40% family buy newspaper A, 20% buy newspaper B and 10% families buy
newspaper C, 5% families buy A and B, 3% buy B and C and 4% buy A and C. If 2% families buy all the three newspapers,
Find the number of families which buy A only.
Solution: n(A) = 40% of 10,000 = 4,000
n(B) = 20% of 10,000 = 2,000
n(C) = 10% of 10,000 = 1,000
n (A B) = 5% of 10,000 = 500, n (B C) = 3% of 10,000 = 300
n(C A) = 4% of 10,000 = 400, n(A B C) = 2% of 10,000 = 200
We want to find n(A Bc Cc) = n[A (B C)c]
= n(A) – n[A (B C)] = n(A) – n[(A B) (A C)] = n(A) – [n(A B) + n(A C) – n(A B C)]
= 4000 – [500 + 400 – 200] = 4000 – 700 = 3300.
Example: In a city 20 percent of the population travels by car, 50 percent travels by bus and 10 percent travels by both car and bus.
Find the number of persons travelling by car or bus .
Solution: n(C) = 20, n(B) = 50, n(C B) = 10
Now, n(C B) = n(C) + n(B) – n(C B) = 20 + 50 – 10 = 60.
Hence, required number of persons = 60%.
Example: In a class of 55 students, the number of students studying different subjects are 23 in Mathematics, 24 in Physics, 19 in
Chemistry, 12 in Mathematics and Physics, 9 in Mathematics and Chemistry, 7 in Physics and Chemistry and 4 in all the
three subjects. Find the number of students who have taken exactly one subject.
Solution: n(M) = 23, n(P) = 24, n(C)= 19
n(M P) = 12, n(M C)= 9, n(P C)= 7
n(M P C) = 4
We have to find n(M P C), n(P M C ), n ( C M P )
Now n (M P C) = n[M (P C)]
= n(M)– n(M (P C)) n(M ) n[(M P) (M C)]
= n(M) – n(M P)– n(M C) + n(M P C) = 23 –12 – 9 + 4 = 27 –21 = 6
n(P M C) = n[P (M C)]
= n(P)– n[P (M C)] = n(P) n[(P M ) (P C)] = n(P) – n(P M) – n(P C) + n(P M C)
= 24 – 12 – 7 + 4 = 9
n(C M P) = n(C) – n(C P) – n(C M)+ n(C P M) = 19 – 7 – 9 + 4 = 23 – 16 = 7
Hence total number of students taking exactly one subject is 22
Solution: A – B = A Bc = A B .
FIITJEE
CHAPTER PRACTICE PROBLEMS-SETS
DESCRIPTION OF A SET
Q 1. Which of the following collections are sets?
(i) A collection of all natural numbers less than 50.
(ii) The collection of good hockey players in India.
(iii) The collection of all girls in your class.
(iv) The collection of most talented writers of India.
(v) The collection of difficult topics in mathematics.
(vi) The collection of all months of a year beginning with the letter J.
(vii) A collection of novels written by Munshi Prem Chand.
(viii) The collection of all questions in this chapter.
(ix) A collection of most dangerous animals of the world.
(x) The collection of prime integers.
Q 2. If A = {0,1,2,3,4,5,6, 7,8,9,10}, then insert the appropriate symbol or in each of the following blank spaces:
(i) 4.....A (ii) -4......A (iii) 12 ....A
(iv) 9 ....A (v) 0.....A (vi) -2.....A
4. {x N : x = 2n, n N)……………………………………….
5. {x R : x > x}……………………………………………
7. {x : x is a two digit number such that the sum of its digits is 8}……………………………………….
1. {P, R, I, N, C, A, L} ……………………………………….
2. {0}…………………………….. ……….
3. {1,2,3,6,9,18}……………………………………..
4. {-3,3}…………………………………
1 2 3 4 5 6 7 8 9
5. , , , , , , , , ………………………………………..
2 3 4 5 6 7 8 9 10
1 1 1 1
6. X = 1, , , , ,...... ………………………………………….
4 9 16 25
7. A = {x : x2 ≤ 10, x Z}………………………………………………
1
8. B = {x : x = , 1 ≤ n ≤ 5}………………………………………..
2n 1
1 9
9. C = {x : x is an integer, x } …………………………………………
2 2
1 2 3 4 5 6 7
10. , , , , , , ……………………………………………….
2 5 10 17 26 37 50
TYPES OF SETS
MATCH THE FOLLOWING SET WITH ITS APPROPRIATE TYPE
3. C = {x : x Z and x2 = 36}
9. {x N : x < 200}
ALGEBRA OF SETS
1. If A = {1, 2, 3, 4, 5}, B = {4, 5, 6, 7, 8}, C = {7, 8, 9, 10,11} and D = {10, 11, 12,13,14}, then write
(i) A B……………………………………
(ii) A C……………………………………
(iii) B C…………………………………..
(iv) B D……………………………………
(v) A B C………………………………….
(vi) A B D………………………………….
(vii) B C D…………………………………
(viii) A (B C)………………………………….
(ix) (A B) (B C)……………………………
(x) (A D) (B C)……………………………..
2. Let U = {1, 2, 3,4, 5, 6, 7, 8,9}, A = {1,2, 3, 4}, B = {2,4, 6, 8} and C = {3,4, 5, 6}. Find
(i) A'………………………………………...
(ii) B'……………………………………….
(iii) (A C)'……………………………….
(iv) (A B)'……………………………….
(v) (A')'……………………………………..
(vi) (B - C)'………………………………….
ANSWERS
ANSWERS-DESCRIPTION OF SETS
1. (i), (iii), (vi), (vii), (viii), (x) 2. (i) (ii) (iii) (iv) (v) (vi)
ANSWERS-ROASTER FORM
1. {a, b, c, d} 2. {1,2,3,4} 3. {11,13,17,19} 4. {2,4,6,8,...} 5. Empty set
6.{2,3,5} 7. {17,26,35,44,53,62,71,80} 8. {T,R,I,G,O,N,M,E,T,Y} 9. {B,E,T,R}
10. A = {-4, -3, -2, -1, 0, 1, 2, 3, 4}
ANSWERS-SET BUILDER FORM
1. {x : x is a letter of the word 'PRINCIPAL'.}
2. {x : x is an integer and x + 1 = 1}
4. {x :x is an integer and x2 - 9 = 0}
n
5. x : x , n N, n 9
n 1
1
6. X 2 : n N
n
7. A = {0,±1,±2, ±3}
1 1 1 1
8.B = 1, , , ,
3 5 7 9
9.C = {0,1, 2,3,4}
n
10. : n N, n 7
n 1
2
1. 200
2. 5
3. (i) 140 (ii) 90 (iii) 20
4. Incorrect
1
4. If Q x : x , where y N , then
y
2
(a) 0 Q (b) 1 Q (c) 2Q (d) Q
3
5. Which set is the subset of all given sets
(a) {1, 2, 3, 4,......} (b) {1} (c) {0} (d) {}
6. Let S {0, 1, 5, 4, 7} . Then the total number of subsets of S is
(a) 64 (b) 32 (c) 40 (d) 20
7. The number of non-empty subsets of the set {1, 2, 3, 4} is
(a) 15 (b) 14 (c) 16 (d) 17
8. If A {1, 2, 3, 4, 5}, then the number of proper subsets of A is
(a) 120 (b) 30 (c) 31 (d) 32
9. Let A {1, 2, 3, 4}, B {2, 3, 4, 5, 6} , then A B is equal to
(a) {2, 3, 4} (b) {1, 2, 3} (c) {5, 6} (d) {1}
10. The smallest set A such that A {1, 2} = {1, 2, 3, 5, 9} is
(a) {2, 3, 5} (b) {3, 5, 9} (c) {1, 2, 5, 9} (d) None of these
11. If A B = B, then
(a) AB (b) BA (c) A (d) B
12. For two sets A B A iff
(a) BA (b) AB (c) AB (d) AB
13. If A and B are two sets, then A B A B iff
(a) AB (b) BA (c) AB (d) None of these
14. Let A and B be two sets. Then
(a) A B A B (b) A B A B (c) A B = A B (d) None of these
C B
41. In a certain town 25% families own a phone and 15% own a car, 65% families own neither a phone nor a car. 2000 families own both a
car and a phone. Consider the following statements in this regard:
1. 10% families own both a car and a phone
2. 35% families own either a car or a phone
3. 40,000 families live in the town
Which of the above statements are correct ?
(a) 1 and 2 (b) 1 and 3 (c) 2 and 3 (d) 1, 2 and 3
42. Out of 800 boys in a school, 224 played cricket, 240 played hockey and 336 played basketball. Of the total, 64 played both basketball
and hockey; 80 played cricket and basketball and 40 played cricket and hockey; 24 played all the three games. The number of boys who
did not play any game is
(a) 128 (b) 216 (c) 240 (d) 160
43. A survey shows that 63% of the Americans like cheese whereas 76% like apples. If x% of the Americans like both cheese and apples, then
(a) x 39 (b) x 63 (c) 39 x 63 (d) None of these
44. 20 teachers of a school either teach mathematics or physics. 12 of them teach mathematics while 4 teach both the subjects. Then the
number of teachers teaching physics only is
(a) 12 (b) 8 (c) 16 (d) None of these
45. Of the members of three athletic teams in a school 21 are in the cricket team, 26 are in the hockey team and 29 are in the football team.
Among them, 14 play hockey and cricket, 15 play hockey and football, and 12 play football and cricket. Eight play all the three games.
The total number of members in the three athletic teams is
(a) 43 (b) 76 (c) 49 (d) None of these
46. In a class of 100 students, 55 students have passed in Mathematics and 67 students have passed in Physics. Then the number of students
who have passed in Physics only is
(a) 22 (b) 33 (c) 10 (d) 45
47. In a college of 300 students, every student reads 5 newspaper and every newspaper is read by 60 students. The no. of newspaper is
ANSWERS
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
d b c b d b a c a b b a c b b a a b a a
21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
a c d a c b b c a d a a a c c a c c b a
41 42 43 44 45 46 47 48 49 50
c d c b a d c b b d