1.9 The matrix of a linear transformation
本文为《Linear algebra and its applications》的读书笔记
Whenever a linear transformation arises geometrically or is described in words, we usually want a “formula” for . The discussion that follows shows that every linear transformation from to is actually a matrix transformation .
The key to finding is to observe that is completely determined by what it does to the columns of the identity matrix .
EXAMPLE 1
The columns of are and . Suppose is a linear transformation from into such that and . With no additional information, find a formula for the image of an arbitrary in .
SOLUTION
The matrix in (3) is called the standard matrix for the linear transformation . (线性变换 的标准矩阵)
We know now that every linear transformation from to can be viewed as a matrix transformation, and vice versa (反之亦然).
EXAMPLE 3
Let be the transformation that rotates each point in about the origin through an angle , with counterclockwise rotation for a positive angle. We could show geometrically that such a transformation is linear. Find the standard matrix of this transformation.
SOLUTION
Geometric Linear Transformations of
Because the transformations are linear, they are determined completely by what they do to the columns of .
剪切变换
Existence and Uniqueness Questions
The concept of a linear transformation provides a new way to understand the existence and uniqueness questions asked earlier.
满射
“Does map onto ?” is an existence question.
单射
“Is one-to-one?” is a uniqueness question.
The projection transformations shown in Table 4 are not one-to-one and do not map onto . The transformations in Tables 1, 2, and 3 are one-to-one and do map onto .
EXAMPLE 4
Let be the linear transformation whose standard matrix is
Does map onto ? Is a one-to-one mapping?
SOLUTION
Since happens to be in echelon form, we can see at once that has a pivot position in each row. Therefore, maps onto .
However, since the equation has a free variable, each is the image of more than one . That is, is not one-to-one.
PROOF
必要性:
Since is linear, . If T is one-to-one, then the equation has at most one solution and hence only the trivial solution.
充分性:
If is not one-to-one, then there is a that is the image of at least two different vectors in —say, and . But then, since is linear, . The vector is not zero. Hence the equation has more than one solution.
也可以这样证明:设 为线性变换 对应的标准矩阵,则 为单射 有唯一解 只有平凡解 只有平凡解
可以发现,只有当 是方阵的时候 才可能是双射 ( 的标准矩阵 的每行每列都必须要有主元)
EXAMPLE 5
Let . Show that is a one-to-one linear transformation. Does map onto ?
SOLUTION
So is indeed a linear transformation, with its standard matrix shown in (4).
The columns of are linearly independent because they are not multiples. By Theorem 12(b), is one-to-one.
To decide if is onto , examine the span of the columns of . Since is , the columns of span if and only if has 3 pivot positions. This is impossible, since has only 2 columns. So the columns of do not span , and the associated linear transformation is not onto .