Abstract
In this article, we define an index of the Maslov type for paths of orthogonal symplectic matrices. The starting point is an arbitrary orthogonal symplectic matrix rather than the identity matrix. We use this index to explain the geometric intersection number of a pair of Lagrangian paths and compare it with the Cappell–Lee–Miller index.
MSC:
53D12
1. Introduction
The Maslov indices for paths of symplectic matrices and paths of Lagrangian subspaces have been important topics in the fields of Hamiltonian dynamical systems, symplectic geometry and mathematical physics for a long time [1,2,3,4,5,6,7,8,9,10,11,12,13]. For example, the Conley–Zehnder index is a special Maslov-type index for paths of symplectic matrices (symplectic paths). It was constructed by Conley and Zehnder [4] for non-degenerate periodic solutions of Hamiltonian systems and has been an important tool for the construction of Floer homology [14,15] and research on the Arnold conjecture [4,12,14,15,16,17,18,19,20,21]. The set of symplectic matrices is denoted by . Then, the Conley–Zehnder index is defined for a continuous path such that and has no eigenvalues equal to 1. Long [7,8] and Viterbo [13] independently proposed methods to deal with the degenerate symplectic paths. In particular, Long [7,8] generalized the Conley–Zehnder index and defined a Maslov-type index for the symplectic paths that satisfies the conditions that and is arbitrary. This Maslov-type index is extremely useful for studying various problems related to the periodic solutions, closed characteristics, brake orbits and closed geodesics arising from celestial mechanics, contact geometry, Riemannian and Finsler geometry, etc. [22,23,24,25,26,27]. Furthermore, in order to study symplectic paths with Lagrangian boundary conditions, Liu [5] defined a Maslov-type index via a fixed Lagrangian subspace , called the -index.
In the study of Maslov-type indexes for the segments of symplectic paths (i.e., and are arbitrary), Long [7,8] and Liu [5,6] made significant contributions, respectively. Their constructions employ the point of view that the general symplectic paths can be viewed as the segment of symplectic paths that correspond to two symplectic paths starting from . Consequently, the index for the segment of symplectic paths can be defined as the difference between the indices of these two symplectic paths starting at . However, it should be noted that the methods of constructing Maslov-type indices for the segments of symplectic paths and those special paths starting from are not consistent.
Conversely, Arnold [2] elucidated Maslov’s original index as the intersection number of a path of Lagrangian subspaces with the so-called Maslov cycle and defined an index of a pair of Lagrangian loops. Robbin and Salamon [10,11] generalized the work of Arnold and considered arbitrary Lagrangian paths instead of loops. They defined a kind of Maslov index for a pair of Lagrangian paths, which can induce an index for symplectic paths. However, this kind of index by Robbin and Salamon is merely a half-integer rather than an integer. To unify different definitions, Cappell, Lee and Miller [3], using somewhat different methods, gave a system of axioms for the pair of Lagrangian paths and introduced four definitions of Maslov indices. They showed that these definitions satisfy this system of axioms; and thereby, their equivalences to one another were established.
In this article, we consider a simple case in dimension 2 and give a consistent method for constructing a Maslov-type index for orthogonal symplectic paths. We compare this index with the Cappell–Lee–Miller index (see Definition 6), which is the index for a pair of Lagrangian paths. If we denote the set of general paths of orthogonal symplectic matrices by
where is the set of orthogonal matrices, we obtain the following main results.
Theorem 1.
where is small enough, we have
More intuitively, if we do not take the endpoints into account, the Maslov-type index is equal to the intersection number Φ crossing the singular set (see (16)).
For any , there exists a well-defined integer , called a Maslov-type index (see (22)), such that the following properties hold:
- (1)
- For , ;
- (2)
- For the orthogonal symplectic paths, as
Theorem 2.
We remark that, at least for this special case of dimension 2, the intersection number of the Lagrangian pair can be described by the intersection number of the orthogonal symplectic path crossing the singular set. We will roughly discuss the idea of higher dimensions in Section 5 and study those more general cases as well as related applications in another paper.
2. Preliminaries
In this section, we introduce some definitions and results that we use in the article.
2.1. Symplectic Path and Lagrangian Path
Definition 1.
Let be a bilinear form in given by
where
Then, the space is called the standard symplectic space. This bilinear form is called the standard symplectic form.
Definition 2.
Let L be a n-dimensional subspace of the symplectic space and
where is called the skew-orthogonal complement [17] of L. If , then L is called a Lagrangian subspace of .
The set of all Lagrangian subspaces of is called the Lagrangian Grassmannian, denoted by . Let T be an isomorphism of ; if T keeps invariant, then T is called a symplectic isomorphism. The set of all symplectic isomorphisms of is called the symplectic group [9,28] and is denoted by . Then, is a real matrix and it satisfies . Thus, we have the following definitions:
Definition 3.
Let ; M is called a symplectic matrix if it satisfies
Definition 4.
A continuous map
is called a symplectic path in . Similarly, a continuous map
is called a Lagrangian path in .
According to the above definitions, we have some results for .
Proposition 1.
When , the Lagrangian Grassmannian
Proof.
The set contains all the 1-dimensional subspaces of . We only need to prove that L is a Lagrangian subspace. By (7), we obtain the skew-orthogonal complement
then, and hence, L is a Lagrangian subspace. ☐
If is an orthogonal matrix, then M is called an orthogonal symplectic matrix. The set of all orthogonal symplectic matrices is denoted by . We have the following result when .
Proposition 2.
If , then M has the form
Proof.
Set
Since , then
and we can obtain
Then,
and hence, . Let and this completes the proof. ☐
2.2. The Rotation Number for Orthogonal Symplectic Paths
In this part, we will introduce the rotation number for orthogonal symplectic paths, which is used for the construction of the Maslov-type index. Let
be an orthogonal symplectic path. If , then has the form as
where the angle mapping is continuous.
According to [2], , where is the orthogonal group and is the unitary group. If , then (i.e., the unit circle). Thus, an orthogonal symplectic path can correspond to a path on . Denote the set of all orthogonal symplectic paths by
For any with the form (9), we construct the maps
and
then, we can define the rotation number:
Definition 5.
For any , the rotation number of Φ is defined by
Proposition 3.
If and they satisfy , we define the catenation of Φ and Ψ by
then, we have
Proof.
By (9), let and be the angle mappings of and , then they satisfy . Hence
This completes the proof. ☐
2.3. Cappell–Lee–Miller Index
In this part, we introduce the Cappell–Lee–Miller index, which is a geometrical definition of [3] by Cappell, Lee and Miller. It is the geometric intersection number of a Lagrangian path and the 1-codimensional cycle (i.e., the Maslov cycle) in the Lagrangian Grassmannian. Let
be the pair of two Lagrangian paths, where is a constant path. is called a proper path if
According to [3], for any path above, there exists a sufficiently small such that
is a proper path. Define the Maslov cycle of L as
then, we can count the geometric intersection number with signs of and , the Cappell–Lee–Miller index is given by
Definition 6.
For a Lagrangian pair , , if crosses transversely at each intersection time t, then the Cappell–Lee–Miller index is defined by
which is the geometric intersection number counted with signs.
The signs depend on the orientation of crossing . We consider the simple case of . For example, let
Since the Maslov cycle , then, there is only one intersection time . Thus, we have
We can see that crossing anti-clockwise in , it will be counted with the positive sign, and if the crossing is in the opposite direction, it will be counted with the negative sign. For any , is a proper path. At each intersection time , is locally isomorphic to one of the following two cases:
Suppose that there are p intersection points and q intersection points of these two cases, by Definition 6, we have
3. The Maslov-Type Index for Orthogonal Symplectic Paths
In this section, we will construct the Maslov-type index for orthogonal symplectic paths and use the methods of perturbation and extension. Recall that
and define the singular set
To deal with the orthogonal symplectic paths whose endpoints are on the singular set, we need the following lemma:
Lemma 1.
For any , there exists a sufficiently small such that the end points of Φ under the perturbation are not on the singular set , i.e., . Moreover, this perturbation will not change the rotation number, and hence
Proof.
Set
If both and are not equal to , then there exists such that this lemma holds. Otherwise, we choose , and then
If is small enough, then and are not equal to , i.e., they are not on the singular set . The rotation number
This completes the proof of this lemma. ☐
In addition, the rotation number is not always an integer. To define an integer-valued index, we consider the extension of the paths to construct an integer. For any with the form
since , then has two connected components
We will construct the extension in these two connected components, which depends on the endpoints of the paths. To show that the index is independent of the choices of the extensions, we need the following lemma:
Lemma 2.
If Φ is a loop in , i.e., , then the rotation number of Φ is equal to zero, i.e., .
Proof.
Choose any loop , which has the form
where is continuous and satisfies . Since and they lie in or , then . Thus, we can obtain and hence , then
This completes the proof. ☐
Now, we define the extension for orthogonal symplectic paths. For any , by Lemma 1, there exists a small enough such that , . Let
We consider whether A and B lie in the same components of . Denote the endpoint of the extension by , then the rule to choose is given by
We define the extension for as
then, the definition of the Maslov-type index is
Definition 7.
For any , the Maslov-type index is defined by
4. Proof of the Main Results
In this section, we will complete the proofs of the main results.
Proof of Theorem 1.
Let
then . According to Definition 5 and (20), we have
By Definition 7 and Proposition 3, we can obtain
This proves that is an integer.
We continue to prove that Definition 7 is well-defined, which needs to show that is independent of the choices of the perturbations and the extensions. By Lemma 1, for sufficiently small and , the different perturbations will not change the rotation number. By Lemma 2, the rotation number of paths in only depends on the two endpoints. Let be an extension of , then is independent of the choices of . For another perturbation , denote the endpoint of the extension of by , we can choose this extension as the catenation
where and are the path in and they satisfy
By Proposition 3 and the continuity of , we can see is small enough and then
is small enough. Thus, we obtain
because they are integers, this shows that is independent of the small perturbations and the extensions. Hence, Definition 7 is well-defined.
Then, we prove the two properties. For , we can choose a suitable such that and set . The endpoints for extensions of and are and . Denote these extensions by and , by Proposition 3 and (22), we have
We only need to show that
Suppose lie in the same connected component, then, if C is also in this connected component, we define , then the catenation is a loop in . By Lemma 2 and Proposition 3, , then (29) holds. If C is in another connected component, then is a loop in . Since , then (29) also holds. If are in the different connected components, the proof is similar. By (28), (29) and (22), we have
This completes the proof of Theorem 1 (1). For
where is small enough. If , is a path in , then the catenation is a loop in , where and is the extension. Thus, by Proposition 3 and Lemma 2, the Maslov-type index
If , then and . By (20), the endpoint of the extension is . According to (9), Definition 5 and Proposition 3, we have
This completes the proof of Theorem 1 (2). For any , by Theorem 1 (1), it can be regarded as the catenation of some paths, then
If is a path in , then its Maslov-type index is equal to zero. If crosses the singular set , then it is equivalent to , where . Since
Thus, the Maslov-type index of is equal to the intersection number of crossing the singular set . This intersection number will be counted with signs of b. This completes the proof of Theorem 1. ☐
Proof of Theorem 2.
Finally, we intend to prove Theorem 2. Let be a pair of Lagrangian paths, where and and
By Proposition 2, the path can correspond to a unique orthogonal symplectic path
We apply this result to the proper path . If
then corresponds to the orthogonal symplectic path
Since if and only if , which corresponds to , then crosses if and only if crosses . After the perturbation, has no intersections at the endpoints, then is equal to intersection number of crossing . According to Definition 6, we obtain
By Lemma 1, the perturbation will not change the rotation number. Since is defined by the rotation number, then and hence
This means that the intersection number of the Lagrangian pair can correspond to the intersection number of the orthogonal symplectic path crossing the singular set , which can be calculated by the rotation number. This completes the proof of Theorem 2. ☐
5. Discussion
In this section, we present more details of the index constructed by Cappell, Lee and Miller [3]. Furthermore, we will consider the more general cases of higher dimensions and show the idea behind the construction of the Maslov-type index.
5.1. Comparison with
In [3], Cappell, Lee and Miller introduced four definitions for the index of a Lagrangian pair. These definitions satisfy the same system of axioms and are equivalent to one another. We have presented the special case of a geometrical definition in Section 2.3. More generally, can be defined for
where are two arbitrary Lagrangian paths. According to the system of axioms in [3], is a symplectic invariance. Thus, for any symplectic path , we have
We can choose a suitable path such that , then, the general cases can correspond to the special case of . Therefore, Theorem 2 implies the relationship between the Maslov-type index and those four definitions in dimension 2.
5.2. The Idea Behind the Construction of the Maslov-Type Index in Higher Dimensions
In dimension 2, we use the methods of perturbation and extension to construct the Maslov-type index
In order to generalize this definition in dimension , it is necessary to address the following issues:
- (1)
- How to define the rotation number . The rotation number is defined by the paths on the unit circle; thus, we only need to map the orthogonal symplectic paths to the unit circle. For any orthogonal symplectic path , it has the formwhere are two paths of matrices and they satisfy and . Thus, is a path of unitary matrices. Defineas the generalization of (11), then, we can also define the rotation number by (see Definition 5).
- (2)
- How to define the singular set . In [4,7], the authors considered the set of the symplectic matrices that have eigenvalues equal to 1. In our definition, . Thus, we can consider the set of orthogonal symplectic matrices that have eigenvalues equal to 1 or . By perturbation , the two endpoints will lie in . The rotation numberThis means Lemma 1 holds in the general case. In fact, Lemma 2 also holds in the general case. As the state of reference [4,12], the rotation number can be viewed as the contributions of some eigenvalues on the unit circle. For any loops in , all eigenvalues on the unit circle do not cross . Referring to the proof of Lemma 2, we see that the contributions of all eigenvalues are equal to zero. According to the discussion above, we can see that the methods of perturbation and extension can be generalized to the more general case.
- (3)
- How to choose the endpoint of the extension . The last issue is that one should choose a suitable endpoint of the extension such that the Maslov-type index is an integer. However, the topological structure of is complicated in the general case. We have to find all connected components of and hence, we can define the extension in one of these connected components. If we can choose a suitable endpoint of the extension in each connected component, the Maslov-type index can be generalized in dimension . This is the work that we need to study further.
Author Contributions
Conceptualization, Q.Z.; Writing—original draft, Q.Z.; Writing—review and editing, H.-L.H.; Supervision, H.-L.H. All authors have read and agreed to the published version of the manuscript.
Funding
Both authors are partially supported by project No. 2021A1515010379 of the Guangdong Basic and Applied Basic Research Foundation, China.
Data Availability Statement
The findings presented in this article are not supported by data, and the argument is not substantiated by data analysis or data generation.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Maslov, V.P. Theory of Perturbations and Asymptotic Methods; French Translation, Dunod, Paris, 1972; Izdat. Moskov. Gos. Univ.: Moscow, Russia, 1965. [Google Scholar]
- Arnold, V.I. Characteristic class entering in quantization conditions. Funcktsional’nyi Analiz i Ego Prilozheniya 1967, 1, 1–14. (In Russian); Funct. Anal. Its Appl. 1967, 1, 1–13. (English Translation) [Google Scholar] [CrossRef]
- Cappell, S.E.; Lee, R.; Miller, E.Y. On the Maslov index. Commun. Pure Appl. Math. 1994, 121–186. [Google Scholar] [CrossRef]
- Conley, C.C.; Zehnder, E. Morse-type index theory for flows and periodic solutions of Hamiltonian equations. Commun. Pure Appl. Math. 1984, 37, 207–253. [Google Scholar] [CrossRef]
- Liu, C. Maslov-type index theory for symplectic paths with Lagrangian boundary conditions. Adv. Nonlinear Stud. 2007, 7, 131–161. [Google Scholar] [CrossRef]
- Liu, C. Index Theory in Nonlinear Analysis; Science Press: Beijing, China, 2019. [Google Scholar]
- Long, Y. Maslov-type index, degenerate critical points, and asymptotically linear Hamiltonian systems. Sci. China Ser. A 1990, 7, 673–682. (In Chinese); Sci. China Ser. A 1990, 33, 1409–1419. ((In English) [Google Scholar]
- Long, Y. A Maslov-type index theory for symplectic paths. Topol. Methods Nonlinear Anal. 1997, 10, 47–78. [Google Scholar] [CrossRef]
- Long, Y. Index Theory for Symplectic Paths with Applications; Birkhäuser Verlag: Berlin, Germany, 2002. [Google Scholar]
- Robbin, J.; Salamon, D. The Maslov index for paths. Topology 1993, 827–844. [Google Scholar] [CrossRef]
- Robbin, J.; Salamon, D. The Spectral flow and the Maslov index. Bull. Lond. Math. Soc. 1995, 27, 1–33. [Google Scholar] [CrossRef]
- Salamon, D.; Zehnder, E. Morse theory for periodic solutions of Hamiltonian systems and the Maslov index. Commun. Pure Appl. Math. 1992, 45, 1303–1360. [Google Scholar] [CrossRef]
- Viterbo, C. A new obstruction to embedding Lagrangian tori. Invent. Math. 1990, 100, 301–320. [Google Scholar] [CrossRef]
- Floer, A. The unregularized gradient flow of the symplectic action. Commun. Pure Appl. Math. 1988, 41, 775–813. [Google Scholar] [CrossRef]
- Floer, A. Symplectic fixed point and holomorphic sphere. Commun. Math. Phys. 1989, 120, 575–611. [Google Scholar] [CrossRef]
- Arnold, V.I. Sur une propriété topologique des applications globalement canoniques de la mécanique classique. C. R. Acad. Sci. Paris 1965, 261, 3719–3722. [Google Scholar]
- Arnold, V.I. Mathematical Methods of Classical Mechanics; Springer: New York, NY, USA, 1978. [Google Scholar]
- Conley, C.C.; Zehnder, E. The Birkhorf-Lewis fixed point theorem and a conjecture by V. I. Arnold. Invent. Math. 1983, 73, 33–49. [Google Scholar] [CrossRef]
- Conley, C.C.; Zehnder, E. A global fixed point theorem for symplectic maps and subharmonic solutions of Hamiltonian equations on tori. Proc. Symp. Pure Math. 1986, 45, 283–299. [Google Scholar]
- Fukaya, K.; Ono, K. Arnold conjecture and Gromov–Witten invariants for general symplectic manifolds. Topology 1999, 38, 933–1048. [Google Scholar] [CrossRef]
- Liu, G.; Tian, G. Floer homology and Arnold conjecture. J. Differ. Geom. 1998, 49, 1–74. [Google Scholar] [CrossRef]
- Bangert, V.; Long, Y. The existence of two closed geodesics on every Finsler 2-sphere. Math. Ann. 2010, 346, 335–366. [Google Scholar] [CrossRef]
- Hu, X.; Long, Y.; Sun, S. Linear stability of elliptic Lagrangian solutions of the planar three-body problem via index theory. Arch. Ration. Mech. Anal. 2014, 213, 993–1045. [Google Scholar] [CrossRef]
- Liu, C.; Long, Y.; Zhu, C. Multiplicity of closed characteristics on symmetric convex hypersurfaces in 2n. Math. Ann. 2002, 323, 201–215. [Google Scholar] [CrossRef][Green Version]
- Liu, C.; Zhang, D. Seifert conjecture in the even convex case. Commun. Pure Appl. Math. 2014, 67, 1563–1604. [Google Scholar] [CrossRef]
- Long, Y.; Zhu, C. Closed characteristics on compact convex hypersurfaces in 2n. Ann. Math. 2002, 155, 317–368. [Google Scholar] [CrossRef]
- Long, Y.; Zhang, D.; Zhu, C. Multiple brake orbits in bounded convex symmetric domains. Adv. Math. 2006, 203, 568–635. [Google Scholar] [CrossRef][Green Version]
- McDuff, D.; Salamon, D. Introduction to Symplectic Topology; Oxford University Press: New York, NY, USA, 2017. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).