Linear Span

1 Let V be a vector space over F. Let x1 , . . . , xn be vectors in

V and let cP1 , . . . , cn ∈ F.
The vector ni=1 ci xi ∈ V is called a linear combination of xi ’s
and ci is called the coefficient of xi in this linear combination.

46 / 56
Linear Span

1 Let V be a vector space over F. Let x1 , . . . , xn be vectors in

V and let cP1 , . . . , cn ∈ F.
The vector ni=1 ci xi ∈ V is called a linear combination of xi ’s
and ci is called the coefficient of xi in this linear combination.
2 Let S be a subset of a vector space V over F.
The linear span of S is the subset of all vectors in V
expressible as linear combinations of finite subsets of S, i.e.,

Xn
{ ki ui : n > 1, u1 , u2 , . . . , un ∈ S and k1 , k2 , . . . , kn ∈ F.}
i=1

46 / 56
Linear Span

1 Let V be a vector space over F. Let x1 , . . . , xn be vectors in

V and let cP1 , . . . , cn ∈ F.
The vector ni=1 ci xi ∈ V is called a linear combination of xi ’s
and ci is called the coefficient of xi in this linear combination.
2 Let S be a subset of a vector space V over F.
The linear span of S is the subset of all vectors in V
expressible as linear combinations of finite subsets of S, i.e.,

Xn
{ ki ui : n > 1, u1 , u2 , . . . , un ∈ S and k1 , k2 , . . . , kn ∈ F.}
i=1

It is denoted as span(S).

46 / 56
Subspaces, Linear Span: Examples

1 The empty sum of vectors is the zero vector. Thus

span(ϕ) = {0}.

47 / 56
Subspaces, Linear Span: Examples

1 The empty sum of vectors is the zero vector. Thus

span(ϕ) = {0}.
2 We say that span(S) is spanned by S.
3 The linear span, span(S), is actually a subspace of V . In fact,
it is the smallest subspace of V containing S is span(S).

47 / 56
Subspaces, Linear Span: Examples

1 The empty sum of vectors is the zero vector. Thus

span(ϕ) = {0}.
2 We say that span(S) is spanned by S.
3 The linear span, span(S), is actually a subspace of V . In fact,
it is the smallest subspace of V containing S is span(S).
4 Note that span(S) is a subspace (why?). Now, if S ⊆ W ⊆ V
and W is a subspace of V then by span(S) ⊆ W (why?).

47 / 56
Subspaces, Linear Span: Examples

1 The empty sum of vectors is the zero vector. Thus

span(ϕ) = {0}.
2 We say that span(S) is spanned by S.
3 The linear span, span(S), is actually a subspace of V . In fact,
it is the smallest subspace of V containing S is span(S).
4 Note that span(S) is a subspace (why?). Now, if S ⊆ W ⊆ V
and W is a subspace of V then by span(S) ⊆ W (why?).
5 Let A be an m × n matrix over F, with rows R1 , . . . , Rm and
columns C1 , . . . , Cn .
The row space of A, denoted R(A), is the subspace of Fn
spanned by the rows R1 , . . . , Rm of A.

47 / 56
Subspaces, Linear Span: Examples

1 The empty sum of vectors is the zero vector. Thus

span(ϕ) = {0}.
2 We say that span(S) is spanned by S.
3 The linear span, span(S), is actually a subspace of V . In fact,
it is the smallest subspace of V containing S is span(S).
4 Note that span(S) is a subspace (why?). Now, if S ⊆ W ⊆ V
and W is a subspace of V then by span(S) ⊆ W (why?).
5 Let A be an m × n matrix over F, with rows R1 , . . . , Rm and
columns C1 , . . . , Cn .
The row space of A, denoted R(A), is the subspace of Fn
spanned by the rows R1 , . . . , Rm of A.
The column space of A, denoted C(A), is the subspace of Fm
spanned by the columns C1 , . . . , Cn of A.

47 / 56
Subspaces, Linear Span: Examples

1 The empty sum of vectors is the zero vector. Thus

span(ϕ) = {0}.
2 We say that span(S) is spanned by S.
3 The linear span, span(S), is actually a subspace of V . In fact,
it is the smallest subspace of V containing S is span(S).
4 Note that span(S) is a subspace (why?). Now, if S ⊆ W ⊆ V
and W is a subspace of V then by span(S) ⊆ W (why?).
5 Let A be an m × n matrix over F, with rows R1 , . . . , Rm and
columns C1 , . . . , Cn .
The row space of A, denoted R(A), is the subspace of Fn
spanned by the rows R1 , . . . , Rm of A.
The column space of A, denoted C(A), is the subspace of Fm
spanned by the columns C1 , . . . , Cn of A.

47 / 56
Linear Span

