Skew-symmetric matrix: Information from Answers.com

This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. Please improve this article by introducing more precise citations where appropriate. (November 2009)

In mathematics, and in particular linear algebra, a skew-symmetric (or antisymmetric or antimetric^[1]) matrix is a square matrix A whose transpose is also its negative; that is, it satisfies the equation A = −A^T. If the entry in the i ^th row and j ^th column is a_ij, i.e. A = (a_ij) then the symmetric condition becomes a_ij = −a_ji. For example, the following matrix is skew-symmetric:

$\begin{bmatrix} 0 & 2 & -1 \\ -2 & 0 & -4 \\ 1 & 4 & 0\end{bmatrix}.$

1 Properties
- 1.1 Determinant
- 1.2 Spectral theory
2 Alternating forms
3 Infinitesimal rotations
4 See also
5 References
6 External links

Properties

We assume that the the underlying field is not of characteristic 2: that is, that 1 + 1 ≠ 0 where 1 denotes the multiplicative identity and 0 the additive identity of the given field. Otherwise, a skew-symmetric matrix is just the same thing as a symmetric matrix.

Sums and scalar multiples of skew-symmetric matrices are again skew-symmetric. Hence, the skew-symmetric matrices form a vector space. Its dimension is n(n−1)/2.

Let Mat_n denote the space of n × n matrices. A skew-symmetric matrix is determined by n(n − 1)/2 scalars (the number of entries above the main diagonal); a symmetric matrix is determined by n(n + 1)/2 scalars (the number of entries on or above the main diagonal). If Skew_n denotes the space of n × n skew-symmetric matrices and Sym_n denotes the space of n × n symmetric matrices and then since Mat_n = Skew_n + Sym_n and Skew_n ∩ Sym_n = {0}, i.e.

$\mbox{Mat}_n = \mbox{Skew}_n \oplus \mbox{Sym}_n ,$

where ⊕ denotes the direct sum. Let A ∈ Mat_n then

$A = \frac{1}{2}(A - A^{\top}) + \frac{1}{2}(A + A^{\top}) .$

Notice that ½(A − A^T) ∈ Skew_n and ½(A + A^T) ∈ Sym_n. This is true for every square matrix A with entries from any field whose characteristic is different from 2.

As to equivalent conditions, notice that the relation of skew-symmetricity, A=-A^T, holds for a matrix A if and only if one has x^TAy =-y^TAx for all vectors x and y. This is also equivalent to x^TAx=0 for all x (one implication being obvious, the other a plain consequence of (x+y)^TA(x+y)=0 for all x and y).

All main diagonal entries of a skew-symmetric matrix must be zero, so the trace is zero. If A = (a_ij) is skew-symmetric, a_ij = −a_ij; hence a_ij = 0.

Determinant

Let A be a n×n skew-symmetric matrix. The determinant of A satisfies

det(A) = det(A^T) = det(−A) = (−1)ⁿdet(A). Hence det(A) = 0 when n is odd.

In particular, if n is odd, and since the underlying field is not of characteristic 2, the determinant vanishes. This result is called Jacobi's theorem, after Carl Gustav Jacobi (Eves, 1980).

The even-dimensional case is more interesting. It turns out that the determinant of A for n even can be written as the square of a polynomial in the entries of A (Theorem by Thomas Muir):

det(A) = Pf(A)².

This polynomial is called the Pfaffian of A and is denoted Pf(A). Thus the determinant of a real skew-symmetric matrix is always non-negative.

The number of terms s(n) in the expansion of a skew-symmetric matrix of order n has been considered already by Cayley, Sylvester, and Pfaff. Due to cancellations, this number is quite small as compared the number of terms of a generic matrix of order n, which is n!. The sequence s(n) (sequence A002370 in OEIS) is

1, 0, 2, 0, 6, 0, 120, 0, 5250, 0, 395010, 0, …

and it is encoded in the exponential generating function

$\sum_{n=0}^\infty \frac{s(n)}{n!}x^n=(1-x^2)^{-\frac{1}{4}}\exp\left(\frac{x^2}{4}\right).$

The latter yields to the asymptotics (for n even)

$s(n)=\pi^ {-\frac{1}{2} } 2^ {\frac{3}{4}} \Gamma\left (3/4 \right) (n/e)^ {n-\frac{1}{4} } \left (1+O\big(\frac{1}{n}\big)\right).$

The number of positive and negative terms are approximatively a half of the total, although their difference takes larger and larger positive and negative values as n increases (sequence A167029 in OEIS).

Spectral theory

The eigenvalues of a skew-symmetric matrix always come in pairs ±λ (except in the odd-dimensional case where there is an additional unpaired 0 eigenvalue). For a real skew-symmetric matrix the nonzero eigenvalues are all pure imaginary and thus are of the form iλ₁, −iλ₁, iλ₂, −iλ₂, … where each of the λ_k are real.

Real skew-symmetric matrices are normal matrices (they commute with their adjoints) and are thus subject to the spectral theorem, which states that any real skew-symmetric matrix can be diagonalized by a unitary matrix. Since the eigenvalues of a real skew-symmetric matrix are complex it is not possible to diagonalize one by a real matrix. However, it is possible to bring every skew-symmetric matrix to a block diagonal form by an orthogonal transformation. Specifically, every 2n × 2n real skew-symmetric matrix can be written in the form A = Q Σ Q^T where Q is orthogonal and

$\Sigma = \begin{bmatrix} \begin{matrix}0 & \lambda_1\\ -\lambda_1 & 0\end{matrix} & 0 & \cdots & 0 \\ 0 & \begin{matrix}0 & \lambda_2\\ -\lambda_2 & 0\end{matrix} & & 0 \\ \vdots & & \ddots & \vdots \\ 0 & 0 & \cdots & \begin{matrix}0 & \lambda_r\\ -\lambda_r & 0\end{matrix} \\ & & & & \begin{matrix}0 \\ & \ddots \\ & & 0 \end{matrix} \end{bmatrix}$

