Matrix Representation of Linear Transformations
What You'll Learn
You'll learn how to convert any linear transformation into a concrete matrix using basis vectors—turning abstract mappings into arithmetic you can compute.
The Core Idea
A linear transformation is a function that maps vectors from one space to another while preserving addition and scalar multiplication. But how do we actually compute with it?
The key insight: Once you choose bases for your domain and codomain, every linear transformation can be represented as a matrix. To build this matrix, simply apply the transformation to each basis vector of the domain and record the results as columns.
Step-by-Step Construction
Suppose T: V → W is a linear transformation, with V having basis {v₁, v₂, ..., vₙ} and W having basis {w₁, w₂, ..., wₘ}.
- Apply T to each domain basis vector: Compute T(v₁), T(v₂), ..., T(vₙ)
- Express each result in the codomain basis: Write each T(vᵢ) as a linear combination of {w₁, w₂, ..., wₘ}
- Form the matrix: The coordinates from step 2 become the columns of your matrix
The resulting m×n matrix [T] satisfies: [T(v)]_W = [T] · [v]_V, where the subscripts denote coordinates relative to the respective bases.
Why This Matters
Think of the matrix as a "lookup table" for your transformation. Once you have it, computing T(v) for any vector v becomes straightforward matrix-vector multiplication. The abstract transformation becomes concrete arithmetic.
The same transformation can have different matrix representations depending on which bases you choose—this flexibility is what makes change of basis and similarity transformations so powerful.
Key Takeaway: The matrix representation of a linear transformation is constructed by applying the transformation to each domain basis vector and recording the codomain coordinates as columns; this converts abstract mappings into computable matrices.