6.2-exam3-2014¶
Exam 3, 2014 · Section 6.2: Diagonalizing a Matrix Source: exam3_2.pdf, pp. 80, 86
Problem¶
Problem 2. True or false? If your answer is "true", explain why. If your answer is "false", give a counterexample.
(a) Every positive definite matrix is nonsingular.
(b) If \(A\) is an \(n \times n\) matrix with real eigenvalues and with \(n\) linearly independent eigenvectors which are orthogonal to each other, then \(A\) is symmetric.
(c) If a matrix \(B\) is similar to \(A\), then \(B\) has the same eigenvectors as \(A\).
(d) Any symmetric matrix is similar to a diagonal matrix.
(e) Any matrix which is similar to a diagonal matrix is symmetric.
Solution
(a) True: if \(A\) is singular, then there exists a nonzero \(x\) with \(Ax = 0\); thus \(x^TAx = 0\), and \(A\) is not positive definite. (b) True: if the given eigenvectors are \(v_1, \dots, v_n\), and their eigenvalues are \(\lambda_1, \dots, \lambda_n\), respectively, then \(A = Q\Lambda Q^T\), where \[ Q = (v_1/\|v_1\| \mid \dots \mid v_n/\|v_n\|) \quad \text{and} \quad \Lambda = diag(\lambda_1, \dots, \lambda_n); \] thus, \[ A^T = (Q\Lambda Q^T)^T = (Q^T)^T\Lambda^TQ^T = Q\Lambda Q^T = A. \] (c) False: we saw in problem 1 that \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\) has eigenvectors \((1, 1)^T\) and \((1, -1)^T\); we also saw that it is similar to \(\begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}\), which has eigenvectors \((1, 0)^T\) and \((0, 1)^T\). (d) True: this is the \(Q\Lambda Q^T = Q\Lambda Q^{-1}\) decomposition. (e) False: \(\begin{bmatrix} 0 & 1 \\ 0 & 1 \end{bmatrix}\) has distinct eigenvalues 0 and 1, and so it is similar to a diagonal matrix, but it is not symmetric.Keywords: positive definite, symmetric matrix, similar matrices, eigenvalues, diagonalizable