x Turn on thread page Beta
 You are Here: Home >< Maths

# Linear Algebra - help wanted with finding geometric multiplicity and eigenspace of... watch

1. Hi there

Please could somebody confirm if this is right:

I need to find the geometric multiplicity and corresponding eigenspace for each eigenvalue in the following matrix:

Det(A-I) = 0

Det

Det =

Det =
So repeated

So, lets find the geometric multiplicity for
So lets substitute into

So

Does this mean the geometric multiplicity = 0?
2. Your third line does not follow from your first. Could you clarify that the original matrix is correctly written?
3. (Original post by Smaug123)
Your third line does not follow from your first. Could you clarify that the original matrix is correctly written?
Sorry, typo, I've corrected it now
4. (Original post by jackie11)
Sorry, typo, I've corrected it now
Geometric multiplicity of an eigenvalue is by definition never 0. Indeed, if the multiplicity were 0, it wouldn't be an eigenvalue, because that would mean the eigenspace had dimension 0, so contained only the point 0: that is, there would be no eigenvector for that eigenvalue.

Can you give me without any thought an eigenvector for that matrix, and hence show that the geometric multiplicity is >= 1? (Hint if necessary: it's already a lower-diagonal matrix.) ETA: by "lower-diagonal" I mean "lower-triangular".

The task is then either to find another eigenvector which is not a multiple of that one, or to show that no such eigenvector exists. There is a system of simultaneous equations to solve to find the eigenvectors. Can you tell me what that system is?
5. (Original post by Smaug123)
Geometric multiplicity of an eigenvalue is by definition never 0. Indeed, if the multiplicity were 0, it wouldn't be an eigenvalue, because that would mean the eigenspace had dimension 0, so contained only the point 0: that is, there would be no eigenvector for that eigenvalue.

Can you give me without any thought an eigenvector for that matrix, and hence show that the geometric multiplicity is >= 1? (Hint if necessary: it's already a lower-diagonal matrix.) ETA: by "lower-diagonal" I mean "lower-triangular".

The task is then either to find another eigenvector which is not a multiple of that one, or to show that no such eigenvector exists. There is a system of simultaneous equations to solve to find the eigenvectors. Can you tell me what that system is?

Ok, I now understand that all eigenvalues must have at least one eigenvector, but i still can't see what the eigenvector would be for the eigenvalue of 2.

So which is not very helpful

Therefore

So how do I get anything but 0?
6. (Original post by jackie11)

Ok, I now understand that all eigenvalues must have at least one eigenvector, but i still can't see what the eigenvector would be for the eigenvalue of 2.

So which is not very helpful

Therefore

So how do I get anything but 0?
You have determined that for any eigenvector of eigenvalue 2 (and hence for any eigenvector of any eigenvalue, since the only eigenvalue is 2), the first entry of that eigenvector must be 0. That is, all eigenvectors must lie on the span of the vector {0, 1}. Does that help?
7. (Original post by Smaug123)
You have determined that for any eigenvector of eigenvalue 2 (and hence for any eigenvector of any eigenvalue, since the only eigenvalue is 2), the first entry of that eigenvector must be 0. That is, all eigenvectors must lie on the span of the vector {0, 1}. Does that help?
Oh ok, yes I get it now thank you!!!

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: February 1, 2015
Today on TSR

Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams