Assistant Prof. Dr. Abubakar M.

Ashir
Course Name (Course Code): Linear Algebra (CMPE 241)
Week No. 6
Fall 2023/24
Date:
✓ Definition of vector space
✓ Examples of Vector Spaces
✓ Two unusual vector spaces
✓ The elementary properties of vector spaces
✓ Subspaces and examples
✓ Checking for subspaces
✓ Linear combinations in subspaces
✓ Vector span

2
Definition: vector space is a set V together with an operation called vector addition
(a rule for adding two elements of V to obtain a third element of V) and another
operation called scalar multiplication (a rule for multiplying a real number times an
element of V to obtain a second element of V) on which the following ten properties
hold:

3
Vector Space:
▪ Definition: A vector space is a set 𝑽 containing vectors on which performing linear
operation (vector addition and scalar multiplication) on one or more vectors of 𝑽
produces another vector in the space of the set 𝑽.
ℝ𝟐 spaace ℝ𝟑 𝒔𝒑𝒂𝒄𝒆

4
Vector Space properties:
▪ For every 𝑢, 𝑣 and 𝑤 in 𝑽, and for every 𝒂 𝑎𝑛𝑑 𝒃 in ℝ , the following relations holds:
1. Closure Property of Addition:
2. Closure Property of Scalar Multiplication:
3. Commutative Law of Addition:
4. Associative Law of Addition:

5
Vector Space properties:

To be continued...

6
▪ Vector subspace
▪ Definition: Let 𝑺 be a finite nonempty subset of a vector space 𝑽. Then a vector v in
𝑉 is a (finite) linear combination of the vectors in 𝑺 if and only if there exists a finite
subset { 𝒗𝟏 , 𝒗𝟐 , 𝒗𝟑 … 𝒗𝒏 } of 𝑺 such that the following relation is true.

𝒗 = 𝒂𝟏 𝒗𝟏 + 𝒂𝟐 𝒗𝟐 + 𝒂𝟑 𝒗𝟑 + ⋯ + 𝒂𝒏 𝒗𝒏 𝒇𝒐𝒓 𝒔𝒐𝒎𝒆 𝒓𝒆𝒂𝒍 𝒎𝒖𝒎𝒃𝒆𝒓𝒔 𝒂𝟏 , 𝒂, 𝒂𝟑 … 𝒂𝒏

7
To be continued...

8
▪ Vector span
▪ Definition: Let 𝑺 be a finite nonempty subset of a vector space 𝑽. Then a vector v in
𝑉 is a (finite) linear combination of the vectors in 𝑺 if and only if there exists a finite
subset { 𝒗𝟏 , 𝒗𝟐 , 𝒗𝟑 … 𝒗𝒏 } of 𝑺 such that the following relation is true.

𝒗 = 𝒂𝟏 𝒗𝟏 + 𝒂𝟐 𝒗𝟐 + 𝒂𝟑 𝒗𝟑 + ⋯ + 𝒂𝒏 𝒗𝒏 𝒇𝒐𝒓 𝒔𝒐𝒎𝒆 𝒓𝒆𝒂𝒍 𝒎𝒖𝒎𝒃𝒆𝒓𝒔 𝒂𝟏 , 𝒂, 𝒂𝟑 … 𝒂𝒏

9
▪ Simplified Span Method Span(S) using Row Reduction
▪ Suppose that 𝑺 is a finite subset of ℝ𝒏 containing 𝒌 vectors, with 𝒌 ≥ 𝟐.
▪ Step 1: Form a 𝒌 × 𝒏 matrix A by using the vectors in 𝑺 as the rows of A. Thus,
span(𝑆) is the row space of A.
▪ Step 2: Let C be the reduced row echelon form matrix for A.
▪ Step 3: Then, a simplified form for span( 𝑆 ) is given by the set of all linear
combinations of the nonzero rows of C.

