Matrix Product

In mathematics, particularly in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication, the number of columns in the first matrix must be equal to the number of rows in the second matrix. The resulting matrix, known as the matrix product, has the number of rows of the first and the number of columns of the second matrix. The product of matrices and is denoted as .

Matrix multiplication was first described by the French mathematician Jacques Philippe Marie Binet in 1812, to represent the composition of linear maps that are represented by matrices. Matrix multiplication is thus a basic tool of linear algebra, and as such has numerous applications in many areas of mathematics, as well as in applied mathematics, statistics, physics, economics, and engineering.
Computing matrix products is a central operation in all computational applications of linear algebra.

Notation

This article will use the following notational conventions: matrices are represented by capital letters in bold, e.g. ; vectors in lowercase bold, e.g. ; and entries of vectors and matrices are italic (they are numbers from a field), e.g. and . Index notation is often the clearest way to express definitions, and is used as standard in the literature. The entry in row , column of matrix is indicated by , or . In contrast, a single subscript, e.g. , is used to select a matrix (not a matrix entry) from a collection of matrices.

Definition

If is an matrix and is an matrix,

:$\mathbf=\begin a_ & a_ & \cdots & a_ \\ a_ & a_ & \cdots & a_ \\ \vdots & \vdots & \ddots & \vdots \\ a_ & a_ & \cdots & a_ \\ \end,\quad\mathbf=\begin b_ & b_ & \cdots & b_ \\ b_ & b_ & \cdots & b_ \\ \vdots & \vdots & \ddots & \vdots \\ b_ & b_ & \cdots & b_ \\ \end$

the ''matrix product'' (denoted without multiplication signs or dots) is defined to be the matrix
:$\mathbf=\begin c_ & c_ & \cdots & c_ \\ c_ & c_ & \cdots & c_ \\ \vdots & \vdots & \ddots & \vdots \\ c_ & c_ & \cdots & c_ \\ \end$
such that
:$c_ = a_b_ + a_b_ +\cdots + a_b_= \sum_^n a_b_,$
for and .

That is, the entry of the product is obtained by multiplying term-by-term the entries of the th row of and the th column of , and summing these products. In other words, is the dot product of the th row of and the th column of .

Therefore, can also be written as

:$\mathbf=\begin a_b_ +\cdots + a_b_ & a_b_ +\cdots + a_b_ & \cdots & a_b_ +\cdots + a_b_ \\ a_b_ +\cdots + a_b_ & a_b_ +\cdots + a_b_ & \cdots & a_b_ +\cdots + a_b_ \\ \vdots & \vdots & \ddots & \vdots \\ a_b_ +\cdots + a_b_ & a_b_ +\cdots + a_b_ & \cdots & a_b_ +\cdots + a_b_ \\ \end$

Thus the product is defined if and only if the number of columns in equals the number of rows in , in this case .

In most scenarios, the entries are numbers, but they may be any kind of mathematical objects for which an addition and a multiplication are defined, that are associative, and such that the addition is commutative, and the multiplication is distributive with respect to the addition. In particular, the entries may be matrices themselves (see block matrix).

Illustration

The figure to the right illustrates diagrammatically the product of two matrices and , showing how each intersection in the product matrix corresponds to a row of and a column of .

:$\overset \overset = \overset$

The values at the intersections marked with circles are:

:$\begin c_ & = + \\ c_ & = + \end$

Fundamental applications

Historically, matrix multiplication has been introduced for facilitating and clarifying computations in linear algebra. This strong relationship between matrix multiplication and linear algebra remains fundamental in all mathematics, as well as in physics, chemistry, engineering and computer science.

Linear maps

If a vector space has a finite basis, its vectors are each uniquely represented by a finite sequence of scalars, called a coordinate vector, whose elements are the coordinates of the vector on the basis. These coordinate vectors form another vector space, which is isomorphic to the original vector space. A coordinate vector is commonly organized as a column matrix (also called ''column vector''), which is a matrix with only one column. So, a column vector represents both a coordinate vector, and a vector of the original vector space.

A linear map from a vector space of dimension into a vector space of dimension maps a column vector
:$\mathbf x=\beginx_1 \\ x_2 \\ \vdots \\ x_n\end$
onto the column vector
:$\mathbf y= A(\mathbf x)= \begina_x_1+\cdots + a_x_n\\ a_x_1+\cdots + a_x_n \\ \vdots \\ a_x_1+\cdots + a_x_n\end.$
The linear map is thus defined by the matrix
:$\mathbf=\begin a_ & a_ & \cdots & a_ \\ a_ & a_ & \cdots & a_ \\ \vdots & \vdots & \ddots & \vdots \\ a_ & a_ & \cdots & a_ \\ \end,$
and maps the column vector $\mathbf x$ to the matrix product
:$\mathbf y = \mathbf .$

