Let A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Is R reflexive? symmetric? transitive? Solution R is reflexive and symmetric, but not transitive since for (1, 0) โ R and (0, 3) โ R whereas (1, 3) โ R.
Chapter 1 โ Relations And Functions
Class 12 Mathematics ยท 65 questions ยท 0 with answers
Solved examples
For the set A = {1, 2, 3}, define a relation R in the set A as follows: R = {(1, 1), (2, 2), (3, 3), (1, 3)}. Write the ordered pairs to be added to R to make it the smallest equivalence relation. Solution (3, 1) is the single ordered pair which needs to be added to R to make it the smallest equivalence relation.
Let R be the equivalence relation in the set Z of integers given by R = {(a, b) : 2 divides a โ b}. Write the equivalence class [0]. Solution [0] = {0, ยฑ 2, ยฑ 4, ยฑ 6,...}
Let the function f : R โ R be defined by f (x) = 4x โ 1, โ x โ R. Then, show that f is one-one. Solution For any two elements x1, x2 โ R such that f (x1) = f (x2), we have 4x1 โ 1 = 4x2 โ 1 โ 4x1 = 4x2, i.e., x1 = x2 Hence f is one-one.
If f = {(5, 2), (6, 3)}, g = {(2, 5), (3, 6)}, write f o g. Solution f o g = {(2, 2), (3, 3)}
Let f : R โ R be the function defined by f (x) = 4x โ 3 โ x โ R. Then write f โ1.
Is the binary operation * defined on Z (set of integer) by m * n = m โ n + mn โ m, n โ Z commutative? Solution No. Since for 1, 2 โ Z, 1 * 2 = 1 โ 2 + 1.2 = 1 while 2 * 1 = 2 โ 1 + 2.1 = 3 so that 1 * 2 โ 2 * 1.
If f = {(5, 2), (6, 3)} and g = {(2, 5), (3, 6)}, write the range of f and g. Solution The range of f = {2, 3} and the range of g = {5, 6}.
If A = {1, 2, 3} and f, g are relations corresponding to the subset of A ร A indicated against them, which of f, g is a function? Why? f = {(1, 3), (2, 3), (3, 2)} g = {(1, 2), (1, 3), (3, 1)} Solution f is a function since each element of A in the first place in the ordered pairs is related to only one element of A in the second place while g is not a function because 1 is related to more than one element of A, namely, 2 and 3.
If A = {a, b, c, d} and f = {a, b), (b, d), (c, a), (d, c)}, show that f is one- one from A onto A. Find f โ1. Solution f is one-one since each element of A is assigned to distinct element of the set A. Also, f is onto since f (A) = A. Moreover, f โ1 = {(b, a), (d, b), (a, c), (c, d)}.
In the set N of natural numbers, define the binary operation * by m * n = g.c.d (m, n), m, n โ N. Is the operation * commutative and associative? Solution The operation is clearly commutative since m * n = g.c.d (m, n) = g.c.d (n, m) = n * m โ m, n โ N. It is also associative because for l, m, n โ N, we have l * (m * n) = g. c. d (l, g.c.d (m, n)) = g.c.d. (g. c. d (l, m), n) = (l * m) * n. RELATIONS AND FUNCTIONS 5
In the set of natural numbers N, define a relation R as follows: โ n, m โ N, nRm if on division by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1, 2, 3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets determined by R. Solution R is reflexive since for each a โ N, aRa. R is symmetric since if aRb, then bRa for a, b โ N. Also, R is transitive since for a, b, c โ N, if aRb and bRc, then aRc. Hence R is an equivalence relation in N which will partition the set N into the pairwise disjoint subsets. The equivalent classes are as mentioned below: A0 = {5, 10, 15, 20 ...} A1 = {1, 6, 11, 16, 21 ...} A2 = {2, 7, 12, 17, 22, ...} A3 = {3, 8, 13, 18, 23, ...} A4 = {4, 9, 14, 19, 24, ...} It is evident that the above five sets are pairwise disjoint and A0 โช A1 โช A2 โช A3 โช A4 = โช Ai = N . i =0
Show that the function f : R โ R defined by f (x) = , โ xโR , is x +1 neither one-one nor onto. Solution For x1, x2 โ R, consider f (x1) = f (x2) x1 x โ = 22 x1 +1 x2 +1 โ x1 x22 + x1 = x2 x12 + x2 โ x1 x2 (x2 โ x1) = x2 โ x1 โ x1 = x2 or x1 x2 = 1 We note that there are point, x1 and x2 with x1 โ x2 and f (x1) = f (x2), for instance, if 1 2 2 1 we take x1 = 2 and x2 = , then we have f (x1) = and f (x2) = but 2 โ . Hence 2 5 5 2 f is not one-one. Also, f is not onto for if so then for 1โR โ x โ R such that f (x) = 1
Let f, g : R โ R be two functions defined as f (x) = x + x and g (x) = x โ x โ x โ R. Then, find f o g and g o f. Solution Here f (x) = x + x which can be redefined as ๏ฃฑ 2 x if x โฅ 0 f (x) = ๏ฃฒ ๏ฃณ 0 if x < 0 Similarly, the function g defined by g (x) = x โ x may be redefined as ๏ฃฑ 0 if x โฅ 0 g (x) = ๏ฃฒ ๏ฃณ โ2 x if x < 0 Therefore, g o f gets defined as : For x โฅ 0, (g o f ) (x) = g (f (x) = g (2x) = 0 and for x < 0, (g o f ) (x) = g (f (x) = g (0) = 0. Consequently, we have (g o f ) (x) = 0, โ x โ R. Similarly, f o g gets defined as: For x โฅ 0, (f o g ) (x) = f (g (x) = f (0) = 0, and for x < 0, (f o g ) (x) = f (g(x)) = f (โ2 x) = โ 4x. ๏ฃฑ 0, x > 0 i.e. ( f o g ) ( x) = ๏ฃฒ ๏ฃณโ4 x, x < 0
Let R be the set of real numbers and f : R โ R be the function defined by f (x) = 4x + 5. Show that f is invertible and find f โ1. Solution Here the function f : R โ R is defined as f (x) = 4x + 5 = y (say). Then y โ5 4x = y โ 5 or x= . RELATIONS AND FUNCTIONS 7 This leads to a function g : R โ R defined as y โ5 g (y) = . Therefore, ( g o f ) (x) = g(f (x) = g (4x + 5) 4x + 5 โ 5 = = x or g o f = IR Similarly (f o g) (y) = f (g(y)) ๏ฃซ y โ5 ๏ฃถ = f ๏ฃฌ ๏ฃท ๏ฃญ 4 ๏ฃธ ๏ฃซ y โ5 ๏ฃถ = 4๏ฃฌ ๏ฃท+5 = y ๏ฃญ 4 ๏ฃธ or f o g = IR . Hence f is invertible and f โ1 = g which is given by x โ5 f โ1 (x) =
Let * be a binary operation defined on Q. Find which of the following binary operations are associative
- (i)a * b = a โ b for a, b โ Q.
- (ii)a * b = for a, b โ Q.
- (iii)a * b = a โ b + ab for a, b โ Q.
- (iv)a * b = ab2 for a, b โ Q. Solution (i) * is not associative for if we take a = 1, b = 2 and c = 3, then (a * b) * c = (1 * 2) * 3 = (1 โ 2) * 3 = โ 1 โ 3 = โ 4 and a * (b * c) = 1 * (2 * 3) = 1 * (2 โ 3) = 1 โ ( โ 1) = 2.
Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is
- (A)Reflexive and symmetric
- (B)Transitive and symmetric
- (C)Equivalence
- (D)Reflexive, transitive but not symmetric Solution The correct choice is (D). Since n divides n, โ n โ N, R is reflexive. R is not symmetric since for 3, 6 โ N, 3 R 6 โ 6 R 3. R is transitive since for n, m, r whenever n/m and m/r โ n/r, i.e., n divides m and m divides r, then n will devide r.
Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if and only if l is perpendicular to m โ l, m โ L. Then R is
- (A)reflexive
- (B)symmetric
- (C)transitive
- (D)none of these Solution The correct choice is (B).
Let N be the set of natural numbers and the function f : N โ N be defined by f (n) = 2n + 3 โ n โ N. Then f is
- (A)surjective
- (B)injective
- (C)bijective
- (D)none of these Solution (B) is the correct option.
Set A has 3 elements and the set B has 4 elements. Then the number of RELATIONS AND FUNCTIONS 9 injective mappings that can be defined from A to B is
- (A)144
- (B)12
- (C)24
- (D)64 Solution The correct choice is (C). The total number of injective mappings from the set containing 3 elements into the set containing 4 elements is 4P3 = 4! = 24.
Let f : R โ R be defined by f (x) = sin x and g : R โ R be defined by g (x) = x2, then f o g is
- (A)x2 sin x
- (B)(sin x)2 sin x
- (C)sin x2
- (D)x2 Solution (C) is the correct choice.
Let f : R โ R be defined by f (x) = 3x โ 4. Then f โ1 (x) is given by x+4 x
- (A)
- (B)โ4 3 3
- (C)3x + 4
- (D)None of these Solution (A) is the correct choice.
Let f : R โ R be defined by f (x) = x2 + 1. Then, pre-images of 17 and โ 3, respectively, are
- (A)ฯ, {4, โ 4}
- (B){3, โ 3}, ฯ
- (C){4, โ4}, ฯ
- (D){4, โ 4, {2, โ 2} Solution (C) is the correct choice since for f ( 17 ) = x โ f (x) = 17 or x2 + 1 = 17 โ1 โ x = ยฑ 4 or f โ1 ( 17 ) = {4, โ 4} and for f โ1 (โ3) = x โ f (x) = โ 3 โ x2 + 1 = โ 3 โ x2 = โ 4 and hence f โ1 (โ 3) = ฯ.
For real numbers x and y, define xRy if and only if x โ y + 2 is an irrational number. Then the relation R is
- (A)reflexive
- (B)symmetric
- (C)transitive
- (D)none of these Solution (A) is the correct choice. Fill in the blanks in each of the Examples 25 to 30.
Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ________
The domain of the function f : R โ R defined by f (x) = x 2 โ 3x + 2 is ________. Solution Here x2 โ 3x + 2 โฅ 0 โ (x โ 1) (x โ 2) โฅ 0 โ x โค 1 or x โฅ 2 Hence the domain of f = (โ โ, 1] โช [2, โ)
Consider the set A containing n elements. Then, the total number of injective functions from A onto itself is ________. Solution n!
Let Z be the set of integers and R be the relation defined in Z such that aRb if a โ b is divisible by 3. Then R partitions the set Z into ________ pairwise disjoint subsets. Solution Three.
Let R be the set of real numbers and * be the binary operation defined on R as a * b = a + b โ ab โ a, b โ R. Then, the identity element with respect to the binary operation * is _______. Solution 0 is the identity element with respect to the binary operation *. State True or False for the statements in each of the Examples 30 to 34.
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation. Solution True.
Let A be a finite set. Then, each injective function from A into itself is not surjective. Solution False.
For sets A, B and C, let f : A โ B, g : B โ C be functions such that g o f is injective. Then both f and g are injective functions. Solution False.
For sets A, B and C, let f : A โ B, g : B โ C be functions such that g o f is surjective. Then g is surjective Solution True. RELATIONS AND FUNCTIONS 11
Let N be the set of natural numbers. Then, the binary operation * in N defined as a * b = a + b, โ a, b โ N has identity element. Solution False.
Questions
MATHEMATICS Solution Given that f (x) = 4x โ 3 = y (say), then 4x = y + 3 y +3 โ x= y +3 x+3 Hence f โ1 (y) = โ f โ1 (x) = 4 4
MATHEMATICS which gives =1 . But there is no such x in the domain R, since the equation x +1 x2 โ x + 1 = 0 does not give any real value of x.
MATHEMATICS Thus (a * b) * c โ a * (b * c) and hence * is not associative. (ii) * is associative since Q is associative with respect to multiplication. (iii) * is not associative for if we take a = 2, b = 3 and c = 4, then (a * b) * c = (2 * 3) * 4 = (2 โ 3 + 6) * 4 = 5 * 4 = 5 โ 4 + 20 = 21, and a * (b * c) = 2 * (3 * 4) = 2 * (3 โ 4 + 12) = 2 * 11 = 2 โ 11 + 22 = 13 Thus (a * b) * c โ a * (b * c) and hence * is not associative. (iv) * is not associative for if we take a = 1, b = 2 and c = 3, then (a * b) * c = (1 * 2) * 3 = 4 * 3 = 4 ร 9 = 36 and a * (b * c) = 1 * (2 * 3) = 1 * 18 = 1 ร 182 = 324. Thus (a * b) * c โ a * (b * c) and hence * is not associative.
MATHEMATICS Solution R = {(1, 1), (2, 2), (3, 3)}.
Let A = {a, b, c} and the relation R be defined on A as follows: R = {(a, a), (b, c), (a, b)}. Then, write minimum number of ordered pairs to be added in R to make R reflexive and transitive.
Let D be the domain of the real valued function f defined by f (x) = 25 โ x 2 . Then, write D.
Let f , g : R โ R be defined by f (x) = 2x + 1 and g (x) = x2 โ 2, โ x โ R, respectively. Then, find g o f.
Let f : R โ R be the function defined by f (x) = 2x โ 3 โ x โ R. write f โ1.
If A = {a, b, c, d} and the function f = {(a, b), (b, d), (c, a), (d, c)}, write f โ1.
If f : R โ R is defined by f (x) = x2 โ 3x + 2, write f (f (x)).
Is g = {(1, 1), (2, 3), (3, 5), (4, 7)} a function? If g is described by g (x) = ฮฑx + ฮฒ, then what value should be assigned to ฮฑ and ฮฒ.
Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
- (i){(x, y): x is a person, y is the mother of x}.
- (ii){(a, b): a is a person, b is an ancestor of a}.
If the mappings f and g are given by f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, write f o g.
Let C be the set of complex numbers. Prove that the mapping f : C โ R given by f (z) = |z|, โ z โ C, is neither one-one nor onto.
Let the function f : R โ R be defined by f (x) = cosx, โ x โ R. Show that f is neither one-one nor onto.
Let X = {1, 2, 3}and Y = {4, 5}. Find whether the following subsets of X รY are functions from X to Y or not.
- (i)f = {(1, 4), (1, 5), (2, 4), (3, 5)}
- (ii)g = {(1, 4), (2, 4), (3, 4)}
- (iii)h = {(1,4), (2, 5), (3, 5)}
- (iv)k = {(1,4), (2, 5)}.
If functions f : A โ B and g : B โ A satisfy g o f = IA, then show that f is one- one and g is onto. 12 MATHEMATICS
Let f : R โ R be the function defined by f (x) = 2 โ cos x โ x โ R.Then, find the range of f.
Let n be a fixed positive integer. Define a relation R in Z as follows: โ a, b โ Z, aRb if and only if a โ b is divisible by n . Show that R is an equivalance relation.
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
- (a)reflexive, transitive but not symmetric
- (b)symmetric but neither reflexive nor transitive
- (c)reflexive, symmetric and transitive.
Let R be relation defined on the set of natural number N as follows: R = {(x, y): x โ N, y โ N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive.
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of the following:
- (a)an injective mapping from A to B
- (b)a mapping from A to B which is not injective
- (c)a mapping from B to A.
Give an example of a map
- (i)which is one-one but not onto
- (ii)which is not one-one but onto
- (iii)which is neither one-one nor onto. xโ2
Let A = R โ {3}, B = R โ {1}. Let f : A โ B be defined by f (x) = x โ 3 โ x โ A . Then show that f is bijective.
Let A = [โ1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
- (i)f ( x) =
- (ii)g(x) = x
- (iii)h( x) = x x
- (iv)k(x) = x2.
Each of the following defines a relation on N:
- (i)x is greater than y, x, y โ N
- (ii)x + y = 10, x, y โ N RELATIONS AND FUNCTIONS 13
- (iii)x y is square of an integer x, y โ N
- (iv)x + 4y = 10 x, y โ N. Determine which of the above relations are reflexive, symmetric and transitive.
Let A = {1, 2, 3, ... 9} and R be the relation in A รA defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A รA. Prove that R is an equivalence relation and also obtain the equivalent class [(2, 5)].
Using the definition, prove that the function f : A โ B is invertible if and only if f is both one-one and onto.
Functions f , g : R โ R are defined, respectively, by f (x) = x2 + 3x + 1, g (x) = 2x โ 3, find
- (i)f o g
- (ii)g o f
- (iii)f o f
- (iv)g o g
Let * be the binary operation defined on Q. Find which of the following binary operations are commutative
- (i)a * b = a โ b โ a, b โQ
- (ii)a * b = a2 + b2 โ a, b โ Q
- (iii)a * b = a + ab โ a, b โ Q
- (iv)a * b = (a โ b)2 โ a, b โ Q
Let * be binary operation defined on R by a * b = 1 + ab, โ a, b โ R. Then the operation * is
- (i)commutative but not associative
- (ii)associative but not commutative
- (iii)neither commutative nor associative
- (iv)both commutative and associative
to 47 (M.C.Q.). 28. Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b โ a, b โ T. Then R is
- (A)reflexive but not transitive
- (B)transitive but not symmetric
- (C)equivalence
- (D)none of these
Consider the non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then R is
- (A)symmetric but not transitive
- (B)transitive but not symmetric
- (C)neither symmetric nor transitive
- (D)both symmetric and transitive 14 MATHEMATICS
The maximum number of equivalence relations on the set A = {1, 2, 3} are
- (A)1
- (B)2
- (C)3
- (D)5
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is
- (A)reflexive
- (B)transitive
- (C)symmetric
- (D)none of these
Let us define a relation R in R as aRb if a โฅ b. Then R is
- (A)an equivalence relation
- (B)reflexive, transitive but not symmetric
- (C)symmetric, transitive but
- (D)neither transitive nor reflexive not reflexive but symmetric.
Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}. Then R is
- (A)reflexive but not symmetric
- (B)reflexive but not transitive
- (C)symmetric and transitive
- (D)neither symmetric, nor transitive
The identity element for the binary operation * defined on Q ~ {0} as a, b โ Q ~ {0} is 2 โ a*b=
- (A)1
- (B)0
- (C)2
- (D)none of these
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is
- (A)720
- (B)120
- (C)0
- (D)none of these
Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is
- (A)P2
- (B)2n โ 2
- (C)2n โ 1
- (D)None of these RELATIONS AND FUNCTIONS 15
Let f : R โ R be defined by f (x) = x โ R. Then f is x โ
- (A)one-one
- (B)onto
- (C)bijective
- (D)f is not defined
Let f : R โ R be defined by f (x) = 3x2 โ 5 and g : R โ R by g (x) = . x +1 Then g o f is 3 x 2 โ5 3 x 2 โ5
- (A)
- (B)9 x 4 โ 30 x 2 + 26 9 x 4 โ 6 x 2 + 26 3x 2 3x 2
- (C)
- (D)x4 + 2 x2 โ 4 9 x 4 + 30 x 2 โ 2
Which of the following functions from Z into Z are bijections?
- (A)f (x) = x3
- (B)f (x) = x + 2
- (C)f (x) = 2x + 1
- (D)f (x) = x2 + 1
Let f : R โ R be the functions defined by f (x) = x3 + 5. Then f โ1 (x) is 1 1
- (A)( x + 5) 3
- (B)( x โ 5) 3
- (C)(5 โ x) 3
- (D)5 โ x
Let f : A โ B and g : B โ C be the bijective functions. Then (g o f)โ1 is
- (A)f โ1 o gโ1
- (B)f o g
- (C)g โ1 o fโ1
- (D)g o f ๏ฃฑ3๏ฃผ 3x + 2
Let f : R โ ๏ฃฒ ๏ฃฝ โ R be defined by f (x) = 5 x โ 3 . Then ๏ฃณ5 ๏ฃพ โ1
- (A)f (x) = f (x)
- (B)f โ1 (x) = โ f (x)
- (C)(fof)x=โx
- (D)f โ1 (x) = f (x) ๏ฃฑ x ,if x is rational
Let f : [0, 1] โ [0, 1] be defined by f (x) = ๏ฃฒ ๏ฃณ1 โ x, if x isirrational 16 MATHEMATICS Then (f o f) x is
- (A)constant
- (B)1 + x
- (C)x
- (D)none of these
Let f : [2, โ) โ R be the function defined by f (x) = x2 โ 4x + 5, then the range
- (A)R
- (B)[1, โ)
- (C)[4, โ) (B) [5, โ) 2 x โ1
Let f : N โ R be the function defined by f (x) = and g : Q โ R be another function defined by g (x) = x + 2. Then (g o f) is
- (A)1
- (B)1
- (C)(B) none of these
Let f : R โ R be defined by ๏ฃฑ 2x: x > 3 ๏ฃด f ( x) = ๏ฃฒ x 2 :1< x โค 3 ๏ฃด 3 x : x โค1 ๏ฃณ Then f (โ 1) + f (2) + f (4) is
- (A)9
- (B)14
- (C)5
- (D)none of these
Let f : R โ R be given by f (x) = tan x. Then f โ1 (1) is
- (A)
- (B){n ฯ + : n โ Z} 4 4
- (C)does not exist
- (D)none of these Fill in the blanks in each of the Exercises 48 to 52.
Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 โ b2| < 8. Then R is given by _______.
Let f = {(1, 2), (3, 5), (4, 1) and g = {(2, 3), (5, 1), (1, 3)}. Then g o f = ______ and f o g = ______. RELATIONS AND FUNCTIONS 17
Let f : R โ R be defined by f ( x ) = . Then ( f o f o f ) (x) = _______ 1 + x2
If f (x) = (4 โ (xโ7)3}, then f โ1(x) = _______. State True or False for the statements in each of the Exercises 53 to 63.
Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.
Let f : R โ R be the function defined by f (x) = sin (3x+2) โ x โ R. Then f is invertible.
Every relation which is symmetric and transitive is also reflexive.
An integer m is said to be related to another integer n if m is a integral multiple of n. This relation in Z is reflexive, symmetric and transitive.
Let A = {0, 1} and N be the set of natural numbers. Then the mapping f : N โ A defined by f (2nโ1) = 0, f (2n) = 1, โ n โ N, is onto. 58.The relation R on the set A = {1, 2, 3} defined as R = {{1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and transitive.
The composition of functions is commutative.
The composition of functions is associative.
Every function is invertible.
A binary operation on a set has always the identity element.