Usng the spectral decompostion of diagonalizable matrix

  • Thread starter Thread starter syj
  • Start date Start date
  • Tags Tags
    Matrix
syj
Messages
53
Reaction score
0

Homework Statement


Find the spectral decompostion of
$$
A=

\begin{matrix}
1 & 0 & 0\\
-1 & 1 & 1 \\
-1 & 0 & 2
\end{matrix}
$$
and use this to find $$ 2^{A} $$

Homework Equations





The Attempt at a Solution


I have found the eigenvalues to be : $$ \lambda_{1}=1 \text{ and } \lambda_{2}=2 $$

My textbook (matrices and linear transformations, Cullen) uses lagrange polynomials to find the spectral projectors:
$$
h_{1}(x)=\frac{x-2}{1-2}=-(x-2)\\
h_{2}(x)=\frac{x-1}{2-1}=(x-2)\\

E_{1}=h_{1}(A)\\

E_{2}=h_{2}(A)\\

\therefore A=E_{1}+2E_{2}

$$
However I now need to use this to solve for $$ 2^{A} $$
I think I need to write $$ 2^{x} $$ as an infinite series, but I am not sure how to do this.
 
Physics news on Phys.org
You know how to write e^A as an infinite series, right? 2^A=e^{A \log 2}
 
The textbook I am using says:
<br /> f(A)=\sum_{i=0}^{t}f(\lambda_{i})E_{i}<br />

I still don't understand how to put everything together to get the answer. :(
 
After much puzzling, I believe I have the answer:

<br /> 2^{A}=2E_{1}+2^{2}E_{2}<br />

where I have found
<br /> E_{1}=\begin{bmatrix} 1&amp;0&amp;0\\1&amp;1&amp; \-1\\1&amp;0&amp;0\end{bmatrix}<br />

<br /> E_{2}=\begin{bmatrix}0&amp;0&amp;0\\-1&amp;0&amp;1\\-1&amp;0&amp;1\end{bmatrix}<br />

so I have
<br /> 2^{A}=\begin{bmatrix} 2&amp;0&amp;0\\\-2&amp;2&amp;2\\\-2&amp;0&amp;4\end{bmatrix}<br />
 
Last edited:
syj said:
After much puzzling, I believe I have the answer:

<br /> 2^{A}=2E_{1}+2^{2}E_{2}<br />

where I have found
<br /> E_{1}=\begin{bmatrix} 1&amp;0&amp;0\\1&amp;1&amp; \-1\\1&amp;0&amp;0\end{bmatrix}<br />

<br /> E_{2}=\begin{bmatrix}0&amp;0&amp;0\\-1&amp;0&amp;1\\-1&amp;0&amp;1\end{bmatrix}<br />

so I have
<br /> 2^{A}=\begin{bmatrix} 2&amp;0&amp;0\\\-2&amp;2&amp;2\\\-2&amp;0&amp;4\end{bmatrix}<br />

Why did it require much puzzling? You gave the answer in a previous post:
f(A) = f(\lambda_1) E_1 + f(\lambda_2) E2,
and f(x) = 2x.

RGV
 
ha ha , it required puzzling, because I knew that
<br /> p(x)=\sum_{i=1}^{n}p(\lambda_{i})h_{i}(x)<br />
would have to be such that
<br /> p(A)=2^{A}<br />
but because of a silly mistake of writing a 0 instead of a 1, I was not getting that conclusion and so thought all my work was incorrect.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top