Validated numerics for period-tupling and touch-and-go bifurcations of symmetric periodic orbits in reversible systems
Irmina Walawska, Daniel Wilczak

TL;DR
This paper develops a computer-assisted framework to verify symmetry breaking and bifurcations of symmetric periodic orbits in reversible systems, with applications to celestial mechanics.
Contribution
It introduces a general method for verifying bifurcations in reversible maps and applies it to prove the existence of complex bifurcations of halo orbits in the Three Body Problem.
Findings
Proved existence of wide branches of halo orbits bifurcating from Lyapunov families.
Demonstrated multiple period doubling and quadrupling bifurcations.
Validated bifurcations for specific physical parameters.
Abstract
We propose a general framework for computer-assisted verification of the presence of symmetry breaking, period-tupling and touch-and-go bifurcations of symmetric periodic orbits for reversible maps. The framework is then adopted to Poincar\'e maps in reversible autonomous Hamiltonian systems. In order to justify the applicability of the method, we study bifurcations of halo orbits in the Circular Restricted Three Body Problem. We give a computer-assisted proof of the existence of wide branches of halo orbits bifurcating from -Lyapunov families and for wide range of mass parameter. For two physically relevant mass parameters we prove, that halo orbits undergo multiple period doubling, quadrupling and third-order touch-and-go bifurcations.
| j | k | bound on Jacobi constant () | bound on Jacobi constant () |
|---|---|---|---|
| 0 | 1 | 3.17435[03, 36] | 3.03588[11,51] |
| 1 | 4 | 3.08384097317512242430038839[79,91] | 3.01979992774088569676042962[45,59] |
| 2 | 3 | 3.058886412529835176423178819[4,6] | 3.015412945713342018918305256[4,5] |
| 3 | 2 | 3.0216192479264201986830801047[6,8] | 3.00909434962110748263791018519[3,9] |
| 4 | 3 | 2.999986911642456326104353768[3,8] | 3.00589961847845578773000478[64,75] |
| 5 | 3 | 2.997919501600216512922520[69,71] | 3.00584514988954760426886596[07,61] |
| 6 | 3 | 2.94132864491556775199[28,32] | 2.9941342902214648929134[15,26] |
| 7 | 4 | 2.940683922766931384[68,79] | 2.9940756819941148370203478568[3,4]* |
| 8 | 2 | -0.986509091038502895183600231[6,9] | -0.99874596801401641137454972[14,21] |
| 9 | 3 | -0.996795335128162658942078721[1,5] | -1.0006666037342203004067305[44,52] |
| 10 | 4 | -1.004727349648878143369879[07,22] | -1.00227845861825336488127[00,44] |
| 11 | 1 | -1.016[09,14] | -1.00460[55,77] |
| j | k | bound on Jacobi constant () | bound on Jacobi constant () |
|---|---|---|---|
| 0 | 1 | 3.15211[87,91] | 3.03413[67,72] |
| 1 | 4 | 3.071869946146936057096946[46,52] | 3.01887850935398942392012584[04,38] |
| 2 | 3 | 3.05083503865220863946099978[87,93] | 3.014802161770970024871372364[53,86] |
| 3 | 2 | 3.0229911591596336379776897124[1,5] | 3.0091557491590008844773187520[3,6] |
| 4 | 4 | 3.0158978159595140970471[78,93] | n/a |
| 5 | 2 | 3.017143662542155479781194411[85,94] | n/a |
| 6 | 4 | 3.0190035761795315910790[19,29] | n/a |
| 7 | 3 | 3.077836508502735302[69,73] | 3.019542146861187965925873562[20,98] |
| 8 | 4 | 3.104289978034786552471088092[8,9]* | 3.024350541079342605537853984[5,6]* |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Validated numerics for period-tupling and touch-and-go bifurcations of symmetric periodic orbits in reversible systems
Irmina Walawska
Daniel Wilczak
Faculty of Mathematics and Computer Science, Jagiellonian University, Łojasiewicza 6, 30-348 Kraków, Poland.
Abstract
We propose a general framework for computer-assisted verification of the presence of symmetry breaking, period-tupling and touch-and-go bifurcations of symmetric periodic orbits for reversible maps. The framework is then adopted to Poincaré maps in reversible autonomous Hamiltonian systems.
In order to justify the applicability of the method, we study bifurcations of halo orbits in the Circular Restricted Three Body Problem. We give a computer-assisted proof of the existence of wide branches of halo orbits bifurcating from -Lyapunov families and for wide range of mass parameter. For two physically relevant mass parameters we prove, that halo orbits undergo multiple period doubling, quadrupling and third-order touch-and-go bifurcations.
keywords:
bifurcations of periodic orbits, reversible systems, validated numerics, halo orbits.
MSC:
[2010]65P30,
MSC:
[2010]65G20,
MSC:
[2010]37M20,
MSC:
[2010]37C27
††journal: Communications in Nonlinear Science and Numerical Simulation
1 Introduction
In the past 40 years there were proposed very efficient methods for numerical continuation of periodic orbits for general ODEs, or periodic orbits satisfying certain symmetries with special focus on applications to Hamiltonian systems [19, 37, 22]. They are implemented in very efficient packages, such as AUTO [18], MATCONT [17] and CONTENT [27].
Most of the methods are similar in the spirit. The family of periodic orbits satisfies certain finite-dimensional implicit equations, which is solved by a Newton-like scheme. The equations usually involve period (return time) of the orbit, space variables and/or value of the Hamiltonian. The Newton-like iteration requires computation of monodromy matrix, which is not an issue nowadays, where many efficient tools for integration of ODEs along with variational equations are available [4, 23, 10].
Bifurcations of periodic orbits can be detected by looking at changes of determinant of monodromy matrix [54], inspecting so-called stability parameter in low dimensional systems [21, 22], analysis of normal form after Lyapunov–Schmidt reduction [16] or solving an equation specific for the type of bifurcation [38]. Literature on the topic is really wide, and the list of methods and references mentioned above is clearly incomplete.
The present paper is complementary to the above results and methods. We focus on reversible maps and reversible Hamiltonian systems. The primary result of the paper is a general framework for rigorous computer-assisted verification, that a branch of symmetric periodic orbits undergoes period-tupling and/or touch-and-go bifurcation. Finding an approximate numerical candidate for bifurcation point is just a preliminary step of the validation algorithm and for this purpose we can use any of the methods mentioned above [16, 22, 21, 38, 54]. Then, checking several inequalities on the (Poincaré) map under consideration and its derivatives on an explicit neighbourhood (input to the algorithm) of the approximate bifurcation point we can prove, that it contains a bifurcation point and we can conclude about type of bifurcation. As an output of the algorithm we obtain guaranteed bounds on both the bifurcation point and the parameter of the system, at which bifurcation occurs.
In order to justify applicability of the framework we apply it to the Circular Restricted Three Body Problem (CR3BP) [44]. We give a computer-assisted proof of the existence of wide branches of so-called halo orbits bifurcating from the families of planar Lyapunov orbits around libration points. We also prove, that for some physically relevant mass parameters of the system, these branches undergo period-tupling and touch-and-go bifurcations. These rigorous results are justification of some numerical observations from previous articles, in particular [21, 19]. We also would like to emphasize, that we have found a new phenomenon regarding bifurcations of halo orbits near libration point, when the mass parameter of the system tends to zero. We have observed, that the energy at the symmetry breaking bifurcation, which creates halo orbit, as a function of the mass parameter is not monotone, when the relative mass tends to zero — see Remark 19. Although not validated, this observation has been made using nonrigorous numerics with very high accuracy.
Rigorous numerical investigation of periodic orbits to ODEs became quite standard [2, 9, 11, 24, 25, 41, 45, 48, 49, 50]. To the best of our knowledge, there are very few results regarding computer-assisted verification of bifurcations of periodic orbits of ODEs, and the field remains widely open. Validation, that a family of periodic orbits undergoes a bifurcation usually involves computation of rigorous bounds on higher order derivatives of the trajectories with respect to initial condition (except some special cases when the system admits additional structure). The algorithm capable to do that appeared just in 2011 [53] (implemented as a part of publicly available CAPD library [10]) and to the best of our knowledge there are no other publicly available algorithms for rigorous integration of higher order variational equations. The -Lohner algorithm from [53] has been already applied to study period-dubling bifurcations of periodic orbits [51] in the Rössler system [43], homoclinic tangencies of periodic orbits in a time-periodic forced-damped pendulum equation [52] and non-local cocoon bifurcations [28] in the Michelson system [32]. Very recently [6], another approach to compute periodic orbits for ODEs without integration of the system has been proposed. Periodic solutions are approximated via piecewise Chebyshev polynomials and then their existence is validated by analysis of certain nonlinear operator on a Banach space of Chebyshev coefficients. The efficiency of the method is illustrated on the example of Equilateral Circular Restricted Four Body Problem. Similar approach has been successfully applied for validated computation of bifurcations of equilibria for ODEs and steady states for PDEs — see for example [8, 30, 31]. A different, geometric method for validation of bifurcations of steady states in the Kuramoto-Sivashinsky PDE is also proposed in [55].
Our algorithm for proving the existence of period-tupling and touch-and-go bifurcation is similar in the spirit to that proposed in [51, 55], but exploits the presence of a reversing symmetry of the system. After fixing an appropriate coordinate system in a neighbourhood of an apparent bifurcation points, we perform validated Lyapunov-Schmidt reduction. In this way, the analysis of bifurcation is transformed to zero-finding problem of a bivariate scalar-valued function, called bifurcation function. Then, checking some inequalities on derivatives of the bifurcation function we can prove, that its set of zeroes is the union of two smooth curves which intersect at an unique point — the bifurcation point. Finally, some non-degeneracy conditions (inequalities on higher order derivatives of the bifurcation function) let us to conclude about the type of bifurcation. In this paper we restrict to symmetry breaking, period-tupling and touch-and-go bifurcations.
The article is organized as follows. In Section 2 we introduce notation and main definitions used in the paper. Theoretical results, which constitute a basis of the computational framework for general reversible (Poincaré) maps are presented in Section 3 and then adopted to autonomous reversible Hamiltonian systems in Section 4. Finally, in Section 6 we give formal statements of theorems regarding continuation and bifurcations of halo orbits in the CR3BP.
In the Appendix we present two auxiliary yet new results, which are included mainly for self-consistency of the paper. Frequently we have to show, that a solution to an implicit equation is defined over an explicit domain. This step appears for example in continuation of periodic orbits or in validated Lyaunov-Schmidt reduction. Although there are available methods for this purpose (see for example [7, 20, 53, 9]), in A we provide an improvement, which takes advantage from higher order derivatives and flattening the implicit function by a smooth, well chosen substitution. In B we propose own and short algorithm for finding an approximate bifurcation point. It takes advantage from the Lyapunov–Schmidt reduction and computation of higher order derivatives of the (Poincaré) map under consideration. Using it, we could easily localize approximate bifurcation points in the CR3BP with the accuracy .
2 Preliminaries
2.1 Notation and basic definitions
For a map , a predicate and a set we introduce the following notation
[TABLE]
Thus, is the set of fixed points of in satisfying constraint . Although there is a natural correspondence between subsets of and univariate predicates defined on , we will separate and to emphasize rather rare property in a larger (usually open) set . We will also write if . For a set and , we define its slice by . For a map and fixed we define by .
Definition 1
A homeomorphism is called a reversing symmetry for if and for there holds
[TABLE]
It is easy to see that any reversing symmetry for is also a reversing symmetry for all iterations defined on their proper domains.
Definition 2
A homeomorphism is called a symmetry for if and for there holds
[TABLE]
For a map we define a predicate by
[TABLE]
We will use this notation to select points satisfying certain symmetries.
2.2 Geometric definitions of two types of bifurcations
Our primary object of interest is a -smooth function defined on an open set , where is a smooth manifold. In this article we make the following standing assumption:
- C1:
for , if then the function is a diffeomorphism onto image.
The above assumption fits the applications we have in mind, i.e. will be a one-parameter family of Poincaré maps. Thus, the domain of each map may vary with the parameter .
Bifurcations are usually defined by their normal forms [13]. The following
[TABLE]
describe period-tupling and transcritical bifurcations, respectively. When an eigenvalue of the derivative of a reversible planar map at a symmetric fixed point crosses resonance, , generically period-tupling or touch-and-go bifurcation occurs (notation following [5]) — two types of generic bifurcations for strong resonances are illustrated on Figure 1. The branches of symmetric periodic points near bifurcation point look similarly to those for pitchfork and transcritical bifurcations, respectively.
This observation lead us to the alternative definitions, in which these two types of bifurcations are described by some geometric conditions on the mutual position of two intersecting curves, that solve equation — see Figure 2. These definitions are motivated by our algorithm for validation of bifurcations (Section 3), which is geometric in its spirit. Then, in Section 3.4 we will show, that these geometric definitions along with some non-degeneracy conditions imply standard unfolding (2)–(3) of these bifurcations.
Definition 3
Let be a predicate and let be a positive integer. We say that has period –tupling bifurcation at , if there exists , such that and there are continuous and smooth in the interior of their domains functions
[TABLE]
such that and the following conditions are satisfied.
Periodic points:
[TABLE] 2. 2.
If is even, then for there holds
[TABLE]
Definition 4
Let be a predicate and let be a positive integer. We say that has –order touch-and-go bifurcation at , if there exists , such that and there are continuous and smooth in the interior of their domains functions
[TABLE]
satisfying the following conditions.
Periodic points:
[TABLE] 2. 2.
The curves and intersect at exactly one point .
The above two definitions are slightly more general than the normal forms (2)–(3). Indeed, it is easy to see that the functions
[TABLE]
also satisfy geometric conditions from Definition 3 and Definition 4 for any .
3 Validation of bifurcations of symmetric periodic orbits: reversible maps
Let be a family of –reversible maps satisfying our standing assumption C1. In this section we propose a general framework for computer-assisted verification that a branch of -symmetric period- points for undergoes symmetry breaking, period-tupling or touch-and-go bifurcation. Let be an explicit neighbourhood of an approximate bifurcation point (both are input to the algorithm). The algorithm is split into two steps.
In the first step we validate, that the set of points , such that is either period- point or period- point for is a union of two regular curves intersecting at exactly one point. This is a common step for period-tupling and touch-and-go bifurcations and it will be described in Section 3.1. In the case of symmetry breaking bifurcation, we need an additional constraint, which allows to isolate the primary curve of period- points and the branching-off curve of period- points. In Section 3.3 we will show, that such a problem can be solved, if the system has an additional symmetry, which commutes with .
The second step is specific for each type of bifurcation. We provide checkable by means of rigorous numerics conditions, which guarantee, that the two curves intersect in a manner given by Definition 3 and Definition 4.
Finally, in Section 3.4 we show that some additional non-degeneracy conditions lead to standard unfolding of the computed bifurcations to their normal forms (2) and (3).
3.1 Bifurcation as two intersecting curves
We are mostly interested in studying bifurcations of symmetric periodic orbits of –reversible ODEs. In continuous-time –reversible dynamical systems, a trajectory is –symmetric, if it is either an equilibrium belonging to or it intersects twice the set — see [29]. In order to obtain isolated symmetric periodic orbits we assume, that and is an -dimensional submanifold.
Let us fix and assume that is a good numerical approximation of a bifurcation point, i.e. one of the eigenvalues of is close to resonance. Since all types of bifurcations we are studying are local phenomena, we assume, that there is an open interval and an open set , such that and for the function is defined on . We also assume that there are local coordinates in in which
[TABLE]
We will use the same symbols as a coordinate system near . Solutions to
[TABLE]
are –symmetric periodic points of with principal period not larger than . The solution set to (4) near is expected to be a union of two curves, one of which corresponds to the fixed points of and the second corresponding to period- points of .
Remark 5
There are rigorous numerical methods for validation, that a solution set to an implicit equation forms a regular curve over an explicit domain — see for example [9, 7, 51]. In this paper we propose slightly improved version of the Interval Newton Operator [1, 34, 39]. Since it is only an auxiliary step of the main algorithm for validation of bifurcations, we postpone this improvement to A.
The case (symmetry breaking bifurcation) will require additional constraint and will be discussed in Section 3.3. If , we may apply the method described in A to solve (4) on an explicit range of parameter values . In what follows we assume, that there is a smooth curve
[TABLE]
such that for and
[TABLE]
In most cases, the function cannot be computed exactly, but using rigorous numerics we can prove, that it exists and we can find bounds for and its derivatives. Although it is not required, it is desirable for further numerical computation to choose the coordinate system in and the decomposition so that .
The idea of computing the second curve of -symmetric, period- points, which solves (4) goes as in [51]. At first, we perform the Lyapunov-Schmidt reduction [13]. We split and using the method from A we solve for a function satisfying implicit equation
[TABLE]
Assuming that is locally unique solution to (7) in , we can define so-called bifurcation function
[TABLE]
In this way we reduced the problem of finding zeros of (4) to a problem of finding zeros of a bivariate scalar-valued function (8). By the construction, the function vanishes at , for — see (5). Therefore, we can factorize it in the following way
[TABLE]
where
[TABLE]
The function is called the reduced bifurcation function. Recall, that in most cases the function is unknown and we have only a rigorous bound on it and its derivatives. Similarly as , the function cannot be computed exactly. However, it possible to bound values and partial derivatives of using integral representation (10).
In the second step, we apply the method from A to prove, that the set of zeroes of can be parametrized as a smooth curve . To sum up, in addition to C1, we make the following standing assumptions, which are all checkable be means of rigorous numerical methods:
- C2:
is a closed interval and is closed set, such that for and the solution set to (7) in is a graph of smooth function ;
- C3:
there exists a smooth function , such that
[TABLE]
where is defined by (10);
- C4:
there holds
[TABLE]
We will finish this section by showing, that assumptions C1–C3 imply, that the two curves, which solve (4) intersect at some point, while C4 implies that this intersection is unique.
Lemma 6
Let and be continuous, where is an open interval, is a closed interval and . Then there exists , such that .
Proof: Since , the set has two connected components containing the points and , respectively. Since is continuous, there is such that for some . \qed
Lemma 7
Under assumptions C1–C4, there is a unique point , such that and .
Proof: From C2–C3 and Lemma 6 the curves and intersect at some point . Assume that is another intersection point for some . For we define and
[TABLE]
From C3 we have and , where
[TABLE]
We will argue, that and thus by C4 there must be . For we have
[TABLE]
In particular, for fixed and , both second partial derivatives of are evaluated at a point which does not depend on . Therefore
[TABLE]
Similarly
[TABLE]
[TABLE]
\qed
3.2 Validation of period-tupling and touch-and-go bifurcations
Assumptions C1–C4 are easily checkable by means of rigorous numerics. The curve of -symmetric period- points is defined on an explicit domain , which makes it possible for further continuation of this branch by the standard methods [9, 7, 20, 51] (see also A). On the other hand, Lemma 7 guarantees, that there is an unique bifurcation point in the domain under consideration. The type of bifurcation, however, is unknown.
In what follows, we derive conditions, which along with C1–C4 guarantee, that period tupling or touch-and-go bifurcation occurs in the sense of Definition 3 and Definition 4, respectively.
Theorem 8
Under assumptions C1–C4, if is odd and
[TABLE]
then has -order touch-and-go bifurcation at some point .
Proof: From Lemma 7 there is a unique intersection point of two curves of zeroes of in . From (14) it follows that
[TABLE]
Differentiating the identity we obtain
[TABLE]
From the above and (15) we conclude, that . Therefore, there is an interval , such that and the inverse function is defined on it. Since , the interval can be chosen so that .
Define . We assumed, that is a submanifold given locally by . Therefore, there exists sufficiently small , such that for we have
[TABLE]
where
[TABLE]
From (6) it follows that
[TABLE]
for . Thus, all requirements from Definition 4 are satisfied on the set and for the point . \qed
The next theorem provides a framework for computer-assisted verification of the presence of period -tupling bifurcation.
Theorem 9
Assume C1–C4. If is even and
[TABLE]
then has period -tupling bifurcation at some point .
Proof: From Lemma 7 we know, that the curves and intersect at exactly one point . We will prove, that is a proper local minimum of . First we will show, that .
Define . Let us choose a sequence , such that and . Define and . Since and the intersection point is unique it follows, that is period- point. Since , is even and is a fixed point for we conclude, that for large enough the point satisfies and
[TABLE]
The point is an -symmetric, -periodic point for , so it solves (4). Therefore . Since , assumption C2 implies, that also . By the Rolle’s Theorem there is a point in the interval joining and at which vanishes. In consequence, arbitrary close to there is a point at which is zero, which by the smoothness of implies .
We will show that . Differentiating we obtain
[TABLE]
On the other hand
[TABLE]
Therefore
[TABLE]
We also have
[TABLE]
Differentiating twice with respect to , we obtain
[TABLE]
Using and (16)–(19) we conclude, that
[TABLE]
This proves, that the function has a proper local minimum at .
Now, we will construct the functions as required by Definition 3. Since , we can shrink in such a way, that , and is strictly convex on . Given that is smooth (so it has bounded slope near ) and we conclude, that for there holds . Shrinking from below, if necessary, we may also assume that for and .
Let us fix . The function is monotone on and . Therefore, for
[TABLE]
and the functions can be chosen to be continuous and smooth in . Define . For some sufficiently small the functions
[TABLE]
given by
[TABLE]
satisfy conditions from Definition 3. From (6) it follows that
[TABLE]
for , which completes the proof. \qed
3.3 Symmetry breaking bifurcations
A special type of bifurcation covered by Definition 3 is when . In the case of reversible maps, we are looking for the set of fixed points of , which near the bifurcation point is expected to be a union of two intersecting curves. Thus, the principal branch of fixed points of cannot be isolated by applying Interval Newton Operator (A) to (4). Therefore, we need an extra constraint in order to isolate two curves that intersect at the bifurcation point. A possible scenario for this kind of bifurcation is breaking some symmetry , which provides desired additional constraint , as defined by (1).
Let be a family of –reversible and –symmetric maps. As in Section 3.1, we focus on computation of the set of –symmetric fixed points for .
Let be an apparent bifurcation point and let be an open set, such that and . We assume, that there are local coordinates in , such that
[TABLE]
We impose that and intersect transversally. In the above settings, we expect that for the set of double-symmetric fixed points of in is a single point
[TABLE]
Thus, using the method described in A, it is possible to isolate the curve
[TABLE]
from the branching-off curves , which intersect at exactly one point located in .
The remaining steps in validation of the existence of a symmetry breaking bifurcation go as described in Section 3.1 and Section 3.2. We perform the Lyapunov-Schmidt reduction (7) and we define the bifurcation functions and by (8) and (10), respectively.
In Theorem 9 we assumed that the period of branching-off orbits is even. This lead us to a conclusion, that after half of iterations, the points sufficiently close to the bifurcation point come back to its vicinity. This allowed us to prove, that the reduced bifurcation function has a local minimum at the bifurcation point, which was the crucial step in the proof of the presence of period-tupling bifurcation.
In the case of the symmetry breaking bifurcation we cannot use this argument, because is odd. The next theorem says, that commutativity of and yields to the same conclusion.
Theorem 10
Let and be a symmetry and a reversing symmetry for , respectively. Assume that C1–C4 are satisfied for and with given by (20). If the symmetries and commute and (16) is satisfied, then has symmetry breaking bifurcation at some point .
Proof: From Lemma 7 there is an unique , such that and . Let us set .
We will show, that . Take a sequence of points from , which converges to and such that for . Let us define , and . By the commutativity of and we have
[TABLE]
hence . Similarly , because
[TABLE]
This shows, that solves (4) with and . Since
[TABLE]
we conclude, that for large enough.
Since and the intersection point is unique, it follows that , so . This and C2 imply that also . By the Rolle’s Theorem there is a point in the interval joining and at which vanishes. Given that both and (see (21)) converge to we conclude, that arbitrarily close to there is a point at which is zero and thus .
The remaining part of the proof goes as in Theorem 9. Condition (16) implies, that , which proves that is a proper minimum of . This makes it possible to define two branches and , as required in Definition 3. \qed
3.4 General unfolding of period-tupling and touch-and-go bifurcations
Theorem 8 and Theorem 9 provide frameworks for computer-assisted verification, that the two types of bifurcations occurs in the sense of geometric conditions given by Definition 4 and Definition 3, respectively. In this section we will show, that the same geometric assumptions lead to standard unfolding of these bifurcations.
Theorem 11
Under assumptions of Theorem 9 (C1–C4 and (16)), there is a smooth -dependent substitution , which brings the bifurcation function (8) to the normal form
[TABLE]
where does not vanish at and is positive at .
Proof: Let be the parameter value at which bifurcation occurs. Without loosing generality we may assume, that . From the proof of Theorem 9 we have that . Differentiation of the identity gives
[TABLE]
First, a -dependent substitution brings to the form
[TABLE]
Put . Differentiation of the product gives
[TABLE]
because and from (23) also . The non-degeneracy condition (16) and C4 imply that
[TABLE]
Using (24)–(28) we can write in the form
[TABLE]
where , are -dependent coefficients with and . Consider a -dependent substitution of the form
[TABLE]
Then
[TABLE]
In order to annihilate the term we should take , which is well defined near , because . With such choice of , we have
[TABLE]
where and . Put . From (16) and (28) we have . Therefore . Setting we conclude, that takes the required form (22). \qed
Theorem 12
Under assumptions of Theorem 8 (C1–C4 and (14)), there is a smooth -dependent substitution which brings the bifurcation function (8) to the normal form
[TABLE]
where , and they are non-zero at .
Proof: Let be the parameter value at which bifurcation occurs. Without loosing generality we may assume that . Reasoning as in the proof of Theorem 11, substitution brings to the form . Put . From C1–C4 and (14) we have that
[TABLE]
Hence, in these coordinates we have
[TABLE]
with and . Setting and we obtain the required normal form (29). \qed
4 Validation of bifurcations of symmetric periodic orbits: reversible Hamiltonian systems
In this section we show, how to adopt the general framework described in Section 3 to autonomous Hamiltonian systems. We consider an –reversible Hamiltonian system
[TABLE]
where is the standard symplectic matrix and is -smooth. First, we choose a -smooth Poincaré section . If , by [48, Lemma 3.3] the Poincaré map is –reversible, too. In what follows we will study bifurcations of -symmetric fixed points for .
In autonomous Hamiltonian systems, a natural choice of the bifurcation parameter is the value of , because it is a constant of motion. On the other hand, from the point of view of rigorous numerics, it is much easier and efficient to work in the phase space coordinates and parametrize periodic orbits for by one of them.
This dissonance between numerical efficiency and formal description of a bifurcation is solved in the following way. We expect that two families of periodic points for intersect at a bifurcation point. This geometric condition can be checked in the phase-space coordinates. Additional conditions on , which will be given in this section, will guarantee, that can be used (locally) as a bifurcation parameter.
Let us give a brief overview of the construction we are going to perform. Period-tupling and touch-and-go bifurcations are local phenomena. Thus, we can choose local coordinates near an apparent bifurcation point, such that
and 2. 2.
.
In order to simplify further notation we will use coordinates in and we will always skip as an argument of and . We also assume, that the vector field (31) is transverse to near an apparent bifurcation point, so that the Poincaré map is well defined and smooth. Define .
Assuming that near an apparent bifurcation point there holds
[TABLE]
we can conclude that the projection is a local diffeomorphism. This allows us to parametrize locally by for belonging to some interval . Our goal is to specify conditions on and , which will guarantee, that the map
[TABLE]
is well defined on some domain and it has period-tupling and/or touch-and-go bifurcations in the sense of Definition 3 and Definition 4, respectively.
Let us fix . Following Section 3, we split and . We assume, that the set of –symmetric fixed points of near an apparent bifurcation point forms a regular curve, which is parametrized by the coordinate
[TABLE]
and defined on an explicit, open interval . We also assume, that for there holds
[TABLE]
First we perform the Lyapunov-Schmidt reduction. We assume that there is a set and a smooth function , such that for
[TABLE]
Using this implicit function we can define the bifurcation function by
[TABLE]
and factorize it as , where the reduced bifurcation function reads
[TABLE]
Now we can specify the standing assumptions in the context of Hamiltonian systems:
- HC2:
is a closed interval, and is a closed set, such that for , where is given by (33) and there is a smooth function solving (35);
- HC3:
there exists a smooth function such that
[TABLE]
where is defined by (37);
- HC4:
there holds
[TABLE]
Assumptions HC2–HC4 and Lemma 7 imply, that the set of –symmetric fixed points for in is the union of two regular curves, which intersect at unique point , where is defined by (35). These parametric curves are defined on explicit range and , respectively, which makes it possible for further continuation of these branches by the method described in A. On the other hand, we have no information about the type of bifurcation at the intersection point.
Generically we expect, that the value of can be used as the bifurcation parameter. It may happen, however, that is not monotone (or even constant) along one or both curves of periodic points. In the remaining part of this section we derive (easily checkable by means of rigorous numerics) conditions, which guarantee, that
can be used as the parameter near and 2. 2.
the mapping (32) undergoes one of the bifurcations defined by Definition 3 and/or Definition 4.
For further use we define four functions
[TABLE]
Lemma 13
If and
[TABLE]
then there is an open interval and an open set , such that
, 2. 2.
* is well defined diffeomorphism onto image and* 3. 3.
* is defined on .*
Proof: From (38) it follows, that and thus is a local diffeomorphism near . The inverse function takes the form
[TABLE]
Since is a fixed point of , we can also find open sets and , such that and such that is defined on . \qed
Theorem 14
Assume HC2–HC4 and let be the unique intersection point from Lemma 7. If is odd, , and , then defined by (32) has -order touch-and-go bifurcation at .
Proof: Take from Lemma 13. From (33)–(34) the point , is of principal period for , except the intersection . Since and , we can choose , , such that and are defined on and both functions
[TABLE]
have range in . By the construction they satisfy conditions from Definition 4 for the function defined by (32). \qed
Theorem 15
Assume HC2–HC4 and let be the unique intersection point from Lemma 7. If is even, , and , then defined by (32) has period -tupling bifurcation at .
Proof: Take from Lemma 13. We will show that . Let us fix a sequence , such that and is defined for all . Let us set and . We also have , because by (34) the principal period of is . This and HC3 imply, that . Since is even and is a fixed point for , we have that , and . Hence, in the interval joining and there is a point at which vanishes and in consequence . The assumption implies, that is a proper local minimum of .
The remaining part of the construction goes as in Theorem 9. The function is convex near which allows us to define two continuous branches
[TABLE]
of , for some . The function is invertible near , because we assumed that . Restricting the domain, if necessary, we may assume, that the inverse is defined on with . Define
[TABLE]
Shrinking again the interval if necessary, we may assume, that the range of the above three functions is in . Thus defined by (32) has period -tupling bifurcation at . \qed
We end this section by a version of Theorem 10 for Hamiltonian systems. Proceeding as in Section 3.3 we assume, that (31) admits a symmetry and a reversing symmetry . We also assume that the function defined by (33) satisfies
[TABLE]
Then, we define and by (36) and (37), respectively. We state the following result without a proof, as it is similar to that of Theorem 10 and Theorem 15.
Theorem 16
Assume HC2–HC4 with and let be the unique intersection point from Lemma 7. If and commute, , and , then defined by (32) has symmetry breaking bifurcation at .
5 Bifurcations of odd periodic solutions in the Falkner-Skan equation
The Falkner-Skan equation [35] is a third order ODE given by
[TABLE]
It is low-dimensional and without singularities. Therefore it is relatively easy for rigorous numerical investigation. Although for some physical reasons solutions of certain BVP for (39) are relevant, we use the system to test the methodology introduced in Section 3 and thus we will focus on periodic solutions. Using this example we will also provide the reader with some details regarding validation of the presence of period-tupling and touch-and-go bifurcations. A higher-dimensional hamiltonian system (Circular Restricted Three Body Problem), which is also more computationally demanding, will be studied in Section 6.
Our aim is to prove that some family of odd periodic solutions of (39) parametrized by undergoes period-doubling, third order touch-and-go and period-quadrupling bifurcations.
The equation (39) can be rewritten as a system of first order equations
[TABLE]
and in the sequel we will work with (40). The system (40) is reversible with respect to . For all the points are -symmetric equilibria. Numerical simulation shows, that there is a family of -symmetric periodic orbits parametrized by . These periodic orbits intersect the symmetry line at exactly two points, which approach , respectively, when — see Fig. 3. Thus, the period of these orbits goes to infinity when . It is also observed, that goes to infinity when .
For small , these periodic orbits are hyperbolic. For larger they become elliptic and crossing strong resonances, at approximate parameter values , respectively, where
[TABLE]
Approximate initial conditions for resonant -symmetric periodic orbits are , where
[TABLE]
and their shapes are shown in Fig. 4. It seems, the family continues to exists for all approaching resonance when .
Let us define a Poincaré section
[TABLE]
We will use coordinates to describe points in . By we denote the associated Poincaré map for the system (40) with the parameter value . The map is reversible with respect to involution . We will also use the notation .
The aim of this section is to give a computer-assisted proof of the following theorem.
Theorem 17
There is a smooth family of -symmetric period-two points for parametrized by . This family undergoes period-doubling, third order touch-and-go and period-quadrupling bifurcations at some points , , respectively, with
[TABLE]
where approximate bifurcations points are listed in (41)–(42).
Proof: The existence of a smooth branch of -symmetric period-two points for has been proved by means of the method described in A. We used an adaptive cover of the parameter range , where the diameters of intervals are smaller (approximately ) if is close to and quite large (above ) in the second end of the parameter range. Then, for each subinterval we check the assumptions of the parametrized Interval Newton Method (Lemma 25). If succeed, we prove that the segments glue into a smooth curve by checking the the bounds on resulted from the Interval Newton operator overlap, when their domains do.
We will give more details regarding validation of bifurcations. The bifurcation function is
[TABLE]
for . Hence, the Lyapunov-Schmidt reduction is not needed. In order to apply the general framework introduced in Section 3 we need first to check conditions C2–C4. We have the following bounds on .
[TABLE]
We see that in each case , which proves that, there is a branch of zeroes of parametrized by , for .
In order to check C3 we need bounds on the reduced bifurcation function – see (10). We have
[TABLE]
Note, that in order to obtain tiny bounds on we used high precision interval arithmetic [36]. Again, in each case we have , which proves that for the function has branch of zeroes parametrized by and thus C3 is satisfied.
From the following estimates
[TABLE]
it follows that
[TABLE]
for and the condition C4 is also satisfied.
There remains to check conditions specific for each type of bifurcation. In (43) we have already computed bound on , which proves that the assumptions of Theorem 8 are satisfied. Thus, the proof of the existence of third order touch-and-go bifurcation for in is completed.
For period-doubling and period-quadrupling bifurcations we have to check non-degeneracy condition (16). From (43) we already have, that for there holds . Thus, it suffices to check that is non-zero. We have the following bounds
[TABLE]
Eventually, we have to check that the principal periods of bifurcating orbits. The cases do not require any computation, as both numbers are primes. For the case we computed
[TABLE]
This completes the proof. \qed
6 Halo orbits in the Circular Restricted Three Body Problem
In this section we apply the general framework described in Section 4 to the Circular Restricted Three Body Problem. First, we will give a short overview of the CR3BP and we list some of its relevant properties. Then, we will give a computer-assisted proof, that the well known families of halo orbits undergo various types of bifurcations.
6.1 Equations of motion
The CR3BP is a mathematical model, that describes the motion of a small body with negligible mass under the gravitational influence of two point like big bodies, called primaries, which rotate around their common mass centre on a circle.
Denote by the relative mass of the smaller primary. In a rotating coordinate system centred at the common mass centre of two big primaries, the dynamics of the small particle is governed by the following system of second-order differential equations [26, 44]
[TABLE]
where
[TABLE]
The system is Hamiltonian and it admits a first integral, called the Jacobi constant, which is given by
[TABLE]
The hyperplane is invariant under the local flow induced by (44) and the corresponding four-dimensional Hamiltonian system is called the Planar Circular Restricted Three Body Problem (PCR3BP).
6.2 Symmetries of the CR3BP
The system possesses two main symmetries
[TABLE]
It is important to note that and commute. This property is required for our method of validation of the existence of symmetry breaking bifurcations — see Theorem 18.
6.3 Poincaré map in the CR3BP
Let us define the following Poincaré section
[TABLE]
and denote by the associated Poincaré map. We will skip the dependency on and write , if it will be clear from the context. Since the variable is fixed and equal to zero on the section, we will use coordinates to describe points in . With some abuse of notation on , we will denote by the same letter the reversing symmetry of the system restricted to points on , i.e.
[TABLE]
Since
[TABLE]
by [48, Lemma 3.3] the mapping is reversible, too. Thus, the frameworks for computer-assisted verification of various types of bifurcations introduced in Section 4 can be applied to .
6.4 Periodic orbits near libration points
The CR3BP possesses five equilibrium points, called the libration points. All of them are located in the invariant hyperplane and thus they are equilibrium points for the PCR3BP, as well. Three of libration points, commonly denoted by , and , are collinear and are located on the -axis. They are of saddle-centre type for the PCR3BP. It is well known [44], that for all there exists a family of –symmetric periodic orbits, called planar Lyapunov orbits (PLO), that surround these libration points — see also Figure 5. In [11, 12] the existence of Lyapunov orbits around and libration points for selected mass parameters has been proved in an explicit domain. Computer-assisted methods have been used to prove [2, 45, 49, 50], that for the mass parameter corresponding to the Sun-Jupiter system there are Lyapunov orbits around and for certain energy level, and there is countable infinity of connecting orbits between them in both directions.
For the full system (CR3BP) the libration points are of saddle-centre-centre type, for all . In additional direction there exists a second family of vertical Lyapunov orbits (VLO), which are double symmetric both with respect to symmetry and reversing symmetry defined by (45). These orbits intersect twice the -axis. Therefore, an object (a spacecraft) located nearby one of those orbits will be periodically collinear with the two main primaries. Thus eclipses or shadows are unavoidable for trajectories approaching planar or vertical Lyapunov orbits.
There is a numerical evidence [19, 21, 22], that a branch of out-of-plane -symmetric orbits, called halo orbits, bifurcates from the Lyapunov family. In opposite to planar and vertical Lyapunov orbits, they never cross the -axis, except at the bifurcation point. For large vertical amplitudes the halo orbits become more and more aligned to the plane allowing continuous observation of both primaries without eclipses. Parts of -Lyapunov and -halo families are shown in Figure 5 for the relative mass corresponding to the Sun-Jupiter system.
6.5 Symmetry breaking bifurcations of halo orbits in the CR3BP
The halo orbits in the CR3BP are -symmetric, out-of-plane periodic orbits, which bifurcate from the planar Lyapunov family — see Figure 5. Although, there were extensive numerical study of these orbits and their bifurcations (just to mention few papers [22, 21, 19]), to the best of our knowledge, they were never proved to exist.
The best theoretical result in this direction has been done in [14, 15]. The authors consider a certain normal form, which approximates the CR3BP. They prove, that in the normal form system there is a branch of -symmetric halo orbits bifurcating from -symmetric planar Lyapunov orbits. Moreover, they give an explicit expression for the bifurcation point. This result is valid for all points and for all mass parameters.
The results of this section are complementary to those from [14]. We give a computer-assisted proof of the existence of halo orbits for the original CR3BP system for all libration points and for some (not full) range of . We will also study continuation and bifurcations of -halo families.
Theorem 18
There are continuous functions
[TABLE]
with and , where , such that
* is a point of symmetry breaking bifurcation of out-of-plane family of –symmetric periodic orbits from the planar family of Lyapunov orbits near libration point and* 2. 2.
for and the point is an initial condition for an –symmetric periodic out-of-plane (halo) orbit.
Proof: We applied the framework from Section 4 to the family of Poincaré maps . For fixed we proceed as follows (we skip dependencies on to simplify notation). The range of parameters is initially subdivided into smaller overlapping subintervals , where . For each we execute in parallel the following (independent) tasks.
We find an approximate bifurcation point for the mass parameter . For this purpose we use the scheme described in B — see also Remark 26. 2. 2.
The planar double-symmetric Lyapunov orbits can be easily isolated by restriction to the planar system. Using Lyapunov-Schmidt reduction and the method from A we validate the existence of smooth, two-parameter families of periodic orbits
[TABLE]
which correspond to Lyapunov orbits and halo orbits, respectively. The diameters of and were hand-optimized to speed-up computation. 3. 3.
The set is a bound for the bifurcation point for each . Then we check the assumptions of Theorem 16, i.e. , and . Note, that in Theorem 16 we required, that the branching-off curve is convex, but switching of either sign does not change the geometry of overall picture.
If any of the above steps fails, the interval is being subdivided and we repeat computation for each element of subdivision. Finally, if all tasks are completed, using the methods from [20, 7] we check, that the pieces of glue into a smooth function. \qed
Graphs of are shown in Figure 6. We would like to emphasize, that they match quite well bifurcation points coming from the normal forms found in [14]. Our validation algorithm used to prove Theorem 18, by its construction, cannot continue with . The threshold value as well as size of out of plane amplitude are by our choice a compromise between CPU time needed to obtain the result and the range of and we can cover. In particular, the range of mass parameter contains two relevant values
[TABLE]
corresponding to Sun-Jupiter and Earth-Moon systems, respectively. The values listed in (46) are taken as the nearest IEEE-754 double precision numbers to the recent mass measurements reported in [40, 3].
Remark 19
The is a special case, because for small the maximal order of normal form constructed in [14] is , and it is divergent when [42]. In this case we observe an interesting phenomenon. If , the Jacobi integral seems to be not monotone along the curve of bifurcation points — see Figure 6 right-bottom panel. The computation, which indicate the presence of a local minimum is non-rigorous but performed in high accuracy (400 bits of mantissa) floating point arithmetic [36] and using order ODE solver with the tolerance per time step set to .
6.6 Continuation and bifurcations of halo orbits
Theorem 18 guarantees that for a branch of halo orbits near can be parametrized by out of plane amplitude to at least . Numerical simulations [19, 21] strongly indicate, that these branches continue to exist for much larger amplitudes and that they undergo period-doubling and period-quadrupling and third-order touch-and-go bifurcations. The next theorem addresses this issue.
Theorem 20
Consider the CR3BP with as defined in (46). There exists a smooth function such that for the following holds true.
* is an initial condition for an –symmetric periodic (halo) orbit.* 2. 2.
* – the family is symmetric.*
This closed loop of halo orbits intersect the invariant subspace at exactly two points and , at which an symmetry breaking bifurcation occurs. Moreover, the branch undergoes period doubling, period quadrupling and third order touch-and-go bifurcations as listed in Table 1.
Proof: The branch of halo orbits is split into four pieces.
Proceeding as in the proof of Theorem 18 we validate the existence of two symmetry breaking bifurcations: one in the region and the second in — see Figure 7. From HC3 we also have, that there is a branch of out-of-plane -symmetric periodic orbits parametrized by , for an explicit . 2. 2.
Both out-of-plane families are then continued (see A) and parametrized by variable until hand-chosen threshold value , as shown in Figure 7. 3. 3.
The upper arc joining two halo orbits with is parametrized by variable.
By the well known techniques [7] we can check, that these pieces glue into a smooth curve. By the symmetry we obtain the lower branch of halo orbits. Summarizing, we obtained, that the branch of halo orbits is a compact, smooth, one-dimensional manifold without boundary. It is well known [33], that such a manifold is diffeomorphic to a circle. By the construction the manifold is -symmetric, thus the parametrization can be chosen to preserve this symmetry, as well.
Approximate bifurcation points listed in Table1 (except for were found with very high accuracy (of order ) using high-order ODE solvers from the CAPD library [10] based on high precision floating-point arithmetic [36]. Then we checked assumptions of Theorem 14 and Theorem 15 on very small sets (of the size about ) centred at these approximate bifurcation points. Notice, that in one case and we could not obtain bounds on third order derivatives sharp enough to check convexity of Jacobi integral along bifurcation curve. We checked, however, the conditions HC2–HC4, which in particular means, that there are two curves of halo orbits of period and intersecting at a single point. \qed
Remark 21
Although we did not prove it, there is a strong numerical evidence that the points belongs to the family of -Lyapunov orbits. A possible method to close this gap is to apply the method for computation of invariant manifolds of Lyapunov orbits, as proposed in [12].
Projections of the two curves for resulting from Theorem 20 onto plane are shown in Figure 7. These families form a –tori in the full phase space. Such torus for the mass is shown in Figure 8.
Numerical simulation [22, 19] shows that -halo families continue to exists until a collision with one of the primaries — see Figure 9. Hence, on the Poincaré section , coordinates of these orbits approach and respectively, while tends to infinity.
We have the following partial result for the -halo family.
Theorem 22
Consider the CR3BP with as defined in (46). There is a smooth function such that for the following statements hold true.
* is an initial condition for an –symmetric periodic (halo) orbit.* 2. 2.
* – the family is symmetric.* 3. 3.
* is a point of an symmetry breaking bifurcation.* 4. 4.
The function has a unique local minimum at satisfying
[TABLE] 5. 5.
The branches continue to at least
[TABLE]
Moreover, these branches undergo period doubling, period quadrupling and third order touch-and-go bifurcations as listed in Table 2.
Proof: The validation is split into three steps.
From Theorem 18 we know, that there is an symmetry breaking bifurcation of halo orbits from -Lyapunov family. The estimates (47) are taken from this proof. The branching of family of halo orbits is parametrized by , with . We also check that for . 2. 2.
The branch is then rigorously continued using A and parametrized by , until some hand-chosen threshold value of (dependent on ). We also checked that for there holds . 3. 3.
Further continuation of the branch starting from is parametrized by until hand-chosen threshold values (48).
Summarizing, in each segment the variable is increasing along the branch of periodic orbits which makes it possible to re-parametrize the curve as a function
[TABLE]
defined on . From the symmetry we obtain the second branch for .
The bifurcations listed in Table 2 (except ) were validated using Theorem 15 and Theorem 14 in high-precision interval arithmetics. Notice, that in two cases and we could not obtain bounds on third order derivatives sharp enough to check convexity of Jacobi integral along bifurcation curve. We checked, however, the conditions HC2–HC4, which in particular means, that there are two curves of halo orbits of period and intersecting at a single point. \qed
Remark 23
The threshold values in (48) have been chosen so that the validated arc of –halo orbits contains all strong resonances at which period-tupling and touch-and-go bifurcations occurs for both values of . Numerical simulation shows, that for larger values of strong resonances are not present. However, we did not validate this conjecture. A possible approach to close this gap and obtain a full picture of what happens to –halo families is to perform Levi-Civita regularisation [44] and continue branches of halo orbits in these coordinates.
6.7 Implementation notes
The source code of all programs is available to download from the web page of the corresponding author [47]. The programs are written in C++-11 and use rigorous ODE solvers and algorithms for computation of Poincaré maps and their derivatives [46, 53] from the CAPD library [10]. All programs the from the were compiled using g++-4.9.2 and executed on a computer equipped with Intel Xeon E7-8867 v4 2.40GHz processors (64 cores).
Appendix A Interval Newton method for implicit equations
In this section we provide a method for validated computation of implicit functions. Such an algorithm is needed to check assumptions C2–C3 or HC2–HC3, as well as to compute wide branches of periodic orbits far from bifurcation points. The method is an adaptation of the well known Interval Newton Method (INO) [34, 39] to the case of implicit equations. The main modification which significantly improves the method is the use of higher order derivatives. The method itself is quite straightforward but to the best of our knowledge, it has not appeared in the literature. First we recall the Interval Newton Method [34, Thm. 8.4], [39, Thm. 5.1.7].
Theorem 24** ([34, 39])**
Let be a map and let be a convex, compact set. For we define the interval Newton operator by
[TABLE]
where by we mean a convex hull of the set of matrices .
If then has a unique zero in that belongs to . 2. 2.
If then has no zeros in .
The above theorem can be used to validate the existence of solutions to implicit equations over an explicit domain.
Lemma 25
Let be a map, be the closure of an open set and let be a convex, compact set with non-empty interior. For we define the interval Newton operator by
[TABLE]
If then there exists a smooth function such that the set of zeroes coincides with the graph of the function , i.e.
[TABLE]
Proof: Let us fix and put . Then we have
[TABLE]
From Theorem 24 for all there exists a unique such that . Let us observe, that the condition (49) implies, that is invertible at each point . By the implicit function theorem the function is smooth, as it solves an implicit equation at every point . \qed
The efficiency of the INO (Theorem 24) is hidden in the fact, that we usually have a very good approximation (from numerical experiments) for zero, i.e. . Then the quantity can be very tight, even if the computed bound on derivative is overestimated. This is not the case for parametrized maps, as equation (49) contains the term . If is large then having for all is rather unlikely.
A straightforward way to overcome this problem is to make a substitution , such that in the new coordinates the function , which solves the implicit equation , is flat. Let us fix , such that and assume is non-singular. We define an affine substitution by
[TABLE]
where . The map is invertible because its linear part has determinant equal to one and thus zeroes of are in one-to-one correspondence with zeroes of . In the new coordinates the point is an approximate zero of . Moreover, (provided is computed exactly). The above idea of changing linearly coordinate system has been proposed in [7], but the method for validation of a branch of zeroes was different and based on so-called radii polynomial approach [20, 7].
In the remaining part of the section we will show, how to efficiently evaluate all the terms, which appear in the INO for the mapping . Our test show, that using this approach we could significantly reduce overestimations in evaluation of the INO, which lead to significant advantage of this approach in comparison to direct evaluation of INO for .
The INO for the mapping on the set , which contains reads
[TABLE]
In what follows, we will show how we can bound all the terms that appear in this expression. Let be such that and denote . The term can be bounded by means of the mean value theorem
[TABLE]
and the set of matrices can be bounded by
[TABLE]
By the choice of , we have . Therefore we expect that for not very large parameter radius , the term in (50) is a small box around zero, as desired. Note, that the above considerations hold true for any matrix . Therefore the quantities and can be computed using just floating point arithmetic, however their product must be bounded rigorously, if we want to take the intersection in (51).
The quantity can be also bounded using second order Taylor expansion
[TABLE]
Recall, the point is chosen so that and the substitution is chosen so that (note, usually it cannot be computed exactly). Since both quantities are evaluated at a single point, we can take advantage (if necessary) of high-precision interval arithmetic and make these terms as close to zero as desired. Therefore, the bound on is practically quadratic in the radius of the parameter range . One can take the intersection of direct evaluation of in interval arithmetic with the bounds obtained from (50) and (52).
In order to compute the Interval Newton Operator for we have to bound . Direct evaluation gives
[TABLE]
Using second order derivatives of we can obtain another enclosure
[TABLE]
which can be intersected with (53).
Numerical experiments we performed show that using the above approach we can usually validate the existence of solution to the implicit equation on much wider domain (without subdivision) than in the original coordinates.
In principle, both and can be bounded using higher order Taylor expansions. This should come along with nonlinear (usually polynomial) substitution , such that all derivatives of with respect to vanish at up to desired order . Then the bound on can be made of order .
In the context of the CR3BP we have found, that the second order expansion is very efficient. Note, that computation of higher order derivatives of Poincaré maps in a high dimensional system is costly — the complexity of the –Lohner algorithm [53] used to integrate variational equations is , where is the dimension, is the order of Taylor method and is the largest order of derivative of Poincaré map, we request. Clearly, increasing in a high-dimensional system is very expensive. Secondly, the bounds on higher order derivatives of Poincaré map are usually much overestimated than those of lower order.
Appendix B Newton like scheme for finding bifurcation points
A straightforward way to localize period-tupling and touch-and-go bifurcation points of a family of reversible maps is to follow the branch of period- points and look for resonant eigenvalues of . In low-dimensional systems one can look at the stability parameter [21, 22]. This method is very efficient when we want to find a rough approximation to the bifurcation point. In reversible or hamiltonian case multiple eigenvalues may occur making computation of eigenvalues with high-accuracy quite non-trivial task.
In this short section we propose eigenvalue-independent yet efficient scheme for finding very accurate approximation to bifurcation points. In what follows we focus on reversible Hamiltonian systems and use the notation from Section 4, but the idea applies to any family of reversible maps.
Following Section 4 we assume that is an approximate period- point for the Poincaré map , which is close to resonance. We would like to refine it by a Newton-like scheme. Since we have unknowns we need equations with expected isolated zero. We impose
[TABLE]
where is defined by (37). The first equation selects the points from the curve of fixed points, while the second equation guarantees that the solution is also on the bifurcation curve. In order to apply the Newton method to the system of equations (54), we need to compute derivatives of . From (37) we have
[TABLE]
If the seed point for the Newton method is quite close to the bifurcation point, we may assume that almost constant and thus
[TABLE]
The second partial derivative reads
[TABLE]
Again, assuming we can approximate
[TABLE]
In order to compute we need second order derivatives of and of the function obtained from the Lyapunov-Schmidt reduction — see (35). The latest can be computed by differentiation of the identity
[TABLE]
Summarizing, the Newton-like iteration for equation (54) is given by
[TABLE]
where is the solution to the linear equation with
[TABLE]
Using the above scheme, finding approximate bifurcation points of halo orbits with accuracy was not a difficult task.
Remark 26
In the computer-assisted proof of Theorem 18 we used similar strategy to localize approximate points of symmetry breaking bifurcations. We solved for zeroes of the function
[TABLE]
References
- [1]
G. Alefeld, 1994. Inclusion methods for systems of nonlinear equations—the interval Newton method and modifications. In: Topics in validated computations (Oldenburg, 1993). Vol. 5 of Stud. Comput. Math. North-Holland, Amsterdam, pp. 7–26.
- [2] G. Arioli, Periodic Orbits, Symbolic Dynamics and Topological Entropy for the Restricted 3-Body Problem, Comm. Math. Phys. 231 1 (2002) 1–24.
- [3] The Astronomical Almanac, http://asa.usno.navy.mil.
- [4] A. Abad, R. Barrio, F. Blesa and M. Rodríguez, Algorithm 924: TIDES, a Taylor series integrator for differential equations, ACM Transactions on Mathematical Software (TOMS) 39 (1), 5.
- [5] R. Barrio, F. Blesa and S. Serrano, Bifurcations and chaos in Hamiltonian systems, Int. J. Bif. Chaos, 20 (2010), 1293–1319.
- [6] J. Burgos-Garcia, J.-P. Lessard and J.D. Mireles James, Spatial periodic orbits in the equilateral circular restricted four body problem: computer-assisted proofs of existence, preprint.
- [7] J.B. van den Berg, J.-P. Lessard and K. Mischaikow, Global smooth solution curves using rigorous branch following, Mathematics of Computation, 79 (2010), 1565–1584.
- [8] M. Breden, J.-P. Lessard and M. Vanicat, Global bifurcation diagram of steady states of systems of PDEs via rigorous numerics: a 3-component reaction-diffusion system, Acta Applicandae Mathematicae, 128 (2013), 113–152.
- [9] R. Barrio and D. Wilczak, Systematic Computer-Assisted Proof of branches of stable elliptic periodic orbits and surrounding invariant tori, SIAM J. App. Dyn. Sys., 16 (2017), 1618–1649.
- [10] Computer assisted proofs in dynamics, a C++ package for rigorous numerics, http://capd.ii.uj.edu.pl.
- [11] M.J. Capiński, Computer assisted existence proofs of Lyapunov orbits at L2 and transversal intersections of invariant manifolds in the Jupiter-Sun PCR3BP, SIAM J. Appl. Dyn. Syst. 11 (2012), no. 4, 1723–1753.
- [12] M.J. Capiński and P. Roldan, Existence of a Center Manifold in a Practical Domain Around L1 in the Restricted Three Body Problem, SIAM J. Appl. Dyn. Syst. 11, (2012) 285–318.
- [13] S.-N. Chow and J. Hale, Methods of Bifurcation Theory, Springer–Verlag, New York, 1982.
- [14] M. Ceccaroni, A. Celletti and G. Pucacco, Halo orbits around the collinear points of the restricted three-body problem, Physica D 317, (2016) 28–42.
- [15] A. Celletti, G. Pucacco and D. Stella, Lissajous and Halo orbits in the restricted three-body problem, J. Non. Sci. 25, (2015) 343–370.
- [16] M.C. Ciocci and A. Vanderbauwhede, Bifurcation of periodic points in reversible diffeomorphisms, Proceedings of the Sixth International Conference on Difference Equations: new progress in difference equations, (2004) 75–93.
- [17] A. Dhooge, W.J.F. Govaerts and Y.A. Kuznetsov, MATCONT: A MATLAB package for numerical bifurcation analysis of ODEs, ACM Trans. Math. Soft., 29 (2003), pp. 141–164.
- [18] E.J. Doedel, AUTO: Software for Continuation and Bifurcation Problems in Ordinary Differential Equations, Tech. report, Applied Mathematics, California Institute of Technology, Pasadena, CA, 1986.
- [19] E.J. Doedel, V.A. Romanov, R.C. Paffenroth, H.B. Keller, D.J. Dichmann, J. Galán-Vioque and A. Vanderbauwhede, Elemental periodic orbits associated with the libration points in the Circular Restricted 3-Body Problem, Int. J. Bif. Chaos, 17 (2007), 2625–2677.
- [20] M. Gameiro, J.-P. Lessard and K. Mischaikow, Validated continuation over large parameter ranges for equilibria of PDEs, Math. Comput. Simulation, 79 (2008), 1368–1382.
- [21] G. Gómez and J.M. Mondelo, The dynamics around the collinear equilibrium points of the RTBP, Physica D 157, (2001) 283–321.
- [22] K.C. Howell, Three-dimensional, periodic, ‘halo’ orbits, Celestial mechanics 32, (1984) 53–71.
- [23] À. Jorba and M. Zou, A software package for the numerical integration of ODE by means of high-order Taylor methods, Experimental Mathematics 14 (2005), 99–117.
- [24] T. Kapela, N-BODY choreographies with a reflectional symmetry - computer assisted existence proofs, EQUADIFF 2003, Proceedings of the International Conference on Differential Equations, Hasselt, Belgium 22–26 July 2003, p. 999-1005.
- [25] T. Kapela and P. Zgliczyński, The existence of simple choreographies for the N-body problem - a computer assisted proof, Nonlinearity 16 (2003) 1899–1918.
- [26] W.S. Koon, M.W. Lo, J. Marsden and S.D. Ross, Dynamical Systems, the Three-body Problem and Space Mission Design, Springer-Verlag New York, (2007).
- [27] Y.A. Kuznetsov and V.V. Levitin, CONTENT: A Multiplatform Continuation Environment, Tech. report, CWI, Amsterdam, The Netherlands, 1996.
- [28] H. Kokubu, D. Wilczak and P. Zgliczyński, Rigorous verification of cocoon bifurcations in the Michelson system, Nonlinearity, 20 (2007), 2147–2174.
- [29] J.S.W. Lamb, Reversing symmetries in dynamical systems, PhD Thesis, Universiteit van Amsterdam 1994.
- [30] J.-P. Lessard, Rigorous verification of saddle-node bifurcations in ODEs, Indagationes Mathematicae 27 (2016), 1013–1026.
- [31] J.-P. Lessard, E. Sander and T. Wanner, Rigorous continuation of bifurcation points in the diblock copolymer equation, Journal of Computational Dynamics 4 (2017), 71–118.
- [32] D. Michelson, Steady solutions of the Kuramoto–Sivashinsky equation, Physica D, 19, (1986), 89–111.
- [33] J. Milnor, Topology from the Differentiable Viewpoint., Princeton University Press, 1997.
- [34] R.E. Moore, Interval Analysis., Prentice Hall, Englewood Cliffs, N.J., 1966.
- [35] V.M. Falkner and S.W. Skan, Some approximate solutions of the boundary layer equations, Phil. Mag., 12 (1931), 865–896.
- [36] L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier and P. Zimmermann, MPFR: A Multiple-precision Binary Floating-point Library with Correct Rounding, ACM Trans. Math. Softw. 33 (2007), Article No. 13.
- [37] F.J. Muñoz-Almaraz, E. Freire, J. Galán, E. Doedel and A. Vanderbauwhede, Continuation of periodic orbits in conservative and Hamiltonian systems, Phys. D 181, (2003) 1–38.
- [38] M. Net and J. Sánchez, Continuation of Bifurcations of Periodic Orbits for Large-Scale Systems, SIAM. J. App. Dyn. Sys., 14 (2015), 674–698.
- [39] A. Neumeier, Interval methods for systems of equations. Cambrigde University Press, 1990.
- [40] E.V. Pitjeva and E.M. Standish, Proposals for the masses of the three largest asteroids, the Moon-Earth mass ratio and the Astronomical Unit, Celest. Mech. Dyn. Astr., 103 (2009), 365–372.
- [41] P. Pilarczyk, Computer assisted method for proving existence of periodic orbits, Topol. Methods Nonlinear Anal., Vol. 13 (1999), 365–377.
- [42] G. Pucacco, private communication.
- [43] O.E. Rössler, An equation for continuous chaos, Phys. Lett. A 57 (5), (1976) 397–398.
- [44] V. Szebehely, Theory of Orbits: The Restricted Problem of Three Bodies, Academic Press, 2013.
- [45] D. Stoffer and U. Kirchgraber, Possible chaotic motion of comets in the Sun Jupiter system - an efficient computer-assisted approach, Nonlinearity 17, (2004) 281–300.
- [46] I. Walawska and D. Wilczak, An implicit algorithm for validated enclosures of the solutions to variational equations for ODEs, App. Math. Comp., 291C, (2016) 303–322.
- [47] D. Wilczak, personal homepage http://www.ii.uj.edu.pl/~wilczak – a reference for auxiliary materials.
- [48] D. Wilczak, Chaos in the Kuramoto–Sivashinsky equations – a computer-assisted proof, J. Diff. Eq. 194, (2003) 433–459.
- [49] D. Wilczak and P. Zgliczyński, Heteroclinic Connections between Periodic Orbits in Planar Restricted Circular Three Body Problem - A Computer Assisted Proof, Commun. Math. Phys. 234, (2003) 37–75.
- [50] D. Wilczak and P. Zgliczyński, Heteroclinic Connections between Periodic Orbits in Planar Restricted Circular Three Body Problem. Part II., Commun. Math. Phys. 259, (2005) 561–576 .
- [51] D. Wilczak and P. Zgliczyński, Period Doubling in the Rössler System—A Computer Assisted Proof, Found. Comp. Math. 9, (2009) 611–649.
- [52] D. Wilczak and P. Zgliczyński, Computer assisted proof of the existence of homoclinic tangency for the Hénon map and for the forced-damped pendulum, SIAM J. Appl. Dyn. Syst. 8, Issue 4, pp. 1632–1663 (2009).
- [53] D. Wilczak and P. Zgliczyński, –Lohner algorithm, Schedae Informaticae, 20, (2011) 9–46.
- [54] C. Wulff and A. Schebesch, Numerical Continuation of Symmetric Periodic Orbits, SIAM J. App. Dyn. Sys., 5 (2006), 435–475.
- [55] P. Zgliczyński, Steady states bifurcations for the Kuramoto-Sivashinsky equation - a computer assisted proof, J. Computational Dynamics, 2 (2015), 95–142.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Alefeld, 1994. Inclusion methods for systems of nonlinear equations—the interval Newton method and modifications. In: Topics in validated computations (Oldenburg, 1993). Vol. 5 of Stud. Comput. Math. North-Holland, Amsterdam, pp. 7–26.
- 2[2] G. Arioli, Periodic Orbits, Symbolic Dynamics and Topological Entropy for the Restricted 3-Body Problem , Comm. Math. Phys. 231 1 (2002) 1–24.
- 3[3] The Astronomical Almanac, http://asa.usno.navy.mil .
- 4[4] A. Abad, R. Barrio, F. Blesa and M. Rodríguez, Algorithm 924: TIDES, a Taylor series integrator for differential equations , ACM Transactions on Mathematical Software (TOMS) 39 (1), 5.
- 5[5] R. Barrio, F. Blesa and S. Serrano, Bifurcations and chaos in Hamiltonian systems , Int. J. Bif. Chaos, 20 (2010), 1293–1319.
- 6[6] J. Burgos-Garcia, J.-P. Lessard and J.D. Mireles James, Spatial periodic orbits in the equilateral circular restricted four body problem: computer-assisted proofs of existence , preprint.
- 7[7] J.B. van den Berg, J.-P. Lessard and K. Mischaikow, Global smooth solution curves using rigorous branch following , Mathematics of Computation, 79 (2010), 1565–1584.
- 8[8] M. Breden, J.-P. Lessard and M. Vanicat, Global bifurcation diagram of steady states of systems of PD Es via rigorous numerics: a 3-component reaction-diffusion system , Acta Applicandae Mathematicae, 128 (2013), 113–152.
