Signature matrix

In mathematics, a signature matrix is a diagonal matrix whose diagonal elements are plus or minus 1, that is, any matrix of the form:[1]

A = ( ± 1 0 0 0 0 ± 1 0 0 0 0 ± 1 0 0 0 0 ± 1 ) {\displaystyle A={\begin{pmatrix}\pm 1&0&\cdots &0&0\\0&\pm 1&\cdots &0&0\\\vdots &\vdots &\ddots &\vdots &\vdots \\0&0&\cdots &\pm 1&0\\0&0&\cdots &0&\pm 1\end{pmatrix}}}

Any such matrix is its own inverse, hence is an involutory matrix. It is consequently a square root of the identity matrix. Note however that not all square roots of the identity are signature matrices.

Noting that signature matrices are both symmetric and involutory, they are thus orthogonal. Consequently, any linear transformation corresponding to a signature matrix constitutes an isometry.

Geometrically, signature matrices represent a reflection in each of the axes corresponding to the negated rows or columns.

Properties

If A is a matrix of N*N then:

  • N tr ( A ) N {\displaystyle -N\leq \operatorname {tr} (A)\leq N} (Due to the diagonal values being -1 or 1)
  • The Determinant of A is either 1 or -1 (Due to it being diagonal)

See also

  • Metric signature
  • Signature (matrix)

References

  1. ^ Bapat, R. B. (2010), Graphs and matrices, Universitext, London: Springer, p. 40, doi:10.1007/978-1-84882-981-7, ISBN 978-1-84882-980-0, MR 2797201.
  • v
  • t
  • e
Matrix classes
Explicitly constrained entriesConstantConditions on eigenvalues or eigenvectorsSatisfying conditions on products or inversesWith specific applicationsUsed in statisticsUsed in graph theoryUsed in science and engineeringRelated terms


Stub icon

This article about matrices is a stub. You can help Wikipedia by expanding it.

  • v
  • t
  • e