Académique Documents
Professionnel Documents
Culture Documents
BA
a)Roster method or Listing method or Tabular PROPER SUBSET : A set is said to be proper
method: In this method we list all the elements of subset of a set B if every element of A is an element
sets seperated by commas in the curly (flower) of B and B has at least one element which is not an
bracket like {2,4,5,9}
element of A and is denoted by A B i.e. If A is a
subset of B and A#B.
b)Rule method or Property or set builder method: e.g: A={1,2,3,4} B={1,2,3,4,6,7} A B
In this method a set is represented by writing all the POWER SET: The set of all subset of a set A is
properties which is satisfied by all its elements
called power set of A and denoted by P(A).
e.g: A={3,6,9,12,15....} is written as A={x/ x is a If A is a set of n distinct elements , then the
multiple of 3} (Here / is read as such that)
number of subsets of A is 2n
Set of all odd numbers can be written as
If n(A)=n, then p(A) contains 2n elements
A={x/x is an odd number and x=2m+1 m N
e.g: If A={a, b, c} then P(A)={ , {a}. {b}. {c}.
{a.b}, {b, c}, {c, a}, {a, b, c} }
TYPES OF SETS:
FACTS:
FINITE AND INFINTE SETS: A set which has 1)For empty set n(p(A))=1, i.e. number of elements
only a finite number of elements is called finite set of power set of an empty set is 1.
and which has infinite number of elements , is called 2)Number of NONEMPTY proper subset of a
infinite set .e.g: A={a, e, i, o, u} is a finite set and finite set consisting of n elements is 2 n -1(exluding
B={2,4,6.......} is an infinite set
null set)
CARDINAL NUMBER: Number of elements in a Super set: The statement A B can be rewritten
finite set is called cardinal number or order of a finite as BA , then B is called the super set of A and
set. If set A contains n elements then it is denoted is written as BA
by n(A)=n
DISJOINT SETS: Two sets A and B are said to be
NULL SET OR EMPTY SET OR VOID SET :
disjoint if they have no element in common.
A set having no element in it , is called null set, we
UNIVERSAL SET: A universal set is a nonempty
denote it by or {} e.g: A={x/ x2 +1=0}
set of which all the sets under consideration are
SINGLETON SET: A set consisting exacly one subsets.
element is called singleton set, i.e. A={a} and e.g: In the context of human population studies, the
A={x/5<x 6 xN }
universal set consists of all the people in the world,
SUBSETS: If A and B are sets such that every For the set Z of all integers , the universal set may the
element of A is also an element of B, then A is said to set Q of rational numbers
be a subset of B, symbolically we write A B
which is also read as A is contained in B we may OPERATION ON SETS:
also write this relation ship as BA which is read UNION OF SETS:
as B is a super set of A or B contains A
A B ={Set of all those elements which are in A
Note: A i.e. Null set is a subset of every set . or in B}
A A i.e. Every set is a subset of itself
A B ={x/ x A or x B }
n
If A B and BC then AC
Ai ={x : x Ai for atleast one I}
U
i =1
1 KHV
Consequences:
A A= A and A= A
a)A-B= AB' b)(A-B)UB= AUB
If A B then A B=B
c)(A-B)B=, d)AB B'A'
AU =U U is universal set
ABC = A BC (Union is e)A-B= B'-A' f)(AUB) (AUB')=A
A B=B A
A A= A
A =
A B A and Ab B
n(AUB) =n(A) +n(B)
& A B AB
sets.
DIFFERENCE OF TWO SETS:
A-B
**
A-B={ Set of all elements which belongs to A but not
**
to B} ={ x/ x A and x B } This can be
B-A
From figure
c
c
**
also denoted by A B or AB
A=(A-B)U(AB)
* * * AB
B-A={elements belong to only set B} = Ac B
n(A) =n(A-B) +n(AB)
Note: A B A & BAB
n(B) =n(B-A) +n(BA)
A-B#B-A ; x AB x A& x B
n(AB')=n(A)- n(AB)
COMPLETMENT OF A SET: A' or Ac (A n(BA')=n(B)-n(AB)
complement) means set of elements which are not in
n(A')=n(U)-n(AB)
set A(i.e. U-A) Symbolically, A' or Ac or
n(A'UB')=n(AB)'=n(U)-n(AB)
C(A) ={x : x U and x A }
n(A'B')=n(AUB)'=n(U)-n(AUB)
SYMMETRIC DIFFERENCE OF TWO SETS: ORDERED PAIR: An ordered pair of objects
Let A and B two nonempty sets, the set (A-B) (B- consists of two elements 'a' and 'b' written as
A) is called the symmetric difference of two sets and parenthesis (a, b) then a is designated as the first
is denoted by A B =(A-B) (B-A)
member and b as the second member.
e.g: The points in plane can be represented by an
LAWS OF ALGEBRA OF SETS:
ordered pair (x, y) where x is the first co-ordinate
1. a)A= b)AA=A(Idempotent Laws)
2. a)AUB=BUA b)AB= AB(commutative called abscissa and y the second co-ordinate called
ordinate. Thus a point represents an ordered pair.
laws)
Equality of ordered pairs: Two ordered pairs (a, b)
3. a)AU(BUC) =(AUB)UC
b)A(BC)=(AB)C (Associative laws) and (c, d) will be equal if and only if a=c and b=d
CARTESIAN PRODUCT OF SETS: Let A and B
4. a)AU(BC) =(AUB) (AUC)]
be any two non-empty sets. The set of all ordered
b)A(BUC)=(AUB) (AUC)
pairs (a, b) such that a A and b B is called
(Distributive laws)
the Cartesian product of the sets A and B and is
5. a) A-(BUC) =(A-B) (A-C)
denoted by A x B.
b)A-(BC) =(A-B) U(A-C)
A x B={(a, b) / a A and b B }
(De'morgan's laws)
2 KHV
A x(BUC) =(AxB) U (A x C)
A x (BC) = (A x B) (A x C)
A x (B-C) = (A x B) - (Ax C)
A x (B' U C') =(Ax B) (A x C)
A x (B' C' )' =(A x B) U (A x C)
If A B then ACBC
If A B and C D then
If A B then A B
condition (ii) guarantees that y is unique. (no element
= AB AC
of A is the first element of any two distinct elements
in the relation)
RELATIONS:
Note: Every function is a relation but every relation
Definition: Let A and B be any two sets , Then any may not be a function
B
A
subset of AxB is a relation R from A to B i.e.
f
R AB If (a,b) R , we write a R b
e.g: If A ={2,4,6} and B={a,b,c}, then R={(2,a), (2,b)
x
y=f(x)
, (4,b), (6,c)} being a subset of A x B, is a relation A
to B. Here (2,a) (2,b) (4,b) and (6,c) R, So we
Domain: The set A is called the domain of f and
write 2Ra , 2Rb, 4Rb, and 6Rc but (2,c) R.
denoted by Df
Codomain: The set B is called the Codomain of f and
If set A consists of m elements and B consist n
denoted by Cf
elements then A x B consist mn elements.
So there are 2mn subsets of A x B or 2mn different Image and Preimage: The unique element 'y' in B
assigned to 'x A is called the image (or f
relation from A to B
image)of 'x' under f and write it as f(x)=y(image of x
is y), x is called the preimage of y
If R AB is a relation from A to B , then
Domain of R = {Set of all frist elements in R}
Range of function: The range of f denoted by Rf is
={ a/ (a, b) R}
the set consisting of all the images of the elements of
Range of R = {Set of all second elements in R}
the domain A. and denoted by f(A), Symbolically
={b/(a, b) R}
f(A)=Range of f ={f(x)/ x X} or
={y Y/ y=f(x) for some x X}
RELATION ON A:
Note:
If A is nonempty set, then a relation R such that
1) From the definition of a function as a
R A A is called a relation on set A. Here, A x
correspondence, it follows that
A is universal relation on set A.
i) there may exist some elements in set B which
may not have any corresponding element in set
FUNCTIONS
A.
FUNCTIONS: Let A and B be two sets. A
2)y=f(x) is not a function (y as a function of x), if
correspondence between the elements of A and B is
there is an input for which we get more than one
called a function from A to B, if to each element x in
outputs.
A, there exist one and only one element (a unique
3 KHV
D 1 D 2
ii)(fg)x=f(x).g(x) with domain
D 1 D 2
f x
f
x =
iii)
provided g(x)#0 with domain
g
gx
D 1 D 2
x2
x
x
and g(x)=
2
x
x2
x
functions)
5. INCLUSION FUNCTION: If BA , then
the function i: B A : i(b)=b b
B.
I. Number of funtion from finite set A to
fintite set B =(n(B))n(A)
e.g: The number of functions from {1,2,3}
2. CONSTANT FUNCTION: A function f: AB
into {a, b} =23 =8
is called a constant function if each element of
The number of functions from {a, b} into
set A has the same image in set B i.e. if the range
{1,2,3} =32 =9
of B has only one element.
The number of functions from
For all x A, f(x) =(constant or fixed
{1,2,3} to {a, b,c} =33 =27
number )
II. Number of functions from A to B if
3. IDENTITY FUNCTION: A function f: AB
n(A)= and set B is non empty
is said to be Identity function if
TYPES OF FUNCTION:
1. REAL VALUED FUNCTION: Let f be a
function from the set A to set B. If sets A and B
are subsets of real numbers, then f is said to be
real valued function.
Px
Q x
where
x 2x3
2
x 7 x 32x 272 / 3
1 x
4 KHV
FACTS:
f x f x
+
2
ii)Denominator #0
iii)If domain of y=f(x) and y=g(x) are D1 and D2
respectively then the domain of f(x) +g(x)
or f(x).g(x), is D 1 D2
iii) Domain of
f x f x
2
f x
f
x =
is
g
gx
D1 D2 -{g(x)=0}
x R
5 KHV
GRAPH OF A FUNCTION: Graph of a function 'f' denoted by G(f) or Gf is the set of all ordered pairs (x, f(x))
where x Df . Symbolically, G(f)={(x, f(x)), x Df}
EXPONENTIAL FUNCTION: A function f(x)=ax or
f(x)=ex (e, a>0, x R)satisfying the laws a1 =a and
ax.ay =ax+y is called the exponential function
The exponential function ex is defined as
ex = 1
x x2
x 23!......... , x R
1! 2 !
(1,0)
GRAPH OF EXPONETIAL FUNCTION ex :
x
Graph of e :
Range of f= , i.e.
Domain of f=R and Also y=ex
x=logey is
R Also x=1 y=log1=0 ,
defined only for x>0. Range f=(0, )
Therefore the curve lies to the right of y-axis.
where x=0, f(0)=e0=1
Therefore f(x) is an increasing curve and it cuts x axis
Y
y=ex (a>1)
at (1,0).
curve cuts y-axis at (0,1).
The curve is asymptotic to y axis. logax decreases if
Since f(x)>0 for all x, the
(0,1)
0<a<1 and increases if a>1
graph lies above x axis and
X Note: ex and logx are inverse to one another and hence
f(x)=ex is increasing curve
O
their graphs are reflections w.r.t the line y=x(Identity
and is asymptotic to x axis.
function)
Note:
1.General logarithmic function is defined by
LOGERITHEMIC FUNCTION:
y=f(x) =logax where a#1 and a>0.
The function f(x)=logx for x>0 is called the
logarithmic function. (The inverse of exponential
Here Df = (0, ) and Rf =
, and the
function is called the logarithmic function.)
point (1,0) lies on the graph.
If y=ax (a>0, a#1, x R,y>0) then x=logay is called
If a>1
logax<0 if 0<x<1. logax =0 if x=1
Logarithmic function.
and logax >0 if x>1
If 0<a<1
logax >0 if 0<x<1 and logax<0 if x>1
6 KHV
x
y=[x]
x=2
2
2 x1 1x0
-2
0x1
1x 2
-1
2x3
2
Y
y=2
-2
|
|
|
|
Important facts about the function f(x)=[x]:
i. [x]=x when x is integer
ii. [x]<x when x is not integer. ]
iii. [x]=0 when 0x1
iv. [x]=K(Integer) when K x K1
|
y=1 |
1 |
|
|
|
|
|
|
|
-1
|
1
|y=-1 -1
|
|
y=-2
-2
vi.
[x+y]=[x]+[y], iff at least one of x and y is an
integer.
vii. [x+y]=[x]+y for all x R and y I (set of
Integers)
X R
v. [x] x<[x]+1 i.e. K x-[x]<1
MODULUS FUNCTION:
f(x)=|x| in R means f(x)=-x when x<0 ;
f(x)=x when x0
3
2
f(x)=2x+3 when
2x30
7 KHV
y=
-x
y=
x
i.e.x -3/2
450
Table of values:
x
y=x[x]
3x2 2 x1 1x0
x+3
x+2
x+1
0x1
1x 2
x-1
Y
2x3
x-2
y=1
-3
-2
-1
y=0
X
y=1, x>0
**********************
8 KHV
xA
Y
f(x
)=
x
450