10
▪ Example:
Let 𝑺 be the subset 𝑺 = { [𝟏, 𝟒, −𝟏, −𝟓], [𝟐, 𝟖, 𝟓, 𝟒], [−𝟏, −𝟒, 𝟐, 𝟕], [𝟔, 𝟐𝟒, −𝟏, −𝟐𝟎]} of
ℝ𝒏 .
a) Use the Simplified Span Method to find a simplified form of unified expression for
the vectors in span(𝑺) for 𝒂, 𝒃, 𝒄, 𝒅 ∈ ℝ.
b) Determine if the following vectors 𝒖 = 𝟑, 𝟏𝟐, −𝟐, −𝟏𝟑 𝒂𝒏𝒅 𝒗 = [−𝟐, −𝟖, 𝟒, 𝟔] are
in span(s) or not and give your reasons
Solution
1. Convert the subset 𝑺 into 𝒌×𝒏 matrix A by using the vectors in 𝑺 as the rows of A.

𝟏 𝟒 −𝟏 −𝟓
𝟐 𝟖 𝟓 𝟒
𝐀=
−𝟏 −𝟒 𝟐 𝟕
𝟔 𝟐𝟒 −𝟏 −𝟐𝟎
11
2. Find a matrix C which reduced form of A (i.e.. convert A to reduced echelon
form)
𝟏 𝟒 −𝟏 −𝟓 𝟔 𝟐𝟒 −𝟔 −𝟑𝟎
𝑅1 → 6𝑅1
𝟐 𝟖 𝟓 𝟒 𝟔 𝟐𝟒 𝟏𝟓 𝟏𝟐
⇒ 𝑅2 → 3𝑅2 ⇒
−𝟏 −𝟒 𝟐 𝟕 𝟔 𝟐𝟒 −𝟏𝟐 −𝟒𝟐
𝑅3 → −6𝑅3 𝟔 𝟐𝟒 −𝟏 −𝟐𝟎
𝟔 𝟐𝟒 −𝟏 −𝟐𝟎
𝑅4 → 1𝑅3
𝟔 𝟐𝟒 −𝟔 −𝟑𝟎 𝟔 𝟐𝟒 −𝟔 −𝟑𝟎
𝟔 𝟐𝟒 𝟏𝟓 𝟏𝟐 𝑅2 → 𝑅2 − 𝑅1 𝟎 𝟎 𝟐𝟏 𝟒𝟐
⇒ 𝑅3 → 𝑅3 − 𝑅1 ⇒
𝟔 𝟐𝟒 −𝟏𝟐 −𝟒𝟐 𝟎 𝟎 −𝟔 −𝟏𝟐
𝟔 𝟐𝟒 −𝟏 −𝟐𝟎 𝑅4 → 𝑅3 − 𝑅1 𝟎 𝟎 𝟓 𝟏𝟎

𝟔 𝟐𝟒 −𝟔 −𝟑𝟎 1 1 𝟏 𝟒 −𝟏 −𝟓
𝑅1 → 𝑅1 , 𝑅2 → 𝑅2
6 21
𝟎 𝟎 𝟐𝟏 𝟒𝟐 𝟎 𝟎 𝟏 𝟐
⇒ 𝑅3 → 𝑅3 , 𝑅4 → 1 𝑅4 ⇒
1
𝟎 𝟎 −𝟔 −𝟏𝟐 −6 5 𝟎 𝟎 𝟏 𝟐
12
𝟎 𝟎 𝟓 𝟏𝟎 𝟎 𝟎 𝟏 𝟐
Continuation
𝟏 𝟒 −𝟏 −𝟓 𝟏 𝟒 𝟎 −𝟑
𝟎 𝟎 𝟏 𝟐 𝑅1 → 𝑅1 + 𝑅3 𝟎 𝟎 𝟎 𝟎
⇒ 𝑅2 → 𝑅2 − 𝑅3 ⇒
𝟎 𝟎 𝟏 𝟐 𝟎 𝟎 𝟏 𝟐
𝟎 𝟎 𝟏 𝟐 𝑅4 → 𝑅4 − 𝑅3 𝟎 𝟎 𝟎 𝟎

