0% found this document useful (0 votes)
47 views

cmn1 Export PDF

The document discusses types of relations and functions. It defines reflexive, symmetric, and transitive relations, and equivalence relations. It also defines one-to-one, onto, and bijective functions. It provides practice problems on relations and functions at three different levels, involving showing relations are equivalence relations, determining if functions are one-to-one or onto, and composition and inverses of functions. Binary operations and their properties like commutativity and associativity are also introduced, with practice problems.

Uploaded by

Pankaj Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
47 views

cmn1 Export PDF

The document discusses types of relations and functions. It defines reflexive, symmetric, and transitive relations, and equivalence relations. It also defines one-to-one, onto, and bijective functions. It provides practice problems on relations and functions at three different levels, involving showing relations are equivalence relations, determining if functions are one-to-one or onto, and composition and inverses of functions. Binary operations and their properties like commutativity and associativity are also introduced, with practice problems.

Uploaded by

Pankaj Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

3

MODULES FOR CLASS XII (M.L.L.)

Relations and Functions


Concept: - Types of relations
A relation R in a set A is called
(i) Reflexive, if a, a   R for every a  A
(ii) Symmetric, if a1 , a2   R  a2 , a1   R, for all a1 , a2  A
(iii) Transitive, if a1 , a2   R and a2 , a3   R implies that a2 , a3   R for all a1 , a2 , a3  A
A relation R in a set A is said to be an equivalence relation if R is reflexive,
Symmetric and Transitive.
PRACTICE PROBLEMS
LEVEL –I
 Let T be the set of all triangles in plane with R a relation in T given by R={(T1,T2):T1
is congruent to T2}. Shoe that R is an equivalence relation.
 Let L be the set of all lines in a plane and R be the relation in L defined as
R={(L1,L2):L1 is a perpendicular to L2}. Show that R is symmetric but neither
 Show that the relation R in the set R of real numbers, defined as R  {( a, b) : a  b 2 } is
neither reflexive nor symmetric nor transitive.
LEVEL-II
 Show that the relation R in the set Z of integers given by R={(a, b):2 divides a-b} is
an equivalence relation
 Show that the relation R in the set A  {1,2,3,4,5} given by R = {(a,b): a  b is even },
is an equivalence relation. Show that all the element of {1,3,5} are related to each
other and all the element of {2,4} are related to each other. But no element of {1,3,5}
is related to any element of {2,4}.
 Show that each of the relation R in the set A  {x  Z : 0  x  12} , given by
