MATRICES

TABLE OF CONTENTS

M A T R I C E S M A T R I C E S M A T R I C E S M A T R I C E S M A T R I C E S

01 02 03 04 05

Matrix Matrix Matrix Matrix Column and

Operations Multiplication Inverses and Inverses and Row Spaces
Systems of Nonsingular
Linear Matrices
Equations
Matrix Operations
 James Joseph Sylvester (1814–1897)
- coined the term matrix in 1850
and described matrices as “an
oblong arrangement of terms”.
- The Latin word “matrix” means
“womb”. Sylvester considered
matrices as objects “out of which
we may form various systems of
James Joseph Sylvester (1814–1897) determinants”
 Matrix Operations
▪ matrix: a rectangular arrangement of numbers in rows and
columns enclosed in brackets
▪ dimensions: the number of rows and columns, always read “rows
by columns”
▪ entries: numbers in the matrix

MATRIX OPERATIONS
 Matrix

MATRIX OPERATIONS
 Matrix

MATRIX OPERATIONS
Matrix Equality,
Addition, Scalar
Multiplication
 ME Matrix Equality

The m × n matrices A and B are equal, written A = B provided [A]ij = [B]ij for all
1 ≤ i ≤ m, 1 ≤ j ≤ n.

EXAMPLE:

MATRIX OPERATIONS
 MA Matrix Addition
Given the m × n matrices A and B, define the sum of A and B as an m × n matrix,
written A + B, according to
[A + B]ij = [A]ij + [B]ij 1 ≤ i ≤ m, 1 ≤ j ≤ n

EXAMPLE:

MATRIX OPERATIONS
 MSM Matrix Scalar Multiplication
Given the m × n matrix A and the scalar α ∈ C, the scalar multiple of A is
an m × n matrix, written αA and defined according to
[αA]ij = α[A]ij 1 ≤ i ≤ m, 1 ≤ j ≤ n

EXAMPLE:

MATRIX OPERATIONS
 Vector Space Properties
Theorem VSPM Vector Space Properties of Matrices
Suppose that Mmn is the set of all m×n matrices (Definition VSM) with addition and scalar multiplication as
defined in Definition MA and Definition MSM. Then

ACM Additive Closure, Matrices If A, B ∈ Mmn, then A + B ∈ Mmn.

SCM Scalar Closure, Matrices
CM Commutativity, Matrices
AAM Additive Associativity, Matrices
ZM Zero Matrix, Matrices
AIM Additive Inverses, Matrices
SMAM Scalar Multiplication Associativity, Matrices
DMAM Distributivity across Matrix Addition, Matrices
DSAM Distributivity across Scalar Addition, Matrices
OM One, Matrices
MATRIX OPERATIONS
If α ∈C and A ∈ Mmn, then αA ∈ Mmn.
If A, B ∈ Mmn, then A + B = B + A.
If A, B, C ∈ Mmn, then A + (B + C) = (A + B) + C.
There is a matrix, O, called the zero matrix, such that A + O = A for
all A ∈ Mmn.
If A ∈ Mmn, then there exists a matrix −A ∈ Mmn so that A + (−A) = O.
If α, β ∈C and A ∈ Mmn, then α(βA) = (αβ)A.
If α ∈C and A, B ∈ Mmn, then α(A + B) = αA + αB.
If α, β ∈C and A ∈ Mmn, then (α + β)A = αA + βA.
If A ∈ Mmn, then 1A = A.
 ZM Zero Matrix
The m × n zero matrix is written as O = Om×n and defined by [O]ij = 0,
for all
1 ≤ i ≤ m, 1 ≤ j ≤ n.

EXAMPLE:

MATRIX OPERATIONS
 Transposes and
Symmetric Matrices
 TM Transpose of a Matrix
Given an m × n matrix A, its transpose is the n × m matrix 𝐴𝑡
given by
[𝐴𝑡 ]ij = [A]ji , 1 ≤ i ≤ n, 1 ≤ j ≤ m.

EXAMPLE:

MATRIX OPERATIONS
 SYM Symmetric Matrix

The matrix A is symmetric if A = 𝐴𝑡 .

EXAMPLE:

MATRIX OPERATIONS
 Theorem SMS Symmetric Matrices are Square

Suppose that A is a symmetric matrix. Then A is

