Foundations of linear algebra · Section 3 of 5
Linear maps
Maps preserving addition and scaling, determined entirely by what they do to a basis.
about 7 min
Start from a problem
In the home-page experiment you dragged only two arrows, yet infinitely many points of the plane moved with them. What gives two vectors control over every point?
To answer that we must first pin down which transformations "respect" vector addition and scaling. Those should be completely determined by what they do to a basis.
Drag the tips of the two basis vectors , below. The whole grid follows: straight lines stay straight, parallel lines stay parallel, the origin stays put, equally spaced grid lines stay equally spaced.
You moved two points and thereby decided where every point of the plane goes. Why?
What did you observe?Play first, then answer. Read the explanation only after you have thought it through.
- 1.Drag e₁ and e₂ onto the same line. What happens to the grid, and what is the determinant?
- 2.Drag only e₁. Do the origin and the whole vertical line through e₂ move? Why?
- 3.Press “Rotate”: the eigenvalues become complex. Is there any line in the plane that maps to itself under a rotation?
Because every vector in the plane is
Definition
Let be vector spaces. A map is linear if for all and ,
Together these say : linear maps preserve linear combinations.
Note
Theorems and proofs
Let be a basis of and arbitrary. There is exactly one linear map with .
Existence. Each has unique coordinates (see Vectors). Define . If then
Uniqueness. If is linear with , then
This is the theorem behind the experiment: two arrows, and , decide the fate of the whole plane. A linear map of -dimensional space is decided by vectors.
If is linear, the image of the line is : a line when , otherwise a point. Parallel lines map to parallel lines (or degenerate together).
by linearity. Lines sharing the direction have images sharing the direction .
This explains "lines stay lines, parallels stay parallel". The "Collapse" preset, where everything is squashed onto one line, is the case where and are collinear and has nonzero solutions.
is the kernel of ;
If is finite-dimensional,
Take a basis of and extend it to a basis of . We claim is a basis of .
Spanning: any with equals .
Independence: if then , so and equals some . Independence of the full basis forces all .
Hence
In the experiment: when are not collinear the kernel is and the image is the whole plane (); when they are collinear and nonzero, kernel and image are each a line ().
Try it in the matrix calculator →
A linear map always sends to . So a translation with is not linear, and the school "linear function" is not a linear map when (it is affine). When testing linearity, check first.
Applications
- Rotation of the plane by about the origin: linear,
, . - Projection onto the -axis: linear, kernel the -axis.
- Differentiation on polynomials: linear, , kernel the constants.
The last example is why linear algebra reappears in Second-order linear equations: solving a linear differential equation is finding the kernel of a linear map.
The next section, Matrices, does one thing only: it writes the coordinates of as two columns. That is a matrix. A matrix is a notation for a linear map, nothing more.
Exercises
0 of 2 done
✓ All exercises in this section are done.
Next section: Matrices →
Discussion
Found a mistake, have a question or a suggestion? You can also write to 620026600@qq.com
No comments yet. Share your understanding, ask a question, or point out an error on this page.
Log in to join the discussion