NCERT Solutions for Class 12 Commerce Math Chapter 1 Relations And Functions are provided here with simple step-by-step explanations. These solutions for Relations And Functions are extremely popular among Class 12 Commerce students for Math Relations And Functions Solutions come handy for quickly completing your homework and preparing for exams. All questions and answers from the NCERT Book of Class 12 Commerce Math Chapter 1 are provided here for you for free. You will also love the ad-free experience on Meritnation’s NCERT Solutions. All NCERT Solutions for class Class 12 Commerce Math are prepared by experts and are 100% accurate.

Page No 5:

Question 1:

Determine whether each of the following relations are reflexive, symmetric and transitive:

(i)Relation R in the set A = {1, 2, 3…13, 14} defined as

R = {(x, y): 3xy = 0}

(ii) Relation R in the set N of natural numbers defined as

R = {(x, y): y = x + 5 and x < 4}

(iii) Relation R in the set A = {1, 2, 3, 4, 5, 6} as

R = {(x, y): y is divisible by x}

(iv) Relation R in the set Z of all integers defined as

R = {(x, y): xy is as integer}

(v) Relation R in the set A of human beings in a town at a particular time given by

(a) R = {(x, y): x and y work at the same place}

(b) R = {(x, y): x and y live in the same locality}

(c) R = {(x, y): x is exactly 7 cm taller than y}

(d) R = {(x, y): x is wife of y}

(e) R = {(x, y): x is father of y}

Answer:

(i) A = {1, 2, 3 … 13, 14}

R = {(x, y): 3xy = 0}

∴R = {(1, 3), (2, 6), (3, 9), (4, 12)}

R is not reflexive since (1, 1), (2, 2) … (14, 14) ∉ R.

Also, R is not symmetric as (1, 3) ∈R, but (3, 1) ∉ R. [3(3) − 1 ≠ 0]

Also, R is not transitive as (1, 3), (3, 9) ∈R, but (1, 9) ∉ R.

[3(1) − 9 ≠ 0]

Hence, R is neither reflexive, nor symmetric, nor transitive.

(ii) R = {(x, y): y = x + 5 and x < 4} = {(1, 6), (2, 7), (3, 8)}

It is seen that (1, 1) ∉ R.

∴R is not reflexive.

(1, 6) ∈R

But,

(6, 1) ∉ R.

∴R is not symmetric.

Now, since there is no pair in R such that (x, y) and (y, z) ∈R, then (x, z) cannot belong to R.

∴ R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

(iii) A = {1, 2, 3, 4, 5, 6}

R = {(x, y): y is divisible by x}

We know that any number (x) is divisible by itself.

(x, x) ∈R

∴R is reflexive.

Now,

(2, 4) ∈R [as 4 is divisible by 2]

But,

(4, 2) ∉ R. [as 2 is not divisible by 4]

∴R is not symmetric.

Let (x, y), (y, z) ∈ R. Then, y is divisible by x and z is divisible by y.

z is divisible by x.

⇒ (x, z) ∈R

∴R is transitive.

Hence, R is reflexive and transitive but not symmetric.

(iv) R = {(x, y): xy is an integer}

Now, for every xZ, (x, x) ∈R as xx = 0 is an integer.

∴R is reflexive.

Now, for every x, yZ if (x, y) ∈ R, then xy is an integer.

⇒ −(xy) is also an integer.

⇒ (yx) is an integer.

∴ (y, x) ∈ R

∴R is symmetric.

Now,

Let (x, y) and (y, z) ∈R, where x, y, zZ.

⇒ (xy) and (yz) are integers.

x z = (xy) + (yz) is an integer.

∴ (x, z) ∈R

∴R is transitive.

Hence, R is reflexive, symmetric, and transitive.

(v) (a) R = {(x, y): x and y work at the same place}

(x, x) ∈ R

∴ R is reflexive.

If (x, y) ∈ R, then x and y work at the same place.

y and x work at the same place.

⇒ (y, x) ∈ R.

∴R is symmetric.

Now, let (x, y), (y, z) ∈ R

x and y work at the same place and y and z work at the same place.

x and z work at the same place.

⇒ (x, z) ∈R

∴ R is transitive.

Hence, R is reflexive, symmetric, and transitive.

(b) R = {(x, y): x and y live in the same locality}

Clearly (x, x) ∈ R as x and x is the same human being.

∴ R is reflexive.

If (x, y) ∈R, then x and y live in the same locality.

y and x live in the same locality.

⇒ (y, x) ∈ R

∴R is symmetric.

Now, let (x, y) ∈ R and (y, z) ∈ R.

x and y live in the same locality and y and z live in the same locality.

x and z live in the same locality.

⇒ (x, z) ∈ R

∴ R is transitive.

Hence, R is reflexive, symmetric, and transitive.

(c) R = {(x, y): x is exactly 7 cm taller than y}

Now,

(x, x) ∉ R

Since human being x cannot be taller than himself.

∴R is not reflexive.

Now, let (x, y) ∈R.

x is exactly 7 cm taller than y.

Then, y is not taller than x.

∴ (y, x) ∉R

Indeed if x is exactly 7 cm taller than y, then y is exactly 7 cm shorter than x.

∴R is not symmetric.

Now,

Let (x, y), (y, z) ∈ R.

x is exactly 7 cm taller thany and y is exactly 7 cm taller than z.

x is exactly 14 cm taller than z .

∴(x, z) ∉R

∴ R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

(d) R = {(x, y): x is the wife of y}

Now,

(x, x) ∉ R

Since x cannot be the wife of herself.

∴R is not reflexive.

Now, let (x, y) ∈ R

x is the wife of y.

Clearly y is not the wife of x.

∴(y, x) ∉ R

Indeed if x is the wife of y, then y is the husband of x.

∴ R is not symmetric.

Let (x, y), (y, z) ∈ R

x is the wife of y and y is the wife of z.

This case is not possible. Also, this does not imply that x is the wife of z.

∴(x, z) ∉ R

∴R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

(e) R = {(x, y): x is the father of y}

(x, x) ∉ R

As x cannot be the father of himself.

∴R is not reflexive.

Now, let (x, y) ∈R.

x is the father of y.

y cannot be the father of y.

Indeed, y is the son or the daughter of y.

∴(y, x) ∉ R

∴ R is not symmetric.

Now, let (x, y) ∈ R and (y, z) ∈ R.

x is the father of y and y is the father of z.

x is not the father of z.

Indeed x is the grandfather of z.

∴ (x, z) ∉ R

∴R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

Page No 5:

Question 2:

Show that the relation R in the set R of real numbers, defined as

R = {(a, b): ab2} is neither reflexive nor symmetric nor transitive.

Answer:

R = {(a, b): ab2}

It can be observed that

∴R is not reflexive.

Now, (1, 4) ∈ R as 1 < 42

But, 4 is not less than 12.

∴(4, 1) ∉ R

∴R is not symmetric.

Now,

(3, 2), (2, 1.5) ∈ R

(as 3 < 22 = 4 and 2 < (1.5)2 = 2.25)

But, 3 > (1.5)2 = 2.25

∴(3, 1.5) ∉ R

∴ R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.

Page No 5:

Question 3:

Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as

R = {(a, b): b = a + 1} is reflexive, symmetric or transitive.

Answer:

Let A = {1, 2, 3, 4, 5, 6}.

A relation R is defined on set A as:

R = {(a, b): b = a + 1}

∴R = {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)}

We can find (a, a) ∉ R, where a ∈ A.

For instance,

(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6) ∉ R

∴R is not reflexive.

It can be observed that (1, 2) ∈ R, but (2, 1) ∉ R.

∴R is not symmetric.

Now, (1, 2), (2, 3) ∈ R

But,

(1, 3) ∉ R

∴R is not transitive

Hence, R is neither reflexive, nor symmetric, nor transitive.

Page No 5:

Question 4:

Show that the relation R in R defined as R = {(a, b): ab}, is reflexive and transitive but not symmetric.

