Determine Linear Independence of {[1,2,-1,6], [3,8,9,10],[2,-1,2,-2]}

roam
Messages
1,265
Reaction score
12
Determine whether the set {[1,2,-1,6], [3,8,9,10],[2,-1,2,-2]} is linearly independent.

3. The Attempt at a Solution

I construct

A = \left[\begin{array}{ccccc} 1 & 2 & -1 & 6 \\ 3 & 8 & 9 & 10 \\ 2 & -1 & 2 & -2 \end{array}\right]

The row echelon form is

A = \left[\begin{array}{ccccc} 1 & 2 & -1 & 6 \\ 0 & 1 & 6 & -4 \\ 0 & 0 & 1 & -1 \end{array}\right]

Now there is a theorem saying that if the "rank" of V is smaller than the number of vectors in the set under consideration (i.e., number of rows of V) then the vectors are linearly dependent; otherwise they're independent.

I can't understand this step, how do we determine the "rank" of V?


Furthermore, I have another question;
There is a property that states: "if the set contains more vectors than the dimension of its member vectors, the vectors are linearly dependent." They are thus NOT linearly independent.
So, what if the set contains fewer vectors than the dimension of its member vectors?? Here in my problem I have 3 vectors which are of the 4th dimensions, what does that tell us?

Thanks!

 
Physics news on Phys.org
So, what if the set contains fewer vectors than the dimension of its member vectors?? Here in my problem I have 3 vectors which are of the 4th dimensions, what does that tell us?

It tells you you need to solve the problem another way (if the number of vectors you have is less than the dimension of the vector space they're in, you can't immediately decide if they're linearly independent or not).

Now there is a theorem saying that if the "rank" of V is smaller than the number of vectors in the set under consideration (i.e., number of rows of V) then the vectors are linearly dependent; otherwise they're independent.

You're in a bind here, since the rank is the dimension of the span of the row (or column, they will always be equal) vectors of the matrix. Fortunately row operations (or column operations if you're using the column definition) preserve rank, so what you have is useful. The problem boils down to finding if the vectors

(1,2,-1,6), (0,1,6,-4), (0,0,1,-1) are linearly independent. Use the basic definition of linear independence: If a*(1,2,-1,6) + b(0,1,6,-4) + c(0,0,1,-1) = (0,0,0,0)

Look at the first coordinate, then the second coordinate, then the third coordinate
 
Office_Shredder said:
It tells you you need to solve the problem another way (if the number of vectors you have is less than the dimension of the vector space they're in, you can't immediately decide if they're linearly independent or not).

I understand, thanks.


(1,2,-1,6), (0,1,6,-4), (0,0,1,-1) are linearly independent. Use the basic definition of linear independence: If a*(1,2,-1,6) + b(0,1,6,-4) + c(0,0,1,-1) = (0,0,0,0)

Look at the first coordinate, then the second coordinate, then the third coordinate

I just started reading this topic yesterday from the book and I’m a little confused atm.
I don’t see any good explanation in my book, it only says: “by inspection the rank of A is…” it doesn’t elaborate on how to "inspect". I appreciate that if you could please demonstrate how to find the rank of A.

Well, if the vectors are linearly dependent then the condition a(1,2,-1,6) + b(0,1,6,-4) + c(0,0,1,-1) = (0,0,0,0) must hold (they're not zero) & the equation can be rewritten as

(1,2,-1,6) = -(b/a) (0,1,6,-4) – (c/a) (0,0,1,-1)

(0,1,6,-4) = -(a/b)(1,2,-1,6) - (c/b) (0,0,1,-1)

(0,0,1,-1) = -(a/c) (1,2,-1,6) - (b/c) (0,1,6,-4)

The first form being possible if a \neq 0 and the second if b \neq 0 and so on.
 
a(1,2,-1,6) + b(0,1,6,-4) + c(0,0,1,-1) = (0,0,0,0)

Ok, so the first coordinate gives us the equation:
a = 0

That's pretty easy. So we look at the second coordinate
2a + b = 0

But a=0 (from the first coordinate). So we get b=0

Then we see c=0 also. So if a(1,2,-1,6) + b(0,1,6,-4) + c(0,0,1,-1) = (0,0,0,0), then a=b=c=0
 
Thank you, I get it now & I see that it's linearly independent. But I want to know how to find the rank of A. The book says: "by inspection, the rank of A is 3". The book doesn't explain how they got it. I know that if the rank is 3 (which is equal to the number of the vectors in the given set) makes the set linearly independent.
 
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...

Similar threads

Replies
2
Views
2K
Replies
11
Views
2K
Replies
7
Views
2K
Replies
3
Views
1K
Replies
6
Views
2K
Replies
3
Views
2K
Back
Top