Lesson 6

Matrices 2
Prepared by Engr. Kenneth Ryan Llorera
 Objectives


Perform addition on matrices.

Perform multiplication on matrices.

Identify whether certain operations are doable or not.
 Operations on Matrix
If A is an matrix—that is, a matrix with m rows and n columns—
then the scalar entry in the row and column of A is denoted by and is
•

called the -entry

of A. For instance, the -entry is the number in the third row, second
column. Each column of A is a list of m real numbers, which identifies a
•

vector in .
The diagonal entries in an matrix A ; and they form the main
diagonal of A.
•

•
The -entry of the matrix below is 11

•
 Operations on Matrix
represents the set of all column vectors of size 𝑚. These are
vectors with 𝑚 entries, where each entry is a real number from the set of
•

real numbers . It refers to a space of all possible m-dimensional or n-

dimensional vectors (either row or column), and in the matrix context, it
describes the dimensions of vectors within a matrix.
Euclidean space refers to the space of vectors where the usual
operations of vector addition and scalar multiplication follow the familiar
•

rules of geometry, and distances between points (or vectors) are defined
using the Euclidean distance formula.
A matrix equation can arise in linear algebra (and in applications
such as computer graphics and signal processing) in a way that is not
•

directly connected with linear combinations of vectors. This happens when

we think of the matrix A as an object that “acts” on a vector x by
multiplication to produce a new vector called Ax
 Sums and Scalar Multiples
The arithmetic for vectors described earlier has a natural extension
to matrices. We say that two matrices are equal if they have the same size
•

(i.e., the same number of rows and the same number of columns) and if
their corresponding columns are equal, which amounts to saying that their
corresponding entries are equal. . If A and B are
matrices, then the sum A + B is the matrix whose columns are the sums of
the corresponding columns in A and B. Since vector addition of the columns
•

is done entry-wise, each entry in A + B is the sum of the corresponding

entries in A and B. The sum A + B is defined only when A and B are the
same size.

If we try to get , we are going to get the matrix below. There can
•

never be a sum of K and L or because L is a larger matrix with more

•
 Sums and Scalar Multiples
If is a scalar and A is a matrix, then the scalar multiple A is the
matrix whose
•

columns are times the corresponding columns in A. As with vectors,

stands for
•

•
, and is the same as .

If we try to get and , they will be equal to the matrix below.

•

•
We perform matrix subtraction as if we are adding a negative.
 Theorem on Addition
•
Let be matrices of the same size, and let r and s be scalars.

Each equality in Theorem1 is verified by showing that the matrix

on the left side has the same size as the matrix on the right and that
•

corresponding columns are equal. Size

• is no problem because A, B, and C are equal in size. The equality of
columns follows
 Matrix Multiplication
In linear algebra, when dealing with matrices and their
transformations, it's important to understand the concepts of domain,
•

codomain, rank, and range. These concepts are related to how a matrix
functions as a linear transformation between vector spaces.
Matrices represent linear transformations between vector spaces. A
linear transformation is a function between two vector spaces that
•

preserves vector addition and scalar multiplication. The domain, codomain,

rank, and range are key concepts for describing how linear transformations
(and thus matrices) map vectors from one space to another.
 Linear Transformation
The domain of a matrix refers to the set of vectors that the matrix
can take as inputs. For an matrix 𝐴, , the domain is , meaning it takes
•

vectors from an n-dimensional space.

In simpler terms, if a matrix has n columns, it can multiply a vector from ..
Example: If , the domain is , which means it can multiply with a vector from
•

2-dimensional space .
•

The codomain of a matrix is the set of vectors that the matrix maps
to, or the space into which the output vectors fall. For a matrix , the
•

codomain is , meaning the output of the matrix multiplication lives in an m-

dimensional space.
In other words, if a matrix has m rows, it transforms vectors into ..
Example: If , the codomain is , so the output vectors are in 3-dimensional
•

space ..
•
 Linear Transformation
The range (or image) of a matrix refers to the set of all possible
output vectors that the matrix can produce. The range is a subspace of the
•

codomain. Not every vector in the codomain necessarily has a pre-image in

the domain, which is why the range is often a smaller subset of the
codomain.
The range consists of all linear combinations of the column vectors of the
matrix.
•

Mathematically, the range is the column space of the matrix.

Example: If a matrix , the range of 𝐴 is the set of all vectors in that can be
•

written as linear combinations of the two columns of 𝐴.

•
 Linear Transformation
The rank of a matrix is the dimension of the matrix's range, which
is the number of linearly independent columns (or rows) in the matrix.
•

