Abstract
We develop and implement a semi-numerical method for computing high-order Taylor approximations of unstable manifolds for hyperbolic fixed points of compact infinite-dimensional maps. The method can follow folds in the embedding and describes precisely the dynamics on the manifold. In order to ensure the accuracy of our computations in spite of the many truncation and round-off errors, we develop a posteriori error bounds for the approximations. Deliberate control of round-off errors (using interval arithmetic) in conjunction with explicit analytical estimates leads to mathematically rigorous computer-assisted theorems describing precisely the truncation errors for our approximation of the invariant manifold. The method is applied to the Kot-Schaffer model of population dynamics with spatial dispersion.
Similar content being viewed by others
References
G. Arioli and H. Koch. Computer-assisted methods for the study of stationary solutions in dissipative systems, applied to the Kuramoto-Sivashinski equation. Arch. Ration. Mech. Anal., 197(3):1033–1051, 2010.
G. Arioli and H. Koch. Integration of dissipative partial differential equations: a case study. SIAM J. Appl. Dyn. Syst., 9(3):1119–1133, 2010.
G. Arioli and P. Zgliczyński. Symbolic dynamics for the Hénon-Heiles Hamiltonian on the critical level. J. Differential Equations, 171(1):173–202, 2001.
M. Breden, J.-P. Lessard, and J. D. Mireles James. Computation of maximal local (un)stable manifold patches by the parameterization method. Indag. Math. (N.S.), 27(1):340–367, 2016.
X. Cabré, E. Fontich, and R. de la Llave. The parameterization method for invariant manifolds. I. Manifolds associated to non-resonant subspaces. Indiana Univ. Math. J., 52(2):283–328, 2003.
X. Cabré, E. Fontich, and R. de la Llave. The parameterization method for invariant manifolds. II. Regularity with respect to parameters. Indiana Univ. Math. J., 52(2):329–360, 2003.
X. Cabré, E. Fontich, and R. de la Llave. The parameterization method for invariant manifolds. III. Overview and applications. J. Differential Equations, 218(2):444–515, 2005.
S. Day, O. Junge, and K. Mischaikow. A rigorous numerical method for the global analysis of infinite-dimensional discrete dynamical systems. SIAM J. Appl. Dyn. Syst., 3(2):117–160 (electronic), 2004.
S. Day and W. D. Kalies. Rigorous computation of the global dynamics of integrodifference equations with smooth nonlinearities. SIAM J. Numer. Anal., 51(6):2957–2983, 2013.
S. Day, J.-P. Lessard, and K. Mischaikow. Validated continuation for equilibria of PDEs. SIAM J. Numer. Anal., 45(4):1398–1424 (electronic), 2007.
R. de la Llave and J. D. Mireles James. Connecting orbits for compact infinite dimensional maps: computer assisted proofs of existence. SIAM J. Appl. Dyn. Sys., 15(2):1268–1323, 2016.
R. de la Llave, A. Olvera, and N. P. Petrov. Combination laws for scaling exponents and relation to the geometry of renormalization operators: the principle of approximate combination of scaling exponents. J. Stat. Phys., 143(5):889–920, 2011.
J.-P. Eckmann, H. Koch, and P. Wittwer. A computer-assisted proof of universality for area-preserving maps. Mem. Amer. Math. Soc., 47(289):vi+122, 1984.
D. Gaidashev and T. Johnson. A numerical study of infinitely renormalizable area-preserving maps. Dyn. Syst., 27(3):283–301, 2012.
D. Gaidashev and H. Koch. Period doubling in area-preserving maps: an associated one-dimensional problem. Ergodic Theory Dynam. Systems, 31(4):1193–1228, 2011.
D. G. Gaidashev. Period doubling renormalization for area-preserving maps and mild computer assistance in contraction mapping principle. Internat. J. Bifur. Chaos Appl. Sci. Engrg., 21(11):3217–3230, 2011.
Z. Galias and P. Zgliczyński. Infinite-dimensional Krawczyk operator for finding periodic orbits of discrete dynamical systems. Internat. J. Bifur. Chaos Appl. Sci. Engrg., 17(12):4261–4272, 2007.
M. Gameiro and J.-P. Lessard. Analytic estimates and rigorous continuation for equilibria of higher-dimensional PDEs. J. Differential Equations, 249(9):2237–2268, 2010.
M. Gameiro and J.-P. Lessard. Efficient Rigorous Numerics for Higher-Dimensional PDEs via One-Dimensional Estimates. SIAM J. Numer. Anal., 51(4):2063–2087, 2013.
M. Gameiro, J.-P. Lessard, and K. Mischaikow. Validated continuation over large parameter ranges for equilibria of PDEs. Math. Comput. Simulation, 79(4):1368–1382, 2008.
A. Hungria, J.-P. Lessard, and J. D. Mireles James. Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach. Math. Comp., 85(299):1427–1459, 2016.
J. M. James. Matlab codes for “fourier-taylor approximation of unstable manfiolds for compact maps: Numerical implementation and computer assisted error bounds. http://cosweb1.fau.edu/~jmirelesjames/unstableManifoldCompactMapPage.html, 2016.
T. Kato. Perturbation theory for linear operators. Classics in Mathematics. Springer-Verlag, Berlin, 1995. Reprint of the 1980 edition.
H. Koch. On hyperbolicity in the renormalization of near-critical area-preserving maps. (Submitted) http://www.ma.utexas.edu/mp_arc/c/14/14-70.pdf, 2014.
H. Koch, A. Schenkel, and P. Wittwer. Computer-assisted proofs in analysis and programming in logic: a case study. SIAM Rev., 38(4):565–604, 1996.
O. E. Lanford, III. A computer-assisted proof of the Feigenbaum conjectures. Bull. Amer. Math. Soc. (N.S.), 6(3):427–434, 1982.
J. D. Mireles-James. Polynomial approximation of one parameter families of (un)stable manifolds with rigorous computer assisted error bounds. Indagationes Mathematicae, 2014.
J. D. Mireles James. Computer assisted error bounds for linear approximation of (un)stable manifolds and rigorous validation of higher dimensional transverse connecting orbits. Commun. Nonlinear Sci. Numer. Simul., 22(1-3):1102–1133, 2015.
J. D. Mireles James and K. Mischaikow. Rigorous a posteriori computation of (un)stable manifolds and connecting orbits for analytic maps. SIAM J. Appl. Dyn. Syst., 12(2):957–1006, 2013.
R. E. Moore. Interval analysis. Prentice-Hall Inc., Englewood Cliffs, N.J., 1966.
R. E. Moore. Interval tools for computer aided proofs in analysis. In Computer aided proofs in analysis (Cincinnati, OH, 1989), volume 28 of IMA Vol. Math. Appl., pages 211–216. Springer, New York, 1991.
S. Rump. INTLAB - INTerval LABoratory. In T. Csendes, editor, Developments in Reliable Computing, pages 77–104. Kluwer Academic Publishers, Dordrecht, 1999. http://www.ti3.tu-harburg.de/rump/.
S. M. Rump. Verification methods: rigorous results using floating-point arithmetic. Acta Numer., 19:287–449, 2010.
W. Tucker. Validated numerics. Princeton University Press, Princeton, NJ, 2011. A short introduction to rigorous computations.
J. B. Van den Berg, J. D. Mireles James, and C. Reinhardt. Computing (un)stable manifolds with validated error bounds: non-resonant and resonant spectra. Journal of Nonlinear Science, 26:1055–1095, 2016.
D. Wilczak. Chaos in the Kuramoto-Sivashinsky equations—a computer-assisted proof. J. Differential Equations, 194(2):433–459, 2003.
D. Wilczak. Symmetric heteroclinic connections in the Michelson system: a computer assisted proof. SIAM J. Appl. Dyn. Syst., 4(3):489–514 (electronic), 2005.
D. Wilczak. The existence of Shilnikov homoclinic orbits in the Michelson system: a computer assisted proof. Found. Comput. Math., 6(4):495–535, 2006.
D. Wilczak. Symmetric homoclinic solutions to the periodic orbits in the Michelson system. Topol. Methods Nonlinear Anal., 28(1):155–170, 2006.
D. Wilczak and P. Zgliczynski. Heteroclinic connections between periodic orbits in planar restricted circular three-body problem—a computer assisted proof. Comm. Math. Phys., 234(1):37–75, 2003.
D. Wilczak and P. Zgliczyński. Period doubling in the Rössler system—a computer assisted proof. Found. Comput. Math., 9(5):611–649, 2009.
N. Yamamoto. A numerical verification method for solutions of boundary value problems with local uniqueness by Banach’s fixed-point theorem. SIAM J. Numer. Anal., 35(5):2004–2013 (electronic), 1998.
P. Zgliczynski. \(C^1\) Lohner algorithm. Found. Comput. Math., 2(4):429–465, 2002.
P. Zgliczyński. Covering relations, cone conditions and the stable manifold theorem. J. Differential Equations, 246(5):1774–1819, 2009.
Acknowledgments
The final version of the manuscript was greatly improved thanks to the suggestions of two anonymous referees. Thanks also goes to Mr. Jorge Gonzalez, Mr. Shane Kepley, Mr. Maxime Murray, and Mr. David Blessing for carefully reading the manuscript and for many additional comments and corrections. The author would like to thank Rafael de la Llave, Konstantin Mischaikow, Jan Bouwe van den Berg, Christian Reinhardt, Vincent Naudot, Sarah Day, Bill Kalies, and Jean-Philippe Lessard for helpful discussions, comments, and suggestions during the preparation of this manuscript. The author was partially supported by National Science Foundation Grant DMS 1318172.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Arieh Iserles.
J. M. J. partially supported by NSF Grant DMS-1318172.
Appendices
Appendix 1: Computer-Assisted Proof of a Non-trivial Fixed Point for Kot-Schaffer
We discuss an a posteriori scheme for studying the fixed point problem for the Kot-Schaffer mapping \(F :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) with logistic nonlinearity as defined in Sect. 2.1. The argument is another application of Theorem 2.2. In order to apply the theorem, we define the mapping \(G :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) by
We have that a is a zero of G if and only if a is a fixed point of F. Observe that G is Fréchet differentiable and that for any \(a \in \ell _\nu ^1\) the action of the linear operator \(DG(a) :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) is given by
The associated truncated mapping \(G^N :{\mathbb {R}}^{N+1} \rightarrow {\mathbb {R}}^{N+1}\) is
(the truncated convolution maps are as defined in Sect. 3.3).
Suppose that \(\bar{a}^N \in {\mathbb {R}}^{N+1}\) is an approximate solution of \(G^N = 0\). (In practice, \(\bar{a}^N\) may be the output of a numerical computation via Newton’s method.). The derivative of \(G^N\) at \(\bar{a}^N\) is the \(N+1 \times N+1\) matrix which acts on \(h^N \in {\mathbb {R}}^{N+1}\) by
The matrix representation of this linear transformation is computed column by column in the usual way, i.e. by considering the action on the basis vectors \(h^N = e_j \in {\mathbb {R}}^{N+1}\).
Let \(A^N\) be an approximate inverse for \(DG^N(\bar{a}^N)\) (possibly obtained numerically). Define the linear operators \(A^{\dagger }, A \in B(\ell _\nu ^1)\) by
and
for all \(h \in \ell _\nu ^1\). Note that
Both of the operators A and \(A^{\dagger }\) are invertible, and hence injective, as each is the Cartesian product of a finite dimensional invertible matrix and (minus) the identity in the tail components. The following Lemma gives sufficient conditions for the existence of a fixed point for Kot-Schaffer. The proof of the Theorem follows by estimates similar to those discussed in detail in Sect. 4.4.
Lemma 5.1
(A posteriori existence of a fixed point for Kot-Schaffer) Suppose that \(\mu > 0\), \(\nu > 1\) and \(b, c \in \ell _\nu ^1\) are fixed parameters for the Kot-Schaffer mapping \(F :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) defined by Eq. (5). Let \(N \in {\mathbb {N}}\), \(G^N\) be as defined in Eq. (49), \(\bar{a}^N \in {\mathbb {R}}^{N+1}\), \(A^N\) be an \(N+1 \times N+1\) invertible matrix, and \(A \in B(\ell _\nu ^1)\) be the linear operator defined in Eq. (51). Let \(b^N, c^N\) denote, respectively, the projections of b, c into \({\mathbb {R}}^{N+1}\) Let \(B^N\) denote the \(N+1 \times N+1\) diagonal matrix of \(b^N\), and \(B \in B(\ell _\nu ^1)\) denote the linear operator defined by \((B h)_n = b_n h_n\) for all \(n \in {\mathbb {N}}\). Let \(r_3 \in {\mathbb {R}}\) have that
Let
Define the constants
as in Lemma 3.3. Let
and
If \(r > 0\) is a number with
then there exists a unique fixed point \(a^* \in B_r(\bar{a})\) of the Kot-Schaffer mapping.
Appendix 2: CAP Results for Non-trivial Fixed Points of the Kot-Schaffer map
For parameters of the Kot-Schaffer map as discussed in Sect. 2.1.1, we choose to work in the sequence space \(\ell _\nu ^1\) with \(\nu = 1.1\). We project to order \(N = 26\) cosine modes (i.e. projecting the problem into \({\mathbb {R}}^{27}\)) as discussed in Sect. 5. We run a numerical Newton method in order to find an approximate fixed point. The IntLab program kotSchaffer_validateFP.m is then used in order to check the conditions of Theorem 5.1. We obtain the interval constants
and
From these constants, we obtain that there is a fixed point \(a^*\) of the Kot-Schaffer map with
with \(r_0 = 7.6 \times 10^{-15}\). Moreover the fixed point is unique in a ball of radius at least \(R_0 = 0.169\). The reader interested in the details of the proof can run the IntLab program a_KotPaperProofs_firstOrderData.m from [22] for more details.
Appendix 3: Computer-Assisted Analysis of the Eigenvalue/Eigenvector Problem for the Kot-Schaffer Map
In this section, we discuss a numerical validation scheme for the Kot-Schaffer eigenvalue/eigenvector problem. We focus on the case of a real eigenvalue, as this is the case of interest in main body of the paper. Let \(F :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) be the Kot-Schaffer mapping given in Eq. (5).
Assumption C
(a priori fixed point) Assume that \(a^* \in \ell _\nu ^1\) is a fixed point for F and that \(a^*\) admits the decomposition
where \(\bar{a}, a^\infty \in \ell _\nu ^1\) and \(\bar{a}_n = 0\) for \(n \ge N+1\). Let \(\bar{a}^N \in {\mathbb {R}}^{N+1}\) denote the projection of \(\bar{a}\). We do not assume that the \(N+1\) leading coefficients of \(a^\infty \) are zero. Rather we assume that there is an \(r_0 \ge 0\) so that \(\Vert a^\infty \Vert _\nu ^1 \le r_0\). (Computer- assisted validation of such a decomposition for \(a^*\) is obtained using the techniques discussed in Appendix 1).
Suppose now that \(\bar{\lambda } \in {\mathbb {R}}\) and \(\bar{\xi }^N \in {\mathbb {R}}^{N+1}\) are an approximate (possibly numerically computed) eigenvalue/eigenvector pair for \({\textit{DF}}^N(\bar{a}^N)\), i.e. suppose that
Our goal is to prove that there exist \(\lambda ^* \in {\mathbb {R}}\), and \(\xi ^* \in \ell _\nu ^1\) having \(|\bar{\lambda }_0 - \lambda ^*|, \Vert \bar{\xi } - \xi ^* \Vert _\nu ^1\) small and that
In order to isolate a unique solution, we choose an arbitrary \(s \in {\mathbb {R}}\), \(s \ne 0\) and impose the constraint
This constraint is somewhat arbitrary and could be replaced with any condition which fixes the length of \(\xi \).
In order to formalize the problem, we define the Banach space
which we endow with the norm
We denote a general element \(y \in {\mathcal {Y}}\) as a sequence indexed from \(-1, 0, 1, 2, \ldots \), i.e.
and think of the norm as being
With \(s \ne 0\) fixed, we define the mapping \(E :{\mathcal {Y}} \rightarrow {\mathcal {Y}}\) by
where
Note that E is a nonlinear (quadratic) mapping, due to the appearance of the product of the unknowns \(\lambda \) and \(\xi \).
The truncated system \(E^N :{\mathbb {R}}^{N+2} \rightarrow {\mathbb {R}}^{N+2}\) is given by
where \(M^N\) is the \(N+1 \times N+1\) matrix defined linear operator
and \(B^N\) is the \(N+1 \times N+1\) matrix diagonal matrix with the entries of \(b^N\) in the diagonal and zeros elsewhere. (\(M^N\) is computed column by column by considering \(h^N = e_j\) the j-th basis vector in \({\mathbb {R}}^{N+1}\) for each j.)
The Fréchet derivative of E is given by
and the derivative of the truncated mapping is given by the \(N+2 \times N+2\) matrix
where
i.e. this is the row vector of length \(N+1\) with ones in all entries.
Let \((\bar{\lambda }, \bar{\xi }_N)\) be an approximate solution of \(E^N = 0\). Assume that \(DE^N(\bar{\lambda }, \bar{\xi }^N)\) is an invertible matrix and let \(A^N\) be an approximate inverse. Define the linear operators \(A, A^\dagger \in B({\mathcal {Y}})\) by
and
for all \(h = \{h_{-1}, h_0, h_1, \ldots \} \in {\mathcal {Y}}\). Note that \(A, A^{\dagger }\) are injective. We have the following a posteriori validation lemma for the eigenvalue/eigenvector problem, whose proof follows by estimates similar to those carried out in detail in Sect. 4.4.
Lemma 5.2
(A posteriori existence of an eigenvalue/eigenvector pair for the Kot-Schaffer map) Suppose that \(\mu > 0\), \(\nu > 1\) and \(b, c \in \ell _\nu ^1\) are fixed parameters for the Kot-Schaffer mapping \(F :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) defined by Eq. (5). Suppose in addition that \(a^*\) is a fixed point of F satisfying Assumption C above. Let \(N \in {\mathbb {N}}\), \(\bar{a}^N \in {\mathbb {R}}^{N+1}\), \(a^\infty \in \ell _\nu ^1\), and \(r_0 > 0\) be as in Assumption C. Let \(E^N\) be as defined in Eq. (57), \(\bar{\xi }^N \in {\mathbb {R}}^{N+2}\), \(A^N\) be a \(N+2 \times N+2\) invertible matrix, \(\bar{\lambda } \in {\mathbb {C}}\), \(M^N\) be the \(N+1 \times N+1\) matrix defined in Eq. (58), and \(A \in B({\mathcal {Y}})\) be the linear operator defined in Eq. (60). Let \(b^N, c^N\) denote, respectively, the projections of b, c into \({\mathbb {R}}^{N+1}\), and let \(B^N\) denote the diagonal matrix of \(b^N\). Let \(r_3 \in {\mathbb {R}}\) be any bound of the form
Let
Define the constants
as in Lemma 3.3. Let
and
If \(r > 0\) has that
then there exists a unique \((\lambda ^*, \xi ^*) \in B_r(\bar{\lambda }, \bar{\xi }) \subset {\mathcal {Y}}\) so that \(E(\lambda ^*, \xi ^*) = 0\).
Appendix 4: CAP Results for an Unstable Eigenvalue/Eigenvector Pair for the Kot-Schaffer Map
We take parameters for the Kot-Schaffer map as in Sect. 2.1.1 and let \(\bar{a}^N \in {\mathbb {R}}^{27}\) be as in Appendix 2. In Appendix 2, we showed that the fixed point validation for these data resulted in a fixed point \(a^* \in \ell _\nu ^1\) with \(\nu = 1.1\),
and \(r_0 = 7.6 \times 10^{-15}\). We compute an unstable eigenvalue/eigenvector pair for \(DF^N(\bar{a}^N)\) resulting in the numerical approximation of the eigenvalue
We choose a scaling of 1.5 for the eigenvector as discussed in Appendix 3, and fix \(s = -1.76841177760678\) as discussed in Sect. 1. The IntLab program kotSchaffer_validateEig.m is used in order to check the conditions of Theorem 5.2, and we obtain that
This results in a validated error bound of
The reader interested in the details of the implementation will find them in the program a_KotPaperProofs_firstOrderData.m from [22] for more details.
Appendix 5: A Spectral Perturbation Lemma
The spectrum of an eventually diagonal linear operator on \(\ell _\nu ^1\) [recall the definition of Eq. (22)] is determined by considering the spectrum of its matrix part in conjunction with the (diagonal) entries in the tail. The spectrum of the matrix can often be computed using validated numerical methods. The spectrum of the tail can be read off by hand in the case that the diagonal entries decay to zero rapidly enough. Many of the operators we encounter in applications (especially in this paper) can be viewed as small perturbations of eventually diagonal linear operators, and we would like to use the fact that we understand precisely the spectrum of the unperturbed (eventually diagonal) linear operator to understand the spectrum after a small perturbation.
Lemma 5.3 is an example of the kinds of results one can obtain. More general results of this kind can be given, but this simple lemma is sufficient for the needs of the present work. We include the elementary proof for the sake of completeness.
Lemma 5.3
With \(N \in {\mathbb {N}}\) let \(A^N\) be an \(N+1 \times N+1\) matrix. Assume that \(A^N\) is diagonalizable with
Suppose that \(|\lambda _0| > 1\) and that
so that \(\lambda _0\) is the only unstable eigenvalue of \(A^N\). Let \(\{a_n\}_{n = N+1}^\infty \) be a sequence of real numbers with
and
Let \(A :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) be the eventually diagonal operator defined by
with \(h \in \ell _{\nu }^1\). Suppose that
Let \(\tilde{A} :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) be a bounded linear operator and suppose that
Then
has exactly one unstable eigenvalue.
Proof
We study the homotopy given by
The proof is in two steps. In the first, we prove that: If each operator H(s) has no eigenvalues on the unit circle during the homotopy (i.e. “no eigenvalues cross the unit circle”) and A has exactly one unstable eigenvalue, this implies that each H(s) has exactly one unstable eigenvalue. In the second step of the proof, we show that the hypotheses of the lemma are sufficient to guarantee that indeed each H(s) has no eigenvalue on the unit circle.
Step 1: This part of the argument is based on the well-known semi-continuity properties of separated parts of the spectrum (below we cite precisely the property needed for the argument). Let \(\Sigma _s\) denote the spectrum of H(s). Note that
Then for \(|\lambda | > \Vert A \Vert + \Vert \tilde{A} \Vert \) we have that
with \(\Vert H(s)/\lambda \Vert < 1\). It follows by the Neumann theorem that the operator is invertible, i.e. that \(|\lambda | > \Vert A \Vert + \Vert \tilde{A} \Vert \) is not in the spectrum of H(s). More precisely, we have that
for each \(s \in [0, 1]\).
Since each H(s) is a compact linear operator, its spectrum accumulates only at the origin in \({\mathbb {C}}\). It follows that for each \(s \in [0,1]\), the unstable spectrum of H(s) consists of only finitely many unstable eigenvalues of finite multiplicity.
Now assume that for all \(s \in [0, 1]\), the operator H(s) has no eigenvalues on the unit circle. We claim that this implies that there is an \(r > 0\) so that the stable spectrum of H(s) is interior to the circle of radius \(1 - r\) and so that the unstable spectrum of H(s) is in the complement of the circle of radius \(1 + r\). To put it another way: The spectrum of H(s) is uniformly bounded away from the unit circle throughout the homotopy.
To see this, note that the assumption that H(s) has no eigenvalues on the unit circle means that for all \(\theta \in [0, 2 \pi ]\) the operator \(H(s) - \hbox {e}^{i \theta } \text{ Id }\) is boundedly invertible. Since \([0, 2 \pi ]\) is compact, there is a \(C > 0\) so that
for all \(\theta \in [0, 2\pi ]\).
Choose \(r < 1/C\) and let \(\epsilon \in [-r, r]\). Let \(M(s, \theta ) = (H(s) - \hbox {e}^{i \theta } \text{ Id })^{-1}\), and write
Since
we have that \(\text{ Id } - \epsilon M(s, \theta ) \hbox {e}^{i \theta } \text{ Id }\) is boundedly invertible by the Neumann series argument. Then
is a bounded linear operator for all \(s \in [0,1]\) and \(\epsilon \in [-r, r]\). It follows that for each \(s \in [0,1]\), the spectrum of H(s) is bounded away from the unit circle by a distance of r.
Since the spectrum is uniformly bounded away from the unit circle, there are simple closed curves \(\gamma _1, \gamma _2 \subset {\mathbb {C}}\) so that:
-
(i)
for each \(s \in [0, 1]\), the unstable eigenvalues of H(s) are enclosed by \(\gamma _1\),
-
(ii)
for each \(s \in [0,1]\), the stable eigenvalues of H(s) are enclosed by \(\gamma _2\),
-
(iii)
the curve \(\gamma _1\) is contained in the complement of the unit disk and is a nonzero distance from the unit circle,
-
(iv)
the curve \(\gamma _2\) is contained in the interior of the unit disk and is a nonzero distance from the unit circle.
Then observe that for each \(s \in [0,1]\) the curves \(\gamma _1, \gamma _2\) and the linear operator H(s) satisfy the hypotheses of Theorem 3.16 of Part IV, Section 4 of the book of Kato [23].
By applying this stability theorem, we have that for each \(\hat{s} \in [0,1]\), there is a \(\delta _{\hat{s}}\) so that for all \(s \in (\hat{s}-\delta _{\hat{s}}, \hat{s} + \delta _{\hat{s}})\) the dimension of the unstable eigenspace of H(s) is constant. By compactness of [0, 1], we obtain finitely many \(s_1, \ldots , s_N\), and \(\delta _1, \ldots , \delta _N\) so that the dimension of the unstable eigenspace of H(s) is constant on each of the intervals \((s_j - \delta _j, s_j + \delta _j)\) and \([0, 1] \subset \bigcup _{j=1}^N (s_j - \delta _j, s_j + \delta _j)\). Then the dimension of the unstable eigenspace is constant in the intersection of any two intervals, i.e. it cannot change from one subinterval to the next. But this gives that unstable dimension is constant throughout the entire homotopy. Since \(H(1) = A\) has one-dimensional unstable eigenspace, it follows that H(s) has one-dimensional eigenspace for each \(s \in [0,1]\).
Step 2: Now let \(h \in \ell _\nu ^1\) and note that
where
Then
We now write
and consider invertibility of the operator
By hypothesis, we have that
so that \(\left[ \text {Id} - M(1- s)\tilde{A} \right] \) is boundedly invertible. From this, we obtain that \(H(s) - \hbox {e}^{i \theta }\text {Id}\) is boundedly invertible for each \(s \in [0,1]\), i.e. H(s) has no eigenvalues on the unit circle. By the argument of step one, \(B = H(1)\) has exactly one unstable eigenvalue as desired. \(\square \)
Appendix 6: Computer-Assisted Proof that the Unstable Spectrum is Exactly One Eigenvalue
We consider again the Kot-Schaffer map \(F :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) given by Eq. (5) with parameters \(\mu > 0\) and \(b, c \in \ell _\nu ^1\) as discussed in Sect. 2.1.1. Let \(a_*, \xi _* \in \ell _\nu ^1\) and \(\lambda _* \in {\mathbb {R}}\) be as in the Appendices 2 and 4. In particular, we consider projection dimension \(N = 26\) and have
where \(\pi _N(\bar{a}) = \bar{a}^N\) and \(\bar{a}_n = 0\) for \(n \ge N+1\) and
Using the notation of Appendix 4, let
and define the linear operator \(A :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) by
Computing rigorous enclosures of the eigenvalues and eigenvectors of \(A^N\) (using IntLab) gives
so that
Moreover we report that
and that \(|\lambda _N| \le |\lambda _j| \le |\lambda _1| < 1\). Then we check that
which verifies the hypothesis that
as required by Lemma 5.3. Since \(b_n = \mu 2^{-n}\), we see that these are strictly decreasing. We also compute (using IntLab) interval enclosures of Q and \(Q^{-1}\), and using these, we check that
is a number satisfying the hypotheses of Lemma 5.3.
Now we write the differential at \(a_*\) as
Define the bounded linear operator \(\tilde{A} :\ell _\nu ^1 \rightarrow \ell _\nu ^1\) by
so that
We write
where \(\tilde{A}_1, \tilde{A}_2, \tilde{A}_3, \tilde{A}_4 :\ell _\nu ^1 \rightarrow \ell _\nu \) are defined by
and
We bound \(\Vert \tilde{A}_2\Vert \) using Lemma 3.3. More precisely, we take
as in Lemma 3.3. Then
For the remaining terms, we have that
and
Using interval arithmetic, we compute the bound
so that
Then by Lemma 5.3, and the fact that A has exactly one unstable eigenvalue, we conclude that \(DF(a_*) = A + \tilde{A}\) has exactly one eigenvalue, that the unstable manifold of \(a_*\) is exactly one dimensional, and the computations in the main body of the present work are justified. The reader interested in the details of the proof should see the IntLab program a_KotPaperProofs_firstOrderData.m from [22] for more details.
Rights and permissions
About this article
Cite this article
James, J.D.M. Fourier–Taylor Approximation of Unstable Manifolds for Compact Maps: Numerical Implementation and Computer-Assisted Error Bounds. Found Comput Math 17, 1467–1523 (2017). https://doi.org/10.1007/s10208-016-9325-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10208-016-9325-9
Keywords
- Unstable manifolds
- Compact maps
- Infinite dimensional dynamical systems
- Parameterization Method
- A posteriori analysis
- Computer-assisted proof