3.3. Some Important Classes of Linear Transformations#
We have seen in Section 3.1.3 that any matrix corresponds to a linear transformation and that vice versa every linear transformation corresponds to a matrix. In this section, we will study some particularly noteworthy classes of linear transformations in more depth.
3.3.1. Projections#
One of the simplest types of linear transformation takes a vector and sets one of its entries equal to \(0\). For example, we can look at the linear transformation
Geometrically, this is the linear transformation which squashes the plane flat onto the \(x\)-axis. In slightly less informal terms, it is the transformation which projects the plane onto the \(x\)-axis.
Using the orthogonal projections defined in Definition 1.2.3, this can be generalised as follows. If \(\mathbf{v}\) if a vector in \(\mathbb{R}^{n}\), then
is the linear transformation which projects the vector \(\mathbf{w}\) onto the line through \(\mathbf{v}\). In other words, it maps a vector \(\mathbf{w}\) to the closest multiple of \(\mathbf{v}\). This transformation with
can be seen on the left in Figure 3.3.2. Let us briefly verify that it really is a linear transformation.
For any vector \(\mathbf{v}\) in \(\mathbb{R}^{n}\), the map
is a linear transformation.
Proof of Proposition 3.3.1
The proof is a simple application of the definitions. For any \(\mathbf{w}_{1},\mathbf{w}_{2}\) in \(\mathbb{R}^{n}\), we have
Similarly, for any \(\mathbf{w}\) in \(\mathbb{R}^{n}\) and any \(c\) in \(\mathbb{R}\) we have
which finishes the proof.
The following proposition allows us to quickly find the standard matrix of the projection onto an arbitrary line in \(\mathbb{R}^{2}\). This will be useful later on in this section, e.g. in the proof of Proposition 3.3.8.
Let \(\mathcal{L}\) be the line in the plane that passes through the origin and that makes an angle of \(\theta\) with the positive \(x\)-axis. The projection \(T_{\mathcal{L}}\) on \(\mathcal{L}\) has standard matrix
Proof of Proposition 3.3.2
The vector
is a unit vector on \(\mathcal{L}\). Using the fact that \(\mathbf{u}-\proj_{\mathcal{L}}(\mathbf{u})\) makes a right angle with \(\mathcal{L}\) for any vector \(\mathbf{u}\), we find that \(\proj_{\mathcal{L}}(\mathbf{e}_{1})\) has length \(\cos(\theta)\) (cf. Figure 3.3.1). Since \(\proj_{\mathcal{L}}(\mathbf{e}_{1})\) is a vector in the direction of \(\mathbf{v}\) and since \(\mathbf{v}\) has length \(1\), the first column of \(P\) is as claimed.
That the second column is as claimed, too, can be shown analogously. We leave it as an exercise for the interested reader.
Often, you might have not the angle \(\mathcal{L}\) makes with the positive \(x\) axis, but rather a vector \(\mathbf{v}\) on \(\mathcal{L}\). In this case, too, you can find the standard matrix of the projection on \(\mathcal{L}\) quite easily.
Let \(\mathcal{L}\) be a line that passes through the origin in the direction of \(\mathbf{v}=\begin{bmatrix} v_{1}\\v_{2}\end{bmatrix}\). The projection \(T_{\mathcal{L}}\) has standard matrix
Proof of Proposition 3.3.3
It suffices to find the cosine and sine of the angle \(\mathcal{L}\) makes with the positive \(x\)-axis in terms of \(v_{1}\) and \(v_{2}\). We leave this as an exercise.
One salient fact about these projections is that they act as the identity on their range. That is, for any vector \(\mathbf{w}\) in the range of \(T\) we have \(T(T(\mathbf{w}))=T(\mathbf{w})\). This leads us to the following definition:
A linear transformation \(T:\mathbb{R}^{n}\to\mathbb{R}^{n}\) is called a projection if \(T\circ T=T\).
An \(n\times n\)-matrix \(P\) is the standard matrix of a projection if and only if \(P^{2}=P\).
Proof of Proposition 3.3.4
We leave this as an exercise.
It turns out that not all projections look like the ones discussed in Section Section 1.2, not even if we restrict ourselves to a plane. Consider for example the following construction. Let \(\mathbf{v}\) be any non-zero vector in \(\mathbb{R}^{2}\) and let \(\mathcal{L}\) be the line through \(\mathbf{v}\) and the origin. Let \(\mathbf{w}\) be a vector in \(\mathbb{R}^{2}\) which does not lie on \(\mathcal{L}\). For any vector \(\mathbf{u}\), we define \(\mathcal{L}_{\mathbf{u}}\) as the line through \(\mathbf{u}\) in the direction \(\mathbf{w}\). We now define the transformation \(T\) which maps a vector \(\mathbf{u}\) to the intersection of \(\mathcal{L}_{\mathbf{u}}\) and \(\mathcal{L}\). For
this projection is depicted on the right in Figure 3.3.2. It is an example of a non-orthogonal (or oblique) projection. Of course, we again have to check that this is really a linear transformation.
Let \(\mathcal{L}\) be a line through the origin and let \(\mathbf{w}\) be a vector not on \(\mathcal{L}\). The transformation \(T:\mathbb{R}^{2}\to\mathbb{R}^{2}\) which maps a vector \(\mathbf{u}\) to the intersection of \(\mathcal{L}\) and the line through \(\mathbf{u}\) in the direction of \(\mathbf{w}\) is a linear transformation.
Proof of Proposition 3.3.5
For any vector \(\mathbf{u}\), there is a unique pair of real numbers \((c_{\mathbf{u}},d_{\mathbf{u}})\) such that \(\mathbf{u}+c_{\mathbf{u}}\mathbf{w}=d_{\mathbf{u}}\mathbf{v}\). What \(T\) does is map \(\mathbf{u}\) to \(d_{\mathbf{u}}\mathbf{v}\). Hence, for any two vectors \(\mathbf{u}_{1},\mathbf{u}_{2}\) in \(\mathbb{R}^{2}\), we have
Clearly, we also have
so \(T(\mathbf{u}_{1}+\mathbf{u}_{2})=(d_{\mathbf{u}_{1}}+d_{\mathbf{u}_{2}}) \mathbf{v}=T(\mathbf{u_{1}})+T(\mathbf{u}_{2})\). The proof that \(T(c\mathbf{u})=cT(\mathbf{u})\) for any \(\mathbf{u}\) in \(\mathbb{R}^{2}\) and any scalar \(c\) is analogous. We leave it as an exercise.
Let us try to find the standard matrix of the transformation \(T\) we just defined. Its first column is the intersection of \(\mathcal{L}\) with \(\mathcal{L}_{e_{1}}\). This intersection is given by:
so \(T(e_{1})=\begin{bmatrix}\frac{1}{2}\\\frac{1}{4}\end{bmatrix}\). The second column of the standard matrix of \(T\) is the intersection of \(\mathcal{L}\) with \(\mathcal{L}_{e_{2}}\). We find this intersection in a similar fashion:
so \(T(e_{2})=\begin{bmatrix}1\\\frac{1}{2}\end{bmatrix}\) and we conclude that the standard matrix of \(T\) is
We can also consider projections in three dimensional space (cf. Figure 3.3.3). If \(\mathbf{v}\) is a vector in \(\mathbb{R}^{3}\) and \(\mathcal{L}\) is the line in the direction of \(\mathbf{v}\), then
gives the orthogonal projection of the vector \(\mathbf{w}\) on \(\mathcal{L}\). We can also consider the orthogonal projection on a plane in three dimensional space. Suppose the plane \(\mathcal{P}\) is spanned by \(\mathbf{v}_{1}\) and \(\mathbf{v}_{2}\) and assume \(\mathbf{v}_{1}\ip\mathbf{v}_{2}=0\), that is, assume \(\mathbf{v}_{1}\) and \(\mathbf{v}_{2}\) are orthogonal and non-zero. Then
gives the projection on \(\mathcal{P}\).
Let us briefly discuss what happens in higher dimensions. Suppose \(\mathbf{v}_{1},...,\mathbf{v}_{k}\) are non-zero vectors in \(\mathbb{R}^{n}\) which are all orthogonal to each other, i.e. \(\mathbf{v}_{i} \ip\mathbf{v}_{j}=0\) for all \(i\) and \(j\). Put \(V=\Span{\mathbf{v}_{1},...,\mathbf{v}_{k}}\). For any vector \(\mathbf{w}\) in \(\mathbb{R}^{n}\) we can define the orthogonal projection on \(V\) as
Projections, especially orthogonal projections, play a very important role in linear algebra and we will encounter them quite a bit more in later sections.
3.3.2. Reflections#
A second important class of linear transformations with a very natural geometric interpretation is that of reflections. Let us consider a simple example. Suppose we let \(\mathcal{L}\) be the line in the plane through
We can define a transformation \(T\) which reflects points in the plane along \(\mathcal{L}\). That is, we can imagine \(\mathcal{L}\) to act as a kind of mirror, sending points on one side of \(\mathcal{L}\) to their reflection on the other side. (See Figure 3.3.4.) It is easy to find the standard matrix \(M\) of this transformation: the first standard basis vector \(\mathbf{e}_{1}\) is mapped to \(\mathbf{e}_{2}\) and, similarly, \(\mathbf{e}_{2}\) is mapped to \(\mathbf{e}_{1}\), so
So far so good. But how do we find the reflection over an arbitrary line \(\mathcal{L}\)? It turns out that the projections we have seen in Section Projections will help us out. Consider a line \(\mathcal{L}\) and a vector \(\mathbf{v}\) not in \(\mathcal{L}\), as in Figure 3.3.5. In order to reflect \(\mathbf{v}\) over \(\mathcal{L}\), we first move it to the closest point on \(\mathcal{L}\) and then move it the same distance again in the same direction.
The closest point to \(\mathbf{v}\) on \(\mathcal{L}\) is the orthogonal projection \(\text{proj}_{\mathcal{L}}(\mathbf{v})\). To get from \(\mathbf{v}\) to the closest point on \(\mathcal{L}\), we therefore have to subtract \(\mathbf{v}-\text{proj}_{\mathcal{L}}(\mathbf{v})\) from \(\mathbf{v}\) (See Figure 3.3.5.). So in order to reflect \(\mathbf{v}\) over \(\mathcal{L}\), we have to subtract the vector \(\mathbf{v}-\text{proj}_{\mathcal{L}}(\mathbf{v})\) twice from our starting vector \(\mathbf{v}\). This means that any \(\mathbf{v}\) is mapped to \(2\proj_{\mathcal{L}}(\mathbf{v})-\mathbf{v}\), so if we write \(T\) for this transformation we find
Keeping this in mind, it makes sense to define general reflections as follows.
If \(T:\mathbb{R}^{n}\to\mathbb{R}^{n}\) is the orthogonal projection on \(\text{range}(T)\) with standard matrix \(P\), then
is the reflection over \(\text{range}(T)\).
Since any reflection is a linear combination of some projection and the identity, we arrive at the following proposition.
Any reflection is a linear transformation.
Proof of Proposition 3.3.6
A reflection is by definition a sum of scaled linear transformations. As such, it is again a linear transformation.
The following proposition guarantees that, as you would expect, applying a reflection twice leaves you back where you started.
If \(M\) is the standard matrix of a reflection, then \(R^{2}=I\).
Proof of Proposition 3.3.7
We know that \(M=2P-I\) where \(P\) is the standard matrix of some projection. By Proposition 3.3.4, we have \(P^{2}=P\) and therefore
The definition of a reflection in combination with Proposition 3.3.2 allows us to find the standard matrix for the reflection along any line through the origin in \(\mathbb{R}^{2}\).
Let \(\mathcal{L}\) be the line in the plane that passes through the origin and that makes an angle \(\theta\) with the positive \(x\)-axis. The standard matrix of the reflection along \(\mathcal{L}\) is
Proof of Proposition 3.3.8
Exercise. For the second equality, remember the trigonometric identities
For large \(n\) it is hard to picture what a reflection in \(n\)-dimensional space does. But for \(n=3\) it is still doable. In fact, it is done in Figure 3.3.6.
One particularly interesting aspect of reflections is that they preserve lengths of vectors and angles between vectors. This is a consequence of Proposition 3.3.9.
If \(S\) is a reflection defined on \(\R^{n}\), then for any \(\vect{w}_{1},\vect{w}_{2}\) in \(\R^{n}\) we have:
Proof of Proposition 3.3.9
By definition, there is an orthogonal projection with standard matrix \(P\) such that \(S(\vect{w})=(2P-I)\vect{w}\). We assume \(P\) is the projection on the span of a single vector \(\vect{v}\). If there are more, the computations become considerably messier, but neither harder nor more enlightening.
which proves the claim.
3.3.3. Rotations#
As we have seen in Proposition 3.3.9, reflections preserve the dot product and therefore lengths of vectors and the angles between vectors. However, there are other transformations that do so. These other transformations are the rotations. Let us start with the definition.
A rotation is a transformation \(T:\mathbb{R}^{n}\to\mathbb{R}^{n}\) that is not a reflection but such that for any \(\mathbf{v}_{1},\mathbf{v}_{2}\) in \(\mathbb{R}^{n}\) we have:
For convenience, we will also call the identity transformation a rotation, even though it is the reflection over all of \(\mathbb{R}^{n}\).
Rotations are linear transformations.
Proof of Proposition 3.3.10
Let \(T:\mathbb{R}^{n}\to\mathbb{R}^{n}\) be a rotation. Because of Proposition 1.2.7, we have \(\mathbf{v}_{1}\ip \mathbf{v}_{2}=T(\mathbf{v}_{1})\ip T(\mathbf{v}_{2})\). A tedious but not terribly hard calculation now shows that, for every \(\mathbf{v}_{1},\mathbf{v}_{2}\) in \(\mathbb{R}^{n}\),
This implies that \(T(\mathbf{v}_{1}+\mathbf{v}_{2})-T(\mathbf{v}_{1})-T(\mathbf{v}_{2})=\mathbf{0}\), hence \(T(\mathbf{v}_{1}+\mathbf{v}_{2})=T(\mathbf{v}_{1})+T(\mathbf{v}_{2})\).
Similarly, one can show that for any vector \(\mathbf{v}\) in \(\mathbb{R}^{n}\) and any scalar \(c\), we have
This then implies \(T(c\mathbf{v})-cT(\mathbf{v})=\mathbf{0}\) whence \(T(c\mathbf{v})=cT(\mathbf{v})\). In conclusion: \(T\) is a linear transformation.
In fact, the proof of Proposition 3.3.10 only uses the fact that rotations preserve the inner product. It therefore also shows that reflections are linear transformations, but we have already established that using a simpler argument.
The name rotation is inspired by the following observation about rotations in the plane.
For any real number \(\theta\), the rotation over the angle \(\theta\) in the plane has standard matrix
This is indeed the standard matrix of a rotation.
Proof of Proposition 3.3.11
Suppose we take the vector \(\mathbf{e}_{1}\) and rotate it (counterclockwise) over an angle \(\theta\). Where do we end up? By definition, the \(x\)-coordinate of our new location will be \(\cos(\theta)\) and its \(y\)-coordinate will be \(\sin(\theta)\). Similarly, if we start with the vector \(\mathbf{e}_{2}\) and rotate that over the angle \(\theta\), the \(x\)-coordinate of our new point will be \(-\sin(\theta)\). This is illustrated in Figure 3.3.7.
To show that \(R_{\theta}\) is indeed the standard matrix of a rotation, we first note that it is only a reflection if it is the identity matrix. We leave it as an exercise to check that \((R_{\theta}\vect{v}_{1})\cdot (R_{\theta}\vect{v}_{2})=\vect{v}_{1}\cdot \vect{v}_{2}\) for any \(\vect{v}_{1},\vect{v}_{2}\) in \(\R^{2}\).
Alternatively, one can describe a rotation in the plane as a combination of two reflections. We make this precise in the following proposition, which is illustrated in Figure 3.3.8.
Any rotation in the plane is the composition of two reflections.
Proof of Proposition 3.3.12
We will show that the standard matrix \(R_{\theta}\) of the rotation \(T_{\theta}\) over an angle \(\theta\) is the product of the standard matrices of two reflections. The claim follows then from the definition of the matrix product.
Let \(\mathcal{L}_{1}\) and \(\mathcal{L}_{2}\) be two lines in the plane through the origin that make an angle of \(\theta/2\) with each other. If we call \(\phi/2\) the angle \(\mathcal{L}_{1}\) makes with the positive \(x\)-axis, we can conclude that \(\mathcal{L}_{2}\) makes an angle of \(\phi/2+\theta/2\) with the positive \(x\)-axis. From Proposition 3.3.8, we know that the standard matrices of the reflections \(T_{\mathcal{L}_{1}}\) and \(T_{\mathcal{L}_{2}}\) along \(\mathcal{L}_{1}\) and \(\mathcal{L}_{2}\), respectively, are
respectively. Using the fact that, for any angles \(\alpha\) and \(\beta\), we have the identities
we find
In the plane, you can only rotate around the origin. Things get considerably more complicated if we move to \(\mathbb{R}^{3}\), because there you can rotate around any arbitrary line. We will not get into that here.
3.3.4. Shear Transformations#
The last class of linear transformation we will deal with in this section are the shear transformations. These are transformations which fix a certain line through the origin, \(\mathcal{L}\) say, and shift all other points parallel to \(\mathcal{L}\).
Consider the linear transformation
The action of \(T\) is illustrated in Figure 3.3.9. Consider furthermore the line
i.e. the line through the origin in the direction of \(\mathbf{w}\). Any vector \(c\mathbf{w}\) in \(\mathcal{L}\) is fixed:
What happens with vectors not in \(\mathcal{L}\)? Take two scalars \(c\) and \(d\) which are not equal. Then
so \(T\) moves points not on \(\mathcal{L}\) parallel to \(\mathcal{L}\). Points closer to \(\mathcal{L}\) get moved a smaller distance than points further away from \(\mathcal{L}\). Points to the left of \(\mathcal{L}\), i.e. points for which \(c<d\), get moved to the left. Points to the right of \(\mathcal{L}\), i.e. points for which \(c>d\), get moved to the right.
A linear transformation \(T:\mathbb{R}^{2}\to\mathbb{R}^{2}\) is called a shear transformation, or simply a shear, if there is some line \(\mathcal{L}\) and some vector \(\mathbf{w}\) in \(\mathcal{L}\) such that
-
\(T(\mathbf{v})=\mathbf{v}\) for all \(\mathbf{v}\) on \(\mathcal{L}\);
-
for every vector \(\mathbf{v}\) in \(\mathbb{R}^{2}\) there is a scalar \(c\) such that we have
\[ T(\mathbf{v})=\mathbf{v}+c\mathbf{w}. \]
Note that the scalar \(c\) in ii. from Definition 3.3.4 is different for different vectors. For vectors lying on one side of \(\mathcal{L}\), it will be positive. For vectors on the other side of \(\mathcal{L}\) it will be negative. Moreover, for vectors further away from \(\mathcal{L}\), \(c\) will be larger than for vectors closer to \(\mathcal{L}\).
If \(T\) is a shear transformation fixing the line \(\mathcal{L}\) and \(\mathbf{v}\) is an arbitrary vector in \(\mathbb{R}^{2}\), then the distance from \(\mathbf{v}\) to \(\mathcal{L}\) is the same as the distance from \(T(\mathbf{v})\) to \(\mathcal{L}\).
Proof of Proposition 3.3.13
The distance between a vector \(\mathbf{v}\) and a line \(\mathcal{L}\) is the length of \(\mathbf{v}-\proj_{\mathcal{L}}(\mathbf{v})\). We find, for arbitrary \(\mathbf{v}\) in \(\mathbb{R}^{2}\),
which had to be proven.
We can introduce a similar concept in \(\mathbb{R}^{3}\), but now we need the transformation \(T\) to fix not a line but rather a plane.
A linear transformation \(T:\mathbb{R}^{3}\to\mathbb{R}^{3}\) is called a shear transformation, or simply a shear, if there is some plane \(\mathcal{P}\) in \(\mathbb{R}^{3}\) and some vector \(\mathbf{w}\) in \(\mathcal{P}\) such that
-
\(T(\mathbf{v})=\mathbf{v}\) for all \(\mathbf{v}\) on \(\mathcal{P}\);
-
for every vector \(\mathbf{v}\) in \(\mathbb{R}^{3}\) there is a scalar \(c\) such that we have
\[ T(\mathbf{v})=\mathbf{v}+c\mathbf{w}. \]
(Application)
Suppose we have a standard deck of \(52\) perfectly rectangular playing cards placed in a stack on a table. A standard playing card is about \(87\) by \(56\) millimeters, so we can assume that the corners of the lowest card are on
respectively. A playing card typically has a thickness of about \(0.2\) millimeter, so the coordinates of the top card of the stack will be
respectively. If we now move the top card along the \(x\)-axis, then, due to friction, the second card will also move. This in turn will make the third card move and so on. If we assume friction with the table is high enough, the bottom card will approximately remain in place. This situation is depicted in Figure 3.3.10.
The movement of the cards can be described by a shear transformation. If the top card is moved 6 millimeters along the \(x\)-axis, then the edges parallel to the \(y\)-axis of the cards will make an angle of \(\phi=\arctan(10.4/6)\approx \frac{\pi}{3}\) with the positive \(x\)-axis. A card at height \(h\) will be moved a distance of about \(h\frac{1}{\sqrt{3}}\) along the \(x\)-axis. We therefore find that the standard matrix associated to the linear transformation that describes the movement of the cards is
Shear transformations are widely used to model this kind of displacement of layered media. For example in materials science or crystallography.
3.3.5. Grasple Exercises#
Give a geometric description for transformation with given standard matrix.
Show/Hide Content
Give a geometric description for transformation with given standard matrix.
Show/Hide Content
Give the standard matrix from a geometric desciption.
Show/Hide Content
Give the standard matrix from a geometric desciption.
Show/Hide Content
Give the standard matrix from a geometric desciption.
Show/Hide Content
Two transformations and their composition.
Show/Hide Content
Investigating a specific transformation.
Show/Hide Content
Understanding a shear transformation.
Show/Hide Content
Understanding shear transformations.