Theorem
The solution set of a homogeneous linear system Ax = 0 in n
unknowns is a subspace of Rn .

48 / 56
Linear Span

Theorem
The solution set of a homogeneous linear system Ax = 0 in n
unknowns is a subspace of Rn .

The null space of A, denoted N (A), is defined by

N (A) = {x ∈ Fn : Ax = 0}

which is nothing but the solution space of the homogeneous linear

system Ax = 0.

48 / 56
Linear Span

Theorem
The solution set of a homogeneous linear system Ax = 0 in n
unknowns is a subspace of Rn .

The null space of A, denoted N (A), is defined by

N (A) = {x ∈ Fn : Ax = 0}

which is nothing but the solution space of the homogeneous linear

system Ax = 0.
Remark
1 The solution set of every homogeneous system of m equations

in n unknowns is a subspace of Rn .

48 / 56
Linear Span

Theorem
The solution set of a homogeneous linear system Ax = 0 in n
unknowns is a subspace of Rn .

The null space of A, denoted N (A), is defined by

N (A) = {x ∈ Fn : Ax = 0}

which is nothing but the solution space of the homogeneous linear

system Ax = 0.
Remark
1 The solution set of every homogeneous system of m equations

in n unknowns is a subspace of Rn .
2 The solution set of every non-homogeneous system of m
equations in n unknowns is not a subspace of Rn .

48 / 56
Spanning sets are not unique

Theorem
′
If S = {v1 , . . . , vr } and S = {w1 , . . . , wk } are nonempty sets of
′
vectors in a vector space V , then span(S) = span(S ) if and only if
′
each vector in S is a linear combination of those in S , and each
′
vector in S is a linear combination of those in S.

1 Different sets may span the same subspace.

49 / 56
Spanning sets are not unique

Theorem
′
If S = {v1 , . . . , vr } and S = {w1 , . . . , wk } are nonempty sets of
′
vectors in a vector space V , then span(S) = span(S ) if and only if
′
each vector in S is a linear combination of those in S , and each
′
vector in S is a linear combination of those in S.

1 Different sets may span the same subspace.

2 For example span({e1 , e2 }) = span({e1 , e2 , e1 + e2 }) = R2 .

49 / 56
Spanning sets are not unique

Theorem
′
If S = {v1 , . . . , vr } and S = {w1 , . . . , wk } are nonempty sets of
′
vectors in a vector space V , then span(S) = span(S ) if and only if
′
each vector in S is a linear combination of those in S , and each
′
vector in S is a linear combination of those in S.

1 Different sets may span the same subspace.

2 For example span({e1 , e2 }) = span({e1 , e2 , e1 + e2 }) = R2 .
3 The vector space Pn (R) is spanned by {1, t, t 2 , . . . , t n } and
also by {1, (1 + t), . . . , (1 + t)n } (why?).

49 / 56
Linear Span

We have introduced the notion of linear span of a subset S of a

vector space.

50 / 56
Linear Span

We have introduced the notion of linear span of a subset S of a

vector space. This raises some natural questions:
(i) Which spaces can be spanned by finite number of elements ?

50 / 56
Linear Span

We have introduced the notion of linear span of a subset S of a

vector space. This raises some natural questions:
(i) Which spaces can be spanned by finite number of elements ?
(ii) If a vector space V = span(S) for a finite subset S of V then
what is the size of smallest such S?

50 / 56
Linear Span

We have introduced the notion of linear span of a subset S of a

vector space. This raises some natural questions:
(i) Which spaces can be spanned by finite number of elements ?
(ii) If a vector space V = span(S) for a finite subset S of V then
what is the size of smallest such S?
To answer these questions we introduce the notions of linear
dependence and independence, basis and dimension of a vector
space.

50 / 56
Linearly Dependent and Independent subsets of V.S.
1 Linear independence:
2 Let V be a vector space.
3 A subset S ⊂ V is called linearly dependent (L.D.) if there
exist distinct elements v1 , v2 , . . . , vn ∈ S (for some n ≥ 1) and
scalars α1 , α2 , . . . , αn not all zero such that

α1 v1 + α2 v2 + · · · + αn vn = 0.

51 / 56
Linearly Dependent and Independent subsets of V.S.
1 Linear independence:
2 Let V be a vector space.
3 A subset S ⊂ V is called linearly dependent (L.D.) if there
exist distinct elements v1 , v2 , . . . , vn ∈ S (for some n ≥ 1) and
scalars α1 , α2 , . . . , αn not all zero such that

α1 v1 + α2 v2 + · · · + αn vn = 0.

4 A set S is called linearly independent (L.I.) if it is not linearly

dependent, i.e. for all n ≥ 1 and for all distinct
v1 , v2 , . . . , vn ∈ S and scalars α1 , α2 , . . . , αn

