Set Theory 32

CHAPTER

Summary of concepts
SET The symbol ‘|’ stands for the words ‘such that’. Sometimes,
we use the symbol ‘:’ in place of the symbol ‘|’.
A set is any collection of objects such that given an object, it is
possible to determine whether that object belongs to the given TYPES OF SETS
collection or not.
For example, the collection of all students of Delhi Univer- Empty Set or Null Set A set which has no element is called
sity, is a set, whereas, collection of all good books on mathemat- the null set or empty set. It is denoted by the symbol Φ.
ics, is not a set, since a mathematics book considered good by For example, each of the following is a null set :
one person might be considered bad or average by another. (a) The set of all real numbers whose square is – 1.
Notations The sets are usually denoted by capital letters A, (b) The set of all rational numbers whose square is 2.
(c) The set of all those integers that are both even and odd.
B, C, etc. and the members or elements of the set are denoted by
A set consisting of atleast one element is called a non-
lower-case letters a, b, c etc. If x is a member of the set A, we
empty set.
write x ∈ A (read as ‘x belongs to A’) and if x is not a member of
the set A, we write x ∉ A (read as ‘x does not belong to A’). If x Singleton Set A set having only one element is called sin-
and y both belong to A, we write x, y ∈ A. gleton set.
For example, {0} is a singleton set, whose only member
REPRESENTATION OF A SET is 0.

Usually, sets are represented in the following two ways : Finite and Infinite Set A set which has finite number of ele-
ments is called a finite set. Otherwise, it is called an finite set.
(i) Roster form or Tabular form For example, the set of all days in a week is a finite set
(ii) Set Builder form or Rule Method whereas, the set of all integers, denoted by { ..., – 2, – 1, 0, 1, 2,
...} or {x | x is an integer}, is an infinite set.
Roster Form An empty set φ which has no element, is a finite set.
The number of distinct elements in a finite set A is called
In this from, we list all the member of the set within braces (curly the cardinal number of the set A and it is denoted by n (A).
brackets) and separate these by commas.
For example, the set A of all odd natural numbers less that Equal Sets
10 in the roster from is written as:
A = {1, 3, 5, 7, 9} Two sets A and 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.
Note:
(i) In roster form, every element of the set is listed only Equivalent Sets
once.
Two finite sets A and B are said to be equivalent, if n (A) = n
(ii) The order in which the elements are listed is immaterial (B).
For example, each of the following sets denotes the same Clearly, equal sets are equivalent but equivalent sets need
set {1, 2, 3}, {3, 2, 1}, {1, 3, 2}. not be equal.
For example, the sets A = {4, 5, 3, 2} and B = {1, 6, 8, 9}
Set-Builder Form are equivalent but are not equal.
In this form, we write a variable (say x) representing any mem-
ber of the set followed by a property satisfied by each member Subset
of the set. Let A and B be two sets. If every elements of A is an element
For example, the set A of all prime numbers less than 10 in of B, then A is called a subset of B and we write A ⊆ B or B ⊇ A
the set-builder form is written as (read as ‘A is contained in B’ or B contains A’). B is called su-
A = {x | x is a prime number less that 10} perset of A.
 Notes: For example , if A = {1, 2, 3, 4, 5} and B = {1, 3, 5, 7, 9},
1114

(i) If A ⊆ B and A ≠ B, we write A ⊂ B or B ⊃ A (read as : then A – B = {2, 4} and B – A = {7, 9}.
A is a proper subset of B or B is a proper superset of A).
Objective Mathematics

(ii) Every set is a subset and a superset of itself. Important Results