Answer:

R = {(a, b); ab}

Clearly (a, a) ∈ R as a = a.

∴R is reflexive.

Now,

(2, 4) ∈ R (as 2 < 4)

But, (4, 2) ∉ R as 4 is greater than 2.

∴ R is not symmetric.

Now, let (a, b), (b, c) ∈ R.

Then,

ab and bc

ac

⇒ (a, c) ∈ R

∴R is transitive.

Hence,R is reflexive and transitive but not symmetric.

Page No 5:

Question 5:

Check whether the relation R in R defined as R = {(a, b): ab3} is reflexive, symmetric or transitive.

Answer:

R = {(a, b): a b3}

It is observed that

∴ R is not reflexive.

Now,

(1, 2) ∈ R (as 1 < 23 = 8)

But,

(2, 1) ∉ R (as 2 > 13 = 1)

∴ R is not symmetric.

We have

But

∴ R is not transitive.

Hence, R is neither reflexive, nor symmetric, nor transitive.



Page No 6:

Question 6:

Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.

Answer:

Let A = {1, 2, 3}.

A relation R on A is defined as R = {(1, 2), (2, 1)}.

It is seen that (1, 1), (2, 2), (3, 3) ∉R.

∴ R is not reflexive.

Now, as (1, 2) ∈ R and (2, 1) ∈ R, then R is symmetric.

Now, (1, 2) and (2, 1) ∈ R

However,

(1, 1) ∉ R

∴ R is not transitive.

Hence, R is symmetric but neither reflexive nor transitive.

Page No 6:

Question 7:

Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y): x and y have same number of pages} is an equivalence relation.

Answer:

Set A is the set of all books in the library of a college.

R = {x, y): x and y have the same number of pages}

Now, R is reflexive since (x, x) ∈ R as x and x has the same number of pages.

Let (x, y) ∈ R ⇒ x and y have the same number of pages.

y and x have the same number of pages.

⇒ (y, x) ∈ R

∴R is symmetric.

Now, let (x, y) ∈R and (y, z) ∈ R.

x and y and have the same number of pages and y and z have the same number of pages.

x and z have the same number of pages.

⇒ (x, z) ∈ R

∴R is transitive.

Hence, R is an equivalence relation.

Page No 6:

Question 8:

Show that the relation R in the set A = {1, 2, 3, 4, 5} given by

, is an equivalence relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related to each other. But no element of {1, 3, 5} is related to any element of {2, 4}.

Answer:

A = {1, 2, 3, 4, 5}

It is clear that for any element aA, we have (which is even).

∴R is reflexive.

Let (a, b) ∈ R.

∴R is symmetric.

Now, let (a, b) ∈ R and (b, c) ∈ R.

⇒ (a, c) ∈ R

∴R is transitive.

Hence, R is an equivalence relation.

Now, all elements of the set {1, 3, 5} are related to each other as all the elements of this subset are odd. Thus, the modulus of the difference between any two elements will be even.

Similarly, all elements of the set {2, 4} are related to each other as all the elements of this subset are even.

Also, no element of the subset {1, 3, 5} can be related to any element of {2, 4} as all elements of {1, 3, 5} are odd and all elements of {2, 4} are even. Thus, the modulus of the difference between the two elements (from each of these two subsets) will not be even.

Page No 6:

Question 9:

Show that each of the relation R in the set, given by

(i)

(ii)

is an equivalence relation. Find the set of all elements related to 1 in each case.

Answer:

(i)

For any element a ∈A, we have (a, a) ∈ R as is a multiple of 4.

∴R is reflexive.

Now, let (a, b) ∈ R ⇒ is a multiple of 4.

⇒ (b, a) ∈ R

∴R is symmetric.

Now, let (a, b), (b, c) ∈ R.

⇒ (a, c) ∈R

∴ R is transitive.

Hence, R is an equivalence relation.

The set of elements related to 1 is {1, 5, 9} since

(ii) R = {(a, b): a = b}

For any element a ∈A, we have (a, a) ∈ R, since a = a.

∴R is reflexive.

Now, let (a, b) ∈ R.

a = b

b = a

⇒ (b, a) ∈ R

∴R is symmetric.

Now, let (a, b) ∈ R and (b, c) ∈ R.

a = b and b = c

a = c

⇒ (a, c) ∈ R

∴ R is transitive.

Hence, R is an equivalence relation.

The elements in R that are related to 1 will be those elements from set A which are equal to 1.

Hence, the set of elements related to 1 is {1}.

Page No 6:

Question 10:

Given an example of a relation. Which is

(i) Symmetric but neither reflexive nor transitive.

(ii) Transitive but neither reflexive nor symmetric.

(iii) Reflexive and symmetric but not transitive.

(iv) Reflexive and transitive but not symmetric.

(v) Symmetric and transitive but not reflexive.

Answer:

(i) Let A = {5, 6, 7}.

Define a relation R on A as R = {(5, 6), (6, 5)}.

Relation R is not reflexive as (5, 5), (6, 6), (7, 7) ∉ R.

Now, as (5, 6) ∈ R and also (6, 5) ∈ R, R is symmetric.

(5, 6), (6, 5) ∈ R, but (5, 5) ∉ R

∴R is not transitive.

Hence, relation R is symmetric but not reflexive or transitive.

(ii)Consider a relation R in R defined as:

R = {(a, b): a < b}

For any a ∈ R, we have (a, a) ∉ R since a cannot be strictly less than a itself. In fact, a = a.

∴ R is not reflexive.

Now,

(1, 2) ∈ R (as 1 < 2)

But, 2 is not less than 1.

∴ (2, 1) ∉ R

∴ R is not symmetric.

Now, let (a, b), (b, c) ∈ R.

a < b and b < c

a < c

⇒ (a, c) ∈ R

∴R is transitive.

Hence, relation R is transitive but not reflexive and symmetric.

(iii)Let A = {4, 6, 8}.

Define a relation R on A as:

A = {(4, 4), (6, 6), (8, 8), (4, 6), (6, 4), (6, 8), (8, 6)}

Relation R is reflexive since for every aA, (a, a) ∈R i.e., (4, 4), (6, 6), (8, 8)} ∈ R.

Relation R is symmetric since (a, b) ∈ R ⇒ (b, a) ∈ R for all a, b ∈ R.

Relation R is not transitive since (4, 6), (6, 8) ∈ R, but (4, 8) ∉ R.

Hence, relation R is reflexive and symmetric but not transitive.

(iv) Define a relation R in R as:

R = {a, b): a3b3}

Clearly (a, a) ∈ R as a3 = a3.

∴R is reflexive.

Now,

(2, 1) ∈ R (as 23 ≥ 13)

But,

(1, 2) ∉ R (as 13 < 23)

∴ R is not symmetric.

Now,

Let (a, b), (b, c) ∈ R.

a3b3 and b3c3

a3c3

⇒ (a, c) ∈ R

∴R is transitive.

Hence, relation R is reflexive and transitive but not symmetric.

(v) Let A = {−5, −6}.

Define a relation R on A as:

R = {(−5, −6), (−6, −5), (−5, −5)}

Relation R is not reflexive as (−6, −6) ∉ R.

Relation R is symmetric as (−5, −6) ∈ R and (−6, −5}∈R.

It is seen that (−5, −6), (−6, −5) ∈ R. Also, (−5, −5) ∈ R.

∴The relation R is transitive.

Hence, relation R is symmetric and transitive but not reflexive.

Page No 6:

Question 11:

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 point related to a point P ≠ (0, 0) is the circle passing through P with origin as centre.

Answer:

R = {(P, Q): distance of point P from the origin is the same as the distance of point Q from the origin}

Clearly, (P, P) ∈ R since the distance of point P from the origin is always the same as the distance of the same point P from the origin.

∴R is reflexive.

Now,

Let (P, Q) ∈ R.

⇒ The distance of point P from the origin is the same as the distance of point Q from the origin.

⇒ The distance of point Q from the origin is the same as the distance of point P from the origin.

