A matrix maps the unit square to some parallelogram. Sometimes that parallelogram has plenty of area; sometimes it flattens into a line with none at all. That one number — the area, signed — turns out to answer a completely different-sounding question: does have a unique solution?
M = [[3, 1], [2, 2]] det(M) = 4
Drag the sliders. The dashed square is the input; the solid shape is where the matrix sends it. Push any slider until the solid shape collapses into a line — that's a singular matrix, and its determinant drops to exactly 0.
For a matrix, the determinant is:
- — the matrix, with entries (rows top-to-bottom, columns left-to-right).
- It's a signed area
is the area of the parallelogram the unit square maps to. The sign flips exactly when the mapping reverses orientation (flips the plane over).
- Zero means singular
exactly when 's two columns point along the same line — the mapped square collapses to zero area, and is singular: not invertible.
- It gates invertibility
exists if and only if , since the inverse formula below divides by it.
The inverse itself, when it exists:
- Why this undoes A
is defined precisely so that — applying then (or vice versa) leaves every vector exactly where it started.
- Singular means no undo
If , has already thrown away a dimension (collapsed the plane to a line) — there's no way to recover the lost information, so no inverse can exist.
det(M) = 4 M⁻¹ = [[0.50, -0.25], [-0.50, 0.75]]
Jump between the invertible preset and the singular one. Watch the inverse readout switch from a clean set of numbers to "no inverse" the instant the parallelogram flattens.
For :
- Compute the determinant
.
- Compute the inverse
.
- Check it
. Multiplying entry by entry:
- Top-left:
- Top-right:
- Bottom-left:
- Bottom-right:
Exactly .
For M = [[1, -1], [1, 1]], compute det(M) by hand and pick it below.
The determinant is a single number that tells you whether a linear system has a unique solution before you do any further work — zero means the matrix has destroyed a dimension, and no amount of algebra will get it back. Every later decomposition in this part (eigenvalues, SVD, PSD-ness) leans on this same idea: a matrix's determinant is the product of its eigenvalues, so a zero eigenvalue is exactly what makes a matrix singular.