If is another linear map from the preceding vector space of dimension , into a vector space of dimension , it is represented by a matrix $\mathbf B.$ A straightforward computation shows that the matrix of the composite map is the matrix product $\mathbf .$ The general formula ) that defines the function composition is instanced here as a specific case of associativity of matrix product (see below):
:$(\mathbf)\mathbf x = \mathbf(\mathbf ) = \mathbf.$

Geometric rotations

Using a Cartesian coordinate system in a Euclidean plane, the rotation by an angle $\alpha$ around the origin is a linear map.
More precisely,
:$\begin x' \\ y' \end = \begin \cos \alpha & - \sin \alpha \\ \sin \alpha & \cos \alpha \end \begin x \\ y \end,$
where the source point $(x,y)$ and its image $(x',y')$ are written as column vectors.

The composition of the rotation by $\alpha$ and that by $\beta$ then corresponds to the matrix product
:$\begin \cos \beta & - \sin \beta \\ \sin \beta & \cos \beta \end \begin \cos \alpha & - \sin \alpha \\ \sin \alpha & \cos \alpha \end = \begin \cos \beta \cos \alpha - \sin \beta \sin \alpha & - \cos \beta \sin \alpha - \sin \beta \cos \alpha \\ \sin \beta \cos \alpha + \cos \beta \sin \alpha & - \sin \beta \sin \alpha + \cos \beta \cos \alpha \end = \begin \cos (\alpha+\beta) & - \sin(\alpha+\beta) \\ \sin(\alpha+\beta) & \cos(\alpha+\beta) \end,$
where appropriate trigonometric identities are employed for the second equality.
That is, the composition corresponds to the rotation by angle $\alpha+\beta$, as expected.

Resource allocation in economics

As an example, a fictitious factory uses 4 kinds of , $b_1, b_2, b_3, b_4$ to produce 3 kinds of intermediate goods, $m_1, m_2, m_3$, which in turn are used to produce 3 kinds of final products, $f_1, f_2, f_3$. The matrices
:$\mathbf = \begin 1 & 0 & 1 \\ 2 & 1 & 1 \\ 0 & 1 & 1 \\ 1 & 1 & 2 \\ \end$   and   $\mathbf = \begin 1 & 2 & 1 \\ 2 & 3 & 1 \\ 4 & 2 & 2 \\ \end$
provide the amount of basic commodities needed for a given amount of intermediate goods, and the amount of intermediate goods needed for a given amount of final products, respectively.
For example, to produce one unit of intermediate good $m_1$, one unit of basic commodity $b_1$, two units of $b_2$, no units of $b_3$, and one unit of $b_4$ are needed, corresponding to the first column of $\mathbf$.

Using matrix multiplication, compute
:$\mathbf = \begin 5 & 4 & 3 \\ 8 & 9 & 5 \\\ 6 & 5 & 3 \\ 11 & 9 & 6 \\ \end ;$
this matrix directly provides the amounts of basic commodities needed for given amounts of final goods. For example, the bottom left entry of $\mathbf$ is computed as $1 \cdot 1 + 1 \cdot 2 + 2 \cdot 4 = 11$, reflecting that $11$ units of $b_4$ are needed to produce one unit of $f_1$. Indeed, one $b_4$ unit is needed for $m_1$, 2 for $m_2$, and $4$ for each of the two $m_3$ units that go into the $f_1$ unit, see picture.

In order to produce e.g. 100 units of the final product $f_1$, 80 units of $f_2$, and 60 units of $f_3$, the necessary amounts of basic goods can be computed as
:$(\mathbf) \begin 100 \\ 80 \\ 60 \\ \end = \begin 1000 \\ 1820 \\ 1180 \\ 2180 \end ,$
that is, $1000$ units of $b_1$, $1820$ units of $b_2$, $1180$ units of $b_3$, $2180$ units of $b_4$ are needed.
Similarly, the product matrix $\mathbf$ can be used to compute the needed amounts of basic goods for other final-good amount data.

System of linear equations

The general form of a system of linear equations is
:$\begina_x_1+\cdots + a_x_n=b_1 \\ a_x_1+\cdots + a_x_n =b_2 \\ \vdots \\ a_x_1+\cdots + a_x_n =b_m\end.$

