Section 3.1 – Matrix Operations
Pg 136, Definition – A
is a rectangular array of numbers called the
of the matrix.
Pg 139, Definition – If A is an matrix and B is an
matrix, then the
C = AB is an
entry of the
product is computed as follows:
Pg 142, Theorem 3.1 – Let A be an
standard unit vector, and
standard unit vector. Then
is the ith row of A and
is the jth column of A.
Pg 147, If A is a square matrix a r and s are nonnegative integers, then
Pg 149, Definition – The
matrix A is the
obtained by interchanging the rows and
columns of A. That is, the ith column of A
is the ith row of A for all i.
Pg 149, Definition – A square matrix A is
Pg 150, A square matrix A is symmetric iff
for all i and j.
Section 3.2 – Matrix Algebra
Pg 152, Theorem 3.2 –
Algebraic Properties of Matrix Addition and Scalar Multiplication
– Let A, B, and C be
matrices of the same size and let c and d be scalars. Then
Pg 156, Theorem 3.3 –
Properties of Matrix Multiplication
– Let A, B, and C be matrices (whose sizes are such
that the indicated operations can be performed) and let k be a scalar. Then
Pg 157, Theorem 3.4 –
Properties of the Transpose
– Let A and B be matrices (whose sizes are such that the
indicated operations can be performed) and let k be a scalar. Then
Pg 159, Theorem 3.5
If A is a square matrix, then
is a symmetric matrix.
For any matrix A,
are symmetric matrices.
Section 3.3 – The Inverse of a Matrix
Pg 161, Definition – If A is an
of A is an
matrix A’ with the property that
identity matrix. If such an A’ exists, then A is called
Pg 162, Theorem 3.6 – If A is an invertible matrix, then its inverse is unique.
Pg 163, Theorem 3.7 – If A is an invertible
matrix, then the system of linear equations given by
has the unique
for any b in R
Pg 163, Theorem 3.8 – If , then is invertible if , in which case