In mathematics, the category of matrices, often denoted ${\displaystyle \mathbf {Mat} }$, is the category whose objects are natural numbers and whose morphisms are matrices, with composition given by matrix multiplication.^[1][2]

Let ${\displaystyle A}$ be an ${\displaystyle n\times m}$ real matrix, i.e. a matrix with ${\displaystyle n}$ rows and ${\displaystyle m}$ columns. Given a ${\displaystyle p\times q}$ matrix ${\displaystyle B}$, we can form the matrix multiplication ${\displaystyle BA}$ or ${\displaystyle B\circ A}$ only when ${\displaystyle q=n}$, and in that case the resulting matrix is of dimension ${\displaystyle p\times m}$.

In other words, we can only multiply matrices ${\displaystyle A}$ and ${\displaystyle B}$ when the number of rows of ${\displaystyle A}$ matches the number of columns of ${\displaystyle B}$. One can keep track of this fact by declaring an ${\displaystyle n\times m}$ matrix to be of type ${\displaystyle m\to n}$, and similarly a ${\displaystyle p\times q}$ matrix to be of type ${\displaystyle q\to p}$. This way, when ${\displaystyle q=n}$ the two arrows have matching source and target, ${\displaystyle m\to n\to p}$, and can hence be composed to an arrow of type ${\displaystyle m\to p}$.

This is precisely captured by the mathematical concept of a category, where the arrows, or morphisms, are the matrices, and they can be composed only when their domain and codomain are compatible (similar to what happens with functions). In detail, the category ${\displaystyle \mathbf {Mat} _{\mathbb {R} ))$ is constructed as follows:

• It has natural numbers as objects;

• Given numbers ${\displaystyle m}$ and ${\displaystyle n}$, a morphism ${\displaystyle m\to n}$ is an ${\displaystyle n\times m}$ matrix, i.e. a matrix with ${\displaystyle n}$ rows and ${\displaystyle m}$ columns;

• The identity morphism at each object ${\displaystyle n}$ is given by the ${\displaystyle n\times n}$ identity matrix;

• The composition of morphisms ${\displaystyle A:m\to n}$ and ${\displaystyle B:n\to p}$ (i.e. of matrices ${\displaystyle n\times m}$ and ${\displaystyle p\times n}$) is given by matrix multiplication.

More generally, one can define the category ${\displaystyle \mathbf {Mat} _{\mathbb {F} ))$ of matrices over a fixed field ${\displaystyle \mathbb {F} }$, such as the one of complex numbers.

• The category of matrices ${\displaystyle \mathbf {Mat} _{\mathbb {R} ))$ is equivalent to the category of finite-dimensional real vector spaces and linear maps. This is witnessed by the functor mapping the number ${\displaystyle n}$ to the vector space ${\displaystyle \mathbb {R} ^{n))$, and an ${\displaystyle n\times m}$ matrix to the corresponding linear map ${\displaystyle \mathbb {R} ^{m}\to \mathbb {R} ^{n))$.^[3][2] A possible interpretation of this fact is that, as mathematical theories, abstract finite-dimensional vector spaces and concrete matrices have the same expressive power.

• More generally, the category of matrices ${\displaystyle \mathbf {Mat} _{\mathbb {F} ))$ is equivalent to the category of finite-dimensional vector spaces over the field ${\displaystyle \mathbb {F} }$ and ${\displaystyle \mathbb {F} }$-linear maps.^[3]

• A linear row operation on a ${\displaystyle n\times m}$ matrix ${\displaystyle A}$ can be equivalently obtained by applying the same operation to the ${\displaystyle n\times n}$ identity matrix, and then multiplying the resulting ${\displaystyle n\times n}$ matrix with ${\displaystyle A}$. In particular, elementary row operations correspond to elementary matrices. This fact can be seen as an instance of the Yoneda lemma for the category of matrices.^[4][5]

• The transpose operation makes the category of matrices a dagger category. The same can be said about the conjugate transpose in the case of complex numbers.

• For every fixed ${\displaystyle n}$, the morphisms ${\displaystyle n\to n}$ of ${\displaystyle \mathbf {Mat} _{\mathbb {R} ))$ are the ${\displaystyle n\times n}$ matrices, and form a monoid, canonically isomorphic to the monoid of linear endomorphisms of ${\displaystyle \mathbb {R} ^{n))$. In particular, the invertible ${\displaystyle n\times n}$ matrices form a group. The same can be said for a generic field ${\displaystyle \mathbb {F} }$.

• A stochastic matrix is a real matrix of nonnegative entries, such that the sum of each column is one. Stochastic matrices include the identity and are closed under composition, and so they form a subcategory of ${\displaystyle \mathbf {Mat} _{\mathbb {R} ))$.^[6]

• The Yoneda lemma in the category of matrices, tutorial video.