⇒ (Q, P) ∈ R

∴R is symmetric.

Now,

Let (P, Q), (Q, S) ∈ R.

⇒ The distance of points P and Q from the origin is the same and also, the distance of points Q and S from the origin is the same.

⇒ The distance of points P and S from the origin is the same.

⇒ (P, S) ∈ R

∴R is transitive.

Therefore, R is an equivalence relation.

The set of all points related to P ≠ (0, 0) will be those points whose distance from the origin is the same as the distance of point P from the origin.

In other words, if O (0, 0) is the origin and OP = k, then the set of all points related to P is at a distance of k from the origin.

Hence, this set of points forms a circle with the centre as the origin and this circle passes through point P.

Page No 6:

Question 12:

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 triangles T1 with sides 3, 4, 5, T2 with sides 5, 12, 13 and T3 with sides 6, 8, 10. Which triangles among T1, T2 and T3 are related?

Answer:

R = {(T1, T2): T1 is similar to T2}

R is reflexive since every triangle is similar to itself.

Further, if (T1, T2) ∈ R, then T1 is similar to T2.

T2 is similar to T1.

⇒ (T2, T1) ∈R

∴R is symmetric.

Now,

Let (T1, T2), (T2, T3) ∈ R.

T1 is similar to T2 and T2 is similar to T3.

T1 is similar to T3.

⇒ (T1, T3) ∈ R

∴ R is transitive.

Thus, R is an equivalence relation.

Now, we can observe that:

∴The corresponding sides of triangles T1 and T3 are in the same ratio.

Then, triangle T1 is similar to triangle T3.

Hence, T1­ is related to T3.

Page No 6:

Question 13:

Show that the relation R defined in the set A of all polygons as R = {(P1, P2): P1 and P2 have same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right angle triangle T with sides 3, 4 and 5?

Answer:

R = {(P1, P2): P1 and P2 have same the number of sides}

R is reflexive since (P1, P1) ∈ R as the same polygon has the same number of sides with itself.

Let (P1, P2) ∈ R.

P1 and P have the same number of sides.

P2 and P1 have the same number of sides.

⇒ (P2, P1) ∈ R

∴R is symmetric.

Now,

Let (P1, P2), (P2, P3) ∈ R.

P1 and P2 have the same number of sides. Also, P2 and P3 have the same number of sides.

P1 and P3 have the same number of sides.

⇒ (P1, P3) ∈ R

∴R is transitive.

Hence, R is an equivalence relation.

The elements in A related to the right-angled triangle (T) with sides 3, 4, and 5 are those polygons which have 3 sides (since T is a polygon with 3 sides).

Hence, the set of all elements in A related to triangle T is the set of all triangles.

Page No 6:

Question 14:

Let L be the set of all lines in XY plane and R be the relation in L defined as R = {(L1, L2): L1 is parallel to L2}. Show that R is an equivalence relation. Find the set of all lines related to the line y = 2x + 4.

Answer:

R = {(L1, L2): L1 is parallel to L2}

R is reflexive as any line L1 is parallel to itself i.e., (L1, L1) ∈ R.

Now,

Let (L1, L2) ∈ R.

L1 is parallel to L2.

L2 is parallel to L1.

⇒ (L2, L1) ∈ R

∴ R is symmetric.

Now,

Let (L1, L2), (L2, L3) ∈R.

L1 is parallel to L2. Also, L2 is parallel to L3.

L1 is parallel to L3.

∴R is transitive.

Hence, R is an equivalence relation.

The set of all lines related to the line y = 2x + 4 is the set of all lines that are parallel to the line y = 2x + 4.

Slope of line y = 2x + 4 is m = 2

It is known that parallel lines have the same slopes.

The line parallel to the given line is of the form y = 2x + c, where cR.

Hence, the set of all lines related to the given line is given by y = 2x + c, where cR.



Page No 7:

Question 15:

Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer.

(A) R is reflexive and symmetric but not transitive.

(B) R is reflexive and transitive but not symmetric.

(C) R is symmetric and transitive but not reflexive.

(D) R is an equivalence relation.

Answer:

R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}

It is seen that (a, a) ∈ R, for every a ∈{1, 2, 3, 4}.

∴ R is reflexive.

It is seen that (1, 2) ∈ R, but (2, 1) ∉ R.

∴R is not symmetric.

Also, it is observed that (a, b), (b, c) ∈ R ⇒ (a, c) ∈ R for all a, b, c ∈ {1, 2, 3, 4}.

∴ R is transitive.

Hence, R is reflexive and transitive but not symmetric.

The correct answer is B.

Page No 7:

Question 16:

Let R be the relation in the set N given by R = {(a, b): a = b − 2, b > 6}. Choose the correct answer.

(A) (2, 4) ∈ R (B) (3, 8) ∈R (C) (6, 8) ∈R (D) (8, 7) ∈ R

Answer:

R = {(a, b): a = b − 2, b > 6}

Now, since b > 6, (2, 4) ∉ R

Also, as 3 ≠ 8 − 2, (3, 8) ∉ R

And, as 8 ≠ 7 − 2

(8, 7) ∉ R

Now, consider (6, 8).

We have 8 > 6 and also, 6 = 8 − 2.

∴(6, 8) ∈ R

The correct answer is C.



Page No 10:

Question 1:

Show that the function f: R*R* defined byis one-one and onto, where R* is the set of all non-zero real numbers. Is the result true, if the domain R* is replaced by N with co-domain being same as R*?

Answer:

It is given that f: R*R* is defined by

One-one:

f is one-one.

Onto:

It is clear that for y R*, there existssuch that

f is onto.

Thus, the given function (f) is one-one and onto.

Now, consider function g: N R*defined by

We have,

g is one-one.

Further, it is clear that g is not onto as for 1.2 ∈R* there does not exit any x in N such that g(x) =.

Hence, function g is one-one but not onto.

Page No 10:

Question 2:

Check the injectivity and surjectivity of the following functions:

(i) f: NN given by f(x) = x2

(ii) f: ZZ given by f(x) = x2

(iii) f: RR given by f(x) = x2

(iv) f: N N given by f(x) = x3

(v) f: ZZ given by f(x) = x3

Answer:

(i) f: NN is given by,

f(x) = x2

It is seen that for x, yN, f(x) = f(y) ⇒ x2 = y2x = y.

f is injective.

Now, 2 ∈ N. But, there does not exist any x in N such that f(x) = x2 = 2.

f is not surjective.

Hence, function f is injective but not surjective.

(ii) f: ZZ is given by,

f(x) = x2

It is seen that f(−1) = f(1) = 1, but −1 ≠ 1.

f is not injective.

Now,−2 ∈ Z. But, there does not exist any element x Z such that f(x) = x2 = −2.

f is not surjective.

Hence, function f is neither injective nor surjective.

(iii) f: RR is given by,

f(x) = x2

It is seen that f(−1) = f(1) = 1, but −1 ≠ 1.

f is not injective.

Now,−2 ∈ R. But, there does not exist any element x R such that f(x) = x2 = −2.

f is not surjective.

Hence, function f is neither injective nor surjective.

(iv) f: NN given by,

f(x) = x3

It is seen that for x, yN, f(x) = f(y) ⇒ x3 = y3x = y.

f is injective.

Now, 2 ∈ N. But, there does not exist any element x in domain N such that f(x) = x3 = 2.

f is not surjective

Hence, function f is injective but not surjective.

(v) f: Z Z is given by,

f(x) = x3

It is seen that for x, yZ, f(x) = f(y) ⇒ x3 = y3x = y.

f is injective.

Now, 2 ∈ Z. But, there does not exist any element x in domain Z such that f(x) = x3 = 2.

f is not surjective.

Hence, function f is injective but not surjective.

Page No 10:

Question 3:

Prove that the Greatest Integer Function f: R R given by f(x) = [x], is neither one-one nor onto, where [x] denotes the greatest integer less than or equal to x.

Answer:

f: RR is given by,

f(x) = [x]

