3.39 min read
Linear Maps as Functions
A linear map (or linear transformation) is a function that respects the vector space structure: it preserves addition () and scalar multiplication ().
These two conditions together say: preserves linear combinations. If you know where sends each basis vector, you know completely — because every vector is a linear combination of basis vectors.
Examples: rotation, reflection, scaling, projection, shearing. These are all linear maps. Translations (shifting by a fixed vector) are NOT linear (they don't fix the origin).
Formal View
Definition 3.3 — Linear Map
A function is a linear map if for all and : \begin{enumerate} \item \item T(c\mathbf{u}) = cT(\mathbf{u}) \end{enumerate} Equivalently: T(c_1\mathbf{u} + c_2\mathbf{v}) = c_1T(\mathbf{u}) + c_2T(\mathbf{v})$.
Why This Matters
Linear maps are the morphisms of linear algebra — the structure-preserving functions between vector spaces.
- Computer graphics: every geometric transformation (rotate, scale, reflect) is a linear map
- Signal processing: all linear filters are linear maps on signal vectors
- Quantum mechanics: observables are linear operators (linear maps on function spaces)
Quiz
Question 1
The function is a linear map.
Common Mistakes
- Thinking translations are linear — they are affine (linear plus a constant offset).
- Checking only one of the two linearity conditions — both addition-preservation and scaling-preservation are required.