𝟏 𝟒 𝟎 −𝟑 𝟏 𝟒 −𝟏 −𝟓
𝟎 𝟎 𝟎 𝟎 𝟐 𝟖 𝟓 𝟒
C= is the rows reduced echelon for of 𝐀 =
𝟎 𝟎 𝟏 𝟐 −𝟏 −𝟒 𝟐 𝟕
𝟎 𝟎 𝟎 𝟎 𝟔 𝟐𝟒 −𝟏 −𝟐𝟎
𝟏 𝟎 𝒂
𝟒 𝟎 𝟒𝒂
span(𝑺)=𝒂 +b =
𝟎 𝟏 𝒃
−𝟑 𝟐 −𝟑𝒂 + 𝟐𝒃
13
b) Determine if the following vectors 𝒖 = 𝟑, 𝟏𝟐, −𝟐, −𝟏𝟑 𝒂𝒏𝒅 𝒗 = [−𝟐, −𝟖, 𝟒, 𝟔] are in
span(s) or not and give your reasons.
i. For vector 𝒖 to be in span(𝑺), we need to solve the equation span(𝑺)=u, and if
there exist a unique solution such that:

𝒂=𝟑
𝒂 𝟑 𝟏𝟐
𝟒𝒂 𝟒𝒂 = 𝟏𝟐 ⇒ 𝒂 = = 𝟑
𝟏𝟐 𝟒
= ⇒ 𝐛 = −𝟐
𝒃 −𝟐
−𝟑𝒂 + 𝟐𝒃 −𝟏𝟑 −𝟑𝒂 + 𝟐𝒃 = −𝟏𝟑 ⇒ −𝟑 𝟑 + 𝟐 −𝟐 = −𝟏𝟑

▪ A unique solution exists on checking the relations at 𝒂 = 𝟑 𝒂𝒏𝒅 𝒃 = −𝟐. Therefore,

𝒖 is a span of 𝑺.
14
b) Determine if the following vectors 𝒖 = 𝟑, 𝟏𝟐, −𝟐, −𝟏𝟑 𝒂𝒏𝒅 𝒗 = [−𝟐, −𝟖, 𝟒, 𝟔] are in
span(s) or not and give your reasons.
ii. For vector V
𝒂 −𝟐 𝒂 = −𝟐
−𝟖
𝟒𝒂 −𝟖 𝟒𝒂 = −𝟖 ⇒ 𝒂 = = −𝟐
= 𝟒
𝒃 𝟒 𝐛=𝟒
−𝟑𝒂 + 𝟐𝒃 𝟔 −𝟑𝒂 + 𝟐𝒃 = −𝟏𝟑 ⇒ −𝟑 −𝟐 + 𝟐 𝟒 ≠ −𝟏𝟑

▪ The expression has no unique solution i.e., no values of 𝒂 𝒂𝒏𝒅 𝒃 which satisfy the
conditions. Hence 𝒗 is not in span of 𝑺.

15
Exercises

16
Exercises

17
Assistant Prof. Dr. Abubakar M. Ashir
Course Name (Course Code): Linear Algebra (CMPE 241)
Week No. 7
Fall 2023/24
Date:
✓ Linear Combination
✓ Linear dependence independence
✓ Test for Linear dependence
✓ Rank of a subspace or matrix
✓ Basis and Dimension

19
Linear combination of vectors in ℝ𝟐 .
4 −1
▪ Let 𝑣 = , 𝑎𝑛𝑑 𝑢 = be vectors in ℝ𝟐 space representing.
2 2
▪ The linear combination of these vectors produces another vector 𝑤 in the ℝ𝟐 space
represented by the operation where 𝒄, 𝒅 and 𝒆 are real numbers
𝒄𝒗 + 𝒅𝒘 = 𝒖
▪ For 𝒄 = 1 and d = 1,
4 −1 3
▪ 𝒖 = 𝑐𝑣 + 𝑐𝑤 = 1 +1 =
2 2 4
▪ For 𝒄 = 1 and d = −1,
4 −1 5
▪ 𝒖 = 𝑐𝑣 + 𝑐𝑤 = 1 + (−1) =
2 2 0

20
Linear combination of vectors in ℝ𝟑 .
▪ A three-dimensional vectors 𝑣, 𝑤 ∈ ℝ3 have three components along 𝑥𝑦𝑧 − 𝑝𝑙𝑎𝑛𝑒.
The origin of the arrow starts at point (0,0,0).
▪ The linear combination of these vectors produces another vector 𝑤 in the
ℝ𝟑 space represented by the operation where 𝒄, 𝒅 and 𝒆 are real numbers.
𝒄𝒖 + 𝒅𝒗 + 𝒆𝒘 = 𝒙

