Thread: Vector Span and Dimension

If vector V has dimension n, then any subset of m<n vectors cannot span V. Prove this.

Okay I understand that in order for subset m to span V then all the vectors in V would have to be a linear combination of the vectors in m. I'm confused beyond this. How would I prove that a vector in V is not a combination of vectors in m?

the term "dimension" of a (finite dimension) vector space is well defined only after you prove that every basis for the vector space has the same size (and you can probably find the proof for this in any linear algebra book).
once you know that the dimension of V is n, then for a subset of size m<n, even if it is linearly independent, it cannot span the entire vector space because then it will be a basis of size m and there is also a basis of size n>m which is a contradiction.
if the subset is not independent, then you can take out vectors from it without changing the fact that it spans V until it is independent and then you got a new subset of size m'<m<n which is a basis and you again get a contradiction.