In mathematics, a symplectic matrix is a matrix with real entries that satisfies the condition
where denotes the transpose of and is a fixed nonsingular, skew-symmetric matrix. This definition can be extended to matrices with entries in other fields, such as the complex numbers, finite fields, p-adic numbers, and function fields.
Typically is chosen to be the block matrix
where is the identity matrix. The matrix has determinant and its inverse is .
Every symplectic matrix has determinant , and the symplectic matrices with real entries form a subgroup of the general linear group under matrix multiplication since being symplectic is a property stable under matrix multiplication. Topologically, this symplectic group is a connected noncompact real Lie group of real dimension , and is denoted . 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
where is the set of symmetric matrices. Then, is generated by the setp. 2
of matrices. In other words, any symplectic matrix can be constructed by multiplying matrices in and together, along with some power of .
Every symplectic matrix is invertible with the inverse matrix given by
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.
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
Since and we have that .
When the underlying field is real or complex, one can also show this by factoring the inequality .
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Hands-on introduction to data science and machine learning. We explore recommender systems, generative AI, chatbots, graphs, as well as regression, classification, clustering, dimensionality reduction
This course provides an introduction to the modeling of matter at the atomic scale, using interactive jupyter notebooks to see several of the core concepts of materials science in action.
Accelerator physics covers a wide range of very exciting topics. This course presents basic physics ideas and the technologies underlying the workings of modern accelerators. An overview of the new id
Explores practical applications in nonlinear dynamics, emphasizing symplectic integration methods and thin lens approximations for accurate computations in accelerator physics.
In mathematics, a symplectic vector space is a vector space V over a field F (for example the real numbers R) equipped with a symplectic bilinear form. A symplectic bilinear form is a mapping ω : V × V → F that is Bilinear Linear in each argument separately; Alternating ω(v, v) = 0 holds for all v ∈ V; and Non-degenerate ω(u, v) = 0 for all v ∈ V implies that u = 0. If the underlying field has characteristic not 2, alternation is equivalent to skew-symmetry. If the characteristic is 2, the skew-symmetry is implied by, but does not imply alternation.
In mathematics, the name symplectic group can refer to two different, but closely related, collections of mathematical groups, denoted Sp(2n, F) and Sp(n) for positive integer n and field F (usually C or R). The latter is called the compact symplectic group and is also denoted by . Many authors prefer slightly different notations, usually differing by factors of 2. The notation used here is consistent with the size of the most common matrices which represent the groups.
In linear algebra, an eigenvector (ˈaɪgənˌvɛktər) or characteristic vector of a linear transformation is a nonzero vector that changes at most by a constant factor when that linear transformation is applied to it. The corresponding eigenvalue, often represented by , is the multiplying factor. Geometrically, a transformation matrix rotates, stretches, or shears the vectors it acts upon. The eigenvectors for a linear transformation matrix are the set of vectors that are only stretched, with no rotation or shear.
,
Among the single-trajectory Gaussian-based methods for solving the time-dependent Schrödinger equation, the variational Gaussian approximation is the most accurate one. In contrast to Heller’s original thawed Gaussian approximation, it is symplectic, conse ...
2023
In this article, motivated by the study of symplectic structures on manifolds with boundary and the systematic study of b-symplectic manifolds started in Guillemin, Miranda, and Pires Adv. Math. 264 (2014), 864-896, we prove a slice theorem for Lie group a ...
WILEY2022
We study the symplectic Howe duality using two new and independent combinatorial methods: via determinantal formulae on the one hand, and via (bi)crystals on the other hand. The first approach allows us to establish a generalised version where weight multi ...