21
▪ Linear combination
𝟏 𝟎
Find the real numbers 𝒄, 𝒅 and 𝒆 that linearly combined vectors 𝒖 = 𝟐 𝒗 = 𝟏
𝟏 𝟎
𝟑 𝟎
w = 𝟓 to produce vector 𝒙 = 𝟎 in ℝ3 space.
𝟑 𝟎
Solution
Let the linear combination be, 𝒄𝒖 + 𝒅𝒗 + 𝒆𝒘 = 𝒙

𝟏 𝟎 𝟑 𝟎 𝟏 𝟎 𝟑 𝒄 𝟎
𝒄 𝟐 + 𝒅 𝟏 +e 𝟓 = 𝟎 ⇒ 𝟐 𝟏 𝟓 𝒅 = 𝟎
𝟏 𝟎 𝟑 𝟎 𝟏 𝟎 𝟑 𝒆 𝟎
22
▪ Linear combination
▪ Using Gaussian Elimination method to reduce A and B to echelon form

𝟏 𝟎 𝟑 𝟎 𝟏 𝟎 𝟑 𝟎 1 0 3 𝑐 0 c + 3𝑒 = 0
𝟐 𝟏 𝟓 𝟎 ⇒ 𝟎 𝟏 −𝟏 𝟎 , 𝑜𝑟 0 1 −1 𝑑 = 0 ⇒ 𝑑−𝑒 =0
𝟏 𝟎 𝟑 𝟎 𝟎 𝟎 𝟎 𝟎 0 0 0 𝑒 0 0= 0

▪ The equation has no unique solution but an infinite number of solutions.

▪ Letting 𝑑 = 1 the solutions are 𝒄 𝒅 𝒆 = −𝟑 𝟏 𝟏
▪ Letting 𝑑 = −2 the solutions are 𝒄 𝒅 𝒆 = 𝟔 −𝟐 −𝟐
▪ Letting 𝑑 = 0 the solutions are 𝒄 𝒅 𝒆 = 𝟎 𝟎 𝟎

23
▪ Linear independence
Definition: Let 𝑺 = { 𝒗𝟏 , 𝒗𝟐 , 𝒗𝟑 … 𝒗𝒏 } be a finite nonempty subset of a vector space 𝑽.
Then 𝑺 is linearly independent if and only if for any set of real numbers
𝒂𝟏 , 𝒂, 𝒂𝟑 … 𝒂𝒏 , the following expression hold true.
1. 𝑳𝒊𝒏𝒆𝒂𝒓 𝒄𝒐𝒎𝒃𝒊𝒏𝒂𝒕𝒊𝒐𝒏:
𝒂𝟏 𝒗𝟏 + 𝒂𝟏 𝒗𝟐 + 𝒂𝟏 𝒗𝟑 + ⋯ + 𝒂𝟏 𝒗𝒏 = 𝟎 ⇒ 𝒂𝟏 = 𝟎, 𝒂𝟑 = 𝟎 … 𝒂𝒏 = 𝟎
𝒂𝟏 𝟎
𝟐. 𝒊𝒇 𝑨 = 𝒗𝟏 𝒗𝟐 𝒗𝟑 … 𝒗𝒏 𝒂𝒏𝒅 𝑿 = 𝒂.𝟐 and 𝑨𝑿 = 𝟎 ⇒ 𝑿 = 𝟎.
𝒂𝒏 𝟎
▪ In a plain language, if any of the vectors 𝒗𝒊 ∈ 𝑺 = { 𝒗𝟏 , 𝒗𝟐 , 𝒗𝟑 … 𝒗𝒏 } in subspace S
can be expressed as a linear combination of the other vectors, then the subspace S
is Linearly dependent otherwise is Linearly independent.
▪ The vector 𝑣𝑖 that can be expressed as a linear combination of the other vectors is
called a dependent vector. 24
▪ Linear independence in ℝ𝟐 space.
▪ Let there be 2 vectors in subspace S = { 𝟒 𝟐 , 𝟏 𝟑 } and T = { 𝟒 𝟐 , 𝟐 𝟏 }
▪ The subset 𝑆 and 𝐓 can be represented in matrix forms as:
𝟒 𝟏 𝟒 𝟐
𝑺 = 𝒗𝟏 , 𝒗𝟐 = , T = 𝒗𝟏 , 𝒗𝟐 =
𝟐 𝟑 𝟐 𝟏
▪ Subspace S is Linearly independent because the two vectors in the
subspace are not dependent on one another. However, subspace B is
Linearly dependent because one of the vector can be expressed as the
𝟏
linear combination of the other i.e., 𝒗𝟐 = 𝟐 𝒗𝟏

