0% found this document useful (0 votes)
57 views4 pages

Chapter 7: Sets and Functions Overview

Chapter 7 covers the concepts of sets, relations, and functions. It defines various types of sets, such as empty, finite, infinite, and their operations like union and intersection. The chapter also explains ordered pairs, Cartesian products, and different types of functions and relations, including one-to-one, onto, and bijective functions, as well as the conditions for continuity of functions.

Uploaded by

amitsingh572008
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
57 views4 pages

Chapter 7: Sets and Functions Overview

Chapter 7 covers the concepts of sets, relations, and functions. It defines various types of sets, such as empty, finite, infinite, and their operations like union and intersection. The chapter also explains ordered pairs, Cartesian products, and different types of functions and relations, including one-to-one, onto, and bijective functions, as well as the conditions for continuity of functions.

Uploaded by

amitsingh572008
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Chapter 7: Sets,Relation and functions

Sets:

• A set is defined to be a collection of well defined distinct objects.


• This collection may be listed or described
• Each object is called an element of the set
• We usually denote sets by capital letters and their elements by small letters
Roster or Braces form Set builder or algebraic form or rule method

A = {a, i, e, 0, u} A = set of vowels in the alphabet


B= {2,4, 6, 8, 10} B = {x: x= 2m and m being integer lying in the interval 0<m<6}

a2A d6
2A
Types of sets
1. Empty set : a set which does not contain any element Á
2. Finite set : a set which consist of definite number of elements
3. Infinite set: a set which consist of infinite number
4. Singleton set : set with only 1 element
5. Equal set : all the elements in two sets are same
6. Equivalent set : n(A) = n(B). elements may be different
7. Sub set :if every element in set A is also element of set B A ½ B
8. Power set :power set of set A is collection of all the subsets of set A
9. Complement of set A:(A’) element in universal set but not in set A thus A+A’ = U
10. Disjoint sets : n (A \ B) = 0
• N : set of all natural no.
• Z: set of all integers
• Q: set of all rational no.
• R : set of all real no.
• W: set of whole no.
• Union of set : all the element in two or more sets without repeating common element A[B
• Intersection of set : common element in two or more sets
A\B

• Formulas
Relations & functions :

• Ordered pair : two elements a and b , listed in a specific order , form an ordered pair denoted by (a, b)
• Cartesian product of sets : if A and B are two non empty sets , then the set of all ordered pairs (a,b)
such that a belongs to A and b belongs to B , is called the Cartesian product of A and B , to be denoted
by A*B
A £ B = f(a; b) : a 2 A; b 2 Bg
• Any subset of the product set x.y is said to define a relation from x to y and any relation from x to y
in which no two different ordered pairs have the same first element is called a function .

• Let X and Y be two non empty sets. Then a rule or a correspondence f which associates to each element
of set X , a unique element , denoted by f(x) of Y is called a function or mapping from X to Y and we
write it as f: X Y
• Image : element of set Y
• Pre image : element of set X
• Domain of function f : x y is set x
• Co-domain of function is set y
• Range of the function is elements in set y which satisfies f(x)=y

• Types of functions
1. one - one function : if different elements in X • Types of relations.
have different images in Y Let S= {a,b,c….}be any set then the relation R
2. Onto or Surjective function : if every element is subset of the product set s*s
in y has at least one pre-image in X 1. If R contains all ordered pairs of the form
3. Bijective function : a one one and onto (a,a) in S*S, then R is called reflexive. Eg.
function is said to be bijective . ‘is equal to’ is a reflexive relation for a = a
4. Identity function : it is one-one onto function 2. If (a; b) 2 R ) (b; a) 2 R For every a; b 2 S
with domain X and range X. Then R is called symmetric . Eg a=b
5. Into function : there exists even a single b=a
element in Y 3. If (a; b) 2 R; (b; C) 2 R ) (a; c) 2 R For
6. Constant function : all the elements in X have every a; b; c 2 S Then R is called
the same image a in Y . i.e. range is singleton transitive . eg. a=b, b=c then a=c
set 4. Identity relation : {(a,a): a 2 A }
7. Equal function : f = g are equal if they have 5. Inverse relation : domain.¡R ¢ = Range (R)
¡1

same domain and they satisfies the condition


f(x) =g(x), for all x
8. Inverse function : function is invertible only
and only if it is one -one onto . I.e if f(x)=y
then. f ¡1(Y)= x
Limits and continuity

f(a)= value of the function at x=a


lim f (x) = Limit of the function as x approaches towards a
x!a

lim f (x)
x!a

Left hand limit Right hand limit

lim f (x) = lim f (a ¡ h) lim f (x) = lim f (a + h)


x!a¡ h!0 x!a+ h!0

If lim f (a ¡ h) = lim F (a + h) Then lim f (x) Exists.


h!0 h!0 x!a

1 1 1 1 1
lim+ = +1 lim¡ = ¡1 Thus lim+ = lim ) lim does not exist.
6
And x!0 x x!0 x x!0 x x!0 x
x!0 x

*some important limits.


ex ¡ 1 ax ¡ 1 log (1 + x)
1] lim =1 2] lim = loge a 3] lim =1
x!0 x x!0 x x!0 x
xn ¡ an n 1 µ ¶x
4] lim = nan¡1 (1 + x) ¡ 1 1
x!0 x ¡ a
5] lim =n 6] lim (1 + x) x = lim 1 + =e
x!0 x x!0 x!1 x

A function f is continuous at the point x= a if the following are true:


f(a) is defined .
1)
2) lim f (x) = f (a)
x!a
3) lim¡ f (x) = lim+ f (x)
x!a x!a

• If f and g are continuous at x=a then f+g , f-g, fg and f/g are also continuous at x=a
• A polynomial function y=p(x) is continuous at every point x
• A rational function R(x)= P (x) Is continuous at every point x in it’s domain .
Q (x)

You might also like