An elementary proof that symplectic matrices have determinant one

Donsub Rim

Abstract

We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. The result is restricted to the real and complex case due to its reliance on field-dependent spectral theory; however, in this setting, we obtain a proof which is more elementary in the sense that it is direct and requires only well-known facts. Finally, an explicit formula for the determinant of conjugate symplectic matrices in terms of its square subblocks is given.

Introduction

In the study of Hamiltonian mechanics, symplectic geometry, and quantum optics, symplectic matrices play a fundamental role. A real $2N \times 2N$ matrix $A$ is defined as symplectic if it satisfies the identity: $$A^T J A = J$$ where $J$ is the standard skew-symmetric block matrix: $$J = \begin{bmatrix} 0 & I_N \\ -I_N & 0 \end{bmatrix}$$ Taking the determinant of both sides of the defining identity yields $\det(A)^2 \det(J) = \det(J)$. Since $\det(J) = 1$, it follows immediately that $\det(A)^2 = 1$, or $\det(A) = \pm 1$. While it is a well-established fact that $\det(A)$ is always $+1$, proving this without advanced machinery is surprisingly non-trivial.

The Pedagogical Challenge

Standard proofs of $\det(A) = 1$ typically rely on one of two sophisticated approaches. The first is topological: one proves that the symplectic group $Sp(2N, \mathbb{R})$ is connected and contains the identity matrix (which has determinant 1), thus all elements must have determinant 1. The second is algebraic: using the Pfaffian, one can show that $\det(A) = \text{Pf}(A^T J A) / \text{Pf}(J) = 1$.

While rigorous, these methods often exceed the scope of an introductory graduate linear algebra course. This paper provides a direct proof using only basic properties of positive definite matrices and block-matrix algebra, filling a gap for students and practitioners in physics and engineering who require a more accessible derivation.

The Elementary Proof

The author’s proof strategy avoids the sign ambiguity of $\det(A)$ by embedding it within a strictly positive expression using a clever algebraic "sandwich."

1. The Positive Definite Pivot

Consider the matrix $M = A^T A + I$. Since $A^T A$ is a symmetric (or Hermitian) positive definite matrix, its eigenvalues are all positive. Consequently, the eigenvalues of $M$ are all strictly greater than 1, ensuring that $\det(M) > 0$.

2. Symplectic Substitution

Using the symplectic condition $A^T J A = J$, we can write $A^T = J A^{-1} J^{-1}$. Substituting this into our expression for $M$: $$M = A^T A + I = A^T (A + (A^T)^{-1})$$ $$M = A^T (A + J A J^{-1})$$ Taking the determinant of this product: $$\det(M) = \det(A) \cdot \det(A + J A J^{-1})$$

3. Block Matrix Analysis

Let $A$ be partitioned into $N \times N$ blocks: $$A = \begin{bmatrix} A_{11} & A_{12} \\ A_{21} & A_{22} \end{bmatrix}$$ A direct calculation of $J A J^{-1}$ reveals that the term $(A + J A J^{-1})$ takes a specific block form: $$K = \begin{bmatrix} C & D \\ -D & C \end{bmatrix}$$ where $C = A_{11} + A_{22}$ and $D = A_{12} - A_{21}$.

4. The Unitary Trick

A well-known property of matrices with the block structure of $K$ is that their determinant can be related to a complex matrix. By applying a specific unitary similarity transformation, it can be shown that: $$\det(K) = \det(C + iD) \det(C - iD) = |\det(C + iD)|^2$$ Since $|\det(C + iD)|^2$ is a squared absolute value, it is necessarily non-negative ($\det(K) \ge 0$).

5. Conclusion

Returning to our determinant identity: $$\det(M) = \det(A) \cdot \det(K)$$ We established that $\det(M) > 0$ and $\det(K) \ge 0$. This implies that $\det(A)$ must be positive. Given that $\det(A)$ was already restricted to the set $\{1, -1\}$, we conclude that $\det(A) = 1$. This result is formalized in Theorems 2.1 and 2.3 of the paper for the real and complex cases, respectively.

Extensions: Conjugate Symplectic Matrices

The paper extends this logic to conjugate symplectic matrices, which satisfy $A^* J A = J$. Unlike the standard case, the determinant of a conjugate symplectic matrix is not restricted to $\pm 1$ but lies on the unit circle in the complex plane ($|\det(A)| = 1$). The author provides a new explicit formula for this determinant based on the matrix's subblocks: $$\det(A) = \frac{\det(A_{11} + A_{22} + i(A_{12} - A_{21}))}{\overline{\det(A_{11} + A_{22} + i(A_{12} - A_{21}))}}$$

Limitations and Context

As the author admits, this proof is less general than those using Pfaffians, which apply to symplectic matrices over arbitrary fields. This method is specifically tuned for the real and complex cases common in physics. Interestingly, while the author derived this proof independently, a similar approach for the real case was previously noted in a 2008 Chinese textbook by Y. Xu; this paper serves to bring that elegant approach to a wider audience while extending it to the complex and conjugate cases.

Summary updated

Abstract

We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding in an elementary proof The result is restricted to the real and complex case due to its reliance on field-dependent spectral theory, however in this setting we obtain a proof which is more elementary in the sense that it is direct and requires only well-known facts. Finally, an explicit formula for the determinant of conjugate symplectic matrices in terms of its square subblocks is given.
BibTeX
@inproceedings{rim2017elementary,
  author = {Donsub Rim},
  title = {{An elementary proof that symplectic matrices have determinant one}},
  booktitle = {Advances},
  year = {2017},
  doi = {10.37622/adsa/12.1.2017.15-20},
}
Figure