Exchange matrix

Last updated December 03, 2023

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]

{\begin{aligned}J_{2}&={\begin{pmatrix}0&1\\1&0\end{pmatrix}}\\[4pt]J_{3}&={\begin{pmatrix}0&0&1\\0&1&0\\1&0&0\end{pmatrix}}\\&\quad \vdots \\[2pt]J_{n}&={\begin{pmatrix}0&0&\cdots &0&1\\0&0&\cdots &1&0\\\vdots &\vdots &\,{}_{_{\displaystyle \cdot }}\!\,{}^{_{_{\displaystyle \cdot }}}\!{\dot {\phantom {j}}}&\vdots &\vdots \\0&1&\cdots &0&0\\1&0&\cdots &0&0\end{pmatrix}}\end{aligned}}

Definition

If $J$ is an $n \times n$ exchange matrix, then the elements of $J$ are

J_{i,j}={\begin{cases}1,&i+j=n+1\\0,&i+j\neq n+1\\\end{cases}}

Properties

Premultiplying a matrix by an exchange matrix flips vertically the positions of the former's rows, i.e., ${\begin{pmatrix}0&0&1\\0&1&0\\1&0&0\end{pmatrix}}{\begin{pmatrix}1&2&3\\4&5&6\\7&8&9\end{pmatrix}}={\begin{pmatrix}7&8&9\\4&5&6\\1&2&3\end{pmatrix}}.$
Postmultiplying a matrix by an exchange matrix flips horizontally the positions of the former's columns, i.e., ${\begin{pmatrix}1&2&3\\4&5&6\\7&8&9\end{pmatrix}}{\begin{pmatrix}0&0&1\\0&1&0\\1&0&0\end{pmatrix}}={\begin{pmatrix}3&2&1\\6&5&4\\9&8&7\end{pmatrix}}.$
Exchange matrices are symmetric; that is: $J_{n}^{\mathsf {T}}=J_{n}.$
For any integer $k$ : $J_{n}^{k}={\begin{cases}I&{\text{ if }}k{\text{ is even,}}\\[2pt]J_{n}&{\text{ if }}k{\text{ is odd.}}\end{cases}}$ In particular, $J n$ is an involutory matrix; that is, $J_{n}^{-1}=J_{n}.$
The trace of $J n$ is 1 if $n$ is odd and 0 if $n$ is even. In other words: $\operatorname {tr} (J_{n})=n{\bmod {2}}.$
The determinant of $J n$ is: $\det(J_{n})=(-1)^{\frac {n(n-1)}{2}}$ As a function of $n$ , it has period 4, giving 1, 1, −1, −1 when $n$ is congruent modulo 4 to 0, 1, 2, and 3 respectively.
The characteristic polynomial of $J n$ is: $\det(\lambda I-J_{n})={\begin{cases}{\big [}(\lambda +1)(\lambda -1){\big ]}^{\frac {n}{2}}&{\text{ if }}n{\text{ is even,}}\\[4pt](\lambda -1)^{\frac {n+1}{2}}(\lambda +1)^{\frac {n-1}{2}}&{\text{ if }}n{\text{ is odd.}}\end{cases}}$
The adjugate matrix of $J n$ is: $\operatorname {adj} (J_{n})=\operatorname {sgn}(\pi _{n})J_{n}.$ (where $sgn$ is the sign of the permutation $π k$ of $k$ elements).

Relationships

An exchange matrix is the simplest anti-diagonal matrix.
Any matrix $A$ satisfying the condition $AJ = JA$ is said to be centrosymmetric.
Any matrix $A$ satisfying the condition $AJ = JA T$ is said to be persymmetric.
Symmetric matrices $A$ that satisfy the condition $AJ = JA$ are called bisymmetric matrices. Bisymmetric matrices are both centrosymmetric and persymmetric.

Related Research Articles

In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. The determinant of a matrix $A$ is commonly denoted $det(A)$ , $det A$ , or $| A |$ . Its value characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (which follows directly from the above properties).

In mathematical physics and mathematics, the Pauli matrices are a set of three $2 \times 2$ complex matrices which are Hermitian, involutory and unitary. Usually indicated by the Greek letter sigma, they are occasionally denoted by tau when used in connection with isospin symmetries.

In linear algebra, the Cayley–Hamilton theorem states that every square matrix over a commutative ring satisfies its own characteristic equation.

In mathematics, the special unitary group of degree $n$ , denoted $SU(n)$ , is the Lie group of $n \times n$ unitary matrices with determinant 1.

