Inmathematics, aninteger matrix is amatrix whose entries are allintegers. Examples includebinary matrices, thezero matrix, thematrix of ones, theidentity matrix, and theadjacency matrices used ingraph theory, amongst many others. Integer matrices find frequent application incombinatorics.
are both examples of integer matrices.
Invertibility of integer matrices is in general more numerically stable than that of non-integer matrices. Thedeterminant of an integer matrix is itself an integer, and theadjugate matrix of an integer matrix is also integer matrix. Thus, the determinant of an invertible integer matrix is or, and hence where inverses exist they do not become excessively large (seecondition number). Theorems frommatrix theory that infer properties from determinants thus avoid the traps induced byill conditioned (nearly zero determinant)real orfloating point valued matrices.
The inverse of an integer matrix is again an integer matrix if and only if the determinant of equals or.[1] Integer matrices of determinant form thegroup, which has far-reaching applications in arithmetic andgeometry. For, it is closely related to themodular group.
The intersection of the integer matrices with theorthogonal group is the group ofsigned permutation matrices.
Thecharacteristic polynomial of an integer matrix has integer coefficients. Since theeigenvalues of a matrix are theroots of this polynomial, the eigenvalues of an integer matrix arealgebraic integers. In dimensionless than 5, they can thus be expressed byradicals involving integers.
Integer matrices are sometimes calledintegral matrices, although this use is discouraged.