Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

can any one tell that in vector space spanning set is the smallest subspace of vector space or not?

See more answers at
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Join Brainly to access

this expert answer


To see the expert answer you'll need to create a free account at Brainly

Im not exactly sure what you are asking. The smallest subspace is always 0
You may be wondering if a set of vectors that spans a vector space is the smallest number of vectors to form a basis then no think of a set of vectors that spans 2 space (0,1) and (1,0) and (1,1) This is will span R^2 but you dont "need (1,1) because it is linearly dependent of (0,1) and (1,0)
If this is what you are asking then take a look at contraction and expansion thms. These should lead you to the answer

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

actually my que is the part of a theorem THEOREM:Let v1,v2,v3...,vn be vectors in a vector space V and let their span be W=span{v1,v2,....,vn} then, (a) W is a subspace of V. (b) W is the smallest subspace of V that contains all of the vectors . and i want the proof of its 2nd part. can u help me plz....
Yes I see what you are saying now. Try proof by contridiction. That is, assume that W is not the smallest subspace
i tried but do not get the point plz u proof it if u can...
This proof is kind of tricky just because it is so trival. Im not going to give you the answer but here is how i would go about the proof without using contridiciton. If you wanted to make the smallest subspace you would just put in the vectors v1, .... , vn
but subspaces force you to be able to add and multiply any two vectors and remain in the subpsace
Therefore if you want a subspace with all of the vectors you must have the span of all of the vectors
Basically, say what the smallest subspace can be (just all of the vectors by themselfs) then say the def of a subspace forces the span of all of the vectors to be the smallest subspace
from all these how can u say w is SMALLEST subspace?
ok ok Ill do the proof :)
The smallest SET that contains v1, ....,vn is (v1, Now is this SET a SUBSPACE? no not nessarly can we take any vi and any vj and have vi + vj is an element of our SET so we need to have any vi + vj to be in our SET and any constant,c, cvi to make it a SUBSPACE. the span of v1,...,vn by def is a SET that contains v1,...,vn and any vi + vj and cvi so this span is the smallest SUBSPACE becasue it contains no more than v1,...,vn, and has closure under additon and scalar mutiplication
I uppercased set and subspace to make sure you didnt confuse them as you were reading it.
now the last part where i claim span(v1, ... vn) is the smallest should be ok for most poeple. if you want to be super rigourous then say, make the subspace any smaller and it will not contain every c*(vi + vj) and thus making it not a subspace
no not nessarly can we take any vi and any vj and have vi + vj NOT an element of our SET
thanks a lot. now i try to understand it
ok good! just remeber this... start with the smallest set of v1, see if your set is a subspace add enough vectors to make a subspace show that if you take away any vectors you will lose closure under addition or multiplication

Not the answer you are looking for?

Search for more explanations.

Ask your own question