25
▪ Linear independence in ℝ𝟐 space.
▪ Assume 3 vectors in subspace 𝑺 = { 𝟏 𝟐 𝟏, 𝟎 𝟏 𝟎, 𝟑 𝟓 𝟑 } and 𝐓=
{ −𝟑 𝟏 𝟏 , −𝟓 −𝟐 𝟐 , 𝟐 𝟐 −𝟏 }
▪ The subset 𝑆 and 𝐓 can be represented in matrix forms as:

𝟏 𝟎 𝟑 𝟑 −𝟓 𝟐
𝑺= 𝟐 𝟏 𝟓 𝑻= 𝟏 −𝟐 𝟐
𝟏 𝟎 𝟑 −𝟏 𝟐 −𝟏
linearly independent linearly dependent

▪ Subspace T is linearly independent, the two vectors in the subset are not
dependent on one another whereas subspace S is linearly dependent because
one of the vector can be expressed as the linear combination of the other i.e., 𝒗𝟑 =
𝟑𝒗𝟏 − 𝒗𝟐
26
▪ Let S be a finite nonempty set of vectors in Rn. To determine whether S is linearly
independent, perform the following steps:
Step 1: create the matrix A whose columns are the vectors of the subspace S.
Step 2: Reduce the matrix A into its row echelon form
Step 3: If there is a row whose entries are all zeros, then the subspace S is Linearly
dependent otherwise it is Linearly independent.

𝟏 𝟎 𝟎
Linearly dependent if 𝑨= 𝟎 𝟏 𝟎
𝟎 𝟎 𝟏

𝟏 𝟎 𝟐
Linearly dependent 𝐀 = 𝟎 𝟏 𝟑 and linear dependent vector is 𝒗𝟑 = 𝟐𝒗𝟏 + 𝟑𝒗𝟐
𝟎 𝟎 𝟎 27
Example: Determine if the following subspaces are linearly dependent or not. If
linearly dependent find the expression for the dependent vectors?
▪ A) S = { 𝟒 𝟐 , 𝟏 𝟑 }
▪ B) S = { 𝟒 𝟐 , 𝟐 𝟏 }
▪ C) 𝐒 = { −𝟑 𝟏 𝟏 , −𝟓 −𝟐 𝟐, 𝟐 𝟐 −𝟏 }
A) solution
𝟒 𝟏
i. Convert the subspaces to matrix 𝐀 =
𝟐 𝟑
ii. Reduce A to Row echelon form:
𝟒 𝟏 𝟒 𝟏 𝟒 𝟏 1 𝟒 𝟏
𝑅2 → 2𝑅2 𝑅2 → 𝑅2 − 𝑅1 𝑅2 → 𝑅2
𝟐 𝟑 𝟒 𝟔 𝟎 𝟓 5 𝟎 𝟏

𝟒 𝟏 𝟒 𝟎 1 𝟏 𝟎
𝑅 → 𝑅1 − 𝑅2 𝑅 → 𝑅 , 𝐒 is linearly Independent. 28
𝟎 𝟏 1 𝟎 𝟏 1 4 1 𝟎 𝟏
 B) solution
S={ 𝟒𝟐 , 𝟐𝟏 }
𝟒 𝟐
1. Convert the subspaces to matrix 𝐀=
𝟐 𝟏
2. Reduce A to Row echelon form:
𝟏
𝟒 𝟐 𝟒 𝟐 𝟒 𝟐 1 𝟏
𝑅 → 2𝑅2 𝑅 → 𝑅2 − 𝑅1 𝑅1 → 𝑅2 𝟐
𝟐 𝟏 2 𝟒 𝟐 2 𝟎 𝟎 4
𝟎 𝟎

𝐒 is linearly dependent since one of the rows has all entries equals to zero