Essentially, it tells you how many of the matrix's columns (or rows) are
independent and thus contribute to the span of the column (or row) space.
•

The rank tells you how much of the codomain the matrix can "cover.“
A matrix's rank is less than or equal to both the number of rows and the
•

number of columns: .
•

If a matrix has full column rank (i.e., its rank equals the number of
columns), it maps the domain onto a subspace of the codomain without
•

redundancy.
Example: For , the rank can be 0, 1, or 2. If 𝐴 has two linearly independent
columns, its rank is 2. If one column is a multiple of the other, its rank is 1.
•
 Linear Transformation
A transformation (or function or mapping) T from to is a rule that
assigns
•

to each vector x in a vector in . The set is called the domain of T, and

is called the codomain of T. The notation indicates that the domain of T
•

is and the codomain is . For x in ,the vector in is called the image of x

•

(under the action of T).The set of all images is called the range of T.
•

•
 Linear Transformation
The rest of this section focuses on mappings associated with matrix
multiplication. For each x in , is computed as Ax, where A is an matrix. For
•

simplicity, we
sometimes denote such a matrix transformation by . Observe the domain of
T is when A has n columns and the codomain of T is when each column of A
•

has m entries. The range of T is the set of all linear combinations of the
columns of A, because each image is of the form Ax.
•
Let

•
define a transformation so that
 Matrix Multiplication
•
Perform the multiplication in answering the question

a) Find the image of J under the transformation T.

• This means
 Matrix Multiplication
•
Perform the multiplication in answering the question

b) Find the image of M under the transformation T.

• This means
 Matrix Multiplication
•
Perform the multiplication in answering the question

c) Find the image of P under the transformation T.

• This means
For a matrix 𝐴, , the domain is , in simpler terms, if a matrix has 2
columns, it can multiply a vector from .
•
 Matrix Multiplication
•
Perform the multiplication in answering the question

c) What would be the result if we multiply J by L or

•
For an matrix 𝐴, , the domain is , in simpler terms, if a matrix has 1
column, it can multiply a vector from .
•
 Matrix Multiplication
•
Compatibility rules of Multiplication between 2 matrices.

1. We must be cautious of which is the multiplicand and the multiplier.

2. The number of columns in the multiplicand must be equal to the number of rows in the
multiplier.
3. The product follows these dimensions; The number of rows is equal to the number of rows in
the multiplicand. The number of columns is equal to the number of columns in the
multiplier.

•
In this case, define a transformation so that

A is the multiplicand and x is the multiplier, x can have an image in a if it is 2-

dimensional. Matrix A will never have an image under x if the number of columns in x is not 3.
•
 Matrix Multiplication
•
For matrix A and B, the elements of a product AB matrix follows;

I. Match each column of the multiplier to each row of the multiplicand.

The -entry of the product is the accumulated sum of the 1 st row- 1st
column match. The -entry of the product is the accumulated sum of the
2nd row- 1st column match. This process goes on according to the size of
the product
II. For every row-column match, match each element in the row of the
multiplicand to each element in the column of the multiplier. Multiply
each element with their match.

• 1. ssssss
 Matrix Multiplication
•
Try getting the product AB;

I. Match each column of the multiplier to each row of the multiplicand.

• There will only be 4 entries because there are only four matches made.
 Matrix Multiplication
•
Try getting the product BA;

I. Match each column of the multiplier to each row of the multiplicand.

 Matrix Multiplication
•
Try getting the product BA;

• There will only be 9 entries because there are nine matches made.

• 1. ssssss
 Matrix Multiplication
The scalar multiple is the product of a scalar multiplier r and
matrix A. The scalar multiplier is not limited by the dimension nor the size
•

of the matrix, it just applies to whatever type of matrix given.

The nature of multiplying matrices is considering vectors. When a

matrix B multiplies a vector x, it transforms x into the vector Bx. If this
•

vector is then multiplied in turn by a matrix A, the resulting vector is .

 Matrix Multiplication
Our goal is to represent this composite mapping as multiplication
by a single matrix, denoted by , so that
•
 Theorem on Multiplication
Let A be an matrix, and let B and C have sizes for which the
indicated
•

•
sums and products are defined.

A. associative law
B. left-distributive law
C. right-distributive law

D. law of identity matrix multiplication

Multiplication of matrices can be associative but never

commutative, as proven by the previous demonstrations.
•
 Matrix Operation

For 25 points each, answer each question for matrices ;

•

Each solution is worth 20 points, and each answer is worth 5 points.

a) What is ?
•

b) What is ?
c) What is ?
d) What is ?