Now we will make use of determinants and along the way introduce the notion of inverse matrix.
A matrix is inverse to matrix , if , where is the identity matrix (the matrix with ones on the diagonal and zeros everywhere else). The inverse matrix is denoted as . Since and , we see that . This implies that only matrices with non-zero determinants can have their inverses. Therefore we call such matrices invertible.
How to calculate the inverse of a given matrix? We have mentioned recently that the operations on rows of a matrix leading to the reduced “stair-like” for is actually multiplication by a matrix. Imagine that we transform the matrix consisting of matrix along with the identity matrix into the reduced “stair-like” form. Since is a square matrix with non-zero determinant, we will get identity matrix on the left side: . But notice that if is the matrix of rows operations, then . Therefore and . The first equation implies that . The second that . So we get the inverse matrix on the right after those operations!
E.g. let us calculate the inverse of the following matrix:
Determining one element of the inverse matrix
If you do not need the whole matrix but some elements only, the following method seems useful. It uses the adjugate matrix to the given one. The adjugate matrix is a matrix in which in -th row and -th column we have the determinant of matrix (matrix without -th row and -th column, there is no mistake there, a transposition plays a role here) multiplied by . The following equation holds:
Therefore if we would like to calculate the value in the second row and first column of from the previous example we cross out the second column an the first row of and calculate the determinants, and get:
which agrees with the result obtained by the first method!
Given a system of equations with variables we may try to solve it with Cramer’s rule. Let be the matrix of this system without the column of free coefficients. Let be the matrix , in which instead of -th column we put the column of free coefficients. Then:
- if , the system has exactly one solution. The solution is given by the following formula: ,
- if , and at least one of is not equal to , the system has no solutions,
- if and for every , , there can be zero or infinitely many solutions — Cramer’s method does not give any precise answer.
E.g. let us solve the following system of equations:
Since , this system has exactly one solution. To determine it we calculate the other determinants:
And so , , .