Linear Independence of a 3x3 matrix

bwilliams1188
Messages
1
Reaction score
0

Homework Statement


A is a 3x3 matrix with distinct eigenvalues lambda(1), lambda(2), lambda(3) and corresponding eigenvectors u1,u2, u3.

Suppose you already know that {u1, u2} is linearly independent.

Prove that {u1, u2, u3} is linearly independent.


Homework Equations


??


The Attempt at a Solution


I am supposed to prove that {u1, u2, u3} is linearly independent, but since there are distinct eigenvalues/vectors, is that not enough to say that {u1, u2, u3} is linearly independent?
 
Physics news on Phys.org
bwilliams1188 said:

Homework Statement


A is a 3x3 matrix with distinct eigenvalues lambda(1), lambda(2), lambda(3) and corresponding eigenvectors u1,u2, u3.

Suppose you already know that {u1, u2} is linearly independent.

Prove that {u1, u2, u3} is linearly independent.


Homework Equations


??


The Attempt at a Solution


I am supposed to prove that {u1, u2, u3} is linearly independent, but since there are distinct eigenvalues/vectors, is that not enough to say that {u1, u2, u3} is linearly independent?
No, that's not enough. That's exactly what you need to prove.
 
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