Find basis of eigenspace

Nemanjavuk69

Junior Member
Joined
Mar 23, 2022
Messages
67
Hello

I am reading up on linear algebra and its applications 6 global edition by David C. Lay.

I am at chapter 5.3 where it talks about eigenvalues and eigenspace, and I am trying to solve excercise number 5 (Please look at the attached image file)

1671987955824.png


I also know that the answer is [math]\lambda=5: \begin{bmatrix} 1 &\\ 1 &\\ 1 \end{bmatrix}[/math]
[math]\lambda = 1: \begin{bmatrix} 1 &\\ 0 &\\ -1 \end{bmatrix}, \begin{bmatrix} 2 \\ -1 \\ 0 \end{bmatrix}[/math]
My question is now, where does the basis(answer) come from? Can anyone show me a computation of how the basis are being calculated? I seem to always get another basis when solving it myself.
 
Hello

I am reading up on linear algebra and its applications 6 global edition by David C. Lay.

I am at chapter 5.3 where it talks about eigenvalues and eigenspace, and I am trying to solve excercise number 5 (Please look at the attached image file)

View attachment 34681


I also know that the answer is [math]\lambda=5: \begin{bmatrix} 1 &\\ 1 &\\ 1 \end{bmatrix}[/math]
[math]\lambda = 1: \begin{bmatrix} 1 &\\ 0 &\\ -1 \end{bmatrix}, \begin{bmatrix} 2 \\ -1 \\ 0 \end{bmatrix}[/math]
My question is now, where does the basis(answer) come from? Can anyone show me a computation of how the basis are being calculated? I seem to always get another basis when solving it myself.
To find the eigenspace [imath]\bold{v_1}[/imath] associated with [imath]\lambda_1 = 5[/imath] it must sastisfy the following:
[math]\bold{A\cdot v_1} = \lambda_1 \cdot \bold{v_1}[/math][math]\bold{(A-\lambda_1)}\cdot \bold{v_1}=0[/math][math]\left(\begin{bmatrix} 2 & 2 & 1 \\ 1 & 3 & 1\\ 1& 2 & 2 \end{bmatrix} - \begin{bmatrix} 5 & 0 & 0 \\ 0 & 5 & 0\\ 0 & 0 & 5 \end{bmatrix}\right) \cdot \begin{bmatrix} v_1 \\ v_2 \\ v_3 \\ \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \\ 0 \\ \end{bmatrix}[/math]
Using REF or RREF to solve for [imath]\bold{v_1} = \begin{bmatrix} 1 \\ 1 \\ 1 \end{bmatrix} [/imath]
 
I also know that the answer is [math]\lambda=5: \begin{bmatrix} 1 &\\ 1 &\\ 1 \end{bmatrix}[/math]
[math]\lambda = 1: \begin{bmatrix} 1 &\\ 0 &\\ -1 \end{bmatrix}, \begin{bmatrix} 2 \\ -1 \\ 0 \end{bmatrix}[/math]
My question is now, where does the basis(answer) come from? Can anyone show me a computation of how the basis are being calculated? I seem to always get another basis when solving it myself.
Please show your own work; it is perfectly respectable to get a different answer for the eigenspace of [imath]\lambda=1[/imath], and your answer may well be valid. Or there could be an error we could correct.

As for how they got their answer for that eigenvalue, it isn't what I got (though mine is quite close), so I'd want to see how they have taught you to find the basis of an eigenspace. Do you have any examples from the book?
 
Please show your own work; it is perfectly respectable to get a different answer for the eigenspace of [imath]\lambda=1[/imath], and your answer may well be valid. Or there could be an error we could correct.

As for how they got their answer for that eigenvalue, it isn't what I got (though mine is quite close), so I'd want to see how they have taught you to find the basis of an eigenspace. Do you have any examples from the book?
I have attached a PDF snippet of the chapter where they talk about Diagonalization and the basis of eigenspace. As for my work, I will try again and calculate everything from the bottom and be extra careful when reading the Theorem. I will paste it here soon.
 

Attachments

  • linear-algebra-and-its-applications-6-global-edition-1292351217-9781292351216.pdf
    140 KB · Views: 5
I have attached a PDF snippet of the chapter where they talk about Diagonalization and the basis of eigenspace. As for my work, I will try again and calculate everything from the bottom and be extra careful when reading the Theorem. I will paste it here soon.
I see that in Example 6, which is the relevant one, they just say "Using the method in Section 5.1, we find a basis for each eigenspace." So you'll want to look there (and show that to us if you need more help).
 
Here is the chapter 5.1 if that helps
I see that in Example 6, which is the relevant one, they just say "Using the method in Section 5.1, we find a basis for each eigenspace." So you'll want to look there (and show that to us if you need more help).
 

Attachments

  • chapter 5.1.pdf
    177.7 KB · Views: 3
Please show your own work; it is perfectly respectable to get a different answer for the eigenspace of [imath]\lambda=1[/imath], and your answer may well be valid. Or there could be an error we could correct.

As for how they got their answer for that eigenvalue, it isn't what I got (though mine is quite close), so I'd want to see how they have taught you to find the basis of an eigenspace. Do you have any examples from the book?
Dear @Dr.Peterson I have finally managed to solve this type of exercises correctly. After hours of looking at theorem and getting different answers for eigenspace, I can see, by using a calculator, that indeed I get the correct answer. Now lies a curious question, how come we can get the same answer with different answer for the eigenspace?
 
Here is the chapter 5.1 if that helps
They are pointing you to example 4. Note, however, that at the end they make an arbitrary change in one of the eigenvectors in order to avoid fractions. In the problem you have been working on, it appears that they did the same thing (as their method is identical to mine), this time perhaps to avoid too many negatives.
I can see, by using a calculator, that indeed I get the correct answer. Now lies a curious question, how come we can get the same answer with different answer for the eigenspace?

A key idea is that their are many possible bases for any space; and in particular, multiplying each basis vector by a scalar will not change the space. So it is to be expected that people will come up with different specific answers. This is why I said, "it is perfectly respectable to get a different answer for the [basis of the] eigenspace of [imath]\lambda=1[/imath], and your answer may well be valid."
 
They are pointing you to example 4. Note, however, that at the end they make an arbitrary change in one of the eigenvectors in order to avoid fractions. In the problem you have been working on, it appears that they did the same thing (as their method is identical to mine), this time perhaps to avoid too many negatives.


A key idea is that their are many possible bases for any space; and in particular, multiplying each basis vector by a scalar will not change the space. So it is to be expected that people will come up with different specific answers. This is why I said, "it is perfectly respectable to get a different answer for the [basis of the] eigenspace of [imath]\lambda=1[/imath], and your answer may well be valid."
If it is not too much to ask, can I be allowed to ask this question. If you try to diagonalize a [imath]2\times2[/imath] matrix A and it appears that you only have one eigenvalue, let's say [imath](\lambda-4)\cdot(\lambda-4)[/imath] would that tell you that the matrix A IS NOT diagonizable? I only ask to broaden my knowledge a little bit. Hope my question is clear enough.
 
If it is not too much to ask, can I be allowed to ask this question. If you try to diagonalize a [imath]2\times2[/imath] matrix A and it appears that you only have one eigenvalue, let's say [imath](\lambda-4)\cdot(\lambda-4)[/imath] would that tell you that the matrix A IS NOT diagonizable? I only ask to broaden my knowledge a little bit. Hope my question is clear enough.
Not necessarily. You can have a diagonal matrix whose eigenvalues are both 4, right?
 
Top