Here’s a quick index to all the problems in this chapter.
The main index can be found here.
I. (a) Using Plücker line coordinates, , write an expression for the point of intersection of a line with a plane, and the plane defined by a point and a line.
(b) Now derive the condition for a point to be on a line, and a line to be on a plane.
(c) Show that parallel planes intersect in a line on .
(d) Show that parallel lines intersect on
(a) We know that the point of intersection of a line with Plücker matrix and a plane is given by
Expanding this using Plücker coordinates as elements of the skew-symmetrix matrix , we get
The bottom left submatrix of is a skew-symmetric matrix by itself, and as we saw in the solution to exercise 8 of chapter 2, multiplication by a skew-symmetrix matrix represents a cross product.
So, the matrix product
can be represented as the cross product
where and .
We can now rewrite the matrix product as follows
where .
Then we get
where .
This is the equation of line-plane intersection in Plücker coordinates where and and (the Klein quadric constraint).
Similarly, from the expansion of the equation , we can derive the equation of a plane defined by a point and a line in Plücker coordinates to be
(b) For a point to be on a line , it must satisfy the condition . In Plücker coordinates, this would imply and
Similarly for a line to be on a plane , it must satisfy the condition . In Plücker coordinates, this would imply and Note that equality in these equations is not upto scale.
(c) Parallel planes have the same plane normal. Let’s the two parallel planes be where is the common plane normal.
The line of intersection of these two planes, in dual Plücker matrix representation is given by
From this, we get the Plücker coordinates to be , i.e and .
Using the conditions we derived in (b), we see that
and
Hence, we can conclude that the intersection of parallel planes is a line that lies on .
(d) Parallel lines in 3-space are by definition coplanar and thus must intersect in . Consider the two parallel planes from the pencils of planes of which the given parallel lines are the axes. From (c), these two planes intersect in a line that lies on . Hence the two parallel lines must also intersect on this line.
II. Show that a (real) projective transformation of 3-space can map an ellipsoid to a paraboloid or hyperboloid of two sheets, but cannot map an ellipsoid to a hyperboloid of one sheet (i.e. a surface with real rulings).
We can diagonalize ellipsoids, paraboloids and two-sheeted hyperboloids such that the diagonal is .
For a general ellipsoid, using row scaling, this metric diagonalization takes the form
where is a similarity transformation that translates and rotates the ellipsoid so that it is centered at the origin, its axes are aligned with the cartesian axes and its equation is reduced to the canonical form .
Combining the transformation matrices, this transformation can be rewritten as .
Similarly, using spectral decomposition and row scaling, the metric diagonalization of a general paraboloid takes the form
where is a similarity transformation that translates and rotates the paraboloid so that it is centered at the origin, its axis is aligned with the z-axis and its equation is reduced to the canonical form .
Combining the transformation matrices, this transformation can be rewritten as .
Finally, using permutation matrices and row scaling, the metric diagonalization of a two-sheeted hyperboloid takes the form
where is a similarity transformation that translates and rotates the hyperboloid so that it is centered at the origin, its axis is aligned with the z-axis and its equation is reduced to the canonical form .
Combining the transformation matrices, this transformation can be rewritten as .
As all the transformations are invertible, we can then easily convert between ellipsoids, paraboloids and hyperboloids. For example, to convert from an ellipsoid to a paraboloid , we can use the transform
Similarly, to convert from an ellipsoid to a paraboloid , we can use the transform
Hence ellipsoids, paraboloids and two-sheeted hyperboloids are projectively equivalent.
The second result is direct consequences of Sylvester’s law of inertia1 which states that congruent matrices have the same matrix signature. Two matrices and are said to be congruent if they are related by an invertible transformation such that . Inversely, this means if two matrices have different matrix signatures then they can not be congruent.
We know that the matrix signature of an ellipsoid is 2 and that of a one-sheeted hyperboloid is 0. Hence these matrices can not be congruent. This means there is no projective transformation such that , where is the quadratic form of an ellipsoid and is the quadratic form of a one-sheeted hyperboloid.
Note that the first result can also be proven using Sylvester’s law of inertia. As ellipsoids, paraboloids and two-sheeted hyperboloids have the same matrix signature of 2, they are congruent.
III. Show that the matrix representing the Euclidean transformation (with the direction of the rotation axis, i.e. ) has two complex conjugate eigenvalues, and two equal real eigenvalues, and the following eigenvector structure:
(a) if is perpendicular to , then the eigenvectors corresponding to the real eigenvalues are distinct;
(b) otherwise, the eigenvectors corresponding to the real eigenvalues are coincident, and on .
What do the eigenvectors corresponding to the complex eigenvalues represent?
Let
Let represent the characteristic polynomial of . Then the characteristic polynomial in of the given matrix will be . Hence the eigenvalues of will be 1 along with the eigenvalues of .
As is an orthogonal matrix, the absolute value of each of its eigenvalues must be 1. As is also a rotation matrix, its eigenvalue can not be -1. So either has a repeated eigenvalue of 1 or it has one eigenvalue of 1 and two complex conjugate eigenvalues with their absolute values equal to 1 (complex eigenvalues come in complex conjugate pairs). The only rotation matrix that has a repeated eigenvalue of 1 is the identity matrix, as the eigenvectors of such a matrix must span the whole vector space and the identity matrix is the only one that does so. Hence, we can conclude that the eigenvalues of a rotation matrix are 1 and two complex conjugate values and that the eigenvalues of are two equal real eigenvalues (equal to 1) and two complex conjugate eigenvalues.
For the eigenvectors corresponding to the real eigenvalues to be distinct, the matrix should have nullspace dimension of 2. By the rank nullity theorem, this means the dimension of the column space of should be 4 - 2 = 2.
As already has a 2 dimensional column space (only one eigenvector corresponding to eigenvalue 1), for to have a 2 dimensional column space, should be in the column space of .
We know that is an eigenvector of (). As and as the eigenvectors of a matrix and its inverse are the same, lies in the nullspace of . Hence lies in the left nullspace of .
As the column space and left nullspace of any matrix are orthogonal, (from the left nullspace of ) and (from the column space of ) must be orthogonal for the eigenvectors of corresponding to the real eigenvalue 1 to be distinct (planar motion).
If is not in the column space of , then the rank of the matrix will be 3, meaning that its nullspace will be 1 dimensional. Hence the eigenvectors corresponding to the real-valued eigenvalue will be coincident. Further, from the structure of , we can see that the eigenvector that spans this nullspace will be , where is the eigenvector of . This clearly lies on .
The two complex conjugate eigenvectors are the fixed points of the rotation and they clearly lie on . For rotation matrices, the complex conjugate eigenvectors must lie on the plane orthogonal to 2. We also know that rotations preserve circular points at infinity. Hence, we can conclude that the complex conjugate eigenvectors of the rotation matrix and hence are the circular points at infinity for the planes orthogonal to the rotation axis.
References
- Wikipedia. Sylvester’s law of inertia. https://en.wikipedia.org/wiki/Sylvester%27s_law_of_inertia. [return]
- Joel Burdick, Caltech Robotics. Section 3, Notes on Rotations. http://robotics.caltech.edu/~jwb/courses/ME115/handouts/rotation.pdf [return]