We saw examples of orthogonal maps like rotations, reflections, and combinations thereof. We will see that in case the dimension is , the orthogonal maps can be divided into reflections and rotations.
For each finite-dimensional inner product space and orthogonal map we have
We write for the dimension of and choose an orthonormal basis for the vector space . Let By Orthogonality criteria for matrices, the matrix is orthogonal, that is, . For the determinant of we have the following equalities: From the above we conclude that .
Let and be as in the theorem and write . We know that the determinant is equal to the product of the complex eigenvalues of . Because the length is invariant under the map , each eigenvalue lies on the unit circle. If is a non-real eigenvalue, it is accompanied by the eigenvalue , while the product of these two eigenvalues equals . If , at least one eigenvalue must be equal to .
We will be using this theorem to divide orthogonal maps on finite-dimensional vector spaces into two groups.
Let be a finite-dimensional vector space and an orthogonal map . We define the following division in the orthogonal maps:
- If , then is called a special orthogonal map.
- If , then is called a non-special orthogonal map.
Previously we saw that any orthogonal map with is either the identity map or multiplication by . In the first case, is special orthogonal; in the second case, non-special orthogonal.
Let and be as in the theorem and suppose . If is non-special orthogonal, then has an eigenvalue (see above), and so also an eigenvalue . In this case, the eigenspaces for the various eigenvalues are mutually perpendicular by property 5 of orthogonal maps, so is an orthogonal reflection about the eigenspace corresponding to the eigenvalue . If is special orthogonal and distinct from and from , then has two different, complex conjugate, eigenvalues and . We shall see below that then is a rotation with angle
The following theorem shows concretely that these two groups correspond to reflections and rotations in the two-dimensional case.
Let be an inner product space of dimension , and an orthogonal map.
- If is special orthogonal, then there exists an orthonormal basis for such that where the angle belongs to . In this case we call a rotation with oriented angle .
- If is non-special orthogonal, then there exists an orthonormal basis for such that Then is a reflection.
Choose an orthonormal basis of . We note that a vector in of length can be written as . After all, Therefore, we can write the matrix of with respect to as where and belong to the interval . Indeed, the columns of both have length . The other requirement is that the inner product of the columns be zero. This gives This implies for some , so
We first consider the case where . Then
The determinant is ; the rotation is special orthogonal. It only remains for us to show that can always be chosen in .
Suppose . Then we have and interchanging the two vectors of the orthonormal basis again gives an orthonormal basis with respect to which the matrix of equals This shows that we can always choose .
Now consider the case where . This leads to
This matrix has determinant , which implies that has an eigenvalue . Since , the other eigenvalue must be . Consequently, there is a basis of eigenvectors with eigenvalues and . The matrix of with respect to this basis is The eigenvectors and are perpendicular to each other, for It follows that . With respect to the basis the map has matrix
We will explain further how these matrices correspond to rotations and reflections.
Rotation : We consider the image of the vector where is an orthonormal basis of . We now have Therefore, the cosine of the angle between the two vectors and is given by Here we have made use of the fact that . We see that indeed describes a rotation over the angle .
Reflection : This is the reflection in the line spanned by , where is an orthonormal basis: a vector with components along the line spanned by and perpendicular to that line is mapped onto .
Consider the matrix of a rotation about the origin in the plane over an oriented angle . We can conjugate by one of the two following matrices to the matrix of a rotation with oriented angle .
The first conjugator corresponds to interchanging the two basis vectors, the second to replacing the second basis vector by its negative.
We can read off from the matrix that the characteristic polynomial of a -dimensional orthogonal map equals in case of a rotation and in case of a reflection.
These polynomials factor into linear terms as follows: The two factors only coincide if we are the first case, with . In this case, the matrix is diagonal. If , then the two factors are distinct, and so is complex diagonalizable. Due to Recognizing diagonalizability using the minimal polynomial, it turns out that is always complex diagonalizable.
In the second case, the matrix is already diagonal. In the first case, the matrix conjugates to the diagonal matrix with diagonal entries :
If is special orthogonal, then is a rotation, as we have seen. The above expression for immediately shows that the trace of this matrix equals . The trace is invariant under basis transformations, so we may write . This result is consistent with the fact that there exists a basis with respect to which the matrix of is diagonal with diagonal elements and , as we saw in the previous tab Diagonalizability: Vice versa, we can express the angle of rotation in terms of the trace of the map :
Consider the matrix: This matrix is orthogonal and its determinant is , so is a rotation.
Determine the angle of this rotation in degrees. Round to the nearest integer.
The vector is mapped by onto . Because these vectors have length , the angle between these two vectors is given by Therefore,