for real λ_k. The nonzero eigenvalues of this matrix are ±iλ_k. In the odd-dimensional case Σ always has at least one row and column of zeros.

Alternating forms

We begin with a special case of the definition. An alternating form φ on a vector space V over a field K, not of characteristic 2, is defined to be a bilinear form

φ : V × V → K

such that

φ(v,w) = −φ(w,v).

This defines a form with desirable properties for vector spaces over fields of characteristic not equal to 2, but in a vector space over a field of characteristic 2, the definition fails, as every element is its own additive inverse. That is, symmetric and alternating forms are equivalent, which is clearly false in the case above. However, we may extend the definition to vector spaces over fields of characteristic 2 as follows:

In the case where the vector space V is over a field of arbitrary characteristic including characteristic 2, we may state that for all vectors v in V

φ(v,v) = 0.

This reduces to the above case when the field is not of characteristic 2 as seen below

0 = φ(v + w,v + w) = φ(v,v) + φ(v,w) + φ(w,v) + φ(w,w) = φ(v,w) + φ(w,v)

Whence,

φ(v,w) = −φ(w,v).

Thus, we have a definition that now holds for vector spaces over fields of all characteristics.

Such a φ will be represented by a skew-symmetric matrix A, φ(v, w) = v^TAw, once a basis of V is chosen; and conversely an n×n skew-symmetric matrix A on Kⁿ gives rise to an alternating form sending x to x^TAx.

Infinitesimal rotations

Skew-symmetric matrices over the field of real numbers form the tangent space to the real orthogonal group O(n) at the identity matrix. In a sense, then, skew-symmetric matrices can be thought of as infinitesimal rotations.

Another way of saying this is that the space of skew-symmetric matrices forms the Lie algebra o(n) of the Lie group O(n). The Lie bracket on this space is given by the commutator:

$[A,B] = AB - BA.\,$

It is easy to check that the commutator of two skew-symmetric matrices is again skew-symmetric:

$[A,B]^{\top} = B^{\top}A^{\top}-A^{\top}B^{\top} = BA-AB = -[A,B] \, .$

The matrix exponential of a skew-symmetric matrix A is then an orthogonal matrix R:

$R=\exp(A)=\sum_{n=0}^\infty \frac{A^n}{n!}.$

The image of the exponential map of a Lie algebra always lies in the connected component of the Lie group that contains the identity element. In the case of the Lie group O(n), this connected component is the special orthogonal group SO(n), consisting of all orthogonal matrices with determinant 1. So R = exp(A) will have determinant +1. Moreover, since the exponential map of a connected compact Lie group is always surjective, it turns out that every orthogonal matrix with unit determinant can be written as the exponential of some skew-symmetric matrix. In the particular important case of dimension n=2, the exponential representation for an orthogonal matrix reduces to the well-known polar form of a complex number of unit modulus. Indeed, if n=2, a special orthogonal matrix has the form

$\begin{bmatrix} a & -b \\ b & \,a \end{bmatrix},$

with a²+b²=1. Therefore, putting a=cosθ and b=sinθ, it can be written

$\begin{bmatrix} \cos\,\theta & -\sin\,\theta \\ \sin\,\theta & \,\cos\,\theta \end{bmatrix}= \exp\left( \theta \begin{bmatrix} 0 & -1 \\ 1 &\,0 \end{bmatrix} \right),$

which corresponds exactly to the polar form cosθ + isinθ =e^iθ of a complex number of unit modulus. The exponential representation of an orthogonal matrix of order n can also be obtained starting from the fact that in dimension n any special orthogonal matrix R can be written as R = Q S Q^T, where Q is orthogonal and S is a block diagonal matrix with $\scriptstyle\lfloor {n/2}\rfloor$ blocks of order 2, plus one of order 1 if n is odd; since each single block of order 2 is also an orthogonal matrix, it admits an exponential form. Correspondingly, the matrix S writes as exponential of a skew-symmetric block matrix Σ of the form above, S=exp(Σ), so that R= Q exp(Σ)Q^T =exp(Q Σ Q^T), exponential of the skew-symmetric matrix Q Σ Q^T. Conversely, the surjectivity of the exponential map, together with the above mentioned block-diagonalization for skew-simmetric matrices, implies the block-diagonalization for orthogonal matrices.

References

^ Richard A. Reyment, K. G. Jöreskog, Leslie F. Marcus (1996). Applied Factor Analysis in the Natural Sciences. Cambridge University Press. p. 68. ISBN 0521575567.

Eves, Howard (1980). Elementary Matrix Theory. Dover Publications. ISBN 978-0-486-63946-8.
Suprunenko, D. A. (2001), "Skew-symmetric matrix", in Hazewinkel, Michiel, Encyclopaedia of Mathematics, Kluwer Academic Publishers, ISBN 978-1556080104, http://eom.springer.de/S/s085720.htm
Aitken, A. C. (1944). "On the number of distinct terms in the expansion of symmetric and skew determinants.". Edinburgh Math. Notes.

External links

This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)

Donate to Wikimedia

	Are the property of symmetric and skew symmetric are invariant? Read answer...
	Why stiffness matrix is symmetric? Read answer...
	Definition of anti-symmetric matrix? Read answer...

	How do you show or prove that if A is an n x n matrix then A equals S plus K where S is symmetric an K is skew symmetric?
	Would the grades on a difficult test be symmetric skewed to the right or skewed to the left?
	What is the meaning of eigenvalue of symmetric matrix?

Skew-symmetric matrix

Contents