Proving that Columns are Linearly Dependent

  • Thread starter Thread starter B18
  • Start date Start date
  • Tags Tags
    Columns Linearly
B18
Messages
118
Reaction score
0

Homework Statement


Let A be an m x n matrix with m<n. Prove that the columns of A are linearly dependent.

Homework Equations


Its obvious that for the columns to be linearly dependent they must form a determinate that is equal to 0, or if one of the column vectors can be represented by a linear combination of the other vectors.

The Attempt at a Solution


It seems like there has to be more shown to prove this statement, however this is what I have right now:
Let A be an m x n matrix, and let m < n.
Then the set of n column vectors of A are in Rm and must be linearly dependent.

Is this it? or do I need to state a theorem in here somewhere?
 
Physics news on Phys.org
B18 said:

Homework Statement


Let A be an m x n matrix with m<n. Prove that the columns of A are linearly dependent.

Homework Equations


Its obvious that for the columns to be linearly dependent they must form a determinate that is equal to 0, or if one of the column vectors can be represented by a linear combination of the other vectors.

The Attempt at a Solution


It seems like there has to be more shown to prove this statement, however this is what I have right now:
Let A be an m x n matrix, and let m < n.
Then the set of n column vectors of A are in Rm and must be linearly dependent.

Is this it? or do I need to state a theorem in here somewhere?

Hint: what is the maximum dimensionality of the space spanned by the columns (regarded as column vectors)?
 
The maximum dimension of the space spanned would have to be m+1, correct? For example if the vectors were from R3 we would need 4 column vectors so that they were linearly dependent.
 
Last edited:
Show that the reduced row echelon form of the mxn matrix will have at most m pivots. Then there are n-m columns without pivots, which can all be expressed as linear combinations of the columns with pivots. Since they are linear combinations of other columns, they are linearly dependent.
 
It would have been helpful if our professor explained what pivots were. Thanks though Izzy I'll make sense of what you explained and go from there.
 
B18 said:
The maximum dimension of the space spanned would have to be m+1, correct? For example if the vectors were from R3 we would need 4 column vectors so that they were linearly dependent.

Are you telling me that you think 4 or more 3-component vectors can possibly span a space of dimension 4?
 
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