# Class 12 RD Sharma Solutions – Chapter 1 Relations – Exercise 1.1 | Set 2

**Question 11. Is it true every relation which is symmetric and transitive is also reflexive? Give reasons.**

**Solution:**

We will verify this by taking an example.

Consider a set A = {1, 2, 3} and a relation R on A such that R = { (1, 2), (2,1), (2,3), (1,3) }

The relation R over the set A is symmetric and transitive.

But, it is not reflexive.

(1,1),(2, 2) and (3,3) âˆ‰ R.

Therefore, R is not a reflexive relation.

Hence, it not true that every relation which is symmetric and transitive is also reflexive because it is possible that all pairs of type (x, x) is not present in the relation.

**Question 12. An integer m is said to be related to another integer n if m is multiple of n. Check if the relation is symmetric, reflexive and transitive.**

**Solution:**

Let us define a relation such that

R = {m, n : m, n âˆˆ Z, m = kÃ—n} where, k âˆˆ N (natural number)

First let us check whether the relation is reflexive or not. A relation ‘R’ on a set ‘A’ is said to be reflexive if (x R x) âˆ€ x âˆˆ A i.e. (x, x) âˆˆ R âˆ€ x âˆˆ A.

Let m be an element of R.

Then, m = kÃ—m is true for k=1

(m, m) âˆˆ R.

So, R is reflexive.

Check whether the relation is Symmetric relation or not. A relation R on set A is symmetric if (a, b)âˆˆ R and (b, a)âˆˆ R for all (a, b)âˆˆ A.

Let (m, n) âˆˆ R

â‡’ m = kÃ—n for some k âˆˆ N

and according to transitivity, n = (1/k)Ã—m for some k âˆˆ N but, 1/k âˆ‰ N.

So, R is not a symmetric relation.

Now check whether the relation is Transitive or not. A relation ‘R’ is said to be Transitive over set ‘A’ if (x, y) âˆˆ R and (y, z) âˆˆ R then (x, z) âˆˆ R âˆ€ x, y, z âˆˆ A.

Let m, n, o be any elements of R then, (m, n) and (n, o) âˆˆ R

â‡’ m = k1Ã—n and n = k2Ã—o for some k1, k2 âˆˆ N

â‡’ m = (k1Ã—k2)Ã—o

â‡’ (m, o) âˆˆ R.

So, R is a transitive relation.

**Question 13. Show that the relation “**â‰¥**” on the set R of all real number is reflexive, transitive but not symmetric.**

**Solution:**

Let us define a relation R as

R = { (a, b) a, b âˆˆ R ; a â‰¥ b }

First let us check whether the relation is reflexive or not. A relation ‘R’ on a set ‘A’ is said to be reflexive if (x R x) âˆ€ x âˆˆ A i.e. (x, x) âˆˆ R âˆ€ x âˆˆ A.

Let a be an element of R.

â‡’ a âˆˆ R

â‡’ a â‰¥ a , which is always true.

â‡’ (a, a) âˆˆ R

Hence, R is a reflexive relation.

Check whether the relation is Symmetric relation or not. A relation R on set A is symmetric if (a, b)âˆˆ R and (b, a)âˆˆ R for all (a, b)âˆˆ A.

Let (a, b) âˆˆ R.

â‡’ a â‰¥ b

â‡’ b â‰¥ a [according to transitivity]

but it is not always true except when a=b.

â‡’ (b, a) âˆ‰ R

Hence, R is not a symmetric relation.

Now check whether the relation is Transitive or not. A relation ‘R’ is said to be Transitive over set ‘A’ if (x, y) âˆˆ R and (y, z) âˆˆ R then (x, z) âˆˆ R âˆ€ x, y, z âˆˆ A.

Let (a, b) and (b, c) âˆˆ R

â‡’ a â‰¥ b and b â‰¥ c

â‡’ a â‰¥ b â‰¥ c

â‡’ a â‰¥ c

â‡’ (a, c) âˆˆ R

