Laws of matrix algebra

- August 11, 2023

We can add and multiply matrices. These operations may or may not satisfy certain laws or rules that characterize matrix algebra. We also introduce an algebraic structure called a ring and show that the set of square matrices is a ring.

In what follows, we assume that matrices $A, B$ and $C$ are such that their shapes are compatible with matrix addition and multiplication.

Then you should be able to show at least the first two (distributive laws) of the following

$\begin{array}{rcl} A (B + C) & = & (A B) + (A C), \\ (A + B) C & = & (A C) + (B C), \\ (A B) C & = & A (B C) . \end{array}$

Let us show the last one.

Theorem (Associativity of matrix multiplication)

Let $A = (a_{i j}), B = (b_{i j})$ and $C = (c_{i j})$ be matrices. Suppose that $A$ has $r$ columns and $B$ has $r$ rows, and that $B$ has $s$ columns and $C$ has $s$ rows. Then $A (B C) = (A B) C$ . In other words, matrix multiplication is associative.

Proof. Let $X = (x_{i j}) = A (B C)$ and $Y = (y_{i j}) = (A B) C$ . Then

$x_{i j} = \sum_{k = 1}^{r} a_{i k} (\sum_{l = 1}^{s} b_{k l} c_{l j})$

and

$y_{i j} = \sum_{l = 1}^{s} (\sum_{k = 1}^{r} a_{i k} b_{k l}) c_{l j} .$

And these are both equal to the same sum:

$\sum_{k = 1}^{r} \sum_{l = 1}^{s} a_{i k} b_{k l} c_{l j} .$

■

Let $M_{n} (K)$ , or simply $M_{n}$ when there is no confusion, denote the set of all $n \times n$ matrices over the field $K$ (i.e., matrices with elements of $K$ ). Then $M_{n} (K)$ is closed under matrix addition and multiplication. As usual, we assume $K = R$ and $M_{n} = M_{n} (R)$ in the following unless otherwise stated.

Let $O = (o_{i j}) \in M_{n}$ be the ``zero'' matrix where all elements are 0. For any $A \in M_{n}$ , we have

$A + O = O + A = A .$

For any $A = (a_{i j}) \in M_{n}$ , we define $- A = (- a_{i j})$ . Clearly, $- A \in M_{n}$ , and

$A + (- A) = O .$

That is, the additive inverse of a matrix always exists.

Let us summarize the laws of matrix algebra. In the following, $A, B, C \in M_{n}$ , and ``addition'' and ``multiplication'' mean matrix addition and matrix multiplication, respectively.

$A + B \in M_{n} .$ ( $M_{n}$ is closed under addition.)
$(A + B) + C = A + (B + C) .$ (Addition is associative.)
The additive identity (the zero matrix) $O \in M_{n}$ exists such that $A + O = O + A = A$ holds for any $A \in M_{n} .$
For any $A \in M_{n}$ , there exists its additive inverse $- A \in M_{n}$ such that $A + (- A) = O .$
$A + B = B + A .$ (Addition is commutative.)
$A B \in M_{n} .$ ( $M_{n}$ is closed under multiplication.)
$(A B) C = A (B C) .$ (Multiplication is associative.)
$A (B + C) = A B + A C$ . (Distributive law.)
$(A + B) C = A C + B C .$ (Distributive law.)

Actually, it is not only

M_{n}

. There are many sets equipped with addition and multiplication that satisfy these laws. They are so common that we have a special name for them.

Definition (Ring)

A set endowed with ``addition'' and ``multiplication'' that satisfies the above nine axioms is called a ring.

Thus,

M_{n}

is a ring with matrix addition and matrix multiplication.

Exercise. Compare the ring axioms with the field axioms. □

See also: Fields.

Example.

Z

, with usual addition and multiplication, is a ring. □

Example.

Q [x]

, the set of polynomials in

x

with rational coefficients, is a ring. (What are addition and multiplication?) □

Search This Blog

Brunei Math Club