Zero matrix

In mathematics, particularly linear algebra, a zero matrix or null matrix is a matrix with all its entries being zero.[1] Some examples of zero matrices are

0_{1,1} = \begin{bmatrix} 0 \end{bmatrix} ,\ 0_{2,2} = \begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix} ,\ 0_{2,3} = \begin{bmatrix} 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix} .\

The set of m×n matrices with entries in a ring K forms a ring K_{m,n} \,. The zero matrix 0_{K_{m,n}} \, in K_{m,n} \, is the matrix with all entries equal to 0_K \, , where 0_K \, is the additive identity in K.

0_{K_{m,n}} = \begin{bmatrix} 0_K & 0_K & \cdots & 0_K \\ 0_K & 0_K & \cdots & 0_K \\ \vdots & \vdots & \ddots & \vdots \\ 0_K & 0_K & \cdots & 0_K \end{bmatrix}_{m \times n}

The zero matrix is the additive identity in K_{m,n} \, .[2] That is, for all A \in K_{m,n} \, it satisfies

0_{K_{m,n}}+A = A + 0_{K_{m,n}} = A.

There is exactly one zero matrix of any given size m×n having entries in a given ring, so when the context is clear one often refers to the zero matrix. In general the zero element of a ring is unique and typically denoted as 0 without any subscript indicating the parent ring. Hence the examples above represent zero matrices over any ring.

The zero matrix represents the linear transformation sending all vectors to the zero vector.[3]

See also

References

  1. ↑ Lang, Serge (1987), Linear Algebra, Undergraduate Texts in Mathematics, Springer, p. 25, ISBN 9780387964126, We have a zero matrix in which aij = 0 for all i, j. ... We shall write it O.
  2. ↑ Warner, Seth (1990), Modern Algebra, Courier Dover Publications, p. 291, ISBN 9780486663418, The neutral element for addition is called the zero matrix, for all of its entries are zero.
  3. ↑ Bronson, Richard; Costa, Gabriel B. (2007), Linear Algebra: An Introduction, Academic Press, p. 377, ISBN 9780120887842, The zero matrix represents the zero transformation 0, having the property 0(v) = 0 for every vector v ∈ V.

External links