(iii) If A is not a subset of B, we write A ⊄ B.
(a) A – B ≠ B – A
(iv) The empty set is the subset of every set.
(b) The sets A – B, B – A and A ∩ B are disjoint sets
(v) If A is a set with n (A) = m, then the number of subsets of
(c) A – B ⊆ A and B – A ⊆ B
A are 2m and the number of proper subsets of A are 2m–1.
(d) A – φ = A and A – A = φ
For example, let A = {3, 4}, then the subsets of A are φ,
{3}, {4}, {3, 4}. Here, n (A) = 2 and number of subsets of A = Symmetric Difference of Two Sets
22 = 4.
The symmetric difference of two sets A and B, denoted by
Also, {3} ⊂ {3, 4} and {2, 3} ⊄ {3, 4}
A ∆ B, is defined as
A ∆ B = (A – B) ∪ (B – A).
Power Set
For example, if A = {1, 2, 3, 4, 5} and B = {1, 3, 5, 7, 9} then
The set of all subsets of a given set A is called the power set of A A ∆ B = (A – B) ∪ (B – A) = {2, 4} ∪ {7, 9} = {2, 4, 7, 9}.
and is denoted by P(A).
For example, if A = {1, 2, 3}, then
Complement of a Set
P (A) = {φ, {1}, {2}, {3}, {1, 2} {1, 3}, {2, 3}, {1, 2, 3}}
Clearly, if A has n elements, then its power set P (A) contains If U is a universal set and A is a subset of U, then the comple-
exactly 2n elements. ment of A is the set which contains those elements of U, which
are not contained in A and is denoted by A′ or Ac. Thus,
OPERATIONS ON SETS A′ = {x : x ∈ U and x ∉ A}
For example, if U = {1, 2, 3, 4, ...} and A = {2, 4, 6, 8, ...},
Union of Two Sets
then, A′ = {1, 3, 5, 7, ...}
The union of two sets A and B, written as A ∪ B (read as ‘A
union B’), is the set consisting of all the elements which are ei- Important Results
ther in A or in B or in both. Thus,
A ∪ B = {x : x ∈ A or x ∈ B} (a) U ′ = φ (b) φ ′ = U
Clearly, x ∈ A ∪ B ⇒ x ∈ A or x ∈ B, and (c) A ∪ A ′ = U (d) A ∩ A ′ = φ.
x ∉ A ∪ B ⇒ x ∉ A and x ∉ B.
For example, if A = {a, b, c d} and B = {c, d, e, f }, ALGEBRA OF SETS
then A ∪ B = {a, b, c, d, e, f}
1. Idempotent Laws For any set A, we have
Intersection of Two Sets (a) A ∪ A = A (b) A ∩ A = A
The intersection of two sets A and B, written as A ∩ B (read as 2. Identity Laws For any set A, we have
‘A intersection B’) is the set consisting of all the common ele- (a) A ∪ φ = A (b) A ∩ φ = φ
ments of A and B. Thus, (c) A ∪ U = U (d) A ∩ U = A
A ∩ B = {x : x ∈ A and x ∈ B}
3. Commutative Laws For any two sets A and B, we
Clearly, x ∈ A ∩ B ⇒ x ∈ A and x ∈ B, and
have
x ∉ A ∩ B ⇒ x ∉ A or x ∉ B.
For example, if A = {a, b, c, d} and B = {c, d, e, f}, then (a) A ∪ B = B ∪ A (b) A ∩ B = B ∩ A
A ∩ B = {c, d}. 4. Associative Laws For any three sets A, B and C,
we have
Disjoint Sets (a) A ∪ (B ∪ C) = (A ∪ B) ∪ C
Two sets A and B are said to be disjoint, if A ∩ B = φ, i.e., A and (b) A ∩ (B ∩ C) = (A ∩ B) ∩ C
B have no element in common. 5. Distributive Laws For any three sets A, B and C,
For example, if A = {1, 2, 5} and B = {2, 4, 6}, then we have
A ∩ B = φ, so A and B are disjoint sets. (a) A ∪ (B ∩ C) = (A ∪ B) ∩ ( A ∪ C)
(b) A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
Difference of Two Sets
6. For any two sets A and B, we have
If A and B are two sets, then their difference A – B is defined
(a) P (A) ∩ P (B) = P (A ∩ B)
as:
(b) P (A) ∪ P (B) ⊆ P (A ∪ B), where P (A) is the power
A – B = {x : x ∈ A and x ∉ B}. set of A.
Similarly, B – A = {x : x ∈ B and x ∉ A}. 7. If A is any set, we have (A′ ) ′ = A.
 8. Demorgan’s Laws For any three sets A, B and C,

1115
we have Some Useful Results on Cartesian Product
If A, B, C are three sets, then
(a) (A ∪ B)′ = A′ ∩ B′
(i) A × (B ∪ C) = (A × B) ∪ (A × C)

