Exchange matrix

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Template:Short description

In mathematics, especially linear algebra, the exchange matrices (also called the reversal matrix, backward identity, or standard involutory permutation) are special cases of permutation matrices, where the 1 elements reside on the antidiagonal and all other elements are zero. In other words, they are 'row-reversed' or 'column-reversed' versions of the identity matrix.[1]

J2=(0110)J3=(001010100)Jn=(00010010j˙01001000)

Definition

If Template:Mvar is an n × nScript error: No such module "Check for unknown parameters". exchange matrix, then the elements of Template:Mvar are Ji,j={1,i+j=n+10,i+jn+1

Properties

its eigenvalues are 1 (with multiplicity n/2) and -1 (with multiplicity n/2).

Relationships

  • An exchange matrix is the simplest anti-diagonal matrix.
  • Any matrix Template:Mvar satisfying the condition AJ = JAScript error: No such module "Check for unknown parameters". is said to be centrosymmetric.
  • Any matrix Template:Mvar satisfying the condition AJ = JATScript error: No such module "Check for unknown parameters". is said to be persymmetric.
  • Symmetric matrices Template:Mvar that satisfy the condition AJ = JAScript error: No such module "Check for unknown parameters". are called bisymmetric matrices. Bisymmetric matrices are both centrosymmetric and persymmetric.

See also

  • Pauli matrices (the first Pauli matrix is a 2 × 2 exchange matrix)

References

<templatestyles src="Reflist/styles.css" />

  1. Script error: No such module "citation/CS1"..

Script error: No such module "Check for unknown parameters".

Template:Matrix classes