Zero matrix

In mathematics, particularly linear algebra, a zero matrix or null matrix is a matrix all of whose entries are zero. It also serves as the additive identity of the additive group of $m \times n$ matrices, and is denoted by the symbol $O$ or $0$ followed by subscripts corresponding to the dimension of the matrix as the context sees fit. Some examples of zero matrices are

$0_{1, 1} = [\begin{matrix} 0 \end{matrix}], 0_{2, 2} = [\begin{matrix} 0 & 0 \\ 0 & 0 \end{matrix}], 0_{2, 3} = [\begin{matrix} 0 & 0 & 0 \\ 0 & 0 & 0 \end{matrix}] .$

Properties

The set of $m \times 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{matrix} 0_{K} & 0_{K} & \dots & 0_{K} \\ 0_{K} & 0_{K} & \dots & 0_{K} \\ ⋮ & ⋮ & ⋱ & ⋮ \\ 0_{K} & 0_{K} & \dots & 0_{K} \end{matrix}]}_{m \times n}$

The zero matrix is the additive identity in $K_{m, n}$ . That is, for all $A \in K_{m, n}$ it satisfies the equation $0_{K_{m, n}} + A = A + 0_{K_{m, n}} = A .$

There is exactly one zero matrix of any given dimension ⁠ $m \times n$ ⁠ with entries from 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 is typically denoted by 0 without any subscript indicating the parent ring. Hence the examples above represent zero matrices over any ring.

The zero matrix also represents the linear transformation which sends all the vectors to the zero vector. It is idempotent, meaning that when it is multiplied by itself, the result is itself.

The zero matrix is the only matrix whose rank is 0.

Occurrences

In ordinary least squares regression, if there is a perfect fit to the data, the annihilator matrix is the zero matrix.

References

↑ Lang, Serge (1987), Linear Algebra, Undergraduate Texts in Mathematics, Springer, p. 25, ISBN 9780387964126, We have a zero matrix in which ⁠ $a_{i j} = 0$ ⁠ for all ⁠ $i, j$ ⁠. ... We shall write it ⁠ $O$ ⁠.
↑ "Intro to zero matrices", Matrices, Khan Academy, retrieved 2020-08-13
↑ Weisstein, Eric W., "Zero Matrix", MathWorld
↑ 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.
↑ 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) = 𝟘$ ⁠ for every vector ⁠ $v \in V$ ⁠.

[1] Lang, Serge (1987), Linear Algebra, Undergraduate Texts in Mathematics, Springer, p. 25, ISBN 9780387964126, We have a zero matrix in which ⁠ $a_{i j} = 0$ ⁠ for all ⁠ $i, j$ ⁠. ... We shall write it ⁠ $O$ ⁠.

[2] "Intro to zero matrices", Matrices, Khan Academy, retrieved 2020-08-13

[3] Weisstein, Eric W., "Zero Matrix", MathWorld

[4] 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.

[5] 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) = 𝟘$ ⁠ for every vector ⁠ $v \in V$ ⁠.

v t e Matrix classes
Explicitly constrained entries	Alternant Anti-diagonal Anti-Hermitian Anti-symmetric Arrowhead Band Bidiagonal Bisymmetric Block-diagonal Block Block tridiagonal Boolean Cauchy Centrosymmetric Conference Complex Hadamard Copositive Diagonally dominant Diagonal Discrete Fourier Transform Elementary Equivalent Frobenius Generalized permutation Hadamard Hankel Hermitian Hessenberg Hollow Integer Logical Matrix unit Metzler Moore Nonnegative Pentadiagonal Permutation Persymmetric Polynomial Quaternionic Signature Skew-Hermitian Skew-symmetric Skyline Sparse Sylvester Symmetric Toeplitz Triangular Tridiagonal Vandermonde Walsh Z
Constant	Exchange Hilbert Identity Lehmer Of ones Pascal Pauli Redheffer Shift Zero
Conditions on eigenvalues or eigenvectors	Companion Convergent Defective Definite Diagonalizable Hurwitz-stable Positive-definite Stieltjes
Satisfying conditions on products or inverses	Congruent Idempotent or Projection Invertible Involutory Nilpotent Normal Orthogonal Unimodular Unipotent Unitary Totally unimodular Weighing
With specific applications	Adjugate Alternating sign Augmented Bézout Jabotinsky Cartan Circulant Cofactor Commutation Confusion Coxeter Distance Duplication and elimination Euclidean distance Fundamental (linear differential equation) Generator Gram Hessian Householder Jacobian Moment Payoff Pick Random Rotation Routh-Hurwitz Seifert Shear Similarity Symplectic Totally positive Transformation
Used in statistics	Centering Correlation Covariance Design Doubly stochastic Fisher information Hat Precision Stochastic Transition
Used in graph theory	Adjacency Biadjacency Degree Edmonds Incidence Laplacian Seidel adjacency Tutte
Used in science and engineering	Cabibbo–Kobayashi–Maskawa Density Fundamental (computer vision) Fuzzy associative Gamma Gell-Mann Hamiltonian Irregular Overlap S State transition Substitution Z (chemistry)
Related terms	Jordan normal form Linear independence Matrix exponential Matrix representation of conic sections Perfect matrix Pseudoinverse Row echelon form Wronskian
Mathematics portal List of matrices Category:Matrices (mathematics)

Zero matrix

Properties

Occurrences

See also

References