Using same notation as above, such a system is equivalent with the single matrix equation
:$\mathbf=\mathbf b.$

Dot product, bilinear form and sesquilinear form

The dot product of two column vectors is the matrix product
:$\mathbf x^\mathsf T \mathbf y,$
where $\mathbf x^\mathsf T$ is the row vector obtained by transposing $\mathbf x$ and the resulting 1×1 matrix is identified with its unique entry.

More generally, any bilinear form over a vector space of finite dimension may be expressed as a matrix product
:$\mathbf x^\mathsf T \mathbf ,$
and any sesquilinear form may be expressed as
:$\mathbf x^\dagger \mathbf ,$
where $\mathbf x^\dagger$ denotes the conjugate transpose of $\mathbf x$ (conjugate of the transpose, or equivalently transpose of the conjugate).

General properties

Matrix multiplication shares some properties with usual multiplication. However, matrix multiplication is not defined if the number of columns of the first factor differs from the number of rows of the second factor, and it is non-commutative, even when the product remains definite after changing the order of the factors.

Non-commutativity

An operation is commutative if, given two elements and such that the product $\mathbf\mathbf$ is defined, then $\mathbf\mathbf$ is also defined, and $\mathbf\mathbf=\mathbf\mathbf.$

If and are matrices of respective sizes and , then $\mathbf\mathbf$ is defined if , and $\mathbf\mathbf$ is defined if . Therefore, if one of the products is defined, the other one need not be defined. If , the two products are defined, but have different sizes; thus they cannot be equal. Only if , that is, if and are square matrices of the same size, are both products defined and of the same size. Even in this case, one has in general
:$\mathbf\mathbf \neq \mathbf\mathbf.$
For example
:$\begin 0 & 1 \\ 0 & 0 \end\begin 0 & 0 \\ 1 & 0 \end=\begin 1 & 0 \\ 0 & 0 \end,$
but
:$\begin 0 & 0 \\ 1 & 0 \end\begin 0 & 1 \\ 0 & 0 \end = \begin 0 & 0 \\ 0 & 1 \end.$

This example may be expanded for showing that, if is a matrix with entries in a field , then $\mathbf\mathbf = \mathbf\mathbf$ for every matrix with entries in , if and only if $\mathbf=c\,\mathbf$ where , and is the identity matrix. If, instead of a field, the entries are supposed to belong to a ring, then one must add the condition that belongs to the center of the ring.

One special case where commutativity does occur is when and are two (square) diagonal matrices (of the same size); then . Again, if the matrices are over a general ring rather than a field, the corresponding entries in each must also commute with each other for this to hold.

Distributivity

The matrix product is distributive with respect to matrix addition. That is, if are matrices of respective sizes , , , and , one has (left distributivity)
:$\mathbf(\mathbf + \mathbf) = \mathbf + \mathbf,$
and (right distributivity)
:$(\mathbf + \mathbf )\mathbf = \mathbf + \mathbf.$

This results from the distributivity for coefficients by
:$\sum_k a_(b_ + c_) = \sum_k a_b_ + \sum_k a_c_$
:$\sum_k (b_ + c_) d_ = \sum_k b_d_ + \sum_k c_d_.$

Product with a scalar

If is a matrix and a scalar, then the matrices $c\mathbf$ and $\mathbfc$ are obtained by left or right multiplying all entries of by . If the scalars have the commutative property, then $c\mathbf = \mathbfc.$

If the product $\mathbf$ is defined (that is, the number of columns of equals the number of rows of ), then
:$c(\mathbf) = (c \mathbf)\mathbf$ and $(\mathbf \mathbf)c=\mathbf(\mathbfc).$
If the scalars have the commutative property, then all four matrices are equal. More generally, all four are equal if belongs to the center of a ring containing the entries of the matrices, because in this case, for all matrices .

These properties result from the bilinearity of the product of scalars:
:$c \left(\sum_k a_b_\right) = \sum_k (c a_ ) b_$
:$\left(\sum_k a_b_\right) c = \sum_k a_ ( b_c).$

Transpose

If the scalars have the commutative property, the transpose of a product of matrices is the product, in the reverse order, of the transposes of the factors. That is
:$(\mathbf)^\mathsf = \mathbf^\mathsf\mathbf^\mathsf$
where ^T denotes the transpose, that is the interchange of rows and columns.

This identity does not hold for noncommutative entries, since the order between the entries of and is reversed, when one expands the definition of the matrix product.