square.
Proof. We start by specifying A’s size, without assuming it is
square, since we are trying to prove that, so we cannot also
assume it. Suppose A is an m × n matrix. Because A is
symmetric, we know by Definition SYM that A =𝐴𝑡 . So, in
particular, Definition ME requires that A and 𝐴𝑡 must have
the same size. The size of 𝐴𝑡 is n × m. Because A has m
rows and 𝐴𝑡 has n rows, we conclude that m = n, and hence
A must be square by Definition SQM.
MATRIX OPERATIONS
 CCM Complex Conjugate of a Matrix
Suppose A is an m × n matrix. Then the conjugate of A, written A is an
m × n matrix defined by

EXAMPLE:

MATRIX OPERATIONS
 A Adjoint of a Matrix
If A is a matrix, then its adjoint is A* =(𝐴)𝑡 .

EXAMPLE:

MATRIX OPERATIONS
 Matrix
Multiplication
JACQUES PHILIPPE
MARIE BINET
• a French mathematician,
physicist, and astronomer
• February 2, 1786 – May 12,
1856
• he is recognized as the first
to describe the rule
for multiplying matrices in
1812
✓ WHAT IS MATRIX MULTIPLICATION?

✓ WHEN DO WE PERFORM MATRIX

MULTIPLICATION?

✓ WHAT ARE THE PROPERTIES OF MATRIX

MULTIPLICATION?
 MATRIX
MULTIPLICATION
Suppose A is an m x n matrix and B1, B2, B3,…..,Bp are the columns
of an n x p matrix B. Then the matrix product of A with B is the m x p
matrix where column i is the matrix vector product AB. Symbolically,
AB = A[B1, B2, B3,…..,Bp]
= A[B1, B2, B3,…..,Bp]
 MATRIX
MULTIPLICATION
Matrix multiplication can only be done when the number of
columns in the first matrix is equal to the number of rows in the second
matrix.

1 3 two columns

A= 5 7 B= 8 10 12
9 11 2 4 6

two rows
 PROPERTIES OF MATRIX
MULTIPLICATION
1. The commutative property of multiplication DOES NOT hold.
AB ≠ BA

Example: Given the following data, find AB and BA

 Solution:
To find BA,
To find AB,

AB ≠ BA
 2. Matrix Multiplication is
Associative
Suppose A is an m x n matrix, B is an n x p matrix, and C is
an p x s matrix. Then A(BC) = (AB)C

Example: Given the following data, find A(BC) and (AB)C

 Solution:

To find A(BC), To find A(BC),

3. Matrix Multiplication Distributes
Across Addition
Suppose A is an m x n matrix, B and C are n x p matrices
and D is a p x s matrix., and C is an p x s matrix. Then

1. A(B+C) = AB + AC
2. (B + C)D = BD + CD

Example: Given the following data, find A(B+C) and (B +

C)A

A= 2 1 B=3 1 C=1 4
3 2 0 1 3 2
 Solution:

To find A(B + C), To find (B+C)A,

4. Matrix Multiplication and Scalar
Matrix Multiplication
Suppose A is an m x n matrix, and B is an n x p matrix. Let
α be a scalar. Then
α (AB) = (α A)B
= A (αB)

Example: Given the following data, find A(B+C) and (B +

C)A

A= 2 1 B=3 1 C=1 4
3 2
 Example:
Example: Given the following data, find 2A

A= 2 1
3 2

Solution:
 5. Matrix Multiplication and
Identity Matrix
Suppose A is an m x n matrix. Then

1. A In = A
2. Im A = A
6. Matrix Multiplication and the
Zero Matrix
Suppose A is an m x n matrix. Then

1. A0n x p = 0n x p
2. 0p x m A = 0p x n
7. Dimension Property of Matrix
Multiplication
The product of an m x n matrix and an n x k matrix is an m
x k matrix.

1. The product of two matrices will be defined if the

number of columns in the first matrix is equal to the
number of rows in the second matrix.
2. If the product is defined, the resulting matrix will have
the same number of rows as the first matrix and the
same number of columns as the second matrix.
7. Dimension Property of Matrix
Multiplication
Example:
If A is a 3 x 2 matrix and if B is a 2 x 4 matrix, the
dimension property tells us:

❖ The product AB is defined

❖ AB will be a 3 x 4 matrix
Matrix Inverses
and Systems of
Linear Equations
 Inverse of a Matrix
Matrix Inverse

Suppose A and B are square matrices of size n such

