Are Linearly Dependent Vectors Always Dependent in Combinations?

[Chen]

I have a couple of questions on this subject that I need help with.

1. Let v1, v2 and v3 be three linearly dependent vectors. Prove or disprove that the following vectors are also linearly dependent:
v1+v2, v1+v3, v2+v3

2. Let S = {v1, v2, v3, v4, v5} be a set of five vectors in a vector space V over a field F. Prove or disprove that if every subset T of S so that T!=S is linearly independent, S is also linearly idependent.

 

[Hurkyl]

1. Start with the definitions.

2. There probably isn't anything special about 5. Try a simpler problem first.

 

[Chen]

1. Start with the definitions.

2. There probably isn't anything special about 5. Try a simpler problem first.

I really don't know what to do with 1. If I did I wouldn't come here and ask about it.

This is a good counter example for the 2nd question, right?
(1, 0, 0, 0)
(0, 1, 0, 0)
(0, 0, 1, 0)
(0, 0, 0, 1)
(1, 1, 1, 1)

Also there's another problem I need help with.
A = \left(\begin{array}{ccc}1&1&1\\1&1&1\\a&b&c\end{array}\right)
Under which conditions for a, b and c are A and A^t row equivalent?
I tried bringing both matrices to their canonical form (echelon form), but I get lost with all the different cases.
A^t = \left(\begin{array}{ccc}1&1&a\\1&1&a\\1&1&c\end{array}\right)

 

[Hurkyl]

1. And I'm telling you what to do... start with the definitions.

2. Your counterexample looks good.

3. What do you mean by row equivalent? That you can convert between A and A' by row operations?

 

[Chen]

3. What do you mean by row equivalent? That you can convert between A and A' by row operations?

Yup. Our hunch is that a=b=1, and c is free to be whatever it wishes to be, except for a dog or a racoon maybe.

 

[Chen]

1. And I'm telling you what to do... start with the definitions.

Honestly, that's the first thing I did. Here's what I did and where I got stuck.

We know that:
\alpha V_1 + \beta V_2 + \gamma V_3 = 0
And not all of the scalars are zero.

We need to show that:
x(V_1 + V_2) + y(V_2 + V_3) + z(V_1 + V_3) = 0
(x + z)V_1 + (x + y)V_2 + (y + z)V_3 = 0
When not all scalars are zero.

So what I did was create this system of equations:
\alpha = x + z
\beta = x + y
\gamma = y + z
And then I got stuck.

I also tried saying that V3 = aV_1 + bV_2 and didn't get much further.

 

[Hurkyl]

Ok, so you already figured out the part I was hinting. You're just blocking on the easy part -- all you have to do is show whether or not that system of equations has a solution, right?

 

[Hurkyl]

3. It might help to look for bases for the row spaces of A and A'.

 

[Chen]

Ok, so you already figured out the part I was hinting. You're just blocking on the easy part -- all you have to do is show whether or not that system of equations has a solution, right?

Ok, I solved and got:
x = \frac{\alpha - \beta + \gamma}{2}
y = \frac{-\alpha + \beta + \gamma}{2}
z = \frac{\alpha + \beta - \gamma}{2}
And now how do I use the fact that at least one of the scalars is different than zero?

Oh wait... I'm done, aren't I?

3. It might help to look for bases for the row spaces of A and A'.

Yeah, but we didn't study bases yet, so I can't use it to prove anything in the homework... not that I would know how to find them anyway. What I did try to do is show that the span of the rows of each matrix are equivalent, but that road got too complicated as well.

 

[Hurkyl]

1. Sure looks like it!

3. Okay... maybe try starting simple. You know a few vectors in the row space of A... how can you make them out of the rows of A'?

 

[Chen]

3. Okay... maybe try starting simple. You know a few vectors in the row space of A... how can you make them out of the rows of A'?

Hmm... Let me think about that a little while (i.e tomorrow when I'm more awake!).

In the mean time, I solved another question but I'm not sure the solution is correct. Would you be so kind to verify it?

Let A and B be non-zero matrices so that AB = 0. Show that if C is row equivalent to A, then there exists a non-zero matrix D so that CD = 0.

What I did was say that since C is row equivalent to A we can write it as:
C = E_n...E_2E_1A
(where E is an elementary matrix)
So if we multiply both sides of the equations by B we get:
CB = E_n...E_2E_1AB = E_n...E_2E_1(0) = 0
So I found a D... and it even equals B! Is this correct?

 

[Hurkyl]

4. seems reasonable.

 

[Chen]

1. Sure looks like it!

3. Okay... maybe try starting simple. You know a few vectors in the row space of A... how can you make them out of the rows of A'?

Right, I see what you mean. I need to be able to express every row in A as a linear combination of the rows of A', yes?

So for example:
[a b c] = x[1 1 a] + y[1 1 b] + z[1 1 c]
Which means that a=b, right? But what about c?

 

[Chen]

Ok so I know that a=b. Now I did it with rows from A' and the row space of A:

[1 1 c] = x[1 1 1] + y[a b c] = x[1 1 1] + y[a a c]

And I got a system of equations:
1 = x + ya
1 = x + ya
c = x + yc

The ranked system matrix is:
A = \left(\begin{array}{cc|c}1&a&1\\0&c-a&c-1\end{array}\right)
Can you please help with that? I need to find when the system to has at least one solution. I think that it's:
c!=1: c!=a
c=1: any a
Am I correct?

 

[Hurkyl]

Sounds reasonable.

 

[Chen]

Sounds reasonable.

Of course it does, I wouldn't do anything unreasonbale now would I? I just want to make sure it's also correct.