α1 v1 + α2 v2 + · · · + αn vn = 0 =⇒ αi = 0, for all i.

51 / 56
Linearly Dependent and Independent subsets of V.S.
1 Linear independence:
2 Let V be a vector space.
3 A subset S ⊂ V is called linearly dependent (L.D.) if there
exist distinct elements v1 , v2 , . . . , vn ∈ S (for some n ≥ 1) and
scalars α1 , α2 , . . . , αn not all zero such that

α1 v1 + α2 v2 + · · · + αn vn = 0.

4 A set S is called linearly independent (L.I.) if it is not linearly

dependent, i.e. for all n ≥ 1 and for all distinct
v1 , v2 , . . . , vn ∈ S and scalars α1 , α2 , . . . , αn

α1 v1 + α2 v2 + · · · + αn vn = 0 =⇒ αi = 0, for all i.

5 Note that the empty set is linearly independent.

51 / 56
Another definition
Definition
If S = {v1 , . . . , vr } is a non-empty set of vectors in a vector space
V , then the vector equation

k1 v1 + k2 v2 + · · · + kr vr = 0

has at-least one solution, namely,

k1 = k2 = · · · = kn = 0.

It is called the trivial solution. If this is the only solution, then S is

said to be a linearly independent set. If there are solutions in
addition to the trivial solutions then S is said to be a linearly
dependent set.

52 / 56
Another definition
Definition
If S = {v1 , . . . , vr } is a non-empty set of vectors in a vector space
V , then the vector equation

k1 v1 + k2 v2 + · · · + kr vr = 0

has at-least one solution, namely,

k1 = k2 = · · · = kn = 0.

It is called the trivial solution. If this is the only solution, then S is

said to be a linearly independent set. If there are solutions in
addition to the trivial solutions then S is said to be a linearly
dependent set.

Theorem
Let S = {v1 , . . . , vr } be a set of vectors in Rn . If r > n, then S is
linearly dependent.
52 / 56
L.D. and L.I. subsets of V.S.: Remarks and Examples
Remarks:
(i) Any subset of V containing a linearly dependent set is linearly
dependent.

53 / 56
L.D. and L.I. subsets of V.S.: Remarks and Examples
Remarks:
(i) Any subset of V containing a linearly dependent set is linearly
dependent.
(ii) Any subset of a linearly independent set in V is linearly
independent.

53 / 56
L.D. and L.I. subsets of V.S.: Remarks and Examples
Remarks:
(i) Any subset of V containing a linearly dependent set is linearly
dependent.
(ii) Any subset of a linearly independent set in V is linearly
independent.
(iii) It can be seen that S is linearly dependent ⇐⇒ either 0 ∈ S
or a vector in S is a linear combination of other vectors in S
(why?).

53 / 56
L.D. and L.I. subsets of V.S.: Remarks and Examples
Remarks:
(i) Any subset of V containing a linearly dependent set is linearly
dependent.
(ii) Any subset of a linearly independent set in V is linearly
independent.
(iii) It can be seen that S is linearly dependent ⇐⇒ either 0 ∈ S
or a vector in S is a linear combination of other vectors in S
(why?).
Examples:
(i) Consider the vector space Rn and let S = {e1 , e2 , . . . , en }.
Then S is linearly independent. Indeed, if
α1 e1 + α2 e2 + · · · + αn en = 0 for some scalars α1 , α2 , . . . , αn
then (α1 , α2 , . . . , αn ) = 0.

53 / 56
L.D. and L.I. subsets of V.S.: Remarks and Examples
Remarks:
(i) Any subset of V containing a linearly dependent set is linearly
dependent.
(ii) Any subset of a linearly independent set in V is linearly
independent.
(iii) It can be seen that S is linearly dependent ⇐⇒ either 0 ∈ S
or a vector in S is a linear combination of other vectors in S
(why?).
Examples:
(i) Consider the vector space Rn and let S = {e1 , e2 , . . . , en }.
Then S is linearly independent. Indeed, if
α1 e1 + α2 e2 + · · · + αn en = 0 for some scalars α1 , α2 , . . . , αn
then (α1 , α2 , . . . , αn ) = 0.
(ii) Let S := {[1 2]T , [2 1]T , [1 − 1]T } ⊂ R2×1 . Then the set
S is linearly dependent since
             
2 1 1 1 2 1 0
= + . Clearly, − + = .
1 2 −1 2 1 −1 0
53 / 56
Examples

(iii) Let S := {(1, 2, 3), (2, 3, 1), (3, 1, 2), (0, −3, 3)} ⊂ R3 . Then
the set S is linearly dependent since
(0, −3, 3) = (1, 2, 3) − 2(2, 3, 1) + (3, 1, 2).
Clearly, (1, 2, 3) − 2(2, 3, 1) + (3, 1, 2) − (0, −3, 3) = (0, 0, 0).

