Linear Combination, Span
📂Linear AlgebraLinear Combination, Span
Definition: Linear Combination
Let w be a vector in the vector space V. If w can be expressed as follows for vectors v1,v2,⋯,vr in V and arbitrary constants k1,k2,⋯,kr, then w is called a linear combination of v1,v2,⋯,vr.
w=k1v1+k2v2+⋯+krvr
Additionally, in this case, the constants k1,k2,⋯,kr are referred to as the coefficients of the linear combination w.
Explanation
Though it might seem unfamiliar presented in a formulaic manner, it’s not a complex concept. The representation of vectors in a two-dimensional Cartesian coordinate system is precisely the linear combination of two unit vectors x^=(1,0) and y^=(0,1).
v=(v1,v2)=(v1,0)+(0,v2)=v1(1,0)+v2(0,1)=v1x^+v2y^
Theorem
Let S={w1,w2,…,wr} be a non-empty subset of the vector space V. Then the following hold.
(a) Let W be the set of all possible linear combinations of elements of S. W is a subspace of V.
(b) The W from (a) is the smallest subspace of V that includes S. That is, if W′ is a subspace of V that includes S, then the following equation holds.
S⊂W≤W′
Proof
(a)
To demonstrate that W is closed under addition and scalar multiplication, one can apply the subspace test as follows.
u=c1w1+c2w2+⋯+crwr,v=k1w1+k2w2+⋯+krwr
(A1)
u+v is as follows.
u+v=(c1+k1)w1+(c2+k2)w2+⋯+(cr+kr)wr
Since this is a linear combination of w1,w2,…,wr, u+v∈W is true.
(M1)
For any constant k, ku is as follows.
ku=(kc1)w1+(kc2)w2+⋯+(kcr)wr
Since this is a linear combination of w1,w2,…,wr, ku∈W is true.
Conclusion
Since W is closed under addition and scalar multiplication, by the subspace test, W is a subspace of V.
W≤V
■
(b)
Assuming W′ is a subspace of V that includes S, since W′ is closed under addition and scalar multiplication, all linear combinations of elements of S are elements of W′. Therefore,
W≤W′
■
Definition: Span
The W in the theorem is referred to as the subspace of V spanned by S. Furthermore, it is said that the vectors w1,w2,…,wr span W, which is denoted as follows.
W=span{w1,w2,…,wr}orW=span(S)
Explanation
The concept of spanning is necessary to contemplate the smallest set that contains certain elements. Indeed, the above theorem highlights this point. Additionally, eliminating all redundant elements from S itself would make it the basis of a vector space.
Theorem
Let S={v1,v2,…,vr} and S′={w1,w2,…,wr} be non-empty subsets of the vector space V. Then,
span{v1,v2,…,vr}=span{w1,w2,…,wr}
The necessary and sufficient condition for this to hold is that all vectors of S can be expressed as linear combinations of vectors of S′, and all vectors of S′ can be expressed as linear combinations of vectors of S.