that AB = 𝐼𝑛 and BA = 𝐼𝑛 . Then A is invertible and B is
the inverse of A. In this situation, we write B=𝐴−1 .

Notice that if B is the inverse of A, then we can just

as easily say A is the inverse of B, or A and B are
inverses of each other.
Computing the Inverse of a Matrix
Theorem Two-by-Two Matrix Inverse

Suppose
The Formula to Find the
Inverse of a 2×2 Matrix
Example of how to find the
Inverse of a 2×2 Matrix
Example of how to find the
Inverse of a 2×2 Matrix
Example of how to find the
Inverse of a 2×2 Matrix
Example of how to find the
Inverse of a 2×2 Matrix
Example of how to find the
Inverse of a 3×3 Matrix
Example of how to find the
Inverse of a 3×3 Matrix
Example of how to find the
Inverse of a 3×3 Matrix
Example of how to find the
Inverse of a 3×3 Matrix
Example of how to find the
Inverse of a 3×3 Matrix
Example of how to find the
Inverse of a 3×3 Matrix
Example of how to find the
Inverse of a 3×3 Matrix

1ൗ 1ൗ 0
5 5

−1ൗ 3ൗ
5 10 1

1ൗ −3ൗ
5 10 0
 Solving a System of Linear Equations
Using the Inverse of a Matrix

Solving a system of linear equations using the inverse of a

matrix requires the definition of two new matrices:

X is the matrix representing the variables of the system, and B is

the matrix representing the constants.
Using matrix multiplication, we may define a system of equations
with the same number of equations as variables as

AX = B

To solve a system of linear equations using an inverse matrix,

let A be the coefficient matrix, let X be the variable matrix, and
let B be the constant matrix. Thus, we want to solve a system AX =
B. For example, look at the following system of equations.
From this system, the coefficient matrix is

The variable matrix is

And the constant matrix is

Then AX = B looks like

 Solving a 2 × 2 System using
the Inverse of a Matrix

Solve the given system of equations using the

inverse of a matrix.

3x + 8y = 5
4x + 11y = 7​
Write the system in terms of a coefficient matrix, a
variable matrix, and a constant matrix.

Then,
First, we need to calculate 𝐴−1 . Using the formula to
calculate the inverse of a 2 x 2 matrix, we have:
Now we are ready to solve. Multiply both sides of the
equation by 𝐴−1 .

Therefore, x = -1 and y = 1.
 Solving a 3 × 3 System using the
Inverse of a Matrix

Solve the given system of equations using the

inverse of a matrix.

2x + 3y + z = 3
x + 2y + 3z = 6
-2y – z = 9
 2 3 1 𝑥 3
A= 1 2 3 X= 𝑦 B= 6
0 −2 −1 𝑧 9
AX = B
2 3 1 𝑥 3
1 2 3 𝑦 = 6
0 −2 −1 𝑧 9
 𝑥 2 3 1 -1 3
𝑦 = 1 2 3 6
𝑧 0 −2 −1 9

Find the inverse of A.

2 3 1 2 3
1 𝐴 = 1 2 3 1 2
A- 1 = 𝐴 (adjoint)
𝐴 0 −2 −1 0 −2
= (2)(2)(-1) + (3)(3)(0) + (1)(1)(-2) –
(0)(2)(1) + (-2)(3)(2) + (-1)(1)(3)
= - 6 – (- 15)
𝐴 =9
 T
A (Adjoint) = 2 3 1
A= 1 2 3
0 −2 −1
+ 4 − −1 + −2 T
= − −1 + −2 − −4
+ 7 − 5 + 1
4 1 −2 T 𝟒 𝟏 𝟕
= 1 −2 4 A (Adjoint) = 𝟏 −𝟐 −𝟓
7 −5 1 −𝟐 𝟒 𝟏
 -1 1
A = 𝐴(adjoint)
𝐴

4 1 7
1
= 1 −2 −5
9
−2 4 1

4/9 1/9 7/9

-1
A = 1/9 − 2/9 − 5/9
−2/9 4/9 1/9
4/9 1/9 7/9 2 3 1 𝑥 4/9 1/9 7/9 3
1/9 − 2/9 − 5/9 1 2 3 𝑦 = 1/9 − 2/9 − 5/9 6
−2/9 4/9 1/9 0 −2 −1 𝑧 −2/9 4/9 1/9 9

1 0 0 𝑥 4/9 1/9 7/9 3

