The symplectic characteristic polynomial
Abstract.
We introduce the notion of the symplectic characteristic polynomial of an endomorphism of a symplectic vector space. This is a polynomial in two variables and can be considered as a generalization of the characteristic polynomial of the endomorphism in the context of symplectic linear algebra. One of the goal of this paper is to prove that the symplectic characteristic polynomial is a complete symplectic invariant of symplectically diagonalizable endomorphisms.
Key words and phrases:
Characteristic polynomial, Symplectic similarity, Symplectically diagonalizability2020 Mathematics Subject Classification:
15A20, 15A211. Introduction
Let be a finite dimensional symplectic vector space over a field . It is a fundamental question to classify endomorphisms of with respect to symplectic similarity. Endomorphisms which are self-adjoint, anti-self-adjoint or preserve the symplectic form have been classified when the characteristic of is not (see [5, Theorem 4], [1, Theorem 2.2], [4, Section 9]). Such an endomorphism is symplectically normal (Definition 2.1 (2)) and the classification of symplectically normal endomorphisms is not known even though they are diagonalizable. An endomorphism is symplectically diagonalizable if and only if the endomorprhism is symplectically normal and diagonalizable ([2, Theorem 13]). A motivation of the paper is to classify symplectically diagonalizable endomorphisms up to symplectic similarity.
Let us recall several facts on the characteristic polynomial of an endomorphism of a vector space . Cayley-Hamilton theorem implies that admits the direct sum decomposition into the generalized eigenspaces of when all eigenvalues of are in . The characteristic polynomial is a complete invariant of diagonalizable endomorphisms. Moreover, if the number of eigenvalues of is equal to the dimension of , then is diagonalizable.
Now we consider a symplectic vector space . Let be an endomorphism of . Suppose that is symplectically normal and that all eigenvalues of are in . It can be proved by using the same idea in ([3, Lemma 1]) that is the symplectically orthogonal sum of the symplectic subspaces associated with two eigenvalues of . This implies that we have projections onto these subspaces. On the other hand, if one considers the endomorphism of the -vector space , we have other projections, whose images are the generalized eigenspaces of . Here is the identity map and is the field of rational functions over .
In this paper, we show that these generalized eigenspaces and projections correspond to the previous symplectic subspaces and projections respectively. We introduce the symplectic characteristic polynomial as the Pfaffian of . We prove that the symplectic characteristic polynomial is a complete invariant of symplectically diagonalizable endomorphisms up to symplectic similarity. Moreover, we give a sufficient condition for symplectically diagonalizability.
The paper is organized as follows. Section 2 contains several fundamental facts on symplectic linear algebra. In Section 3, we define the symplectic characteristic polynomial of an endomorphism and prove several properties. In Section 4, we study the characteristic polynomial of the endomorphism associated with two endomorphisms , of a (not necessary symplectic) vector space. In Section 5, we prove that the symplectic characteristic polynomial is a complete invariant of symplectically diagonalizable endomorphisms and give a sufficient condition on symplectically diagonalizability.
2. Preliminaries
We first introduce the following notation.
-
•
We denote the field of rational functions over by .
-
•
The set of endomorphisms of a vector space is denoted by . By abuse of notation, denotes the identity map of and denotes the zero map of .
-
•
The characteristic polynomial of an endomorphism is denoted by .
-
•
Let and . We define the subspaces , by
The space (resp. ) is an eigenspace (resp. a generalized eigenspace ) if it is not zero.
We also define the subspaces , of by
-
•
Let and a bilinear form. Let be a extension field of . We use the same letter (resp. ) for the natural extension of (resp. ) to the endomorphism (resp. the bilinear form) of .
Now we recall several fundamental facts on symplectic linear algebra.
Let be a vector space over a field and let . A bilinear form of is said to be symplectic if
-
•
is alternating, that is, for all and
-
•
is non-degenerate, that is, a linear map
is an isomorphism.
We call a symplectic vector space. A representation matrix of an alternating matrix with respect to some bases is anti-symmetric and the diagonal entries are zero. This matrix has determinant zero when the size of the matrix is odd and a symplectic vector space must be even-dimensional.
The set of automorphisms which preserve is denoted by . Since the Pfaffian of a matrix which represents is not zero, any automorphism in has determinant .
Let be a symplectic vector space and let . The symplectic adjoint endomorphism of is an endomorphism of defined by
where is the dual map of . It is easily shown that the following properties hold for any .
-
•
for all .
-
•
if and only if .
-
•
-
•
.
-
•
The characteristic polynomial of is equal to that of .
Definition 2.1.
-
(1)
An endomorphism is said to be symplectically similar to an endomorphism if there exists such that .
-
(2)
An endomorphism is said to be symplectically normal if .
Let be a subspace of . We define the symplectically orthogonal subspace by
As in the case of an inner product, we have the following.
Proposition 2.2.
Let and let be a subspace of . Then
-
.
-
.
-
.
-
implies that
-
If , then
Proof.
It follows that where is the inclusion. Since a linear map is surjective, we have . It is clear that . Applying for , we have . Hence, we get . It is easy to see that . Let . Then for all . This implies that . Hence, we have . The items are easily shown. Suppose that . Since is an automorphism, . Therefore, by and , we get . ∎
A subspace of is said to be
-
•
symplectic if ,
-
•
isotropic if ,
-
•
coisotropic if ,
-
•
Lagrangian if .
Since , we have that is symplectic if and only if is symplectic.
The item in Proposition 2.2 shows that if is isotropic, then and that is Lagrangian if and only if is isotropic and .
Proposition 2.3.
Let . Suppose that . Then is a symplectic subspace of .
Proof.
It follows from the item and in Proposition 2.2 that . This implies that . ∎
Lemma 2.4.
Let and let . Suppose that and that is a symplectic subspace of . Then , are Lagrangian subspaces of .
Proof.
The item in Proposition 2.2 gives that , are isotropic subspaces of . Since , we have
Therefore, , are Lagrangian subspaces of . ∎
A basis of is said to be symplectic if
Proposition 2.5.
There exists a symplectic basis of .
Proof.
We proof by induction on . Since is non-degenerate, there exist such that . Hence, the assertion holds for . We assume the assertion holds for . Let be a subspace spanned by . Then is symplectic and so is . The induction hypothesis shows that there exists a symplectic basis of . It is clear that is a symplectic basis of . ∎
Lemma 2.6.
Let be Lagrangian subspaces of . Suppose that and is a basis of . Then there exists a basis of such that is a symplectic basis of .
Proof.
The condition implies that there exist such that and that Since is non-degenerate, there exists such that . It follows from that . It is clear that is a symplectic basis. ∎
Let be a symplectic basis of . Then the matrix which represents with respect to is
where is the identity matrix of order and is the zero matrix. If is represented by
where , , , are matrices of order , then is represented by
Here denotes the transpose of a matrix. Hence, if , then , .
Let and let be a symplectic basis of . Then is a symplectic basis if and only if . This means that
Proposition 2.7.
An endomorphism is symplectically similar to an endomorphism if and only if there exist symplectic bases , such that .
An endomorphism is said to be symplectically diagonalizable if there exists a symplectic basis consisting of eigenvectors of . It is easy to see that if an endomorphism is symplectically diagonalizable, then and is diagonalizable. Theorem 5.4 shows that the converse is true.
Let We define the bilinear form of by
It is easy to see that . We remark that , are alternating for any .
Let and assume that is alternating. Let be a symplectic basis. Set . Define the matrix by . Since for , the Pfaffian does not depend on the choice of symplectic bases. We denote by . It is easily shown that .
Definition 2.8.
Let and assume that is alternating. The polynomial is defined by ,
Proposition 2.9.
Let and assume that is alternating. The polynomial has the following properties.
-
The square is the characteristic polynomial .
-
The polynomial is an invariant of under symplectic similarity transformation, that is, for .
-
Let . Then
-
Proof.
It is clear from the definition of that holds.
Let . Since , we get that is alternating. The item implies that . Hence, we have .
It follows from [5, Theorem 3] that there exists a symplectic basis such that
where is a matrix of order . Then
This implies that . Hence, we have Since and , we get . Cayley-Hamilton theorem gives that . Therefore,
which completes the proof. ∎
Proposition 2.10.
Let . Then we have and .
3. The symplectic characteristic polynomial
Let be a -dimensional symplectic vector space over a field .
Definition 3.1.
The symplectic characteristic polynomial of an endomorphism of is defined by
Here is a polynomial defined in Definition 2.8.
Remark 3.2.
It follows from Proposition 2.10 that
(3.1) |
Remark 3.3.
The definition above is motivated by the following example. Let and . Assume that has four distinct eigenvalues and that is symplectically diagonalizable, that is, there exists a symplectic basis such that is a diagonal matrix . Define the subgroup of the symmetric group as follows: An element is in if there exists a symplectic basis such that . Since is independent on the choice of symplectic bases, consists of eight elements
which implies that is isomorphic to the dihedral group of square. Therefore, we find that is independent on the choice of symplectic bases. This set determines uniquely the polynomial
On the other hand,
This implies that The item in Proposition 2.9 shows that the coefficient of in is . Hence, we have
We show properties of the symplectic characteristic polynomial.
Proposition 3.4.
Let . The symplectic characteristic polynomial satisfies the following.
-
The polynomial is the polynomial .
-
The polynomial is the characteristic polynomial .
-
-
If for , then , are eigenvalues of , is an eigenvalue of and is an eigenvalue of .
-
The symplectic characteristic polynomial is an invariant of under symplectic similarity transformation and taking the symplectic adjoint, that is, for and .
-
The square is the characteristic polynomial .
-
Let Then
-
Proof.
It is clear from the definition that holds. The item follows from Proposition 2.10.
The easy calculation shows that
This implies that
Assume that for . Then by , we have . From , we get , . This implies that , .
Let . It is easy to see that
Hence, from the item in Proposition 2.9, we have . The equality (3.1) implies that .
The items – follows from the items – in Proposition 2.9 respectively. ∎
The symplectic characteristic polynomial of an endomorphism is determined by the characteristic polynomial if , or . Precisely, we have the following proposition.
Proposition 3.5.
Let . Then
Proof.
This is verified from the fact that . ∎
4. The characteristic polynomial associated with two endomorphisms
We have seen in Proposition 3.4 that the square of the symplectic characteristic polynomial of an endomorphism is the characteristic polynomial . This section is devoted to the study of the characteristic polynomial for any endomorphisms of a (not necessarily symplectic) vector space.
Let be a finite dimensional vector space over a field with .
Proposition 4.1.
Let . Then
-
•
,
-
•
.
Proof.
It is clear from the definition. ∎
Proposition 4.2.
Let . If , are simultaneously triangularizable, then
In particular, a polynomial is an eigenvalue of .
Proof.
Since and are simultaneously triangularizable, there exists a basis such that
Therefore, . ∎
Proposition 4.3.
Let . Suppose that . The following are equivalent.
-
All eigenvalues of and all eigenvalues of are in .
-
The characteristic polynomial is of the form
Proof.
It is clear that implies . If all eigenvalues of , are in , then , are simultaneously triangularizable. Hence, Proposition 4.2 gives . ∎
Proposition 4.4.
Let and . If is an eigenvalue of , then is an eigenvalue of and and is an eigenvalue of . Moreover, if the characteristic polynomial of is equal to that of , then are eigenvalues of and .
Proof.
It is easy to see from Proposition 4.1. ∎
By using this proposition, we give an example of endomorphisms , which satisfy that for all .
Example 4.5.
Let . Define two matrices , by
It is easily shown that and that Hence, Proposition 4.4 shows that for all . We note that .
It is well-known that is an eigenvalue of if and only if . We show that if , then
-
•
the space is generated by vectors in ,
-
•
the space is equal to
We first give a lemma.
Lemma 4.6.
Let and . Suppose that . Then
Proof.
To show the first implication, it suffices to see that . Let and , . Since , are simultaneously triangularizable, there exists a basis of such that
Hence, .
Let . It is easy to see that
Since , are simultaneously triangularizable, in the same way as above, we get . ∎
Theorem 4.7.
Under the same assumption as the lemma above, we have
Proof.
As a consequence of Theorem 4.7, we have the following.
Corollary 4.8.
Let . Suppose that and that
so that for . Then we have the following.
-
•
The space is the direct sum of the -dimensional -invariant subspaces .
-
•
Let be projections with respect to and let be projections with respect to
Then
Proposition 4.9.
Let and . Suppose that . Then is an eigenvalue of if and only if .
Proof.
Suppose that . Let . Then we get . Hence, is an eigenvalue of .
The only if part follows from Theorem 4.7 and the fact that is equivalent to . ∎
5. Applications of the symplectic characteristic polynomial
In this section, we prove several results for symplectically normal endomorphisms which are concerned with the symplectic characteristic polynomial.
Let be a -dimensional symplectic vector space over a field .
Proposition 5.1.
Let . Suppose that . The following are equivalent.
-
All eigenvalues of are in .
-
The characteristic polynomial is of the form
Proof.
This follows from and Proposition 4.3. ∎
Let . Suppose that all eigenvalues of are in . By using the same idea of the proof of Lemma 1 in [3], we can show that is the symplectically orthogonal direct sum of the symplectic subspaces associated with two eigenvalues of . We reformulate this result with the symplectic characteristic polynomial and give a short proof.
Lemma 5.2.
Let . Suppose that . If the symplectic characteristic polynomial is of the form
so that for , then is the symplectically orthogonal direct sum of the -dimensional symplectic subspaces . Precisely, we have the following.
-
.
-
.
-
for .
-
is an -invariant symplectic subspace of .
Proof.
In the symplectic case, we have a stronger result than Proposition 4.9.
Proposition 5.3.
Let and . Suppose that . Then if and only if .
Proof.
It is proved in [2, Theorem 13] that if an endomorphism is symplectically normal and diagonalizable, then the endomorphism is symplectically diagonalizable. The following theorem is an improvement of this fact.
Theorem 5.4.
Let . Suppose that and that is diagonalizable. Then there exists a symplectic basis such that
where the symplectic characteristic polynomial is of the form
Proof.
We proof by induction on . The item in Lemma 5.2 shows that is a symplectic subspaces of . There exist such that
Indeed, the case where follows from Proposition 2.5 and the case where follows from Lemma 2.4 and 2.6. Hence, the assertion holds for . We assume that the assertion holds for . Let be a subspace generated by . Then is an -invariant symplectic subspace of and by the item in Proposition 2.2, so is . Let and . Since , we have . It is clear that is diagonalizable. The induction hypothesis shows that there exists a symplectic basis of such that for . It is clear that is a symplectic basis which is desired. ∎
Corollary 5.5.
The symplectic characteristic polynomial is a complete invariant with respect to symplectic similarity for symplectically diagonalizable endomorphisms. In particular, a symplectically diagonalizable endomorphism is symplectically similar to the symplectic adjoint endomorphism .
Proof.
It is well-known that if the number of distinct eigenvalues of an endomorphism is equal to , then the endomorphism is diagonalizable. In the symplectic case, we have the following two theorems.
Theorem 5.6.
Let . Suppose that and that the symplectic characteristic polynomial is of the form
and for Then there exists a symplectic basis such that
Proof.
Theorem 5.7.
Under the same assumption as above, we assume further that for all . Then there exists a symplectic basis such that
References
- [1] Antonio Ciampi. Classification of Hamiltonian linear systems. Indiana Univ. Math. J., 23:513–526, 1973/74.
- [2] Ralph John de la Cruz and Heike Faßbender. On the diagonalizability of a matrix by a symplectic equivalence, similarity or congruence transformation. Linear Algebra Appl., 496:288–306, 2016.
- [3] Israel Gohberg and Boris Reichstein. On classification of normal matrices in an indefinite scalar product. Integral Equations Operator Theory, 13(3):364–394, 1990.
- [4] T. A. Springer. On symplectic transformations. Indag. Math. (N.S.), 33(1):279–302, 2022. Translated from the 1951 Dutch original [MR0043785] by Wilberd van der Kallen.
- [5] William C. Waterhouse. The structure of alternating-Hamiltonian matrices. Linear Algebra Appl., 396:385–390, 2005.