Definition · Linear transformation
A mapping is linear if for every scalar and for all . When it is called a linear operator.
The two conditions collapse into one: is linear iff for all scalars and vectors. By induction this extends to any linear combination, which is exactly why knowing on a basis determines everywhere.
!Exam trap
Setting gives . So with (a translation) is not linear, despite looking harmless. But the converse fails: sends and is still not linear. Squares, roots, absolute values, and constants all break linearity.
The operators on you should recognise on sight
| Operator | Formula | Standard matrix |
|---|---|---|
| Scaling by | ||
| Projection onto -axis | ||
| Reflection in the -axis | ||
| Rotation by (ccw) | — | |
| Swap coordinates |
Beyond : differentiation on and integration are both linear. That's the entire justification for calling systems of differential equations 'linear' in §6.2.
Kernel and range
Definition · Kernel and range
and, for a subspace , the image . The range is .
Theorem 4.1.1
If is linear, then is a subspace of and is a subspace of for any subspace .
For these are literally and — Chapter 4 is Chapter 3 with new vocabulary.
Worked example
0/5 stepsLinearity, kernel, range
Let be . Show is linear and find and the range.
★Key idea
One-to-one . Onto range . For with being : one-to-one ; onto . The rank decision table from §3.6 answers both at once.
Check yourself
Q1
Which mapping is not linear?
T / F
If , then is a linear transformation.
Q3
is defined by . What is ?
T / F
For linear, is a subspace of and the range is a subspace of .