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

Click For Summary

Homework Help Overview

The discussion revolves around determining the linear independence of the set of vectors {[1,2,-1,6], [3,8,9,10],[2,-1,2,-2]}. Participants explore concepts related to linear independence, rank of a matrix, and properties of vector spaces.

Discussion Character

  • Conceptual clarification, Assumption checking, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss the construction of a matrix from the vectors and the implications of its row echelon form. Questions arise regarding how to determine the rank of the matrix and its significance in assessing linear independence.

Discussion Status

Some participants have provided insights into the relationship between the number of vectors and the dimension of the vector space, noting that having fewer vectors than the dimension does not immediately determine linear independence. There is ongoing exploration of how to find the rank of the matrix and its implications for the set's independence.

Contextual Notes

Participants express confusion regarding the concept of rank and how it is determined, with references to a textbook that lacks detailed explanations. The discussion includes the need to clarify definitions and properties related to linear independence and rank.

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.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K