Chanakya Cet
Chanakya Cet
Chanakya Cet
1 A set is well defined collection of objects. If the number of distinct elements of a set is finite,
then it is called finite otherwise infinite.
2. A set which doesnot contain any element is called ‘empty set’.
3. A set with single element is called a singleton.
4. A is called a subset of B ie; A B if every element of A also in B. Two sets A and B are equal
if A B and B A.
5. P(A), the power set of A, is set of all subsets of A. For finite set A the number of elements in
P(A) = 2n where n is the number of elements in A.
6. Intervals are subsets of R
[a, b] = {x: a x b} [a, b) = {x: a x<b}
(a, b] = {x: a<x b} (a, b) = {x: a<x<b}
7. AUB= {x:x A or x B} A B= {x:x A and x B}
A-B = {x:x A and x B} A1 = {x | x U and x A}
8. AU(B C) = (AUB) (AUC) : A (BUC) = (A B) U (A C)
(AUB)1 = A1 B1 ; (A B)1 = A1UB1 ; (A1)1 = A
9. If A and B are finite sets and A B = , then n(AUB) = n(A) + n(B)
If A B thenn(AUB) = n(A)+ n(B) - n(A B)
10. If A,B and C are finite sets then
n(AUBUC) = n(A)+n(B)+n(C) – n(A B) – n(B C) – n(A C) + n(A B C)
11. 1 =U U1= A A1= AUA1=U
12. A-B = A B1 A-(BUC) = (A-B) U (A-C)
N(A-B) = n(A) – n (A B). n(B-A) = n(B) – n(A B)
Definitions:
1. A relation f: R R is said to be a function, if every element of A has unique image in B.
2. The domain of f is the set of values of x for which the function is defined.
3. The range of the function is all possible values of f(x).
Types of functions:
(i) A function is defined to be one-one( or injective) , ( )
( ) .
(ii)A function is defined to be onto( or surjective) , if range of f = codomain of f
(iii) A function is defined to be one-one and onto ( or bijective), if f is both one-one
and onto.
Composition of functions:
(i) Let be two functions. Then, the composition of f and g, denoted by
g o f , is defined as the function g o f is given by g o f (x) = g ( f (x)), x A.
(ii) If are one-one, then is also one-one.
(iii) If are onto, then is also onto.
Invertible functions:
(i)A function is defined to be invertible, if there exists a function such that
and . The function g is called the inverse of f and is denoted by .
(ii) A function is invertible, if and only if f is a bijective function.
(iii) If , and are functions , then ( ) ( )
(iv) If , be two invertible functions, then is also invertible with
( ) .
(v) If f and g are 2 functions, such that they are inverse functions to each other, then their graphs
are mirror images (reflection) about the line y = x
(vi) If a function f satisfies (fof)(x) = x, then
Binary operations:
A binary operation * on a set A is a function . We denote (a, b) by a * b.
A binary operation * .is said to
(i) be commutative if a * b = b * a for all a, b A
(ii) be associative if a*(b*c) = (a*b)* c for all a, b, c A
(iii) have an identity, if there exists an element e satisfying a*e = a = e*a for all a A
(iv) be invertible, if there exists an element b such that a* b = b * a = e