For a matrix, the determinant is the area of a parallellogram. (The area is equal to.)
An matrix can be seen as describing alinear map in dimensions. In which case, the determinant indicates thefactor by which this matrixscales (grows or shrinks) a region of-dimensional space.
For example, a matrix, seen as a linear map, will turn a square in 2-dimensional space into aparallelogram. That parallellogram's area will be times as big as the square's area.
In the same way, a matrix, seen as a linear map, will turn acube in 3-dimensional space into aparallelepiped. That parallelepiped's volume will be times as big as the cube's volume.
The determinant can be negative or zero. A linear map can stretch and scale a volume, but it can also reflect it over anaxis. Whenever this happens, thesign of the determinant changes from positive to negative, or from negative to positive. A negative determinant means that the volume was mirrored over anodd number of axes.
One can think of a matrix as describing asystem of linear equations. That system has a unique non-trivial solutionexactly when the determinant is not 0[2] (non-trivial meaning that the solution is not just all zeros).
If the determinant is zero, then there is either no unique non-trivial solution, or there areinfinitely many.
A matrix has aninverse matrix exactly when the determinant is not 0. For this reason, a matrix with a non-zero determinant is calledinvertible. If the determinant is 0, then the matrix is callednon-invertible orsingular.[2]
Geometrically, one can think of a singular matrix as "flattening" the parallelepiped into a parallelogram, or a parallelogram into a line. Then the volume or area is 0, which means that there is no linear map that will bring the old shape back.
The determinant formula is a sum of products. Those products go along diagonals that "wrap around" to the top of the matrix. This trick is called the Rule of Sarrus.
For and matrices, the following simple formulas hold:[2]
For larger matrices, the determinant is harder to calculate. One way to do it is calledcofactor expansion.
Suppose that we have an matrix. First, we choose any row or column of the matrix. For each number in that row or column, we calculate something called itscofactor. Then.[2]
To compute such a cofactor, we erase row and column from the matrix. This gives us a smaller matrix. We call it. The cofactor then equals.
Here is an example of a cofactor expansion of the left column of a matrix:
As illustrated above, one can simplify the computation of determinant by choosing a row or column that has many zeros; if is 0, then one can skip calculating altogether.