HOME

TheInfoList



OR:

In mathematics, a symplectic matrix is a 2n\times 2n
matrix Matrix most commonly refers to: * ''The Matrix'' (franchise), an American media franchise ** '' The Matrix'', a 1999 science-fiction action film ** "The Matrix", a fictional setting, a virtual reality environment, within ''The Matrix'' (franchi ...
M with real entries that satisfies the condition where M^\text denotes the transpose of M and \Omega is a fixed 2n\times 2n nonsingular, skew-symmetric matrix. This definition can be extended to 2n\times 2n matrices with entries in other fields, such as the
complex number In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the for ...
s, finite fields, ''p''-adic numbers, and function fields. Typically \Omega is chosen to be the block matrix \Omega = \begin 0 & I_n \\ -I_n & 0 \\ \end, where I_n is the n\times n
identity matrix In linear algebra, the identity matrix of size n is the n\times n square matrix with ones on the main diagonal and zeros elsewhere. Terminology and notation The identity matrix is often denoted by I_n, or simply by I if the size is immaterial ...
. The matrix \Omega has determinant +1 and its inverse is \Omega^ = \Omega^\text = -\Omega.


Properties


Generators for symplectic matrices

Every symplectic matrix has determinant +1, and the 2n\times 2n symplectic matrices with real entries form a subgroup of the general linear group \mathrm(2n;\mathbb) under matrix multiplication since being symplectic is a property stable under matrix multiplication. Topologically, this symplectic group is a connected
noncompact In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space by making precise the idea of a space having no "punctures" or "missing endpoints", ...
real Lie group In mathematics, a Lie group (pronounced ) is a group that is also a differentiable manifold. A manifold is a space that locally resembles Euclidean space, whereas groups define the abstract concept of a binary operation along with the additio ...
of real dimension n(2n+1), and is denoted \mathrm(2n;\mathbb). The symplectic group can be defined as the set of linear transformations that preserve the symplectic form of a real symplectic vector space. This symplectic group has a distinguished set of generators, which can be used to find all possible symplectic matrices. This includes the following sets \begin D(n) =& \left\ \\ N(n) =& \left\ \end where \text(n;\mathbb) is the set of n\times n symmetric matrices. Then, \mathrm(2n;\mathbb) is generated by the setp. 2 \ \cup D(n) \cup N(n) of matrices. In other words, any symplectic matrix can be constructed by multiplying matrices in D(n) and N(n) together, along with some power of \Omega.


Inverse matrix

Every symplectic matrix is invertible with the inverse matrix given by M^ = \Omega^ M^\text \Omega. Furthermore, the product of two symplectic matrices is, again, a symplectic matrix. This gives the set of all symplectic matrices the structure of a group. There exists a natural manifold structure on this group which makes it into a (real or complex) Lie group called the symplectic group.


Determinantal properties

It follows easily from the definition that the determinant of any symplectic matrix is ±1. Actually, it turns out that the determinant is always +1 for any field. One way to see this is through the use of the Pfaffian and the identity \mbox(M^\text \Omega M) = \det(M)\mbox(\Omega). Since M^\text \Omega M = \Omega and \mbox(\Omega) \neq 0 we have that \det(M)=1. When the underlying field is real or complex, one can also show this by factoring the inequality \det(M^\text M + I) \ge 1.


Block form of symplectic matrices

Suppose Ω is given in the standard form and let M be a 2n\times 2n block matrix given by M = \beginA & B \\ C & D\end where A,B,C,D are n\times n matrices. The condition for M to be symplectic is equivalent to the two following equivalent conditions
A^\textC,B^\textD symmetric, and A^\text D - C^\text B = I
AB^\text,CD^\text symmetric, and AD^\text - BC^\text = I
When n=1 these conditions reduce to the single condition \det(M)=1. Thus a 2\times 2 matrix is symplectic
iff In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false. The connective is bicondi ...
it has unit determinant.


Inverse matrix of block matrix

With \Omega in standard form, the inverse of M is given by M^ = \Omega^ M^\text \Omega=\beginD^\text & -B^\text \\-C^\text & A^\text\end. The group has dimension n(2n+1). This can be seen by noting that ( M^\text \Omega M)^\text = -M^\text \Omega M is anti-symmetric. Since the space of anti-symmetric matrices has dimension \binom, the identity M^\text \Omega M = \Omega imposes 2n \choose 2 constraints on the (2n)^2 coefficients of M and leaves M with n(2n+1) independent coefficients.


Symplectic transformations

In the abstract formulation of
linear algebra Linear algebra is the branch of mathematics concerning linear equations such as: :a_1x_1+\cdots +a_nx_n=b, linear maps such as: :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matric ...
, matrices are replaced with linear transformations of finite-dimensional vector spaces. The abstract analog of a symplectic matrix is a symplectic transformation of a symplectic vector space. Briefly, a symplectic vector space (V,\omega) is a 2n-dimensional vector space V equipped with a nondegenerate, skew-symmetric
bilinear form In mathematics, a bilinear form is a bilinear map on a vector space (the elements of which are called '' vectors'') over a field ''K'' (the elements of which are called '' scalars''). In other words, a bilinear form is a function that is lin ...
\omega called the symplectic form. A symplectic transformation is then a linear transformation L:V\to V which preserves \omega, i.e. :\omega(Lu, Lv) = \omega(u, v). Fixing a basis for V, \omega can be written as a matrix \Omega and L as a matrix M. The condition that L be a symplectic transformation is precisely the condition that ''M'' be a symplectic matrix: :M^\text \Omega M = \Omega. Under a change of basis, represented by a matrix ''A'', we have :\Omega \mapsto A^\text \Omega A :M \mapsto A^ M A. One can always bring \Omega to either the standard form given in the introduction or the block diagonal form described below by a suitable choice of ''A''.


The matrix Ω

Symplectic matrices are defined relative to a fixed nonsingular, skew-symmetric matrix \Omega. As explained in the previous section, \Omega can be thought of as the coordinate representation of a nondegenerate
skew-symmetric bilinear form In mathematics, a bilinear form is a bilinear map on a vector space (the elements of which are called ''Vector (mathematics), vectors'') over a Field (mathematics), field ''K'' (the elements of which are called ''scalar (mathematics), scalars''). ...
. It is a basic result in
linear algebra Linear algebra is the branch of mathematics concerning linear equations such as: :a_1x_1+\cdots +a_nx_n=b, linear maps such as: :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matric ...
that any two such matrices differ from each other by a change of basis. The most common alternative to the standard \Omega given above is the block diagonal form :\Omega = \begin \begin0 & 1\\ -1 & 0\end & & 0 \\ & \ddots & \\ 0 & & \begin0 & 1 \\ -1 & 0\end \end. This choice differs from the previous one by a
permutation In mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or p ...
of basis vectors. Sometimes the notation J is used instead of \Omega for the skew-symmetric matrix. This is a particularly unfortunate choice as it leads to confusion with the notion of a complex structure, which often has the same coordinate expression as \Omega but represents a very different structure. A complex structure J is the coordinate representation of a linear transformation that squares to -I_n, whereas \Omega is the coordinate representation of a nondegenerate skew-symmetric bilinear form. One could easily choose bases in which J is not skew-symmetric or \Omega does not square to -I_n. Given a hermitian structure on a vector space, J and \Omega are related via :\Omega_ = -g__b where g_ is the metric. That J and \Omega usually have the same coordinate expression (up to an overall sign) is simply a consequence of the fact that the metric ''g'' is usually the identity matrix.


Diagonalisation and decomposition

*For any positive definite symmetric real symplectic matrix there exists in such that :S = U^\text D U \quad \text \quad D = \operatorname(\lambda_1,\ldots,\lambda_n,\lambda_1^,\ldots,\lambda_n^),
where the diagonal elements of are the eigenvalues of . *Any real symplectic matrix has a polar decomposition of the form: :S=UR \quad \text \quad U \in \operatorname(2n,\mathbb) \text R \in \operatorname(2n,\mathbb)\cap\operatorname_+(2n,\mathbb). *Any real symplectic matrix can be decomposed as a product of three matrices: such that and are both symplectic and
orthogonal In mathematics, orthogonality is the generalization of the geometric notion of '' perpendicularity''. By extension, orthogonality is also used to refer to the separation of specific features of a system. The term also has specialized meanings in ...
and is positive-definite and diagonal. This decomposition is closely related to the
singular value decomposition In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix. It generalizes the eigendecomposition of a square normal matrix with an orthonormal eigenbasis to any \ m \times n\ matrix. It is r ...
of a matrix and is known as an 'Euler' or 'Bloch-Messiah' decomposition.


Complex matrices

If instead ''M'' is a
matrix Matrix most commonly refers to: * ''The Matrix'' (franchise), an American media franchise ** '' The Matrix'', a 1999 science-fiction action film ** "The Matrix", a fictional setting, a virtual reality environment, within ''The Matrix'' (franchi ...
with complex entries, the definition is not standard throughout the literature. Many authors adjust the definition above to where ''M*'' denotes the
conjugate transpose In mathematics, the conjugate transpose, also known as the Hermitian transpose, of an m \times n complex matrix \boldsymbol is an n \times m matrix obtained by transposing \boldsymbol and applying complex conjugate on each entry (the complex c ...
of ''M''. In this case, the determinant may not be 1, but will have absolute value 1. In the 2×2 case (''n''=1), ''M'' will be the product of a real symplectic matrix and a complex number of absolute value 1. Other authors retain the definition () for complex matrices and call matrices satisfying () ''conjugate symplectic''.


Applications

Transformations described by symplectic matrices play an important role in
quantum optics Quantum optics is a branch of atomic, molecular, and optical physics dealing with how individual quanta of light, known as photons, interact with atoms and molecules. It includes the study of the particle-like properties of photons. Photons have ...
and in continuous-variable quantum information theory. For instance, symplectic matrices can be used to describe Gaussian (Bogoliubov) transformations of a quantum state of light. In turn, the Bloch-Messiah decomposition () means that such an arbitrary Gaussian transformation can be represented as a set of two passive linear-optical interferometers (corresponding to orthogonal matrices ''O'' and ''O' '') intermitted by a layer of active non-linear squeezing transformations (given in terms of the matrix ''D''). In fact, one can circumvent the need for such ''in-line'' active squeezing transformations if two-mode squeezed vacuum states are available as a prior resource only.


See also

* Symplectic vector space * Symplectic group *
Symplectic representation In mathematical field of representation theory, a symplectic representation is a representation of a group or a Lie algebra on a symplectic vector space (''V'', ''ω'') which preserves the symplectic form ''ω''. Here ''ω'' is a nondegenerate ske ...
* Orthogonal matrix * Unitary matrix *
Hamiltonian mechanics Hamiltonian mechanics emerged in 1833 as a reformulation of Lagrangian mechanics. Introduced by Sir William Rowan Hamilton, Hamiltonian mechanics replaces (generalized) velocities \dot q^i used in Lagrangian mechanics with (generalized) ''momen ...
* Linear complex structure


References

{{Matrix classes Matrices Symplectic geometry