Category of matrices

From testwiki
Jump to navigation Jump to search

Template:Onesource Template:Short description

In mathematics, the category of matrices, often denoted 𝐌𝐚𝐭, is the category whose objects are natural numbers and whose morphisms are matrices, with composition given by matrix multiplication.[1][2]

Construction

Let A be an nΓ—m real matrix, i.e. a matrix with n rows and m columns. Given a pΓ—q matrix B, we can form the matrix multiplication BA or B∘A only when q=n, and in that case the resulting matrix is of dimension pΓ—m.

In other words, we can only multiply matrices A and B when the number of rows of A matches the number of columns of B. One can keep track of this fact by declaring an n×m matrix to be of type m→n, and similarly a p×q matrix to be of type q→p. This way, when q=n the two arrows have matching source and target, m→n→p, and can hence be composed to an arrow of type m→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 πŒπšπ­β„ is constructed as follows:

  • Given numbers m and n, a morphism mβ†’n is an nΓ—m matrix, i.e. a matrix with n rows and m columns;
  • The composition of morphisms A:mβ†’n and B:nβ†’p (i.e. of matrices nΓ—m and pΓ—n) is given by matrix multiplication.

More generally, one can define the category πŒπšπ­π”½ of matrices over a fixed field 𝔽, such as the one of complex numbers.

Properties

  • The category of matrices πŒπšπ­β„ is equivalent to the category of finite-dimensional real vector spaces and linear maps. This is witnessed by the functor mapping the number n to the vector space ℝn, and an nΓ—m matrix to the corresponding linear map ℝm→ℝ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 πŒπšπ­π”½ is equivalent to the category of finite-dimensional vector spaces over the field 𝔽 and 𝔽-linear maps.[3]
  • A linear row operation on a nΓ—m matrix A can be equivalently obtained by applying the same operation to the nΓ—n identity matrix, and then multiplying the resulting nΓ—n matrix with 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]

Particular subcategories

  • For every fixed n, the morphisms nβ†’n of πŒπšπ­β„ are the nΓ—n matrices, and form a monoid, canonically isomorphic to the monoid of linear endomorphisms of ℝn. In particular, the invertible nΓ—n matrices form a group. The same can be said for a generic field 𝔽.
  • 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 πŒπšπ­β„.[6]

Citations

Template:Reflist

References

Template:Refbegin

Template:Refend