A linear transformation is described completely once you describe how it transforms the elementary vectors of its domain.
|
Proof: Suppose u = (u1, u2, ..., un) is a typical vector in Rn. Write u as a linear combination of the elementary vectors in Rn:
Then since T preserves linear combinations,
Since T(e1), T(e2), ... , T(en) are all known, this gives us a formula for T(u) for any u in Rn. |
It turns out that if we represent vectors by column matrices, then linear transformations and matrix transformations are the same thing.
|
|
Proof of a): Suppose T is a matrix transformation with matrix A, i.e. suppose T(u) = Au for all u in Rn. Then T preserves sums: for vectors u and
v in Rn,
T preserves scalar multiples: for any vector u
in Rn
and any scalar c, Then T is a linear transformation. Also, T(ek) = Aek, which is the kth column of A. |
Proof of b): For any u in Rn, T(u) = u1T(e1) + u2T(e2) + ... + unT(en). The right-hand side of this relation is a linear combination of columns. Use the multiplication pattern you learned in Section 1B to write it in contracted form: if A is the matrix with columns T(e1), T(e2), ... , T(en), then T(u) = Au. |
|
To find the standard matrix of a linear transformation |
If T:Rn → Rm is a linear transformation |
|
|
Then T(u) = Au for all u in Rn. |