Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

Signature matrix

From Wikipedia, the free encyclopedia

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

Properties

[edit]

Any signature matrix is its own inverse, hence it is an involutory matrix. It is consequently a square root of the identity matrix.

Since signature matrices are both symmetric and involutory, they are 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.

If is an n × n signature matrix, then:

  • The determinant of is either 1 or -1 (since it is diagonal), and
  • (since the diagonal values are either -1 or 1).

See also

[edit]

References

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