It is seen that f(1.2) = [1.2] = 1, f(1.9) = [1.9] = 1.

f(1.2) = f(1.9), but 1.2 ≠ 1.9.

f is not one-one.

Now, consider 0.7 ∈ R.

It is known that f(x) = [x] is always an integer. Thus, there does not exist any element xR such that f(x) = 0.7.

f is not onto.

Hence, the greatest integer function is neither one-one nor onto.



Page No 11:

Question 4:

Show that the Modulus Function f: R R given by, is neither one-one nor onto, where is x, if x is positive or 0 andis − x, if x is negative.

Answer:

f: RR is given by,

It is seen that.

f(−1) = f(1), but −1 ≠ 1.

f is not one-one.

Now, consider −1 ∈ R.

It is known that f(x) = is always non-negative. Thus, there does not exist any element x in domain R such that f(x) = = −1.

f is not onto.

Hence, the modulus function is neither one-one nor onto.

Page No 11:

Question 5:

Show that the Signum Function f: RR, given by

is neither one-one nor onto.

Answer:

f: RR is given by,

It is seen that f(1) = f(2) = 1, but 1 ≠ 2.

f is not one-one.

Now, as f(x) takes only 3 values (1, 0, or −1) for the element −2 in co-domain R, there does not exist any x in domain R such that f(x) = −2.

f is not onto.

Hence, the signum function is neither one-one nor onto.

Page No 11:

Question 6:

Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B. Show that f is one-one.

Answer:

It is given that A = {1, 2, 3}, B = {4, 5, 6, 7}.

f: AB is defined as f = {(1, 4), (2, 5), (3, 6)}.

f (1) = 4, f (2) = 5, f (3) = 6

It is seen that the images of distinct elements of A under f are distinct.

Hence, function f is one-one.

Page No 11:

Question 7:

In each of the following cases, state whether the function is one-one, onto or bijective. Justify your answer.

(i) f: R R defined by f(x) = 3 − 4x

(ii) f: R R defined by f(x) = 1 + x2

Answer:

(i) f: R R is defined as f(x) = 3 − 4x.

.

f is one-one.

For any real number (y) in R, there existsin R such that

f is onto.

Hence, f is bijective.

(ii) f: R R is defined as

.

.

does not imply that

For instance,

f is not one-one.

Consider an element −2 in co-domain R.

It is seen thatis positive for all xR.

Thus, there does not exist any x in domain R such that f(x) = −2.

f is not onto.

Hence, f is neither one-one nor onto.

Page No 11:

Question 8:

Let A and B be sets. Show that f: A × BB × A such that (a, b) = (b, a) is bijective function.

Answer:

f: A × BB × A is defined as f(a, b) = (b, a).

.

f is one-one.

Now, let (b, a) ∈ B × A be any element.

Then, there exists (a, b) ∈A × B such that f(a, b) = (b, a). [By definition of f]

f is onto.

Hence, f is bijective.

Page No 11:

Question 9:

Let f: NN be defined by

State whether the function f is bijective. Justify your answer.

Answer:

f: NN is defined as

It can be observed that:

f is not one-one.

Consider a natural number (n) in co-domain N.

Case I: n is odd

n = 2r + 1 for some rN. Then, there exists 4r + 1∈N such that

.

Case II: n is even

n = 2r for some rN. Then,there exists 4rN such that.

f is onto.

Hence, f is not a bijective function.

Page No 11:

Question 10:

Let A = R − {3} and B = R − {1}. Consider the function f: A → B defined by

. Is f one-one and onto? Justify your answer.

Answer:

A = R − {3}, B = R − {1}

f: A → B is defined as.

.

f is one-one.

Let y ∈B = R − {1}. Then, y ≠ 1.

The function f is onto if there exists x ∈A such that f(x) = y.

Now,

Thus, for any y ∈ B, there existssuch that

Hence, function f is one-one and onto.

Page No 11:

Question 11:

Let f: RR be defined as f(x) = x4. Choose the correct answer.

(A) f is one-one onto (B) f is many-one onto

(C) f is one-one but not onto (D) f is neither one-one nor onto

Answer:

f: RR is defined as

Let x, y R such that f(x) = f(y).

does not imply that.

For instance,

f is not one-one.

Consider an element 2 in co-domain R. It is clear that there does not exist any x in domain R such that f(x) = 2.

f is not onto.

Hence, function f is neither one-one nor onto.

The correct answer is D.

Page No 11:

Question 12:

Let f: RR be defined as f(x) = 3x. Choose the correct answer.

(A) f is one-one onto (B) f is many-one onto

(C) f is one-one but not onto (D) f is neither one-one nor onto

Answer:

f: RR is defined as f(x) = 3x.

Let x, y R such that f(x) = f(y).

⇒ 3x = 3y

x = y

f is one-one.

Also, for any real number (y) in co-domain R, there exists in R such that.

f is onto.

Hence, function f is one-one and onto.

The correct answer is A.



Page No 18:

Question 1:

Let f: {1, 3, 4} → {1, 2, 5} and g: {1, 2, 5} → {1, 3} be given by f = {(1, 2), (3, 5), (4, 1)} and g = {(1, 3), (2, 3), (5, 1)}. Write down gof.

Answer:

The functions f: {1, 3, 4} → {1, 2, 5} and g: {1, 2, 5} → {1, 3} are defined as

f = {(1, 2), (3, 5), (4, 1)} and g = {(1, 3), (2, 3), (5, 1)}.

Page No 18:

Question 2:

Let f, g and h be functions from R to R. Show that

Answer:

To prove:

Page No 18:

Question 3:

Find gof and fog, if

(i)

(ii)

Answer:

(i)

(ii)

Page No 18:

Question 4:

If, show that f o f(x) = x, for all. What is the inverse of f?

Answer:

It is given that.

Hence, the given function f is invertible and the inverse of f is f itself.

Page No 18:

Question 5:

State with reason whether following functions have inverse

(i) f: {1, 2, 3, 4} → {10} with

f = {(1, 10), (2, 10), (3, 10), (4, 10)}

(ii) g: {5, 6, 7, 8} → {1, 2, 3, 4} with

g = {(5, 4), (6, 3), (7, 4), (8, 2)}

(iii) h: {2, 3, 4, 5} → {7, 9, 11, 13} with

h = {(2, 7), (3, 9), (4, 11), (5, 13)}

Answer:

(i) f: {1, 2, 3, 4} → {10}defined as:

f = {(1, 10), (2, 10), (3, 10), (4, 10)}

From the given definition of f, we can see that f is a many one function as: f(1) = f(2) = f(3) = f(4) = 10

f is not one-one.

Hence, function f does not have an inverse.

(ii) g: {5, 6, 7, 8} → {1, 2, 3, 4} defined as:

g = {(5, 4), (6, 3), (7, 4), (8, 2)}

From the given definition of g, it is seen that g is a many one function as: g(5) = g(7) = 4.

g is not one-one,

Hence, function g does not have an inverse.

(iii) h: {2, 3, 4, 5} → {7, 9, 11, 13} defined as:

h = {(2, 7), (3, 9), (4, 11), (5, 13)}

It is seen that all distinct elements of the set {2, 3, 4, 5} have distinct images under h.

∴Function h is one-one.

Also, h is onto since for every element y of the set {7, 9, 11, 13}, there exists an element x in the set {2, 3, 4, 5}such that h(x) = y.

Thus, h is a one-one and onto function. Hence, h has an inverse.

Page No 18:

Question 6:

Show that f: [−1, 1] → R, given byis one-one. Find the inverse of the function f: [−1, 1] → Range f.

(Hint: For y ∈Range f, y =, for some x in [−1, 1], i.e.,)

Answer:

f: [−1, 1] → R is given as

Let f(x) = f(y).

f is a one-one function.

It is clear that f: [−1, 1] → Range f is onto.

f: [−1, 1] → Range f is one-one and onto and therefore, the inverse of the function:

f: [−1, 1] → Range f exists.

