1 Matrix Operations
Matrix Notation:
A= a1 a2 ⋯ an
a 11 ⋯ a 1j ⋯ a 1n
⋮ ⋮
A= a i1 ⋯ a ij ⋯ a in
⋮ ⋮ ⋮
a m1 ⋯ a mj ⋯ a mn
Zero matrix:
0 ⋯ 0 ⋯ 0
⋮ ⋮
0= 0 ⋯ 0 ⋯ 0
⋮ ⋮ ⋮
0 ⋯ 0 ⋯ 0
THEOREM 1
Let A, B, and C be matrices of the same size, and let r and s be scalars. Then
a. A + B = B + A d. rA + B = rA + rB
b. A + B + C = A + B + C e. r + s A = rA + sA
c. A + 0 = A f. rsA = rs A
1
Matrix Multiplication
Multiplying B and x transforms x into the vector Bx. In turn, if we multiply A and Bx, we transform
Bx into ABx . So ABx is the composition of two mappings.
and
ABx =Ax 1 b 1 + x 2 b 2 + ⋯ + x p b p
x1
x2
= x 1 Ab 1 + x 2 Ab 2 + ⋯ + x p Ab p = Ab 1 Ab 2 ⋯ Ab p .
⋮
xp
Therefore,
ABx = Ab 1 Ab 2 ⋯ Ab p x.
and by defining
AB = Ab 1 Ab 2 ⋯ Ab p
2
4 −2
2 −3
EXAMPLE: Compute AB where A = 3 −5 and B = .
6 −7
0 1
Solution:
4 −2 4 −2
2 −3
Ab 1 = 3 −5 , Ab 2 = 3 −5
6 −7
0 1 0 1
−4 2
= −24 = 26
6 −7
−4 2
AB = −24 26
6 −7
Note that Ab 1 is a linear combination of the columns of A and Ab 2 is a linear combination of the
columns of A.
Solution:
∗ ∗ ∗
∗ ∗
∗ ∗ ∗
AB = ∗ ∗ =
∗ ∗ ∗
∗ ∗
∗ ∗ ∗
∗ ∗ ∗
∗ ∗
∗ ∗ ∗
BA would be ∗ ∗ which is __________________.
∗ ∗ ∗
∗ ∗
∗ ∗ ∗
If A is m × n and B is n × p, then AB is m × p.
3
Row-Column Rule for Computing AB (alternate method)
The definition
AB = Ab 1 Ab 2 ⋯ Ab p
When A and B have small sizes, the following method is more efficient when working by hand.
If AB is defined, let AB ij denote the entry in the ith row and jth column of AB. Then
AB ij = a i1 b 1j + a i2 b 2j + ⋯ + a in b nj .
b 1j
b 2j
a i1 a i2 ⋯ a in = AB ij
⋮
b nj
2 −3
2 3 6
EXAMPLE A= ,B = 0 1 . Compute AB, if it is defined.
−1 0 1
4 −7
2 −3 2 −3
2 3 6 28 ■ 2 3 6 28 −45
AB = 0 1 = , 0 1 =
−1 0 1 ■ ■ −1 0 1 ■ ■
4 −7 4 −7
2 −3 2 −3
2 3 6 28 −45 2 3 6 28 −45
0 1 = , 0 1 =
−1 0 1 2 ■ −1 0 1 2 −4
4 −7 4 −7
28 −45
So AB = .
2 −4
4
THEOREM 2
Let A be m × n and let B and C have sizes for which the indicated sums and products are
defined.
WARNINGS
Properties above are analogous to properties of real numbers. But NOT ALL real number
properties correspond to matrix properties.
1. It is not the case that AB always equal BA. (see Example 7, page 114)
2. Even if AB = AC, then B may not equal C. (see Exercise 10, page 116)
3. It is possible for AB = 0 even if A ≠ 0 and B ≠ 0. (see Exercise 12, page 116)
Powers of A
A k = A⋯A
k
EXAMPLE:
3
1 0 1 0 1 0 1 0 1 0 1 0
= = =
3 2 3 2 3 2 3 2 3 2 21 8
EXAMPLE:
1 6 7
1 2 3 4 5 2 7 6
A= 6 7 8 9 8 A =
T
3 8 5
7 6 5 4 3 4 9 4
5 8 3
5
1 2
1 2 0
EXAMPLE: Let A = ,B = 0 1 . Compute AB, AB T , A T B T and B T A T .
3 0 1
−2 4
Solution:
1 2
1 2 0
AB = 0 1 =
3 0 1
−2 4
AB T =
1 3 7 3 10
1 0 −2
A B =
T T
2 0 = 2 0 −4
2 1 4
0 1 2 1 4
1 3
1 0 −2
BTAT = 2 0 =
2 1 4
0 1
THEOREM 3
Let A and B denote matrices whose sizes are appropriate for the following sums and
products.
a. A T T = A (I.e., the transpose of A T is A
b. A + B T = A T + B T
c. For any scalar r, rA T = rA T
d. AB T = B T A T (I.e. the transpose of a product of matrices equals the product of their
transposes in reverse order. )