The Inverse of a Matrix and When It Exists
An inverse undoes the rule a matrix applies. Only square matrices with full pivot count have one, and elimination both decides the question and computes the answer.
What a learner can do afterwards
- Compute an inverse by row reducing the matrix beside the identity
- State several equivalent conditions for invertibility
- Solve a system with an inverse and say when that is a poor method
1 · Read
An inverse matrix undoes whatever the original matrix does, so Ax equals b solves as x equals the inverse times b. Only square matrices with a full set of pivots qualify. To find one, reduce the matrix beside the identity: the right half becomes the inverse. A zero row during elimination proves no inverse exists.
Several tests for invertibility all say the same thing. A square matrix has an inverse exactly when its determinant is nonzero, its columns are independent, and it has full pivot count. For 2 by 2, the determinant is a times d minus b times c. A zero row, equal rows, or a non square shape all mean no inverse.
Take the matrix with rows (4, 0) and (0, 4). Beside the identity, each diagonal 4 needs its reciprocal 0.25, so the inverse has rows (0.25, 0) and (0, 0.25). Check by multiplying back: the product has rows (1, 0) and (0, 1). For a shear with rows (1, 3) and (0, 1), clearing above the pivot gives rows (1, minus 3) and (0, 1).
For solving, the inverse is rarely the tool to reach for. Direct elimination handles one system in one pass, and a full inverse adds work on top of that plus extra rounding error. With many systems sharing one matrix, factor once and reuse the factors for each right hand side.
An inverse undoes a square full pivot matrix, elimination beside the identity finds it, and direct elimination usually solves faster.
2 · Watch
Take it off screen
Where it sits
8 questions wait behind this lesson, each with its answer explained. Every answer feeds the sky: stars light as they are learned, and dim when it is time to come back.