In mathematics, particularly in linear algebra, a skew-symmetricmatrix is a square matrix whose transpose equals its negative. That is, it satisfies the condition

In mathematics, a Hermitian matrix is a complex square matrix that is equal to its own conjugate transpose—that is, the element in the $i$ -th row and $j$ -th column is equal to the complex conjugate of the element in the $j$ -th row and $i$ -th column, for all indices $i$ and $j$ :

In linear algebra, an $n$ -by- $n$ square matrix $A$ is called invertible, if there exists an $n$ -by- $n$ square matrix $B$ such that

In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients. The characteristic polynomial of an endomorphism of a finite-dimensional vector space is the characteristic polynomial of the matrix of that endomorphism over any base. The characteristic equation, also known as the determinantal equation, is the equation obtained by equating the characteristic polynomial to zero.

In mathematics, scalar multiplication is one of the basic operations defining a vector space in linear algebra. In common geometrical contexts, scalar multiplication of a real Euclidean vector by a positive real number multiplies the magnitude of the vector without changing its direction. Scalar multiplication is the multiplication of a vector by a scalar, and is to be distinguished from inner product of two vectors.

In mathematics, the spectral radius of a square matrix is the maximum of the absolute values of its eigenvalues. More generally, the spectral radius of a bounded linear operator is the supremum of the absolute values of the elements of its spectrum. The spectral radius is often denoted by $ρ(\cdot)$ .

In mathematics, a block matrix or a partitioned matrix is a matrix that is interpreted as having been broken into sections called blocks or submatrices. Intuitively, a matrix interpreted as a block matrix can be visualized as the original matrix with a collection of horizontal and vertical lines, which break it up, or partition it, into a collection of smaller matrices. Any matrix may be interpreted as a block matrix in one or more ways, with each interpretation defined by how its rows and columns are partitioned.

In linear algebra, a tridiagonal matrix is a band matrix that has nonzero elements only on the main diagonal, the subdiagonal/lower diagonal, and the supradiagonal/upper diagonal. For example, the following matrix is tridiagonal:

In mathematics, the determinant of an m×m skew-symmetric matrix can always be written as the square of a polynomial in the matrix entries, a polynomial with integer coefficients that only depends on m. When m is odd, the polynomial is zero. When m is even, it is a nonzero polynomial of degree m/2, and is unique up to multiplication by ±1. The convention on skew-symmetric tridiagonal matrices, given below in the examples, then determines one specific polynomial, called the Pfaffian polynomial. The value of this polynomial, when applied to the entries of a skew-symmetric matrix, is called the Pfaffian of that matrix. The term Pfaffian was introduced by Cayley (1852), who indirectly named them after Johann Friedrich Pfaff.

In linear algebra, the Frobenius companion matrix of the monic polynomial

In linear algebra, a circulant matrix is a square matrix in which all row vectors are composed of the same elements and each row vector is rotated one element to the right relative to the preceding row vector. It is a particular kind of Toeplitz matrix.

In linear algebra, a generalized eigenvector of an $matrix is a vector which satisfies certain criteria which are more relaxed than those for an (ordinary) eigenvector.$

In mathematics, the polar decomposition of a square real or complex matrix $is a factorization of the form, where is a unitary matrix and is a positive semi-definite Hermitian matrix, both square and of the same size.$

In mathematics, a logarithm of a matrix is another matrix such that the matrix exponential of the latter matrix equals the original matrix. It is thus a generalization of the scalar logarithm and in some sense an inverse function of the matrix exponential. Not all matrices have a logarithm and those matrices that do have a logarithm may have more than one logarithm. The study of logarithms of matrices leads to Lie theory since when a matrix has a logarithm then it is in an element of a Lie group and the logarithm is the corresponding element of the vector space of the Lie algebra.

In the mathematical discipline of matrix theory, a Jordan matrix, named after Camille Jordan, is a block diagonal matrix over a ring $R$ , where each block along the diagonal, called a Jordan block, has the following form:

In mathematics, every analytic function can be used for defining a matrix function that maps square matrices with complex entries to square matrices of the same size.

References

↑ Horn, Roger A.; Johnson, Charles R. (2012), Matrix Analysis (2nd ed.), Cambridge University Press, p. 33, ISBN 9781139788885 .

This linear algebra-related article is a stub. You can help Wikipedia by expanding it.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Horn, Roger A.; Johnson, Charles R. (2012), Matrix Analysis (2nd ed.), Cambridge University Press, p. 33, ISBN 9781139788885 .

[1]

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
Mathematicsportal List of matrices Category:Matrices