Determinant under Row Operations Explained with Worked Examples
Three rules govern how a determinant changes under row operations: swapping two rows changes its sign, multiplying a row by k multiplies it by k, and adding a multiple of one row to another leaves it unchanged.
These rules let you reduce a matrix to triangular form without changing the determinant (apart from tracked signs and factors), after which the determinant is just the product of the diagonal entries. This is far quicker than expanding along rows for a large matrix, and it is the idea behind LU factorisation.
A zero row, or two equal rows, gives determinant zero, so the matrix is singular and has no inverse. The same operations underlie the elimination used to solve systems of three equations.
Scaling a whole n×n matrix by k applies the second rule n times, which gives the determinant of a scalar multiple. For a 2 × 2 case see the basic formula.
What is it used for?
Row operations change a determinant in predictable ways, which is why elimination is a fast way to compute determinants.
Computing larger determinants by reducing to triangular form.
Spotting when a determinant is zero because two rows are proportional.