Topic 7 Linear Independence and Basis
Topic 7 Linear Independence and Basis
v = a1 v1 + . . . + ak vk
The linear span of S is the set Span(S) of all linear combinations of v1 , . . . , vk
If Span(S) = W , then W is a vector space and We say that S is a spanning set for W .
Let b Rm and A be an m k matrix. is in the span of the columns of A if the system Ax = b has a solution.
Linear Independence and Basis
The set S is linearly independent (you can also say v1 , . . . , vk are linearly independent vectors) if whenever
a1 v1 + . . . + ak vk = 0, it will imply that a1 = a2 = . . . = ak = 0. Otherwise, S is said to be linearly
dependent.
Theorem: S = {v1 , . . . , vk } is linearly dependent if and only if one of the vi s can be written as a linear
combination of the other vectors in S. In particular, If 0 S, then S is linearly dependent.
If S is a linearly independent set that spans V , then we say that S is a basis for V .
Example:
1 0
1. , is a basis for R2
0 1
1 0 0
2. 0 , 1 0 is a basis for R3
0 0 1
1
2. If B is a spanning set for V (not necessarily linearly independent), then there is a subset of B that is a
basis for V .
3. If B is a basis for V , then any element of V can be uniquely expressed as a linear combination of elements
of B.
4. If B is linearly independent but not a spanning set for V , then we can find a v V such that C = B {v}
is still linearly independent. Note: Span(B) Span(C) V