Chapter 6: Problem 60
Let \(A\) be a \(2 \times 2\) matrix such that only \(A\) is similar to itself. Show that \(A\) is a scalar matrix, that is, that \(A=\left[\begin{array}{ll}a & 0 \\\ 0 & a\end{array}\right]\).
/*! 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 60
Let \(A\) be a \(2 \times 2\) matrix such that only \(A\) is similar to itself. Show that \(A\) is a scalar matrix, that is, that \(A=\left[\begin{array}{ll}a & 0 \\\ 0 & a\end{array}\right]\).
All the tools & learning materials you need for study success - in one app.
Get started for free
Suppose \(B\) is similar to \(A,\) say \(B=P^{-1} A P .\) Prove (a) \(B^{n}=P^{-1} A^{n} P,\) and so \(B^{n}\) is similar to \(A^{n}\). (b) \(f(B)=P^{-1} f(A) P,\) for any polynomial \(f(x),\) and \(\operatorname{so~} f(B)\) is similar to \(f(A)\). (c) \(B\) is a root of a polynomial \(g(x)\) if and only if \(A\) is a root of \(g(x)\).
Prove Theorem 6.7: Let \(P\) be the change-of-basis matrix from a basis \(S\) to a basis \(S^{\prime}\) in a vector space \(V .\) Then, for any linear operator \(T\) on \(V,[T]_{S^{\prime}}=P^{-1}[T]_{S} P\).
Two linear operators \(F\) and \(G\) on \(V\) are said to be similar if there exists an invertible linear operator \(T\) on \(V\) such that \(G=T^{-1} \circ F \circ T .\) Prove (a) \(F\) and \(G\) are similar if and only if, for any basis \(S\) of \(V,[F]_{S}\) and \([G]_{S}\) are similar matrices. (b) If \(F\) is diagonalizable (similar to a diagonal matrix), then any similar matrix \(G\) is also diagonalizable.
Prove Theorem 6.1: Let \(T: V \rightarrow V\) be a linear operator, and let \(S\) be a (finite) basis of \(V\). Then, for any vector \(v\) in \(V,[T]_{S}[v]_{S}=[T(v)]_{S}\) Suppose \(S=\left\\{u_{1}, u_{2}, \ldots, u_{n}\right\\},\) and suppose, for \(i=1, \ldots, n\) \\[ T\left(u_{i}\right)=a_{i 1} u_{1}+a_{i 2} u_{2}+\cdots+a_{i n} u_{n}=\sum_{j=1}^{n} a_{i j} u_{j} \\] Then \([T]_{S}\) is the \(n\) -square matrix whose \(j\) th row is \\[ \left(a_{1 j}, a_{2 j}, \ldots, a_{n j}\right) \\] Now suppose \\[ v=k_{1} u_{1}+k_{2} u_{2}+\cdots+k_{n} u_{n}=\sum_{i=1}^{n} k_{i} u_{i} \\] Writing a column vector as the transpose of a row vector, we have \\[ [v]_{S}=\left[k_{1}, k_{2}, \ldots, k_{n}\right]^{T} \\] Furthermore, using the linearity of \(T\) \\[ \begin{aligned} T(v) &=T\left(\sum_{i=1}^{n} k_{i} u_{i}\right)=\sum_{i=1}^{n} k_{i} T\left(u_{i}\right)=\sum_{i=1}^{n} k_{i}\left(\sum_{j=1}^{n} a_{i j} u_{j}\right) \\ &=\sum_{j=1}^{n}\left(\sum_{i=1}^{n} a_{i j} k_{i}\right) u_{j}=\sum_{j=1}^{n}\left(a_{1 j} k_{1}+a_{2 j} k_{2}+\cdots+a_{n j} k_{n}\right) u_{j} \end{aligned} \\] Thus, \([T(v)]_{S}\) is the column vector whose \(j\) th entry is \\[ a_{1 j} k_{1}+a_{2 j} k_{2}+\dots+a_{n j} k_{n} \\] On the other hand, the \(j\) th entry of \([T]_{S}[v]_{S}\) is obtained by multiplying the \(j\) th row of \([T]_{S}\) by \([v]_{S}-\) that is (1) by \((2) .\) But the product of (1) and (2) is \((3) .\) Hence, \([T]_{S}[v]_{S}\) and \([T(v)]_{S}\) have the same entries. Thus, \([T]_{S}[v]_{S}=[T(v)]_{S}\).
Consider the following linear operator \(G\) on \(\mathbf{R}^{2}\) and basis \(S:\) \\[ G(x, y)=(2 x-7 y, 4 x+3 y) \quad \text { and } \quad S=\left\\{u_{1}, u_{2}\right\\}=\\{(1,3),(2,5)\\} \\] (a) Find the matrix representation \([G]_{S}\) of \(G\) relative to \(S\). (b) Verify \([G]_{S}[v]_{S}=[G(v)]_{S}\) for the vector \(v=(4,-3)\) in \(\mathbf{R}^{2}\) First find the coordinates of an arbitrary vector \(v=(a, b)\) in \(\mathbf{R}^{2}\) relative to the basis \(S .\) We have \\[ \left[\begin{array}{l} a \\ b \end{array}\right]=x\left[\begin{array}{l} 1 \\ 3 \end{array}\right]+y\left[\begin{array}{l} 2 \\ 5 \end{array}\right], \quad \text { and so } \quad \begin{array}{r} x+2 y=a \\ 3 x+5 y=b \end{array} \\] Solve for \(x\) and \(y\) in terms of \(a\) and \(b\) to get \(x=-5 a+2 b, y=3 a-b .\) Thus, \\[ (a, b)=(-5 a+2 b) u_{1}+(3 a-b) u_{2} \\] \\[ \text { and so } \quad[v]=[-5 a+2 b, \quad 3 a-b]^{T} \\] (a) Using the formula for \((a, b)\) and \(G(x, y)=(2 x-7 y, 4 x+3 y)\), we have \\[ \begin{array}{l} G\left(u_{1}\right)=G(1,3)=(-19,13)=121 u_{1}-70 u_{2} \\ G\left(u_{2}\right)=G(2,5)=(-31,23)=201 u_{1}-116 u_{2} \end{array} \quad \text { and so } \quad[G]_{S}=\left[\begin{array}{rr} 121 & 201 \\ -70 & -116 \end{array}\right] \\] (We emphasize that the coefficients of \(u_{1}\) and \(u_{2}\) are written as columns, not rows, in the matrix representation.) (b) Use the formula \((a, b)=(-5 a+2 b) u_{1}+(3 a-b) u_{2}\) to get Then \\[ \begin{array}{c} v=(4,-3)=-26 u_{1}+15 u_{2} \\ G(v)=G(4,-3)=(20,7)=-131 u_{1}+80 u_{2} \\ {[v]_{S}=[-26,15]^{T} \quad \text { and } \quad[G(v)]_{S}=[-131,80]^{T}} \end{array} \\] Accordingly, \\[ [G]_{S}[v]_{S}=\left[\begin{array}{rr} 121 & 201 \\ -70 & -116 \end{array}\right]\left[\begin{array}{r} -26 \\ 15 \end{array}\right]=\left[\begin{array}{r} -131 \\ 80 \end{array}\right]=[G(v)]_{S} \\] (This is expected from Theorem \(6.1 .)\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.