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.

A = {1,2, 3}
R = {(1.2), (2, 1)}
Since (a, a) ∈ R ∀ a ∈ A R is not reflexive Now (1, 2) ∈ R ⇒ (2, 1) ∈ R and (2, 1) ∈ R ⇒ (1,2) ∈ R ∴ (a, b) ∈ R ⇒ (b, a) ∈ R ∀ (a, b) ∈ R ∴ R is symmetric Again (1, 2) ∈ R and (2, 1) ∈ R but (1, 1) ∉ R ∴ R is not transitive.

170 Views

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


(i) Let A = {1, 2}.
Then A x A = {(1,1), (1,2), (2,1), (2,2) }.
Let R = {(1,2), (2,1 )} .
Then R ⊆ A x A and hence R is a relation on the set A.
R is symmetric since (a, b) ∈ R ⇒ (b. a) ∈ R.
R is not reflexive since I ∈ A but (1,1) ∉ R.
R is not transitive since (1, 2) ∈ R, (2,1) ∈ R but (1,1) ∉ R.
(ii) Let A = {1,2,3}
Then A x A = {(1,1), (1,2), (1,3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3)}.
Let R = {(1,1), (2,2), (1,2), (2,1), (1,3), (2,3)}.
Then R is transitive since (a, b) ∈ R, (b, c) ∈ R ⇒ (a, c) ∈ R.
R is not reflexive since 3 G A but (3.3) ∉ R.
R is not symmetric since (1,3) ∈R but (3,1) ∉ R.
(iii) Let A = {1,2 3}
Then A x A = {(1, 1), (1,2), (1,3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3) }.
Let R = {(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2)}.
R is a relation on A as R ⊆ A x A.
R is reflexive as (a, a) ∈ R ∀ a ∈ A.
Also. R is symmetric since (a. b) ∈ R implies that (b, a) ∈R.
But R is not transitive since (1,2) ∈R arid (2,3) ∈R but (1,3) ∢ R.
(iv) Let A = {1,2,3}.
Then A x A = {(1,1), (1,2), (1,3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3)}.
Let R = {(1,1), (2,2), (3,3), (1,3)}.
Then R is a relation on A as R ⊆ A x A.
R is reflexive since (a, a) ∈R ∀ a ∈ A.
R is not symmetric as (1,3) ∈R and (3,1) ∉ R. R is transitive since (a, b) ∈R and (b, c) ∈R implies that (a, c) ∈R.
(v) Let A = {1,2,3}
Then A x A = {(1,1), (1,2), (1, 3), (2,1), (2,2), (2,3), (3,1), (3,2), (3,3)}
Let R = {(1,1), (1,2), (2,1), (2,2)}.
R is not reflexive as 3∈ A and (3,3) ∉ R.
R is symmetric as (a, b) ∈ R ⇒ (b, a) ∈R.
R is transitive since (a, b) ∈ R and (b, c) ∈R implies that (a, c) ∈ R.

172 Views

Advertisement

Let A be the set of all students of a boys school. Show that the relation R in A given by R = {(a, b) : a is sister of b} is the empty relation and R’ = {(a, b) : the difference between heights of a and b is less than 3 meters} is the universal relation.


Since the school is boys school i.e. there is not girl student no student of the school can be sister of any student of the school.
∴ R ⇒ R is the empty relation.
Clearly the difference between heights of a and b is less than 3 metres.
∴ R’ = A x A is the universal relation.

212 Views

Advertisement
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 perpendicular to L2}. Show that R is symmetric but neither reflexive nor transitive.

R= {(L1, L2) : L1 is perpendicular to L2} Since no line can be perpendicular to itself ∴ R is not reflexive.
Let (L1, L2) ∈ R
∴ L1 is perpendicular to L2 ⇒ L2 is peipendicular to L1
⇒ (L2, L1) ∈ R
∴ (L1L2) ∈ R ⇒ (L2, L1) ∈ R
∴ R is symmetric
Again we know that if L1 is perpendicular to L2 and L2 is perpendicular to L3, then L1can never be perpendicular to L3.
∴ (L1, L2) ∈ R, (L2, L3) ∈ R does not imply (L1, L3) ∈ R
∴ R is not transitive.


202 Views

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

Let A = {1. 2, 3}.
Let R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3)}
Here R is reflexive as (a, a)∈ R ∀ a ∈ A.
R is not symmetric as (1, 2) ∈ R but (2, 1) ∈ R.
R is not transitive as (1.2) ∈ R and (2, 3) ∈ R but(1,3) ∈ R.
∴ R is a relation which is reflexive but neither symmetric not transitive.

442 Views

Advertisement