LeoMath

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

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.

Observe

Drag the tips of the two basis vectors 𝐞1, 𝐞2 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?

Interactive experimentLinear transformation
A=
Determinant (signed area) 1
Eigenvalues 1, 1

What did you observe?Play first, then answer. Read the explanation only after you have thought it through.

  1. 1.Drag e₁ and e₂ onto the same line. What happens to the grid, and what is the determinant?
  2. 2.Drag only e₁. Do the origin and the whole vertical line through e₂ move? Why?
  3. 3.Press “Rotate”: the eigenvalues become complex. Is there any line in the plane that maps to itself under a rotation?
Conjecture

Because every vector in the plane is v=x𝐞1+y𝐞2, and if a transformation T "respects" addition and scaling it must send v to xT(𝐞1)+yT(𝐞2). What T does to a basis determines everything.

Definition

Definition 3.1Linear map

Let V,W be vector spaces. A map T:V→W is linear if for all u,v∈V and c∈ℝ,

T(u+v)=T(u)+T(v),T(cv)=cT(v).

Together these say T(au+bv)=aT(u)+bT(v): linear maps preserve linear combinations.

Note T(0)=T(0⋅0)=0⋅T(0)=0: a linear map always sends the origin to the origin. So a translation v↦v+b (b≠0) is not linear, which is why the origin never moves in the experiment.

Theorems and proofs

Theorem 3.1A linear map is determined by its values on a basis

Let v1,…,vn be a basis of V and w1,…,wn∈W arbitrary. There is exactly one linear map T:V→W with T(vi)=wi.

Proof

Existence. Each v∈V has unique coordinates v=∑civi (see Vectors). Define T(v)=∑ciwi. If u=∑divi then au+bv=∑(adi+bci)vi, so T(au+bv)=∑(adi+bci)wi=aT(u)+bT(v). Thus T is linear, and clearly T(vi)=wi.

Uniqueness. If S is linear with S(vi)=wi, then S(v)=S(∑civi)=∑ciS(vi)=∑ciwi=T(v).

This is the theorem behind the experiment: two arrows, T(𝐞1) and T(𝐞2), decide the fate of the whole plane. A linear map of n-dimensional space is decided by n vectors.

Theorem 3.2Linear maps send lines to lines (or points)

If T is linear, the image of the line {p+tv:t∈ℝ} is {T(p)+tT(v)}: a line when T(v)≠0, otherwise a point. Parallel lines map to parallel lines (or degenerate together).

Proof

T(p+tv)=T(p)+tT(v) by linearity. Lines sharing the direction v have images sharing the direction T(v).

This explains "lines stay lines, parallels stay parallel". The "Collapse" preset, where everything is squashed onto one line, is the case where T(𝐞1) and T(𝐞2) are collinear and T(v)=0 has nonzero solutions.

Definition 3.2Kernel and image

ker⁡T={v∈V:T(v)=0} is the kernel of T; im⁡T={T(v):v∈V} is its image. Both are subspaces.

Theorem 3.3Rank–nullity

If V is finite-dimensional, dim⁡ker⁡T+dim⁡im⁡T=dim⁡V.

Proof

Take a basis u1,…,uk of ker⁡T and extend it to a basis u1,…,uk,v1,…,vr of V. We claim T(v1),…,T(vr) is a basis of im⁡T.

Spanning: any T(v) with v=∑aiui+∑bjvj equals ∑bjT(vj).

Independence: if ∑bjT(vj)=0 then T(∑bjvj)=0, so ∑bjvj∈ker⁡T and equals some ∑aiui. Independence of the full basis forces all bj=0.

Hence dim⁡im⁡T=r=dim⁡V−k.

In the experiment: when T(𝐞1),T(𝐞2) are not collinear the kernel is {0} and the image is the whole plane (0+2=2); when they are collinear and nonzero, kernel and image are each a line (1+1=2).

Try it in the matrix calculator →

Common mistake

A linear map always sends 0 to 0. So a translation v↦v+b with b≠0 is not linear, and the school "linear function" y=kx+b is not a linear map when b≠0 (it is affine). When testing linearity, check T(0) first.

Applications

ApplicationRotation, projection and differentiation are linear
  • Rotation of the plane by θ about the origin: linear, 𝐞1↦(cos⁡θ,sin⁡θ), 𝐞2↦(−sin⁡θ,cos⁡θ).
  • Projection onto the x-axis: linear, kernel the y-axis.
  • Differentiation D:p↦p′ on polynomials: linear, D(af+bg)=af′+bg′, 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.

Remark

The next section, Matrices, does one thing only: it writes the coordinates of T(𝐞1),T(𝐞2) as two columns. That is a matrix. A matrix is a notation for a linear map, nothing more.

Exercises

0 of 2 done

1
A linear map T:ℝ2→ℝ2 has T(1,0)=(2,1) and T(0,1)=(0,3). Find the second coordinate of T(1,2).

Enter the exact value; a fraction such as 1/3 is fine.

2
Which of the following maps is linear?
Answer to exercise 2

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