Matrix ring explained

In abstract algebra, a matrix ring is a set of matrices with entries in a ring R that form a ring under matrix addition and matrix multiplication. The set of all matrices with entries in R is a matrix ring denoted Mn(R) (alternative notations: Matn(R) and). Some sets of infinite matrices form infinite matrix rings. A subring of a matrix ring is again a matrix ring. Over a rng, one can form matrix rngs.

When R is a commutative ring, the matrix ring Mn(R) is an associative algebra over R, and may be called a matrix algebra. In this setting, if M is a matrix and r is in R, then the matrix rM is the matrix M with each of its entries multiplied by r.

Examples

CFMI(R)

of column finite matrices whose entries are indexed by and whose columns each contain only finitely many nonzero entries. The ring of endomorphisms of M considered as a left R-module is isomorphic to the ring

RFMI(R)

of row finite matrices.

RCFMI(R)

.

\subseteq

B(H) is a unital C*-algebra, we can break up A into a matrix ring over a smaller C*-algebra. One can do so by fixing a projection p and hence its orthogonal projection 1 − p; one can identify A with \begin pAp & pA(1-p) \\ (1-p)Ap & (1-p)A(1-p) \end, where matrix multiplication works as intended because of the orthogonality of the projections. In order to identify A with a matrix ring over a C*-algebra, we require that p and 1 − p have the same "rank"; more precisely, we need that p and 1 − p are Murray–von Neumann equivalent, i.e., there exists a partial isometry u such that and . One can easily generalize this to matrices of larger sizes.

Structure

CFMI(D)

and

RFMI(D)

are not simple and not Artinian if the set I is infinite, but they are still full linear rings.

Properties

\begin{bmatrix} 1&0\\ 0&0\end{bmatrix} \begin{bmatrix} 1&1\\ 0&0 \end{bmatrix} = \begin{bmatrix} 1&1\\ 0&0 \end{bmatrix}

and

\begin{bmatrix} 1&1\\ 0&0\end{bmatrix} \begin{bmatrix} 1&0\\ 0&0 \end{bmatrix} = \begin{bmatrix} 1&0\\ 0&0 \end{bmatrix}.

\begin{bmatrix} 0&1\\ 0&0\end{bmatrix} \begin{bmatrix} 0&1\\ 0&0 \end{bmatrix} = \begin{bmatrix} 0&0\\ 0&0 \end{bmatrix}.

Matrix semiring

In fact, R needs to be only a semiring for Mn(R) to be defined. In this case, Mn(R) is a semiring, called the matrix semiring. Similarly, if R is a commutative semiring, then Mn(R) is a .

For example, if R is the Boolean semiring (the two-element Boolean algebra with), then Mn(R) is the semiring of binary relations on an n-element set with union as addition, composition of relations as multiplication, the empty relation (zero matrix) as the zero, and the identity relation (identity matrix) as the unity.

See also

References

Notes and References

  1. Lecture VII of Sir William Rowan Hamilton (1853) Lectures on Quaternions, Hodges and Smith