5.

3: Laws of Matrix Algebra

5.3.1: Laws
The following is a summary of the basic laws of matrix operations. Assume that the indicated operations are defined; that
is, that the orders of the matrices A, B and C are such that the operations make sense.
Table 5.3.1 : Laws of Matrix Algebra

(1) Commutative Law of Addition A + B = B + A

(2) Associative Law of Addition A + (B + C) = (A + B) + C

(3) Distributive Law of a Scalar over Matrices c(A + B) = cA + cB, where c ∈ R.

(4) Distributive Law of Scalars over a Matrix (c1 + c2 ) A = c1 A + c2 A, where c 1, c2 ∈ R.

(5) Associative Law of Scalar Multiplication c1 (c2 A) = (c1 ⋅ c2 ) A, where c 1, c2 ∈ R.

(6) Zero Matrix Annihilates all Products 0

0A = 0
0, where 00 is the zero matrix.
(7) Zero Scalar Annihilates all Products 0A = 0
0, where 0 on the left is the scalar zero.
(8) Zero Matrix is an identity for Addition A + 0
0 = A.

(9) Negation produces additive inverses A + (−1)A = 0

0.

(10) Right Distributive Law of Matrix Multiplication (B + C)A = BA + CA.

(11) Left Distributive Law of Matrix Multiplication A(B + C) = AB + AC.

(12) Associative Law of Multiplication A(BC) = (AB)C.

(13) Identity Matrix is a Multiplicative Identity IA = A and AI = A.

(14) Involution Property of Inverses If A −1

exists,(A −1 −1
) = A.

(15) Inverse of Product Rule If A −1

and B −1
exist, (AB) −1
= B
−1
A
−1

5.3.2: Commentary
Example 5.3.1: More Precise Statement of One Law

If we wished to write out each of the above laws more completely, we would specify the orders of the matrices. For
example, Law 10 should read:

Let A , B , and C be m × n , n × p , and n × p matrices, respectively, then

A(B + C) = AB + AC

Remarks:
Notice the absence of the “law” AB = BA. Why?
Is it really necessary to have both a right (No. 11) and a left (No. 10) distributive law? Why?

5.3.3: Exercises
Exercise 5.3.1

Rewrite the above laws specifying as in Example 5.3.1 the orders of the matrices.

Answer
a. Let A and B be m by n matrices. Then A + B = B + A,
b. Let A, B, and C be m by n matrices. Then A + (B + C) = (A + B) + C.
c. Let A and B be m by n matrices, and let c ∈ R. Then c(A + B) = cA + cB,
d. Let A be an m by n matrix, and let c , c ∈ R. Then (c + c ) A = c A + c A.
1 2 1 2 1 2

e. Let A be an m by n matrix, and let c , c ∈ R. Then c (c A) = (c c ) A

1 2 1 2 1 2

f. Let 00 be the zero matrix, of size m by n, and let A be a matrix of size n by r. Then 00A = 00 = the m by r zero matrix.
g. Let A be an m by n matrix, and 0 = the number zero. Then 0A = 0 = the m by n zero matrix.
h. Let A be an m by n matrix, and let 00 be the m by n zero matrix. Then A + 00 = A.
i. Let A be an m by n matrix. Then A + (−1)A = 00, where 00 is the m by n zero matrix.
j. Let A, B, and C be m by n, n by r, and n by r matrices respectively. Then A(B + C) = AB + AC.
k. Let A, B, and C be m by n, r by m, and r by m matrices respectively. Then (B + C)A = BA + CA.
l. Let A, B, and C be m by n, n by r, and r by p matrices respectively. Then A(BC) = (AB)C.
 m. Let A be an m by n matrix, I m the m by m identity matrix, and I the n by n identity matrix. Then I
n mA = AIn = A
−1
n. Let A be an n by n matrix. Then if A exists, (A ) = A. −1 −1

o. Let A and B be n by n matrices. Then if A and B exist, (AB) −1 −1 −1 −1

= B A
−1
.

Exercise 5.3.2

Verify each of the Laws of Matrix Algebra using examples.

Exercise 5.3.3

1 2 3 7 6 0 −2 4
Let A = ( ), B = ( ), and C = ( ). Compute the following as efficiently as possible by using
0 −1 2 −1 5 7 1 1

any of the Laws of Matrix Algebra:

a. AB + AC
b. A −1

c. A(B + C)
−1
d. (A ) 2

e. (C + B) −1 −1
A

Answer
21 5 22
a. AB + AC = ( )
−9 0 −6

1 2
b. A −1
= ( ) = A
0 −1

c. A(B + C) = AB + BC, which is given in part (a).

d. (A
−1
2
) = (AA)
−1
= (A
−1
A) = I
−1
= I by part c

Exercise 5.3.4

7 4 3 5
Let A = ( ) and B = ( ). Compute the following as efficiently as possible by using any of the Laws of Matrix
2 1 2 4

Algebra:
a. AB
b. A + B
c. A + AB + BA + B
2 2

d. B A
−1 −1

e. A + AB
2

Exercise 5.3.5

Let A and B be n × n matrices of real numbers. Is A 2

− B
2
= (A − B)(A + B)? Explain.

This page titled 5.3: Laws of Matrix Algebra is shared under a CC BY-NC-SA 3.0 license and was authored, remixed, and/or curated by Al
Doerr & Ken Levasseur via source content that was edited to the style and standards of the LibreTexts platform; a detailed edit history is
available upon request.