Chapter 6: Problem 21
Let \(Q\) be an orthogonal matrix. (a) Show that if \(\lambda\) is an eigenvalue of \(Q,\) then \(|\lambda|=1\) (b) Show that \(|\operatorname{det}(Q)|=1\)
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 6: Problem 21
Let \(Q\) be an orthogonal matrix. (a) Show that if \(\lambda\) is an eigenvalue of \(Q,\) then \(|\lambda|=1\) (b) Show that \(|\operatorname{det}(Q)|=1\)
All the tools & learning materials you need for study success - in one app.
Get started for free
Prove that if \(A\) is a symmetric matrix with eigenvalues \(\lambda_{1}, \lambda_{2}, \ldots, \lambda_{n},\) then the singular values of \(A\) are \(\left|\lambda_{1}\right|,\left|\lambda_{2}\right|, \ldots,\left|\lambda_{n}\right|\)
Show that if \(B\) is a symmetric nonsingular matrix, then \(B^{2}\) is positive definite.
Let \(\lambda\) be an eigenvalue of an \(n \times n\) matrix \(A\) and let \(\mathbf{x}\) be an eigenvector belonging to \(\lambda .\) Show that \(e^{\lambda}\) is an eigenvalue of \(e^{A}\) and \(\mathbf{x}\) is an eigenvector of \(e^{A}\) belonging to \(e^{\lambda}\)
Let \\[ A=\left(\begin{array}{rr} 1 & -\frac{1}{2} \\ -\frac{1}{2} & 1 \end{array}\right) \quad \text { and } \quad B=\left(\begin{array}{rr} 1 & -1 \\ 0 & 1 \end{array}\right) \\] (a) Show that \(A\) is positive definite and that \(\mathbf{x}^{T} A \mathbf{x}=\mathbf{x}^{T} B \mathbf{x}\) for all \(\mathbf{x} \in \mathbb{R}^{2}\) (b) Show that \(B\) is positive definite, but \(B^{2}\) is not positive definite.
Find an orthogonal or unitary diagonalizing matrix for each of the following: (a) \(\left(\begin{array}{ll}2 & 1 \\ 1 & 2\end{array}\right)\) (b) \(\left(\begin{array}{cc}1 & 3+i \\ 3-i & 4\end{array}\right)\) (c) \(\left(\begin{array}{rrr}2 & i & 0 \\ -i & 2 & 0 \\ 0 & 0 & 2\end{array}\right)\) (d) \(\left(\begin{array}{rrr}2 & 1 & 1 \\ 1 & 3 & -2 \\ 1 & -2 & 3\end{array}\right)\) (e) \(\left(\begin{array}{lll}0 & 0 & 1 \\ 0 & 1 & 0 \\ 1 & 0 & 0\end{array}\right)\) (f) \(\left[\begin{array}{lll}1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1\end{array}\right]\) (g) \(\left(\begin{array}{rrr}4 & 2 & -2 \\ 2 & 1 & -1 \\ -2 & -1 & 1\end{array}\right)\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.