Invertible Linear Transformations
What You'll Learn
You'll learn when a linear transformation has an inverse and how to find the matrix that represents that inverse.
The Core Idea
A linear transformation T: V → W is invertible if there exists another linear transformation T⁻¹: W → V such that:
- T⁻¹(T(v)) = v for all v in V (undoes T)
- T(T⁻¹(w)) = w for all w in W (T undoes T⁻¹)
Think of it like a reversible function: if T "scrambles" vectors in a certain way, T⁻¹ "unscrambles" them perfectly.
When Is a Linear Transformation Invertible?
A linear transformation T is invertible if and only if:
- T is one-to-one (injective): different inputs give different outputs
- T is onto (surjective): every output is reachable
In practical terms for matrix representations:
- The kernel of T must contain only the zero vector (ker(T) = {0})
- The dimensions of V and W must be equal
- The matrix A representing T must be square and have full rank
- Equivalently, det(A) ≠ 0
Finding the Inverse Matrix
If T is represented by matrix A with respect to given bases, then T⁻¹ is represented by A⁻¹.
For a 2×2 matrix A = [[a,b],[c,d]], if det(A) = ad - bc ≠ 0:
A⁻¹ = (1/det(A)) × [[d,-b],[-c,a]]
For larger matrices, use row reduction: augment [A | I] and reduce to [I | A⁻¹].
The Connection
When T is invertible, the composition T ∘ T⁻¹ gives the identity transformation, just as the matrix product AA⁻¹ = I.
Key Takeaway: A linear transformation is invertible precisely when its matrix representation is square with nonzero determinant; the inverse transformation corresponds to the inverse matrix.