Professional Documents
Culture Documents
309Ex3FL2007 Solutions
309Ex3FL2007 Solutions
Section 1
Optional Exam 3, Fall 2007
Part I. Answer each question. Be sure to indicate how you got the answer, by
showing some work or adding a sentence of explanation for your answer.
1. a) Find det
det det det det
1 0
b) Let det .
i) det
1 2 0 3
ii) det
iii) det
iii) (because: the first matrix factor comes from the original matrix by
multiplying the second row by 2; its determinant is therefore
the second matrix factor is just the transpose of the first, so it also
has determinant . Since the determinant of the product is the
product of the determinants, the product has determinant
2. Two diagonally opposite vertices of a parallelogram are and . A third
vertex is . What is the area of ?
If we subtract from each vector, the vertices are translated in the plane to the points
and The parallelogram with one vertex at and the
vectors and as adjacent sides has the same area as , namely
det .
3. Find a basis for the column space and the null space of .
The matrix is already in an echelon form, so we can see that Columns 1 and 2 are the
pivot columns, and these are a basis for Col
To find a basis for Nul , we need to solve Row reducing the augmented
matrix to row reduced echelon form gives
, so .
A basis for Nul is
4. The eigenvalues of are and
Note that the augmented matrix can be put into row reduced echelon form simply by two
row interchanges:
, and this lets you write down the
.
Given this information: Is there a matrix and a diagonal matrix for which
? Explain why or why not.
No. The eigenspace for has dimension . The eigenspace form has
dimension also (because its dimension must be the multiplicity of the
eigenvalue. Since the sum of the dimensions of the eigenspaces is , the matrix
cannot be diagonalizable.
5. Suppose is a matrix with the following eigenvalues and corresponding
eigenvectors: with an eigenvector
2
, with an eigenvector.
1
Do Step i). If your answer involves the inverse of some matrix, find the inverse.
(Don't bother with Step ii) since it's just matrix multiplications and arithmetic).
There are two eigenspaces and each must have dimension at least ; since the sum of the
dimensions must be 2 each eigenspace has dimension . Therefore and
form an eigenvector basis for . Therefore is diagonalizable and
2
1
2
(
1
2
For large enough , so
1
c) How is the long term behavior of different if we start with ?
2
In that case , so
1
2
( (
1
Then as
6. Find a steady state probability vector for the Markov process , where
,
so that all solutions are given by One neat solution (without fractions) for
is therefore , but it is not a probability vector because the sum of its entries
. To get a solution that is a probability vector, we divide each entry by the sum of the
entries:
(that is, we choose . This gives
False Row interchanges might be used. Each row interchange switches the sign of the
determinant. If the total number of row interchanges is even, then det det but if
the total number is odd, then det det
2. If is a 6-dimensional vector space, then any set of exactly 6 nonzero elements of
is automatically a basis for .
False The set might not be linearly independent. For example, the set
in is not a basis for
True Otherwise, we could throw out vectors from the spanning set and reduce it to a
basis with fewer than vectors in it.
False dim For example, one possible basis is the standard basis
True Col consists of all linear combinations of columns of . Since has rows,
each column of is a vector in
6. is diagonalizable.
True is upper triangular, so the eigenvalues are the entries on the diagonal:
Therefore there are eigenspaces and each must have dimension at least . Therefore the
sum of the dimensions of the eigenspaces can only be . This means is diagonalizable.
False For example, the zero matrix is not in this set.
9. If the real matrix has complex eigenvalue , then has at least one other
eigenvalue.