Hence, R is a transitive relation.

**Question 14. Give an example of a relation. Which is**

**(i) Reflexive and symmetric but not transitive. ****(ii)** **Reflexive and transitive but not symmetric. ****(iii)** **Symmetric and transitive but not reflexive. ****(iv) Symmetric but neither reflexive nor transitive. ****(v) Transitive but neither reflexive nor symmetric.**

**Solution:**

Reflexive Relation:

A relation ‘R’ on a set ‘A’ is said to be reflexive if (x R x) âˆ€ x âˆˆ A i.e. (x, x) âˆˆ R âˆ€ x âˆˆ A.Symmetric Relation:

A relation R on set A is symmetric if (a, b)âˆˆ R and (b, a)âˆˆ R for all (a, b)âˆˆ A.Transitive Relation:

A relation ‘R’ is said to be Transitive over set ‘A’ if (x, y) âˆˆ R and (y, z) âˆˆ R then (x, z) âˆˆ R âˆ€ x, y, z âˆˆ A.Let A be a set as,

A = {1, 2, 3J

(i)Let R be the relation on A such thatR = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (2, 3}

Thus, R is reflexive and symmetric, but not transitive.

(ii)Let R be the relation on A such that AR= { (1,1), (2, 2), (3, 3), (1, 2), (1, 3), (2, 3) }Clearly, the relation R on A is reflexive and transitive, but not symmetric.

(iii)Let R be the relation on A such that R = { (1, 2), (2, 1), (1, 3), (3,1), (2, 3) }We see that the relation R on A is symmetric and transitive, but not reflexive.

(iv)Let R be the relation on A such that R = { (1, 2), (2, 1), (1, 3), (3, 1) }The relation R on A is symmetric, but neither reflexive nor transitive.

(v)Let R be the relation on A such that R = { (1, 2), (2, 3) ,(1, 3) }The relation R on A is transitive, but neither symmetric nor reflexive.

**Question 15. Given the relation R={(1, 2), (2, 3)} on the set A={1, 2, 3}, add a minimum number of ordered pairs so that the enlarged relation is symmetric, reflexive**,** and transitive.**

**Solution:**

We have given the relation,

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

For R to be reflexive it must have (1,1), (2, 2), (3,3).

For R to be a symmetric relation, all the ordered pairs upon interchanging the elements must be present in the relation R. Therefore, R must contain (2,1 ) and (3, 2), (3,1), (1,3).

And for to be a transitive relation, it must contain (1,3).

Hence, the number of ordered pairs to be added to R is 7, i.e. {(1,1), (2, 2), (3,3), (1,3), (3,1), (2,1), (3, 2)}.

**Question 16. Let A={1, 2, 3} and R={(1, 2), (1, 1), (2, 3)} be a relation on A. What minimum number of ordered pairs to be added in R so that it may become a transitive relation on A.**

**Solution:**

The relation R on A is given such that R = {(1, 2), (1,1), (2,3)}

For the relation R to be transitive, we must have (1, 2) âˆˆ R, since (2, 3) âˆˆ R

â‡’ (1,3) âˆˆ R

Therefore, the minimum number of ordered pairs need to be added to relation R is 1, i.e. (1, 3) to make it a transitive relation on A.

**Question 17. Let A={a, b, c} and a relation R to 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 it reflexive and transitive.**

**Solution:**

We have given a set A = {a, b, c} and a relation R={(a, a), (b, c), (a, b)}.

For relation to be reflexive, it should contain (b, b) and (c, c).

And for relation to be transitive R should contain (a, c) since (a, b) âˆˆ R and (b, c) âˆˆ R

Therefore, the minimum number of ordered pair to be added to relation R is (b, b) , (c, c) and (a, c) i.e. 3.

**Question 18. Each of the following defines a relation on N **

**(i) x > y, x, y âˆˆ N****(ii) x + y =10, x, y âˆˆ N****(iii) xy is a square of integer,** **x, y âˆˆ N****(iv) x + 4y =10, x, y âˆˆ N**

**Determine which of the above relations are symmetric, reflexive**,** and transitive.**

**Solution:**

(i)We have given the relation defined as

R = {(x > y), x, y âˆˆ N}First let us check whether the relation is reflexive or not. A relation ‘R’ on a set ‘A’ is said to be reflexive if (x R x) âˆ€ x âˆˆ A i.e. (x, x) âˆˆ R âˆ€ x âˆˆ A.

if (x, x) âˆˆ R then, x > x, which is not true.

â‡’ (x, x) âˆ‰ RSo, the relation is not a reflexive relation.

Now check whether the relation is Symmetric relation or not. A relation R on set A is symmetric if (a, b)âˆˆ R and (b, a)âˆˆ R for all (a, b)âˆˆ A.

Let (x, y) âˆˆ R, then x R y

â‡’ x > y

and according to symmetric property, (y, x) âˆˆ R

â‡’ y > x, but it is not true since x > y

â‡’ (x, y) âˆˆ R but (y, x) âˆ‰ R

So, the relation is not a symmetric relation.

Now check whether the relation is Transitive or not. A relation ‘R’ is said to be Transitive over set ‘A’ if (x, y) âˆˆ R and (y, z) âˆˆ R then (x, z) âˆˆ R âˆ€ x, y, z âˆˆ A.

Let (x, y) âˆˆ R and (y, z) âˆˆ R

â‡’ x > y and y > z

â‡’ x > z

â‡’ (x, z) âˆˆ R

So, R is a transitive relation as well.

(ii)We have given the relation defined as

R = { x + y =10, x, y âˆˆ N }Clearly, the relation will be R = { (1, 9), (2, 8), (3, 7), (4, 6), (5, 5), (6, 4), (7, 3), (8, 2), (9, 1) }

We can see that, (1, 1) âˆ‰ R.

So, R is not a reflexive relation.

Now check whether the relation is Symmetric relation or not. A relation R on set A is symmetric if (a, b)âˆˆ R and (b, a)âˆˆ R for all (a, b)âˆˆ A.

By observing the above relation, we can say that âˆ€ (x, y) âˆˆ R, (y, x) âˆˆ R.

So, R is a symmetric relation.

In the relation, (1, 9) âˆˆ R and (9, 1) âˆˆ R but (1, 1) âˆ‰ R

So, R is not a transitive relation.

(iii)We have given the relation as

R = { xy is a square of integer, x, y âˆˆ N }Clearly, (x, x) âˆˆ R âˆ€ x âˆˆ N

since, x

^{2}is square of an integer for any x âˆˆ N.Hence, R is a reflexive relation.

Now check whether the relation is Symmetric relation or not. A relation R on set A is symmetric if (a, b)âˆˆ R and (b, a)âˆˆ R for all (a, b)âˆˆ A.

Let (x, y) âˆˆ R

â‡’ xy is a square of an integer

â‡’ yx is also a square of the same integer since, xy = yx

â‡’ (y, x) âˆˆ R

So, the relation is a symmetric relation.

Let (x, y) âˆˆ R and (y, z) âˆˆ R

â‡’ xy is an square of an integer and yz is an square of integer

Then let xy = m

^{2}and yz = n^{2}for some m, n âˆˆ Zâ‡’ x = m

^{2}/y and z = n^{2}/yâ‡’ xz = (m

^{2}n^{2})/y^{2 }, which is also a square of an integerâ‡’ (x, z) âˆˆ R

So, R is a transitive relation.

(iv)We have given the relation as

R = { x + 4y =10, x, y âˆˆ N }Clearly, the relation will be R = {(2, 2), (6, 1)} [since x, y âˆˆ N]

(1, 1) âˆ‰ R

So, the relation R is not reflexive.

We can see that, (1, 6) R but (6, 1) R

So, R is not a symmetric relation.

From the definition, we can see that R is a transitive relation.