0 1 0 𝑦 = 1/9 − 2/9 − 5/9 6
0 0 1 𝑧 −2/9 4/9 1/9 9
3X3 3X1

Result : 3 x 1 Matrix
𝑥 4/9 1/9 7/9 3
𝑦 = 1/9 − 2/9 − 5/9 6
𝑧 −2/9 4/9 1/9 9

4 1 7 12 6 63
3 +6 + 9( ) + +( )
𝑥 9 9 9 9 9 9
1 2 5 3 12 45
𝑦 = 3 +6 − + 9(− ) = + − + (− )
9 9 9 9 9 9
𝑧 2 4 1 6 24 9
3 − +6 + 9( ) − + +( )
9 9 9 9 9 9

𝑥 9
𝑦 = −6 Therefore,
𝑧 3 x = 9; y = - 6; and z = 3.
NOW, LET US TRY!
Solve the given system of equations using the inverse of a
matrix.

1. 4x + y = -2 2. x + 2y – z = 8
3x - 5y = 6 3x – y + 2z = 10
3x + 4z = 6
ANSWER TO THE PROBLEM!

𝟒 𝟗𝟒
1. x=− 2. x=
𝟐𝟑 𝟏𝟗

𝟑𝟎 𝟖
y=− y=
𝟐𝟑 𝟏𝟗

𝟒𝟐
z=−
𝟏𝟗
 1. 4x + y = -2 \
3x - 5y = 6

𝟒 𝟑𝟎
Checking: x = − and y = −
𝟐𝟑 𝟐𝟑

4x + y = -2 3x - 5y = 6
𝟒 𝟑𝟎 𝟒 𝟑𝟎
4(− ) + − = -2 3(− ) − 5 − =6
𝟐𝟑 𝟐𝟑 𝟐𝟑 𝟐𝟑
16 30 12 150
− + − = -2 − + =6
23 23 23 23
46 138
− = -2 =6
23 23
-2 = -2 6=6
(TRUE) (TRUE)
 2. x + 2y – z = 8
3x – y + 2z = 10
3x + 4z = 6
𝟗𝟒 𝟖 𝟒𝟐
Checking: x = ; y= ; and z = −
𝟏𝟗 𝟏𝟗 𝟏𝟗

x + 2y - z = 8 3x – y + 2z = 10
𝟗𝟒 𝟖 𝟒𝟐 𝟗𝟒 𝟖 𝟒𝟐
( )+2 − − =8 3( ) − +2 − = 10
𝟏𝟗 𝟏𝟗 𝟏𝟗 𝟏𝟗 𝟏𝟗 𝟏𝟗
94 16 42 282 8 84
+ + =8 − − = 10
19 19 19 19 19 19
152 190
=8 = 10
19 19
8=8 10 = 10
(TRUE) (TRUE)
2. x + 2y – z = 8
3x – y + 2z = 10
3x + 4z = 6
𝟗𝟒 𝟖 𝟒𝟐
Checking: x = ; y = ; and z=−
𝟏𝟗 𝟏𝟗 𝟏𝟗

3x + 4z = 6
𝟗𝟒 𝟒𝟐
3( ) + 4 − =6
𝟏𝟗 𝟏𝟗
282 168
− =6
19 19
114
=6
19
6=6
(TRUE)
Matrix Inverses
and Nonsingular
Matrices
Nonsingular Matrix
- A square matrix is nonsingular if and only if the
determinant is non-zero (Lipschutz 1991, p. 45).
- Nonsingular matrices are also called as regular
matrices.
 Which of the following is a nonsingular matrix?
2 3 3 2
A= B=
4 6 5 4

Singular matrix if the det = 0 Nonsingular matrix if the det ≠ 0

2 3 3 2
A= B=
4 6 5 4
det A = (2)(6) - (4)(3) det B = (3)(4) - (5)(2)
= 12 - 12 = 12 - 10
=0 =2
Properties of Nonsingular Matrix
▪ The determinant of a nonsingular matrix is a non-zero
value.
▪ The nonsingular matrix is also called an invertible matrix
because determinant can be computed.
▪ The nonsingular matrix is a square matrix because
determinants can only be computed for nonsingular
matrices.
▪ If the given matrices A and B and AB = In, then A and B are
inverses of each other.
▪ The product of nonsingular matrices is a nonsingular
matrix.
 Nonsingular Matrices are Invertible
