An elementary row operation is one of three operations: interchange two rows, multiply one row by a nonzero scalar, or add a scalar multiple of one row to a different row. Each operation is reversed by another operation of the same kind.
Performing such an operation on an matrix is equivalent to left multiplication by the elementary matrix obtained by applying that operation to the identity matrix. Each elementary matrix is invertible, with inverse corresponding to the reverse operation. Thus a sequence of operations gives
For square matrices, if were invertible, then would have inverse . Hence if is singular, must be singular as well. In fact the two are invertible together, because gives the converse.
Solve for a general right-hand side . Subtracting the fourth equation from the second gives . The first and fourth then give
Substitution into the third equation reduces the remaining condition to
If , every right-hand side therefore has a unique solution, and collecting its four coefficients yields the matrix inverse
For , the nonzero vector lies in the kernel of a linear map represented by , so is singular. Hence is invertible exactly when . The same calculation gives ; the formula above can also be checked by multiplying its numerator by to obtain .

Articles by others on the same topic (0)

There are currently no matching articles.