4.4: Linear Operators on R³
( \newcommand{\kernel}{\mathrm{null}\,}\)
Recall that a transformation T:Rn→Rm is called linear if T(x+y)=T(x)+T(y) and T(ax)=aT(x) holds for all x and y in Rn and all scalars a. In this case we showed (in Theorem [thm:005789]) that there exists an m×n matrix A such that T(x)=Ax for all x in Rn, and we say that T is the matrix transformation induced by A.
Linear Operator on Rn012946 A linear transformation
T:Rn→Rn
is called a linear operator on Rn.
In Section [sec:2_6] we investigated three important linear operators on R2: rotations about the origin, reflections in a line through the origin, and projections on this line.
In this section we investigate the analogous operators on R3: Rotations about a line through the origin, reflections in a plane through the origin, and projections onto a plane or line through the origin in R3. In every case we show that the operator is linear, and we find the matrices of all the reflections and projections.
To do this we must prove that these reflections, projections, and rotations are actually linear operators on R3. In the case of reflections and rotations, it is convenient to examine a more general situation. A transformation T:R3→R3 is said to be distance preserving if the distance between T(v) and T(w) is the same as the distance between v and w for all v and w in R3; that is,
‖T(v)−T(w)‖=‖v−w‖ for all v and w in R3
Clearly reflections and rotations are distance preserving, and both carry 0 to 0, so the following theorem shows that they are both linear.
012963 If T:R3→R3 is distance preserving, and if T(0)=0, then T is linear.
Since T(0)=0, taking w=0 in ([eq:distancePresEq]) shows that ‖T(v)‖=‖v‖ for all v in R3, that is T preserves length. Also, ‖T(v)−T(w)‖2=‖v−w‖2 by ([eq:distancePresEq]). Since ‖v−w‖2=‖v‖2−2v∙w+‖w‖2 always holds, it follows that T(v)∙T(w)=v∙w for all v and w. Hence (by Theorem [thm:011851]) the angle between T(v) and T(w) is the same as the angle between v and w for all (nonzero) vectors v and w in R3.
With this we can show that T is linear. Given nonzero vectors v and w in R3, the vector v+w is the diagonal of the parallelogram determined by v and w. By the preceding paragraph, the effect of T is to carry this entire parallelogram to the parallelogram determined by T(v) and T(w), with diagonal T(v+w). But this diagonal is T(v)+T(w) by the parallelogram law (see Figure [fig:012980]).
In other words, T(v+w)=T(v)+T(w). A similar argument shows that T(av)=aT(v) for all scalars a, proving that T is indeed linear.
Distance-preserving linear operators are called isometries, and we return to them in Section [sec:10_4].
Reflections and Projections
In Section [sec:2_6] we studied the reflection Qm:R2→R2 in the line y=mx and projection Pm:R2→R2 on the same line. We found (in Theorems [thm:006096] and [thm:006137]) that they are both linear and
Qm has matrix 11+m2[1−m22m2mm2−1] and Pm has matrix 11+m2[1mmm2].
We now look at the analogues in R3.
Let L denote a line through the origin in R3. Given a vector v in R3, the reflection QL(v) of v in L and the projection PL(v) of v on L are defined in Figure [fig:013008]. In the same figure, we see that
PL(v)=v+12[QL(v)−v]=12[QL(v)+v]
so the fact that QL is linear (by Theorem [thm:012963]) shows that PL is also linear.1
However, Theorem [thm:011958] gives us the matrix of PL directly. In fact, if d=[abc]≠0 is a direction vector for L, and we write v=[xyz], then
PL(v)=v∙d‖d‖2d=ax+by+cza2+b2+c2[abc]=1a2+b2+c2[a2abacabb2bcacbcc2][xyz]
as the reader can verify. Note that this shows directly that PL is a matrix transformation and so gives another proof that it is linear.
013009 Let L denote the line through the origin in R3 with direction vector d=[abc]≠0. Then PL and QL are both linear and
PL has matrix 1a2+b2+c2[a2abacabb2bcacbcc2]
QL has matrix 1a2+b2+c2[a2−b2−c22ab2ac2abb2−a2−c22bc2ac2bcc2−a2−b2]
It remains to find the matrix of QL. But ([eq:refProjEq]) implies that QL(v)=2PL(v)−v for each v in R3, so if v=[xyz] we obtain (with some matrix arithmetic):
QL(v)={2a2+b2+c2[a2abacabb2bcacbcc2]−[100010001]}[xyz]=1a2+b2+c2[a2−b2−c22ab2ac2abb2−a2−c22bc2ac2bcc2−a2−b2][xyz]
as required.
In R3 we can reflect in planes as well as lines. Let M denote a plane through the origin in R3. Given a vector v in R3, the reflection QM(v) of v in M and the projection PM(v) of v on M are defined in Figure [fig:013036]. As above, we have
PM(v)=v+12[QM(v)−v]=12[QM(v)+v]
so the fact that QM is linear (again by Theorem [thm:012963]) shows that PM is also linear.
Again we can obtain the matrix directly. If n is a normal for the plane M, then Figure [fig:013036] shows that
PM(v)=v−\projnv=v−v∙n‖n‖2n for all vectors v.
If n=[abc]≠0 and v=[xyz], a computation like the above gives
PM(v)=[100010001][xyz]−ax+by+cza2+b2+c2[abc]=1a2+b2+c2[b2+c2−ab−ac−aba2+c2−bc−ac−bcb2+c2][xyz]
This proves the first part of
013042 Let M denote the plane through the origin in R3 with normal n=[abc]≠0. Then PM and QM are both linear and
PM has matrix 1a2+b2+c2[b2+c2−ab−ac−aba2+c2−bc−ac−bca2+b2]
QM has matrix 1a2+b2+c2[b2+c2−a2−2ab−2ac−2aba2+c2−b2−2bc−2ac−2bca2+b2−c2]
It remains to compute the matrix of QM. Since QM(v)=2PM(v)−v for each v in R3, the computation is similar to the above and is left as an exercise for the reader.
Rotations
In Section [sec:2_6] we studied the rotation Rθ:R2→R2 counterclockwise about the origin through the angle θ. Moreover, we showed in Theorem [thm:006021] that Rθ is linear and has matrix [cosθ−sinθsinθcosθ]. One extension of this is given in the following example.
013065 Let Rz,θ:R3→R3 denote rotation of R3 about the z axis through an angle θ from the positive x axis toward the positive y axis. Show that Rz,θ is linear and find its matrix.
First R is distance preserving and so is linear by Theorem [thm:012963]. Hence we apply Theorem [thm:005789] to obtain the matrix of Rz,θ.
Let i=[100], j=[010], and k=[001] denote the standard basis of R3; we must find Rz,θ(i), Rz,θ(j), and Rz,θ(k). Clearly Rz,θ(k)=k. The effect of Rz,θ on the x-y plane is to rotate it counterclockwise through the angle θ. Hence Figure [fig:013089] gives
Rz,θ(i)=[cosθsinθ0], Rz,θ(j)=[−sinθcosθ0]
so, by Theorem [thm:005789], Rz,θ has matrix
[Rz,θ(i)Rz,θ(j)Rz,θ(k)]=[cosθ−sinθ0sinθcosθ0001]
Example [exa:013065] begs to be generalized. Given a line L through the origin in R3, every rotation about L through a fixed angle is clearly distance preserving, and so is a linear operator by Theorem [thm:012963]. However, giving a precise description of the matrix of this rotation is not easy and will have to wait until more techniques are available.
Transformations of Areas and Volumes
Let v be a nonzero vector in R3. Each vector in the same direction as v whose length is a fraction s of the length of v has the form sv (see Figure [fig:013099]).
With this, scrutiny of Figure [fig:013100] shows that a vector u is in the parallelogram determined by v and w if and only if it has the form u=sv+tw where 0≤s≤1 and 0≤t≤1. But then, if T:R3→R3 is a linear transformation, we have
T(sv+tw)=T(sv)+T(tw)=sT(v)+tT(w)
Hence T(sv+tw) is in the parallelogram determined by T(v) and T(w). Conversely, every vector in this parallelogram has the form T(sv+tw) where sv+tw is in the parallelogram determined by v and w. For this reason, the parallelogram determined by T(v) and T(w) is called the image of the parallelogram determined by v and w. We record this discussion as:
013102 If T:R3→R3 (or R2→R2) is a linear operator, the image of the parallelogram determined by vectors v and w is the parallelogram determined by T(v) and T(w).
This result is illustrated in Figure [fig:013110], and was used in Examples [exa:003088] and [exa:003128] to reveal the effect of expansion and shear transformations.
We now describe the effect of a linear transformation T:R3→R3 on the parallelepiped determined by three vectors u, v, and w in R3 (see the discussion preceding Theorem [thm:012765]). If T has matrix A, Theorem [thm:013102] shows that this parallelepiped is carried to the parallelepiped determined by T(u)=Au, T(v)=Av, and T(w)=Aw. In particular, we want to discover how the volume changes, and it turns out to be closely related to the determinant of the matrix A.
013115 Let \funcvol(u,v,w) denote the volume of the parallelepiped determined by three vectors u, v, and w in R3, and let area (p,q) denote the area of the parallelogram determined by two vectors p and q in R2. Then:
- If A is a 3×3 matrix, then \funcvol(Au,Av,Aw)=|det.
- If A is a 2 \times 2 matrix, then \func{area}(A\mathbf{p}, A\mathbf{q}) = |\det (A)| \cdot \func{area}(\mathbf{p}, \mathbf{q}).
- Let \left[ \begin{array}{ccc} \mathbf{u} & \mathbf{v} & \mathbf{w} \end{array}\right] denote the 3 \times 3 matrix with columns \mathbf{u}, \mathbf{v}, and \mathbf{w}. Then
\func{vol}(A\mathbf{u}, A\mathbf{v}, A\mathbf{w}) = |A\mathbf{u}\bullet (A\mathbf{v} \times A\mathbf{w})| \nonumber
\begin{aligned} A\mathbf{u}\bullet (A\mathbf{v} \times A\mathbf{w}) = \det \left[ \begin{array}{ccc} A\mathbf{u} & A\mathbf{v} & A\mathbf{w}\end{array}\right] &= \det (A\left[ \begin{array}{ccc} \mathbf{u} & \mathbf{v} & \mathbf{w} \end{array}\right]) \\ &= \det (A)\det \left[ \begin{array}{ccc} \mathbf{u} & \mathbf{v} & \mathbf{w} \end{array}\right] \\ &= \det (A)(\mathbf{u}\bullet (\mathbf{v} \times \mathbf{w}))\end{aligned} \nonumber
where we used Definition [def:003447] and the product theorem for determinants. Finally (1) follows from Theorem [thm:012765] by taking absolute values.
- Given \mathbf{p} = \left[ \begin{array}{c} x\\ y \end{array} \right] in \mathbb{R}^2, \mathbf{p}_{1} = \left[ \begin{array}{c} x \\ y \\ 0 \end{array} \right] in \mathbb{R}^3. By the diagram, \func{area}(\mathbf{p}, \mathbf{q}) = \func{vol}(\mathbf{p}_{1}, \mathbf{q}_{1}, \mathbf{k}) where \mathbf{k} is the (length 1) coordinate vector along the z axis. If A is a 2 \times 2 matrix, write A_{1} = \left[ \begin{array}{cc} A & 0 \\ 0 & 1 \end{array} \right] in block form, and observe that (A\mathbf{v})_{1} = (A_{1}\mathbf{v}_{1}) for all \mathbf{v} in \mathbb{R}^2 and A_{1}\mathbf{k} = \mathbf{k}. Hence part (1) of this theorem shows
\begin{aligned} \func{area}(A\mathbf{p}, A\mathbf{q}) &= \func{vol}(A_{1}\mathbf{p}_{1}, A_{1}\mathbf{q}_{1}, A_{1}\mathbf{k}) \\ &= |\det (A_{1})|\func{vol}(\mathbf{p}_{1}, \mathbf{q}_{1}, \mathbf{k})\\ &= |\det (A)|\func{area}(\mathbf{p}, \mathbf{q})\end{aligned} \nonumber
Define the unit square and unit cube to be the square and cube corresponding to the coordinate vectors in \mathbb{R}^2 and \mathbb{R}^3, respectively. Then Theorem [thm:013115] gives a geometrical meaning to the determinant of a matrix A:
- If A is a 2 \times 2 matrix, then |\det (A)| is the area of the image of the unit square under multiplication by A;
- If A is a 3 \times 3 matrix, then |\det (A)| is the volume of the image of the unit cube under multiplication by A.
These results, together with the importance of areas and volumes in geometry, were among the reasons for the initial development of determinants.
- Note that Theorem [thm:012963] does not apply to P_{L} since it does not preserve distance.↩