If A and B are square matrices such that AB = In and
BA = In, then A is invertible and B is the inverse of A

where I is the identity matrix. Such a matrix B is unique.

2 5 3 −5
Example: Suppose that A = and B =
1 3 −1 2

Then
6−5 − 10 + 10 1 0
AB = = AB = BA = In
3−3 −5+6 0 1
and
6 −5 15 − 15 1 0
BA = =
−2 + 2 −5+6 0 1
 1
−3 1 0
5
If A = and B = 3 , show that A is an invertible
5 0 1
5
matrix and B is its inverse.
Solution:
−3 1
A= ∣A∣ = (-3)(0) - (5)(1) = 0 - 5
5 0
∣A∣ = - 5 ≠ 0

A is an invertible matrix 1 1
0 −3 + (5) 0 1 + (0)
If B is the inverse of A, then AB = BA= I. 5 5
BA = 3 3
1 3 1 −3 + 5 1(1) + (0)
−3 0 + 1 1 −3 +1 5 5
5 5
AB = 1 0
5 0 +0 1 5
1
+0
3 =
5 5 0 1
1 0 AB = BA = I
=
0 1 A is invertible and B is its inverse.
 4 −1 0
Given the A = 2 3 5 , find the singularity of the matrix.
−1 7 2

∣A∣ = 4 3 5 - (-1) 2 5 + 0 2 3
7 2 −1 2 −1 7
= 4 3 2 − 7 (5) − (-1) 2 2 − −1 (5) + 0 2 7 − −1 (3)
= 4(6 - 35) − (-1)(4 + 5) + (0)(14 + 3)
= 4(-29) − (-1)(9) + 0(17)
= -116 + 9 + 0
∣A∣ = -107

Since the det ≠ 0, then A is nonsingular matrix.

 Inverse of Nonsingular
Matrices
The principal algorithm used to compute the inverse
of a nonsingular matrix is known as Gauss-Jordan
Elimination, in honor of Gauss and Wilhelm Jordan, a
nineteenth century German engineer.
Find the inverse of A.
3 2 1 0
5 4 0 1

1 0
5 4 0 1
Find the inverse of A.
3 2 1 0
5 4 0 1

1 0
5 4 0 1

1 0
0 1
Find the inverse of A.
3 2 1 0
5 4 0 1

1 0
5 4 0 1

1 0
0 1

1 0
0 1
Find the inverse of A.
3 2 1 0
5 4 0 1

1 0
5 4 0 1

1 0
0 1

1 0
0 1

1 0 -1
0 1
 Find the inverse B.

-2 5 -2 1 0 0
0 -1 -2 0 1 0
0 -1 -1 0 0 1

1 1 0 0
0 1 2 0 -1 0
0 -1 -1 0 0 1
 Find the inverse B.

-2 5 -2 1 0 0
0 -1 -2 0 1 0
0 -1 -1 0 0 1

1 1 0 0
0 1 2 0 -1 0
0 -1 -1 0 0 1

1 0 6 0
0 1 2 0 -1 0
0 0 1 0 -1 1
 Find the inverse B.

-2 5 -2 1 0 0
0 -1 -2 0 1 0
0 -1 -1 0 0 1

1 1 0 0
0 1 2 0 -1 0
0 -1 -1 0 0 1

1 0 6 0
0 1 2 0 -1 0
0 0 1 0 -1 1

1 0 0 -6
0 1 0 0 1 -2
0 0 1 0 -1 1
Unitary Matrix

Recall:

Adjoint of U Complex Conjugate-Transpose of

matrix U
Let the matrix A be defined by

Compute its conjugate transpose.

Solution:

Change the sign of the imaginary i

Transpose is where rows

become columns
Column and Row
Spaces
 Column Space
Definition CSM Column Space of a Matrix

Supposed that A is an m x n matrix with columns 𝑨𝟏 , 𝑨𝟐 , 𝑨𝟑 , … … . 𝑨𝒏

Then, the column space of A, written C(A), is the subset of 𝑪𝒎
containing all linear combinations of the columns of A.
C(A)= {{ 𝑨𝟏 , 𝑨𝟐 , 𝑨𝟑 , … … . 𝑨𝒏 }}
 Column Space

mxn