Let g: Range f → [−1, 1] be the inverse of f.

Let y be an arbitrary element of range f.

Since f: [−1, 1] → Range f is onto, we have:

Now, let us define g: Range f → [−1, 1] as

gof = and fog =

f−1 = g

Page No 18:

Question 7:

Consider f: RR given by f(x) = 4x + 3. Show that f is invertible. Find the inverse of f.

Answer:

f: RR is given by,

f(x) = 4x + 3

One-one:

Let f(x) = f(y).

f is a one-one function.

Onto:

For yR, let y = 4x + 3.

Therefore, for any y R, there exists such that

f is onto.

Thus, f is one-one and onto and therefore, f−1 exists.

Let us define g: RR by.

Hence, f is invertible and the inverse of f is given by

Page No 18:

Question 8:

Consider f: R+ → [4, ) given by f(x) = x2 + 4. Show that f is invertible with the inverse f−1 of given f by, where R+ is the set of all non-negative real numbers.

Answer:

f: R+ → [4, ∞) is given as f(x) = x2 + 4.

One-one:

Let f(x) = f(y).

f is a one-one function.

Onto:

For y ∈ [4, ∞), let y = x2 + 4.

Therefore, for any y R, there exists such that

.

f is onto.

Thus, f is one-one and onto and therefore, f−1 exists.

Let us define g: [4, ∞) → R+ by,

Hence, f is invertible and the inverse of f is given by



Page No 19:

Question 9:

Consider f: R+ → [−5, ) given by f(x) = 9x2 + 6x − 5. Show that f is invertible with.

Answer:

f: R+ → [−5, ∞) is given as f(x) = 9x2 + 6x − 5.

Let y be an arbitrary element of [−5, ∞).

Let y = 9x2 + 6x − 5.

f is onto, thereby range f = [−5, ∞).

Let us define g: [−5, ∞) → R+ as

We now have:

and

Hence, f is invertible and the inverse of f is given by

Page No 19:

Question 10:

Let f: XY be an invertible function. Show that f has unique inverse.

(Hint: suppose g1 and g2 are two inverses of f. Then for all yY,

fog1(y) = IY(y) = fog2(y). Use one-one ness of f).

Answer:

Let f: XY be an invertible function.

Also, suppose f has two inverses (say).

Then, for all yY, we have:

Hence, f has a unique inverse.

Page No 19:

Question 11:

Consider f: {1, 2, 3} → {a, b, c} given by f(1) = a, f(2) = b and f(3) = c. Find f−1 and show that (f−1)−1 = f.

Answer:

Function f: {1, 2, 3} → {a, b, c} is given by,

f(1) = a, f(2) = b, and f(3) = c

If we define g: {a, b, c} → {1, 2, 3} as g(a) = 1, g(b) = 2, g(c) = 3, then we have:

and, where X = {1, 2, 3} and Y= {a, b, c}.

Thus, the inverse of f exists and f−1 = g.

f−1: {a, b, c} → {1, 2, 3} is given by,

f−1(a) = 1, f−1(b) = 2, f-1(c) = 3

Let us now find the inverse of f−1 i.e., find the inverse of g.

If we define h: {1, 2, 3} → {a, b, c} as

h(1) = a, h(2) = b, h(3) = c, then we have:

, where X = {1, 2, 3} and Y = {a, b, c}.

Thus, the inverse of g exists and g−1 = h ⇒ (f−1)−1 = h.

It can be noted that h = f.

Hence, (f−1)−1 = f.

Page No 19:

Question 12:

Let f: XY be an invertible function. Show that the inverse of f−1 is f, i.e.,

(f−1)−1 = f.

Answer:

Let f: XY be an invertible function.

Then, there exists a function g: YX such that gof = IXand fog = IY.

Here, f−1 = g.

Now, gof = IXand fog = IY

f−1of = IXand fof−1= IY

Hence, f−1: YX is invertible and f is the inverse of f−1

i.e., (f−1)−1 = f.

Page No 19:

Question 13:

If f: R R be given by, then fof(x) is

(A) (B) x3 (C) x (D) (3 − x3)

Answer:

f: RR is given as.

The correct answer is C.

Page No 19:

Question 14:

Letbe a function defined as. The inverse of f is map g: Range

(A) (B)

(C) (D)

Answer:

It is given that

Let y be an arbitrary element of Range f.

Then, there exists xsuch that


Let us define g: Rangeas

Now,

Thus, g is the inverse of f i.e., f−1 = g.

Hence, the inverse of f is the map g: Range, which is given by

The correct answer is B.



Page No 24:

Question 1:

Determine whether or not each of the definition of given below gives a binary operation. In the event that * is not a binary operation, give justification for this.

(i) On Z+, define * by a * b = a b

(ii) On Z+, define * by a * b = ab

(iii) On R, define * by a * b = ab2

(iv) On Z+, define * by a * b = |a b|

(v) On Z+, define * by a * b = a

Answer:

(i) On Z+, * is defined by a * b = a − b.

It is not a binary operation as the image of (1, 2) under * is 1 * 2 = 1 − 2
= −1 ∉ Z+.

(ii) On Z+, * is defined by a * b = ab.

It is seen that for each a, bZ+, there is a unique element ab in Z+.

This means that * carries each pair (a, b) to a unique element a * b = ab in Z+.

Therefore, * is a binary operation.

(iii) On R, * is defined by a * b = ab2.

It is seen that for each a, bR, there is a unique element ab2 in R.

This means that * carries each pair (a, b) to a unique element a * b = ab2 in R.

Therefore, * is a binary operation.

(iv) On Z+, * is defined by a * b = |a − b|.

It is seen that for each a, bZ+, there is a unique element |a − b| in Z+.

This means that * carries each pair (a, b) to a unique element a * b =
|a − b| in Z+.

Therefore, * is a binary operation.

(v) On Z+, * is defined by a * b = a.

* carries each pair (a, b) to a unique element a * b = a in Z+.

Therefore, * is a binary operation.

Page No 24:

Question 2:

For each binary operation * defined below, determine whether * is commutative or associative.

(i) On Z, define a * b = a b

(ii) On Q, define a * b = ab + 1

(iii) On Q, define a * b

(iv) On Z+, define a * b = 2ab

(v) On Z+, define a * b = ab

(vi) On R − {−1}, define

Answer:

(i) On Z, * is defined by a * b = a − b.

It can be observed that 1 * 2 = 1 − 2 = 1 and 2 * 1 = 2 − 1 = 1.

∴1 * 2 ≠ 2 * 1; where 1, 2 ∈ Z

Hence, the operation * is not commutative.

Also we have:

(1 * 2) * 3 = (1 − 2) * 3 = −1 * 3 = −1 − 3 = −4

1 * (2 * 3) = 1 * (2 − 3) = 1 * −1 = 1 − (−1) = 2

