Explain types of a Relation with a suitable example.

In mathematics, specifically in set theory, a relation is a way of associating elements of two sets. There are several types of relations:

1. Reflexive Relation: A relation R on a set A is said to be reflexive if every element of set A is related to itself. For example, in the set A = {1, 2, 3}, the relation R = {(1,1), (2,2), (3,3)} is reflexive.

2. Symmetric Relation: A relation R on a set A is said to be symmetric if for every (a, b) belonging to R, the pair (b, a) also belongs to R. For example, in the set A = {1, 2, 3}, the relation R = {(1,2), (2,1), (2,3), (3,2)} is symmetric.

3. Transitive Relation: A relation R on a set A is said to be transitive if for every pair (a, b) and (b, c) belonging to R, the pair (a, c) also belongs to R. For example, in the set A = {1, 2, 3}, the relation R = {(1,2), (2,3), (1,3)} is transitive.

4. Antisymmetric Relation: A relation R on a set A is said to be antisymmetric if for every pair (a, b) and (b, a) belonging to R, a is equal to b. For example, in the set A = {1, 2, 3}, the relation R = {(1,1), (2,2), (3,3)} is antisymmetric.

5. Equivalence Relation: A relation R on a set A is said to be an equivalence relation if it is reflexive, symmetric, and transitive. For example, in the set A = {1, 2, 3}, the relation R = {(1,1), (2,2), (3,3), (1,2), (2,1), (2,3), (3,2), (1,3), (3,1)} is an equivalence relation.

6. Partial Order Relation: A relation R on a set A is said to be a partial order if it is reflexive, antisymmetric, and transitive. For example, in the set A = {1, 2, 3}, the relation R = {(1,1), (2,2), (3,3), (1,2), (1,3), (2,3)} is a partial order relation.