Complex conjugate

If and have complex entries, then
:$(\mathbf)^* = \mathbf^*\mathbf^*$
where denotes the entry-wise complex conjugate of a matrix.

This results from applying to the definition of matrix product the fact that the conjugate of a sum is the sum of the conjugates of the summands and the conjugate of a product is the product of the conjugates of the factors.

Transposition acts on the indices of the entries, while conjugation acts independently on the entries themselves. It results that, if and have complex entries, one has

:$(\mathbf)^\dagger = \mathbf^\dagger\mathbf^\dagger ,$

where denotes the conjugate transpose (conjugate of the transpose, or equivalently transpose of the conjugate).

Associativity

Given three matrices and , the products and are defined if and only if the number of columns of equals the number of rows of , and the number of columns of equals the number of rows of (in particular, if one of the products is defined, then the other is also defined). In this case, one has the associative property
:$(\mathbf)\mathbf=\mathbf(\mathbf).$

As for any associative operation, this allows omitting parentheses, and writing the above products as

This extends naturally to the product of any number of matrices provided that the dimensions match. That is, if are matrices such that the number of columns of equals the number of rows of for , then the product
:$\prod_^n \mathbf_i = \mathbf_1\mathbf_2\cdots\mathbf_n$
is defined and does not depend on the order of the multiplications, if the order of the matrices is kept fixed.

These properties may be proved by straightforward but complicated summation manipulations. This result also follows from the fact that matrices represent linear maps. Therefore, the associative property of matrices is simply a specific case of the associative property of function composition.

Computational complexity depends on parenthezation

Although the result of a sequence of matrix products does not depend on the order of operation (provided that the order of the matrices is not changed), the computational complexity may depend dramatically on this order.

For example, if and are matrices of respective sizes , computing needs multiplications, while computing needs multiplications.

Algorithms have been designed for choosing the best order of products, see Matrix chain multiplication. When the number of matrices increases, it has been shown that the choice of the best order has a complexity of $O(n \log n).$

Application to similarity

Any invertible matrix $\mathbf$ defines a similarity transformation (on square matrices of the same size as $\mathbf$)
:$S_\mathbf(\mathbf) = \mathbf^ \mathbf \mathbf.$

Similarity transformations map product to products, that is
:$S_\mathbf(\mathbf) = S_\mathbf(\mathbf)S_\mathbf(\mathbf).$

In fact, one has
:$\mathbf^ (\mathbf) \mathbf = \mathbf^ \mathbf(\mathbf\mathbf^)\mathbf \mathbf =(\mathbf^ \mathbf\mathbf)(\mathbf^\mathbf \mathbf).$

Square matrices

Let us denote $\mathcal M_n(R)$ the set of square matrices with entries in a ring , which, in practice, is often a field.

In $\mathcal M_n(R)$, the product is defined for every pair of matrices. This makes $\mathcal M_n(R)$ a ring, which has the identity matrix as identity element (the matrix whose diagonal entries are equal to 1 and all other entries are 0). This ring is also an associative -algebra.

If , many matrices do not have a multiplicative inverse. For example, a matrix such that all entries of a row (or a column) are 0 does not have an inverse. If it exists, the inverse of a matrix is denoted , and, thus verifies
:$\mathbf\mathbf^ = \mathbf^\mathbf = \mathbf.$
A matrix that has an inverse is an invertible matrix. Otherwise, it is a singular matrix.

A product of matrices is invertible if and only if each factor is invertible. In this case, one has

:$(\mathbf\mathbf)^ = \mathbf^\mathbf^.$

When is commutative, and, in particular, when it is a field, the determinant of a product is the product of the determinants. As determinants are scalars, and scalars commute, one has thus
:$\det(\mathbf) = \det(\mathbf) =\det(\mathbf)\det(\mathbf).$

The other matrix invariants do not behave as well with products. Nevertheless, if is commutative, and have the same trace, the same characteristic polynomial, and the same eigenvalues with the same multiplicities. However, the eigenvectors are generally different if .

Powers of a matrix

One may raise a square matrix to any nonnegative integer power multiplying it by itself repeatedly in the same way as for ordinary numbers. That is,
:$\mathbf^0 = \mathbf,$
:$\mathbf^1 = \mathbf,$
:$\mathbf^k = \underbrace_.$

Computing the th power of a matrix needs times the time of a single matrix multiplication, if it is done with the trivial algorithm (repeated multiplication). As this may be very time consuming, one generally prefers using exponentiation by squaring, which requires less than matrix multiplications, and is therefore much more efficient.

