Throughout, unless \(V\) is identified explicitly, \(V\) will denote a vector space over \(F\), where \(F\) denotes either \(\mathbb{R}\) or \(\mathbb{C}\).
True-False and Short Answer (40 points)
Problem 1
True or False: If \(V\) is a 10 dimensional vector space, then \(V\) can be spanned by 15 vectors.
Answer. True.
Problem 2
True or False: There exists a system of \(m\) linear equations in \(n\) unknowns with exactly 17 solutions.
Answer. False.
Problem 3
Define what it means for the vectors \(v_1, \ldots, v_n\in V\) to be linearly independent. Do not just say the vectors are not linearly dependent.
Solution. The vectors \(v_1, \ldots, v_n\) are linearly independent if whenever \(a_1, \ldots, a_n\in F\) satisfy
then \(a_1 = a_2 = \cdots = a_n = 0\). Equivalently, no \(v_j\) belongs to \(\mathrm{Span}\{v_1, \ldots, v_{j-1}, v_{j+1}, \ldots, v_n\}\).
Problem 4
State the Exchange Theorem.
Solution. Suppose \(v_1, \ldots, v_t\) span the subspace \(W\) and \(w_1, \ldots, w_s\in W\) are linearly independent. Then \(s\leq t\), and after renumbering the \(v_i\) if necessary, the vectors
span \(W\).
Problem 5
Let \(A\) be an \(n\times n\) matrix. State three equivalent conditions for \(|A|\not= 0\).
Solution. Possible answers include the following which are equivalent to \(|A|\neq 0\):
- (i) \(A\) is invertible.
- (ii) The rows (or columns) of \(A\) form a basis for \(F^n\).
- (iii) For every \(b\in F^n\), the system \(AX = b\) has a unique solution.
- (iv) The columns (equivalently, the rows) of \(A\) are linearly independent.
- (v) \(A\) is row equivalent to the identity matrix \(I_n\).
Problem 6
Write \(\mathrm{det}\begin{pmatrix} 1 & 0 & 3 & -4\\2 & 1 & 0 & -6\\0 & 0 & 2 & 5\\1 & 1 & 2 & 9\end{pmatrix}\) by expanding along the 3rd column. Do not calculate the resulting \(3\times 3\) determinants.
Solution. The entries of the third column are \(a_{13} = 3\), \(a_{23} = 0\), \(a_{33} = 2\), \(a_{43} = 2\), with signs \((-1)^{i+3}\), namely \(+, -, +, -\). Thus
Problem 7
True or False: \(\mathrm{det}\begin{pmatrix} a & b & c\\d & e & f\\a & b & c\end{pmatrix} = -\mathrm{det}\begin{pmatrix} a & b & c\\d & e & f\\a & b & c\end{pmatrix}\).
Answer. True.
Problem 8
Let \(V, W, U\) be vector spaces over \(F\) with bases \(\alpha, \beta, \gamma\) and suppose \(T: V\to W\) and \(S: W\to U\) are linear transformations. Place the given bases in the appropriate places to make the formula \([ST] = [S]\cdot [T]\) valid.
Solution.
Problem 9
Let \(T: V\to V\) be a linear transformation and suppose \(\alpha, \beta\) are bases for \(V\). Write the change of basis formula relating the matrix of \(T\) with respect to \(\alpha\) to the matrix of \(T\) with respect to \(\beta\).
Solution. Let \(I: V\to V\) be the identity map. Then
Problem 10
For the matrix \(A = \begin{pmatrix} 2 & 4 & -9\\0 & 2 & 5\\1 & 5 & 2\end{pmatrix}\), find the \((2,3)\) entry of \(A'\), the adjugate or classical adjoint of \(A\).
Solution. The adjugate is the transpose of the cofactor matrix \(C\) whose \((i,j)\) entry is \((-1)^{i+j}|A_{ij}|\), so the \((2,3)\) entry of \(A'\) is the \((3,2)\) entry of \(C\). Deleting row 3 and column 2 of \(A\) gives
Calculation Problems (60 points)
For these problems, we let \(V\) denote the vector space of real \(2\times 2\) matrices and recall that if \(A = \begin{pmatrix} a & b\\c & d\end{pmatrix}\), then \(\mathrm{tr}(A)\), the trace of \(A\), is \(a+d\).
Problem 1
Let \(W = \{A\in V\ |\ \mathrm{tr}(A) = 0\}\). Verify that \(W\) is a subspace of \(V\).
Solution. We check the two subspace conditions. Let \(A = \begin{pmatrix} a_1 & b_1\\c_1 & d_1\end{pmatrix}\) and \(B = \begin{pmatrix} a_2 & b_2\\c_2 & d_2\end{pmatrix}\) be in \(W\), so \(a_1+d_1 = 0\) and \(a_2+d_2 = 0\), and let \(\lambda\in\mathbb{R}\).
- (i) \(A+B = \begin{pmatrix} a_1+a_2 & b_1+b_2\\c_1+c_2 & d_1+d_2\end{pmatrix}\), so \(\mathrm{tr}(A+B) = (a_1+a_2)+(d_1+d_2) = (a_1+d_1)+(a_2+d_2) = 0+0 = 0\). Hence \(A+B\in W\), so \(W\) is closed under addition.
- (ii) \(\lambda A = \begin{pmatrix} \lambda a_1 & \lambda b_1\\\lambda c_1 & \lambda d_1\end{pmatrix}\), so \(\mathrm{tr}(\lambda A) = \lambda a_1+\lambda d_1 = \lambda(a_1+d_1) = \lambda\cdot 0 = 0\). Hence \(\lambda A\in W\), so \(W\) is closed under scalar multiplication.
Therefore \(W\) is a subspace of \(V\).
Problem 2
Find a basis \(\alpha\) for \(W\). Be sure to justify your answer.
Solution. If \(A = \begin{pmatrix} a & b\\c & d\end{pmatrix}\in W\), then \(d = -a\), so
Let
and \(\alpha = \{v_1, v_2, v_3\}\). Each \(v_i\) has trace \(0\), so \(\alpha\subseteq W\).
Spanning: The displayed equation shows every \(A\in W\) is a linear combination of \(v_1, v_2, v_3\), so \(\alpha\) spans \(W\).
Linear independence: If \(av_1+bv_2+cv_3 = 0\), then
so \(a = b = c = 0\).
Hence \(\alpha\) is a basis for \(W\), and \(\dim W = 3\).
Problem 3
For \(A = \begin{pmatrix} a & b\\c & d\end{pmatrix}\) in \(W\), let \(T: W\to W\) be the linear transformation defined by \(T(A) = A'\), where \(A'\) is the adjugate or classical adjoint of \(A\). For \(\alpha\) in Problem 2, find \([T]_{\alpha}^{\alpha}\).
Solution. For a \(2\times 2\) matrix, \(\begin{pmatrix} a & b\\c & d\end{pmatrix}' = \begin{pmatrix} d & -b\\-c & a\end{pmatrix}\). Applying this to the basis vectors:
Thus:
Problem 4
For \(A\in W\), let \(S: W\to V\) be defined by \(S(A) = A\). Let \(\beta\subseteq V\) be the standard basis. Find \([ST]_{\alpha}^{\beta}\) in two ways: directly and by using the product formula.
Solution. Here \(S(A) = A\) is the inclusion of \(W\) into \(V\), and \(\beta = \{E_1, E_2, E_3, E_4\}\), where
Directly. By Problem 3, \(ST(A) = S(-A) = -A\) for \(A\in W\). Thus
so
Using the product formula. First compute \([S]_{\alpha}^{\beta}\):
so
Then
which agrees with the direct computation.
Bonus Problem (10 points)
Let \(T: V\to W\) be a linear transformation and suppose \(\alpha, \alpha'\) are bases for \(V\) and \(\beta, \beta'\) are bases for \(W\). Find a change of basis formula relating the matrix of \(T\) with respect to \(\alpha, \beta\) to the matrix of \(T\) with respect to \(\alpha', \beta'\).
Solution. Let \(I_V: V\to V\) and \(I_W: W\to W\) be the identity maps. Then \(T = I_W\circ T\circ I_V\). Viewing \(I_V\) as a map from \(V\) with basis \(\alpha'\) to \(V\) with basis \(\alpha\), \(T\) as a map from \(V\) with basis \(\alpha\) to \(W\) with basis \(\beta\), and \(I_W\) as a map from \(W\) with basis \(\beta\) to \(W\) with basis \(\beta'\), the product formula from Problem 8 (applied twice) gives