Why span(k) Contains More Than k

  • Thread starter Thread starter nhrock3
  • Start date Start date
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
2 replies · 1K views
nhrock3
Messages
403
Reaction score
0
k is a group of vectors

W is a subspace.

why if W [tex]\subseteq[/tex]k then W [tex]\subseteq[/tex]span(k)

??

span(k) is wider then k



it contains all the combinations of k
 
Physics news on Phys.org
You're logic seems fine. Certainly if W is a subset of k, then W is a subset of something 'wider' than k (span{k}).
 
There's something that bothers me about this. If W is a subspace, and W is also a subset of a set of vectors, then it seems to me that W must be the zero vector in whatever space we happen to be working with.

Any other subspaces consist of an infinite number of vectors, so couldn't be a subset of a finite collection of vectors.

If W = 0, then clearly W is a particular linear combination of the vectors in set k, so is in span(k).