Chapter 6: Problem 8
Let \(A\) be a nonnegative irreducible \(3 \times 3\) matrix whose eigenvalues satisfy \(\lambda_{1}=2=\left|\lambda_{2}\right|=\left|\lambda_{3}\right|\) Determine \(\lambda_{2}\) and \(\lambda_{3}\)
/*! 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 8
Let \(A\) be a nonnegative irreducible \(3 \times 3\) matrix whose eigenvalues satisfy \(\lambda_{1}=2=\left|\lambda_{2}\right|=\left|\lambda_{3}\right|\) Determine \(\lambda_{2}\) and \(\lambda_{3}\)
All the tools & learning materials you need for study success - in one app.
Get started for free
We can show that, for an \(n \times n\) stochastic matrix, \(\lambda_{1}=1\) is an eigenvalue and the remaining eigenvalues must satisfy \\[ \left|\lambda_{j}\right| \leq 1 \quad j=2, \ldots, n \\] (See Exercise \(24 \text { of Chapter } 7, \text { Section } 4 .)\) Show that if \(A\) is an \(n \times n\) stochastic matrix with the property that \(A^{k}\) is a positive matrix for some positive integer \(k,\) then \\[ \left|\lambda_{j}\right|<1 \quad j=2, \ldots, n \\]
Let \(A\) be a nondefective \(n \times n\) matrix with diagonalizing matrix \(X .\) Show that the matrix \(Y=\left(X^{-1}\right)^{T}\) diagonalizes \(A^{T}\)
Show that \(e^{A}\) is nonsingular for any diagonalizable matrix \(A\)
Let \(A\) be a \(n \times n\) matrix with real entries and let \(\lambda_{1}=a+b i\) (where \(a\) and \(b\) are real and \(b \neq 0\) ) be an eigenvalue of \(A .\) Let \(\mathbf{z}_{1}=\mathbf{x}+i \mathbf{y}\) (where \(\mathbf{x}\) and \(\mathbf{y}\) both have real entries) be an eigenvector belonging to \(\lambda_{1}\) and let \(\mathbf{z}_{2}=\mathbf{x}-i \mathbf{y}\) (a) Explain why \(\mathbf{z}_{1}\) and \(\mathbf{z}_{2}\) must be linearly independent. (b) Show that \(\mathbf{y} \neq \mathbf{0}\) and that \(\mathbf{x}\) and \(\mathbf{y}\) are linearly independent.
Show that if \(A\) is symmetric positive definite, then \(\operatorname{det}(A)>0 .\) Give an example of a \(2 \times 2\) matrix with positive determinant that is not positive definite.
What do you think about this solution?
We value your feedback to improve our textbook solutions.