∴(1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ Z

Hence, the operation * is not associative.

(ii) On Q, * is defined by a * b = ab + 1.

It is known that:

ab = ba &mnForE; a, bQ

ab + 1 = ba + 1 &mnForE; a, bQ

a * b = a * b &mnForE; a, bQ

Therefore, the operation * is commutative.

It can be observed that:

(1 * 2) * 3 = (1 × 2 + 1) * 3 = 3 * 3 = 3 × 3 + 1 = 10

1 * (2 * 3) = 1 * (2 × 3 + 1) = 1 * 7 = 1 × 7 + 1 = 8

∴(1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ Q

Therefore, the operation * is not associative.

(iii) On Q, * is defined by a * b

It is known that:

ab = ba &mnForE; a, bQ

&mnForE; a, bQ

a * b = b * a &mnForE; a, bQ

Therefore, the operation * is commutative.

For all a, b, cQ, we have:

Therefore, the operation * is associative.

(iv) On Z+, * is defined by a * b = 2ab.

It is known that:

ab = ba &mnForE; a, bZ+

⇒ 2ab = 2ba &mnForE; a, bZ+

a * b = b * a &mnForE; a, bZ+

Therefore, the operation * is commutative.

It can be observed that:

∴(1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ Z+

Therefore, the operation * is not associative.

(v) On Z+, * is defined by a * b = ab.

It can be observed that:

and

∴ 1 * 2 ≠ 2 * 1 ; where 1, 2 ∈ Z+

Therefore, the operation * is not commutative.

It can also be observed that:

∴(2 * 3) * 4 ≠ 2 * (3 * 4) ; where 2, 3, 4 ∈ Z+

Therefore, the operation * is not associative.

(vi) On R, * − {−1} is defined by

It can be observed that and

∴1 * 2 ≠ 2 * 1 ; where 1, 2 ∈ R − {−1}

Therefore, the operation * is not commutative.

It can also be observed that:

∴ (1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ R − {−1}

Therefore, the operation * is not associative.

Page No 24:

Question 3:

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∨.

Answer:

The binary operation ∨ on the set {1, 2, 3, 4, 5} is defined as a b = min {a, b}

&mnForE; a, b ∈ {1, 2, 3, 4, 5}.

Thus, the operation table for the given operation ∨ can be given as:

1

2

3

4

5

1

1

1

1

1

1

2

1

2

2

2

2

3

1

2

3

3

3

4

1

2

3

4

4

5

1

2

3

4

5



Page No 25:

Question 4:

Consider a binary operation * on the set {1, 2, 3, 4, 5} given by the following multiplication table.

(i) Compute (2 * 3) * 4 and 2 * (3 * 4)

(ii) Is * commutative?

(iii) Compute (2 * 3) * (4 * 5).

(Hint: use the following table)

*

1

2

3

4

5

1

1

1

1

1

1

2

1

2

1

2

1

3

1

1

3

1

1

4

1

2

1

4

1

5

1

1

1

1

5

Answer:

(i) (2 * 3) * 4 = 1 * 4 = 1

2 * (3 * 4) = 2 * 1 = 1

(ii) For every a, b ∈{1, 2, 3, 4, 5}, we have a * b = b * a. Therefore, the operation * is commutative.

(iii) (2 * 3) = 1 and (4 * 5) = 1

∴(2 * 3) * (4 * 5) = 1 * 1 = 1

Page No 25:

Question 5:

Let*be the binary operation on the set {1, 2, 3, 4, 5} defined by a *b = H.C.F. of a and b. Is the operation * same as the operation * defined in Exercise 4 above? Justify your answer.

Answer:

The binary operation *′ on the set {1, 2, 3 4, 5} is defined as a *′ b = H.C.F of a and b.

The operation table for the operation *′ can be given as:

*′

1

2

3

4

5

1

1

1

1

1

1

2

1

2

1

2

1

3

1

1

3

1

1

4

1

2

1

4

1

5

1

1

1

1

5

We observe that the operation tables for the operations * and *′ are the same.

Thus, the operation *′ is same as the operation*.

Page No 25:

Question 6:

Let * be the binary operation on N given by a * b = L.C.M. of a and b. Find

(i) 5 * 7, 20 * 16 (ii) Is * commutative?

(iii) Is * associative? (iv) Find the identity of * in N

(v) Which elements of N are invertible for the operation *?

Answer:

The binary operation * on N is defined as a * b = L.C.M. of a and b.

(i) 5 * 7 = L.C.M. of 5 and 7 = 35

20 * 16 = L.C.M of 20 and 16 = 80

(ii) It is known that:

L.C.M of a and b = L.C.M of b and a &mnForE; a, bN.

a * b = b * a

Thus, the operation * is commutative.

(iii) For a, b, c N, we have:

(a * b) * c = (L.C.M of a and b) * c = LCM of a, b, and c

a * (b * c) = a * (LCM of b and c) = L.C.M of a, b, and c

∴(a * b) * c = a * (b * c)

Thus, the operation * is associative.

(iv) It is known that:

L.C.M. of a and 1 = a = L.C.M. 1 and a &mnForE; aN

a * 1 = a = 1 * a &mnForE; aN

Thus, 1 is the identity of * in N.

(v) An element a in N is invertible with respect to the operation * if there exists an element b in N, such that a * b = e = b * a.

Here, e = 1

This means that:

L.C.M of a and b = 1 = L.C.M of b and a

This case is possible only when a and b are equal to 1.

Thus, 1 is the only invertible element of N with respect to the operation *.

Page No 25:

Question 7:

Is * defined on the set {1, 2, 3, 4, 5} by a * b = L.C.M. of a and b a binary operation? Justify your answer.

Answer:

The operation * on the set A = {1, 2, 3, 4, 5} is defined as

a * b = L.C.M. of a and b.

Then, the operation table for the given operation * can be given as:

*

1

2

3

4

5

1

1

2

3

4

5

2

2

2

6

4

10

3

3

6

3

12

15

4

4

4

12

4

20

5

5

10

15

20

5

It can be observed from the obtained table that:

3 * 2 = 2 * 3 = 6 ∉ A, 5 * 2 = 2 * 5 = 10 ∉ A, 3 * 4 = 4 * 3 = 12 ∉ A

3 * 5 = 5 * 3 = 15 ∉ A, 4 * 5 = 5 * 4 = 20 ∉ A

Hence, the given operation * is not a binary operation.

Page No 25:

Question 8:

Let * be the binary operation on N defined by a * b = H.C.F. of a and b. Is * commutative? Is * associative? Does there exist identity for this binary operation on N?

Answer:

The binary operation * on N is defined as:

a * b = H.C.F. of a and b

It is known that:

H.C.F. of a and b = H.C.F. of b and a &mnForE; a, bN.

a * b = b * a

Thus, the operation * is commutative.

For a, b, c N, we have:

(a * b)* c = (H.C.F. of a and b) * c = H.C.F. of a, b, and c

a *(b * c)= a *(H.C.F. of b and c) = H.C.F. of a, b, and c

∴(a * b) * c = a * (b * c)

Thus, the operation * is associative.

Now, an element e N will be the identity for the operation * if a * e = a = e* a a N.

But this relation is not true for any a N.

Thus, the operation * does not have any identity in N.

Page No 25:

Question 9:

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 (iv) a * b = (a b)2

(v) (vi) a * b = ab2

Find which of the binary operations are commutative and which are associative.

Answer:

(i) On Q, the operation * is defined as a * b = a − b.

It can be observed that:

and

; where

Thus, the operation * is not commutative.

It can also be observed that:

Thus, the operation * is not associative.

(ii) On Q, the operation * is defined as a * b = a2 + b2.

For a, bQ, we have:

a * b = b * a

Thus, the operation * is commutative.

It can be observed that:
(1*2)*3 =(12 + 22)*3 = (1+4)*3 = 5*3 = 52+32= 25 + 9 = 34
1*(2*3)=1*(22+32) = 1*(4+9) = 1*13 = 12+ 132 = 1 + 169 = 170
∴ (1*2)*3 ≠ 1*(2*3) , where 1, 2, 3 ∈ Q

Thus, the operation * is not associative.

(iii) On Q, the operation * is defined as a * b = a + ab.

It can be observed that:

Thus, the operation * is not commutative.

It can also be observed that:

Thus, the operation * is not associative.

(iv) On Q, the operation * is defined by a * b = (a − b)2.

For a, bQ, we have:

a * b = (a − b)2

b * a = (b − a)2 = [− (a − b)]2 = (a − b)2

a * b = b * a

Thus, the operation * is commutative.

It can be observed that:

Thus, the operation * is not associative.

(v) On Q, the operation * is defined as

For a, bQ, we have:

a * b = b * a

Thus, the operation * is commutative.

For a, b, cQ, we have:

∴(a * b) * c = a * (b * c)

Thus, the operation * is associative.

(vi) On Q, the operation * is defined as a * b = ab2

It can be observed that:

Thus, the operation * is not commutative.

It can also be observed that:

Thus, the operation * is not associative.

Hence, the operations defined in (ii), (iv), (v) are commutative and the operation defined in (v) is associative.

Page No 25:

Question 10:

Find which of the operations given above has identity.

Answer:

An element e Q will be the identity element for the operation * if

a * e = a = e * a, aQ.

We are given

a * b = ab4

 a*e = aae4=a e=4Similarly, it can be checked for e*a=a, we get e=4Thus, e = 4 is the identity.

Page No 25:

Question 11:

Let A = N × N and * be the binary operation on A defined by

(a, b) * (c, d) = (a + c, b + d)

Show that * is commutative and associative. Find the identity element for * on A, if any.

Answer:

A = N × N

* is a binary operation on A and is defined by:

(a, b) * (c, d) = (a + c, b + d)

Let (a, b), (c, d) ∈ A

Then, a, b, c, dN

We have:

(a, b) * (c, d) = (a + c, b + d)

(c, d) * (a, b) = (c + a, d + b) = (a + c, b + d)

[Addition is commutative in the set of natural numbers]

∴(a, b) * (c, d) = (c, d) * (a, b)

Therefore, the operation * is commutative.

Now, let (a, b), (c, d), (e, f) ∈A

Then, a, b, c, d, e, f N

We have:

Therefore, the operation * is associative.

An element will be an identity element for the operation * if

, i.e., which is not true for any element in A.

Therefore, the operation * does not have any identity element.



Page No 26:

Question 12:

State whether the following statements are true or false. Justify.

(i) For an arbitrary binary operation * on a set N, a * a = a a * N.

(ii) If * is a commutative binary operation on N, then a * (b * c) = (c * b) * a

Answer:

(i) Define an operation * on N as:

a * b = a + b a, b N

Then, in particular, for b = a = 3, we have:

3 * 3 = 3 + 3 = 6 ≠ 3

Therefore, statement (i) is false.

(ii) R.H.S. = (c * b) * a

= (b * c) * a [* is commutative]

= a * (b * c) [Again, as * is commutative]

= L.H.S.

a * (b * c) = (c * b) * a

Therefore, statement (ii) is true.

Page No 26:

Question 13:

Consider a binary operation * on N defined as a * b = a3 + b3. 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?

Answer:

On N, the operation * is defined as a * b = a3 + b3.

For, a, b, ∈ N, we have:

a * b = a3 + b3 = b3 + a3 = b * a [Addition is commutative in N]

Therefore, the operation * is commutative.

It can be observed that:

∴(1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ N

Therefore, the operation * is not associative.

Hence, the operation * is commutative, but not associative. Thus, the correct answer is B.



Page No 29:

Question 1:

Let f: RR be defined as f(x) = 10x + 7. Find the function g: RR such that g o f = f o g = 1R.

Answer:

It is given that f: RR is defined as f(x) = 10x + 7.

One-one:

Let f(x) = f(y), where x, yR.

⇒ 10x + 7 = 10y + 7

x = y

f is a one-one function.

Onto:

For y R, let y = 10x + 7.

Therefore, for any y R, there exists such that

f is onto.

Therefore, f is one-one and onto.

Thus, f is an invertible function.

Let us define g: RR as

Now, we have:

Hence, the required function g: RR is defined as.

Page No 29:

Question 2:

Let f: W → W be defined as f(n) = n − 1, if is odd and f(n) = n + 1, if n is even. Show that f is invertible. Find the inverse of f. Here, W is the set of all whole numbers.

Answer:

It is given that:

f: W → W is defined as

One-one:

Let f(n) = f(m).

It can be observed that if n is odd and m is even, then we will have n − 1 = m + 1.

nm = 2

However, this is impossible.

Similarly, the possibility of n being even and m being odd can also be ignored under a similar argument.

∴Both n and m must be either odd or even.

Now, if both n and m are odd, then we have:

f(n) = f(m) ⇒ n − 1 = m − 1 ⇒ n = m

Again, if both n and m are even, then we have:

f(n) = f(m) ⇒ n + 1 = m + 1 ⇒ n = m

f is one-one.

It is clear that any odd number 2r + 1 in co-domain N is the image of 2r in domain N and any even number 2r in co-domain N is the image of 2r + 1 in domain N.

f is onto.

Hence, f is an invertible function.

Let us define g: W → W as:

Now, when n is odd:

And, when n is even:

Similarly, when m is odd:

When m is even:

Thus, f is invertible and the inverse of f is given by f—1 = g, which is the same as f.

Hence, the inverse of f is f itself.

Page No 29:

Question 3:

If f: R R is defined by f(x) = x2 − 3x + 2, find f(f(x)).

Answer:

It is given that f: RR is defined as f(x) = x2 − 3x + 2.

Page No 29:

Question 4:

Show that function f: R → {xR: −1 < x < 1} defined by f(x) =, x R is one-one and onto function.

Answer:

It is given that f: R → {xR: −1 < x < 1} is defined as f(x) =, x R.

Suppose f(x) = f(y), where x, y R.

It can be observed that if x is positive and y is negative, then we have:

Since x is positive and y is negative:

x > yxy > 0

But, 2xy is negative.

Then, .

Thus, the case of x being positive and y being negative can be ruled out.

Under a similar argument, x being negative and y being positive can also be ruled out

x and y have to be either positive or negative.

When x and y are both positive, we have:

When x and y are both negative, we have:

f is one-one.

Now, let yR such that −1 < y < 1.

If x is negative, then there existssuch that

If x is positive, then there existssuch that

f is onto.

Hence, f is one-one and onto.

Page No 29:

Question 5:

Show that the function f: RR given by f(x) = x3 is injective.

Answer:

f: RR is given as f(x) = x3.

Suppose f(x) = f(y), where x, yR.

x3 = y3 … (1)

Now, we need to show that x = y.

Suppose xy, their cubes will also not be equal.

x3y3

However, this will be a contradiction to (1).

x = y

Hence, f is injective.

Page No 29:

Question 6:

Give examples of two functions f: NZ and g: ZZ such that g o f is injective but g is not injective.

(Hint: Consider f(x) = x and g(x) =)

Answer:

Define f: NZ as f(x) = x and g: ZZ as g(x) =.

We first show that g is not injective.

It can be observed that:

g(−1) =

g(1) =

g(−1) = g(1), but −1 ≠ 1.

g is not injective.

Now, gof: NZ is defined as.

Let x, yN such that gof(x) = gof(y).

Since x and yN, both are positive.

Hence, gof is injective

Page No 29:

Question 7:

Given examples of two functions f: NN and g: NN such that gof is onto but f is not onto.

(Hint: Consider f(x) = x + 1 and

Answer:

Define f: NN by,

f(x) = x + 1

And, g: NN by,

We first show that g is not onto.

For this, consider element 1 in co-domain N. It is clear that this element is not an image of any of the elements in domain N.

f is not onto.

Now, gof: NN is defined by,

Then, it is clear that for yN, there exists x = y N such that gof(x) = y.

Hence, gof is onto.

Page No 29:

Question 8:

Given a non empty set X, consider P(X) which is the set of all subsets of X.

Define the relation R in P(X) as follows:

For subsets A, B in P(X), ARB if and only if AB. Is R an equivalence relation on P(X)? Justify you answer:

Answer:

Since every set is a subset of itself, ARA for all A ∈ P(X).

∴R is reflexive.

Let ARBAB.

This cannot be implied to BA.

For instance, if A = {1, 2} and B = {1, 2, 3}, then it cannot be implied that B is related to A.

∴ R is not symmetric.

Further, if ARB and BRC, then AB and B C.

AC

ARC

∴ R is transitive.

Hence, R is not an equivalence relation since it is not symmetric.



Page No 30:

Question 9:

Given a non-empty set X, consider the binary operation *: P(X) × P(X) → P(X) given by A * B = AB &mnForE; A, B in P(X) is the power set of X. Show that X is the identity element for this operation and X is the only invertible element in P(X) with respect to the operation*.

Answer:

It is given that.

We know that.

Thus, X is the identity element for the given binary operation *.

Now, an elementis invertible if there existssuch that

This case is possible only when A = X = B.

Thus, X is the only invertible element in P(X) with respect to the given operation*.

Hence, the given result is proved.

Page No 30:

Question 10:

Find the number of all onto functions from the set {1, 2, 3, … , n) to itself.

Answer:

Onto functions from the set {1, 2, 3, … ,n} to itself is simply a permutation on n symbols 1, 2, …, n.

Thus, the total number of onto maps from {1, 2, … , n} to itself is the same as the total number of permutations on n symbols 1, 2, …, n, which is n!.

Page No 30:

Question 11:

Let S = {a, b, c} and T = {1, 2, 3}. Find F−1 of the following functions F from S to T, if it exists.

(i) F = {(a, 3), (b, 2), (c, 1)} (ii) F = {(a, 2), (b, 1), (c, 1)}

Answer:

S = {a, b, c}, T = {1, 2, 3}

(i) F: ST is defined as:

F = {(a, 3), (b, 2), (c, 1)}

⇒ F (a) = 3, F (b) = 2, F(c) = 1

Therefore, F−1: TS is given by

F−1 = {(3, a), (2, b), (1, c)}.

(ii) F: ST is defined as:

F = {(a, 2), (b, 1), (c, 1)}

Since F (b) = F (c) = 1, F is not one-one.

Hence, F is not invertible i.e., F−1 does not exist.

Page No 30:

Question 12:

Consider the binary operations*: R ×R → and o: R × RR defined as and a o b = a, &mnForE;a, bR. Show that * is commutative but not associative, o is associative but not commutative. Further, show that &mnForE;a, b, cR, a*(b o c) = (a * b) o (a * c). [If it is so, we say that the operation * distributes over the operation o]. Does o distribute over *? Justify your answer.

Answer:

It is given that *: R ×R → and o: R × RR isdefined as

and a o b = a, &mnForE;a, bR.

For a, bR, we have:

a * b = b * a

∴ The operation * is commutative.

It can be observed that,

∴The operation * is not associative.

Now, consider the operation o:

It can be observed that 1 o 2 = 1 and 2 o 1 = 2.

∴1 o 2 ≠ 2 o 1 (where 1, 2 ∈ R)

∴The operation o is not commutative.

Let a, b, c R. Then, we have:

(a o b) o c = a o c = a

a o (b o c) = a o b = a

a o b) o c = a o (b o c)

∴ The operation o is associative.

Now, let a, b, c R, then we have:

a * (b o c) = a * b =

(a * b) o (a * c) =

Hence, a * (b o c) = (a * b) o (a * c).

Now,

1 o (2 * 3) =

(1 o 2) * (1 o 3) = 1 * 1 =

∴1 o (2 * 3) ≠ (1 o 2) * (1 o 3) (where 1, 2, 3 ∈ R)

The operation o does not distribute over *.

Page No 30:

Question 13:

Given a non-empty set X, let *: P(X) × P(X) → P(X) be defined as A * B = (AB) ∪ (BA), &mnForE; A, B ∈ P(X). Show that the empty set Φ is the identity for the operation * and all the elements A of P(X) are invertible with A−1 = A. (Hint: (AΦ) ∪ (ΦA) = A and (AA) ∪ (AA) = A * A = Φ).

Answer:

It is given that *: P(X) × P(X) → P(X) is defined as

A * B = (AB) ∪ (BA) &mnForE; A, B ∈ P(X).

Let A ∈ P(X). Then, we have:

A * Φ = (AΦ) ∪ (ΦA) = AΦ = A

Φ * A = (ΦA) ∪ (AΦ) = ΦA = A

A * Φ = A = Φ * A. &mnForE; A ∈ P(X)

Thus, Φ is the identity element for the given operation*.

Now, an element A ∈ P(X) will be invertible if there exists B ∈ P(X) such that

A * B = Φ = B * A. (As Φ is the identity element)

Now, we observed that.

Hence, all the elements A of P(X) are invertible with A−1 = A.

Page No 30:

Question 14:

Define a binary operation *on the set {0, 1, 2, 3, 4, 5} as

Show that zero is the identity for this operation and each element a ≠ 0 of the set is invertible with 6 − a being the inverse of a.

Answer:

Let X = {0, 1, 2, 3, 4, 5}.

The operation * on X is defined as:

An element eX is the identity element for the operation *, if

Thus, 0 is the identity element for the given operation *.

An element aX is invertible if there exists bX such that a * b = 0 = b * a.

i.e.,

a = −b or b = 6 − a

But, X = {0, 1, 2, 3, 4, 5} and a, bX. Then, a ≠ −b.

b = 6 − a is the inverse of a &mnForE; aX.

Hence, the inverse of an element aX, a ≠ 0 is 6 − a i.e., a−1 = 6 − a.

Page No 30:

Question 15:

Let A = {−1, 0, 1, 2}, B = {−4, −2, 0, 2} and f, g: AB be functions defined by f(x) = x2x, x ∈ A and. Are f and g equal?

Justify your answer. (Hint: One may note that two function f: AB and g: A → B such that f(a) = g(a) &mnForE;aA, are called equal functions).

Answer:

It is given that A = {−1, 0, 1, 2}, B = {−4, −2, 0, 2}.

Also, it is given that f, g: AB are defined by f(x) = x2x, xA and.

It is observed that:

Hence, the functions f and g are equal.

Page No 30:

Question 16:

Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is

(A) 1 (B) 2 (C) 3 (D) 4

Answer:

The given set is A = {1, 2, 3}.

The smallest relation containing (1, 2) and (1, 3) which is reflexive and symmetric, but not transitive is given by:

R = {(1, 1), (2, 2), (3, 3), (1, 2), (1, 3), (2, 1), (3, 1)}

This is because relation R is reflexive as (1, 1), (2, 2), (3, 3) ∈ R.

Relation R is symmetric since (1, 2), (2, 1) ∈R and (1, 3), (3, 1) ∈R.

But relation R is not transitive as (3, 1), (1, 2) ∈ R, but (3, 2) ∉ R.

Now, if we add any two pairs (3, 2) and (2, 3) (or both) to relation R, then relation R will become transitive.

Hence, the total number of desired relations is one.

The correct answer is A.

Page No 30:

Question 17:

Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is

(A) 1 (B) 2 (C) 3 (D) 4

Answer:

It is given that A = {1, 2, 3}.

The smallest equivalence relation containing (1, 2) is given by,

R1 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)}

Now, we are left with only four pairs i.e., (2, 3), (3, 2), (1, 3), and (3, 1).

If we odd any one pair [say (2, 3)] to R1, then for symmetry we must add (3, 2). Also, for transitivity we are required to add (1, 3) and (3, 1).

Hence, the only equivalence relation (bigger than R1) is the universal relation.

This shows that the total number of equivalence relations containing (1, 2) is two.

The correct answer is B.



Page No 31:

Question 18:

Let f: RR be the Signum Function defined as

and g: RR be the Greatest Integer Function given by g(x) = [x], where [x] is greatest integer less than or equal to x. Then does fog and gof coincide in (0, 1]?

Answer:

It is given that,

f: RR is defined as

Also, g: RR is defined as g(x) = [x], where [x] is the greatest integer less than or equal to x.

Now, let x ∈ (0, 1].

Then, we have:

[x] = 1 if x = 1 and [x] = 0 if 0 < x < 1.

Thus, when x ∈ (0, 1), we have fog(x) = 0and gof (x) = 1.

Hence, fog and gof do not coincide in (0, 1].

Page No 31:

Question 19:

Number of binary operations on the set {a, b} are

(A) 10 (B) 16 (C) 20 (D) 8

Answer:

A binary operation * on {a, b} is a function from {a, b} × {a, b} → {a, b}

i.e., * is a function from {(a, a), (a, b), (b, a), (b, b)} → {a, b}.

Hence, the total number of binary operations on the set {a, b} is 24 i.e., 16.

The correct answer is B.



View NCERT Solutions for all chapters of Class 15