Problem
F-1. Prove Theorem .
Suggested:
and
.
Problem
F-2. Prove Corollaries and
.
Problem
F-3. Prove Proposition .
Problem
F-4. Prove Proposition .
Problem
F-5. A permutation matrix is a matrix whose entries
are 0 except for a single in each row and column, for
example,
.
(a) For this , describe the action of the corresponding
transformation
when applied to a vector
.
(b) Find the entries of , row by row. Do this
aloud, without writing anything.
Problem
F-6. The following are some interesting cases. Verify
directly that each of them is orthogonal. They are really all
rotations about an axis through the origin and .
(a) A rotation by
is
(b) A rotation by
is
(c) A rotation by
is
(d) A rotation by
is
(In this example, could you find the matrix by direct reasoning? What
happens to the
-,
-, and
-axes when you rotate by
about an axis along
?)
Problem
F-7. Suppose is defined to be the product
.
(a) Explain whether is orthogonal, and why.
(b) Find the inverse of explicitly.
(c) Is a rotation? Explain why or why not.
Problem
F-8. (a) Write down these matrices, with explicit entries:
,
,
. To get the signs of the entries, imagine an example
where
and decide whether the images
of
i,
j,
k have any negative coordinates.
(b) For each, say whether the rotation is clockwise or
counterclockwise as seen looking towards the origin from a point
on the positive half of its fixed axis. (For example, for
, the point would be
with
.)
Any surprises?
Problem
F-9. For a given , you can write six matrix
expressions such as
,
,
, etc. Their inverses give six
more matrix expressions. Another twelve expressions are formed
by putting
for
. Break these twenty-four
matrix expressions into separate lists so that the expressions in
each list are necessarily equal but any two matrices from
different lists are not equal in general. For example,
and
are
equal and so are in the same list.
Problem
F-10. (a) In
R, clearly
. By writing out these matrices and
performing the matrix multiplication, derive the laws for the
sine and cosine of the sum of two angles.
(b) Similarly, use
to find formulas for
and
.
(c) If you need the formula for
and
don't remember it, what is a simple way to find it?
Problem
F-11. (a) Find all
rotation matrices that are
also diagonal. (b) Find all
rotation matrices that
are diagonal. (c) What about the
case?
Problem
F-12. To find the inverse of a
rotation
matrix or a standard
rotation matrix (such
as
), it seems to work just to reverse
the sign of all off-diagonal entries. Find an example to show
that this is not a valid method for all rotations, i.e., find
an example of a rotation matrix for which reversing the sign
of off-diagonal entries is not the same as taking the transpose.
Problem F-13. Show that if the rows of a square matrix are mutually orthogonal and have the same length, then the same is true about the columns. (Method: Start by scaling the entries of the matrix uniformly to get a matrix of a kind you know about.)
Problem
F-14. (a) In
R, if the list of vertices of a
square starts with
and
, going
counterclockwise, what are the remaining two vertices?
(Suggestion: The vertex opposite
can be obtained by
rotating
by
about the origin.)
(b) In
R, the standard unit square is the square with
vertices
,
,
, and
. Find a
matrix that takes the standard unit square to the square
mentioned in (a).
Problem
F-15. Matrices of the form
are
useful in graphics.
(a) Suppose numbers and
are given, not both zero.
Find the entries of a rotation matrix that takes
to a
unit vector in the direction of
. (You do not need to
express the angle of the rotation.)
(b) Show that a matrix of the form mentioned is equal to a
rotation matrix times a scalar matrix
with
.
(Thus
x
xA preserves shapes and orientation while
expanding or contracting the size uniformly.)
Problem
F-16. Matrices of the form
, mentioned
in Problem F-
, are also useful mathematically. (a) Show that
if two matrices of this form are added, you get another matrix of
this form. (b) Show that if two matrices of this form are
multiplied, you get another matrix of this form. (c) Show that
the inverse of a matrix of this form is again of this form. (d)
Two matrices
are said to commute if
. Show
that any two matrices of this form commute. (e) Show that any
rotation matrix has this form. (f) Show that the
matrices of this form are precisely the matrices that commute
with
. (Note. Let's take
to be real
numbers. By (a)-(d), you can do ``arithmetic'' with these
matrices. It turns out that they work exactly like complex
numbers; in fact,
is like
,
the identity matrix is like
, and
is like
, the square root of
. This is actually a concrete
way of seeing that the complex numbers exist.)
Problem
F-17. In
R (only), show that if
u
v
w
are vectors with the same cross-product relations as
i
j
k,
i.e.,
u
v
w,
v
w
u, and
w
v
u, then either
u
v
w are orthonormal or else they
are all zero vectors.
(Method: Say why they are perpendicular to each other, then
write down the relations between their lengths, taking into
account that
in each cross product. If the
lengths are
respectively, you should get relations
. Substituting one into another you should
be able to get
, etc. What are the solutions?)
Problem
F-18. (a) Show that a nonzero
matrix
is a
rotation if and only if the rows of
have the same cross-product
relations as
i,
j,
k; for example, row 1
row 2 = row 3. (b) What about such relations between columns?
(Method: Work in terms of the corresponding transformation
x
x
. Remember that the rows of
are the images
of the standard basis vectors, or in other words are
i
,
j
,
k
. For
use the fact that
is
orthogonal so
preserves the geometric ingredients needed to
determine cross products. For
, you may quote
Problem F-
. Why is orientation preserved rather than
reversed?)
Problem
F-19. In
R,
takes points on the
-axis to points on the
-axis.
(a) Does it equal
? (Show your work.)
(b) Is it a rotation matrix? (Give reason.)
(c) Find an axis. (Method: The points on the axis are fixed
points. In other words, a point lies on the axis of
the rotation given by a matrix
when
.)
Problem
F-20. (a) Let be a homogeneous linear transformation that is a
rotation in
R
. Explain: The axis of
is the eigenspace for the eigenvalue 1, provided that
is not the identity transformation.
(Recall that if is a homogeneous linear transformation and
x is a nonzero vector such that
x
x for
some scalar
, then
x is an eigenvector of
for the eigenvalue
. The eigenspace of
is
x
R
x
x
, which is a
subspace. In other words, the eigenspace for
consists
of all eigenvectors and the zero vector. It makes sense to ask
about the eigenspace for
even if
is not an
eigenvalue, but in that case the eigenspace is simply the
subspace consisting of the zero vector alone.)
(b) If is the identity transformation on
R
,
what is the eigenspace for the eigenvalue 1?
(c) What can be said in
R?
Problem
F-21. (a) The matrix
is a rotation in
R
. Find its axis by finding a
nonzero eigenvector for the eigenvalue 1. (See Problem F-
.)
A short way to do this is as follows: Consider a nonzero vector
x along the axis of . Thus
x
x, or
equivalently,
x
0. Since a row vector times a
matrix is really three dot products, this says that
x is
perpendicular to all three columns of
. So find the cross
product of the first two columns of
.
(b) The short method works for , but what if, say, the first
column of
were the zero vector? Show that in that case,
i would be along the axis of rotation, so it would not be
necessary even to use the short method.
Problem
F-22. This problem shows that in
R every rotation
matrix
has an axis, i.e., a line through the origin
consisting of fixed points (points
x with
x
x).
For example, if you take a new basketball out of its box, dribble
it around, and put it back, its new position is rotated compared
to the old, so according to this problem, there will be some axis
for this rotation; the two opposite points on the basketball that
are on this axis will be in the same place they were before you
opened the box.
By Problem F-, all you have to do is to show somehow
that
is an eigenvalue of
. Thus a statement about
rotations that seemed to be geometrical really turns out to be
true for algebraic reasons. Some useful facts about eigenvalues
are given below.
(a) Show that the list of the three eigenvalues
of
is the same as the list of
their reciprocals (not necessarily in the same order).
(b) Show that 1 is an eigenvalue of . (Method: There are
several conceivable ways in which the eigenvalues could match up
with the reciprocals. For each way, to show that one of the
eigenvalues must be 1.)
Useful facts: If
x is an eigenvector for some eigenvalue
, so are all nonzero scalar multiples of
x. A
matrix and its transpose have the same characteristic polynomial
and so have the same eigenvalues; the eigenvalues of the
inverse of a matrix are the reciprocals of the eigenvalues of
the matrix; the product of the eigenvalues of a matrix equals
the determinant; the determinant of a rotation matrix is 1.
(Here eigenvalues are listed more than once if necessary; for
example, if a matrix has characteristic polynomial
, we would say its eigenvalues are
. In this problem the eigenvalues we are talking
about could actually be complex numbers, but you don't need to
worry about that in doing the problem, since if 1 is an eigenvalue
then there is a corresponding real eigenvector.)
Problem
F-23. Show that in
R, every rotation matrix
has an invariant plane through the origin, in other words, a
2-dimensional subspace
such that for all
x
you
have
x
. (You may use the result of Problem F-
.
Notice that to say
is invariant is a weaker
statement than to say that every point of
is fixed.)
Problem
F-24. (a) Does the vector make a
angle with the
-axis?
(b) Find a rotation matrix in
R that takes a point on the
-axis (other than the origin) to a point on the line through
the origin and
. (One way: First rotate with points
on the
-axis going towards points on the
-axis and then
rotate with points on the
-axis going towards points on the
-axis. But by what angles? You may leave your answer as
a product of matrices, each with explicit entries.)
(c) Find another answer to (b). Are there still more answers?
(Method: If was your answer, then
is another answer. Why? Can you generalize this idea?)
Problem
F-25. Find the entries of a rotation matrix that gives a
rotation in
R of
about an axis through the
origin and
, counterclockwise as seen from
looking toward the origin.
(Method: Use a three-step idea of moving the axis to a simpler
position (the -axis), doing an easier rotation, and moving
back. Thus the answer is a product of three rotation matrices.
The third one rotates the
-axis to the given axis, the
middle one is a rotation about the
-axis by the given angle,
and the first is the inverse of the third. You may use the
result of (b) from Problem F-
, so that two of your
matrices are themselves already given as products.)
Problem
F-26. In three dimensions, it is also possible to define what
it means for a homogeneous linear transformation to be a
``reflection in a line''
, where
is a line through the
origin. (a) Invent such a definition. (b) What will the
eigenvectors and eigenvalues of
be? (c) Such a transformation
is really a rotation. What rotation?
Problem F-27. (a) Show that the product of two reflection matrices is a rotation matrix.
(b) In
R, what rotation is obtained by first reflecting
with the
-axis as a mirror and then reflecting with the
-axis as a mirror?
(c) In
R, what rotation is obtained by first reflecting
with the
-plane as a mirror and then reflecting with the
-plane as a mirror? (Answer with a matrix and describe the
axis of the rotation.)
Problem
F-28. (a) Let
, a reflection in the
-axis. Show that
, both by a
calculation and by describing what the effect is if you do the
left side to an object such as a piece of paper. (For clarity,
imagine using paper with printing on it.)
(b) Show that
. (Use (a), or
calculate directly.)
(c) Show that the matrix of a reflection in
R whose
mirror line makes an angle
with the
-axis is
. (Start from the ``three-step method.'')
Problem
F-29. Show that in
R, these matrices are orthogonal,
but are neither rotations nor reflections (in a plane):
(a) (where
is the
identity matrix);
(b) the product of
and a
reflection with the
-plane as mirror.
(Method: The fixed points of a reflection in
R
are the points of the mirror, which should be a plane. Find the
fixed points of these matrices and see if they do form a plane.)
(c) In
R, is
a reflection or rotation, or neither?
If it is a reflection, what is the mirror? If it is a rotation,
by what angle? If neither, can it be expressed as in (b)?
(Note. Sometimes is thought of as a ``reflection in
a point'' (the origin), but for us a reflection means a reflection
in a mirror plane in
R
or a mirror line in
R
.)
Problem
F-30. Consider the h.l.t.
R
R
whose matrix
is
. Notice that
permutes the axes, taking each one to the next cyclically.
is an orthogonal matrix. Is
a rotation, a reflection
(in a three-dimensional ``hyperplane''), or neither?
Problem
F-31. A group of matrices is a set of matrices that
contains , is ``closed under taking products'', and is ``closed
under taking inverses''. In other words, the product of two
matrices in the group is itself in the group and the inverse of a
matrix in the group is in the group. According to Corollary
,
the orthogonal
matrices form a group,
called the orthogonal group
O
. According to
Proposition
, the
rotation matrices form
a group, called the rotation group
SO
(``special
orthogonal''). Do reflections form a group of matrices?
Problem
F-32. Find the matrix of a reflection in
R whose
mirror line is the line through the origin
counterclockwise from the
axis. (Method #1: Express your
answer as a product of three matrices: The matrix that rotates
the mirror line to the
-axis, the reflection matrix whose
mirror is the
-axis, and the matrix that undoes the first
rotation. Method #2: Apply the formula from (6) of §
.)
Problem
F-33. There are only two
rotation matrices that
have real eigenvalues. (a) Which ones? (b) Why are there no
others? (Give some explanation.)
Problem
F-34. Recall that the latitude of a point on the earth is the
angle from the equator to the point, as measured from the center
of the earth, and the longitude of a point on the earth is the
angle from Greenwich [``gren'itch''], England to the point, as
measured looking from above the north pole. (Angles can be
negative if appropriate.) It is handy to imagine the earth as a
unit sphere in
R, with the origin at the center of the
earth, the positive
-axis going through the point with zero
latitude and zero longitude, and the positive
-axis going
through the north pole.
(a) Describe a rotation matrix that would take to
the point with latitude
and longitude
.
(You may express your answer as the product of two specific
rotation matrices.)
(b) Find a formula for the Cartesian coordinates of
the point on the earth with latitude
and longitude
. (Method: Use the idea of (a) and multiply out. For
example, you should get
.)
Problem
F-35. Invent a method of describing a rotation in
R
uniquely by using three numbers. (You may use the fact that the
rotation has an axis.)
Problem
F-36. Can every
rotation matrix be obtained in
the form
for suitable
and
? (Method: If the answer were ``yes'', that
would mean three-dimensional rotations could be described with
just two numbers, which sounds unlikely in view of the preceding
problem. Show that in fact,
cannot
be obtained in the specified form, by considering what happens to
a vector on the
-axis.)
Problem
F-37. A puzzle: Make a rotation matrix by filling in
. (Give reasoning. As in Problem F-
and
Problem F-
, notice that there are three numbers of
information; the answer is almost unique but not quite.)
Problem
F-38. (a) In
R, is the product of three reflections
always a reflection? Give a reason for your answer (an
explanation if it's true, or a counterexample if it's not).
(b) Same question for
R.
Problem
F-39. Show that
is a scalar
multiple of
.
Problem
F-40. In
R, find the matrix of the reflection
in the mirror
.
Problem
F-41. For a unit vector
n in
R, let
n
n, as in (6) of §
, and let
v
v
.
(a) Check directly that if
v is a scalar multiple of
n, then
v
v.
(b) Check directly that if
v is perpendicular to
n,
i.e., lies in the plane through the origin with normal
n,
then
v
v.
(c) If you do a reflection twice, you should get the vector you
started with. Show directly that
v
v, or
equivalently,
.
Problem
F-42. In
R, use (6) of §
to find the
matrix of the reflection whose mirror line goes through the
origin and
. (You will need to find
N.)
Problem
F-43. (a) For a reflection in
R
whose mirror
plane has unit normal
n, show that
x
x
x
n
n.
(Method: For any vector x, write
(*)
x x
x
,
where
x is perpendicular to the mirror plane and
x
is parallel to the mirror plane. You know that
the length of
x
is
x
n, so
x
x
n
n. Then
x
is simply
x minus
this. Now use the observation that
leaves
x
fixed but negates
x
. What happens when you apply
to (*)?)
(b) Derive (6) of §. (Method: Starting from (a),
use the observation that a dot product
u
v can be
expressed as
u
v
, the product of a row vector
and a column vector. Also, a product of three matrices can
be associated in either order. Write
x
x
and see if
you can get
x
x
.)
Problem
F-44. Find the matrix of the reflection in
R
whose mirror line is the line through the origin slanted at
, by using three methods: (a) The ``three-step'' method,
as in lecture; (b) the method of the fact (6) of §
,
and (c) the method of finding
, as discussed
in one of the problems above. Your three answers should agree.
Problem
F-45. Recall that a rational number is the ratio of
two integers, i.e., is expressible as a fraction. Thus
,
, and
(
) are
rational. In contrast,
,
, and
are
irrational. A vector or matrix is said to be rational if all
entries are rational, and is said to be irrational otherwise.
For a plane
with
rational,
usually the unit normal to that plane will be irrational. Show
that, nevertheless, the matrix of the reflection in
R
with that plane as mirror plane is necessarily rational. (Method:
Does any formula for this matrix involve only operations which
for rational numbers give rational answers, such as addition,
rather than operations such as taking square roots, which don't?)
Problem
F-46. The matrix of a reflection in
R (with mirror plane
through the origin) will always have eigenvalues
. (a)
Explain why. (b) What is its characteristic polynomial?
Problem
F-47.
As mentioned in Problem F-, the matrix
is a rotation in
R
.
By what angle?
(Method: Find a nonzero vector
y perpendicular to the axis
of and then find the angle between
y and
y
.
Such a vector
y can be found without actually finding the
axis, as follows: As in Problem F-
, the columns of
are perpendicular to the axis of the rotation, so just
let
y be the first column of
. In general, if the
first column of
were
0 we'd have to choose another
column, but that's not the case in this example.)
Problem
F-48. Show that a
orthogonal matrix
of
determinant
is the product of a rotation
and a reflection
in a mirror perpendicular to the axis of
.
(Method: Since the characteristic polynomial of is cubic,
has a real eigenvalue, and since
gives a rigid
transformation that eigenvalue is either
or
. In
other words,
either has a fixed vector or a vector that is
negated. Take
to have mirror with this vector as normal.
Consider the two cases separately.)