Set Theory
(b) (A ∩ B)′ = A′ ∪ B′
(c) A – (B ∪ C) = (A – B) ∩ (A – C) (ii) A × (B ∩ C) = (A × B) ∩ (A × C)
(d) A – (B ∩ C) = (A – B) ∪ (A – C). (iii) A × (B – C) = (A × B) – (A × C)
(iv) (A × B) ∩ (S × T) = (A ∩ S) × (B ∩ T),
where S and T are two sets.
Important Results on Operations on Sets
(v) If A ⊆ B, then (A × C) ⊆ (B × C)
(i) A ⊆ A ∪ B, B ⊆ A ∪ B, A ∩ B ⊆ A, A ∩ B ⊆ B
(vi) If A ⊆ B, then (A × B) ∩ (B × A) = A2
(ii) A – B = A ∩ B′
(iii) (A – B) ∪ B = A ∪ B (vii) If A ⊆ B and C ⊆ D then A × C ⊆ B × D
(iv) (A – B) ∩ B = φ (viii) If A ⊆ B, then A × A ⊆ (A × B) ∩ (B × A)
(v) A ⊆ B ⇔ B′ ⊆ A′ (ix) If A and B are two non-empty sets having n elements in com-
mon, then A × B and B × A have n2 elements in common.
(vi) A – B = B′ – A′
(x) A × B = B × A if and only if A = B
(vii) (A ∪ B) ∩ (A ∪ B′ ) = A
(xi) A × (B ′ ∪ C ′ ) ′ = (A × B) ∩ (A × C)
(viii) A ∪ B = (A – B) ∪ (B – A) ∪ (A ∩ B)
(xii) A × (B ′ ∩ C ′ ) ′ = (A × B) ∪ (A × C)
(ix) A – (A – B) = A ∩ B
(x) A–B=B–A⇔A=B
(xi) A∪B=A∩B⇔A=B
reLatIonS
(xii) A ∩ (B ∆ C) = (A ∩ B) ∆ (A ∩ C) Let A, B be any two non-empty sets, then every subset of A × B
defines a relation from A to B and every relation from A to B is
a subset of A × B.
Some Basis Results about Cardinal Number If R is a relation from A to B and if (a, b) ∈ R, then we write
If A, B and C are finite sets and U be the finite universal set, then a R b and say that ‘a is related to b’ and if (a, b) ∉ R, then we
(i) n (A′ ) = n (U) – n (A)
write a R b and say that a is not related to b.
(ii) n (A ∪ B) = n (A) + n (B) – n ( A ∩ B)
(iii) n (A ∪ B) = n (A) + n (B), where A and B are disjoint non-empty
sets
Important Results
(iv) n (A ∩ B′ ) = n (A) – n (A ∩ B) (a) Every subset of A × A is said to be a relation on A.
(v) n (A ′ ∩ B ′) = n (A ∪ B) ′ = n (U) – n (A ∪ B) (b) If A has m elements and B has n elements, then A × B has mn ele-
ments and total number of different relations from A to B is 2mn.
(vi) n (A ′ ∪ B ′) = n (A ∩ B) ′ = n (U) – n (A ∩ B)
(vii) n (A – B) = n (A) – n (A ∩ B) (c) Let R be a relation from A to B, i.e., R ⊆ A × B, then
(viii) n (A ∩ B) = n (A ∪ B) – n (A ∩ B ′ ) – n (A ′ ∩ B) Domain of R = {a : a ∈ A, (a, b) ∈ R for a some b ∈ B}
(ix) n (A ∪ B ∪ C) = n (A) + n (B) + n (C) – n (A ∩ B) Range of R = {b : b ∈ B, (a, b) ∈ R for some a ∈ A}
– n (B ∩ C) – n (C ∩ A) + n (A ∩ B ∩ C) For example, let A = {1, 3, 4, 5, 7}, B = {2, 4, 6, 8} and R be the
(x) If A1, A2, A3, ... An are disjoint sets, then relation ‘is one less than’ from A to B, then
n (A1 ∪ A2 ∪ A3 ∪ ...∪ An) R = {(1, 2), (3, 4), (5, 6), (7, 8)}.
= n (A1) + n (A2) + n (A3) + ... + n (An) Here, domain of R = {1, 3, 5, 7} and range of R = {2, 4, 6, 8}.
(xi) n (A ∆ B) = number of elements which belong to exactly one of
A or B Identity relation
R is an identity relation if (a, b) ∈ R iff a = b, a ∈ A, b ∈ A. In
carteSIan proDuct of tWo SetS
other words, every element of A is related to only itself.
If A and B are any two non-empty sets, then cartesian product of
A and B is defined as universal relation
A × B = {(a, b) : a ∈ A and b ∈ B}
Let A be any set and R be the set A × A, then R is called the
Notes: Universal Relation in A.
(i) If A = φ or B = φ, then we define A × B = φ.
(ii) A × B ≠ B × A Void universal relation
(iii) If A has n elements and B has m elements then A × B has φ is called Void Relation in a set.
mn elements.
(iv) If A1, A2, ..., Ap are p non-empty sets, then their carte-
p Inverse relation
sian product, is defined as ∏ Ai = {(a1, a2, a3, ...ap);
i =1
Let R ⊆ A × B be a relation from A to B. Then R– 1 ⊆ B × A is
ai ∈ Ai for all i} defined by
 R– 1 = {(b, a) : (a, b) ∈ R} (ii) a R b ⇒ b R a, ∨ a, b ∈ A and
1116

Thus, (a, b) ∈ R ⇔ (b, a) ∈ R , ∨ a ∈ A, b ∈ B.

–1 (iii) a R b, b R c ⇒ a R c, ∨ a, b, c ∈ A.
For example, let I be the set of all integers, m be a positive
Notes:
integer. Then the relation, R on I is defined by
Objective Mathematics

