Signature matrix - Wikipedia

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={\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[edit]

If A is a matrix of N*N then:

$-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)

References[edit]

^ 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 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 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 Carleman 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 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

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

Properties[edit]

See also[edit]

References[edit]