Definition: Let T : ℝm → ℝn be a linear transformation. Then
A linear transformation T is one-to-one if T(u) = T(v) implies u = v. In other words, if u ≠ v, then T(u) ≠ T(v). (Two-to-two!)
Talk about the general idea of one-to-one and onto.
Theorem: Let T be a linear transformation T is one-to-one if T(u) = 0 implies u = 0.
Example: Let T be the linear transformation defined by T(x) = Ax, where
$$
\begin{bmatrix}
4 & -1 \\
-2 & 2 \\
0 & 3
\end{bmatrix}
$$
Is T one-to-one? Onto?
Let T be the linear transformation defined by T(x) = Ax, where
$$
\begin{bmatrix}
2 & 1 & 1 \\
1 & 2 & 0 \\
1 & 3 & 0
\end{bmatrix}
$$
Is T one-to-one? Onto?
Theorem: Let T : ℝm → ℝn be a linear transformation. Let A be the matrix so that T(x) = Ax. Then
In particular, the dimension of A can sometimes implies that T cannot be one-to-one and onto.
Theorem: Let S = {a1, …, an} with ai ∈ ℝn, A = [ai], and T(x) = Ax. (So A is square). Then the following are equivalent:
Lines go to lines (or points)! Why? T((1 − s)u + sv) = (1 − s)T(u) + sT(v).
The columns of the matrix tells you where the standard basis goes.
Let’s see what happens to the square {(x, y) : 0 ≤ x, y ≤ 1} under the following transforms
$$
\begin{bmatrix}
3 & 0 \\
0 & 2
\end{bmatrix}
$$
$$
\begin{bmatrix}
1 & 2 \\
0 & 2
\end{bmatrix}
$$
$$
\begin{bmatrix}
1 & 0 \\
0 & 0
\end{bmatrix}
$$
$$
\begin{bmatrix}
\cos(\theta) & -\sin(\theta) \\
\sin(\theta) & \cos(\theta)
\end{bmatrix}
$$