(i) dom (R– 1) = range (R) and range (R– 1) = dom (R) R = {(x, y) : x, y ∈ I, x – y is divisible by m}.
(ii) (R– 1)– 1 = R. For example, if R = {(1, 2), (3, 4), (5, 6)} Consider any x, y, z ∈ I.
then R–1 = {(2, 1), (4, 3), (6, 5)} (i) Since x – x = 0 = 0 . m ⇒ x – x is divisible by m
and (R–1)–1 = {(1, 2), (3, 4), (5, 6) = R. ⇒ (x, x) ∈ R ⇒ R is reflexive.
dom (R) = {1, 3, 5}, range (R) = {2, 4, 6} (ii) Let (x, y) ∈ R ⇒ x – y is divisible by m
⇒ x – y = mq, for some q ∈ I
and dom (R– 1) = {2, 4, 6}, range (R– 1) = {1, 3, 5}
⇒ y – x = m (– q)
So, dom (R– 1) = range (R) and range (R– 1) = dom (R). ⇒ y – x is divisible by m
⇒ ( y, x) ∈ R
TYPES OF RELATIONS ON A SET Thus, (x, y) ∈ R ⇒ ( y, x) ∈ R ⇒ R is symmetric.
(iii) Let (x, y) ∈ R and ( y, z) ∈ R
Let A be a non-empty set, then a relation R on A is said to be :
⇒ x – y is divisible by m and y – z is divisible by m
(a) Reflexive If a R a, ∨ a ∈ A, i.e., if ⇒ x ­– y = mq and y – z = mq ′ for some q, q ′ ∈ I
(a, a) ∈ R, ∨ a ∈ A ⇒ (x – y) + ( y – z) = m (q + q ′ )
⇒ x – z = m (q + q ′ ), q + q ′ ∈ I
(b) Symmetric If a R b ⇒ b R a, ∨ a, b ∈ A, i.e., if ⇒ (x, z) ∈ R
(a, b) ∈ R ⇒ (b, a) ∈ R, ∨ a, b ∈ A Thus, (x, y) ∈ R and ( y, z) ∈ R ⇒ (x, z) ∈ R, so R is transi-
tive.
(c) Anti-Symmetric If a R b and b R a ⇒ a = b, ∨ a,
Hence the relation R is reflexive, symmetric and transitive
b∈A
and it is also an equivalence relation.
(d) Transitive If a R b and b R c Note: It is important to note that every identity relation is reflex-
⇒ a R C, ∨ a, b, c ∈ A ive but every reflexive relation need not be an identity relation.
Also, identity relation is reflexive symmetric and transitive.
i.e., (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R, ∨ a, b, c ∈ A

EQUIVALENCE RELATION CONGRUENCE  MODULO m

Let m be a positive integer and x, y ∈ I, then x is said to be
A relation R on a non-empty set A is called an equivalence rela-
congruent to y modulo m, written as x ≡ y (mod m), iff x – y is
tion if and only if it is
divisible by m.
(i) reflexive (ii) symmetric and (iii) transitive. That For example, 155 ≡ 7 (mod 4) as
is, R satisfies following properties:
155 − 7 148
(i) a R a, ∨ a ∈ A = = 37 (integer).
4 4

mULTIPLE CHOICE QUESTIONS

Choose the correct alternative in each of the following problems:

1. X and Y are two sets such that n (X) = 17, n (Y) = 23, 4. If n (U) = 700, n (A) = 200, n (B) = 300, n (A ∩ B) =
n (X ∪ Y) = 38 then n (X ∩ Y) is 100, then n (A ′ ∩ B ′ ) is equal to
(a) 4 (b) 2 (a) 400 (b) 240
(c) 6 (d) None of these (c) 300 (d) None of these
2. If A and B are two sets such that A has 12 elements, 5. If S and T are two sets such that S has 21 elements,
B has 17 elements and A ∪ B has 21 elements, then T has 32 elements, and S ∩ T has 11 elements, then
number of elements in A ∩ B are number of elements S ∪ T has
(a) 6 (b) 4 (a) 42 (b) 50
(c) 8 (d) None of these (c) 48 (d) None of these
3. If X and Y are two sets such that X ∪ Y has 18 elements, 6. X and Y are two sets such that X has 40 elements, X ∪
X has 8 elements and Y has 15 elements; then number Y has 60 elements and X ∩ Y has 10 elements, then
of elements in X ∩ Y are number of elements Y has
(a) 5 (b) 8 (a) 58 (b) 40
(c) 6 (d) None of these (c) 30 (d) None of these
 7. In a committee 50 people speak French, 20 speak Spanish (a) φ, {4, –4} (b) {3, –3}, φ

1117
and 10 speak both Spanish and French. The number of (c) φ, {3, –3} (d) {4, –4}, φ
persons speaking at least one of these two languages 18. Let ρ be the relation on the set R of all real numbers

Set Theory
is 1
defined by setting a ρ b iff | a − b | ≤ . Then, ρ is
(a) 60 (b) 40 2
(c) 38 (d) None of these
(a) reflexive and symmetric but not transitive
8. In a group of 70 people, 37 like coffee, 52 like tea and (b) symmetric and transitive but not reflexive
each person like atleast one of the two drinks. The (c) transitive but neither reflexive nor symmetric
number of persons liking both coffee and tea is (d) none of these
(a) 16 (b) 13 19. In a statistical investigation of 1,003 families of Calcutta,
(c) 19 (d) None of these it was found that 63 families had neither a radio nor a
9. Which of the following is the empty set? T.V, 794 families had a radio and 187 had a T.V. The
(a) {x / x is a real number and x2 – 1 = 0} number of families in that group having both a radio
(b) {x / x is a real number and x2 + 1 = 0} and a T.V is
(c) {x / x is a real number and x2 – 9 = 0} (a) 36 (b) 41
(d) {x / x is a real number and x2 = x + 2} (c) 32 (d) None of these
10. In a group of 65 people, 40 like cricket, 10 like both 20. In a city, three daily newspapers A, B, C are published.
cricket and tennis. The number of persons liking tennis 42% of the people in that city read A, 51% read B and
only and not cricket is 68% read C. 30% read A and B; 28% read B and C;
(a) 21 (b) 25 36% read A and C; 8% do not read any of the three
(c) 15 (d) None of these newspapers. The percentage of persons who read all the
three papers is
11. In a group of 1000 people, there are 750 people who can
speak Hindi and 400 who can speak English. Then (a) 25% (b) 18%
number of persons who can speak Hindi only is (c) 20% (d) None of these
(a) 300 (b) 400 21. If A = {1, 3, 5, 7, 9, 11, 13, 15, 17}, B = {2, 4, ...., 18}
(c) 600 (d) None of these and N is the universal set, then A′ ∪ ((A ∪ B) ∩ B′)
is
12. If the sets A and B are given by A = {1, 2, 3, 4, },
B = {2, 4, 6, 8, 10} and the universal set (a) A (b) N
(c) B (d) none of these
U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, then
22. The composite mapping fog of the maps f : R → R, f(x)
(a) (A ∪ B) ′ = {5, 7, 9} = sinx; g : R → R, g(x) = x2 is
(b) (A ∩ B) ′ = {1, 3, 5, 6, 7}
(c) (A ∩ B) ′ = {1, 3, 5, 6, 7, 8, 9, 10} (a) sinx + x2 (b) (sinx)2
(d) None of these sin x
(c) sinx2 (d)
13. If A = {1, 2, 3, 4}, B = {2, 3, 5, 6} and C = {3, 4, 6, 7}, x2
then 23. If X and Y are two sets, then x ∩ (Y ∪ X)′ equals
(a) A – (B ∩ C) = {1, 3, 4} (a) X (b) Y
(b) A – (B ∩ C) = {1, 2, 4} (c) φ (d) None of these
(c) A – (B ∪ C) = {2, 3} 24. If X = {8n – 7 n – 1/n ∈ N} and Y = {49 (n – 1) /n ∈
(d) A – (B ∪ C) ={1}. N}, then
14. If X and Y are two sets and X ′ denotes the complement (a) X ⊂ Y (b) Y ⊂ X
of X, then X ∩ (X ∪ Y) ′ equals (c) X = Y (d) None of these
(a) X (b) Y 25. Suppose A1, A2,... A30 are thirty sets, each with five ele-
(c) φ (d) None of these ments and B1, B2, ... , Bn are n sets each with three
15. Let A = {2, 3, 4} and X = {0, 1, 2, 3, 4}, then which 30 n

of the following statements is correct

elements Let A =  B
i =1
i
j =1
j
=S

(a) {0} ∈ A ′ in X (b) φ ∈ A ′ w.r.t. X If each elements of S belongs to exactly ten of the A i ’s and
(c) {0} ⊂ A ′ w.r.t X (d) 0 ⊂ A ′ w.r.t X. exactly nine of the Bj’s then n =
16. If n (U) = 60, n (A) = 35, n (B) = 24 and n (A ∪ B) ′ (a) 45 (b) 35
= 10 then n (A ∩ B) is (c) 40 (d) None of these
(a) 9 (b) 8 26. Let A = {x : x is a multiple of 3} and B = {x : x is a
(c) 6 (d) None of these multiple of 5}. Then A ∩ B is given by
17. If f : R → R, defined by f(x) = x2 + 1, then the values (a) {3, 6, 9...} (b) {5, 10, 15, 20, ...}
of f–1(17) and f–1(–3) respectively are (c) {15, 30, 45,...} (d) None of these
 27. If R be a relation < from A = {1, 2, 3, 4} to B = {1, 3, 5} (a) surjective but not injective
1118

i.e., (a, b) ∈ R iff a < b, then RoR–1 is (b) injective but not surjective
(c) bijective
(a) {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)}
(d) neither surjective nor injective
Objective Mathematics

(b) {(3, 1), (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)}
38. Let n be a fixed positive integer. Let a relations R be
(c) {(3, 3), (3, 5), (5, 3), (5, 5)}
defined on I (the set of all integers) as follows : a R b
(d) {(3, 3), (3, 4), (4, 5)
iff n/(a – b), that is iff a – b is divisible by n. Then,
28. If Y ∪ {1, 2} = {1, 2, 3, 5, 9}, then the relation R is
(a) The smallest set of Y is {3, 5, 9} (a) reflexive only (b) symmetric only
(b) The smallest set of Y is {2, 3, 5, 9} (c) transitive only (d) an equivalence relation.
(c) The largest set of Y is {1, 2, 3, 4, 9} 39. Let R be a relation defined as a R b iff | a – b | > 0. Then ,
(d) The largest set of Y is {2, 3, 4, 9}. the relation R is
29. Two finite sets have m and n elements. The total number of (a) reflexive (b) symmetric
subsets of the first set is 56 more than the total number (c) transitive (d) None of these
of subsets of second set. The value of m and n are 40. Let R be a relation defined as a R b iff 1 + ab > 0. Then,
(a) 7, 6 (b) 6, 3 the relation R is
(c) 5, 1 (d) 8, 7 (a) Reflexive (b) symmetric
30. If A = {1, 2, 3}, B = {a, b}, then A × B mapped on A (c) transitive (d) None of these
to B is 41. Let R be a relation defined as a R b if | a | ≤ b. Then,
(a) {(1, a), (2, b), (3, b)} relation R is
(b) {(1, b), (2, a)} (a) reflexive (b) symmetric
(c) {(1, a), (1, b), (2, a), (2, b), (3, a), (3, b)} (c) transitive (d) None of these
(d) {(1, a), (2, a), (2, b), (3, b)}
42. N is the set of natural numbers. The relation R is defined
31. The solution of 3x2 – 12x = 0 when on N × N as follows (a, b) R (c, d) ⇔ a + d = b + c.
(a) x ∈ N is {4} Then, R is
(b) x ∈ I is {0, 4} (a) reflexive only (b) symmetric only
(c) x ∈ S = {a + ib : b ≠ 0, a, b ∈ R} is φ (c) transitive only (d) an equivalence relation
(d) all of these
43. Let R be a relation defined on the set of natural num-
32. If A = {1, 2, 3}, B = {3, 4} and C = {4, 5, 6} then bers N as
(A × B) ∩ (B × C) is equal to R = {(x, y) : x ∈ N, y ∈ N, 2x + y = 41}. Then
(a) {(3, 4)} (b) {(1, 4), (3, 4)} (a) Domain of R = {1, 2, 3, ..., 19, 20}
(c) {(1, 4), (2, 3)} (d) None of these (b) Range of R = {39, 37, 35, 9, 7, 5, 3, 1}
33. If A has 3 elements and B has 6 elements, then the (c) R is reflexive
minimum number of elements in the set A ∪ B is (d) R is symmetric.
(a) 6 (b) 3 44. n/m means that n is a factor of m, then the relation ‘/’
(c) φ (d) None of these is
34. If a N = {ax : x ∈ N}, then 3N ∩ 7N = (a) reflexive and symmetric
(b) transitive and reflexive
(a) 3N (b) 7N (c) reflexive, transitive and symmetric
(c) N (d) 21 N (d) reflexive, transitive and not symmetric.
35. Let R be a relation defined as: 45. Let A = {x : x ∈ R, | x | < 1},
aRb iff b is divisible by a where a and b are natural B = {x : x ∈ R, | x – 1 | ≥ 1}
numbers. and A ∪ B = R – D, then the set D is
α R β iff α is perpendicular to β where α, β are straight
lines in a plane, then the relation R is (a) {x : 1 < x ≤ 2} (b) {x : 1 ≤ x < 2}
(c) {x : 1 ≤ x ≤ 2} (d) None of these
(a) reflexive (b) symmetric
(c) transitive (d) None of these 46. Consider the set of all determinants of order 3 with en-
tries 0 or 1 only. Let B be subset of A consisting of
36. The function f : N → N (N is set of natural numbers) all determinants with value 1. Let C be the subset of
defined by f(n) = 2n + 3 is the set of all determinants with value – 1. Then
(a) surjective (b) not surjective (a) C is empty
(c) injective (d) none of these (b) B has as many elements as C
37. Let R be the set of real numbers, If f : R → R is defined (c) A=B∪C
by f(x) = ex, then f is (d) B has twice as many elements as C.
47. If R and R ′ are symmetric relations (not disjoint) on a 57. In a certain town 25% families own a phone and 15%

1119
set A, then the relation R ∩ R ′ is own a car, 65% families own neither a phone nor a car.
(a) reflexive (b) symmetric 2000 families own both a car and a phone. Consider

Set Theory
the following statements in this regard :
(c) transitive (d) None of these
1. 10% families own both a car and a phone.
48. (i) Let R be the relation on the set R of all real numbers
2. 35% families own either a car or a phone.
1
defined by setting a R b iff | a – b | ≤ . Then R is 3. 40,000 families live in the town.
2 Which of the above statements are correct ?
(a) reflexive and symmetric but not transitive, (a) 1 and 2 (b) 1 and 3
(b) symmetric and transitive but not reflexive, (c) 2 and 3 (d) 1, 2 and 3
(c) transitive but neither reflexive nor symmetric,
(d) None of these 58. Let R be the relation on the set R of all real numbers
defined by a R b iff | a – b | ≤ 1. Then R is
49. If sets A and B are defined as
(a) reflexive (b) symmetric
A = {(x, y) : y = ex, x ∈ R} (c) transitive (d) anti-symmetric
B = {(x, y) : y = x, x ∈ R} then
59. If the set A has p elements, B has q elements, then the
(a) B ⊂ A (b) A ⊂ B number of elements in A × B is
(c) A ∩ B = φ (d) A ∪ B = A
(a) p + q + 1 (b) pq
50. If n (U) = 700, n (A) = 200, n (B) = 300, n (A ∩ B) = (c) p2 (d) p + q
100, then n (A ′ ∩ B ′ ) =
60. If A and B are any two sets, then A ∪ (A ∩ B) is equal
(a) 300 (b) 350 to
(c) 400 (d) None of these
(a) B c (b) Ac
51. Assume R and S (non-empty) relations in a set A. Which (c) B (d) A
of the relations given below is false ?
61. Set A and B have 3 and 6 elements respectively. What
(a) If R and S are transitive, then R ∪ S is transitive, can be the minimum number of elements in A ∪ B ?
(b) If R and S are transitive, then R ∩ S is transitive
(a) 18 (b) 9
(c) If R and S are symmetric, then R ∪ S is symmetric
(c) 6 (d) 3
(d) If R and S are reflexive, then R ∩ S is reflexive
62. The set A = {x : x ∈ R, x2 = 16. and 2x = 6} equals
52. If R is a relation ‘<’ from A = {1, 2, 3, 4} to B = {1, 3, 5}
i.e., (a, b) ∈ R iff a < b, then R o R– 1 is (a) φ (b) {14, 3, 4}
(c) {3} (d) {4}
(a) {(1, 2), (1, 5), (2, 3) (2, 5) (3, 5), (4, 5)}
(b) {(3, 1), (5, 1), (5, 2), (5, 3), (5, 4)} 63. With reference to a universal set, the inclusion of a subset
in another, is relation which is
(c) {(3, 3), (3, 5), (5, 3), (5, 5)}
(d) {(3, 3), (3, 4), (4, 5)} (a) Symmetric only
(b) equivalence
53. If the sets A and B are defined as (c) reflexive only
1 (d) None of these
A = {(x, y) : y = , 0 ≠ x ∈ R}
x 64. If P, Q and R are subsets of a set A, then R × (Pc ∪ Qc)c
B = {(x, y) : y = – x, x ∈ R}, then equals
(a) A ∩ B = A (b) A ∩ B = B (a) (R × P) ∩ (R × Q) (b) (R × Q) ∩ (R × P)
(c) A ∩ B = φ (d) None of these (c) (R × P) ∪ (R × Q) (d) None of these
54. If X = {8n – 7n – 1 : n ∈ N} and Y = {49 (n – 1): n ∈ 65. A = {x : x ≠ x} represents
N}, then (a) {x} (b) {1}
(a) X ⊆ Y (b) Y ⊆ X (c) {} (d) {0}
(c) X = Y (d) None of these 66. Let A = {a, b, c}, B = {b, c, d}, C = {a, b, d, e,}, then
55. The set of intelligent students in a class is A ∩ (B ∪ C)
(a) (c) (b) {a, b, c}
(a) a null set
(c) {b, c, d} (d) {a, b, d, e}.
(b) a singleton set
(c) a finite set 67. Given the sets A = {1, 2, 3}, B = {3, 4}, C =
(d) not a well defined collection. {4, 5, 6}, then [A ∪ (B ∩ C)] is
56. The number of non-empty subsets of the set {1, 2, 3, 4} (a) {1, 2, 3, 4, 5, 6} (b) {1, 2, 4, 5}
is (c) {1, 2, 3, 4} (d) {3}
(a) 15 (b) 14 68. If R and R′ are symmetric relations (not disjoint) on a
(c) 16 (d) 17 set A, then the relation R ∩ R′ is
 (a) reflexive 76. In a class 100 students, 55 students have passed in Math-
1120

(b) symmetric ematics and 67 students have passed in Physics. Then

(c) transitive the number of students who have passed in Physics only
(d) none of these is
Objective Mathematics

69. Two finite sets have m and n elements, then total number (a) 33 (b) 22
of subsets of the first set is 56 more that the total number (c) 45 (d) 10
of subsets of the second. The values of m and n are, 77. Let A and B be two sets, then (A ∪ B)′ ∪ (A′ ∩ B) is
(a) 7, 6 (b) 6, 3 equal to
(d) 5, 1 (d) 8, 7 (a)  A′ (b)  A
70. The relation ‘less than’ in the set of natural numbers is (c)  B′ (d)  None of these
(a) only symmetric (b) only transitive 78. A survey shows that 63% of the Americans like cheese
(c) only reflexive (d) equivalence relation whereas 76% like apples. If x% of the Americans like
71. Let A and B two non-empty subsets of a set X such that both cheese and apples, then
A is not a subset of B then (a)  x = 39
(a) A is subset of the complement of B (b)  x = 63
(b) B is a subset of A (c)  39 ≤ x ≤ 63
(c) A and B are disjoint (d)  None of these
(d) A and the complement of B are non-disjoint 79. Let R be the real line. Consider the following subsets of
72. Let S = {1, 2, 3, 4, 5} and let A = S × S. Define the the plane R × R
relation R on A as follows ‘‘(a, b) R (c, d) if and only S = {(x, y) : y = x + 1 and 0 < x < 2}
if ad = cd. Then, R is T = {(x, y) : x – y is an integer}. Which one of the following
(a) reflexive only (b) symmetric only is true?
(c) transitive only (d) equivalence relation (a)  Neither S nor T is an equivalence relation on R
73. If aN = {ax : x ∈ N} and bN ∩ cN = dN, where b, c ∈ (b)  Both S and T are equivalence relations on R
N are relatively prime, then (c)  S is an equivalence relation on R but T is not
(d)  T is an equivalence relation on R but S is not
(a) c = bd (b) b = cd
(c) d = bc (d) None of these 80. The set A = {x |x is a real no. x2 = 16 and 2x = 6} equal
to
74. If A, B and C are non-empty subsets of a set, then
(A – B) ∪ (B – A) equals (a)  {4} (b)  {3}
(c)  φ (d)  None of these
(a) (A ∩ B) ∪ (A ∪ B)
(b) (A ∪ B) – (A ∩ B) 2
81. The sets S1, S 2, S3,… are given by S1 =   ,
(c) A – (A ∩ B) 1 
(d) (A ∪ B) – B
S2 =  ,  , s3 =  , ,  ,
3 5 4 7 10
75. Out of 800 bys in a school, 224 played cricket, 240
played hockey and 336 played basketball. Of the total, 2 2 3 3 3 

S4 =  , , , , … .
64 played both basketball and hockey; 80 played cricket 5 9 13 17
and basketball and 40 played cricket and hockey; 24
4 4 4 4 
played all the three games. The number of boys who
did not play any game is Then the sum of the numbers in the set S25 is

(a) 160 (b) 240 (a)  320 (b)  322

(c) 216 (d) 128 (c)  324 (d)  326

SOLUTIONS

1. (b) We have, n (X) = 1 7, n (Y) = 23, ⇒ 21 = 12 + 17 – n (A ∩ B)

n (X ∪ Y) = 38, n (X ∩ Y) = ? ⇒ n (A ∩ B) = 29 – 21 = 8.
Now n (X ∪ Y) = n (X) + n (Y) – n (X ∩ Y) 3. (a) We have, n (X ∪ Y) = 18, n (X) = 8, n (Y) = 15
⇒ 38 = 17 + 23 – n (X ∩ Y) n (X ∩ Y) = ?
⇒ n (X ∩ Y) = 17 + 23 – 38 = 2. Using n (X ∪ Y) = n (X ) + n (Y) – n (X ∩ Y)
2. (c) Here n (A) = 12, n (B) = 17, n (A ∪ B) = 21 ∴ 18 = 8 + 15 – n (X ∩ Y)
⇒ n (X ∩ Y) = 8 + 15 – 18 = 5
Using n (A ∪ B) = n (A) + n (B) – n (A ∩ B) ∴ X ∩ Y has 5 elements.