Concept:
Any relation R is set to be reflexive, if (a, a) ∈ R for all a ∈ A that is, every element of A is R-related to itself
Any relation R is symmetric only if (b, a) ∈ R is true when (a,b) ∈ R. In a symmetric relation, if a=b is true then b=a is also true.
For transitive relation, if (x, y) ∈ R, (y, z) ∈ R, then (x, z) ∈ R.
If a relation is reflexive, symmetric, and transitive at the same time, it is known as an equivalence relation.
Calculation:
Given:
A relation R over a class of n × n real matrices A and B as "ARB iff there exists a non-singular matrix P such that PAP−1 = B"
Now for reflexive:
(B, B) ∈ R ⇒ B = PBP-1 which must be true for P = I,
So R is reflexive
For symmetry
As (B, A) ∈ R for matrix P
B = PAP-1 ⇒ P-1B = P-1PAP-1
P-1BP = IAP-1P = IAI -----(Since P-1P = I)
P-1BP = A ⇒ A = P-1BP
(A, B) ∈ R for matrix P-1
So R is symmetric
For transitivity
B = PAP-1 and A = PCP-1
B = P (PCP-1) P-1
B = P2C (P-1)2 ⇒ B = P2C (P2)-1
(B, C) ∈ R for matrix P2
So R is transitive
If a relation is reflexive, symmetric, and transitive at the same time, it is known as an equivalence relation.
So R is an equivalence relation.