(i) R  {( a, b) : a  b is a multiple of 4}
(ii) R  {( a, b : a  b} is an equivalence relation. Find the set of all element related to 1
in each case
LEVEL-III
 Show that the relation R in the set A of points in a plane given by R = {(P,Q):
distance of the point P from the origin is same as the distance of the point Q from the
origin}, is an equivalence relation. Further, show that the set of all points P≠(0,0) is
the circle passing through P with origin as centre.
 Show that the relation R defined in the set A of all triangles as R = {(T1,T2):T1 is
similar to T2}, is equivalence relation. Consider three right angle triangle T1 with
sides 3,4,5,T2 with sides 5,12,13 and T3 with sides 6,8,10. Which triangle among
T1,T2 and T3 are related?
4

 Show that the relation R defined in the set A of all polygon as R = {(P1,P2):P1 and P2
have same number of sides}, is an equivalence relation. What is the set of all element
in A related to the right angle triangle T with sides 3,4,and 5?
 Let A={1,2,3,4…..,9} and R is the relation on AXA defined by (a,b)R(c,d) if
a+d=b+c for (a,b),(c,d) in AXA. Prove that R is an equivalence relation and also
obtain the equivalent class 2,5 .
Concept: One-one (injective),Onto (surjective) and bijective
Injective: - A function f : X  Y is define to be injective, if the image of distinct
element of X under f are distinct. For every x1 , x2  X , f x1   f x2   x1  x2
Surjective:- A function f : X  Y is said to onto (surjective) if every element of Y is the
image of some element of X under f ,i.e for every y  Y there exists an element x in X such
that f ( x )  y
Bijective: A function f : X  Y is said to be bijective if f is one –one and onto

PRACTICE PROBLEMS
LEVEL – I
 Prove that the function f : R  R ,given by f x   2 x is one - one and onto
 Show that the function f : N  N given by f 1  f 2  1and f x   x  1 for every
x>2 is onto but not one-one
 Find the number of all one –one function from set A = {1,2,3} to itself.

LEVEL – II
 Let A  R  {3} and B  R  {1} .consider the function f : A  B defined
 x 2
by f ( x)    . Is f one-one and onto? Justify your answer.
 x 3
 Let A = {-1,0,1,2}, B = {-4,-2,0,2} and f , g : A  B be a function defined by
1
f ( x)  x 2  x, x  A and g ( x)  2 x   1, x  A . Are f and g equal? Justify your
2
answer
LEVEL-III
 Show that the function f : R  R given by f x   x 3 is injective
 x  1 , x  odd
 Show that f : N  N given by f x    is both one - one and onto.
 x  1 , x  even
Concept :- Composition of function and Inverse of Function
Let f : A  B and g : B  C be two function .then the composition of f and g , denoted by
gof, is defined as the function gof: A  C given by gof  x  =g  f x , x  A
A function f : X  Y is defined to be invertible. If there exists a function g : Y  X Such
that gof  I X and fog  I Y .The function g is called the inverse of f . If f is invertible, then f
must be one one and onto.
5

PRACTICE PROBLEMS
LEVEL – I
1
 If f : R  R be given by f ( x)  (3  x ) , then fof (x) is
3 3

 Consider f : N  N , g : N  N and h : N  R defined as f ( x)  2 x, g ( x)  3 y  4


and h(z )  sin z, x, y and z in N. Show that ho( gof )  (hog )of .
 4 4x
 Let f : R     R be a function defined as f ( x )  . The show that
 3 3x  4
 4 4x
inverse of f is the map g : Range f  R    is g ( x )  .
 3 4  3x
LEVEL – II
 Consider f : R  4,  given by f ( x)  x 2  3 . Show that f is invertible with the
inverse f 1 of given by f 1
( y)  y  4 , where R is the set of all non-negative real
number.
 Let f : R  R be defined as f ( x)  10 x  7 .Find the function g : R  R such that
gof  fog  1R .

Show that the function f : R  R defined by f x  


x
 , x  R is neither one-one
x 1
2

nor onto.
LEVEL – III
 Consider f : R   5,  given by f ( x)  9 x 2  6 x  5 . Show that if f is

invertible with f
1

( x)  
 
y  6 1
.
 3 
 
 Let f : N  R be a function defined as f ( x)  4 x 2  12 x  15 . Show that
f : N  S , where, S is the range of f , is invertible. Find the inverse of f .

Concept :- Binary Operations

 A binary operation * on the set X is called commutative, if a * b  b * a , for every


a, b  X .
 A binary operation *: A  A  A is said to be associative if
a * b * c  a * b * c, a, b, c, A .
 Given a Binary operation *: A  A  A , an element e  A , if it exist, is called identity
for the operation *, if a * e  a  e * a, a  A .
Given a binary operation *: A  A  A with the identity element e in A, an element a  A is
said to be invertible with respect to the operation *,If there exist an element b in A such that
a * b  e  b * a and b is called the inverse of a and is donated by a-1.
6

PRACTICE PROBLEMS
LEVEL-I
 Consider the binary operation  on the set{1,2,3,4,5} defined by a  b  min{ a, b} .
Write the operation table of the operation  .
 Let * be the binary operation on N given by a*b=L.C.M of a and b. Find
(i)5*7,20*16
 Let * be a binary operation on the set Q of rational numbers as follows:-
(i)a*b=a-b (ii)a*b=a2+b2 (iii)a * b=a + ab
ab
(iv)a * b = (a-b)2 (v)a * b = (vi)a * b = ab2
4
Find which of binary operation are commutative and which are associative?
LEVEL – II
 Determine which of the following binary operation on the set R are associative and
which are commutative.
( a  b)
(a) a * b  1a, b  R (b) a * b  a, b  R
2
 Let A  N  N and * be the binary operation on A defined by
a, b  c, d   a  b, b  d  .Show that * is commutative and associative. Find the
identity element for *on A ,if any
 Consider a binary operation *on N defined as a * b  a 3  b 3 .Choose the correct
answer.
(A)Is * both associative and commutative?
(B)Is * commutative but not associative?
(C)Is * associative but not commutative?
(D)Is * neither commutative nor associative

LEVEL – III
 Consider the binary operation * : R  R  R and R  R  R defined as a * b  a  b
and a o b  a, a, b  R .Show that * is commutative but not associative, o is
associative but not commutative. Further, show that a, b, c  R, a * (boc)  (a * b). [If
it is so, we say that the operation * distributives over the operation o].Do o
distributive over *? Justify your answer.
 Given a non-empty set X, let *: P ( X )  P( X )  P( X ) be defined as
A * B  ( A  B)  ( B  A), A, B  P( X ) .Show that the empty set  is the identify for
the operation * and all the element A of P(X) are invertible with A 1  A .
 Define a binary operation * on the set {0,1,2,3,4,5,6} as
a  b if a  b  7
a *b  
a  b  7 if a  b  7
Write the operation table of the operation * and prove that zero is the identity for this
operation and each element a  0 of the set of the invertible with 7-a being the inverse
of a.

You might also like