vector space proof

[broegger]

how do you prove that if v is an element of V (a vector space), and if r is a scalar and if rv = 0, then either r = 0 or v = 0... it seems obvious, but i have no idea how to prove it...

[Chen]

If v is the vector (a, b, c), then the vector that results from the multiplication rv is (ra, rb, rc). If the result is equal to 0, the zero vector, then (ra, rb, rc) = (0, 0, 0). If we write this formally we get:
ra = 0
rb = 0
rc = 0
The solution is that either r equals 0, or a, b, and c all equal 0. And if a, b, and c are 0 then the vector v is (0, 0, 0) which is the zero vector.

Is this proof satisfactory? There are probably a lot of ways to prove this. :smile:

[matt grime]

That proof requires you to pick a basis. If I pick a different basis, do you know that it still holds?

Here's the basis free proof. Suppose rv=0, then if r is zero we are done, if not multiply rv=0 by 1/r and we see v=0.

[Chen]

That proof requires you to pick a basis. If I pick a different basis, do you know that it still holds?
Yes... if you pick your basis at (A, B, C) then the vector v becomes (a - A, b - B, c - C) and the zero vector is now (A, B, C).
r(a - A) = A
r(b - B) = B
r(c - C) = C
For this to be true for r <> 0, a must equal A, b must equal B and c must qual C, and thus the vector v becomes (A, B, C) which is again the zero vector.

[matt grime]

No, that isn't how one does a change of basis (of a vector space: the origin isn't fixed.)

[matt grime]

It's also dimension dependent. The result is true for every vector space, even those where picking a basis, never mind solving an uncountable set of linear equations requires the axiom of choice.