𝑣1 𝑣2 𝑣𝑛
C(A)= span ({columns})
C(A)= span ({𝐴1 , 𝐴2 ,……. 𝐴𝑛 })
C(A)= span ({𝑣1 , 𝑣2 ,……. 𝑣𝑛 })
Note:
Since each column has m components, these vectors exist in 𝑪𝒎 . Consequently, C(A) is a subspace of 𝑪𝒎 .
 Column Space
C(A)= span ({columns})
1 0 5
A= 2 1 3 C(A)= span ({𝑣1 , 𝑣2 ,……. 𝑣𝑛 })
3 8 2 1 0 5
𝑣1 𝑣2 𝑣3 C(A)= span ( { 2}, { 1}, { 3})
3 8 2

C(A)= 𝑐1 𝑣1 + 𝑐2 𝑣2 + 𝑐3 𝑣3
Therefore, the column space of A is equal to all of
the linear combinations of the vectors that make
up the columns.
 Basis for Column Space
C(A)= span ({columns})
C(A)= span ({𝐴1 , 𝐴2 ,……. 𝐴𝑛 })
C(A)= span ({𝑣1 , 𝑣2 ,……. 𝑣𝑛 })
mxn

𝑣1 𝑣2 𝑣𝑛
Note:
Basis must span the entire space that it is a basis for All basis vectors must be linear independent.

Linearly Independent Pivot Column Basis for C(A)

Column
 Basis for Column Space
C(A)= span ( )
1 4 8 −1
1 4 8 −1 { 2}, { 4}, { 8},{ 0 }
A= 2 4 8 0 3 2 4 1
3 2 4 1

1 4 8 −1 Therefore, we can conclude that

0 −4 −8 2 -2𝑅1 + 𝑅2
0 −10 −20 4 -3𝑅1 + 𝑅3 the Basis for
By using 1 4 −1
(RREF) 1 4 8 −1 1 C(A)= span ( { 2}, { 4}, { 0 })
Reduced Row 0 1 2 −1/2 4 𝑅2
− 3 2 1
0 0 0 −1 10𝑅2 + 𝑅3
Echelon Form
1 4 8 −1
0 1 2 −1/2 C(A) is 3-dimensional
0 0 0 1 −𝑅3

Pivot Columns
 Row Space of a Matrix
Definition RSM Row Space of a Matrix

Suppose 𝐴 is an 𝑚 × 𝑛 matrix. Then the row space

of 𝐴, ℛ(𝐴), is the column space of 𝐴𝑡 , i.e. ℛ 𝐴 =
𝐶(𝐴𝑡 ).

Informally, the row space is the set of all linear

combinations of the rows of 𝐴.
Example RSAI Row Space of Archetype I
The coefficient matrix in Archetype I is

1 2 1 6 6
3 -1 2 -1 6
𝐼=
1 -1 0 -1 -2
-3 2 -3 6 -10

To build the row space, we transpose the matrix,

1 3 1 -3
2 -1 -1 2
𝐼𝑡 = 1 2 0 -3
6 -1 -1 6
6 6 -2 -10
 Then the columns of this matrix are
used in a span to build the row space,
1 3 1 −3
2 −1 −1 2
ℛ 𝐼 = 𝐶(𝐼 𝑡 ) = 1 , 2 , 0 , −3
6 −1 −1 6
6 6 −2 −10

However, we can use Theorem BCS to get

a slightly better description. First, row-reduce 𝐼 𝑡 ,
1 0 0 1
0 1 0 -2
0 0 1 2
0 0 0 0
0 0 0 0
 Since the pivot columns have indices
𝐷 = 1, 2, 3 , the column space of 𝐼 𝑡 can be
spanned by just the first three columns of 𝐼 𝑡 ,

1 3 1
2 −1 −1
ℛ 𝐼 = 𝐶(𝐼 𝑡 ) = 1 , 2 , 0
6 −1 −1
6 6 −2
Theorem BRS Basis for the Row Space
Suppose that 𝐴 is a matrix and 𝐵 is a row-equivalent matrix
in reduced row-echelon form. Let 𝑆 be the set of nonzero
columns of 𝐵𝑡 . Then

1. ℛ 𝐴 = 𝑆
2. 𝑆 is a linearly independent set.
Proof.
From Theorem REMRS, we know that ℛ 𝐴 = 𝑅(𝐵). If 𝐵 has
any zero rows, these are columns of 𝐵𝑡 that are the zero
vector. We can safely toss out the zero vector in the span
construction, since it can be recreated from the nonzero
vectors by a linear combinations where all the scalars are
zero. So, ℛ 𝐴 = 𝑆 .
 Example IAS Improving a span
