Skew-Hermitian matrix

In linear algebra, a square matrix with complex entries is said to be skew-Hermitian or anti-Hermitian if its conjugate transpose is the negative of the original matrix.[1] That is, the matrix $A$ is skew-Hermitian if it satisfies the relation

$A{\text{ skew-Hermitian}}\quad \iff \quad A^{\mathsf {H}}=-A$

where $A^{\textsf {H}}$ denotes the conjugate transpose of the matrix $A$ . In component form, this means that

$A{\text{ skew-Hermitian}}\quad \iff \quad a_{ij}=-{\overline {a_{ji}}}$

for all indices $i$ and $j$ , where $a_{ij}$ is the element in the $i$ -th row and $j$ -th column of $A$ , and the overline denotes complex conjugation.

Skew-Hermitian matrices can be understood as the complex versions of real skew-symmetric matrices, or as the matrix analogue of the purely imaginary numbers.[2] The set of all skew-Hermitian $n\times n$ matrices forms the $u(n)$ Lie algebra, which corresponds to the Lie group U(n). The concept can be generalized to include linear transformations of any complex vector space with a sesquilinear norm.

Note that the adjoint of an operator depends on the scalar product considered on the $n$ dimensional complex or real space $K^{n}$ . If $(\cdot \mid \cdot )$ denotes the scalar product on $K^{n}$ , then saying $A$ is skew-adjoint means that for all $\mathbf {u} ,\mathbf {v} \in K^{n}$ one has $(A\mathbf {u} \mid \mathbf {v} )=-(\mathbf {u} \mid A\mathbf {v} )$ .

Imaginary numbers can be thought of as skew-adjoint (since they are like $1\times 1$ matrices), whereas real numbers correspond to self-adjoint operators.

Example

For example, the following matrix is skew-Hermitian

A={\begin{bmatrix}-i&+2+i\\-2+i&0\end{bmatrix}}

because

-A={\begin{bmatrix}i&-2-i\\2-i&0\end{bmatrix}}={\begin{bmatrix}{\overline {-i}}&{\overline {-2+i}}\\{\overline {2+i}}&{\overline {0}}\end{bmatrix}}={\begin{bmatrix}{\overline {-i}}&{\overline {2+i}}\\{\overline {-2+i}}&{\overline {0}}\end{bmatrix}}^{\mathsf {T}}=A^{\mathsf {H}}

Properties

The eigenvalues of a skew-Hermitian matrix are all purely imaginary (and possibly zero). Furthermore, skew-Hermitian matrices are normal. Hence they are diagonalizable and their eigenvectors for distinct eigenvalues must be orthogonal.[3]
All entries on the main diagonal of a skew-Hermitian matrix have to be pure imaginary; i.e., on the imaginary axis (the number zero is also considered purely imaginary).[4]
If $A$ and $B$ are skew-Hermitian, then $aA+bB$ is skew-Hermitian for all real scalars $a$ and $b$ .[5]
$A$ is skew-Hermitian if and only if $iA$ (or equivalently, $-iA$ ) is Hermitian.[5]
$A$ is skew-Hermitian if and only if the real part $\Re {(A)}$ is skew-symmetric and the imaginary part $\Im {(A)}$ is symmetric.
If $A$ is skew-Hermitian, then $A^{k}$ is Hermitian if $k$ is an even integer and skew-Hermitian if $k$ is an odd integer.
$A$ is skew-Hermitian if and only if $\mathbf {x} ^{\mathsf {H}}A\mathbf {y} =-\mathbf {y} ^{\mathsf {H}}A\mathbf {x}$ for all vectors $\mathbf {x} ,\mathbf {y}$ .
If $A$ is skew-Hermitian, then the matrix exponential $e^{A}$ is unitary.
The space of skew-Hermitian matrices forms the Lie algebra $u(n)$ of the Lie group $U(n)$ .

Decomposition into Hermitian and skew-Hermitian

The sum of a square matrix and its conjugate transpose $\left(A+A^{\mathsf {H}}\right)$ is Hermitian.
The difference of a square matrix and its conjugate transpose $\left(A-A^{\mathsf {H}}\right)$ is skew-Hermitian. This implies that the commutator of two Hermitian matrices is skew-Hermitian.
An arbitrary square matrix $C$ can be written as the sum of a Hermitian matrix $A$ and a skew-Hermitian matrix $B$ : $C=A+B\quad {\mbox{with}}\quad A={\frac {1}{2}}\left(C+C^{\mathsf {H}}\right)\quad {\mbox{and}}\quad B={\frac {1}{2}}\left(C-C^{\mathsf {H}}\right)$

Notes

Horn & Johnson (1985), §4.1.1; Meyer (2000), §3.2
Horn & Johnson (1985), §4.1.2
Horn & Johnson (1985), §2.5.2, §2.5.4
Meyer (2000), Exercise 3.2.5
Horn & Johnson (1985), §4.1.1

References

Horn, Roger A.; Johnson, Charles R. (1985), Matrix Analysis, Cambridge University Press, ISBN 978-0-521-38632-6.
Meyer, Carl D. (2000), Matrix Analysis and Applied Linear Algebra, SIAM, ISBN 978-0-89871-454-8.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Horn & Johnson (1985), §4.1.1; Meyer (2000), §3.2

[HJ85S412-2] Horn & Johnson (1985), §4.1.2

[3] Horn & Johnson (1985), §2.5.2, §2.5.4

[4] Meyer (2000), Exercise 3.2.5

[HJ85S411-5] Horn & Johnson (1985), §4.1.1

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