Skip to content

5.2-final-1999-strang

Final Exam, 1999 (strang) · Section 5.2: Computing and Using Determinants Source: finalexam_1.pdf, pp. 37, 42

Problem

8. (a) (3 points) The "big formula" for a 6 by 6 determinant has \(6! = 720\) terms. How many of those terms are sure to be zero if we know that \(a_{15} = 0\)?

(b) (2 points) If \(U\) and \(V\) are 3 by 3 orthogonal matrices, is their product \(UV\) always orthogonal? Why (give reason) or why not (give example)?

(c) (2 points) If \(A\) and \(B\) are 3 by 3 symmetric matrices, is their product \(AB\) always symmetric? Why (give reason) or why not (give example)?

(d) (3 points) For which numbers \(c\) is the matrix \(A\) positive definite? For which numbers \(c\) is \(A^2\) positive definite? Why?

\[ A = \begin{bmatrix} 1 & 2 & 3 \\ 2 & c & 4 \\ 3 & 4 & 9 \end{bmatrix} \]
Solution (a) \(5! = 120\) terms are sure to be zero. (b) Yes, \((UV)^T(UV) = V^T U^T U V = V^T V = I\). (c) No, symmetry would need \(AB = (AB)^T = B^T A^T = BA\) and we don't normally have \(AB = BA\). (d) The 1 by 1, 2 by 2, 3 by 3 determinants are \(1\), \(c - 4\), and \(-4\) (not depending on \(c!\)). The last is negative so \(A\) is not positive definite. But \(\det A = -4\) so \(A\) has no zero eigenvalues so \(A^2\) has all three positive eigenvalues.

Keywords: determinant, big formula, orthogonal matrices, positive definite