54 / 56
Examples

(iii) Let S := {(1, 2, 3), (2, 3, 1), (3, 1, 2), (0, −3, 3)} ⊂ R3 . Then
the set S is linearly dependent since
(0, −3, 3) = (1, 2, 3) − 2(2, 3, 1) + (3, 1, 2).
Clearly, (1, 2, 3) − 2(2, 3, 1) + (3, 1, 2) − (0, −3, 3) = (0, 0, 0).
(iv) Let S denote the 1×4
 subset of R  consisting
 of the
 vectors 
1 0 0 0 , 1 1 0 0 , 1 1 1 0 and 1 1 1 1 .
Then S is linearly independent.

54 / 56
Examples

(iii) Let S := {(1, 2, 3), (2, 3, 1), (3, 1, 2), (0, −3, 3)} ⊂ R3 . Then
the set S is linearly dependent since
(0, −3, 3) = (1, 2, 3) − 2(2, 3, 1) + (3, 1, 2).
Clearly, (1, 2, 3) − 2(2, 3, 1) + (3, 1, 2) − (0, −3, 3) = (0, 0, 0).
(iv) Let S denote the 1×4
 subset of R  consisting  of the
 vectors 
1 0 0 0 , 1 1 0 0 , 1 1 1 0 and 1 1 1 1 .
Then S is linearly independent.
To see this, let α1 , α2 ,α3 , α4 ∈ R be
 such that 
α1 1 0 0 0 + α  2 1 1 0  + α3 1 1 1 0 +
0
α4 1 1 1 1 = 0 0 0 0 . Then
α1 + α2 + α3 + α4 = 0, α2 + α3 + α4 = 0, α3 + α4 = 0 and
α4 = 0, that is, α4 = α3 = α2 = α1 = 0.

54 / 56
Examples

(iii) Let S := {(1, 2, 3), (2, 3, 1), (3, 1, 2), (0, −3, 3)} ⊂ R3 . Then
the set S is linearly dependent since
(0, −3, 3) = (1, 2, 3) − 2(2, 3, 1) + (3, 1, 2).
Clearly, (1, 2, 3) − 2(2, 3, 1) + (3, 1, 2) − (0, −3, 3) = (0, 0, 0).
(iv) Let S denote the 1×4
 subset of R  consisting  of the
 vectors 
1 0 0 0 , 1 1 0 0 , 1 1 1 0 and 1 1 1 1 .
Then S is linearly independent.
To see this, let α1 , α2 ,α3 , α4 ∈ R be
 such that 
α1 1 0 0 0 + α  2 1 1 0  + α3 1 1 1 0 +
0
α4 1 1 1 1 = 0 0 0 0 . Then
α1 + α2 + α3 + α4 = 0, α2 + α3 + α4 = 0, α3 + α4 = 0 and
α4 = 0, that is, α4 = α3 = α2 = α1 = 0.
(v) Let V be the vector space of all continuous functions from R
to R. Let S = {1, cos 2 t, sin2 t}. Then the relation
cos 2 t + sin2 t − 1 = 0 shows that S is linearly dependent.

54 / 56
Examples

(vi) Let α1 < α2 < · · · < αn be real numbers. Let

V = {f : R → R | f is continuous }. Consider the set
S = {e α1 x , e α2 x , . . . , e αn x }.
We show that S is linearly independent by induction on n.

55 / 56
Examples

(vi) Let α1 < α2 < · · · < αn be real numbers. Let

V = {f : R → R | f is continuous }. Consider the set
S = {e α1 x , e α2 x , . . . , e αn x }.
We show that S is linearly independent by induction on n.

Let n = 1 and βe α1 x = 0. Since e α1 x ̸= 0 for any x we get

β = 0. Now assume that the assertion is true for n − 1 and

β1 e α1 x + · · · + βn e αn x = 0.

Then β1 e (α1 −αn )x + · · · + βn e (αn −αn )x = 0. Let x → ∞ to get

βn = 0. Now apply induction hypothesis to get
β1 = · · · = βn−1 = 0.

55 / 56
Examples

(vii) Let P denote the vector space of all polynomials p(t) with
real coefficients. Then the set S = {1, t, t 2 , . . .} is linearly
independent.

56 / 56
Examples

(vii) Let P denote the vector space of all polynomials p(t) with
real coefficients. Then the set S = {1, t, t 2 , . . .} is linearly
independent.

Suppose that 0 ≤ n1 < n2 < · · · < nr and

α1 t n1 + α2 t n2 + · · · + αr t nr = 0

for certain real numbers α1 , α2 , . . . , αr . Differentiate n1 times

to get α1 = 0. Continuing this way we see that all
α1 , α2 , . . . , αr are zero.

56 / 56