Professional Documents
Culture Documents
Set
A set is a collection of well defined objects. The objects of a set are called the members
or elements of the set and their membership is defined by the certain conditions. The
elements of the set can be anything pencil, apple, rubber, Sun etc.
Suppose, S be the set i.e., a collection of objects and x is an object which belongs to S
i.e., member of S, then we will write x S. We can also write S = { x : Q( x )}. It means S is
the set of objects for which the statement Q( x ) involving x is true.
Syllabus
Elementary Set Theory
Finite Countable and
Uncountable Sets
Real Number System as a
Complete Ordered Field
Archimedean Property
(b) Elements of the set are denoted by the small letters a, b, c, p, q, x, y etc.
(c) If x is not the member of the set S, then it is written as x S and read as x
does not belong to S.
Supremum, Infimum
Subsets
If every element of a set A is also an element of a set B, then A is called a subset of B and
it is denoted by A B.
Superset
If A is a subset of B means A is contained in B, we can also say that B contains A or B is
superset of A, it can be written as B A.
Equality of Sets
If two sets A and B are equal, then symbollically it is written as A = B. If every element of
A belongs to B and every element of B belongs to A. i.e., A = B if and only if
x A x B or A B, B A A = B
Proper Set
If every element of the set A is an element of the set B and B contains atleast one element
which does not belong to A, i.e., if A B and A B, then we can say that A is proper
subset of B and it is denoted by A B.
e.g., {2, 3, 6, 4} is proper subset of {4, 3, 2, 6, 5, 8}
Mathematical Sciences
Universal Set
We consider all the sets to be the subsets of a given fixed set
known as universal set or universe of discourse. It is denoted
by U or X.
A
B
Finite Set
If a set consist of finite number of elements, it is called a finite
set.
e.g., {7, 9, 11} is a finite set.
Infinite Set
If a set consist of an infinite number of elements, it is called,
infinite set.
e.g., Set of Natural numbers N, Set of Rational numbers R, etc.
Intersection
The intersection of two sets A and B written as A B. It means
the set of points which belongs to both A and B.
Power Set
Power set of the set is defined as the family consisting of all
subsets of a set. It is denoted by P.
e.g., { A : A B} is power set of B. It can be written as
P = { A : A B}
Null Set
A set consisting of no points is called the empty set or null set.
It is denoted by or {}.
Singleton Set
A set consisting of a single element is called a singleton set.
e.g., {1}, {2}, { a } etc., are singleton sets.
Hereditary Property
A non-empty family A = { A t } of sets is said to have hereditary
property, if
A t As, A s A A t A
A B = { x : x A and x B}
If A B = , it means there is no common element in A and
B. In this case, the sets A and B are said to be disjoint.
Note (a) Sometimes A + B can be written in place of
A B.
(b) Sometimes A B can be written in place of A B .
(c) If A = {1, 2 }, B = { 3, 4,5 }, then A B = {1, 2, 3, 4,5 }.
(d) If A = {1, 2 },B = {2, 3, 4 }, then A B = {2 }.
(e) If x A x A B and any x B x A B
A A B, B A B
(f) If x A B x A and any x A B x B
A B A, A B B
Complement of a Set
The complement of a set A is denoted by A C or A i.e., the set
of all points in the universal set U which do not belong to A.
Symbollically, it can be written as
A C = U A = { x : x U and x A}
i.e., for any x A x A
Difference of Sets
Set Operations
Union
Important Laws
(vii)
(viii)
(ix)
(x)
( A B) ( C D ) = ( A C ) ( B D )
A A AA=
A= AB A=
If A contains n elements and B contains m elements,
then A B contains n m elements.
A B = D. Then,
D D A B
D D B A
|D D| = r r = r 2
|( A B) (B A)| = r 2
Relation
A ( B C ) = ( A B) ( A C )
4. De-Morgans Laws
( A B) = A B
( A B) = A B
5.
A ( B C ) = ( A B) ( A C )
Relation on a Set
A ( B C ) = ( A B) ( A C )
Cartesian Product
Let A and B be two sets. Then,
A B = {( x, y ) : x A, y B}
is known as cartesian product of A and B.
In general
A B B A
where
B A = {( y, x ) : y B, x A}
Properties of Relation
Let R, S and T be relations on X. Then,
(i) ( RoS )oT = Ro( SoT )
(ii) Ro = R = oR
(iii) Ro( S T ) = ( RoS ) ( RoT )
Mathematical Sciences
i.e.,
U= A
X P
(ii) X , Y P, X Y X Y =
Inverse Relation
Function
Types of Relations
Let R be a relation on A. Then,
(i) R is called reflexive, if ( a, a) R, a A or
equivalently R.
(ii) R is called symmetric, if ( a1, a2 ) R ( a2 , a1) R or
equivalently R 1 = R.
(iii) R is called anti-symmetric, if ( a1, a2 ) R and ( a2 , a1) R
a1 = a2 or equivalently R R 1 .
(iv) R is called transitive, if ( a1, a2 ) R and ( a2 , a3 ) R
( a1, a3 ) R or equivalently RoR R.
e.g., Let A = { a, b, c} and
R = {( a, a), ( b, b), ( c, c ), ( a, b), ( b, c ), ( c, b)}
Then, R is reflexive but none of the rest of three.
e.g., Let A = { a, b, c} and
R = {( c, b), ( a, c )}
Then, R is a anti-symmetric but none of the rest three.
e.g., Let A = ( a, b, c ) and
R = {( a, a), ( b, b), ( c, c ), ( a, b), ( b, a), ( b, c ), ( c, b)}
Then, R is reflexive , symmetric but neither anti-symmetric nor
transitive.
Equivalence Relation
A relation R on a set A, which is reflexive, symmetric and
transitive is called equivalence relation on A.
Let R be an equivalence relation on A and a A. The subset
Ra = { b A :( a, b) R}
is called the equivalence class of A modulo R determined by a.
Partition of Set
Let A be a set. A subset P of the power set of A is called
partition of A, if
(i) union of member of P is A
a1 = a2
or equivalently
a1 a2
f ( a1) f ( a2 )
or equivalently
( a1, b) f , ( a2 , b) f
a1 = a2
Definition A map f : A B is called surjective map or onto
map, if b B, a A such that ( a, b) f . Thus, f is surjective,
if b B, a A such that f ( a) = b.
Definition A map f which is injective as well as surjective is
called a bijective or one-one-onto map.
Note f 1 is a map iff f is bijective.
Properties of Map
Inverse of a bijective map is a bijective map.
Composition of any two injective maps is injective.
Composite of two surjective maps is surjective.
Composite of two bijective maps is bijective.
Let f : A B and g : B C be maps. Then,
(a) If gof is surjective, then g is surjective.
(b) If gof is injective, then f is injective.
(c) If gof is bijective, then g is surjective and f is
injective.
(vi) A map f : A B is injective iff f can be left cancelled
in the sense that
fog = foh g = h
A map f : A B is surjective iff f can be right
cancelled in the sense that
(i)
(ii)
(iii)
(iv)
(v)
gof = hof
g=h
(vii) A map f : A B is bijective iff it can be left as well as
right cancelled.
(viii) Let f : A B be a map. Then, f is bijective iff a map
g : B A such that
gof = I A and
Ordered Pair
Order pair is an element of the form ( a, b). The element a is
called first element and the element b is called the second
element of the ordered pair.
Mathematical Sciences
Cardinal Numbers
(or Power or Potency)
The cardinal number of a equivalence sets is any
representative of the class or we can say that every
equivalence class defines a unique cardinal number.
If S is any set consisting of s elements, then the cardinal
number is s.
The cardinal number of is defined as zero.
If A ~ {1, 2, 3, ..., n}, then n is called the cardinal number of A.
The cardinal number of the any set A is denoted by card A or
| A|. Therefore,| A| or card A = n.
Note (a) If A ~ B , then by the definition of cardinal
number | A | = | B |.
(b) Cardinal number corresponding to a finite set is
called a finite cardinal number.
(c) Cardinal number corresponding to an infinite set
is called transfinite cardinal number.
(d) All transfinite cardinal numbers are greater than
any finite cardinal numbers.
| A B| = 9
and
| A| = 4,| B| = 6, A B
By the definition
| A B| | A | + | B |
Note This example shows that A B = is a
necessary condition for the rule | A B | = | A | + | B |.
| A B| = 3 4 = 12
Now,| A B| =|{( a, a), ( a, 2), ( a, 3), ( a, 4 ), ( b, a), ( b, 2), ( b, 3),
( b, 4 ), ( c, a), ( c, 2), ( c, 3), ( c, 4 )}|
= 12
| A B| =| A| | B| = n m
Note
Decimal Representation
The digits 0, 1, 2, ..., 9 are called the decimal digits. When the
series
d1
d
d
d
d
+ 2 + 3 + 4 + ... + nn + ...
10 102 103 104
10
converges to x with each dn as a decimal digit. Therefore, the
decimal representation of x is given by
x = 0 d1d2 d3 d4 ...
3
6
8
e.g.,
+ 2 + 3 + ... represents 0.368
10 10
10
Ternary Representation
The digits 0, 1, 2 are said to be ternary digits when the series
t1 t2
t
t
t
+
+ 3 + 4 + ... + nn + ...
3 32 33 34
3
converges to x with each tn as a ternary digit, then a ternary
representation of x is given by
x = 0 t1t2t3t4 ...
22.
Binary Representation
The digits 0 and 1 are said to be the binary digits when the
b1 b2 b3 b4
b
series
+
+
+
+ .... + nn + ...
2 22 23 24
2
converges to x with each bn as a binary digit, then the binary
expression of x is given by
x = 0 b1b2 b3 b4 ...
1
0
1
0
1
1
e.g.,
+ 2 + 3 + 4 + ... = 4 =
1
2 2
3
2
2
1
4
1
Therefore,
= 0 0101010101...
3
1
and similarly,
= 0 010000 ...
4
Note Suppose A be a set of all sequences whose
elements are the digits 0 and 1, then the set A is
countable.
Cantor Set
0
1
1
32
2
32
First step
Second step Removed
1
3
2
3
7
32
8
32
Removed
Removed
Consider the closed interval [0, 1.] Divide this closed interval
into three equal parts and remove the middle one i.e. remove
1 2
the open interval , . This is our first step of the
3 3
construction of cantor set.
Now, again we divide the each of the remaining two intervals
into three equal parts and remove the middle part means
1 2
7 8
remove the open intervals 2 , 2 and , . This is the
3 3
9 9
second step of construction. On proceeding in this way
infinitely many steps, at the rth step we have 2r 1 open
1
intervals are removed each of the length r . The remaining
3
set constitutes cantor set or cantor-ternary set.
Mathematical Sciences
1 2 1 2 7
, , , , ,
3 3 9 9 9
Order Completeness of R
The set of upper bounds of a non-empty set of real numbers
which is bounded above has a smallest number or we can also
say that every non-empty set of real numbers which is
bounded above admits of a least upper bound i.e.,
supremum.
This property of the set R of real numbers is referred to as its
order-completeness. This property states that if A be the set of
real numbers which is bounded above there exists the smallest
of the upper bounds of A. The fact of a number s being the
smallest of the upper bounds of A can be described by the
following properties:
1. The number s is an upper bound of A i.e., no member of
A is greater than s.
x A x s x s, x A
2. No number less than s is an upper bound of A i.e., if s be
the number less than s so that s is not an upper bound of
A, atleast one number x A s.t. x > s. Therefore, if s < s,
then there exist x A s.t. x > s.
Thus, we have completed the description of the set of real
numbers as a complete ordered field.
Note The ordered field of rational numbers is not
order-complete.
1
.
b
1
<
n
Irrational Number
Important Theorems
Denseness Property of Real Number System
Theorem 1 (The Density Theorem)
Between any two distinct numbers, there lies atleast one
rational number and hence there lie infinitely many
rational numbers.
x S x
Hence, the smallest member of a set is a member of the set
bounded below and as well as lower bound of the set.
Bounded Set
A set S of real numbers is said to be bounded if it is bounded
above as well as below. When the set S is bounded, two real
numbers l and m s.t.
l x m, x S
Note By saying that the set is bounded it means that
an interval I s.t. S I .
e.g. (i) The sets I, Q are neither bounded above nor bounded
below.
(ii) The set N of natural numbers is bounded below but not
bounded above. The smallest number is 1.
Therefore, Inf N = 1.
10
Mathematical Sciences
Limit Point
(i) A point p R is said to be a limit point of the set
A R if every neighbourhood of p contains atleast
one point of A other than p. Or we can say that a
point p R is a limit point of A R if and only if for
each neighbourhood N of p, we have
( N A ) ~{ p}
(ii) A point p R is called a limit point of a set A R if for
each > 0, the open interval ] p , p + [ contains a
point of A, other than p.
Important Theorems
Theorem 1 Interior of a set is an open set.
Theorem 2 A point p R is a limit point of a set A R iff
every neighbourhood of p contains infinitely many points of
A.
Theorem 3 If a non-empty subset A of R which is
bounded above and has no maximum member, then its
supremum is a limit point of the set A.
Derived Set
The set of all limit points of a set A R is said to be derived
set and it is denoted by D ( A ) or A. Therefore,
A = D( A ) = [ p : p is a limit point of A ]
The derived set of A i.e., ( A ) or A .
Isolated Point
A point p R is called an isolated point of A, if it is not the
limit point of A i.e., if there exist a neighbourhood of p which
contains no point of A other than p.
Note (a) A set A is called the discrete set if all its
points are isolated points.
(b) Each point of a set A is either an isolated point of
A or a limit point of A.
Closed Set
1. A set A is said to be closed set if it contains all its limit
point.
2. A set A is said to be closed if its complement is open.
e.g.,
(i) The null set is closed.
(ii) The set Q is not a closed set.
(iii) Finite set is always closed.
Theorem 6
Important Definitions
Condensation Point
If every neighbourhood of a point contains an infinite number
of points of A, then that point is called the condensation point
of A. Thus, a finite set has no condensation point.
Interior Point
The point x A is called an interior point of A if there exist a
neighbourhood containing x and contained in A. Evidently, x
must belong to A.
Closed Set
If every limit point of a set is contained in the set itself, then
such a set is called closed set. Thus, a closed set has the
derived set as its subset, D( A ) A, A is a closed set.
Closure of a Set
Open Set
Dense Set
1. A set A is said to be dense or everywhere dense in R, if
A = R.
2. A set A is said to be nowhere dense in R if interior of the
closure of A is empty i.e., ( A ) = .
11
Important Theorems
1. The finite intersection of open subsets of R is an open subset of R.
2. Suppose A R , then
(i) A is an open subset of R.
(ii) A is the largest open set contained in A.
(iii) A is open if and only if A = A
where A represents the set of all interior point of A.
3. A subset A of R is closed if and only if its complement Ac is open.
4. The arbitrary intersection of closed sets is a closed set.
5. The finite union of closed sets is a closed set.
6. (Heine-Borel Theorem) Suppose, A R and G be the collection of subsets of R. Then, G is called a cover of A if
A G.
G G
SOLVED EXAMPLES
Type I (Only one correct option)
Example 1. If A = {a, b, c} and
R = {( a, a), ( a, b), ( b, c ), ( b, b), (c , c ), (c , a)} is a binary relation
on A, then which one of the following is correct?
(a) R is reflexive and symmetric, but not transitive
(b) R is reflexive and transitive, but not symmetric
(c) R is reflexive, but neither symmetric not transitive
(d) R is reflexive, symmetric and transitive
( a, c) R
R is not a transitive relation.
(a) 1
(b) 5
(c) 7
(d) Cannot be determined as the sets A and B are not given.
Solution. (d) Since, the sets A and B are not known, thus
cardinality of the set A B cannot be determined.
Solution. (a) Both (A) and (R) are true and (R) is the correct
explanation of (A).
Q
( A B C) c = Ac Bc C c = D
(b) A B
(d) B
(b) 6
(d) 9
{( A ( X B))} B
(Q X B = B )
= ( A B ) B = ( A B) (BB) = ( A B) X
= AB
(b) 6
(c) 7
(d) 8
12
Mathematical Sciences
respectively.
(According to question)
2 m 2 n = 56
n m n
3
2 (2
1) = 8 7 = (2) 7 = 23 (23 1)
On comparing
n = 3 and m n = 3
m = 6 and n = 3
Number of subsets of A = 23 + 56 = 64 = 2 6
Number of elements in A = 6
Solution. (a) Q A B =
1, if x is a rational number
0 , if x is an irrational number
Example 7. If f ( x) =
Solution.
(b) 1
(d) None of these
1, if x is a rational number
(b) Q f ( x) =
0 , if x is an irrational number
( fof ) 3 = f {f ( 3)}
= f(0)
(Q 3 is an irrational number)
=1
(Q 0 is a rational number)
(a)
(c) A B
(b) A
(d) A B
(given)
A ( AB) = ( A A ) ( A B) = =
n( A B) = 8
n( A B) = 20 8 = 12
A, B, C are mutually exclusive and the number of elements
in the complement set of A B is 12.
y = ex
35
i.e., Two real number 1 and 1 have the same image. So,
the function is not one-one and let
y = ( x2 + 1)35
x = (y)1 35 1
(b) 1 A
(c) A
(d) {1, 2} A
( b, a) R and ( b, a) S
[Q R and S are symmetric]
( b, a) R S
Thus, ( a, b) R S
( b, a) R S for all ( a, b) R S.
So, R S is symmetric on A.
Transitivity Let a, b, c A such that ( a, b) R S and
( b, c) R S. Then, ( a, b) R S and ( b, c) R S
{(( a, b) R and ( a, b) S)}
and {(( b, c) R and ( b, c) S)}
{( a, b) R , ( b, c) R} and {( a, b) S , ( b, c) S}
( a, c) R and ( a, c) S
Q R and S are transitive. So
( a, b) R and ( b, c) R ( a, c) R
( a, b) S and ( b, c) S ( a, c) S
( a, c) R S
Thus, ( a, b) R S and ( b, c) R S ( a, c) R S.
So, R S is transitive on A.
Hence, R is an equivalence relation on A.
(b) 21
(c) 45
p +1
,
p = 1 + (n 12
) n =
2
q +1
q = 1 + (n 12
) n =
2
and r = 1 + (n 12
) n =
r +1
2
n
[ 2a + (n 1)d ]
2
q + 1
p +1
2
p
+
1
q +1
1 2 +
2 2 1 +
2 1 + 2 1 2
2
2
2
r +1
r +1
=
1 2
2 1+
2
4
p +1
q +1
r +1
[ 2 + ( p 1)] +
[ 2 + (q 1)] =
[ 2 + r 1]
4
4
4
( p + 1) 2 + (q + 1) 2 = (r + 1) 2
Q Sum of n terms of an AP =
p+q +r =7+5+9
= 21
(b) 21
(c) 27
(d) 30
Solution. (d) A = {x : x 9, x N}
= {1, 2, 3, 4, 5, 6, 7, 8, 9}
Total possible multiple of 3 are
3, 6, 9, 12, 15, 18, 21, 24, 27
But 3 and 27 are not possible.
6 1+ 2 + 3
9 2 + 3 + 4, 5 + 3 + 1, 6 + 2 + 1
12 9 + 2 + 1, 8 + 3 + 1, 7 + 1 + 4, 7 + 2 + 3, 6 + 4 + 2,
6 + 5 + 1, 5 + 4 + 3
15 9 + 4 + 2, 9 + 5 + 1, 8 + 6 + 1, 8 + 5 + 2, 8 + 4 + 3,
7 + 6 + 2, 7 + 5 + 3, 6 + 5 + 4
18 9 + 8 + 1, 9 + 7 + 2, 9 + 6 + 3, 9 + 5 + 4, 8 + 7 + 3,
8 + 6 + 4, 7 + 6 + 5
21 9 + 8 + 4, 9 + 7 + 5, 8 + 7 + 6
24 9 + 8 + 7
Hence, total number of largest possible subsets are 30.
(d) 54
(Q nth term of an AP)
13
f (x) = cos x
x
14
Mathematical Sciences
(b) 165
(d) 394
47 = 115 n( A B)
n( A B) = 68
n( A B) = n( A) + n(B) n( A B)
= 115 + 326 68 = 373
(b) 3300
(d) 1400
(a) x = 39
(c) 39 x 63
(b) x = 63
(d) None of these
n( A B) = 139 n( A B)
But
n( A B) 100
n( A B) 100
n( A B) 39 i.e., 39 n( A B)
Again,
A B A, A B B
n( A B) n( A) = 63 and n( A B) n(B) = 76
...(ii)
n( A B) 63
Then,
39 n( A B) 63 39 x 63
S = + : m , n is
m n
(a)
1
(c) : m
m
(b) {0}
(d) None of these
1
Hence, the set of all limit point of S is : m .
1
S = : n is
(a)
(c) N
(b) {0}
(d) None of these
(b) Q
(d)
(c) Z
d
x
Let c, d be two numbers such that a < c < x and n < d < b
15
2
2
contains no point of I other than m. Thus the derived set of I
is the null set .
1
1
2
2
m , contains no points of other than m. Thus, the
derived set of is null set . Every point of the set Q of
rationals is a limit point, for between any two rationals there
exist an infinity of rational.
Further every point of is a limit point, for every nbd of any
of its points contains an infinite member of .
S = S S = : n {0}
n
16
Mathematical Sciences
In = xn n + 1 , xn + n + 1
2
2
1
of length n , n = 1, 2, 3,...
2
n =1
n =1
xn and R = U {xn} U In
Ai = , , ,
, ,...
i i i i i
1 1
1
where the sum of lengths of In s is + 2 + 3 + ...
2 2
2
But
(b) symmetric
(d) an equivalence relation
(b) 9
(c) 7