Linear Transformations
A linear transformation (or linear map) is a function between vector spaces that preserves the linear structure. These are the natural "morphisms" in the category of vector spaces.
Definition
Let and be vector spaces over the same field . A function is a linear transformation (or linear map) if for all and :
- (preserves addition)
- (preserves scalar multiplication)
Equivalently, for all and .
We write or . The set of all linear transformations from to is denoted or . When , we write and call a linear operator (or endomorphism).
Every linear map sends to : . If a function fails this, it is not linear.
Examples
For any vector space :
- The identity map , , is linear.
- The zero map , , is linear.
For , the map defined by is linear. This is the most important example: every linear map between finite-dimensional spaces can be represented this way.
defined by (the derivative) is linear:
More generally, is a linear operator.
defined by is linear:
defined by (projection onto the -plane) is linear. More generally, the projection onto any subspace along a complement is linear.
Rotation by angle about the origin is a linear map :
This corresponds to multiplication by the rotation matrix .
Reflection across the -axis in : is linear. Reflection across any line through the origin is linear.
defined by is linear:
defined by is linear. This is a linear functional (a linear map to the base field).
For , the map defined by is linear. This is another linear functional.
The left shift defined by is linear. It "deletes" the first entry. Similarly, the right shift is linear.
defined by is not linear because .
defined by is not linear: .
Basic properties
Let be a basis for , and let be any vectors in (not necessarily distinct or independent). Then there exists a unique linear transformation with for all .
Define . This is well-defined (since the are unique by linear independence) and linear (by construction). Uniqueness follows because any linear with satisfies .
is itself a vector space over under pointwise operations:
If and , then .
If and are linear, then is linear. Composition is associative: .
The key invariants of a linear map are its kernel and image. Their relationship is captured by the Rank-Nullity Theorem. In finite dimensions, every linear map can be encoded as a matrix.