Identity, Inverse and Transpose
Three matrices built from one. The identity does nothing, the inverse undoes, and the transpose — which people reach for as if it were an undo — does something else entirely.
The Matrix A
Do And Undo
the transpose is not the inverse — unless A is orthogonal
Press Apply A. The shape moves; press the second button to try to put it back.
There And Back
—The faint outline is where the shape started. Green is where it is now.
A⁻¹
Every entry is divided by the determinant, which is exactly why a determinant of zero leaves no inverse to write down.
A A⁻¹ And Aᵀ
Identity, Inverse and Transpose: A Practical Guide
Do nothing, undo, and flip — and why only two of those are related.
Quick Context
A matrix is a transformation. Once you can do something to space, three questions follow immediately: what does nothing, what puts it back, and what happens if you read the matrix sideways.
The first two are a pair. The third is a different animal that constantly gets mistaken for the second.
The identity
I = [[1, 0], [0, 1]]
Its columns are exactly where i and j already were, so it moves nothing. It is the 1 of matrix multiplication: AI = IA = A for every A, and the thing an inverse has to produce.
The inverse
A⁻¹ = (1 / det A) · [[d, −b], [−c, a]]
A⁻¹ is the transformation that undoes A: apply one then the other and you are back where you started, which is what A A⁻¹ = I says. Look at the formula and the whole story of the determinant falls out of it — every entry is divided by det A, so a determinant of zero leaves nothing to write.
That is not a notational accident. A matrix with zero determinant has flattened the plane onto a line; two different starting points now sit on top of each other, and no transformation can pull them apart again. The information is gone, so the undo cannot exist.
A determinant that is merely small is its own kind of trouble: the inverse divides by it, so tiny errors in the input become enormous errors in the output. That is what an ill-conditioned matrix is, and it is why numerical code solves Ax = b rather than computing A⁻¹b.
The transpose
Aᵀ = [[a, c], [b, d]]
Reflect the matrix across its diagonal: rows become columns. Geometrically it is not an undo and generally not related to one — try it on the plot and the shape does not come back.
Its real job is bookkeeping in products. (AB)ᵀ = BᵀAᵀ, the dot product of two vectors is aᵀb, and XᵀX is what turns a tall data matrix into the square, symmetric thing that least squares and covariance both need. When you see a stray transpose in a formula, it is almost always there to make two shapes line up.
There is one important case where the two coincide. If A's columns are perpendicular unit vectors — an orthogonal matrix, a rotation or a reflection — then Aᵀ = A⁻¹ exactly. Undoing a rotation costs a transpose instead of a division, which is why numerical methods work so hard to keep things orthogonal.
Interactive Exploration Guide
- Do and undo. Press Apply A, then Apply A⁻¹. The shape leaves and comes back exactly, and the computed A A⁻¹ panel reads the identity.
- Break it. Set c to 1.5 and d to 1.0, leaving a at 1.5 and b at 1.0. Now ad = bc and the determinant is exactly 0. The shape collapses onto a line, the inverse panel turns red, and the undo button is disabled — there is nothing to press.
- Get close to broken. Nudge d up to 1.1 so the determinant is 0.15. The inverse exists, and its entries are enormous — that magnification is exactly the numerical instability people mean by "ill-conditioned".
- Try the transpose as an undo. Tick Undo With Aᵀ Instead and run do-then-undo. The shape does not return, because the transpose was never the undo.
- Unless it is. Set a = 0.6, b = −0.8, c = 0.8, d = 0.6 — a rotation. Now Aᵀ = A⁻¹ reads yes, and undoing with the transpose works perfectly.
- Find the identity. a = 1, b = 0, c = 0, d = 1. Apply it as often as you like; nothing ever moves.
Key Takeaway
The identity is the matrix that changes nothing, and the inverse is the one that undoes A — defined by A A⁻¹ = I and computed by dividing through by the determinant, which is precisely why a zero determinant means no inverse exists: the transformation destroyed information and no matrix can recover it. A small determinant is the same problem in slow motion, and the reason numerical code solves systems rather than inverting matrices. The transpose only looks like a relative: it flips rows and columns, it exists to make shapes agree in products such as XᵀX, and it equals the inverse in exactly one case — when the matrix is orthogonal.