▪ The equations for the vectors are: 𝒗𝟏 = 𝟏𝒗𝟏 + 𝟎𝒗𝟐 = 𝒗𝟏 . Vector 𝒗𝟏 is independent.
𝟏 𝟏 𝟒 𝟐
▪ 𝒗𝟐 = 𝒗𝟏 + 𝟎𝒗𝟐 = = , therefore 𝒗𝟐 is the dependent vector.
𝟐 𝟐 𝟐 𝟏
29
 C) solution
𝑺={𝟏 𝟐 𝟏, 𝟎 𝟏 𝟎, 𝟑 𝟓 𝟑}
𝟏 𝟎 𝟑
1. Convert the subspaces to matrix 𝐀 = 𝟐 𝟏 𝟓
𝟏 𝟎 𝟑
2. Reduce A to Row echelon form:

𝟏 𝟎 𝟑 𝟏 𝟎 𝟑
𝟐 𝟏 𝟓 𝑟𝑒𝑑𝑢𝑐𝑒 𝑡𝑜 𝑒𝑐ℎ𝑙𝑒𝑜𝑛 𝑓𝑜𝑟𝑚 → 𝟎 𝟏 −𝟏
𝟏 𝟎 𝟑 𝟎 𝟎 𝟎

3. The equations for the vectors are:

▪ 𝒗𝟏 = 𝟏𝒗𝟏 + 𝟎𝒗𝟐 + 𝟎𝒗𝟑 = 𝒗𝟏 . Vector 𝒗𝟏 is independent
▪ 𝒗𝟐 = 𝟎𝒗𝟏 + 𝟏𝒗𝟐 + 𝟎𝒗𝟑 = 𝒗𝟐 . Vector 𝒗𝟐 is independent 30
 𝟏 𝟎 𝟑
▪ 𝒗𝟑 = 𝟑𝒗𝟏 − 𝒗𝟐 = 𝟑 𝟐 − 𝟏 = 𝟓 . Vector 𝒗𝟑 is dependent on 𝒗𝟏 𝒂𝒏𝒅 𝒗𝟐
𝟏 𝟎 𝟑
▪ Subspace 𝑆 is linearly dependent because one of its vectors (𝒗𝟑 ) is linearly
dependent.
D) solution
▪ D) 𝐒 = { −𝟑 𝟏 𝟏 , −𝟓 −𝟐 𝟐, 𝟐 𝟐−𝟏 }
𝟑 −𝟓 𝟐
1. Convert the subspaces to matrix 𝐀 = 𝟏 −𝟐 𝟐
−𝟏 𝟐 −𝟏
2. Reduce A to Row echelon form:
𝟏 𝟎 𝟑 𝟏 𝟎 𝟎
𝟐 𝟏 𝟓 𝑟𝑒𝑑𝑢𝑐𝑒 𝑡𝑜 𝑒𝑐ℎ𝑙𝑒𝑜𝑛 𝑓𝑜𝑟𝑚 → 𝟎 𝟏 𝟎
𝟏 𝟎 𝟑 𝟎 𝟎 𝟏
31
3. The equations for the vectors are:
▪ 𝒗𝟏 = 𝟏𝒗𝟏 + 𝟎𝒗𝟐 + 𝟎𝒗𝟑 = 𝒗𝟏 . Vector 𝒗𝟏 is independent
▪ 𝒗𝟐 = 𝟎𝒗𝟏 + 𝟏𝒗𝟐 + 𝟎𝒗𝟑 = 𝒗𝟐 . Vector 𝒗𝟐 is independent
▪ 𝒗𝟑 = 𝟎𝒗𝟏 + 𝟎𝒗𝟐 + 𝟏𝒗𝟑 = 𝒗𝟑 . Vector 𝒗𝟑 is independent
▪ Subspace 𝑆 is linearly independent because none of its vectors is linearly
dependent.

32
▪ Rank: the rank of a subspace S or matrix A is the number of the linearly
independent column vectors its posses.
▪ If the matrix or subspace is linearly independent, it is said to have full rank and its
rank will be equals to the number of vectors or columns in it.
𝟑 −𝟓 𝟐
1. example 𝐀 = 𝟏 −𝟐 𝟐 has Rank=3 i.e., Full rank because all the vectors in
−𝟏 𝟐 −𝟏
are linearly independent
𝟏 𝟎 𝟑
2. The matrix B has Rank=2 𝑩 = 𝟐 𝟏 𝟓 because there are only two linearly
𝟏 𝟎 𝟑
independent vectors in it. The third column vector is linearly dependent on the
first and the second vectors.

