Math 2.0

statement proposition

Associativity of matrix multiplication

Statement

Let RR be a ring and let m,n,p,q≥0m, n, p, q \ge 0 be integers. Let AA be an m×nm \times n matrix, BB an n×pn \times p matrix and CC a p×qp \times q matrix over RR. Then (AB)C=A(BC)(AB)C = A(BC), where the products are matrix products.

Remarks

Both sides have entry (i,l)(i, l) equal to ∑j=1n∑k=1paijbjkckl\sum_{j=1}^{n} \sum_{k=1}^{p} a_{ij} b_{jk} c_{kl}. Because of this property, the product ABCABC needs no parentheses. The property also follows from the associativity of the composition of linear maps.

Explanations

L1 human

When we multiply three matrices, we may multiply the first two first, or the last two first. The result is the same in both cases. This is like (2⋅3)⋅4=2⋅(3⋅4)(2 \cdot 3) \cdot 4 = 2 \cdot (3 \cdot 4) for numbers.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Matrix definition
  2. Matrix multiplication definition
  3. Associativity of matrix multiplication statement

Sources

  1. Web https://en.wikipedia.org/wiki/Matrix_multiplication, General properties