Concept:
Let R be a relation on a non-empty set A, if every element of A is related to itself then R is said to be a reflexive relation.
Thus, R is reflexive ⇔ (a, a) ∈ R, ∀ a ∈ A.
Let R be a relation on a non-empty set A, then the relation R is said to be symmetric relation ⇔ (a, b) ∈ R ⇒ (b, a) ∀ a, b ∈ A.
Let R be a relation on a non-empty set A, then the relation R is said to be transitive relation ⇔ (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R, ∀ a, b, c ∈ A.
Let R be a relation on a non-empty set A, then the relation R is said to be equivalence relation if R is reflexive, symmetric and transitive.
Calculation:
Given: A = {1, 2, 3} and relation R on A is defined as: R = {(1, 1), (1, 2), (2, 3), (2, 2), (3, 3), (3, 1)}
Reflexive:
As we can see that (a, a) ∈ R, ∀ a ∈ A i.e (1, 1), (2, 2) and (3, 3) ∈ R ⇒ R is reflexive.
Symmetric:
As we can see that for the given relation R, (1, 2) ∈ R but (2, 1) ∉ R and similarly, (3, 1) ∈ R but (1, 3) ∉ R.
So, there is atleast one (a, b) ∈ R but (b, a) ∉ R ⇒ R is not symmetric.
Transitive:
As we can see that for the given relation R, (1, 2) and (2, 3) ∈ R but (1, 3) ∉ R ⇒ R is not transitive.
So, the given relation R is reflexive but neither symmetric nor transitive.