Linear Transformations
A map between vector spaces is linear when it respects addition and scaling. Every such map on finite-dimensional spaces is determined by what it does to a basis, which is what a matrix records; its kernel and image are subspaces whose dimensions sum to the dimension of the domain.
Definition
Let
The two conditions combine to
Determined by a basis. If
The images of the basis vectors therefore determine
The matrix of a transformation. With bases fixed for
Composition corresponds to matrix multiplication: if
Kernel and image.
The kernel is a subspace of
the rank–nullity theorem.
Assumptions and scope
Both spaces must be over the same field. A map from a complex space to a real one can respect real scaling without being linear over
, and complex conjugation is the standard example. The matrix depends on the chosen bases. Two matrices represent the same transformation in different bases, which is what makes similarity and diagonalization meaningful questions.
Rank–nullity requires
finite-dimensional. On infinite-dimensional spaces a map can be injective without being surjective, which the theorem forbids when the dimensions are finite and equal. Linearity is not smoothness or continuity. On finite-dimensional spaces linear maps are continuous, but the definition mentions neither, and the conditions are algebraic.
A map satisfying only additivity need not be linear over
, though the pathological examples require constructions unavailable in any explicit formula. Both conditions are stated because both are needed.
Forms this is expressed in
The same content in several forms. Each makes something visible that the others leave implicit, so moving between them is part of understanding the topic rather than a presentation choice.
geometric
A linear map drawn as what it does to the plane: the coordinate grid before, and the image of that same grid after.
Straight lines stay straight and parallel lines stay parallel, which is linearity made visible rather than asserted. The origin does not move, because
The matrix is read off the picture.
This is the form the rest of the subject reuses. The area scale factor of the transformed grid is the determinant; the directions the grid does not turn are the eigenvectors; the ellipse a circle becomes under it carries the singular values.
What the picture cannot supply is the map in higher dimensions, or an exact image coordinate; both come from the matrix arithmetic.
Translates into: geometric
Worked material
Example
A catalogue of maps on the plane
Each map below is linear, each is given by its matrix, and each is worth recognising on sight.
Scaling by
Reflection in the
Rotation by
Projection onto the
Shear.
| Map | nullity | rank | |
|---|---|---|---|
| zero | 0 | 2 | 0 |
| projection | 0 | 1 | 1 |
| identity | 1 | 0 | 2 |
| rotation | 1 | 0 | 2 |
| reflection | 0 | 2 | |
| shear | 1 | 0 | 2 |
The determinant is zero exactly when the kernel is nontrivial, and in the plane the three rank values 0, 1 and 2 are the only ones available, collapse everything, collapse a line, collapse nothing. Rank–nullity accounts for each row: the entries in the last two columns sum to 2 throughout.
Two that are not on the list. Translation by a fixed vector is not linear, since it moves the origin. "Reflection in the line
Non-example
Maps that fail linearity
A shift.
A squaring.
A norm.
Transposition, which is linear.
Linearity is not about looking like a formula with no exponents. It is two equations that either hold for all inputs or do not, and the cases divide by how they fail:
Common errors
Common misconception
A map given by a first-degree formula is linear, so
Related units
Requires
Connected
- Matrices as Operators (related)