Here MR is the matrix representation of the relation R.
Inverse (R-1):-Every relation, however, has an inverse relation,so for any relation R , MR-1 exists Recall that if R is relation on A
R-1 = { (y,x)∈ A $\times$ A:(x,y) ∈ R }
it’s the relation that you get from R by ‘turning all the ordered pairs around’. This operation actually does have an effect on the matrix that is familiar from linear algebra, but it’s not taking the inverse of the matrix.it’s taking the transpose.
We take the transpose of the matrix, since we want the ( i, j ) th entry of the matrix for R -1 to be 1 if and only if the ( j, i ) th entry of the matrix for R is 1.
MR=$\begin{bmatrix} 1 & 0 &0 &1 \\ 1 & 1 & 1 &1 \\ 1 &1 &0 &0 \end{bmatrix}$
MR-1=$\begin{bmatrix} 1 &1 &1 \\ 0& 1&1 \\ 0& 1& 0\\ 0& 1& 0 \end{bmatrix}$
Note :-Here we are finding MR-1 not ( MR )-1.
Complement ($\bar R$) :- In $\bar R$ If the ijth entry of MR is x, then the ijth entry of M$\bar R$ is (x+1) mod 2. In other words, every 0 is replaced by 1 and every 1 is replaced by 0.
M$\bar R$ =$\begin{bmatrix} 0 &1 &1 &0 \\ 0& 0 & 0 & 0\\ 0& 0 & 1 &1 \end{bmatrix}$