Suppose in the course of analyzing a matrix, we
encounter the following set of vectors, described by a
span 1 3 1 −3
2 −1 −1 2
𝑋= 1 , 2 , 0 , −3
6 −1 −1 6
6 6 −2 −10
Let 𝐴 be the matrix whose rows are the vectors in
𝑋, so by design 𝑋 = ℛ 𝐴 ,

1 2 1 6 6
3 -1 2 -1 6
𝐴=
1 -1 0 -1 -2
-3 2 -3 6 -10
 1 2 1 6 6 1 2 1 6 6
3 -1 2 -1 6 𝑅2 + 𝑅4 0 1 -1 5 -4
𝐴=
1 -1 0 -1 -2 0 -1 -3 3 -16 𝑅3 + 𝑅2
-3 2 -3 6 -10 0 8 0 24 8

1 2 1 6 6 1 2 1 6 6
0 1 -1 5 -4 0 1 -1 5 -4
1 -1 0 -1 -2 𝑅3 + 𝑅4 0 0 -4 8 -20
-3 2 -3 6 -10 0 8 0 24 8 8𝑅2 − 𝑅4

1 2 1 6 6 1 2 1 6 6
0 1 -1 5 -4 0 1 -1 5 -4
1
0 -1 -3 3 -16 0 0 -4 8 -20 − 𝑅3
4
-3 2 -3 6 -10 3𝑅1 + 𝑅4 0 0 -8 16 -40
1 2 1 6 6 1 0 0 2 -1
0 1 -1 5 -4 0 1 -1 5 -4 𝑅2 + 𝑅3
0 0 1 -2 5 0 0 1 -2 5
0 0 -8 16 -40 8𝑅3 + 𝑅4 0 0 0 0 0

1 2 1 6 6 −2𝑅2 + 𝑅1 1 0 0 2 -1
0 1 -1 5 -4 0 1 0 3 1 𝑹𝑹𝑬𝑭
0 0 1 -2 5 0 0 1 -2 5
0 0 0 0 0 0 0 0 0 0

1 0 3 -4 14 −3𝑅3 + 𝑅1
0 1 -1 5 -4
0 0 1 -2 5
0 0 0 0 0
 Row–reduce 𝐴 to form a row-equivalent
matrix in reduced row-echelon form,

1 0 0 2 -1
𝐵= 0 1 0 3 1
0 0 1 2 5
0 0 0 0 0

Then Theorem BRS says we can grab the

nonzero columns of 𝐵𝑡 and write

1 0 0
0 1 0
𝑋=ℛ 𝐴 =ℛ 𝐵 = 0 , 0 , 1
2 3 −2
−1 1 5
 Exercise
Find a bases for its row space and
column space of
1 -2 3 1
𝐴= 0 1 -1 0
-1 1 -2 1
Algorithm to find bases for row space & column space
Let 𝐴 be a non-zero matrix.

Step 1 Find reduced row-echelon form of a matrix

𝐴.

Step 2 Non-zero rows in reduced row-echelon

form will form basis for row space of 𝐴.

Step 3 Columns of 𝐴 which contain leading ones

in reduced row-echelon form will form basis for
column space of 𝐴.
PROBLEM SET
References:
Springer International Publishing Switzerland 2015 J. Liesen and V. Mehrmann, Linear Algebra, Springer
Undergraduate Mathematics Series, DOI 10.1007/978-3-319-24346-7_4

Beezer, R(2016). “A First Course in Linear Algebra” Version 3.40. Gig Harbor, Washington, USA

Estela, M. (n.d.). Inverse of a 2x2 Matrix. ChiliMath. Retrieved January 31, 2023, from
https://www.chilimath.com/lessons/advanced-algebra/inverse-of-a-2x2-
matrix/?fbclid=IwAR2VgvjjspqfmL8oxFgmOLedaCAkiX0BDQKTp4JarlfA9OVnpydR9hXkwj4

(2023). Ups.edu. http://linear.ups.edu/html/section-

MISLE.html?fbclid=IwAR3MdBqBOZGbBe4bKfdwkNlTWMjlpMdsD9OJVetMPezXHIO65tewx9j4wpk

Beezer, R. A. (2004-2018). A First Course in Linear Algebra. Congruent Press. Gig Harbor,
Washington, USA. Pp. 225-230
Thank You!