An easy case for exponentiation is that of a diagonal matrix. Since the product of diagonal matrices amounts to simply multiplying corresponding diagonal elements together, the th power of a diagonal matrix is obtained by raising the entries to the power :
:$\begin a_ & 0 & \cdots & 0 \\ 0 & a_ & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & a_ \end^k = \begin a_^k & 0 & \cdots & 0 \\ 0 & a_^k & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & a_^k \end.$

Abstract algebra

The definition of matrix product requires that the entries belong to a semiring, and does not require multiplication of elements of the semiring to be commutative. In many applications, the matrix elements belong to a field, although the tropical semiring is also a common choice for graph shortest path problems. Even in the case of matrices over fields, the product is not commutative in general, although it is associative and is distributive over matrix addition. The identity matrices (which are the square matrices whose entries are zero outside of the main diagonal and 1 on the main diagonal) are identity elements of the matrix product. It follows that the matrices over a ring form a ring, which is noncommutative except if and the ground ring is commutative.

A square matrix may have a multiplicative inverse, called an inverse matrix. In the common case where the entries belong to a commutative ring , a matrix has an inverse if and only if its determinant has a multiplicative inverse in . The determinant of a product of square matrices is the product of the determinants of the factors. The matrices that have an inverse form a group under matrix multiplication, the subgroups of which are called matrix groups. Many classical groups (including all finite groups) are isomorphic to matrix groups; this is the starting point of the theory of group representations.

Computational complexity

The matrix multiplication algorithm that results from the definition requires, in the worst case, multiplications and additions of scalars to compute the product of two square matrices. Its computational complexity is therefore , in a model of computation for which the scalar operations take constant time.

Rather surprisingly, this complexity is not optimal, as shown in 1969 by Volker Strassen, who provided an algorithm, now called Strassen's algorithm, with a complexity of $O( n^) \approx O(n^).$

Strassen's algorithm can be parallelized to further improve the performance.
, the best matrix multiplication algorithm is by Josh Alman and Virginia Vassilevska Williams and has complexity .

It is not known whether matrix multiplication can be performed in time. This would be optimal, since one must read the elements of a matrix in order to multiply it with another matrix.

Since matrix multiplication forms the basis for many algorithms, and many operations on matrices even have the same complexity as matrix multiplication (up to a multiplicative constant), the computational complexity of matrix multiplication appears throughout numerical linear algebra and theoretical computer science.

Generalizations

Other types of products of matrices include:
* Block matrix multiplication
* Cracovian product, defined as
*Frobenius inner product, the dot product of matrices considered as vectors, or, equivalently the sum of the entries of the Hadamard product
* Hadamard product of two matrices of the same size, resulting in a matrix of the same size, which is the product entry-by-entry
*Kronecker product or tensor product, the generalization to any size of the preceding
* Khatri-Rao product and Face-splitting product
* Outer product, also called dyadic product or tensor product of two column matrices, which is $\mathbf\mathbf^\mathsf$
*Scalar multiplication

See also

*Matrix calculus, for the interaction of matrix multiplication with operations from calculus

Notes

References

* Henry Cohn, Robert Kleinberg, Balázs Szegedy, and Chris Umans. Group-theoretic Algorithms for Matrix Multiplication. . ''Proceedings of the 46th Annual Symposium on Foundations of Computer Science'', 23–25 October 2005, Pittsburgh, PA, IEEE Computer Society, pp. 379–388.
* Henry Cohn, Chris Umans. A Group-theoretic Approach to Fast Matrix Multiplication. . ''Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science'', 11–14 October 2003, Cambridge, MA, IEEE Computer Society, pp. 438–449.
*
*
* Knuth, D.E., ''The Art of Computer Programming Volume 2: Seminumerical Algorithms''. Addison-Wesley Professional; 3 edition (November 14, 1997). . pp. 501.
* .
* Ran Raz. On the complexity of matrix product. In Proceedings of the thirty-fourth annual ACM symposium on Theory of computing. ACM Press, 2002. .
* Robinson, Sara, ''Toward an Optimal Algorithm for Matrix Multiplication,'' SIAM News 38(9), November 2005
PDF
* Strassen, Volker, ''Gaussian Elimination is not Optimal'', Numer. Math. 13, p. 354-356, 1969.
*
*

{{Linear algebra

Matrix theory
Bilinear maps
Multiplication
Numerical linear algebra