Understanding Span and Linear Independence in Vector Spaces

darkchild
Messages
153
Reaction score
0
My professor says that a linearly independent subset of a vector space automatically spans the vector space, and that a subset of a vector space that spans the vector space is automatically linearly independent.

I don't understand why either of these is true.
 
Physics news on Phys.org
they aren't. For example, a set containing a single non-zero vector is always independent but only spans in the case of a one-dimensional vector space. The set consisting of the entire vector space, on the other hand, spans the vector space but cannot be independent. You may have misunderstood your professor. A maximal linearly independent set (there is no linearly independent set containing more vectors) spans the space and a minimal spanning set (there is no smaller spanning set) is linearly independent. One can then show that all set that both span the space and are linearly independent contain the same number of vectors (the "dimension" of the space).
 
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