Chapter 5: Problem 4
Prove the matrix version of the corollary to Theorem 5.5: If \(A \in\) \(\mathrm{M}_{n \times n}(F)\) has \(n\) distinct eigenvalues, then \(A\) is diagonalizable.
/*! 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 5: Problem 4
Prove the matrix version of the corollary to Theorem 5.5: If \(A \in\) \(\mathrm{M}_{n \times n}(F)\) has \(n\) distinct eigenvalues, then \(A\) is diagonalizable.
All the tools & learning materials you need for study success - in one app.
Get started for free
Each of the matrices that follow is a regular transition matrix for a three- state Markov chain. In all cases, the initial probability vector is $$ P=\left(\begin{array}{l} 0.3 \\ 0.3 \\ 0.4 \end{array}\right) $$ For each transition matrix, compute the proportions of objects in each state after two stages and the eventual proportions of objects in each state by determining the fixed probability vector. (a) $\left(\begin{array}{rrr}0.6 & 0.1 & 0.1 \\ 0.1 & 0.9 & 0.2 \\ 0.3 & 0 & 0.7\end{array}\right)$ (b) $\left(\begin{array}{lll}0.8 & 0.1 & 0.2 \\ 0.1 & 0.8 & 0.2 \\ 0.1 & 0.1 & 0.6\end{array}\right)$ (c) $\left(\begin{array}{rrr}0.9 & 0.1 & 0.1 \\ 0.1 & 0.6 & 0.1 \\ 0 & 0.3 & 0.8\end{array}\right)$ (d) $\left(\begin{array}{lll}0.4 & 0.2 & 0.2 \\ 0.1 & 0.7 & 0.2 \\ 0.5 & 0.1 & 0.6\end{array}\right)$ (e) $\left(\begin{array}{lll}0.5 & 0.3 & 0.2 \\ 0.2 & 0.5 & 0.3 \\ 0.3 & 0.2 & 0.5\end{array}\right)$ (f) $\left(\begin{array}{rrr}0.6 & 0 & 0.4 \\ 0.2 & 0.8 & 0.2 \\ 0.2 & 0.2 & 0.4\end{array}\right)$
Let \(G: \mathbf{R}^{3} \rightarrow \mathbf{R}^{3}\) be the linear mapping defined by \\[ G(x, y, z)=(x+2 y-z, \quad y+z, \quad x+y-2 z) \\] Find a basis and the dimension of (a) the image of \(G,(\mathrm{b})\) the kernel of \(G\)
Suppose \(F: V \rightarrow U\) is linear. Show that \(F(-v)=-F(v).\)
Use Exercise 22 to prove that if \(f(t)\) is the characteristic polynomial of a diagonalizable linear operator \(\mathrm{T}\), then \(f(\mathrm{~T})=\mathrm{T}_{0}\), the zero operator. (In Section \(5.4\) we prove that this result does not depend on the
Let \(T\) be a linear operator on a finite-dimensional vector space \(V\). (a) Prove that if the characteristic polynomial of \(T\) splits, then so does the characteristic polynomial of the restriction of \(\mathrm{T}\) to any T-invariant subspace of V. (b) Deduce that if the characteristic polynomial of \(\mathrm{T}\) splits, then any nontrivial \(\mathrm{T}\)-invariant subspace of \(\mathrm{V}\) contains an eigenvector of \(\mathrm{T}\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.