33
Definition: Let V be a vector space, and let B be a subset of V. Then B is a basis for
V if and only if both of the following are true:
1. B spans V.
2. B is linearly independent.

Example 1
Show that subset 𝑩 = { 𝟏 𝟐 𝟏, 𝟐 𝟑 𝟏 , −𝟏 𝟐 −𝟑 } is a basis for ℝ𝟑 space.
Solution
▪ we need to prove that subset 𝑩 is both spans ℝ𝟑 and is linearly independent.
▪ First, we should use Simplified Span Method to show that B spans ℝ𝟑
▪ Second, we should use Linear dependence test to show that B is linearly
independent. 34
1. Simplified Span Method Test

𝟏 𝟐 𝟏 𝟏 𝟎 𝟎
𝑨= 𝟐 𝟑 𝟏 𝑟𝑒𝑑𝑢𝑐𝑒 𝑡𝑜 𝑒𝑐ℎ𝑙𝑒𝑜𝑛 𝑓𝑜𝑟𝑚 → 𝑪 = 𝟎 𝟏 𝟎
−𝟏 𝟐 −𝟑 𝟎 𝟎 𝟏
𝟏 𝟎 𝟎 𝒂
span(B)=𝒂 𝟎 + 𝒃 𝟏 + 𝒄 𝟎 = 𝒃
𝟎 𝟎 𝟏 𝒄
▪ B is a span of ℝ𝟑 space as any vector in the space will satisfy span equation above.
2. Linear Independence Test

𝟏 𝟐 −𝟏 𝟏 𝟎 𝟎
𝑨= 𝟐 𝟑 𝟐 𝑟𝑒𝑑𝑢𝑐𝑒 𝑡𝑜 𝑒𝑐ℎ𝑙𝑒𝑜𝑛 𝑓𝑜𝑟𝑚 → 𝑪 = 𝟎 𝟏 𝟎
𝟏 𝟏 −𝟑 𝟎 𝟎 𝟏
35
▪ 𝒗𝟏 = 𝟏𝒗𝟏 + 𝟎𝒗𝟐 + 𝟎𝒗𝟑 = 𝒗𝟏 . Vector 𝒗𝟏 is independent
▪ 𝒗𝟐 = 𝟎𝒗𝟏 + 𝟏𝒗𝟐 + 𝟎𝒗𝟑 = 𝒗𝟐 . Vector 𝒗𝟐 is independent
▪ 𝒗𝟑 = 𝟎𝒗𝟏 + 𝟎𝒗𝟐 + 𝟏𝒗𝟑 = 𝒗𝟑 . Vector 𝒗𝟑 is independent
▪ Subset 𝐵 is linearly independent because none of its vectors is linearly
dependent
▪ Therefore, since Subset 𝐵 spans ℝ𝟑 and is linearly independent then, B is a
basis of ℝ𝟑 .

36
▪ 𝑬𝒙𝒄𝒆𝒓𝒄𝒊𝒔𝒆𝒔 (𝒍𝒊𝒏𝒆𝒂𝒓 𝒅𝒆𝒑𝒆𝒏𝒅𝒆𝒏𝒄𝒆)

37
▪ 𝑬𝒙𝒄𝒆𝒓𝒄𝒊𝒔𝒆𝒔(𝒃𝒂𝒔𝒊𝒔)

38
1. Gilbert Strang. (2017). Introduction to Linear Algebra (5th. ed.). Wellesley-
Cambridge Press.
2. Norman, D., & Wolczuk, D. (2011). Introduction to linear algebra for science and
engineering. Pearson Education Inc.
3. Kolman, Bernard; Hill, David R. (2001). Introductory Linear Algebra with
Applications (7th Ed.).Prentice
Links
▪ https://www.youtube.com/watch?v=fNk_zzaMoSs&list=PLZHQObOWTQDPD3MizzM2xVFitgF8hE_ab

39