SIX LECTURES ON
DYNAMICAL SYSTEMS
This page is intentionally left blank
SIX LECTURES ON
DYNAMICAL SYSTEMS
editors
B. Aulbach & F. Colonius Institut fur Mathematik Universitat Augsburg Germany
World Scientific Singapore* New Jersey •London •Hong Kong
Published by World Scientific Publishing Co. Pte. Ltd. P O Box 128, Farcer Road, Singapore 912805 USA office: Suite IB, 1060 Main Street, River Edge, NJ 07661 UK office: 57 Shelton Street, Covent Garden, London WC2H 9HE
British Library Cataloguing-in-Publication Data A catalogue record for this book is available from the British Library.
SIX LECTURES ON DYNAMICAL SYSTEMS Copyright © 1996 by World Scientific Publishing Co. Pte. Ltd. All rights reserved. This book, or parts thereof, may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permission from the Publisher.
For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA.
ISBN 981-02-2548-2
This book is printed on acid-free paper.
Printed in Singapore by Uto-Print
Preface This collection of articles grew out of a tutorial workshop which has been conducted at the Department of Mathematics at the University of Augsburg in June 1994. This workshop, organized by the editors of this volume, was part of a particular graduate student program ("Graduiertenkolleg Mathematik: Analyse, Optimierung und Steuerung komplexer Systeme") financed by the DFG and the Bavarian Ministry of Education, Culture, Science and Art. The six articles in this volume cover different facets of the mathematical theory of dynamical systems. The topics range from the topological foundations through invari ant manifolds, decoupling, linearization, perturbations and computations to control theory. In any case, emphasis is put on motivation and on guiding ideas, and the theoretical explanations are accompanied and illustrated by many examples. Each contribution is self-contained and provides an in-depth insight into some topic of current interest. We hope that this volume will stimulate further research in the field of dynamical systems.
Augsburg, December 1995
Bernd Aulbach and Fritz Colonius
v
This page is intentionally left blank
Contents Preface
v
Dynamical Systems: The Topological Foundations by Ethan Akin 1
Introduction: Discrete Time Dynamics and Closed Relations
1
2
Recurrence for Closed Relations
7
3
Invariant Sets and Lyapunov Functions
14
4
Attractors and Basic Sets
24
5
Maps Between Dynamical Systems
33
Bibliography
42
Integral Manifolds for Caratheodory Type Differential Equations in Banach Spaces by Bernd Aulbach and Thomas Wanner 1
Prologue
45
2
Basic Definitions and Results
48
3
Quasibounded Solutions
60
4
The Fundamental Existence Theorem for Integral Manifolds
76
5
Hierarchies of Integral Manifolds
90
6
The Classical Five Integral Manifolds
97
7
The Missing Sixth Integral Manifold
106
8
Epilogue
109
Appendices
110
A
Strong Measurability and the Bochner Integral
110
B
Banach's Fixed Point Theorem and Related Results
114
References
117
vii
Contents
viii
Control Theory and Dynamical Systems by Fritz Colonius and Wolfgang Kliemann 1
Introduction
121
2
Control Systems as Dynamical Systems
125
3
Limit Behavior of Controlled Trajectories
131
4
Two Perturbation Theorems for Ordinary Differential Equations
134
5
Two Examples
139
6
Analysis of Linearized Control Systems
144
7
Spectral Theory of Nonlinear Control Systems
150
References
156
Shadowing in Discrete Dynamical Systems by Brian A. Coomes, Huseyin Kogak and Kenneth J. Palmer 1
Introduction
163
2
The Infinite-time Shadowing Theorem
165
3
Finite-time Shadowing
175
3.1 The Finite-time Shadowing Theorem
175
3.2 Implementation of the Theorem in Dimension One
177
3.3 Example: The Logistic Map
181
3.4 Implementation of the Theorem in Dimension Two
182
3.5 Example: Tinkerbell Map
188
Periodic Shadowing
190
4.1 Periodic Shadowing Theorem
190
4.2 Necessary and Sufficient Condition that L~l Exists
193
4.3 Implementation of the Theorem in Dimension One
194
4.4 Example: The Logistic Map
196
4.5 Implementation of the Theorem in Dimension Two
196
4.6 Example: The Henon Map
201
4.7 Lyapunov Exponents for Periodic Orbits of Maps
201
4.8 Example: The Henon Map
208
4
References
208
Contents
ix
Perturbations of Invariant Manifolds of Ordinary Differential Equations by George Osipenko and Eugene Ershov 1
Introduction
213
2
Basic Notions and Motivational Examples
216
3
Perturbation of Equilibria
223
4
Invariant Manifolds of Pseudo-Hyperbolic Linear Maps
231
5
Perturbation of Invariant Manifolds Through an Equilibrium
245
6
Perturbation of Periodic Orbits and Invariant Manifolds Through Them . 251
7
Sacker-Neimark and Mane Theorems
254
8
Locally Non-unique Invariant Manifolds
258
References
263
The Reduction of Discrete Dynamical and Semidynamical Systems in Metric Spaces by Andrejs Reinfelds 1
Introduction
267
2
Preliminaries
268
3
Auxiliary Lemmas
270
4
Fixed Point
273
5
Invariant Sets
274
6
Conjugacy of Homeomorphisms 1
281
7
Conjugacy of Noninvertible Mappings
290
8
Conjugacy of Homeomorphisms 2
293
9
Application to Stability Theory
304
Shadowing Lemma
305
10
References
308
Dynamical Systems: The Topological Foundations Ethan Akin Mathematics Department The City College 137 Street and Convent Ave. New York, N. Y. 10031 USA
[email protected] Abstract Of importance for the study of smooth dynamical systems, the concepts of Lyapunov function, attractor and chain recurrence are entirely topological. The theory connecting these ideas provides tools with which to begin the study of a wide variety of dynamical systems.
1
Introduction: Discrete Time Dynamics and Closed Relations
A dynamical system is a mathematical attempt to describe the phenomenon of change. The label is applied to a wide variety of models: differential equations in continuous time, iterations in discrete time, and stochastic processes. The first examples which students meet usually occur in calculus and differential equations courses: falling bodies, radioactive decay and the simple harmonic motions of a spring. These are differential equations with which you are probably familiar. Let us use them to introduce the conceptually simpler, but less familiar, iteration processes that will be the focus of our attention. 1
2
Dynamical Systems:
The Topological
Foundations
An initial value problem consists of a vectorfield on some Euclidean space R n , i.e. a function £ : R n -> R \ and an initial value x € R n . The associated solution path, a?*, is an R n valued function on some time interval containing t = 0 which satisfies: x't = t{xt)
and x0 = x.
(1)
Provided the vectorfield function is reasonable, e.g. continuously differentiable, the problem has a unique solution. Governed by the vectorfield we move in the space R n as time t varies, proceeding along a path uniquely determined by our initial position a. While the time t is the variable on the solution path, the initial value .T is a parameter, that is, it is a constant in some ways and a variable in others. The initial position is the unchanging point of origin for the entire solution path. When we replace one initial point by another, we replace the corresponding solution path entirely. We can reverse this perspective, viewing time as the parameter and the initial point as the variable. This defines for each fixed time t, the time t map / ' : R n —> R n , associating to .T the point /*(#), the time t position of the solution path starting at z, i.e. /*(#) = xt using the solution path of (1). Clearly, f° is the identity map since x0 = x. Furthermore, we have the important semigroup condition:
r s = fo/s.
(2)
This equation holds because our vectorfield is time independent (also called autonomous or stationary), that is, the vector £(x) attached to the point x remains unchanged. (Of course, £,{xt) changes as xt moves from point to point by varying t.) We can begin at point x and run along until time £, reaching the point y = xt. Then we can begin the process again with new initial point y and run along until time -s, reaching y3. For a stationary system we arrive at the same place if we start at x and just run until time t + s. The equation xt+s — y9 with y = xt is (2). We get the associated discrete time system by restricting attention to only integer times. In particular, let / denote the time 1 map f1. By induction on n, we see from (2) that the time n map fn for n = 1 , 2 , 3 , . . . is just the composition / o / o / . . . o / of n copies of / . So we get the entire discrete time process by iterating / . Thus, the map / suffices to describe it.
Discrete Time Dynamics and Closed Relations
3
Because the solution paths of (1) extend to negative times, the maps / ' are all homeomorphisms. In fact by (2) the map f~l is the inverse map for /*. We will be iterating maps which are not homeomorphisms and even more general relations. So we do not assume our dynamical systems are reversible in this way. As we are abandoning calculus we no longer need the vector space struc ture on our underlying state space. So we can consider systems on quite general metric spaces. However, compactness will be an essential require ment. All of our spaces are assumed to be nonempty, compact, metric spaces. For such spaces a subset is closed if and only if it is compact. Hence, the continuous image of a closed set is closed. Furthermore, if {Cn} is a decreasing sequence of closed, nonempty subsets of such a space X then the intersection C = C\nCn is nonempty, as well as closed. Furthermore, if U is any neighborhood of C in X then for sufficiently large n, Cn C U. More generally, if {Cn} is any sequence of closed subsets of A", define: limsup{C n } = nnUjt>nCfc.
(3)
The following exercise collects the properties of the lim sup operator. Exercise 1 With {Cn} a sequence of closed subsets of X let C denote the lim sup{Cn}. Prove the following properties: (a) If U is any neighborhood of C then for sufficiently large n, Cn C U. Furthermore, C is the smallest closed subset satisfying this condition. In particular, if the Cn 's are nonempty then C is nonempty. (b) x £ C if and only if there is a sequence of integers {n,} tending to infinity and a sequence {x{} in X with X{ G Cni such that x = Xmii-+00Xi. (c) If {Cn} is a decreasing sequence, then C = nnCn. If {Cn} is an increasing sequence then C = U n C n . In general, UnCn = C U (U n C n ). (d) If f : X —► A"i is a continuous map then f(C) = l i m s u p { / ( C n ) } . □ Our approach to dynamical systems in these notes will largely follow the book The General Topology of Dynamical Systems [1]. We will be able to highlight the more interesting results and arguments, referring back to the book (hereafter denoted GTDS) for the more tedious or elaborate details. We will be considering dynamical systems obtained by iterating not just maps, but more general relations. At first glance this appears to be
4
Dynamical Systems:
The Topological
Foundations
a generalization devoid of interest, a typical pedant's delight. However, we will see later than even were we to begin with a homeomorphism, its study would lead naturally to more general relations. So with that firm promise as motivation we introduce the notation for and basic properties of relations. There are two, equivalent, ways of thinking about a relation between sets A"i and X2. The multiple valued function picture, which we will not use, associates to each point of X\ a subset, possibly empty, of X2. Instead, we go back to set theory, where a function / : X\ —+ X2 is defined as a particular subset of the Cartesian product X\ x X2- Thus, the set theorist identifies the function / with the set {(#, f(x)) : x £ A"i} C X\ x X2. Adopting this language, as we do, we say that, for example, the identity map lx : X —> A" is the diagonal subset {(x,x) : x € A"} of A" x X. We now define a relation f : X\ —»• X2 to be a subset of A'i x A"2, any subset. Associated with a point .T € A'i we denote by f(x) the subset of X2 defined by f(x) = {y.(x,y)ef}cX2.
(4)
In regarding a function as a special kind of relation we use the slightly abusive notation of identifying a singleton set with the point it contains. We will usually write y € f{x) for the equivalent statement (.T,y) € / • So for A C A'i we define the image f(A) C X2: f(A) = {y:ye
f(x) for some x <E A} = [j f(x).
(5)
Because relations are just subsets of X\ x X2 we can speak of inclu sion between two relations and take unions and intersections of families of relations. This kind of language is unfamiliar because, for example, if / , g : A'i —> X2 are functions and / C g then it is easy to check that f = g. Any relation / : A'i —> X2 has an inverse relation f~l : X2 —> X1 defined by
/ _ 1 = {(y,x) ■ (x,y) e / } c l 2 x AY
(6)
As an exercise, the reader should check that the following two definitions of the domain of / : X\ —> A"2 agree: Dom(/) = {x : / ( * ) ^ 0} = rHX2).
(7)
Discrete Time Dynamics and Closed
Relations
5
Despite all these novelties we mimic function notation, writing / : X\ —* X 2 , for example, because we want to enlist the readers' intuition about how ordinary functions work. Crucial for this purpose is the observation that composition of functions extends to relations. If / : X\ —> A~2 and g : X2 —> A'3 are relations then g o f : X\ —* A 3 is the relation defined by: 9° f
=
{(xi z) '■ There exists y E X2 such that y E f(x) and z 6 g(y)}
=
n13((fxX3)n(Xlxg))
(8)
where 7r13 : A'i x A"2 x A"3 —► A"x x A"3 is the coordinate projection map. It easily follows that:
(9 o f)(s) = g(f(z)).
(9)
From this equation the associative law for composition follows as does the related equation {g o f)(A) = g(f(A))
(AcXt).
(10)
Observe also that / o 1Xl = f = ^x2 ° / and {g o / ) _ 1 = / - 1 o g~l. We also have that composition distributes over union. For sequences {/„} and {gm} of relations from A^ to X2 and X2 to A"3, respectively, we see that (U m 9m)0 ( U „ / n ) = U m , n (y m O / n ) .
(11)
When X\ = X2 = X so that / : X —» X we call / a relation on X. Just as with self maps we can iterate such relations. For / : X —> X we define f° to be the identity map 1^ and for n = 1,2,... we define fn to be the composition of / o / . . . o / of n copies of / . Finally, we let f~n denote ( / - 1 ) n - The analogue of (2) follows from the associative law by induction: fn1+m
=
jm Q p7
j n i f J a >0)
(12)
That is, the composition law holds provided that the integers n^ and n 2 have the same sign. As usual, it is important to take note of the rules which fail to hold; / o f~x and / - 1 o / need not equal or even contain the identity map.
6
Dynamical Systems:
The Topological
Foundations
Recall now that our spaces are compact metric spaces. From the metric we get an important class of relations. Given e > 0 define in X x X: Vt
=
{(.Ti,;r 2 ):c?(.r 1 , ; r 2 ) < e} (13)
Vre =
{(x1,x2)
: d(xux2)
So that Vt{x) and Vt(x) are, respectively, the open and closed balls centered at .T with radius e. The defining conditions for the metric d yield the relation results: \ x = Vo, V~l = Vei and V€i o Vt2 C Vei+e2 for all eue2 > 0, with analogous conditions for the V^s. Notice that Vt is open and Vc is closed in X x X but V€ may contain more than the closure of Vt. For compact metric spaces X\ and X2 the product is a compact metric space, as well. Here we use the max metric on the product:
di2{{xuy\),(x2,y2)) = max.(dr(xi,x2),d2(yi,y2)).
(14)
We will call a relation / : Xi —> X2 a closed relation when it is a closed subset of Xi x X2Proposition 2 Let f : X\ —► X2 and g : X2 —+ X3 be closed relations. (a) The domain Dom(f) is a closed subset of X\. (b) The inverse / - 1 : X2 —> X\ is closed. (c) The composition g o / : X\ —> X3 is closed. (d) If A C X\ is closed then f{A) C X2 is closed. (e) If B C X2 is closed then {x : f(x) C\ B ^ 0} C Xi is closed. (f) If U C X2 is open then {x : f(x) C U] C X\ is open. Proof: (b) is obvious. The image f{A) is 7r 2 (/ fl (A x X2)) which is closed by compactness, proving (d). Similarly, (c) follows from (8). Now (a) follows from (7), and (e) holds because, generalizing (7), the set in question is f~l(B). Finally, {.r : f(x) C U] is Xx - f~1(X2 - U) and so (f) follows. D
It is a good exercise to fill in the details of the above, somewhat tele graphic, proof. Note in particular how compactness is used. The assumption of closure is a kind of continuity condition. To see this we rephrase part (f).
Recurrence for Closed
Relations
7
Corollary 3 Let f : X\ —> X2 be a closed relation. For every closed subset A of X\ and every e > 0 there exists 6 > 0 such that: f o V6(A) = f(V6(A))
C Vc(f(A)) = Vt o f(A).
Proof: By part (f) above, {x : f(x) C Ve(f(A))} is an open subset of X\. It clearly contains the closed set A and so contains V&(A) for some positive S by compactness. □ In particular, a function / : X\ —► A"2 is continuous if and only if it is a closed relation. Notice, however, that 6 depends on A as well as on e. We do not in general get the analogue of uniform continuity. We conclude with a useful limit result. P r o p o s i t i o n 4 Let {Fn} and {Gn} be decreasing sequences of closed rela tions from A'i to A'2 and from A"2 to A3, respectively (i.e. Fn+i C Fn, etc.). If H n F n = / and nnGn = g, then D n (G n 0 Fn) = g 0 / . Proof: Because the sequences are decreasing, (8) implies that g o f = 7Ti3((/ x A 3 ) fl (A'i x g)) = 7r 13 (n n [(F n x A 3 ) 0 (A x x Gn)]). By part (c) of Exercise 1 the intersection of a decreasing sequence of closed sets is the lim sup of the sequence. So by part (d) of Exercise 1, g 0 f = n„7r 13 ((F n x A 3 ) H (A-! x Gn)) = nn(Gn o Fn). (Actually, we only use the special case of the lim sup result that intersection commutes with taking image by a continuous map for a decreasing sequence of closed sets. Another compactness result). D Exercise 5 Let {Fn} be a decreasing sequence of closed relations from X\ to A~2 and {An} a decreasing sequence of closed subset of X\. With V\nFn = / and nnAn = A, prove that f)n(Fn(An)) = f(A). D
2
Recurrence for Closed Relations
With A" a compact metric space, as usual, we begin with a closed relation / on A . What does it mean to regard / : X —► X as a dynamical system?
8
Dynamical Systems: The Topological
Foundations
Given z E A", think of f{x) as the set of successors of x, the set of possible positions to which ;r can move in the next time period. So fn(x) is the set of possible fates for .T at time n. In dynamics our goal is t o compute the long run fate of a given initial point. Our logical first step is to enlarge the relation / to define the orbit relation:
of=\jr
(15)
n=l
i.e. y E Of(x) if y E fn{x) for some n = 1,2, Observe that we begin with n = 1 and not n = 0 so that it need not be true that x E Of(x). Notice that Of is a transitive relation. If y E fn(x) and z E fm{y) then z E fm+n{x). In general, a relation F on X is called transitive when F o F C F. Unfortunately, Of is usually not a closed relation even for a homeomorphism / . In fact, Of(x), the set of futures of a:, is usually not closed and we want to enlarge our notion of future to include the limit points of this set. First, define for any closed subset A of X the limit set: u>f[A] = \imsup{fn(A)}.
(16)
By Exercise 1, this is the set of points upon which the image sets {fn(A)} accumulate. In particular, for A = x, a single point, we use Exercise 1(c) to define: ujf(x)
= limsup{/ n (rr)} (17)
Kf(x) = Of(x) = Of(x)Uuf(x). These equations define new relations Kf and ujf on X. Notice that square brackets are used in (16) because ujf(A) = UxeAuf(x) can be a proper subset of wf[A] (see GTDS Exercise 1.7). While uf(x) and Kf{x) are closed subsets of X for each point x E X , the relations tof and Kf need not be closed relations, i.e. closed subsets of X x X. So we define flf Aff
= limsup{/n} _ = Of =
(18) OfUQf.
Recurrence for Closed
Relations
9
The relations Aff and Qf are closed but in taking the closure we may lose transitivity. As we will see, our theory develops by using the strong properties of closed, transitive relations. This suggests that we consider Qf = the smallest closed, transitive relation on X which contains / .
(19)
We can obtain Qf by intersecting over the family of all closed transitive relations containing / (e.g. X x X is such a relation). On the other hand, it is easy to check that a relation F on X is closed and transitive if and only if AfF = F. This suggests that we approach Qfhy successive applications of «A/\ F0 = / , F n + 1 = AfFn, Such a procedure will work but transfinite induction is usually required (see GTDS Exercise 1.18). There is a somewhat larger closed, transitive relation whose construction is more direct and natural, the chaining relation defined by Charles Conley, Cf. To motivate the definition of Cf let us reflect upon the meaning of our earlier constructions. Given x E A", y E 'R-f(x) = Of(x) if for every e > 0 there exist a whole number n and y\ £ /*(#) such that d(y,y\) < e. When / is a function this means we run along the orbit sequence { / ( . T ) , / 2 ( . T ) , . . . } and at some time make an e jump to y. On the other hand, y E Aff(x), i.e. (x,y) E 0 / , if for every e > 0 there exist a whole number n and Xi E A , ?/i E fn{&i) such that d(x,xi) < e and d{y,y\) < e. In the function case this means we make an initial e jump to rri, run along the orbit sequence of this new point {/(•Ti),/ 2 (.r 1 ),...} and at some time make an e jump to y. These little jumps suggest the inevitable measurement errors which occur in real applications. However, if you attempt to compute the orbit of a point on a computer by iterating the map, the little round off errors arise with each iteration, not just at the beginning and the end. From this observation comes the idea of a chain. Given e > 0, an e chain for a closed relation / on A is a sequence {rr 0 ,a- 1 ,...,,T n }, with?? > 1, such that for i = 0,. . . , n - l d(xi+uf(xi)) < e, that is, there exists y, + i E /(&,-) such that d{xi+i, y t + i) < e. We then call it a chain from ;r0, the initial point, to xn, the terminal point. The number n is the length of the chain. We say that x f chains to y, or just chains to y when / is understood, if for every positive e there is an e chain for / from
10
Dynamical Systems:
The Topological
Foundations
x to y. This defines the relation:
Cf = 0 0(V, o /).
(20)
As the intersection of transitive relations, it is clear that Cf is transitive. It is not obvious from the definition that Cf is a closed relation. However, the following identity implies closure. Cf=f]Af(VtofoVl).
(21)
While we will omit the proof of (21), referring to GTDS Proposition 1.8, the reader might want to undertake it as an exercise with the following hints. Choose for ;r 6 X and e > 0 a positive 8 < e/3 such that / o Vs[x) C K/ 3 o/0c},.and show; that 0{V6of oV6)(x)_C 0(V€of)(x). Then show that 6i + 62<6 implies V6l o 0(VSi ofoVSi)o V6l CO(VsofoVg). Finally, the closure of any relation F is contained in Vg1 o F o V$x if 8\ is positive. As Qf is the smallest closed, transitive relation it is contained in Cf. The inclusion can be strict. For example, if / is the identity map lx then / is a closed transitive relation and so Q\x = lx- However, if X is connected it is easy to see that for any positive e there are e chains for 1^ between any two points. So C\x = X x X. To summarize, we have constructed a tower of relations extending / : / C Of c Rf C Aff cQfC
Cf.
(22)
Successive steps associate to a point x larger and hence weaker versions of what we mean by "the future of .T". For each of these there is also a corresponding notion of recurrence. For a relation F on A" we say that x is in the cyclic set of F , denoted | F | , if .T is in its own future. Thus, \F\ = {x : .T E F(x)} = D o m ( l x n F).
(23)
As the domain of a closed relation is closed, it follows that the cyclic set of a closed relation is closed. In the case of a continuous function / , the cyclic sets of the relations in the tower (22) all have been given names in the literature. We will use them for a general closed relation / :
Recurrence for Closed
Relations
11
| / | is the set of fixed points of / . \Of\ is the set of periodic points of / . \7tf\ is the set of recurrent points of / . \Aff\ is the set of non-wandering points of / . \Qf\ is the set of generalized non-wandering points of / . | C / | is the set of chain recurrent points of / . Clearly, Fx C F2 implies |F X | C |F 2 |. In fact, F U F i = F 2 implies | F | U | F i | = | F 2 | . In particular the cyclic sets get larger as we move down the above list. Observe that x 6 fn{x) for some positive integer n implies x £ fnk(x) for k = 1 , 2 , . . . and so x G uf(x). Thus, \Of\ C \uf\ C |ft/|. So from (17) and (18) we prove the identities:
\Kf\ = \Of\ U K | = |u./| (24)
|jv/| = |o/|u|n/| = |n/|. Analogous results hold for C// and Cf. In fact, fC.QfC.Cf |ft/1 C | f t £ / | C |ftC/| and so the equations:
implies
Iff/| = | 0 / | U |ftff/| = |JW/| (25)
|c/| = |c?/| u |oc/| = |nc/| follow as above from the identities:
Qf =
OfVQQf (26)
Cf =
OfUQCfi,
where QQf and ftC/ are the relations QF with F -Qf and C / respectively. We will return to the proofs of these identities at the end of this section. Meanwhile, we describe the meaning of the latter one. Suppose y G Cf(x). For k = 1,2,... we can choose a 1/k chain of length nk from x to y. If, for some n, n-k = n for infinitely many fc's then because / is a closed relation, y € fn{x). If no such n exists then the lengths n* tend to infinity. In that
12
Dynamical Systems:
The Topological
Foundations
case, for every positive e and every positive integer n, x can be connected to y by e chains of length greater than n. This condition can be shown equivalent to y G SlCf(x) (see GTDS Proposition 2.15). When y G QCf(x) we say that x limit chains to y. For a closed, transitive relation F on A", e.g. F = Qf or Cf, the limit relation J7F is of particular importance and has a special relationship with the corresponding cyclic set. In fact, we show that the relation SIF "factors" through the cyclic set \F\. The key result is the following: L e m m a 6 Let F be a closed, transitive relation on X and B be a closed subset of X. If B is disjoint from \F\ then there exists n such that no 0 chain for F in B has length greater than n.
Proof: Since B D \F\ = 0, we have (B x B) n F H lx = 0. So for some e > 0, (B X B) C\ F f\ V€ — 0. By compactness we can choose a finite cover {U0,U\,... ,Un] of B by sets of diameter less than e. Suppose {;r 0 ,;ri,... ,.Tjt} is a 0 chain for F in B with k > n. By the pigeonhole principle there exist .T^J and Xj2 of the chain with j \ < j 2 such that x^ and Xj2 lie in the same element of the cover, and so (XJ^XJ2) E Vt. But .r t+1 € F{xi) for i — 0 , 1 , . . . , fc — 1 because the sequence is an 0 chain. As F is transitive this implies Xj 6 F(xi) for 0 < i < j < k. Thus, (.Tjj, Xj7) G (B x B) n F fl V€. This contradiction proves the lemma. □ P r o p o s i t i o n 7 Let F be a closed, transitive relation on X. (a) F contains the limit relation SIF. In fact, SlF = f)Fn
= uF.
(27)
n
Furthermore, \F\ = \QF\. (b) SIF is closed and transitive. In fact, nFonF
= FottF
= nFoF
= QF.
(28)
(c) y G OF(.r) if and only if there exists z G \F\ such that z G -F(:r) and y G F(z). That is. the limit relation $IF factors through the cyclic set \F\ = \OF\.
Recurrence for Closed
Relations
13
Proof: (a) Since F is transitive, F2 C F and so {Fn} is a decreasing sequence of closed relations. So by Exercise 1(c), O F = l i m s u p { F n } = n n F n . In particular, O F C F. Similarly, OJF(X) = limsup{F n (z)} = nnFn(x). But clearly, ( n n F n ) ( . r ) = n n (F n (.T)). Finally, x G F(x) implies x G Fn(x) for all n and so x G SlF(x). Thus, | F | C | 0 F | . The reverse inclusion is clear since O F C F . We prove (b) and (c) together. First, from (27) it is clear that F o O F and O F o F are contained in O F . Since O F C F , each of these contains OF o OF. Next suppose that z G | F | with y G F ( z ) and 2 G F(x). Then | F | = | 0 F | implies z G OF(z) and so y G F 0 O F 0 F(a?). By the above inclusions F o O F o F C O F 0 F C O F and so y G O F ( z ) . Conversely, assume y G O F ( . T ) . Let B be the closed set F(x) D F~1(y). For any n, y G F n + 2 (a;) and this means 5 contains 0 chains for F of length n. By Lemma 6, we must have J B n | F | ^ 0. Any point z in F ( x ) n F _ 1 ( y ) n | F | will serve as the factorization point we want. Thus, we have proved part (c). Finally, if y G SlF(x) and we choose z in F(x) D F J (y) fl | F | as above, we have, from (a) that z G SlF{z). So z G O F 0 F ( . T ) C O F ( . T ) and y G F o O F ( ^ ) C QF(z). Hence, y G O F o O F ( ^ ) . This inclusion completes the proof of (28) in (b). □ We conclude by gathering some useful basic properties. You can use the hints to work out the, fairly direct, proofs or use the references to the appropriation section of GTDS. Exercise 8 (a) For any relation F on X, -prove that \F\ = | F - 1 | . (b) For f a closed relation on X, prove that A(f~x) — (Af)~x for the relation operators A = O, 0 . M, Q, QQ, C and OC. (Hint: For 0 use Exercise 1(d) and for C use (21), or see GTDS Proposition 1.11(b).) (c) Let X be the interval [0,1] in R and f : X —► X be the homeomorphism defined by f{x) = x2. Prove that \Cf\ = \f\ = {0,1}. Show that with A — % or us, it is not true that A(f~l) = {Af)~l in this case. (d) With f a closed relation on X and F = Of, Qf or Cf, prove the identities: fUfoF = F = fUFof. (29)
14
Dynamical Systems:
The Topological
Foundations
(Hint: With Fi = / U / o F, prove that F^ C F and that Fx is transitive. Conclude Of C Fl and. when F is closed, Qf C Fx. Then show Cf C (Ve o / ) U (Ve o / ) o Af(Ve o / ) for e > 0 and intersect over e > 0 to get F C Fi when F = Cf. For the second identity apply the first to f~x. See also GTDS Proposition 1.11(d).) (e) Prove the identities of (26). (Hint: Use (29) and induction to show for n = 1,2,... F = f U f2 U . . . U fn U fn o F C Of U Fn+1 C F. Intersect over n and use (27). See also GTDS Proposition 2.4 (c).) □
3
Invariant Sets and Lyapunov Functions
If A is a subset of A" we say that A is + invariant for a relation / on X if f(A) C A, i.e. I G A implies f{x) C A. A is called invariant if f(A) = A, i.e. y G A if and only if y (E f(x) for some x £ A. Notice that for two subsets A and B of A" in general f(A) cB&[Ax
{X - B)] n / = 0.
(30)
In particular, A is + invariant for / if and only if the complement X — A is + invariant for / - 1 . L e m m a 9 Let f be a closed relation on X and A be a closed subset + invariant for f. uflA] = nnfn(A) (31) is a closed sttbset of A invariant for f and containing every f invariant subset of A. If, with F — Qf orCf. the subset A is F + invariant then F(A) = f(A) and u>F[A]=u>f[A]. (32) In particular, A is f invariant if and only if it is F
invariant.
Proof: If f(A) C A then fn+l(A) C fn(A) and so {fn(A)} is a de creasing sequence of closed subsets each / + invariant. So the intersection is / + invariant. It equals wf[A] by Exercise 1 (c). If y £ fn+1(A) then n n f-\y) fl f (A) ± 0. So y e uf[A] implies { / ^ ( y ) D f (A)} is a decreasing
Invariant Sets and Lyapunov Functions
15
sequence of closed nonempty sets, and the intersection f~l{y) 0 wf[A) is nonempty. Thus, u>f[A] is / invariant. Clearly, f(B) = B and B C A im ply, by induction, B C fn{A) for all n. So B is contained in the intersection, Now / C F implies / ( A ) C F(A) for any subset A. If F ( A ) C A then the identity F = fUfoFoi (29) implies F ( 4 ) C / ( A ) . Inductively applying this result to the F + invariant set Fn{A), we see that Fn+1(A) = f(Fn(A)) = / n + 1 ( ^ ) - So (32) follows from (31) applied to / and to F. In particular, F{A) = A if and only if F(A) C A and / ( A ) = A. □ Observe that if A is + invariant for / then it is automatically + invariant for Of. If, in addition, A is closed then it is -f invariant for 1Zf as well. However, + invariance with respect to Aff is, in general, a strictly stronger condition. Moving from there to Qf + invariance and on to Cf + invariance are each further strengthenings of the demands upon the set A. As we will now see, each of these conditions has a dynamic interpretation. If / is a map then a single point e is + invariant, or, equivalently, invariant, when it is a fixed point, i.e. e = / ( e ) . A fixed point is called stable if for points x near e the entire orbit Of(x) remains near e. As we will now see this kind of stability is exactly associated with Aff invariance of the fixed point. P r o p o s i t i o n 10 For f a closed relation on X and A a closed subset of X the following conditions are equivalent. (1) A is Aff + invariant. (2) For every neighborhood G of A there exists a neighborhood U of A such that x € U implies Of{x) C G. (3) Every neighborhood G of A contains some f + invariant neighbor hood U of A. Proof: (3) => (2): Obvious. (2) =£► (1): Given any positive e, there exists a positive 8 < e, so that ,r e V8{A){C U) implies Of{x) C Vt{A){= G). Now suppose x <E A and y € Aff(x). There exists a zero chain beginning 6 close to .T and ending 6 close to y. By choice of <5, the chain remains in Vt(A) and so y is e + 6 < 2e close to A. As e > 0 was arbitrary, y € A.
16
Dynamical Systems:
The Topological
Foundations
(1) => (3): Because Aff (A) C A and G is a neighborhood of the closed set A, Corollary 3 applied to Aff implies that for some positive b~ Aff{Vs(A)) C G and we can choose 6 so that V6(A) C G as well. Thus, GDUX=
VS(A)
UAff(V6(A))
DU2 =
VS(A)
U
Of(V6(A)),
and U2 is clearly an / + invariant neighborhood of A. Remark: If / is also transitive then Aff = Of and so U2 = U\ is closed as well as + invariant. If / is a continuous map then it can still be shown Ui is / + invariant and so U can be chosen closed in either case. See GTDS Remark after Proposition 2.7. However, the result stated there that U can be chosen open for a map is false. Q Exercise 11 Define the subsets o / R x R ; A'0 =
{(0,0)}U{(l/77,0):n = l , 2 , . . . }
A'i
=
{ ( l / ( ? i + l ) , l / ( n + m ) ) : n , m = 1,2,...}
X
=
A'QUA'I.
Prove that X is closed and so is compact. Define the function f\ : X\ —> A" by \-TTI v
n+l'n + m
n+l'
■
1)
m > 1
n+m—1'
(M)
(n = l , 2 , . . . ) m = 1
and f : X —* X by f = lx0 U f\. Prove that f is a continuous map and that with e = (0,0) Aff{e) = e. (Construct a base for the neighborhood system of e in X consisting of closed f invariant sets.) Prove that X is the only open f + invariant set containing e. D In order to describe the meaning of Qf + invariance we introduce the important concept of a Lyapunov function. A Lyapunov function L for a closed relation / on X is a continuous real valued fimction on X such that y G f{x) implies L(y) > L{x), i.e. fC
(33)
Invariant Sets and Lyapunov Functions
17
For any continuous real valued function l o n l , the relation
< L(x) < miL\Qf(x).
(34)
In particular, \L\ is a closed subset of X containing \Qf\, the set of gener alized nonwandering points. Proof: Condition (34) is clearly sufficient for regularity. On the other hand, with F = Qf, parts (b) and (d) of Exercise 8 imply that F = fUFof a n d F " 1 = / ^ U F ^ o / " 1 . Soifyi <E F~ *( x) then either yx G / " 1 ( ^ ) o r y i € F~1{zi) with Z\ (E f~l(x). If x is regular then the second possibility implies L{y\) < L(zi) (since L is an F Lyapunov function) and L(z{) < L(x) (since # is regular). So either possibility implies L(yi) < L(x). Because Qf~1(x) is a compact set, L achieves its maximum value on the set. Hence, supLlQf-Hx) < L(x). Similarly, L(x) < inf L\Qf(x). In particular, if x G Qf(x) then x is critical and so \Qf\ C \L\. Finally, \L\ is the domain of the closed relation ( / U / _ 1 ) n ( L x L ) _ 1 l R = {(*,?/) 6 / U f 1 : L(x) = L(y)}. So \L\ is closed. R e m a r k : If L happens to be a Cf Lyapunov function then by the same proof the inequalities (34) hold for a regular point x with Qf replaced by
Cf.
D
18
Dynamical Systems:
The Topological
Foundations
Exercise 13 (a) If L is a Lyapunov function for f then —L is a Lya-punov function for f~l with \L\ = | — L\. (h) If L is the sum of a uniformly convergent series of Lyapunov func tions, L = Y,nLn, then L is a Lyapunov function with \L\cf\\Ln\.
(35)
n
□ Now we can use Lyapunov functions to characterize Qf + invariant sets. Proposition 14 Let f he a closed relation on X and A be a closed subset of X. A is Qf + invariant if and only if there exists a Lyapunov function L on X such that A is the set of points at which L achieves its maximum value, i.e. A = {x : L{x) = s u p L } . Proof: For any real number c, {x : L(x) > c] is closed and is / + invariant because L is a Lyapunov function. Because L is automatically a Qf Lyapunov function the set is, in fact, Qf + invariant. In particular, {x : L(x) = sup.L} is Qf + invariant. We get the reverse direction from the following lemma applied to F = Qf. □ L e m m a 15 Let F be a closed, transitive relation on X and A be a closed F + invariant subset of X. There exists a Lyapunov function L : X —► [0,1] for F such that A = L~1{1). Proof: We mimic the beautiful proof of the Urysohn Lemma. Let {0, l , r i , r 2 , . . . } be a counting of the rationals in [0,1]. Define UQ = X, U\ = A and Ur = 0 for all rationals bigger than 1. Now apply Proposition 10, and the Remark thereafter, to define, inductively, UTn a closed, F = MF + invariant subset so that r n < r m implies Interior UTn D UTrn. We make our choices so that n^=2UTn = A. Define L(x) to be the value of the associated Dedekind cut: L{x) = sup{r„ : .T £ Ur„} = inf{r : x 0 Ur}. As usual, L is continuous because {x : L{x) < t} = U ^ ^ A ' - UTn and {x : L(x) > t] = U rn> flnt Urn. Because each Ur is F + invariant, x G Ur implies F(x) C Ur and so L is a Lyapunov function. Finally, A = n^=2Urn = L~1{1). □
Invariant Sets and Lyapunov Functions
19
P r o p o s i t i o n 16 Let F be a closed, transitive relation on X. There exists a continuous real valued function L on X such that y £ F(x) implies L(x) < L(y) with equality only if, in addition, x E F(y). In particular, L is a Lyapunov function for F with \L\ = \F\. Proof: Notice first that if a; G F(y) and y 6 F(x), i.e. (x,y) € FnF'1 then L(x) = L{y) for any Lyapunov function L. Next construct for any fixed pair (a?,y) in F — {F fl F~l) a Lyapunov function L(XtV) such that L(Xiy)(x) < jL(Xiy)(y). To do so, apply Lemma 15 to the F + invariant set A = {y} U F(y) and observe that x $ A since y € F(x) but x £ F(y). For each continuous function L, the set
y) • L(x) < L(y)} is an open set in X x X. As L varies over all Lyapunov functions, we have seen that these open sets cover F — (FnF-1). While this set is not compact it is a separable metric space and so satisfies the Lindelof property. We can therefore choose a countable sequence {Ln} of Lyapunov functions so that {
20
Dynamical Systems:
The Topological
Foundations
this is equivalent to V"£ o f(U) C U for some e > 0. Thus, U is inward for / if it is Ve o / 4- invariant for some positive e. This in turn implies G(Vt o / ) 4- invariance and so Cf + invariance by definition (20). E x e r c i s e 18 (a) Assume U is inward for f. Prove X — (Int U) is inward forf~\ (b) Let L be a Lyapunov function for f, The numbers in the closed set L(\L\) C R are called the critical values of L, and the remaining reals are called the regular values of L. Assume c is a regular value for L. Prove that {L > c] = {x : L(x) > c} is an inward set. (c) For a Lyapunov function L for / , assume that the set of critical values, L(\L\), is nowhere dense. Prove that L is a Lyapunov function for Cf. (Hint: Prove that {L > c] is Cf + invariant for every real number c.) D
For a closed relation / on JV, an / invariant subset A is called an attractor when there exists a sequence of closed subsets {Un : n = 0 , 1 , 2 , . . . } satisfying the conditions: Int UnDUn+1 Int Un+lDf(Un)
(n = 0 , l , . . . ) (n = 0 , l , . . . ) -
(36) (37)
00
n Un = A.
(38)
n=0
Condition (36) says that the sequence {Un} is decreasing and (37) together with (36) implies each Un is inward. In fact, by Corollary 3, there exists for each n a positive en so that Un+1 D V€n o f(Un)
(n = 0 , l , . . . ) .
(39)
Thus, an attractor is an invariant set A with neighborhoods squeezing down to A under iterates of / . Le m m a 19 Let A be an attractor for the closed relation f on X sequence {Un} of neighborhoods satisfying (36), (37) and (38). A is a Cf invariant set and SlCf(Uo) = uCf[Uo] = wf[U0] = A.
with
(40)
Invariant Sets and Lyapunov Functions Furthermore,
21
U0 D \Cf\ = A D | C / | and Cf(An\Cf\)
= A.
(41)
Proof: By (39), C7n+1 D 0 ( Ve„ o /)(tf n ) D C/(tf B ) for all n. By induc tion, J7R+fe D (Cf)k(Un) for n,fc= 0 , 1 , . . . So (31) implies
0 Un+k D uCfPn] D «/P„J. Because A is / invariant by assumption, A is contained in Ljf[Un] by Lemma 9. By (38) the intersection on the left is A. So the intermediate sets are A as well. Cf invariance follows. By (27), QCf = uCf and QCf(UQ) = (nk(Cf)k)(U0). But wCf[U0] is fc Hfc((C/) (?7o)), by (31). These two are equal by Exercise 5. Equation (40) follows. Since \Cf\ = \QCf\, U0n\Cf\ C SlCf(U0) = A and so U0C\\Cf\ = AC\\Cf\. By Cf invariance of A, Cf(A D \Cf\) C A. On the other hand, if y G A = £lCf{Uo) then by Proposition 7(c), there exist x G Uo and z G | C / | such that z € Cf(x) and y G Cf(z). Since
eywo)c0i ctf0, ze%n|C/|. Thus,y ecf(u0n\Cf\) = c/(An|c/|). □ The definition which we have given of an attractor appears to be very special. In fact, the power of the concept arises because of a long list of conditions of different apparent strengths which are all equivalent to being an attractor. We have adopted the strongest as the definition. The appar ently weak conditions are then used as criteria to recognize an attractor. Observe that part (c) characterizes Cf + invariance using these ideas. P r o p o s i t i o n 20 Let f be a closed relation on X and A be a closed subset
ofX. (a) The following conditions are equivalent. When they hold we call A a preattractor. (1) A is f + invariant and there exists a closed neigh borhood U of A such that wf[U] C A. (2) A is f + invariant and there exists a closed f + invariant neighborhood U of A such that n£L 0 {/ n (?7)} C A.
22
Dynamical Systems:
The Topological
Foundations
(3) A is f + invariant and there exists an inward neigh borhood U of A such that n™=Q{fn(U)} C A. (4) A is f + invariant and there exists an inward set U containing A with n™=0{fn{U)} C A. (5) A is Qf + invariant and AH \Qf\ is open (as well as closed) in \Qf\. (6) A is Cf + invariant and A D \Cf\ is open (as well as closed) in \Cf\. (7) A is f + invariant and {x : Q,Qf(x) C .A} is a neighborhood of A. (8) A is f + invariant and {x : QCf(x) C A} is a neigh borhood of A. A preattractor is the intersection of its inward neighborhoods. In fact, the set of inward neighborhoods U of A with n£L 0 {/ n ((7)} C A form a base for the neighborhood system of a preattractor A. The class of preattractors is closed under finite union and intersection and contains all inward sets. (b) The following conditions on A are equivalent. (1) A is f invariant and there exists a closed neighborhood U of A such that n*=0{fn{U)} C A. (2) A is an f invariant preattractor. (3) A is a Cf invariant preattractor. (4) A = tof[B] for some preattractor B. (5) A = u;/[?7] for some inward set U. (6) A is an attractor. (c) The following conditions on A are equivalent. (1) A is Cf + invariant. (2) A is the intersection of a (possibly infinite) family of preattractors. (3) The inward neighborhoods of A form a base for the neighborhoods system of A. These conditions imply that AC\ \Cf\ is a closed union of components of
ic/|. Proof: For the elaborate details of this result we refer to GTDS Theo rem 3.3 For our purposes, it will suffice to show that an attractor satisfies
Invariant Sets and Lyapunov Functions
23
the preattractor conditions of part (a) and to show, assuming the results of part (a), that an / invariant preattractor is an attractor. Notice that the sequence {Un} is a base for the neighborhood system of A and since A is invariant, A C wf[Un] C wf[U0] = A for all n, by (40). Since U0 fl \Cf\ = A D \Cf\ and U0 is a neighborhood of A, A n \Cf\ is open as well as closed in the relative topology on \Cf\. Finally, fiC/({70) = A implies U0 C {x : QCf(x) C A} C {x : QQf{x) C A}. Hence, these sets are neighborhoods of A. Now suppose A is an / invariant preattractor. By part (a) the inward neighborhoods U of A such that u>f[U] is contained in A, and hence equals A by invariance, form a base for the neighborhood system of A. Choose an inward neighborhood U0 of A with u)f[U0] = A. We can inductively define a sequence of inward neighborhoods {U^} of A such that Uk+i C Int U^ and n£i0£/jfc = A. Uk+i is a neighborhood of the intersection, A, of the decreasing sequence {fn(Uk) '• n = 0 , 1 , . . . } . So there is a positive integer nk such that PHUk) C Int Uk+1 (A: = 0 , 1 , . . . ) . (42) We build our sequence {{7n} D v renumbering and filling in the gaps. Define U0 = Uo (43) Un = Uk+i forn = ??o + . . . + nfc (fc = 0 , 1 , . . . ) The gaps in between are filled in using the following: L e m m a 21 Let Ua and Ua+r be inward sets with Ua+r C Int Ua and fr(Ua) C Int Ua+r for som,e positive integer r. There exist inward sets Ua+u • • • i Ua+r-i such that Ua+j+i C Int Ua+j and f(Ua+J) C Int Ua+j+i for i = 0,l,...,r-l. Proof: By induction on r. With r = 1, there is no gap and the result is trivial. With r > 1, let B = f{Ua). As Ua is inward B C Int Ua and, •by assumption, fr~l{B) C Int Ua+T. By the continuity result, Corollary 1.3, there exists 8 > 0 such that with Ua+i = Vs(B), Ua+X C Int Ua and fr~l{Ua+\) C Int Ua+r. Ua+i is inward because f(Ua+i) C / ( U a ) = B. The gap from ?7a+i to Ua+r is filled in by using the inductive hypothesis.
24
Dynamical Systems:
The Topological
Foundations
This completes the proof of the lemma and so allows us to fill in the gaps in the sequence between r?0 + . . .rc*.and no + ••• + «* + rik+i to define the complete sequence {Un} of neighborhoods of A satisfying (36), (37) and n (38).
4
Attractors and Basic Sets
The theme of this section is the relation between the attractors for a closed relation / on A" and the chain recurrence set |C/|, i.e. the set of chain recurrent points for / . For any set A we call A D \Cf\ the trace of A on \Cf\. By Lemma 19 an attractor is determined by its trace. This follows from equation (41) which we rewrite here: Cf(An\Cf\) = A
(44)
for any attractor A for / . For any preattractor £?, e.g. any inward set, the limit set A = u>f[B] is an attractor by part (b) of Proposition 20. Since B is Cf + invariant, Lemma 9 implies that equation (32) applies to B and so A = nn[Cf)n(B) = QCf(B). (Notice the apparent ambiguity in the middle expression and use Exercise 5 to eliminate it.) So if z E B fl |C/|, z E SlCf(B) and so z e A. Thus, for any preattractor B n \Cf\ = A D |C/|, i.e. the preattractor B and the associated attractor A = ujf[B] have the same trace. P r o p o s i t i o n 22 For a closed relation f. the class of attractors is finite or countably infinite. Proof: By Proposition 20 the trace of an attractor is an open-andclosed subset of the compact metric space \Cf\. A compact open set can be written as a finite union of members of any base for the topology. Since \Cf\ has a countable base, it has at most countably many open-and-closed sets and so countably many attractor traces. By (44) distinct attractors have distinct traces. Thus, there are countably many attractors. D An attractor R for the inverse relation / _ 1 is called a repellor for / . So for a repellor equation (44) becomes Cr\Rn\Cf\) = R.
(45)
Attractors
and Basic Sets
Recall from Exercise 8 that (Cf)
25 l
= C(f *), so we omit the parentheses.
1
Also \Cf\ = IC/- !. An attractor-repellor pair consists of an attractor A and a repellor R such that A D i? = 0 and | C / | C A U i?. P r o p o s i t i o n 2 3 Let A be an attractor for a closed relation f on X. There is a unique repellor R for f such that A, R form an attractor-repellor pair. Called the repellor dual to A, R is characterized by: R = Cf~\\Cf\
-(AH
\Cf\)) = X - {x : QCf(x) C A}.
(46)
In particular, if x G X - (A U i?) then £lCf(x) C A and Q,Cf~l(x) C R. Proof: Because attractor traces are open in | C / | , \Cf\ — (An \Cf\) is a closed set and so R is closed, and C / - 1 + invariant by transitivity of Cf-1. Notice that x e R implies x E Cf~\z) for z G \Cf\ -(An \Cf\). l Since z 6 Cf~ (z) we see that z £ R. R contains \Cf\ - (An \Cf\) and x G Cf~l(R). Thus, R is Cf'1 invariant. If .T were also in A then z G Cf{x) would imply z e An \Cf\ which is not true. Thus, A n i? = 0 and | C / | C AU i?. In particular, .Rn \Cf\ = \Cf\ - (An \Cf\) which is open-and-closed in \Cf\ = \Cf~x\. So by part (a)(6) of Proposition 20, R is a preattractor for / _ 1 and by part (b)(3) it is an attractor for / _ 1 , i.e. a repellor for / . If a; E R then, x G Cf~l(z) for some z in Rn\Cf\. Thus, z € RnQCf(x). In particular, QCf(x) meets R. If, on the other hand, x £ R and y € QCf(x) then by Proposition 7(c), y G Cf(z) for some z G Cf(x) D | C / | . Because JF 0 i?, 2 G A fl | C / | and so by Cf + invariance of A, y G A. Hence, O C / ( . T ) C A. Thus, R is the complement of {x : ftC/(ar) C A}. Applying this result to the attractor R for / _ 1 we see that {.T : QCf~1(x) C R] is the complement of A. So x e X - (AU R) implies both QCf(x) C A and fiC/-H-T) C R. a Picking up now our announced theme, we characterize the chaining relation by using attractors. P r o p o s i t i o n 24 Let f be a closed relation on X and x,y G X. (a) If x G \Cf\ then y G Cf(x) if and only if every attractor for f which contains x also contains y. (b) If x 0 \Cf\ then there exists an attractor- repellor pair A, R such that x 4 A U R.
26
Dynamical Systems:
The Topological
Foundations
Proof: If y g Cf(x) then by part (c) of Proposition 20 applied to the Cf + invariant set C / ( . T ) , there exists an inward set U containing Cf{x) with y &U. Let A be the associated attractor for U, namely wf[U}. If .T G \Cf\, then .T G Cf(x) and so x G U n | C / | , the trace of *7, which is contained in A. So A is an attractor containing x but not y. The reverse implication in (a) is obvious from the Cf + invariance of attractors. If .T ^ \Cf\ and we choose y = .T in the first paragraph then x g U and so x £ A, but by Proposition 7(c), QCf(x) C Cf(Cf(x) D \Cf\) and so flC/(s) C Cf(U n |C/|) = C/(i4 n \Cf\) = A. Therefore, by (46) x is not in the repellor dual to A either, i.e. x £ AU R, proving (b). D By using attractors we can construct Lyapunov functions in a way which bypasses the Urysohn Lemma argument of Lemma 15. L e m m a 25 Let A, R be an attractor-repellor pair for a closed relation f on X. There exists a Lyapunov function L : X —► [0,1] for Cf such that A = L - ^ l ) , R = L-^O) and \L\ = A\J R. Proof: If U is an inward neighborhood of some closed set B and L : X —> [0,1] is continuous with L(x) = 1 for x G B U f(U) and L(x) = 0 for # G X — Int U then X is a C / Lyapunov function. For if y G Cf(x) then either ;r G U in which case y G Cf(U) = f(U) (cf. Lemma 9) in which case L(y) = 1 > -^(.T), or x E X — Int ?7 in which case L(x) = 0 < L(y). Now if x ^ A U i? then we can choose an inward neighborhood of A U Cf{x) which does not contain x and apply the above construction to get a Cf Lyapunov function which is 1 on A U Cf{x) and O o n i . Similarly, we construct a Cf'1 Lyapunov function which is 1 on R U Cf~l(x) and 0 on .T. Taking the difference and adjusting linearly we get a Cf Lyapunov function Lx : X -* [0,1] with R C £ _ 1 ( 0 ) , A C L _ 1 ( l ) and x e Gx = X — \LX\. Choose a sequence {.xn} in X — (A U R) so that {GXn} covers X — (A U R). With Se n a positive series summing to 1, T,enLXn yields the required Lyapunov function. (For details see GTDS Proposition 3.10.) □ On the recurrence set \Cf\ the relation Cf is reflexive as well as tran sitive. Thus, Cf fl Cf~l is a closed, symmetric, transitive relation with domain \Cf\. On \Cf\ it is a closed equivalence relation. The associated
At tractors and Basic Sets
27
equivalence classes are called the basic sets for / . So we see that for x G X:
c/wncr I w = (f1, , .
4
...
x
*fJt\
(47)
[ the basic set containing x x G |C /1 By Proposition 24, two points of \Cf\ lie in the same basic set exactly when they are contained in exactly the same attractors. Notice, too, that if L is any Cf Lyapunov function then it is constant on each basic set. P r o p o s i t i o n 26 Let f be a closed relation on X. There is a Cf Lyapunov function L on X such that \L\ = \Cf\ and L takes distinct basic sets to distinct values, i.e. L{x) = L{y) for x,y G \Cf\ if and only if x G Cf(y) and y G Cf(x). Proof: By Proposition 22, the class of attractors is countable. Let {An} be an infinitive sequence of attractors (repetitions are allowed) which includes all of them. For each ??, let Rn be the repellor dual to An and Ln : X —> [0,1] a Cf Lyapunov function with An = Z/~ 1 (l), Rn = L'1^) and \Ln\ = An U Rn. Define L(.T) = ^ = 1 2 . 3 - n L n ( ; r ) .
(48)
As the series converges uniformly, Exercise 13(b) implies that L is a Cf Lyapunov function with \Cf\ C \L\ C f| \Ln\ = f)(An U Rn) C \Cf\ n
using Proposition 24(b) for the last inclusion. Thus, \Cf\ = \L\. If x G \Cf\ then the sequence {Ln(x)} consists of 0's and l's with the l's indicating which attractors in the sequence {An} contain x. Equation (48) then associates to .r the point in the classical Cantor set with ternary (i.e. base 3) expansion given by the sequence {2L n (.r)}. If L{x) = L(y) for x,y G \Cf\ then uniqueness of the ternary expansion on the Cantor set implies x and y lie in exactly the same attractors. So x and y are in the same basic set. D A Lyapunov function satisfying the conditions of this Proposition is called a complete Cf Lyapunov function. The restriction of such a function
28
Dynamical Systems:
The Topological
Foundations
L to \Cf\ yields an embedding of the quotient space of basic sets, i.e. the space of equivalence classes under CfC\Cf~l on \Cf\, onto the set of critical values i(|Zr|) in R. In the special case constructed in the proof above, .L(|£|) is a closed subset of the Cantor set and so is zero- dimensional. Hence, for any complete Cf Lyapunov function L the critical value set is zero-dimensional and hence nowhere dense in R. Thus, we can regard the quotient space of \Cf\ by the equivalence relation Cf D Cf-1 as the space of basic sets of / , a compact zero-dimensional metric space which is, via any complete Cf Lyapunov function, homeomorphic to a compact nowhere dense subset of R. Cf induces a partial order on the basic sets: a closed, reflexive, antisymmetric and transitive relation on \Cf\/Cf D Cf-1. Notice that the space of basic sets for / and for f~l agree. Any Cf -f- invariant subset B of X contains any basic set it meets and so the trace B 0 \Cf\ is the union of these basic sets. In particular, we have the following dual results: Proposition 27 For a closed relation f, two attractors are equal if they contain exactly the same basic sets. Two basic sets agree if they are con tained in exactly the same attractors. Proof: If A\ and A2 are attractors which contain exactly the same basic sets then the traces Ax D\Cf\ and A2H \Cf\ agree as these are each the union of this common family of basic sets. So AY = A2 by (44). If B\ and B2 are basic sets contained in exactly the same set of attractors then with X\ £ B\ and x2 E B2, xux2 E \Cf\ and so by Proposition 24(a), Xi G Cf(x2) and x2 £ Cf(xi). So ;ri and x2 lie in a common basic set which is Bi = B2. □ On the other hand, while a closed relation admits only countably many attractors there may be uncountably many basic sets. Exercise 28 Let C be the Cantor set in the unit interval [0,1] and let k : [0,1] —> [0,1] be a continuous, nonnegative function which vanishes exactly on the Cantor, e.g. k{x) = inf{|.r - .Ti| : xx E C). Let X = [0,1] x [0,1], a unit square in R 2 . Define f : A" —> A' by: f(x,y)
= (x,y + -2/(1 - y)[(2y - l ) 2 + k(x)]).
(49)
Attractors
and Basic Sets
29
Prove that f is a homeomorphism with \f\ = \Cf\ = ([0,1] x {0,1}) U (C X {|}). (Hint: Show that L(x,y) = y is a Cf Lyapunov function, though not a complete one.) Show that [0,1] x {0},, [0,1] x {1} and each point {(ar, | ) } in C x {2} o,re basic sets. Describe the attractors and dual repellors. □ Finiteness for the class of basic sets coincides with finiteness for the class of attractors. P r o p o s i t i o n 29 For a closed relation f there are finitely many basic sets if and only if there are finitely many attractors. To be precise, if f has k distinct basic sets, it has at least k distinct nonempty attractors. If f has at most k distinct basic sets it has at most 2k distinct attractors. In particular, f has no basic sets if and only if 0 is the only attractor for / , and f has exactly one basic set if and only if it has exactly one nonempty attractor. Proof: Each attractor is characterized by the set of basic sets it con tains. If there are k basic sets then there are 2k sets of basic sets and so at most 2k attractors. For example, if A" is a set of k points and / = lx then the k points of A' are the basic sets and every subset is an attractor. So there are 2k attractors. Suppose now that / has at least k distinct basic sets. Choose L a complete Cf Lyapunov function. L is constant on each basic set and takes different values on distinct basic sets. Hence, we can number the k basic sets B\,B2i.. •, B^ so that the corresponding values for L satisfy 61 < 62 < . . . < bk- As the critical values for L form a nowhere dense set we can choose regular values C\,.. .Ck so that C\ < 6j < c2 < b2 < c 3 < 6 3 . . . 6jt_i < c^ < 6fc. By Exercise 18(b) the set U{ = {L > q } is an inward set with associated attractor A{ — wf[lh] containing J B J , B , + I , .. . , B * but not the remaining basic sets on the list, for i = 1 , . . . , k. So the attractors Ai, A2,... ,Ak are nonempty and distinct. The entire space A' is an inward set (/(A') C Int X = X) and the associated attractor is u>/[A~] = D n / n (A"). If for some n = 1,2,... the set fn(X) is empty, or equivalently the relation fn is 0, then 0 is the only attractor, in fact the only / invariant subset. For sufficiently small positive e, (Ve o f)n is 0 as well. (Hint: Use Proposition 4 and induction.) Hence, {Cf)n = 0, \Cf\ = 0 and there are no basic sets. These peculiar,
30
Dynamical Systems:
The Topological
Foundations
nilpotent, closed relations are described in GTDS Exercise 2.16. If, on the other hand, fn(X) / 0 for n = 1,2,... then the intersection uf[X] is a nonempty attractor, A. As 0 is an attractor with empty trace, A must have a nonempty trace, by (44) again. So \Cf\ / 0 and there are some basic sets. If there is exactly k = 1 basic set then there is at least 1 and at most 1 2 — 1 = 1 nonempty attractor. Finally, more than one basic set implies more than one nonempty attractor. E The unique basic set case of this proposition brings up an alternative use of the word "transitive". A group acting on a space, a group of rotations of the sphere, for example, is said to act transitively if any point of the space can be moved to any other point by the action of some member of the group. With this in mind we call a closed relation / on A chain transitive if any point of A" chains to any other, that is, if Cf — X x A". Proposition 30 For a closed relation f on X the following conditions are equivalent: (1) f is chain transitive, i.e. Cf = X x A'. (2) X is a basic set for f. ('V \Cf\ — X and f has a unique basic set. (4) Dom(f) = X and X is the only nonempty attractor for f. (5) f{X) = X = f~\X) and f has a unique nonempty attractor. Proof: Since \Cf\ is the union of the basic sets, the equivalences be tween (1), (2), and (3) are clear. (2) => (4): If A' is a basic set for / and A is a nonempty attractor then A meets A and so A contains A'. Thus, A = X. X is also a basic set for f"1 and so A" is also a repellor. In particular, A" is / _ 1 invariant. That is, A = /- 1 (A") = D o m ( / ) . (4) =*► (5): The unique nonempty attractor is A". In particular, / invariance of A implies A = / ( A ) . Finally, A = D o m ( / ) = / _ 1 ( X ) . (5) =^ (3): There is a unique basic set by Proposition 29. If .T £ A" then {/"(•?)} is a sequence of nonempty closed sets since / _ 1 ( X ) = D o m ( / ) = A . Hence uf(x) C Qf{x) C QCf(x) is nonempty. So by Proposition 7(c) there exists zx € \Cf\ such that zx G Cf{x). Similarly, /(A") = A" implies there exists z2 6 \Cf\ such that z2 £ Cf~1(x). But there is a unique basic set which must therefore contain both z\ and z2. In particular, z2 € Cf{z\). By
Attractors
31
and Basic Sets
transitivity, zx G Cf{x). Then z2 G Cf{zi) and x G Cf(z2) imply x G Cf{x), i.e. rrG | C / | . Thus, \Cf\ = X. R e m a r k : As C ( / _ 1 ) = ( C / ) ~ \ condition (1) is symmetric in / . So / chain transitive implies / _ 1 is chain transitive. D For any closed subset B of A" we define the restriction of the closed relation / to £?, or the subsystem induced by B , to be the closed relation IB on B: fB = fn (B x B). (50) For example, if / is a function then the restriction fg is a function if and only if B is an / -f- invariant subset. We call B a chain transitive subset for / on A", if the restriction fg is a chain transitive relation on the compact metric space B. A basic set B is a chain transitive subset but the proof is not as easy as it first appears to be. Given .T, y G B we know that x chains to y, that is, for any e > 0 there is an e chain {;ro,.Ti,... , x n } with n > 1, XQ — $ and ;rn = y. However, to show B is chain transitive we must construct such e chains remaining entirely inside B. By contrast if x and y lie in different basic sets but y G Cf(x), we usually cannot construct such e chains lying entirely in \Cf\. The key result requires another concept. If for a closed relation F a subset B is F 4- invariant then any chain for F (i.e. 0 chain) beginning in B remains in B. If B is F~l + invariant then any chain for F ending in B lies in B. We call B F semi-invariant if any chain which begins and ends in B lies entirely in B. We can express this as the inclusion G{F){B)
D C{F)-\B)
C B.
(51)
Note that if F is transitive, 0(F) = F. L e m m a 31 Let f be a closed relation on X and B be a closed subset of X. We have the inclusion C{fg) C {Cf)g with equality when B is Cf semi-invariant, i.e. when Cf{B)f\Cf~1(B) C B. Proof: The inclusion is an easy exercise. The equality in the semiinvariant case is proved in GTDS as Theorem 4.5. D
32
Dynamical Systems:
The Topological
Foundations
Corollary 32 Any basic set for a closed relation f on X is a chain tran sitive subset for f. Proof: If B is a basic set then Cf(B) = Cf(x) and Cf~l{B) = Cf~l(x) for .T in B. So Cf(B) nCf'^B) = Cf(x)nCf-1(x) = B. Thus, B is Cf semi- invariant. Also, B x B cCf and so B x B = (Cf)B. By the lemma,
C(fB) = BxB.
n
What does it mean when each basic set is as simple as possible, i.e. a single point? The classical definition of a Lyapunov function L for a homeomorphism / on X is a continuous real- valued function which is strictly increasing on nonequilibrium orbits, i.e. {L(fnx)} is increasing in n unless f(x) = x. Motivated by this idea we call L a strict Lyapunov function for a closed relation / if L is a Lyapunov function with \L\ = \f\. Proposition 33 Let f be a closed relation on X. (a) f admits a strict Lyapunov function if and only if \f\ = \Qf\, i.e. every generalized nonwandering point is a fixed point, f admits a strict Cf Lyapunov function if and only if \f\ = \Cf\, i.e. every chain recurrent point is a fixed point. (b) If every basic set for f is a single point, i.e. y G Cf(x) and x G Cf(y) imply x = y, then any complete Cf Lyapunov function is strict and injective on \Cf\ = \f\. Conversely, if f admits any Cf Lyapunov function L which is injective on \Cf\ (C \L\) then every basic set is a single point. Proof: (a) If L is a strict Lyapunov function for / then | / | C \Qf\ C |L| = | / | . So \Qf\ = | / | . Similarly, if L is a strict Cf Lyapunov function, |£/l = l/l- Conversely, if | / | = \Qf\, or | / | = | C / | , we can apply Proposition 16 to F = Qf or Cf to get a strict Lyapunov function. (b) If B is a basic set then by Corollary 32, B is a chain transitive subset. If B = {;r} then by Proposition 30 applied to f&, we have x 6 f(x), i.e. x G l/l- Thus, if every basic set is a singleton, then \Cf\ consists entirely of fixed points, and a complete Cf Lyapunov function is injective on \Cf\. As \L\ = \Cf\ = | / | , L is strict. Any Cf Lyapunov function L is constant on each basic set B. So, if L is injective on \Cf\ then B is a singleton, for each basic set B. D
Maps Between Dynamical Systems
5
33
Maps Between Dynamical Systems
Given a continuous map h : X —> Y we write h x h : X x X —> Y x Y for the product map with (h x h)(xi,x2) = (h(xi),h(x2))< If / is a relation on A", i.e. a subset of A" x A', then {h x h)(f) is a subset of Y x Y and so is a relation on Y. Similarly, if g is a relation on F , then the preimage (h x h)~l{g) is a relation on A'. It is easy to check that we can describe these constructions using composition of relations: (hxh)(f)
=
hofoh-1 (52)
{hxhr\g)
=
hTlogoh.
We say that h maps f to g (written h : f —> g) if for all x\,x-2 E A", •t'2 £ f(xi) implies /?(.T 2 ) € g{h(xi)). This condition is easily seen to be equivalent to each of the following inclusions: (hxh)(f)Cg fcihxhr'ig)
(53)
h o / c g o h. For example, if / is a relation on X and B is a closed subset of A', then the restriction of / to B was defined in the previous section by f& = ff)BxB. The inclusion map from B to A" clearly maps / # to / . P r o p o s i t i o n 34 Let h : X —► Y map the relation f on X to the relation g on Y. Then h maps f to g, / _ 1 to g~l, fn to gn for n = 0 , 1 , 2 , . . . and (when f and g are closed) Af to Ag for each of the relation operators
A = o,u,n,ii,Af,G,ng,CMC. Proof: We use the conditions of (53). (/? xft) _ 1 (#) is closed and contains / . So it contains / . Clearly, (/ix/?)(/ _ 1 ) = {(hxh^f))'1 which is contained l n n in g~ . ho f C g o h is clear for n = 0, assumed for n = 1 and follows by induction for higher n. If {fa} a n d {#«} a r e families of relations with h mapping fa to gQ for each a then since (h x h)~l preserves union and intersection, h also maps
34
Dynamical Systems:
The Topological
Foundations
UafQ to Ua<7a and r\afa to C\agQ. In particular, h maps Of = U n / n to Og, the lim sup ft/ toft#,and Aff = OfU ft/ to J\Z>. For * G A" fixed &("/(*)) = h{hmsup{fn{x)}) C n limsup{gf (/?(;r))} = w#(/?.(#)) by Exercise 1(d). So h maps u>f to u><7 and Uf = Of U w / to Kg. Because h is a map, it is easy to check that hoh~l C l y . So the relation (/? x h)~1{Qg) = h~x oQgoh is easily seen to be transitive as well as closed. Since this relation contains / , it contains Qf. Finally, h is uniformly continuous. Given e > 0 there exists 6 > 0 so that h o Vs C Vt o h. Hence, h oVso f cV€o g oh. That is, h maps V$ o f to Vto g. So h maps C / C 0(Vs o / ) to C7(Ve o ^). Intersecting over e > 0 we see that (/? x h){Cf) is contained in Cg. □ Recall that for functions, as opposed to more general relations, inclusion implies equality. So if / and g are functions and h maps / to g, then we have ho f — goh. (54) For general relations / on X and g on Y we call the continuous map h : X —► I" a semi-conjugacy from f to g when equation (54) holds. Thus, ft is a semi- conjugacy if h maps f to g and, in addition, the lifting property illustrated by the following diagram holds:
(55)
Given yuy2 with y2 G g{yi) and a-j such that h(xi) = y ^ there exists x2 such that /?(x2) = y2 and .T2 G f(x\).
Maps Between Dynamical Systems
35
The phrase "semi-conjugacy" is used because the term "conjugacy" is the isomorphism concept for dynamical systems. P r o p o s i t i o n 35 Let f and g be relations on X and Y respectively. A homeomorphism h from X onto Y is called a conjugacy from, f to g when it satisfies the following equivalent conditions: (1) h maps f to g and h~l maps g to f. (2) h is a semi-conjugacy from f to g and h~l is a semi-conjugacy from
9 to f. (3) h is a semi-conjugacy from f to g. The relations f and g are called conjugate if there exists a conjugacy mapping f to g. Conjugacy is an equivalence relation between relations on spaces. Proof: Clearly, (2) implies (1) and (3). Given (1) we have ho f C goh and h~l o g C / o h~l. Compose with h on the left and right in the latter to get, because h o h~~l = \y and h"1 oh = lx,gohchof. So equation l (54) is true and (3) follows. Given (3) we compose with h~ on the left and right in (54) to get h~l o g — f o /? _1 which implies (2). The identity on X maps / to / and so conjugacy is reflexive. Symmetry is clear and transitivity follows because the composition of conjugacies is a conjugacy. □ We would like to prove the analogue of Proposition 34, that is, if h is a semi-conjugacy from / to g then it is a semi- conjugacy of Af to Ag for A — 0,11, A/\ etc. In general, this requires the additional assumption that h be an open map. Recall that for a continuous map hi : A" —> Y the preimage of an open subset of Y is open in X. h is called open if the image under h of an open subset of X is open in I', i.e. U C X open implies h{U) is open in Y. The projections of a product onto a factor is an open map as is a map which is locally a projection, e.g. a fibre bundle map or a differential submersion. Exercise 36 Let h : X —> 1* be a continuous map. (a) Prove that h is open if and only if for every e > 0 there exists 6 > 0 such that h o V€ D V$ o h. (Hint: If h is open then lx x h : X x X -* X X Y
36
Dynamical Systems:
The Topological
Foundations
is open and so h o Vt = (lx x h)(Ve) is an open set containing the compact set h C X x Y). (b) If h is open, h(x) = y and {yn} is a sequence in Y converging to y then there exists N and a sequence {xn} in X converging to x with h(Zn) = Vn for n> N. E P r o p o s i t i o n 37 Let / , g be relations on X and Y respectively with h : A' —> 1" a semi-conjugacy from f to g. (a) h is a semi-conjugacy from fn to gn for n = 0 , 1 , 2 , . . . and from Of to Oy. If f and g are closed then h is a semi-conjugacy from Af to Ag with A = 0,u> and IZ. (b) Assume, in addition, that h is an open map. h is a semi-conjugacy from f to g. If f and g are closed then h is a semi-conjugacy from Af to Ag with A = 0,u,Sl,K,Af,g,QG,C and SIC. Proof: (a) h o fn = gn o h is clear for n = 0, assumed for n = 1 and follows by induction for higher n. If {fa} and {ga} are families of relations with h a semi-conjugacy from fa to ga for each a then h is a semi-conjugacy of Uafa to UQga by the distributive law, (11). In particular, h is a semi-conjugacy of Of to Og. Exercise 1(d) again shows, as in the proof of Proposition 34, that h(u)f(x)) = ujg{h(x)). Thus, h is a semi-conjugacy from u>f to<*>g and from Uf = Of U u>f to Kg. (b) By Proposition 34, h maps / to g and Af to Ag in each case. So it suffices to prove the lifting property, (55), for each of these. Assume y\ = h{x\) and (yi,t/2) £ 9- There is a sequence {(yi,y%)} in g converging to (yi,ya). By Exercise 36(b) we can lift the sequence {yj} to a sequence {.T"} in X converging to X\ such that h(x1l) = yj1 for all n (throwing away some initial terms if necessary). For each n, we use the lifting property (55) for / and g to choose .rj G /(tf?) such that /i(xj) = yjBy going to a subsequence we can assume that {.TJ} converges in X to some pointjr 2 - Thus, {(.rj,.?;)} is a sequence in / converging to (xi,x2), i.e. x2 € /(.Ti). By continuity of h< h{x2) = lim n {y£} = y 2 . Thus, the lifting property holds for / and g. If {/n} and {gn} are decreasing, closed sequences of relations with in tersections / and g respectively, and h is a semi-conjugacy from fn to gn
Maps Between Dynamical Systems
37
for each n then h is a semi-conjugacy from / to g, i.e. ho f = C\n(ho/n) = nn(9n ° h) = g o h by Proposition 4. It now follows that h o ft/ = /io (limsup n {/ n }) = (\ims\xpn{gn}) o h = ft<7 o h. Notice that this requires semi-conjugacy between various relation closures. Similarly, h is a semi-conjugacy from Aff = Of to Afg. By using the (transfinite) inductive construction of Qf using successive applications of A/", we see that h is a semi-conjugacy from Qf to Qg. Finally, given e > 0, choose 6 > 0 so that h o Ve D V& o h. Then, h o Vt o / D Vs oho f = Vs o g o h. Using induction and taking the union we get h o 0(\\ of) 3 0{VS o g) o h D Cg o h. So for each x £ X and e > 0, h{Af(Vt o / ) ( # ) ) D C^(/?(.T)). As e decreases to 0, the family of closed sets Af(V€ o f)(x) decreases to Cf(x) by (20) and (21). So by compactness, h(Cf(x)) = ne>0h{Af{Ve o / ) ( * ) ) D Cg{h{x)). The reverse inclusion holds because h maps Cf to Cg. To make this last argument a bit less mysterious, it is a useful exercise to show that with e and 8 as above, each 6 chain for g from t/i to y2 lifts to an e chain for / beginning at a?i, when h(xi) = y\. As e decreases to zero the terminal points of these lifted chains accumulate to points x2 with h(x2) = yi-, providing the (55) lift for Cf and Cg. d E x e r c i s e 3 8 (a) Let h : A" —> Y map f to g. Assume A and B are closed subsets of X and Y respectively such that A C h~1(B). Let h& : A —> B be the restriction of h. Prove h^ maps f& to gg. Assume now that h is a semiconjugacy from f to g and that A = h~1(B). Prove h^ is a semi-conjugacy from fA to gB. (b) Let X = [0,1] and f : X —> X be the homeomorphism defined by f(x) = x2 (recall Exercise 8(c)). Let Y be the quotient space of X obtained by identifying 0 and 1 to get a single point e ofY, and let h : X -4 Y be the quotient map. Prove that f factors throxigh h to define a homeomorphism g : Y —¥ Y with h mapping f to g and so h is a semi-conjugacy from f to g. Prove that h(0) = e. Mg{e) = Y and Cf(0) = {0}. Show that h is not a semi-conjugacy from Af to Ag for A = Q,Af,Q or C. Notice that h is not an open map. D We will now consider how a mapping h<. : f —> g relates basic sets and attractors of / to those of g. Notice first that if h maps F to G then x G F(x) implies h(x) G G{h(x)). So if / and g are closed relations and h
38
Dynamical Systems:
The Topological
Foundations
maps / to g then from Proposition 34 we get h(\Af\)c\Ag\
(A = 0,K1Af,gX)>
.
(™)
L e m m a 39 Let F and G be the closed transitive relations on X and Y, respectively. Assume h : A' —* Y is a semi-conjugacy from F to G. If xx G X and yuy2 E Y with h(xi) = yx and y2 G \G\ D G(y\) then there exists x2 G A" with h{x2) G y2 and x2 G \F\ n F(xi). That is, in diagram (55) a cyclic point y2 can be lifted to a cyclic point x2. In particular, if h : X —» Y is surjective then h(\F\) = \G\.
(57)
Proof: Define the closed subset of A", A = h~1(y2) 0 F(xi). The lifting property (55) implies there exists 0*2 such that h(x2) = y2 and x2 E F(xi), i.e. x2 G A. Thus, A is a nonempty compact set. If £\ E A then we can apply (55) to h(x\) = y2 and y2 G G{y2) to get x2 G X such that h(x2) = y2 and x2 G F{xi). Because F is transitive and x\ G A C -FX-Ti) we have ;r2 G F(,Ti), i.e. ;f2 G A. Thus, the restriction FA satisfies Dom(F,4) = A. So inductively Dom{{FA)n) = A and, a fortiori (FA)n / 0. By Lemma 6 it follows that A H | F | ^ 0. The points of this set are the cyclic point lifts of y2 that we want. Now if yi G \G\ and /? is surjective, then there exists xi G A" with h(xi) = y\. Let y2 = y\ G G'(yi) H |G'| and apply the previous result to get .T2 G \F\ with /?(;r2) = y2 = y\. Thus, h maps | F | onto \G\. D Recall that the basic sets for a closed relation / on X are the equivalence classes of the closed equivalence relation Cf H C / _ 1 on the chain recurrence set \Cf\. On the quotient space of basic sets Cf induces a partial ordering. For any collection of basic sets an element of the collection which is maximal (or minimal) with respect to the partial order Cf will be called a terminal (or initial) element of the collection. We use these terms to avoid confusion with maximal or minimal elements with respect to set inclusion. As an exercise the reader should prove that an attractor which is chain transitive is a single basic set which corresponds to a point which is terminal and topologically isolated in the collection of all basic sets (cf. Proposition 30 and Corollary 32).
Maps Between Dynamical Systems
39
P r o p o s i t i o n 40 Let f and g be closed relations on X and Y respectively. If h : A" —► Y maps f to g then for every basic set B for f in X there is a unique basic set B\ for g in Y such that h(B) C B\. Thus, h induces a continuous, partial order preserving mapping from the space of basic sets on X to the space of basic sets on Y. If h is a surjective semi-conjugacy from f to g then for every basic set Bi for g in Y there exists a basic set B for f in X siLch that h(B) C B\. Thus, a surjective semi-conjugacy induces a surjective map from the space of basic sets on X to the space of basic sets on Y. If h is an open, surjective semi-conjugacy from f to g then for every basic set Bi for g. in Y there exists a basic set B for f in X such that h{B) = B\. In fact, {B : h(B) C B\] is a compact, nonempty subset of the space of basic sets for f. Terminal elements of this collection exist and h{B) = B\ for any such terminal element. Proof: By Proposition 34, h maps Cf to Cg and so all of the points of h(B) are Cg fl Cg-1 equivalent. So they are all contained in a single, clearly unique, basic set. Thus, the continuous map h : \Cf\ —► \Cg\ factors through the quotient map associated with the closed equivalence relations CfnCf"1 and CgC\Cg~l. By definition of the quotient topology the induced map is continuous. Since h maps Cf to Cg, two / basic sets which are Cf related map to g basic sets which are Cg related. Now assume that h is a surjective semi-conjugacy from / to g. We cannot apply Lemma 39 directly since h need not be in semi-conjugacy of Cf with Cg (we are not yet assuming h is open). We adapt its proof defining A = h~1{Bi) where B\ is a g basic set. As h is surjective, A is a nonempty compact set. By Exercise 38(a) h restricts to a semi-conjugacy HA from f& to <7Ba. By Corollary 32, <7£j is chain transitive and so by Proposition 30, Dom(<7Ej) = B\. From this we see that Dom^/U) = A. For x\ £ A implies h(x\) = yi € Bi and there exists y2 G Bx fl#(yi). Lifting we get x2 G f(x\) with h(x2) = t/2- As x2 G h~1(y2) C A we have x2 G j U ^ i ) - As in Lemma 39, Dom((/ / 4) n ) = A for all positive integers n and so by Lemma 6 l/^l ^ 0. Thus, A contains at least one basic set for / ^ . This }A basic set is contained in a unique / basic set B (in fact equality holds) and h(B) C B\. Now suppose that h is open so that h is a semi-conjugacy from Cf to Cg by Proposition 37. Because h is surjective {B : h{B) C Bi) is nonempty by
40
Dynamical Systems:
The Topological
Foundations
the above results. It is the preimage of the point B\ under the map induced by h on basic sets. So this is a compact family of basic sets. Zorn's Lemma applies to any closed partial order on a compact space and so terminal elements exist for this family. Let B be such a terminal element. This means h(B) C Bx and if xx E B, yx = h{xx), and x2 E Cf(xt) H \Cf\ such that the basic set of ,r2 maps to Bx (i.e. h(x2) E Bx), then the basic set of .T2 is £ , (i.e. x2 E B). Using this property we prove that h maps B onto B\, Begin with xx E B and yx = h(xx) E Bi, and let y2 be any point of Bx. Because Bx is a g basic set containing yx and y 2 , we have y2 E Cg(yx). Because h is a semi-conjugacy from Cf to Cg we can apply Lemma 39 to lift y2 to x2 E | C / | f l C / ( i i ) such that /i(rr2) = t/2 £ Bi. By the terminal property of B, x2 E B. So h maps 5 onto f?i. □ L e m m a 41 Assume h : X —> F maps tf/ie closed relation f to the closed relation g. (a) If Ux is a subset of Y inward for g, then h~l(Ux) is a subset of X inward for f with ufth-HUi)]
C h-\Log[lh)).
(58)
Furthermore, ifh is a semi-conjugacy from f~l to g~l (i.e. hof-1 = g~loh) then equality holds in (58). (b) Assume h is an open semi-conjugacy from f to g. If U is a subset of X inward for f then h(U) is a subset ofY inward for g with h(uf[U}) = ug[h(U)}.
(59)
Proof: (a) gr(^i) C Int Ux implies / o hrl{Ui) C h'1 o g(Ux) C /? -1 (Int U\) C Int h~l{U\) because by Proposition 34, h maps f~l to gn(Vi)) = hr\nngn(U{)) = h'\uglUi])% prov ing (58). Equality holds when ho f~l = g~l o h and so by inversion and induction fn o h'1 = h~l o gn, n = 1,2,... (b) f(U) C Int U implies, when h is an open semi-conjugacy, goh(U) = hof{U) C /?(Int CO C Int h{U). Hence, h{U) is inward for g. Furthermore,
h(uf[U]) = h(nnfn(U)) = nn(h 0 fn)(U) = nn(gn 0 h(U)) = ug[h(U)] (cf.
Exercise 5). Thus (59) holds.
D
Maps Between Dynamical Systems
41
P r o p o s i t i o n 42 Let f and g be closed relations on X and Y, respectively. Assume h : X —> Y maps f to g. (a) If A\, R\ is an attractor-repellor pair for g in Y then there exists a unique attractor-repellor pair A, R for f in X such that h(A) C Ai and h{R) C R\. The traces satisfy:
An\Cf\ = r'uonic/l (60)
Rn\Cf\ = h-1^) n \Cf\. (b) If h is an open semi-conjugacy from f to g and A is an attractor for f in X then h{A) is an attractor for g in Y. The trace satisfies: h(An\Cf\)
= h(A)n\Cg\.
(61)
Proof: (a) By Lemma 19 there is an inward set U\ for g such that A1 = u>g[Ui] and A1 H\Cg\ = U\ H\Cg\. Y - Int U\ = U\ is an inward set for g~l and R\ = uj(g_1 )[Ui] is the dual repellor for A\, see Proposition 23. Because h maps / to g and f~l to ^f-1 Lemma41(a) implies U = /i -1 (?7i) and U = h~l(m ) are inward sets for / and f"1 respectively. Let A = tof[U] and R = uf(f~l)[U], attractors for / and / _ 1 respectively by Proposition 20(b). By (58), we have h(A) C i i and h{R) C Rv If B is an / basic set then h(B) C B\ for a unique g basic set B\. If B\ C A\ then B C h~\Bx) C U and s o ^ C ^ f l \Cf\ = A n \Cf\. Otherwise, Bx C i?i and so Bx C U fl \Cf\ = R n \Cf\. Thus, (60) follows and A, R is an attractorrepellor pair for / because (A U R) D \Cf\ = \Cf\ (see Proposition 23). On the other hand, if A, R is an attractor-repellor pair for / with h(A) C A\ and h(R) C R\ then since h(B) is contained in A\ or Rx for any basic set B, (60) holds with A, R replaced by A, R. Hence, A = A, R = R because attractors are determined by their traces. (b) If U is inward for / with uf[U] = A then by Lemma 41(b), h(U) is inward with associated attractor ujg[h(U)] = Ax satisfying h(A) = Ax by (59). By (56) we clearly have h(A n \Cf\) C h(A) fl \Cg\. If y = fcfai) with .ri 6 A and y G \Cg\ then because h is a semi-conjugacy of Cf with Cg by Proposition 37, we can apply Lemma 39 with y2 = yx = y to find •^2 € \Cf\ C\Cf(xi) such that h{x2) = V2 = V- Since A is an attractor it is Cf invariant. So xt € A implies x2 G A. Thus, y 6 /i(A fl |C/|). D
42
Dynamical Systems:
The Topological
Foundations
Exercise 43 (a) Let h : f -> g by the map of Exercise 38(h). Prove that Y is the single basic set for g, i.e. g is chain transitive. Prove that {0}, {1} are an attractor- repellor pair for f in X and are the two basic sets for f. Observe that {e} = {h{\)} = {h{0)} is neither an attractor, a repellor nor a basic set for g. Observe that {e} = h{\Cf\) is a proper subset of \Cg\ = Y. (b) Let f be the homeomorphism of the unit square defined in Exercise 28. Let g be the identity map on the unit interval Y. Prove that h : X —> Y, projection on the first coordinate, is an open surjection mapping f to g and so is an open semi-conjugacy from f to g. Prove that Y is the single basic set for g. Observe that the f basic sets {(x, | ) } for x £ C do not map onto basic sets for g. (c) Assume h maps the closed relation f on X to the closed relation g on Y and that L\ : Y —► R is a Lyapunov function for g. Prove that L — L\ o h is a Lyapunov function for f with
\L\ c h-WLtl). Prove that if h is a semi-conjugacy equality holds in (62).
of f with g and of f~l
(62) with g~l then D
Bibliography In the following short list of related works, Conley's CBMS lectures [3] described chain recurrence, its relation to attractor theory and applied these ideas to a variety of topics. In a classic paper, reprinted in [6], Smale intro duced basic sets for a special class of smooth dynamical systems. Shub's book [5] develops this smooth theory using many of the topological tools we have described above. The relation between smooth and topological dynamics is also elaborated in [2], the first volume on dynamical systems in the Russian Encyclopedia of Mathematical Sciences. Finally, the study of permanence in [4] applies attractor theory to biology. 1. E. Akin, T h e General Topology of D y n a m i c a l S y s t e m s , Grad uate Studies in Mathematics v. 1 (American Mathematical Society, Provi dence, 1993) ( = GTDS).
Bibliography
43
2. D. V. Anosov and V. I. Arnold (eds.), Dynamical S y s t e m s I, En cyclopedia of Mathematical Sciences v. 1 (Springer-Verlag, Berlin, 1988). 3. C. Conley, Isolated Invariant Sets and t h e Morse Index, CBMS conference series N. 38 (American Mathematical Society, Providence, 1978). 4. J. Hofbauer and K. Sigmund, T h e T h e o r y of Evolution and D y n a m i c a l S y s t e m s , London Mathematical Society Student Text N. 7 (Cambridge University Press, Cambridge, 1988). 5. M. Shub, Global Stability of Dynamical S y s t e m s , (SpringerVerlag, Berlin, 1987). 6. S. Smale, T h e M a t h e m a t i c s of Time, (Springer-Verlag, Berlin, 1980).
Integral Manifolds for Caratheodory Type Differential Equations in Banach Spaces Bernd Aulbach h Thomas Wanner Department of Mathematics, University of Augsburg D-86135 Augsburg, Germany
Abstract. This lecture is designed to meet two seemingly contrary purposes. On one hand it is believed to enable a novice to approach the theory of invariant and integral manifolds through a completely selfcontained presentation, and on the other hand it is thought that even the experts may gain some new insight into the theory of integral manifolds, mainly due to a new approach allowing a generalization of the local invariant manifold theory to nonautonomous dif ferential equations x = f(t,x) in Banach spaces with possibly discontinuous t-dependence. More detailed information is given in Section 1.
1
Prologue
This report is addressed to a fundamental problem in the theory of ordinary differ ential equations which in its simplest form reads as follows. Consider an autonomous system of differential equations of the form x = Ax + /(x) where A is a linear operator and / a nonlinear mapping with /(0) = 0. Under the assumption that some decomposition of the x-space into subspaces is known to be invariant with respect to the linear system x = Ax the question arises if there exists a related decomposition of the phase space which is invariant with respect to the given nonlinear system. Since the times of Poincare and Lyapunov this fundamental question of the qualitative theory of differential equa tions has gained much attention and — at least in the context of finite-dimensional ordinary differential equations — the terminal answers have been given in the local theory of invariant manifolds outlined by the following key words: stable and unstable manifolds, center, center-stable and center-unstable manifolds, reduction principle, 45
Bernd Aulb&ch k
46
Thomas Wanner
linearization and decoupling (cf. Grobman [10, 11], Hartman [12, 13], Kelley [17], Pliss [22], Sositaisvili [23]). In this article we aim at the development of a generalization of the local theory of invariant manifolds to nonautonomous differential equations of the form
x = A{t)x + f(t,x) where x lies in some Banach space and t enters the equation in a measurable (i.e. possibly discontinuous) fashion. As a matter of fact, it turns out that in connection with a possibly infinite-dimensional x-space one has to invoke to a stronger concept of measurability as the usual one. The reason for choosing this general setting (and therefore having to deal with some extra technicalities) is the perspective of broad ening the range of applications to a large extent such as e.g. in the stochastic theory of dynamical systems and in control theory. Most texts on ordinary differential equations in Banach spaces consider only equa tions with continuous ^-dependence (cf. Amann [1], Deimling [8], Dieudonne [9]). In the general infinite-dimensional context, however, there are only few results on mea surable t-dependence and those concern mostly linear equations (cf. Daleckii & Krein [7]). Since we do not know of any systematic treatment of nonlinear equations in this general framework, in this paper we state and prove all our results in full detail. Therefore this text is quite lengthy, even though we cannot present the complete theory, that is to say, that we present only the fundamentals but not the various applications. More to this subject will be said in the epilogue, the last section of this lecture. At this point we want to emphasize that this article is not only written for those who are familiar (or want to get acquainted) with the use of measurability in the context of infinite-dimensional differential equations. Those readers who are not familiar with (or are not interested in, or not willing to learn something about) this general concept may regard all of the functions encountered as continuous and/or may restrict the view to finite dimensions. Even then this paper provides a new and interesting approach to the local theory of invariant manifolds and its generalization to nonautonomous systems. The organization of this article is as follows: • Section 2 contains the basic definitions and results on nonautonomous differen tial equations in Banach spaces with measurable t-dependence. First, we prove a global existence and uniqueness theorem for the class of equations being con sidered in this paper. This theorem also provides the continuous dependence of solutions on initial values and parameters. Furthermore, linear differential equa tions, evolution operators, the variation of constants formula and an appropriate version of GronwalTs Lemma will be discussed. • In Section 3 we introduce the notion of quasibounded solutions which turns out to be essential for our approach. We prove several results on the existence and
1. Prologue
47
uniqueness of quasibounded solutions of linear and nonlinear differential equa tions. • Having these results at hand, we present in Section 4 our main theorem on the existence of integral manifolds. In view of later applications (which are not con tained in this lecture, however) this result will be proved for parameter dependent differential equations. • Section 5 contains existence theorems for certain families, so-called hierarchies of integral manifolds. • The existence of integral manifolds generalizing the stable, center-stable, center, center-unstable and unstable manifolds to our general setting is established in Section 6. • Finally, in Section 7 we demonstrate by means of a counterexample that a sixth integral manifold which canonically appears in linear systems does not exist in general for nonlinear systems. • In order to keep the presentation of this lecture as selfcontained as possible, in two appendices we collect (partly with proofs) the background material on measurable functions and fixed point theorems needed for the analysis in these notes. Concluding this introductory section we briefly outline the notation and mention a few conventions which are used throughout this paper without further notice. The Banach spaces we consider may be real or complex, of course of the same type if they appear in a common context. The corresponding norm will always be denoted by || • ||. If X is a Banach space, by L(X) we mean the Banach space of bounded linear operators on X equipped with the operator norm ||A|| := sup{||Ax|| G R : x G X, \\x\\ < 1}, and GL(X) denotes the group of invertible operators in L(X). For a matrix A, the spectrum (i.e. the set of eigenvalues) is denoted by cr(A) and if A is an eigenvalue of a matrix, Re A denotes its real part. For any subset S c R b y x s ^ R — ► { O j l } we denote the characteristic function, i.e. XsM = 1 if £ G S and Xs(0 = 0 if t e R \ 5 . Furthermore, we set R j := {x G R : x > 0} and R+ := {x G R : x > 0}. Unless otherwise stated, intervals may be of any type, bounded or unbounded, with or without endpoints. What measurability is concerned, in statements containing the phrase almost all we usually omit to indicate that the respective exceptional set is of measure zero in the Lebesgue sense. Instead of the derivative ^ we write x and in differential equations x = f(t, x) we often interpret — as in the theory of dynamical systems — x as state and t as time. Finally, for autonomous, i.e. time invariant equations x = f(x) we adopt the term invariant manifold in the usual sense as an invariant subset of the phase space with a manifold structure. 1 The corresponding generalization to nonautonomous equations (i.e. subsets of the extended phase space made up of integral curves) will be called integral manifolds. 1
In fact, the manifolds appearing in this paper are always graphs of suitable functions.
Bernd Aulbach & Thomas Wanner
48
2
Basic Definitions and Results
In this section we present the fundamental facts of the theory of ordinary differential equations of the form x = f(t, x) where x is an element of some Banach space and the dependence of the right-hand side on t is only measurable. It turns out that in this general setting one has to use the concept of strong measurability rather than the usual measurability introduced in standard calculus. For the sake of completeness we collect the basic facts concerning strong measurability in Appendix A. In the present section we use those results freely without further mention. For the theory of differential equations with measurable i-dependence the so-called Caratheodory property of the right-hand side turns out to be essential. In our setting this property reads as follows. Definition 2.1 Let I be a nonempty interval and X a Banach space. A mapping f : I x X —*■ X is then said to have the Caratheodory property if it satisfies the following two conditions: (a) For every t £ I the mapping /(£, •) : X —* X is
continuous.
(b) For every x 6 X the mapping f(-,x) : I —* X is strongly measurable2 respect to the Borel a-algebras on I and X).
(with
In order to develop a solution concept for differential equations whose right-hand sides have the Caratheodory property we need the following result. L e m m a 2.2 Suppose I is a nonempty interval and X a Banach space. Furthermore, let f : I x X —> X have the Caratheodory property and let \i : I —*■ X be strongly measurable. Then also the composed mapping t H-> /ft,//(£)] from I to X is strongly measurable. P r o o f : According to the strong measurability of // there exists a sequence of simple mappings fin : / —► X, n £ N , converging to \i pointwise, i.e. M * ) = £ * » . • ' • X/n,.W -» /*(*)
as n -* oo ,
where kn € N and xnti 6 X. The I„tl,... ,In,kn axe disjoint measurable sets whose union is / . Then the Definition 2.1 ^6^ and the relation
readily imply that the mappings *•-+/(*,//„(*)), 2
!->*,
n€N
For the definition and basic properties of strong measurability we refer to Appendix A.
2.
Basic Definitions and Results
49
are strongly measurable. Because of Definition 2.1 (a) the corresponding sequence of mappings converges pointwise to the mapping / ( • , /x(-)). Hence the latter mapping is strongly measurable. O W i t h Lemma 2.2 at hand we are now able to introduce the type of differential equations (with the corresponding solution concept) we are going to study in this paper. Definition 2.3 Given an interval J, a Banach space X and a topological space V, let f : I X X x V —> X be a mapping such that for every choice ofp£V the mapping / ( • , -,p) : I x X —> X has the Caratheodory property. Then an equation of the form
x = f{t,x,p)
(1)
is called a nonautonomous (parameter dependent) differential equation and a contin uous mapping X : J —► X defined on some nonempty interval J C I is called a solution of (1) (to the parameter value p), if the mapping / ( • , A(-),p) is locally integrable3 and if the identity X(t)-\(S)
=
Jj{T,\{T),p)dT
is valid for all t,s € J. If in addition the mapping X satisfies the condition A(T 0 ) = £0 for some TQ G J and £o € X, then X is said to satisfies the initial condition X{T0)
= £o
(2)
or we say that X solves the initial value problem (1), (2). As in the theory of ordinary differential equations in RN it is possible to prove local existence and uniqueness results for nonautonomous differential equations in arbitrary Banach spaces, provided the right-hand side / satisfies certain conditions (see Amann [1, Ch. 11,7], Dieudonne [9, Ch. X,4], or Zeidler [28, Ch. 3,3]). However, the equations occuring in these notes are of quite a particular structure which allows us to prove stronger results on existence, uniqueness and continuous dependence of solutions on initial values and parameters. The corresponding results are contained in the following theorem. T h e o r e m 2.4 Given an interval I, a Banach space X and a topological space V, let f : I X X X V -* X be such that for any p G V the mapping /(•*,-, p) has the 3
In this context we have to use the notion of Bochner integral which is the straightforward generalization of the Lebesgue integral to Banach space valued strongly measurable mappings. For more details we refer to Appendix A or to the books of Cohn [5, Appendix E] or Craven [6, Section 7.4]. Note also that a continuous mapping A is strongly measurable, so Lemma 2.2 furnishes the strong measurability of the mapping /(•, X(-),p) appearing in this definition.
Bernd Aulbach & Thomas Wanner
50
Caratheodory property. Furthermore let £,£0 : I —► RJ be locally integrable functions such that the two estimates
\\f(t,xi,p)-f(t,xi,p)\\ < e(t)||x, -si||,
(3) (4)
||/(«,0,p)|| < to{t)
are valid for almost all t £ I and for all x\,x2 € X and p € V. Finally, suppose that the mapping / ( T , Z , - ) is continuous for any t £ I and x € X. Then for any (To,£o,Po) € / x X xV the differential equation
x =
f{t,x,p)
(5)
has a unique solution A(-; 7b,£o>Po) : I —* X to the parameter value po satisfying the initial condition x(r 0 ) = £o; and the so-defined mapping \:IxIxXxV—>X is continuous. Proof: Since every interval is the union of a nested, increasing sequence of compact intervals we only have to consider the special case of a compact interval I = [a,b]. Let B denote the Banach space of continuous mappings ft : I —> X with norm \\n\\\ := max{||/i(t)|| : t € / } , and define the mapping T: BxIxXxV —> B by T{lJ.,To,Zo,po){t) := & + / f(s,n(s),pQ)ds
for all t € J ,
•'7X)
where the existence of the integral is an immediate consequence of Lemma 2.2 and the estimate ||/(a,fiW,j*)|| < \\f(s,n(s),po)-f(s,0,po)\\ + \\f(syOypo)\\ < £(s)-\\\p\\\ + £o(s) for almost all 5 G / , together with the required local integrability of t and £0. The proof of Theorem 2.4 is divided into three parts. (I) We begin by inductively verifying the estimate \\Tn(fi,ro^o,Po)(t)-Tn(u,T0^0,po)(t)\\
< ±1
fi(s)ds
— v\
(6)
for all //, v G # , r, T0 € / , £o € X, p0 6 V and n € N, where the iterated operator Tn : B x I x X XV -> B is denned as in relation (101) of Appendix B. For n = 1 assumption (3) provides the estimate \\T(fi,T0^o,Po)(t)-T(u,rQ^o,Po){t)\\ If I
\\f{s,Ks),Po)-f{s,v{s),po)\\ds\
< I
JTQ
\fte(s)\\fi(s)-u(s)\\ds I
JTQ
<
<
If'iWds I
JTQ
— V
2. Basic Definitions and Results
51
Now suppose the claimed estimate (6) has been verified for some n € N. Then, using the previous proof for the case n = 1, for n + 1 we get \\Tn+1(^r0^Po)(t)
- Tn+1(u,T0,to,Po)(t)
|| =
||r(r"(/x,ro,eo,Po),ro,6,Po)W-T(r>,r0^o,Po),ro,eo,Po)WII r^)||rn(Ai,ro,eo,Po)W-rtt(^ro,eo,Po)W||d5
<
<
ds
ill/'-*'
Til I ^Tt)
JTQ
Together with the identity (to be verified subsequently) n+l
1
ds
(n + 1)!
ds
(7)
JTQ
this implies the validity of the estimate (6) for n + 1 instead of n. Thus, in order to complete the proof of part (I) we only have to verify the identity (7). This, however, is obvious when noticing that both sides of (7) are absolutely continuous with respect to t, vanish at t = TQ and have the common derivative sgn(t - r 0 ) • t(t) • - : I / £(s) ds n\ I JTO
for almost all t € I (cf. Craven [6, Proposition 5.4.5]). (II) In this second part of the proof we show that the mapping T is continuous. According to (6) the estimate \\\T(lL,T,Z,p)-T{v,T,Z,P)\\\
fhl(s)ds.\\\li-v\\\
< Ja
holds for all //, v £ B and (r, £,p) £ I x X x V, and therefore (cf. Lemma B.4, Appendix B) it suffices to prove the continuity of the mapping T(fio, -,-,•) for all Ho 6 B. This, however, follows from the fact that for any choice of t G / = [a, b] and r ( T I £ ? P ) J ( o>£o>Po) £.1 x X xV the following is true: ||r(Mo,r,4 I p)(*)-T(fio 1 7b,6i l Fo)(t)|| | | f + / f(s,no(s),p)ds-ZoJT
=
I f(s,fjL0(s)ypo)ds\\
<
JTQ
IK-&II + I /r|l/(5,M5),po)H^| + | / ||/(* > MOW,P)-/(*,MOW,FB)||A < I JTQ
ll£-£o||+
/ \\f(s,Ho(s),Po)\\ds I «/TO
I
I ./r
+ /
||/(s,// 0 (s),p)-/(s,//o(s),po)||
•'a
Due to Lebesgue's dominated convergence theorem (cf. Craven [6, Proposition 4.4.4])4 the integrals in the last relation converge to 0 as r —> To or p —*■ PQ. This completes the proof of part (II). 4
Because of (3) and (4) the integrands are dominated by the integrable mappings £(•)) |/*o(-) 11+4>(") and 2£(-)||/io(-)ll + 24>(-)> respectively.
Bernd Aulbach & Thomzs Wanner
52
(III) In order to conclude the proof of Theorem 2.4 we choose an n G N such that
For all //, v € B and (r 0 , £0,Po) € / x X x 7> the estimate (6) implies then
<1
Since T is continuous we may apply Theorem B.3 (see Appendix B). Thus, for every (TO, fo,Po) € i" x X x P there exists a unique fixed point A(-; r 0 , £o,Po) of the mapping ^(•>ro,^o,Po) : B —> B, and the resulting mapping (TO,£O,PO) I-> A ( - ; T 0 , £ 0 , P O )
,
IxXxV
-> B
is continuous. Then, because of the estimate I|A(*;T,£,/>)-A(*O;T0,£O,PO)||
<
l|A(*;r,£,p) - A(<;r0,^o,Po)|| + 11 A(*;r0, &>,#>) - A(i0;r0,^o,Po) II < A ( - ; T , ^ , P ) - A(-; T0,£o,po) HI + || A(t;r 0 ,&>,#>)-A(t 0 ; r 0 ,^o,po)|I , also the mapping (*,To,£o,Po) •-»
A(£;T 0 ,£O,PO)
,
/ x / x A T x P -> A'
is continuous. Finally, by construction of T it is obvious that a mapping /x € B is a fixed point of T(-,T0, £O,PO) if and only if fi is a solution of the differential equation (5) to the parameter value po satisfying H(TQ) = £o- This completes the proof. O The mapping \:IxIxXxV—*X provided by Theorem 2.4 is called general solution or cocycle of the differential equation (5). For all r, ti,t2 € / , £ € X and p €V this mapping satisfies the identity A(*2;r,£,p) = A(t 2 ;ii,A(ii;r,£,j»),j>) ,
(8)
which we call the cocycle property. This identity is valid since both sides of it axe solutions of (5) satisfying the initial condition x(ti) = A ^ j r , £ , p ) . The cocycle property (8), which obviously generalizes the well known group property for flows of autonomous differential equations, will prove to be crucial for the analysis in these notes. Let us now turn our attention to Gronwall's Lemma which is known to be fun damental for estimating the growth of solutions of differential equations. Since we study differential equations whose right-hand sides are only measurable with respect to t we have to use the following slightly generalized form of this lemma.
2. Basic Definitions and Results
53
Lemma 2.5 (Gronwall's Lemma) Suppose we are given a nonempty interval I, a point TQ G / and locally integrable functions u,a,b : i" —► RQ . If then the inequality u(t) < a(t)+
I
b(s)u(s)ds
(9)
is valid for all t £ I, then we get the estimate u{t) < a(t) +
/ 0(5)6(5) exp ( / b(a) da
ds
for all t € I
(10)
\ I J8
JTQ
Proof: Basically, the proof of the lemma follows the lines of the continuous case considered e.g. in Amann [1, pp. 89f ]. For the sake of completeness, however, we give a detailed proof which goes as follows. Set v{t) := fL b(s)u(s)ds for all t £ I. Then according to Craven [6, Proposition 5.4.5] the mapping v is differentiate for almost all i £ J with derivative v(t) = b(t)u(t). Furthermore, (9) furnishes for these values of t the inequality v(t) < a(t)b(t) + sgn(* - TQ)b(t)v(t) . Multiplying this estimate by the function c(t) := exp ( — / b(s) ds j = exp ( — / sgn(5 — TQ)b(s) ds) we get the inequality c(t)v(t) < a(t)b(t)c(t) for almost all t £ / , and therefore we have j ( a , ) ( t ) - a(t)b(t)c(t)
c(t)v(t)
< 0
for almost all t £ / . Integrating this inequality from r 0 to t and using the relation V(TO) = 0 we get the estimate c(t)v(t)
= j —{cvYs)ds
< I
a(s)b{s)c{s)ds
for alH £ / , and with the help of (9) we finally arrive at the desired estimate u(t)
< a(t) + sgn(t - r 0 ) • v(t) < a{t) +
sgn(t-T0)'J^a{s)b{s)^ds
= a{t) + / a(s)6(5)exp ( / b(a)da for every t £ I.
jds
O
As a first consequence of Gronwall's lemma we state and prove the following result which will be needed in the proof of our fundamental Theorem 4.1.
Bernd AuJbach k Thomas Wanner
54
Lemma 2.6 Consider the parameter dependent differential equation x =
f(t,x,p)
(11)
satisfying all the assumptions of Theorem 2.4, and let X(t; r, £,p) denote the cocycle of (11) guaranteed by this theorem. Moreover, let r 0 € / be arbitrary and let fio : V —> X be a bounded mapping, i.e. assume there is a constant M > 0 with IMiP)|| < M
for all peV
.
Then for every e > 0 there exists a 6 > 0 such that for any r E I with \T — T0\ < 6 and any p € V the estimate IWT;T0,/*O(P),P)-/*OO>)||
<
e
holds true, i.e. we get the limiting relation lim A(r;To,//o(p),p)
=
Poip)
uniformly with respect to p EV .
If in addition we assume that both functions t and IQ appearing in the assumptions of Theorem 2-4 are locally bounded, then the mapping A(- ;To,/zo(p),p) is even Lipschitz continuous and the following is true: For every bounded interval U d I there exists an L > 0 such that P(r;ro,/*o(p) } p)-A(f;r 0 ,/io(p),p)|| <
L\r-f\
for all r, f, To € U and p G V. Proof: Define /z(r,T0,p) := A(£;r0,//o(p),p)- Then the estimate
IMT,I*,J>)||
^
IMP)|| + |
r\\fM*,VhP),p)\\d*
I •'TO
<
M + I f[t(s)
||/i(*,To,rt|| + £o(s)} ds
< M + \ reQ(s)ds\
+\
r£{s)\\fi{s,T0yp)\\ds
is valid for every T,T0 € I and p £ V, and with the aid of Gronwall's Lemma 2.5 we get the inequality ||A*(T,T 0 ,P)||
< M+\ + If
[T£0(s)ds
+
[M + I j*io(8)ds\]i(a)exp
( | J*l{u)du\)do\
.
This means that for every bounded interval U C I there exists a constant C > 0 such that IIMT>ro,p)|| < C for all T , T 0 € U and p e V .
2. Basic Definitions and Results
55
This in turn, however, implies for all r, T0 € U and p € V the estimate IIM r > T o,J>)-Mp)|| <
/
ll/(5,/^(5, r 0 ,p),p)||rfs
< |rk*)lW*.»b,rtll+ioW]
<
.
Prom this estimate the first part of the lemma follows, since the right-hand side is independent of p and converges to 0 as r —> r 0 . Similarly, if both £ and £0 are locally bounded, we get rr \\KT,T0,P)-riTiT0,P)\\
<
\
\\f(s,fi(s,T0ip),p)\\ds
<
C>\
r£(s)ds\ I JT
<
+ \ fT£Q{s) ds I JT
C-sup^(s) + sup ^0(5) L
\T — T
e(EU
B€U
for all r, f, TQ £ U and p € 'P. This completes the proof of the lemma.
0
After these definitions and results on general (i.e. possibly nonlinear) nonautonomous differential equations we now take a closer look at the special class of nonautonomous linear differential equations. Definition 2.7 Consider a nonempty interval I and a Banach space X. Further more, let A : I —» L(X) and b : I —+ X be locally integrable mappings, i.e. assume that both mappings are strongly measurable and that the real-valued mappings ||A(-)|| and ||6(-)|| are locally integrable. Then the differential equation x = A(t)x + b{t)
(12)
is called an inhomogeneous nonautonomous linear differential equation. The corre sponding homogeneous nonautonomous linear differential equation reads x = A(t)x
(13)
As for the solvability of equation (12) we first note that the mapping (t,x)
\-> A{t)x + b(t),
IxX
-+ X
has the Caratheodory property, because A and b are strongly measurable and because the mapping (A,x) » Ax, L(X) xX -► X
Bernd Aulbach & Thomas Wanner
56 is even continuous. Since the relations lllA{t)Xl
+m -
[ A { t ) x 2
and
+ h m
\
< \\A(t)\\ • \\Xl - x2\\
\\A(tyO+b(t)\\
= \\b(t)\\
axe true for all i G I and xi,x2 G X, and since the functions ||^(-)ll a n ( l IIK")II a r e locally integrable, Theorem 2.4 can be applied with £(t) := ||A(t)|| and £0(t) := ||6(i)||. Thus, to every initial condition there exists exactly one solution of (12) on I. In order to gain a clearer picture of the cocycles of linear differential equations we make use of a construction generalizing the principal fundamental matrix of linear systems in RN. Definition 2.8 Given the framework of the preceding Definition 2.7, let A(f;r, £) denote the cocycle of the homogeneous equation (18). Then the mapping $(i,s) :=X(t]s,-)
:
X^X
which is defined for any t,s £ I is called the evolution operator of (13). The basic properties of the evolution operator axe described in the following lemma. L e m m a 2.9 Consider a homogeneous linear differential equation x = A(t)x
(14)
satisfying the assumptions of Definition 2.7. Then the corresponding evolution oper ator §(t,s)
:
X^X
is an element of GL(X), the group of invertible operators in L{X), and the mapping $ : / x I -+ GL{X) is continuous. Furthermore, for all i , s , r 6 I the identities *(*,*) = $(*,s) =
idx, $(t,r)o$(r,s),
•ft*)" 1 = *(M)
(15) (16)
(17)
are valid and the following estimate holds:
P M | | < exp(|jfVMII<*r).
(18)
2. Basic Definitions and Results
57
Proof: Let us consider the initial value problem X = A(t)X ,
X(s) = i d ^
(19)
on the Banach space 1>(X). Due to the continuity of the mapping {A,X)
H+ AX,
L{X)xL{X)
-»• L(X)
the mapping (t,X)
■-> A(t)X,
IxL(X)
-► L(X)
has the Caratheodory property and satisfies all assumptions of Theorem 2.4. Hence the initial value problem (19) has a uniquely determined solution $(•, s) : I —> L(X), and the induced mapping $ : I X J —» L(A') is continuous. Furthermore, for all t,s £ I and £ G # the properties of the Bochner integral (see Appendix A) imply Ht,s)Z-t
= [*{*,*)-*(*,j)]e = [ ^ A ( r ) i ( r , 3 ) d r ] e = jf
A(T)*(T,3)£<*T
.
This means that $(•, s)£ solves equation (14) subject to the initial condition a;(s) = £. An application of the uniqueness statement of Theorem 2.4 now immediately yields the relation $(£, 5) = $(tf, s) for all t, s G / , thus proving that $(£, 5) belongs to L(X) and that the mapping $ : I x I —* L(/f) is continuous. The identities (15) and (16) are immediate consequences of Definition 2.8 and the cocycle property (8), and they in turn yield the relation id^ = $(i,s)o$(s,t) = $(s,t)o$(t,s), proving the inclusion $(£, s) G GL(A') and the identity (17). In order to conclude the proof of Lemma 2.9 we now verify (18). To this end, leaving aside the trivial case t = s, wefixany t,s G / , t 7^ s, and ( G X. Then Definition 2.8 provides the identity
*(t>*)t-t
= /A(T)*(T,S)£<*T, Js
from which we get the estimate
ll*(MXll < \\i\\ + jT||A(T)|H|«(T,*)f||*With the help of Gronwall's Lemma 2.5 this finally implies
PMfll < lltll
1 + ^||A(r)||exp(|/j|AW||,fa|)dr
||f||-exp(|j['||A(T)||
Bernd Aulbzch k Thomas Wanner
58
where for the last equality we note that the absolutely continuous mapping g(r) := exp (\ J \\A(a)\\da J ,
r € [min{*,s} , max{*,$}]
is differentiable for almost all r G [min{*,s} , max{t,s}] and has the derivative
i ( r ) = -«gn(*-r)JA(T)||-«q>(| jf IMPIl*^) • =sgn(t-») This, according to Craven [6, Proposition 5.5.3], means
jfVwii«p(|jf P W I H H = »«»(*-*)-jf(->«»(*-*)-^(T))*" = - j T J ( r ) d r = sW-«(«) =
exp(|j[W)||*r|)-l.
This completes the proof of the lemma.
O
According to Definition 2.8 the cocycle of the homogeneous equation (13) is given by
M*;ro,ft) = $(i,T0)6>. A formula for the cocycle of the inhomogeneous equation (12) is given in the next theorem. Theorem 2.10 (Variation of Constants Formula) Consider the linear inhomo geneous differential equation (12) satisfying the assumptions of Definition 2.7. Then the cocycle A(i; TQ, £O) of (12) is given by the so-called variation of constants formula A(t;T0,&) = *(t,T 0 )G>+ /*«(*, T)6(T) A-
(20)
which is valid for all (t, TQ, £O) € I X I x A\ Proof: Fix any To G / and £o £ A\ Then the identity (15) implies that for t = TQ the right-hand side of (20) equals £0> so all we have to show is that the right-hand side of (20) actually solves (12). To this end we introduce the abbreviation fi(t) := *(t,T 0 )6)+ / $(r,r)6(r)dr
for all t € I,
and note that the integral in this expression exists because the functions ||A(-)|| and ||6(-)|| are locally integrable and the integrand satisfies the estimate ||»(t,T)Kr)|| < exp ( | jT* ||A(cr)|| Ar ) . ||6(x)||,
2. Basic Definitions and Results
59
which is a consequence of (18)5. First of all, for every t € / we have / A(r)pL(r)dr JTQ
= fA(r)$(r,
T0)£O <*r +
f A{r) f'
JTO
JTQ
= $(t,T0)to-to
^{r,<j)b{a)dadr
JTQ
+ I* fTA{T)^(r,a)b{a)dadT
.
(21)
Because of | | A ( r ) $ ( r , a ) 6 W | | < ||A(r)|| • exp ( f
\\A(u)\\du ) ■ ||6(<
and the assumed local integrability of ||A(-)|| and ||&(-)|| w e m a Y apply Fubini's the orem (cf. Craven [6, Remark 7.4.13]) to the repeated integral in (21). This implies fA(r)ii(T)dT
fTA(r)^(r,a)b(a)dadr
= $(*,r 0 )£o - £o + / ' = $(t,T0)£o-£o+ /
rA(r)$(r,<7)6(a)drda
JTQ JIT
= $(t, r0)to - to + f = v(t)-to-
[*(*, v)b(a) - $(
fb{a)da.
In other words, for arbitrary t € I we have the relation /»(*)-& = £ [ A ( r ) M ( r ) + 6(r)]dr, which readily implies P(t)-ti')
= j'[A(T)p(T)
+ b(TJ\dT
for all t,s € / . Thus \i solves the inhomogeneous linear equation (12).
O
As in the elementary theory of differential equations, also in our general setting autonomous differential equations constitute a particularly important class of equa tions. Therefore we close this section with some remarks on autonomous equations. Let X be a Banach space and / : X —> X a continuous mapping. A differential equation of the form x = 5
f(x)
(22)
The strong measurability of the mapping (t, r) ■-»■ $(*, r)6(r), I x I —* X follows readily from the assumed strong measurability of the mapping 6 and the continuity of $ : I x I — ► L(X).
Bernd Aulbach & Thomas Wanner
60
is then called an autonomous differential equation. If in addition / satisfies a global Lipschitz condition on X then all the assumptions of Theorem 2.4 are satisfied when we formally set I := R. Then for each fixed £0 € X the family of initial value problems x - f(x) ,
x(r 0 ) = fo , T 0 6 l
has a corresponding family of solutions on R which differ only by translation in time. For this reason, we may set without loss of generality r 0 := 0 in the cocycle of (22), and define for alH € R p(*iM :=A(*jO f fi,). (23) The so-defined mapping y> : R x X —* X is called the general solution or flow of the autonomous differential equation (22). For a pictorial representation of the solutions of autonomous equations it therefore suffices to draw, for given £o G X, the orbit or the trajectory through £o, i.e. the subset {ip{t,£o) € X : t £ R} of the phase space X. It follows immediately from the uniqueness of solutions and the above-mentioned "translation in time" that two orbits are either identical or disjoint.
3
Quasibounded Solutions
For the theory to come it is essential to study a special class of solutions of nonautonomous differential equations which are characterized by their asymptotic growth rates, so-called quasibounded solutions. In order to motivate the notion of quasiboundedness we consider finite-dimensional autonomous homogeneous linear differential equations x = Ax\
(24)
where A denotes an M x M-matrix over K = R or K = C. The corresponding evolution operator $(i,s) is then a mapping taking its values in the space L(K M ) which will be identified with the space KMxM of all M x M-matrices over K in the canonical way. For the explicit form of this evolution matrix or principal fundamental matrix we refer e.g. to the book of Hirsch & Smale [16]. With the aid of the matrix exponential function the evolution matrix $(£, s) has the form eA^~^ and therefore the cocycle of (24) reads A(*;T,{) =
e^"^.
Furthermore, for any real number a > max{ReA : A € cr(A)} , where a(A) C C denotes the spectrum of the matrix A and ReA the real part of the eigenvalue A, there is some constant K > 1 such that eMt-r)\\
<
Kea(t-r)
for all * > T .
(25)
3. Quasibounded Solutions
61
Hence, for any r £ R and £ € K M we have ||A(t;r,OH < i n i £ | | e a ( t - r )
for all r > r .
So for a given a 6 R all solutions of (24) have the same exponential decay rate (depending on a) as t tends to infinity — provided the real parts of the eigenvalues of A satisfy certain conditions. This idea of quasiboundedness is to be generalized in the following definition, where we call an interval unbounded to the left, if it is of the form (—oo,r) or (—oo,r] for some r G E U o o . Intervals unbounded to the right are defined analogously. Definition 3.1 Suppose we are given an n 6 R, a Banach space X', an interval I and a mapping g : I —> X. Then (a) g is called n+-quasibounded or 77-quasibounded as t —* oo, if I is unbounded to the right and the inequality sup{||^(t)||e _,7t : t>r]
< oo
holds for some r £ I. In this case we define
llflllJ„:=sup{|| 9 (*)||e-":i>T}. (b) g is called ^"-quasibounded or 77-quasibounded as t —> — 00, if I is unbounded to the left and the inequality
sup{||<7(t)||e-* : t < T} < 00 holds for some T £ I. In this case we define
llflll;,, :=mp{||p(t)||e-*: t < r } . (c) g is called 7/±-quasibounded; if I equals R and g satisfies sviV {\\9{t)\\e~nt : t € K } < 0 0 . In this case we define ||*|£ := sup{|| X is an arbitrary mapping.
62
Bernd Aulbach & Thomas Wanner
Figure 1: Quasibounded mappings (a) g is 7/±-quasibounded if and only if for all t € R the estimate
\W)\\ < Ce* holds true for some constant C > 0 (cf. Figure 1(a)). (b) For 77 = 0 the notion of 7/±-quasiboundedness coincides with the ordinary boundedness of ^-valued mappings. Furthermore, g is 0 + -quasibounded if and only if for some r £ R the restriction <7|[T,oo) is bounded. 0"-quasiboundedness can be characterized accordingly (cf. Figure 1(b)). (c) For 77 < 0 every 77+-quasibounded mapping g converges exponentially to 0 as t tends to 00 (cf. Figure 1(c)). (d) For 77 > 0 every 7/~-quasibounded mapping g converges exponentially to 0 as t tends to —00 (cf. Figure 1(d)). (e) The zero mapping is 7/±-quasibounded for every 77 6 R (cf. Figure 1(e)). (f) If g is 7/+-quasibounded for some 77 6 R, then g is 7 + -quasibounded for every 7 > 77 (cf. Figure 1(f)).
3. Quasibounded Solutions
63
(g) If g is rj -quasibounded for some 77 € R, then g is 7 -quasibounded for every 7?. According to the previous considerations quasibounded mappings occur quite natu rally as solutions of finite-dimensional linear systems with constant coefficients. Fur thermore, under certain assumptions such a system has exactly one quasibounded solution. For example, exactly one solution of the 1-dimensional equation x = —x is 0~-quasibounded, namely the trivial one. But what about nonlinear and/or nonautonomous differential equations? What are the conditions for such an equation to have exactly one quasibounded solution, and when are all solutions quasibounded? The answers to these questions constitute the key to the construction of integral manifolds in the next section. In the present section we state and prove the funda mental results on quasibounded solutions. Essentially they axe taken from Aulbach [3], Hilger [15] and Wanner [24, 25] (cf. [26, 27] for a published version of [25]). The first lemma deals with (not necessarily linear) perturbations of linear differ ential equations. We derive conditions under which such an equation has exactly one 7~-quasibounded solution for certain values of 7. More specifically, the unperturbed linear equation essentially has to fulfil the above "eigenvalue condition". However, for general nonautonomous differential equations the notion of eigenvalue is no longer available. For this reason, in the general case we assume that there exists an es timate of the form (25) for the evolution operator, which in the finite-dimensional autonomous case is a consequence of the presupposed eigenvalue condition. Lemma 3.2 Consider the parameter dependent differential equation
x = A(t)x + f(t,x,p) + f0{t,p)
(26)
where the interval I is unbounded to the left, X is a Banach space, V a topological space, and A : I —> L(X), f:IxXxV^>X and fo:IxV-*X are mappings satisfying the following conditions: • A is locally integrable, i.e. A is strongly measurable and the real-valued mapping ||A(-)j| is locally integrable, • f {'■>'■)?) has the Caratheodory property for every p G.V, • /(£, x, •) is continuous for every (t,x) € I X X, • fo(',p) is locally integrable for every p G V, • /o(*, •) is continuous for every t € I. For the evolution operator $(<, s) of the linear equation x = A(t)x we assume that for all t,8 € I, xtx € X and p ^V the following conditions are fulfilled: | | $ ( i , 5 ) | | < Ke*^
if t>s,
WAP) = 0, \\f(t,x,p)-f(t,x,p)\\ < £ | | s - i | | ,
(27) (28) (29)
Bernd Auibaci k Thomas Wanner
64
with constants a (E K, K > 1 and L > 0. Then /or any 7 > a + if L and any r € I the following is true: If the mapping fo('iP) *s 7~-quasibounded for every p €V with ||/o(-,p)||;, 7 < M
for some M > 0 ,
(30)
then the differential equation (26) has exactly one 7"-quasibounded solution (JL{-,P), and this solution satisfies IK-,P)||;.,
< - _ *_ KL ll/o(-.p)ii;,, ■
(3i)
Moreover, the mapping \i : I xV —> X is continuous. If in the particular case I = K the mapping fo(-,p) is even ^-quasibounded for some p € V, then so is /w(-,p) and we get the estimate
ll/»Ml£ < - _ *_ KL IIAMIfc ■
(32)
In the proof of our main theorem in the next section we apply Lemma 3.2 several times in the form of the following remark. R e m a r k 3.3 Lemma 8.2 can also be applied to equations of the form x = A(t)x-\- F(t,x,p) provided the mapping F:IxXxV—>X • F(-,',p)
,
has the following properties:
has the Caratheodory property,
• F(t, x, -) is continuous, • F(-,0,p) is locally integrable, • F(t,x, ■) is continuous. Furthermore, the estimates \\F{t,x,p)-F(t,x7p)\\
< L\\x-x\\
and
\\F(;0,p)\\^
< M
are required to hold for allt e I, x, x G X and p G V. In order to justify all this, we define f(t,x,p)
:= F{t,x,p)-F(t,0,p),
f0(t,p)
and apply Theorem 8.2 to the equation x = A(i) + f(t,x,p)
:=
F(t,0,p)
+ f0(t,p).
D
3.
Quasibounded Solutions
65
Proof of Lemma 3.2: Because of (29) and the assumed local integrability of fo(-,p) equation (26) satisfies all the assumptions of Theorem 2.4. Therefore, all solutions exist throughout I and they are determined uniquely. Let A(t;r, £,p) denote the cocycle of (26). The proof proceeds in five steps. In the first three steps we consider the special case I = (—oo,r], in the fourth step we prove the lemma for an arbitrary interval I that is unbounded to the left, and in the final step we verify the assertion associated with the claimed estimate (32). (I) To begin with, we consider the particular case where I = (—oo,r], /o(*,p) = 0 on I xV, and L = 0, i.e. /(£, x,p) = 0 on I x X x V. Let \i : I —> X be an arbitrary 7~-quasibounded solution of x - A(t)x (33) and let r 0 € / be arbitrarily given. Then Definition 2.8, Lemma 2.9 and (27) yield the relation IIMMH
= ||#(To,i)*(t,ToMro)|| =
< ||*(To,*)H-|Mt)ll <
<
||*(TO,*M*)II
Ke^-^Mm*-*
Kf»e
for all t < r 0 . According to the assumptions of part (I) we have 7 > a + KL = a, and so the right-hand side of the above estimate converges to 0 as t —> —00, i.e. we have (I(TO) — 0 for any To G / . Hence, \i — 0 is the unique 7"-quasibounded solution of (33). Furthermore, the estimate (31) is trivially satisfied. (II) Now we suppose I = (—00, r], /o as assumed in the Lemma and L = 0, i.e. f(t,x,p) = 0onIxXxV. The uniqueness assertion follows immediately from step (I), since the difference of two supposedly different 7~-quasibounded solutions of x = A(t)x + f0(t,p)
(34)
to the parameter value p 6 V would yield a nontrivial 7"-quasibounded solution of (33). As for the existence of a 7"-quasibounded solution of (34) we define the function \i : I x V -> X by fjt(t,p) := /
$(t1s)f0(sip)ds
and note that the integral appearing in this definition indeed exists. This is because of 7 > a + KL = a and ||*(*,«Wb(«,rill < l l * M I | e 7 W , P ) l l ; „ <
KMeate^°
for all s < t < T and p € V. In order to prove the continuity of the mapping // let t0 £ I and po £ V be arbitrarily fixed and consider the alternative representation ti*>P) = f j—00
X(-oo,t](s)*(t,s)fo(s,p)d3
,
(35)
Bernd Auibach & Thomas Wanner
66
where X(-oo,t] ' R —► {0,1} denotes the characteristic function of (—oo,t]. Conse quently, as (t,p) converges to (to, j?o), the integrand in (35) converges to X(-oo,t0](5 W o , s)/ 0 (s,po) for almost all s G / , to wit, at least for all s ^ to. Furthermore, the estimate ||X(-OMM*(M)/O(*,P)||
< Ke°< • ||/o(-,p)||;„ • < KMeat
tb-»
• e(7"a)'
holds true for all i, s € / . Because of 7 > a we may now apply Lebesgue's domi nated convergence theorem (cf. Craven [6, Proposition 4.4.4]) to get the convergence fj~(t,p) —*■ p(to,po) as (t,p) —* (to,po). This proves the desired continuity of //. Next let us show that fi(',p) actually is a solution of equation (34). To that end, choose arbitrary t,to€ I with t0 < t. Then obviously the identity ft\A(s)fi{s,p) Jt0
l
+ fo{s,p)]ds = f [* A{s)$(s,a)f0(o',p)d(rds J
+ [tf0{s,p)ds
Jt0J-00
(36)
Jto
is valid. The integrand in the repeated integral appearing in (36) is integrable over the set {(s,er) :to < s
||A(S)|H|*(S,
<
\\A(s)\\-KMe°'-e^*.
This means that we may apply Fubini's theorem (cf. Craven [6, Remark 7.4.13]) to this repeated integral proving the following relation: /
/
A(s)$(s,<j)fo(<j,p)d
I f ' A{s)${s,a)f0(
II
f [' A(s)${s,a)f0(<j,p)d
=
Jto Jto
f A{s)${s,a)f0((j,p)dsd
J—OO Jto
I I A{s)${s,a)f0{
=
Jto J
f ° [ * ( ^ ) / o h r i - $(t0,(j)f0(a,p)]d
J-00
+ / [ $ ( * , <j)/ 0 (<7,p) - $(<7,(7)/o(
rit,P) - KioiP) - I fo(v,p)d<7 . Jt0
Together with (36) we finally get the identity
M*,P)~MW) = / [^W//(s,p) + /0(s,p)]ds which means that /*(-,p) is indeed a solution of the differential equation (34).
3.
Quasi bounded
Solutions
67
To conclude the proof of step (II) we have to verify the estimate (31). This, however, follows immediately from the following inequality which holds for all t € / and p 6 V:
|M*,p)||e-* < e-*./' \mt,S)\\.\\f0(s,p)\\d8 J—oo
J—oo J—oo
= 7r^e(°^"ll/o(-,P)ll;„e
(77/y Now suppose we have Z > 0, /o as in the assumptions of Lemma 3.2 and I = (—oo,r]. The proof uses Banach's fixed point theorem. In order to set up the frame for this theorem let B denote the linear space of continuous mappings v : I x V —► X such that • the mapping v(-,p) : / —»• X is 7~-quasibounded for any p (E V and • the set {||i/(-,p)||~7 : p £ V} is bounded above. It can readily be seen that
|||, HI :=sup{|K,p)||- 7 :pep} defines a norm on B which in fact turns the linear space B into a Banach space6. 6
The reader may easily check that ||| -1|| actually defines a norm on B. As for the completeness of B let (j>n)r»eN denote an arbitrary Cauchy sequence in B. Because of I M * . P ) - " » ( * » P ) l l < « 7 'lll*'m-*'»|||
for all t£l,peV,
n, m G N
and the completeness of X the sequence {vn(t,p))n^ converges in X for arbitrary t € / and p&V} and we may define v(t,p) := lim vn(t,p). n —*oo
Due to the fact that (^ n ) n eN is a Cauchy sequence we have sup n e N |||"n||| < oo, and therefore |K«fp)||e-* =
lim | M f , p ) | | e - * < sup | M ' , P ) l l r , 7 < m p j | K | | | n
-*°°
n€N
r»€N
for arbitrary t £ I and p € P , i.e. we have \\\u\\\ < oo. The required continuity of v follows immediately from the estimate \Wm(t,p)-Mt>P)W
< e7t|ll^-^n|||
for all teI,peP,
n, m e N ,
which implies the uniform convergence of (fn)neN on J xV for bounded J Cl.
Bernd Aulbach & Thomas Wanner
68
As to the construction of an appropriate contraction on B we choose any v G B and consider the differential equation x = A(t)x + /(*,u(t,p),p) + /o(t,p) •
(37)
Since (28), (29) and (30) imply the estimate ll/(*,»'(*,p),rt + /o(*,pjl|c- 71 < LMtlP)\\e-« < L\H;p)\\-y + \\fo(;p)\\;n < L\\\u\\\ + M
+ \\fo(t,p)\\e-«
< (38)
for all t G / , we may apply step (II) of the present proof to equation (37). Hence there exists a continuous mapping v* : I X V —> X such that the function v*(-,p) is the unique 7~-quasibounded solution of (37) to the parameter value p G V, and for arbitrary p G V we get the estimate
iK(->riii;„ < ^ii/(-^(-.j»).p)+/ohP)it r t < ^ ( i i i H i i + M ) , which shows that v* belongs to B. Now we define the designated contraction mapping T:B^B
,
i/ ■-» v* .
Then (38) implies the estimate
II(^)(-,P)||;, T < ^ [ H M - , P ) | | ; „ + | | / O ( - , P ) I I ; , J .
(39)
Now we claim that the mapping T : B —> B actually is a contraction. In order to verify this, let v\^v% € B be arbitrary. Then the mapping (Tui — 7V2)(•>]?) is a 7~-quasibounded solution of the equation
i = A(t)x + f(tMt,p),p)-f(tM*,p),p)
(40)
for every p £ V. Similar to (37) also (40) satisfies all the assumptions of step (II). Consequently, (29) and (31) imply
||(T^-r^)(.,p)||; t7 < - ^ | | ( ^ - . ^ ) ( . , p ) | | - < j ^ i i ^ - ^ i H 7—
,J
OL
7—a
for all p G V, and therefore we get KT ||pVi-Ti*||| <
7—a
||h-^|||.
According to the assumptions we have 7 > a + KL, or equivalently KL 0 <
< 1.
3. Quasibounded Solutions
69
Thus T is a contraction and Banach's fixed point Theorem B.l, Appendix B yields a unique fixed point in B. Denote this unique fixed point by // and let p G V be arbitrary, but fixed. Applying the above fixed point argument to the differential equation x = A{t)x + f{t,x,p)
+ fo(t,p),
(41)
we immediately get the following: (41) has exactly one 7~-quasibounded solution, since obviously a 7~-quasibounded mapping is a solution of (41) if and only if it is a fixed point of T. (For this step the Banach space B was defined to consist of all 7~-quasibounded continuous mappings from / to X.) According to the above construction of B and T, this unique 7~-quasibounded solution of (41) to the parameter value p G V is /*(-,p), and because of /u G B the mapping p. : I x V —► X is continuous. In order to conclude the proof of step (III) we just have to verify the estimate (31). Since p, is a fixed point of T we have Tp(;p)
= p{;p) ,
and this together with (39) yields
and from this we get
IW-.rtlfc, * T_,f_
KL\\M;P)K,
This completes the proof of (III). (IV) For an arbitrary interval I which is unbounded to the left, (III) guarantees a unique 7"-quasibounded solution /i(-,p) : (—OO,T] -* X O£ (26) for every p €V, and the so-defined mapping /2 : (—oo, r] x "P —> ^ is continuous. But then the mapping H : I x V —► X defined by p(t,p)
:= A(t;r,/i(r,p),p) ,
where A denotes the cocycle of (26), has all the desired properties. (V) Finally consider the case I = R, let fo{-,p) be 7 ± -quasibounded for some p 6 ? , and let L > 0 be arbitrary. According to (TV,) there exists a unique 7~-quasibounded solution fi(-,p) of (26) to the parameter value p EV, and the estimate ll/o(-,P)ll;„ < ll/o(-,P)ll?
for all r G E
Bernd Aulbach & Thomas Wanner
70 together with (31) implies IW-.J»)ll;rt <
7
K > . * _ a l g £ H / o ( ^ ) l g for every r € R .
Thus, passing to the limit provides
IM-,p)ll± = Um|K,p)l|;,7 <
1_*_KL\\f°(-'p)U*-
This means that fi(-,p) is 7 ± -quasibounded and that the inequality (32) holds.
O
The next lemma again deals with differential equations of the form (26). This time, however, we will derive conditions implying the quasiboundedness of all solutions as t —» +oo. Moreover, the assertions of Lemma 3.2 will be extended in the sense that the growth rate of the difference of two solutions will be estimated from below as t —► — oo. In view of later applications it is enough to consider parameter independent equations. Lemma 3.4 Consider the differential equation
x = A(t)x + f(t,x) + f0(t)
(42)
where the interval I is unbounded to the right, X is an arbitrary Banach space, and A: I —* L(X), f : I x X —* X and f0:I—>X are such that • A and /o are locally integrable, • / has the Caratheodory property. For the evolution operator $(t, 5) of the linear equation x = A(t)x we assume that for all t,3 € I and x,x € X the following conditions are satisfied: p ( r , 5 ) | | < Ke"^
if t > 5 ,
/ M ) = 0, | | / ( r , x ) - / ( r , x ) | | < L\\x-x\\,
(43) (44) (45)
with constants a € R, K > 1 and L > 0. Then for anyy > a + KL andr € I the following holds: If f0 is 7"*" -quasibounded, then so is every solution fi : I —» X of (42) and the estimate
Mt, < *llM«||e-- + - _ *_ KL H/0H+,
(46)
holds true. If in addition we have I = R and if fi, fi* : R —> X are two arbitrary solutions of (42), then the inequality
IK*) - ^Wll > Ye7('~T)IMr)" is valid for all t,r £ I with t < r .
/*»!!
W
3.
Quasibounded
71
Solutions
Proof: As in Lemma 3.2 all solutions of (42) exist throughout the interval I according to Theorem 2.4. Let fj, : I —> X he an arbitrary solution of (42) and let any r € / be given. Then the variation of constants formula (cf. Theorem 2.10) yields /i(t) = *(*, T)H(T) + j
*(*, s) [/(s, ft(s)) + fo{sj\ ds
for all t € I,
and with (43), (44) and (45) we get the following relation for allt > r: IMOH < Ke°(-*Mr)\\+
f Ke"^[\\f(s>f,(s))-f(s,0)\\
+ \\Ms)\\}ds
< ^e^-T)|Wr)|| + ^ e a t / ^ - - [ i : | K 5 ) | | + ||/oW||]^ = Kea^-^\\fj,(r)\\
+ i i r i e a ^ | | / / ( 5 ) | | e - t t V 5 + K^
filM*)^*^***
= * - [ J T | M T ) | | « - " ' + M j f | W * ) | | e — d i + ^\\fo\\l„{e^-Q)t
- aH')],
With the abbreviations A(<) := T«
||/x(*)||e- at
and
:= ! T | W r ) | | e — + ^
#
ll/o||?i7 ( e ( ^ a ) t -
e
^
this estimate simply reads A(t) < T(t) + KLJ
A ( S ) ds
for all t > r
Applying Gronwall's Lemma 2.5 to the last inequality we get A(<) < T{t) +
KLftT{s)eKL^t-a)ds
for all t > r , and integration by parts yields A(t) < Y{t)^-KLeKLt
fv{s)e-KL8ds
" T W + *Ie™ [ - -J- e --T( 5 ) [ + ^ / !-(->-KLa ds = T(t) - T(t) + r ( r ) e K ^ - r ) + eKLt f
K\\f0\\t„e^-*L>-
ds
K + fKLt (J-,-a-KL)t _ „fr-«-KX) ll/o||^e™(e 7 — a — KL tf + ,(T-«)I < ir||//(r)||e-are^t-r) + ll/o|ft,e
= r(T)e*L«-T> +
7 — a — If L
0
JBernd Aulbach k Thomas Wanner
72
Finally, multiplying both sides of this estimate by e ( a
7)t
we get
|W«)||e-* < K\W)\\e-*-°-«L*e-^KL* + ^_*_KL < K||Mr)||e-h--")'e-(«+^
IIAIR,
+ ^ ^ T j r Z IW&»
= g||Mr)l|e-Tr+7_tf_y£ll/oHt for all* > r. This means that /z is 7 + -quasibounded and satisfies (46). Now suppose I = R, and let /*, //* : R —> <¥ be arbitrary solutions of (42). Then the mapping v := \i — fi* solves the differential equation x = A(t)x + /(*, x + (i*(t)) - /(*, fi*(t))
(48)
which satisfies all the assumptions of the first part of the present proof7. So if A denotes the cocycle of (48), then the estimate ||A(r;r,z)|| <
Ke*-%x\\
holds true for all t, r E K. with r > t and x € X, and therefore we get
IkMH = ||A(r;<,K*))ll < Ke^~%v{t)\\. This last inequality immediately yields (47) and completes the proof.
O
The estimate (47) contained in the previous Lemma 3.4 is of particular interest if the function /o is identically 0. In this case (42) has the trivial solution and if we set fjL* := 0 we get a lower bound for the asymptotic growth rate of all nontrivial solutions of (42) as t —> —oo. Example 3.5 In order to visualize Lemmas 3.2 and 3.4 let us consider the scalar differential equation x = - 3 x + cos<sinz + e- max{t,0 >
(49)
Defining A(t) := - 3 , f(t,x) := cost sin re and fQ(t) := e-«"«{*.o}) equation (49) satisfies all the assumptions of the preceding two lemmas with K = 1, a = — 3 and L = 1. In the case 7 = 0 Lemma 3.2 implies that equation (49) has exactly one solution which is bounded on (—oo,0]. Furthermore, with 7 = — 1 Lemma 3.4 says that all solutions are decaying exponentially fast as t —> 00, and that all solutions are diverging exponentially as t —> — 00. Some solutions of (49) are shown8 in Figure 2 for - 3 < t < 3 and -1.5 < x < 1.5.
3.
Quasibounded
73
Solutions
Figure 2: Some solutions of Example 3.5 The two previous lemmas deal with perturbations of linear equations whose evo lution operators are quasibounded as t —► oo. In order to motivate the corresponding investigations for t —> — oo we consider a homogeneous linear autonomous system x =
Ax
(50)
with A e K M x M . It is well known (cf. e.g. Hirsch k Smale [16]) that for any /? < minJReA : A 6 cr(A)} there exists a constant K > 1 such that |c*('->|| < Ke^-a)
for all
t<s.
This means that for any (3 < min{ReA : A £ cr(A)} the evolution matrix as well as all solutions of (50) are /? - -quasibounded. Because of this reason one can expect results resembling those above for perturbations of linear equations whose evolution operators are quasibounded as t —> — oo. A result of this kind is described in the following lemma. L e m m a 3.6 Consider the parameter dependent differential
y = B(t)y +
g(t,y,p)+g0(t,p)
equation
(51)
where the interval J is unbounded to the right, y is a Banach space, V is a topological space, and B : J —* L(y), g : J xy xV —> 3^ and g0 : J x V —> 3^ are mappings such
that 7
Notice that equation (48) can be written as x = A(t)x + g(t,x) + g0(t)
with g(t, x) := f(t, x + /i*(*)) - /(*, f{t)) and g0(t) := 0 for all < € R and x g X. 8 This picture as well as the other phase portraits to come have been determined numerically by means of an embedded Runge-Kutte-method with step size control.
Bernd Aulbach k Thomas Wanner
74 • B is locally integrable, • 9(','iP) ^
the Caratheodory property for every p G V,
• #(*>^') *• confintiotts /or every (t,y) G .7 x y, • 5o(',p) w locally integrable for every p G V, • ^0(^5") is continuous for every t E J. For the evolution operator $(t,s) of the linear equation y = B{t)y we assume that for allt,s € J, y,y € y and p £V the following conditions are satisfied: | | t ( « , j ) | | < i^e^- t f )
i/<<5,
g(t,0,p) = °> IW*.ir.p)-*(*.f trill ^ £||y-yll>
(52) (53) (54)
wi£/i constants f3 G R, If > 1 and X > 0. T/ien, /or any 77 < /? — KL and r £ I we have: If the mapping Oo(-,;p) is r\+quasibounded for all p G V with IM'.rilfe, <
M
for some M > 0 ,
(55)
IW-.P)HS, <
P-ri-KL
ll*(-.P)lfc
(56)
Moreover, the mapping (JL : J x V —> y is continuous. If in the case J = K. t/ie mapping go(-)P) is even ^-quasibounded for some p € V, then so is /^(-,p) and toe get the estimate M;p)\\t
< p_*_KL\\9o(;P)\\t-
(57)
Proof: Without difficulties this lemma could be verified completely analogous to Lemma 3.2. However, in order to get a clearer picture of the inherent duality of the two situations, we derive Lemma 3.6 from Lemma 3.2 directly. To this end we set
I A(t) f{t,x,P)
= =
-J, -B(-t),
=
- $ ( - * » ZiiP) i
/o(*,p)
= -9o{-t,p) ,
#(*,•)
=
a
*(-*,-*),
= -fi,
1 = -v i
3. Quasibounded Solutions
75
for all t, s E / , x G y and p eV. equation
Then $(*, 5) is the evolution operator of the linear x = A(t)x ,
and moreover, the nonlinear equation x = A{t)x + f{t,x,p)
+ f0(t,p)
(58)
satisfies the conditions of Lemma 3.2: (27), (28), (29) and (30) are immediate conse quences of (52), (53), (54) and (55). Furthermore, I is unbounded to the left since J is unbounded to the right. Finally we have: • The inequality 7 > ct + KL appearing in Lemma 3.2 is equivalent to the in equality n < (3 — KL. • A mapping \(t) is a solution of (58) to the parameter value p € V if and only if A(—t) is a solution of (51) to the parameter value p. • A mapping X(t) is 7"-quasibounded if and only if A(—t) is 7/+-quasibounded. In particular, (as functions of t) fo(t,p) is 7"-quasibounded if and only if go{t,p) is 7/+-quasibounded. Hence the claimed statements of Lemma 3.6 are direct consequences of the corre sponding statements in Lemma 3.2. The estimates (56) and (57) are immediate implications of (31) and (32). O Using the kind of duality argument as in the proof of the previous lemma we get the following counterpart to Lemma 3.4. Lemma 3.7 Consider the differential equation y = B(t)y + g(t,y)+g0(t)
(59)
where the interval J is unbounded to the left, y is an arbitrary Banach space, and B : J —» L(y), g : J x y —> y and go : J —* y are such that • B and go are locally integrable, • g has the Caratheodory property. For the evolution operator #(£,$) of the linear equation y = B(t)y we assume that for all t,s € J and y,y € y the following conditions are satisfied: ||tf(M)|| < Ke^-* g(t,0) = 0 , Mt,v)-g(t,y)\\
<
£||y-y||,
ift<s,
Bernd Aulbach k Thomas Wanner
76
with constants j3 G R, K > 1 and L > 0. Then for anyrj < 0-KL andr G J the following holds: If g0 is n~ -quasibounded, then so is every solution p : J -+ y of (59) and one gets the estimate
If in addition we have J = R and if \L, fi* : E -» y are two arbitrary solutions of (59), then for all t, T G J with t > r we get the inequality
IM*)-0*MII >
^^-^W)-^
Apart from Banach's fixed point theorem, the Lemmas 3.4 and 3.6 turn out to be the main tools for the construction of integral manifolds in the next section.
4
The F u n d a m e n t a l Existence T h e o r e m for Inte gral Manifolds
This section is devoted to the existence of integral manifolds for certain nonautonomous nonlinear differential equations in Banach spaces. The construction of these manifolds extensively uses the results on quasibounded solutions derived in the previous section. Before we state and prove our main Theorem 4.1 we briefly sketch the idea behind our approach by means of a finite-dimensional autonomous systems of the form x = Ax V = By
(60)
with matrices A € K M x M and 5 6 KNxN, where again K = R or K = C. For the location of the eigenvalues of A and B relative to each other we suppose to have max{ReA : A £ C(J4)} < min{ReA : A G o(B)}. Choosing real constants a and /? such that maxJReA : A G
for t>s for t<s
(61)
where K > 1 is some constant. Using the lemmas of the last section, for every fixed 7 G (oc, (3) the following is true:
4.
The Fundamental Existence Theorem
77
• all solutions of x = Ax axe 7 + -quasibounded, • only the trivial solution of x = Ax is 7~-quasibounded, • all solutions of y = By are 7~-quasibounded, • only the trivial solution of y = By is 7 + -quasibounded. The linear subspaces So := {(r,f,7?) 6 R x K M x KN : n = o} , #o
:=
{(T,£,T?) G R x KM
x KN
: £ =
o}
of KM+N are obviously invariant in the sense that every solution of (60) starting on So (or Ro) remains on So (or Ro) for all t € R. Denoting by A = (Ai, A2) the cocycle of (60), then the above statements concerning quasiboundedness allow the following characterizations of So and Ro: So = { ( T , £ , * 7 ) : ^2{-;T,£,T})
is 7 + -quasibounded |
=
\(r»^7/)
:
K''iT->€>rl) is 7 + -quasibounded I ,
■^o =
{(r)^7/)
:
Ai(-;T,^,»7) is 7~-quasibounded j
— \(T>€iV)
'• ^('J r >^)^) is 7~-quasibounded j .
In the present section we demonstrate that the construction and characterization of the invariant subspaces So and Ro can be carried over to certain nonlinear nonau tonomous differential equations. In general, however, the invariant sets are no longer linear subspaces but rather invariant manifolds (in the autonomous case) or integral manifolds (in general) 9 . The detailed results are contained in the following theorem which has its roots in Aulbach [3] where it has been proved for parameter independent finite-dimensional autonomous systems of ordinary differential equations. T h e o r e m 4.1 Consider the system of differential x = A(t)x + y = B(t)y +
equations
F(t,x,y,p) G(t,x,ylP)
(62)
where X and y are Banach spaces, V a topological space, and A : R —> L(X), B \ R ^ L(y), F:RxXxyxV->XandG:RxXxyxV-^y are mappings such that • both F(t,0,0,p) 9
= 0 and G(*,0,0,p) = 0 on R x V,
In this report we use the notion invariant manifold only for autonomous differential equations (in the usual sense) while for nonautonomous equations we use the term integral manifold. The exact meaning of the latter is explained in Theorem 4.1.
Bernd Aulbach & Thomas Wanner
78 • the mappings A and B are locally integrable,
• the mappings F(-,-,-,p) and G(-,-,-,p) have the Caratheodory property for all p £ V, and both F(t,x,y,-) and G(t,x,y,-) are continuous for every t 6 K, x £ X and y € y. Moreover, suppose that the following two conditions are satisfied: (1) The evolution operators $(t,s) and $(t,s) corresponding to the linear x = A(t)x and y = B(t)y, respectively, satisfy P(M)||
< Kea(t~s)
for all
p ( * , s ) | | < Ke^-a)
equations
t>s,
for all
t<s
with some real constants K > 1 and a < (3. (2) For arbitrary t £ R, x, x £ X, y, y € y and p € "P we have \\F(t,x,y,p)-F(t,x,y,p)\\
< L \\x - x\\ + L \\y - y\\
\\G(t,x,y,p)-G(t,x,y,p)\\
< L\\x - x\\
+L\\y-y\\
where the Lipschitz constant L satisfies 0 < L < ^fjjp. Due to Theorem 2-410 all solutions of (62) exist then throughout R. The corresponding cocycle of (62) will be denoted by A(*;T,£,T7,P)
= (\i(t;T,£,7),p),\2(t;T,t,ri,pf)
e X x y .
Finally, choosing and fixing an arbitrary 6 € (2KL, ^ ^ ] (which is possible since the assumption 0 < L < ^ £ implies 2KL < ^YL) we get the following assertions: (a) There exists a uniquely determined mapping so :Rx graph
X xV
So ■•= {(rA,so(T,t,p),p) ■ of the mapping SQ allows the two
\( T )^ ? 7»p)
:
reR,UX,pev}
representations
So = { ( T , £ , 7 7 , P ) : A2(-;T,£,7?,p) is =
—* y such that the
K'^^^iP)
M
^+-quasibounded\ 1+-quasibounded\
for every choice of^ € [ct+6, (3—8}. The mapping so has the following (i) For any r 6 K, £i>6 € X and p€V
we have s o ( r , 0 , p ) = 0 and
\\*o(T,ti,P) - «o(r,6,J>)|| < K1^6_1KL) 10
properties:
116 - 611 •
The equation (62) lives in the Banach space Xxy equipped with the norm ||(a:, y)\\ :— ||x||+||y||.
4. The Fundamental Existence Theorem
79
(ii) The graph S0 is an integral manifold of (62) in the following sense: The inclusion {T,(,TJ,P) G S0 implies (*, A(i;r,£,7?,p),p) 6 S0 for allteR. (Hi) The mapping s0:RxXxV-^yis
continuous.
(b) There exists a uniquely determined mapping r0:Rxy XV ^ X such that the graph Ko '■= {(T,ro(r,77,p),77,p) : r £R,r} £ y,p eV} of the mapping r*o has the two representations Ro = =
{(T>£ ? *?)P)
: \i(-;T,£,rj,p)
\( T >^ ? /}P)
:
is i~-quasibounded\
^(-;T,€,T],p) is *y~-quasibounded\
for every choice 0/7 £ [a+6,/?—6]. The mapping r 0 has the following properties: (i) For any r G R, *?i>»?2 € y and p £V
we have ro(r, 0,p) — 0 and
I M r , 7/1, p ) - r 0 ( r , T/2, p) 11 <
s,g_2KL)
^Vl ~ ^
'
(ii) The graph RQ is an integral manifold of (62) in the sense described above. (Hi) The mapping r0 :Rx
y xV —* X is continuous.
(c) Only the trivial solution of system (62) is contained both in So and RQ, i.e. we have S0r\Ro = {(r,0,0,p) : T€R,P€V}. In other words: The trivial solution is the only ^-quasibounded (62), for every choice 0 / 7 6 [a + 0", (3 — 6].
solution of
Proof: (a) To begin with, we prove the following claim: For every choice of r € R, £ € X, p G V and 7 G [a + £, /? — 6] there exists a unique point 5Q(T, £,p) £ y such that the mapping A 2 (-;T,£,s2;(r,£,p),p) : R -
y
is 7 + -quasibounded. Moreover, the mapping SQ(T, £, •) : V —> y is continuous. In order to apply Banach's fixed point theorem, for any r £ R let BT denote the linear space of all continuous mappings Ii : [r, 00) x V -+ y with the following properties:
80
Bernd Aulbach k Thomas Wanner the mapping /u(-,p) : [r, oo) —► y is 7 + -quasibounded for every p G ? , the set {||/i(-,p)||r,7 •' V G ^ } i s bounded above.
The space Z3r equipped with the norm
:= 8up{||/x(.,j»)||+7 :
Pev}
is a Banach space (cf. the proof of Lemma 3.2). Let fi G BT be arbitrary. Then, according to Theorem 4.1 (assumption (2)) and Theorem 2.4 the initial value problem x = A(t)x + F{t,x,n(t,p),p)
,
t>r,
X(T) = {
has a unique solution v{-,p) : |/r, oo) —* X for arbitraxy p G "P, and the mapping i/: [r, oo) x "P —> A" is continuous. Moreover, Lemma 3.4 and Remark 3.3 imply that i/(-,p) is 7 + -quasibounded for all p G V with
IK-.P)lfe < g|klk-7r + 7_*_KL
ll^M-.lfl.iOlftr
< ir|KI|e-^+ 7 — a^— if L Next we consider the differential equation y = B(t)y + G(t,v(t,p),fj.(t,p),p),
t>r.
(63)
Because the estimate
||G(t,,/(*,ri,/'(<,p),p)l|e-* < £|R,p)||+7 + £|M,P)l£7 K
< JKIIflle-^ + (
JiKL + X) ' IIIPIII (64)
holds true for all t > r and p G "P, Lemma 3.6 provides a uniquely determined 7 + quasibounded solution //*(•, p) : [r,oo) —» 3^ of (63) for every parameter value p eV. Furthermore, the so-defined mapping ^* : [r, oo) x V —> y is continuous and — according to (56) and (64) — it is an element of BT. Thus we may define the operator Tr4fM
:= ft* ,
TrA
: BT
^
BT.
In order to apply Banach's fixed point theorem to TT£ we have to find a contraction constant. To this end let r 6 R, &,& € X, pUf42 G BT a n d p 6 V be arbitrary, but fixed. If ^i(-,p), i = 1,2, denotes the solution of the initial value problem x = A(t)x + F{t,x,in(t,p),p),
t>r,
x(r) = 6 ,
the difference v(-,p) := ^i(-,p) — ^ ( " J P ) solves the differential equation i = A(t)x + F(t,x + v2{t,p),pL1(t,p),p)-F(t,v2(t,p),y.2{t,p),p),
r>r.
4.
Tie fundamental Existence Theorem
81
This differential equation satisfies all the assumptions of Lemma 3.4, because we have 7 > a+ 8 > a + 2KL > a + KL . This lemma provides both \\v(;p)\\t„
< K\\u(r,p)\\e^
+
*±— \\^{-lP) 7-a-AL
-
^9p)\\t„
and
IM-,p) - *(;p)K„ < ^Il6-6l|e- 7r + +
^7lM-,P)-M2(-,p)ll^. (65) 7 — a — KL Now we set fi* := TTi^/i,-, i = 1,2. Then /u*(-,p) := ^ ( - , p ) — / ^ ( ^ P ) i s a solution of the linear inhomogeneous differential equation y = B(t)y + G(t,v1(t,p),fi1(t1p)1p)-G(tiu2(tip)iii2(t>p),p)
, <>T,
for whose inhomogeneous part from (65) we get the estimate ||G(t,v 1 (t,p),/ii(t,p),p)-G(t,^(t,p) > /i 2 (t,rt,p)||c- 7 t <
1 IM-,ri -
I*(-,P)IG,
iirx||6 - 6l|e"^ +
+ i llw(-.p) - ^ M I I J , <
L(7
~aJr
IM-,P)
-
*(-,P)II£,
7-a-AL for all t > T. Since we already know that /^*(-,p) is 7 + -quasibounded, an apphcation of Lemma 3.6 yields the estimate
+
ll ( rt rtli; -ff-" -Jf£) ^ --^-"a? a
Together with Tr,^,- = JJJ, i = 1,2, and 7 G [a + £, /? - S\ wefinallyget ||r TAMl (.,p)-r T ,^2(-,p)ll^ < ^ H 6 - 6 l | e - ^ + KL + ^ 7 ^ IW-.P) - P>(-.P)IIJ, . where we have used the estimate J —a3 — a — 6 and the relation
min
(fi-^b-a-KL)
7 6 [«+*,/?-«]
= (p - a - 6)(6 - KL) > 0 .
(66)
Bernd Aulbach & Thomas Wanner
82
Choosing £ = £1 = £2 in (66) furnishes the inequality KL l|Tr,«W(-,p) " Trtlh(;p)\\tn
<
{_jrIllft(-.y)-W(-.?)ll?/t
for arbitrary p e V. Eventually passing to the least upper bound with respect to v € V we get
IHT^-TV^III < j ^ l l l f t - ^ l l l . Because of 5 > 2JfI we have £ ^ £ < 1, and this means that the operator TTti is a contraction on BT, hence yielding a unique fixed point (JLT^ € BT according to Banach's fixed point Theorem B.l, Appendix B. Defining s2(r,f,p) := /xT>^(r,p), we obtain the identity A2(*;T,£,S2(T,£,P),J0
= PrAt,p)
for all * e [ r , c o ) ,
(67)
which shows that A 2 (-;T,£,SO( T > £>£)>£) is 7 + -quasibounded. On the other hand, suppose that A2(-;r, £,77,2?) is 7 + -quasibounded. Then as in the proof of Lemma 3.2 this implies that the restriction of this function to [r, 00) coincides with fir,£(->p)- Hence we get 77 = fj,r^(T,p) = SQ(T,(,p). The observation that the mapping SQ(T,£, •) : V —» y is continuous (since fiT£ belongs to BT) completes the proof of the above claim. Let us now turn to the proof of part (a) of Theorem 4.1. First of all, we know from Section 3 that 7i"-quasiboundedness implies 72~-quasiboundedness if 71 < 72. Therefore the above-proved dynamical characterization of SQ(T,£,p) shows that the mapping SQ actually is independent of the special choice of the growth rate 7 as long as 7 belongs to the interval [a-\-6,(3 — 6]. Thus, from now on we omit the superscript 7 and write just so instead of SQ. Furthermore, we immediately get the characterization So =
{(T,£,77,P)
:
A 2 (-;T,£,T?,P)
is 7 + -quasiboundedj
where SQ is (as defined in Theorem 4.1) the graph of the function soIn order to complete the proof of (a) we only have to verify the assertions in (i), (ii) and (Hi), as well as the second dynamical characterization of So. Proof of (i) and the alternative dynamical characterization: The assumptions con tained in Theorem 4.1 immediately yield A2(t; r, 0,0,p) = 0 for all *, r 6 K. and p e V. Thus the mapping A2(,;7'>0,0,p) is 7 + -quasibounded and the identity 3O(T, 0,p) = 0 follows from the uniqueness property proved above. As for the Lipschitz-type estimate in (%) let /zT)^1 and fiT^2 denote the fixed points of TT^X and TT^2, respectively. Then for any p eV the estimate (66) implies
IKAM-^AMIIJ,,
< ^II6-6II^T +
4. The Fundamental Existence Theorem
83 KL 6-KL
and hence
ll/^M-^hiOllk < ^
2^116-611^,
(68)
and finally l | 5 o ( r , 6 , p ) - 5 0 ( r , 6 , p ) | | = ll/*r1«i(T,p)-Airt&(r,p)|| <
< ^ I I ^ M - ^ O . F M k < ?(?-2j£) )|Kl " 611 In view of the second dynamical characterization of So we just have to prove that the mapping A ( - ; T , £ , S 0 ( T , £,p),p) is 7 + -quasibounded. To begin with, setting £2 = 0 in (68) obviously leads to p.r^2 = 0 and with £ = £i we deduce, using (67), l|Ai(.;rfWr>&riJp)||+y < ^
d
( ^ K L )
m
^ '
(69)
Applying Lemma 3.4 to the differential equation x = A(r)x + F(t,x,A 2 (*;r,£,so(r,£,p),p),p) now gives us the estimate l|Ai(-;r i e,Jto(T,{ J rt,j»)||+ T < JT|KI|eT +
j^lMST,*,ao(r,6p),p)||+7 < 7 — Q! — A L
A-IKHc-^ + j—gj|Msr,Wr,fcri,ri||+, * K3T 2
( ^S^W)"*11^ \
(™)
This means that A I ( - ; T , £ , S 0 ( T , £ , 7 > ) } P ) and consequently also A(-;T,£,s 0 (r,£,p),p) is 7 + - quasibounded. Proof of (ii): Let (r,^,7/,p) € So and t 0 E R be arbitrary. Then we know that the mapping A2(-; T,^,7/,J?) is 7 + -quasibounded. The identity A 2 (*;*O,A(* 0 ;T,£,77,P),.P)
= A2(t;r,£,77,p)
for all t 6 R
(the cocycle property (8)) then shows that the mapping A2(-;
Bernd Aulb&ch & Thomas Wanner
84
Proof of (Hi): As to the continuity of s 0 , let (T0,fo,Po) G R x X x "P be arbitrary and note that because of S 0 (T 0 ,£O,P) = ^TO,6>(TO>P) an( * /-Wo £ #*t> t l i e mapping •3O(TO,^O, •) : P —> y is continuous. Then the estimate H*o(r,£,p) - So(r0,£o,Po)|| < | M r , f , p ) - so(r 0 ,fo,p)|| + + ||«O(TO,6>P) - "SO(TO,^O,PO)||
shows that in order to prove the continuity of s0 in limiting relation lim
s 0 (r,£,p) =
(T 0 ,£O,PO)
it suffices to verify the
uniformly with respect to p € P .
SO(TO,£O,P)
(T,0-+(TD.^O)
According to -ao(7b,6iP)ll < \\so(r,(,p) - 5 0 (r,^o,p)|| + ||5 0 (r,^o,p) ||«O(T,£,J>)
K
6{6{-~2KL)
lle
$O(TO,6I,P)||
<
" Co11 + IM^fe»P) ~ *>(r0,6),p)||
this in turn reduces to the verification of the following claim: Let (T 0 ,£O) G R x # 6e arbitrary. Then for every e > 0 there exists a g > 0 sucfo t/iai IMT,£O,P)-SO(TO,£O,P)||
<
e
/or ant/ r G R wi£fo |T — To| < £ and any p G "P. In order to verify this claim we set fi(r,p) := A(T;T 0 ,£O,SO(TO,£O,P),P)- Then we have both A*I(TO>P) = Co
and
/ / 2 ( T 0 , P ) = S 0 (T 0 ,£O,P) '
and the "invariance" proved in (ii) implies /i 2 (r,p) = So(r,/ii(r,p),p) . For every choice of r G R and p G ? w e then get the estimate IMT5£O,P)-SO(T0,£O,P)||
<
l|5o(r,^o,p)-5o(r,^i(r,p),p)|| + ||so(T,// 1 (r,p),p)-so(r 0 ,^o,p)|| <
)+ IKT>rt
(?(?-2/S 0
ri
"^ "
4.
The Fundamental Existence Theorem
85
which with t h e aid of Lemma 2.6 implies the above claim and proves the continuity of s 0 in (T 0 ,CO,PO)-
(b) This part can either be proved analogously to (a), or it can be deduced directly from (a) by applying t h e time reversal scheme demonstrated in t h e proof of Lemma 3.6. (c) Let fi = (/Xi,/z2) b e any 7 ± -quasibounded solution of (62) to t h e parameter value p G V. Because of assumption (2) of Theorem 4.1 the mapping G(-, //i(-), /^(O,p) is then 7 ± -quasibounded as well, and Lemma 3.6 yields the following: \ii is the uniquely determined 7 ± -quasibounded solution of
y = B(t)y +
G{t)fil{t),n2{t),p)
and we get K
KT
||*|? < P--I »—l|G(-./»i(-).*(-).P)l£ < - j r IKItf + IWtf . and from this
KT
(71)
INI* < JZTKLW^Analogously, Lemma 3.2 applied to x = A(t)x-\-F(t,
^ i ( t ) , /U2(t),p) yields the estimate
KL
IN? < S-KL 7—iTrlW' This together with (71) implies I W I ? < (jZJcz)2\Mfi
for*
= 1.2-
(72)
According to the assumptions of Theorem 4.1 we have 6 > 2KL and therefore 6_^L < 1. Then (72) can only be true if ||A*I|| 7 = \\fh\U ~ u> s o A* = (/*i>/*2) has to be the trivial solution of (62). This completes the proof of Theorem 4.1. O R e m a r k 4 . 2 At first glance it may seem unnatural that the mappings so(-, *,p) and o(*> *>p) a r e 07lfy continuous, and not Lipschitz continuous as their intersections with the hyperplanes t — r. Recall, however, that we are considering nonautonomous dif ferential equations whose right-hand sides depend only measurably on the time variable t, and therefore the solutions of equation (62) are not Lipschitz continuous in general. Yet, if we assume that in Theorem 4.I the mappings ||A(-)|| and ||.B(-)|| are lo cally bounded, then the above proof of the continuity of s0 yields (after some minor modifications11) the following result: r
n
T h e modifications boil down to the verification of the following assertion: Let (r0,£o) £ M x X be arbitrary, let U C K be any bounded interval containing r0, and let V C X be a bounded neighborhood of &>• Then there exists a constant C > 0 such that \\so(T,Z,p)-s0(f,Z,p)\\ < C\r-f\ for all r, f £ U, £ G V and pEV. The proof of this uses again Lemma 2.6.
Bernd Aulbach & Thomas Wanner
86
The mapping s 0 (-,-,p) : I x A 1 —> y is Lipschitz continuous uniformly with respect to p, i.e. for every (T 0 ,£O) G R X ^ there exists a neighborhood U C RxX °/(To>£o) and a constant C > 0 such that
IMri,6,p)-soK6,rill < C|r 1 -T i | + C7||6-e 2 || for all ( T I , ^ I ) , ( T 2 , ^ 2 ) € U and p € V. An analogous statement holds for the mapping rg. Of course, the condition on local boundedness required above is always met if the mappings A and B are continuous. E Theorem 4.1 shows that the collection of solutions with a certain kind of quasiboundedness forms an integral manifold for the given differential equation. In the following corollary we describe the asymptotic behavior of those solutions in the pa rameter independent case in more detail. Corollary 4.3 Consider the differential equation x = A(t)x + F(t,x,y) y = B{t)y + G(t,x7y)
(73)
and suppose that all the assumptions of Theorem J^.l are satisfied (in a parameter independent version). Let So and RQ denote the integral manifolds guaranteed by this theorem. Then every solution fi : R —* X x y of equation (73) which is contained in the integral manifold So satisfies the following estimates for any 7 € [a + 8, (3 — 8]:
Similarly, every solution v : R —> X x y of equation (78) which is contained in the integral manifold Ro satisfies for any 7 € [a + 8, /3 — 8] the estimates
Proof: Because of symmetry in time we only prove the assertions for fi. The estimates for v may be derived similarly. Since \i is a solution of (73) which lies in 5o, the existence and uniqueness Theorem 2.4 implies the identity p(t)
=
A(t;r,//i(r),5 0 (T,/2i(T)))
4. The Fundamental Existence Theorem
87
for all t, r 6 R. Then (69) and (70) furnish the two estimates
"»w» * (K+*(Sz))ii'"«ii^"r)'
"w«i s 9^ l M T ) l | e 7 ( , ~ r ) for all i > r. Adding these two inequalities yields
M*)ll = IM«)ll + lMt)ll < ^ r ^ l M ^ l l e ^ ' - ^
<- 3ngW>ii"" for t > r, which is the first of the two claimed estimates for fj,. As for the second estimate let t,r eR with t < r be given. Then the last inequality implies with the help of the cocycle property (8) IIMWH
=
;
||A(T i,A(t;T,„(r)))|| < *f~££
||>ftr,dr))||rf»-0
= ^i^iwoii-^This completes the proof of Corollary 4.3.
O
Although Theorem 4.1 is designed for general t-dependence of the underlying differential equation, it is vital to know if a periodic i-dependence carries over from the differential equation to the integral manifolds So and RQ. An affirmative answer which also covers the autonomous case (thus yielding invariant manifolds) is given in the following corollary. Corollary 4.4 Consider the differential equation x = A(t)x + y = B(t)y +
' 7/1 F(t7x,y) G(t,x,y)
(74)
and suppose that all assumptions of Theorem 1^.1 are satisfied (in a parameter inde pendent sense). Let SQ and ro denote the mappings provided by this theorem. Then (a) if the right-hand side of (74) is periodic in t with period 0 > 0, then also the mappings so and ro are periodic in t with period Q, i.e. for all r 6 R, £ € X and r\ ^y we have S 0 (T + G , 0
=
S0(T,£)
and
r 0 ( r + ©,»/) = r0{T,n) .
Bernd Avdbach & Thomas Wanner
88
(b) if the equation (74) is autonomous, i.e. if the right-hand side of (74) is inde pendent oft, then so are s0 and r0. In this case the sets So := {K,*o(0) '• £ € X)
and
Ro := {(r0(i?),»|) : V € 3>}
are invariant manifolds in the phase space X x y. Proof: The assertions contained in (b) can readily be deduced from (a), since a mapping is independent of t if and only if it is periodic in t with any positive period. As to the proof of (a), let r 6 R and £ G X be arbitrary, but fixed. Let fi = (//i, //2) denote the solution of (74) satisfying both /Zi(r) = £ and /z 2 (r) = So(r,£). According to Theorem 4.1, /z2 is then 7 + -quasibounded. Now define v\(t) := /ii(< - 0 )
and
v%{t) := f*2(* - ©) •
The periodicity of the right-hand side of (74) implies that also v := (vi,v2) is a solution of equation (74). Furthermore, v2 is 7 + -quasibounded. Finally Theorem 4.1 yields
*>(r+e,0 = 30(T + e,/n(T + e-e)) =
so(r + 0 , Vifr + 8))
=
^ 2 (r + 0 )
=
^ 2 (r)
=
S0(T,£).
The periodicity of r 0 can be proved analogously.
O
Figure 3: Phase portrait of Example 4.5 for L = 0.9 Example 4.5 We illustrate Theorem 4.1 and its Corollary 4.4 by means of the 2dimensional autonomous system x = (L — 2)x + Xsiny y = (2 — L)y — L sin x
(75)
4. Tie Fundamental Existence Theorem
89
depending on a real parameter L. Setting A(t) := —2, B(t) := 2, F(t,x,y) := Lx + L sin y and G(t,x,y) := —Xy — Lsinx, the assumptions of Theorem 4.1 and Corollary 4A(b) are satisfied, with a = —2, ft = 2 and jRf = 1, provided we have X< ^ = 1. Thus, in this case there exist invariant manifolds So and Ro in the phase space R2 consisting of those solutions of (75) which are bounded as t —> oo or as t —► — oo, respectively. These manifolds — corresponding to the parameter value L = 0.9 — are depicted in Figure 3, where the phase portrait is sketched for - 3 < x < 3 and - 1 . 5 < y < 1.5.
Figure 4: Phase portrait of Example 4.5 for L = 1
Figure 5: Phase portrait of Example 4.5 for L = 1.1 For L > 1 the differential equation (75) does not satisfy the assumptions of The orem 4.1 any more. However, whereas in the case L = 1 there are still two invariant manifolds with the above-stated properties (cf. Figure 4), for L > 1 there is no 1-dimensional invariant manifold passing through the origin, since the origin is sur rounded by closed orbits. The phase portrait for the case L = 1.1 is shown in Figure 5 12 . For those readers who are not easily convinced by numerically calculated pictures: The system
Bernd Aulbach k Thomas Wanner
90
Remark 4.6 The last example shows that the condition on the Lipschitz constant L stated in Theorem 4-1 is necessary and cannot be weakened. D Up to now the presented results were rather technical and lengthy to prove. Having the basic results at hand, we may now leave the technicalities behind and head for results which can be deduced from Theorem 4.1 without too much further effort.
5
Hierarchies of Integral Manifolds
In the last section we have shown under which conditions certain differential equations have two integral manifolds intersecting along the trivial solution. In the present section we extend this result to obtain conditions providing more than just two integral manifolds. In fact, we present conditions implying the existence of two so-called hierarchies of integral manifolds whose members are ordered in a natural way by inclusion. These results generalize those for finite-dimensional autonomous systems from Aulbach [3]. As in previous sections, we first present the idea of what is to come by means of a finite-dimensional autonomous system which now has the form
(76)
with matrices A,- € KNiXNi for i = l , . . . ,n, where K = R o r K = C a n d i V = iVj + ... + Nn. Our aim is to find as many invariant subspaces of (76) as possible. Since this system is decoupled and linear, the subspaces Kj := { ( x l r . , I n ) G K N : x,-= 0 for i ^ j} ,
j = l,...,n,
(77)
as weU as all subspaces induced by them (through the formation of algebraic sums) are invariant. Of those induced invariant subspaces we want to emphasize the following two classes: For j = 0 , . . . , n - 1 we deffne Lj := {(xlt...ixn)GKW
: ( s i + 1 , . . .,x„) = ( 0 , . . . ,0)} ,
(78)
and forj = 1,...,n we define Mj := { ( * , . ; . , * . ) € I * : ( . , , . . . , « , ) = ( 0 , . . . , 0 ) } . (75) is a Hamiltonian system with the Hamiltonian H(x, y) = (L- 2)xy - L(cos x + cco sy) So the level sets {(x, y) G M2 : H(x, y) = c} for real c consist of orbits.
(79)
5. Hierarchies of Integral Manifolds
91
Finally, if we let Ln := K.N and Mo := K^, those two classes of invariant subspaces of (76) are canonically ordered by the set-theoretical inclusion, i.e. we have {0} = L0 C Lx C . . . C I „ - i C l n = K w , {0} = M n C Mn_x C . . . C Mi C Mo = KN .
.
, { V)
°
For this reason, we call the sets of Lj 's and Mj 's, j = 0 , . . . , rc, respectively, hierar chies of invariant subspaces. In this context the following question arises: Question: What happens to all of the invariant subspaces induced by the subspaces Kj in (77) if we add a small nonlinear perturbation to the linear differential equation (76)? In particular, what happens to the two hierarchies in (80)? Do they give rise to "nonlinear analogues"? Before we attempt to answer this question we have to clear what we precisely mean by "nonlinear analogue". To this end we note that each invariant subspace Kj from (77) can be viewed as the graph of a smooth mapping, namely Kj = | ( x i , . . . , x n ) € K
: (x1,...,Xj-1}Xj+iy...,xn)
=
kj(xj)j
where
*■{?
KNlx • • • x KN>-ix KN^x • • • x KNn (0,...,0,0,...,0) .
Therefore, in view of Theorem 4.1 and Remark 4.2, respecting our nonautonomous setting, we make the following Agreement: In the sequel, the term nonlinear analogue of an invariant subspace (or linear integral manifold, in the nonautonomous case) is used as synonym for integral manifold being the graph of a continuous mapping which has a Lipschitz continuous intersection with the hyperplanes t = r. The reason for demanding a continuous function which has Lipschitz continuous in tersections with t = T is that we want our mapping to be as smooth as possible. With respect to the state variable x we cannot expect more than Lipschitz continuity, since our differential equations are only supposed to satisfy a Lipschitz condition with re spect to x. On the other hand, in the direction of the time variable t we can expect at most continuity, because our differential equations depend only measurably on t and so the solutions will not be Lipschitz continuous in general but only continuous. For n = 2 the above question can be answered immediately: We just have to apply Theorem 4.1. Assume there are constants a < (3 such that the real parts of all eigenvalues of A\ are strictly less than a and that the real parts of all eigenvalues of A2 are strictly greater than /? (cf. Figure 6(a)). Then for the perturbed system ii
= A1X1 + Fi(xi,x2)
, s
x2 = A2x2 + F2(xi,x2)
* '
92
Bernd Aulb&ch. k Thomas Wanner
all invariant subspaces of the unperturbed linear system survive as nonlinear ana logues in the sense described above (with formal and trivial ^-dependence), provided Fi and F2 satisfy suitable conditions. Thus we get an affirmative answer to the above question.
Figure 6: On the spectral condition for the linear part of system (81). As for n > 3, the case n = 2 suggests that we have to make certain assump tions concerning the spectra of the matrices A{. Hence, let us assume that there are constants -OO = /? 0 < CX\ < Pi < ••• < Q!n-1 < A1-1 < a „ =
00
such that the real parts of all eigenvalues of A{ are contained in the open interval (/?,_!,a,) for i = l , . . . , n (cf. Figure 6(b)). If ¥?(*;£) denotes the flow of the (au tonomous!) differential equation (76), the following characterizations are immediate consequences of the estimates of the form (61): Lj = | £ 6 KN : ?(•;£) is 7j"-quasibounded| , Mj = | £ G KN : ¥>(•;£) is 77~-quasibounded} , where 7^ 6 (aj,Pj) is arbitrary for j = l , . . . , n — 1. These characterizations give rise to some optimism, since in Theorem 4.1 just descriptions of this form enabled us to prove the existence of integral manifolds for the nonlinear perturbation. It will turn out in a moment that this theorem is all we need in order to answer the above question — at least in case of the two hierarchies (80) — in the affirmative: They in fact survive certain nonlinear perturbations. Before we present this result we set up the framework for the remainder of this report. We consider nonautonomous differential equations of the form x = A(t)x + F(t,x)
(82)
where x belongs to some Banach space X. Furthermore, we impose some conditions on the linear part A(t) of this differential equation and on the perturbation F(t, x) which may (but need not) be nonlinear. As for the linear part we require the following.
5. Hierarchies of Integral Manifolds
93
( C l ) Hypothesis for the linear part A(t): Assume there are Banach spaces Xi for i = 1 , . . . , n such that X =
XlxX2x...xXn
and for every x = ( x i , . . . , xn) 6 X the norm of x has the form
11*11 = INI + INI + ... + IWI, where the norms on the right-hand side are the norms of the Banach spaces X\,X
= (Ax(t)a:i , A2(t)x2 , . . . , An{t)xn)
i.e. A(t) is in "block-diagonal form" with exactly n>2
,
blocks.
Assume there are real constants K > 1 and a,- < $,-, i = 1 , . . . ,n — 1, such that 0i 5: oj;+i for i = 1 , . . . ,n — 2 and £/m£ i/ie evolution operators $i(t,s) of the homogeneous linear equations ii = Ai(t)x{ satisfy the respective estimates ||*<(*,«)|| < ||$i+i(M)|| <
Keai^-3)
forallt>s,
8
Ke^- ^
forallt<s
for i = l , . . . , n — 1. Finally, choose and then fix any 8 such that 0 < o <
min
—-— .
i' = l,...,n-l
2
Obviously, the above assumption (Cl) is satisfied by the autonomous linear system (76) if the spectra of the matrices Ai can be separated by vertical strips in the complex plane as depicted in Figure 6(b). At first glance however, the special form of the Banach space X seems to be rather restrictive, since usually one starts off with a differential equation on some given Banach space X which in general is not in the required product form. In the following (frequently occuring) situation, however, this problem can be solved satisfactorily: Assume there exist projections P; 6 L(<^) (i.e. Pf = f>-)fori = l , . . . , n with Pi + P 2 + • • • + Pn = i d ^ such that their ranges Xi := Pi(X) are invariant under A(t) (i.e. A(t)Xi C Xi for all i = 1 , . . . , n, t € R) and that
x = Xi e x2 ©... @ x n .
Bernd Aulbach k
94
Thomas Wanner
If we then define the mappings A, by Ai(t)
:= A(t)\Xi
for all
teR
and set X := Xx x X2 x . . . x Xn , then A* and X are algebraically and topologically isomorphic by means of the contin uous isomorphism X H* (PiX,P2X}. . . ,Pnx) , X —> X if we equip X with the norm | | ( x i , . . . , x n ) | | := ||xi|| + . . . + ||x„||. Therefore we may work with X instead of X, and this Banach space has the form required in assumption (Cl). Now let us focus on the assumptions concerning the nonlinear 13 perturbation F(t,x) in equation (82). ( C 2 ) H y p o t h e s i s for t h e nonlinear part F ( t , x ) : Assume that the mapping F : Rx X —* X has the Caratheodory property with F(t, 0) = 0 for all t G R, and that the estimate \\Fi(t1x)-Fi(t,x)\\ < I||a;--a?|| ' holds for i = 1 , . . . , n and all t G R and x, x G X, with some suitable L > 0 1 4 . To express F in "coordinates" we write F{t,x)
= ( ^ ( ^ x ) , . . . , F n ( t , x ) ) G X1x...xXn
constant
= X .
Under the assumptions (Cl) and (C2) we may now apply our basic existence and uniqueness Theorem 2.4 to equation (82), and therefore from here on we have the cocycle \(t; r, £) of this equation at our disposal. The formulation of our results on hierarchies of integral manifolds requires some further notation. For any x = ( x i , . . . , x „ ) 6 Xi x ... x Xn
= X
and i,j G { 1 , . . . , n} with i < j we define xi := ( x i + i , . . . , x n ) G Xi+1 ■Cj<^ j .— 13
\ X j , . . . , Xj)
t
XiX...xXi} x ... x Xn ,
fw i X . . . X & j ,
As (C2) shows, we allow also linear perturbations. Since linear perturbations, however, are of minor importance in this article we use the notion nonlinear here as a short form of not necessarily linear. 14 Of course the constant L has to be sufficiently small. Precise statements on the right choice of L are contained explicitly in the results to come.
5.
Hierarchies of Integral ManifoJds
95
and for every subset {«i,... , i m } of { 1 , . . . , n} we set
IK**,...,**.)!! := lfoJI + »- + H*UINow we are ready to state and prove the main result of the present section. Theorem 5.1 Consider the differential equation x = A(t)x + F(t,x)
(83)
satisfying the above assumptions (Cl) and (C2) with 0 < L < 2K(n-D' Then there exist two hierarchies R x { 0 } = I 0 C Lx C . . . C I„_i C Ln = R x X R x {0} = M n C M n _! C . . . C Mi C M0 = RxX
. {
. }
of integral manifolds for (83). For i = 1 , . . . , n — 1 these manifolds are graphs Li = { ( T , 0 € R X * : t>i = U(T,t
rmiT,^)}
of continuous mappings
h : R x ^ x . . . xXi rrti : R x Xi+1 x . ..xXn
-»•
->
^»+i x • . . X fCn rtj x . . . X rCi .
Furthermore, for i = 1 , . . . , n — 1 we aave: (aj The integral manifolds Li and Mi can be characterized dynamically as Li = {(T->Q € R x X : A(-;r,£) is 7+-guas«&oima'ea'} , M,- = | ( T , ( ) € I X ^ : A(-;r, £) is ^ -quasibounded\ , for every choice of 7, € [a,- + 6, /?; — <$]. (b) For a l l r G R £ € A* we oe£ iae estimates
l|/.(T,fe)-l,(r,fe)|| <
IK(r,f>.)-m,(r,MII <
JJJ_ 2 f f £ ( n _
1)}
V-2W-I))
life-fell llf i
> -^11
as iweZZ as /,(r,0) = 0 and m t (T,0) = 0. (c) If the right-hand side of (83) is periodic in t with period 0 > 0, then so are the mappings U and rrti.
Bernd Aulbach k Thomas Wanner
96
Proof: In order to prove the above assertions we only have to apply our main The orem 4.1 repeatedly. To this end, let i 6 { 1 , . . . ,n - 1} be arbitrary, but fixed, and define X* := Xx x ,.. X Xi , y* := Xi+i x...xXni write every x € X in the form x = {x*,y*) € X* X y , and let ||**|| := ||z<,||, ||y*|| := ||x>,||. Then the two evolution operators $*{t,s) and #*(*,s) corresponding to the linear equations x* = A*x* and y* = i ? V , respectively, where A\t)x*
:= ( A i ( t ) * i , . . . ,Mt)xt)
,
J3*(*)y* := (A i+1 (f)x i+1 , . . . , An(t)xn)
,
are given by $*(i,s)x* := (*i(*,*)xi , . . . , *<(t, *)*.') , #*(i,s)y* := (* i+ i(t,«)«<+! , . . . , $ n ( M ) x n ) • Furthermore we have ||**(t,*)|| < iire a<(t - s) for all t > s , ||**(*,a)|| < Ke^(t-a) for all t < 8 according to assumption (Cl). Now let F* := ( F i , . . . , F,-) and G* := (Fj+i,..., F n ). Then because of assumption (C2) the estimates
iiF'(t,a^*)-F*(M*,r)ii < ^[ii^-rii + i^-rn < (n-l)l[||x*-r|| + ||^-y*||], ■ \\G*(t,x*,y*)-G*(t,x\f)\\ < (n-0l[||**-S*|| + ||y*-ril] < (n-l)L[\\x*-x*\\
+ \\y*-y*\\
hold for all t 6 R and (**, y*),(x*,y*) £ X* x y* = X. ]£ we finally apply Theorem 4.1 to the differential equation x* = A*{t)x* + F*{t}x\y*) y* = B*(t)y* + G*(t,x*yy*) which is exactly equation (83) (just written in another form), we get the mappings /,and m,-, as well as all the results claimed in (a) and (b). The assertions of (c) follow immediately from Corollary 4.4. Finally, the hierarchical inclusions (84) are straight forward implications of the characterizations contained in (a) together with remarks (f) and (g) succeeding Definition 3.1. This completes the proof of the theorem. O
97
6. The Classical Five Integral Manifolds
Remark 5.2 The previous proof and Remark 4.2 show that if the mapping \\A(-)\\ is locally bounded (or equivalently: the mappings \\Ai(-)\\, i = l , . . . , n are locally bounded), then the mappings Z- and rm are even Lipschitz continuous. □ Theorem 5.1 answers the question raised in this section for the subspaces contained in the two linear hierarchies (80). But what about all the other invariant subspaces of the unperturbed linear equation (76)? Obviously, there are many of them which are not contained in our two hierarchies. Do they survive a small nonlinear perturbation? The answer to this question is somewhat subtle: some do — some do not. We return to this problem in the remaining two sections of this paper.
6
The Classical Five Integral Manifolds
The most important manifolds in the classical theory of invariant manifolds are the stable and the unstable manifold and the three center types, the center, the centerstable and the center-unstable manifold. For short, we call those five types of manifolds the classical five. Of course, also in our generalized setting those five types of manifolds play a prominent role. As usual we begin with a brief outline of what is to come by means of the simplest case of an N- dimensional autonomous linear system
(85)
with matrices A{ 6 KNiXNi for i = 1,2,3, where N = Ni + N2 + N3. The results of the previous section provide four nontrivial (i.e. different from {0} and K^) invariant subspaces of (85) which actually survive a small nonlinear perturbation as invariant manifolds. With the notation of Theorem 5.1 these subspaces are {OjCiiC/qCK"
and
{0} CM2 C M1 C KN .
(86)
Obviously, system (85) has exactly eight invariant subspaces, six of them nontrivial. In Figure 7 we have shown the picture for the case N = 3 and Ax < 0 = A2 < A3. Thus, exactly two invariant subspaces of (85) are not contained in the list (86), namely Kl3 := Ux1,x2,x3) K2 :={(xux2,x3)eK»
€ KN : x2 = o} :Xl
and
= x3 = 0}.
(87)
The question arises if also K13 and K2 give rise to nonlineax analogues after a small nonlinear perturbation? The surprising answer to this question is: K2 does survive and K13 does not. While we postpone the demonstration of "nonsurvival" of K13 to
Bernd Aulbach k Thomas Wanner
98
Figure 7: The invariant subspaces of system (85). the next section we now focus on the existence of a nonlinear analogue to K2. First we note that K% is the intersection of the invariant subspaces L2 and Mi, and the intersection of two invariant subspaces is an invariant subspace itself. So, in order to prove that K2 survives a small nonlinear perturbation we could proceed as follows: Theorem 5.1 provides the two (generally nonlinear) invariant manifolds L2 and Mi whose intersection is again invariant. However, it is not immediately clear that the resulting invariant set L2 D Mi is a nonlinear analogue of K2 in our sense, namely the graph of a suitable function. Nevertheless, provided the nonlinear perturbation is "sufficiently small", the proof of the following theorem shows that this remaining problem can be solved quite easily by means of the uniform contraction principle. Theorem 6.1 Consider the differential equation
x = A{t)x + F(t,x)
(88)
on a Banach space X satisfying the hypotheses (Cl) and (C2) (stated prior to Theorem 5.1) withn = 3, ft < 0 < a2) andO < L < 2K2*n_1)(K+2-y/K2 + 4). Then equation + (88) has five integral manifolds S~, SQ , Co, RQ and R which are the graphs of continuous mappings
s so Co
rt r+
Rx^ R x Xx x X2 RxX2
->
X2 x X$ ,
-►
—>
X3 , X\ x X3 ,
EX^X^j 1X^3
->
X\ ,
—>
X\ X X2 .
Those integral manifolds are named and characterized for any 71 £ [ai -\- 6, $\ — 6] and 72 £ [#2 + ^> ft — ^] as follows:
6. The Classical Five Integral Manifolds
99
(a) Stable Manifold:
S~ = { ( T , f l € R x * : (6,&)=J-(r,6)} =
\ ( T > 0 G R x Af : A(-;r,£) is 7+-quasibounded\
(b) Center-Stable Manifold: So" = {(r.fl € R X X : & = 5 0 - ( r , 6 , 6 ) } =
|(T,
0 €R xX :
A(-;T,
£) is ^ -quasibounded\
(c) Center Manifold: Co = { ( r , 0 € R x X : (&,£,) = <*(r,6)} — \ ( T » 0 G R x
Rt = {(T,0 € R x * : 6 = rf(r,6,&)} — | ( r > 0 G R x <¥ :
A(-;T,£)
is 7^"-gwasz6ownde(i}
(e) Unstable Manifold:
R+ = { ( T , 0 e l x ^ f : ( 6 , 6 ) = r + ( r , 6 ) } = <(T,£) G R x X : A(*;r, £) is 7^-giiasi6o?mded} For every t £ R we have s"(*,0) = 0, So(t,0) = 0, Co(r,0) = 0, rj(t,0) = 0 and r + ( t , 0 ) = 0, and the mappings s~(t, •), So (£,•), Co(t,•), r j ^ , •) and r + (£, ■) are globally Lipschitz continuous with Lipschitz constant 2 C
^ l-C(L)
whm
v
'
v
'
KlL(n l)(S KL{ n - - -^ C(L)^C(L,KM:=
' ' '
^-2i^L(n-l))
Finally, if the right-hand side of (88) is periodic in t with period 0 > 0, then so are the mappings s~, SQ , CQ, r$ and r+, and if system (88) is autonomous, then the mappings s~, SQ , CQ, 7\J" and r+ are independent oft and define invariant manifolds for the given autonomous system. Remark 6.2 We want to emphasize that the above characterizations (i.e. necessary and sufficient descriptions) of the five classical integral manifolds are valid under the assumption of the existence of a global (and sufficiently small) Lipschitz constant for
100
Bernd Aulbach k Thomas Wanner
the nonlinear part F(tx)) of system (88). If the function F{t,x), however, satisfies a condition of the form F(t,x) = o(\\x\\) as x -* 0 uniformly with hespect tto (as it frequently appears in applications), then one can apply Theorem 6.1 only after a modification through a cut-off technique. The quasiboundedness conditions described above then in general yield only sufficient conditions for solutions to lie on the stable or the unstable manifold, as the example xx = -xt(l - x \ - x\)3 x2 = 0, x3 = x3(l x\ - x\) shows Furthermore, these quasiboundedness conditions are not tecessary in general. This can be seen by means of simple examples such as the two-dimensional system i i = —xi, x2 = «f whose center manifold x\ = 0 contains only one bounded solution, namely the trivial one. All other solutions on this manifold are unbounded (and even escape in finite time) because their x2-coordinate satisfies the equation x2 = x\. O Proof of Theorem 6.1: It is easy to see that the condition on L given in Theorem 6.1 is stronger than the corresponding condition contained in Theorem 5.1. Furthermore, the condition in Theorem 6.1 has been tailor-made to guarantee the inequality
«■> - "&'-'S"V " <' ■
»
An application of Theorem 5.1 now immediately furnishes the assertions concerning the stable, center-stable, center-unstable and unstable manifold, since they correspond to the hierarchy members Lu L2, M1 and M2, respectively, and we have
0
As for the center manifold we pursue our intersection idea mentioned prior to the statement of Theorem 6.1. We know by now that there are continuous mappings ,„ and r£ such that 6.1(6; and 6.1(d) are valid, as well as the estimates llrf(r,&,«-rj(r,ifel.fe)||
<
C{L) 11(6,6) - f a , * ) | |
(90)
for all r € R and ( 6 , 6 , 6 ) , ( f t . t o f e ) € X. In order to apply the uniform contraction principle, we define the mapping I :
/ Xx x X3 x lxX2 { (6,6,r,6)
^» -
XiXX3 (r0+(r,6,6),*o(r,6,6)).
Obviously this mapping is continuous. Now let r <= R and 6 € X2 be arbitrary. Then according to (90) we have
l|r(6,6,r,6)-r(7i^3,r,6)ll = lW(r,&,6)-rJ(T > 6,i t o)|| +||* 0 -(r,6,6)--o-(r,*,6)ll < ^ 1 ) 1 1 6 - ^ 1 1 + ^ ) 1 ( 6 - ^ 1 1 = C(L) 11(6,6) - f a , » ) | |
6. The Classical Five Integral Manifolds
101
for all ( 6 , 6 ) , (*?i,f/3) G X\ x X3. Because of (89) and the uniform contraction principle (cf. Theorem B.2, Appendix B) the mapping T(-, -,7,(2) has a unique fixed point CO(T,£ 2 ) for every r G R and 6 G X2. Furthermore, the so-defined mapping co : R x X2 -»
XxxXz
is continuous. Since obviously a point (£1, £3) G # 1 x X3 is a fixed point of T(-, •, r, £2) if and only if
M i , 6 , 6 ) e So-nitf, we have Co := { ( T , 6 , 6 , 6 ) e R x # : ( 6 , 6 ) = Co(r,6)}
= { ( T , £ ) G R X * : A(-;r,0 is 7J - and 72f-quasibounded} , for every choice of 71 G [ai + 6, fii — S] and 72 G [#2 + £, ^2 — £]• Since the statements concerning periodicity are immediate consequences of The orem 5.1(c), we only have to verify the global Lipschitz continuity of CQ(T, •) for arbitrary T G 1R. To that end, let (COI,CQ3) = CQ : R x X2 —* Xi x X3 denote the components of Co, and let r G R be arbitrary, but fixed. According to the above construction the point (T, Coi(r, £ ) , 6 C O 3 ( T , 0 ) ^ e s D °th on SQ and RQ for arbitrary £ G AV But then Theorem 6.l(b),(d) implies together with (90) for arbitrary £,£ £ ^ 2 the estimates ||C63(T,0
— Cte(r,0|| =
||SO(T,COI(T,0,0-5O(T>^I(TIO>£)II
< C(L) HcbxKO - cta(T,S|| + C(L) ||e - f|| and I M T , 0 - « t a ( r , i ) | | = ||r 0 + (r, 6 c o s ^ O ) - ^ ^ , f, 003^,0)11 < C ( i ) ||cto(r,0 - c t e K f ) | | + C ( i ) |K - fll By means of adding these two estimates we finally arrive at the claimed estimate IMT,£)-Co(T,f)|| < for all r G R and £,£ € X2.
JSa-Hf-fll O
Remark 6.3 7f the mapping ||A(-)|| is locally bounded, then the mappings s~, SQ , TQ , r+ and CQ are even Lipschitz continuous. For the first four mappings this is an immediate consequence of Remark 5.2. As for the mapping Co we only have to note that in the above proof the mapping T is Lipschitz continuous if both SQ and r j are. Now apply (100). O
Bernd Aulbach & Thomas Wanner
102
Although the present section concentrates on the special case of n = 3 coupled equations of the form (88) with /?i < 0 < cti rather than considering the general case as in Theorem 5.1 we recall our initial intention of finding as many integral manifolds of a given differential equation as possible. For this reason — as well as for further reference — we state and prove the following immediate corollary to Theorem 6.1. It shows that under natural conditions a nonautonomous differential equation of the form (83) has (n+2Hn~1) nontrivial integral manifolds, whereas Theorem 5.1 furnishes only 2n — 2 nontrivial integral manifolds. Corollary 6.4 Consider the differential equation i = A(t)x + F(t,x)
(91)
on a Banach space X satisfying the assumptions (Cl) and (C2) with an arbitrary integer n > 2 and 0 < L < 2K2(n-i)(^ + 2 — y/K2 + 4). Then for every choice of I < i < j < n> (hj) T^ (l> n ); there exists a continuous mapping X . . . X <\ j
—y X\
X . . . X irCt'_i X Xj'-|-i
X ... X
Xn
such that the set
Kij := {(r,0 ZRxX
: (U,t>i) = M ^ , < ; ) }
is an integral manifold for (91)15. For 1 < i < n we have the dynamical characteri zations K\ti =
{(T,£)
G R x X : A(-;r,£) is ^-quasibounded\
Ki+i,n =
{(TJO
€ R xX :
A(-;T,£)
,
is j~-quasiboundedj ,
for every choice of 7,- £ [cti + 6, $ — 6], and for l
have
Kij = | ( r , £ ) € R x X : A(-;r, £) is 7JI4- and 7* -quasibounded\ , where 7^-1 6 [«i-i + £, A'-i "~ ^] a7l<^ 7j € [ay + £, /3j — 6] may be chosen arbitrarily. For every t £ K. awrf (i, j ) as a&ove we have fc;j(£,0) = 0, and the mapping fc»j(t, •) is globally Lipschitz continuous with Lipschitz constant
l-C(L)
v y
"
v
'
' ' ' '
6(6-2KL{n-l))
Finally, if the right-hand side of (91) is periodic in t with period 0 > 0, then so are the mappings kitj for all admissible pairs {i,j), and if system (91) is autonomous, then the k{j are independent oft. As for £<j, £>j and &<j recall the notation introduced right before Theorem 5.1.
6. The Classical Five Integral Manifolds
103
Proof: Since the condition on L required in the corollary is stronger than the one in Theorem 5.1, this theorem guarantees the existence of the mappings fcitj and %„, where 1 < i < n and 1 < j < n, together with the desired properties. Now let 1 < i < j < n be arbitrary, but fixed. As in the proof of Theorem 6.1 the integral manifold Kij is constructed by intersecting the manifolds K\j and Ki}UFor this step one only has to notice that the proof of Theorem 6.1 did not make any use of the assumption /?i < 0 < a 2 . O Resembling Corollary 4.3 the following result describes the asymptotic behavior of those solutions which are contained in one of the integral manifolds guaranteed by Corollary 6.4. Corollary 6.5 Consider the differential equation x = A{t)x + F(t,x) on a Banach space X satisfying the assumptions integer n > 2 and 0 < L < 2K^=T)(K + 2~ V # 2 Let y, : 1R —► X be any solution of (92) which Kitj for some (iyj) as in Corollary 6.4- Then for true for every 7 < /?,_! — 6:
(92) (Cl) and (C2) with an arbitrary + 4). is contained in the integral manifold i > 1 the following estimates hold
Similarly, in the case j < n the estimates
j
""W" s S l z £ f j )
1 ll/,(r)l|e,( r) Sori> T
"
-'
are satisfied for 7 > otj + 6'. Proof: Recalling that for arbitrary 1 < i < j < n we have Ki,j = K\,j H Kiiix , the above estimates have to be proved only for the hierarchy manifolds K\tj and KiiT%. For them, however, the estimates follow directly from Corollary 4.3 — keeping in mind the proof of Theorem 5.1. O
104
Bernd Aulbach k Thomas Wanner
We close this section with a discussion of our results in the context of finitedimensional autonomous systems. To this end we consider a differential equation of the form i i = AiXi + F1(xi,x2,x3) x2 = A2x2 + F2(x1, X2,X3) (93) x3 = A3x3 + F3(xi,x2,x3) where the A,-, i = 1,2,3 are matrices in KNixNi with N = Nx + N2 + N3. For the location of the spectra of A\, A2 and A3 in the complex plane we suppose max {ReA : A G a ^ ) } < mm {ReA : A G
< min {ReA : A G a(A3)} .
In words, we assume that all the eigenvalues of A\ lie to the left of the imaginary axis, the eigenvalues of A3 to the right, and the eigenvalues of A2 are located exactly on the imaginary axis. Choosing real constants ai,a 2 ,/?i, A2 such that max {ReA : A G cr(Ai)\ < a x < fa < 0 , 0 < a2 < fi2 < min {ReA : A G {A3)} , we know (from the introduction to Section 4) that the hypothesis (Cl) (cf. the pre vious section) is satisfied for a suitable constant K > 1. If we additionally assume that Fit &2 and F3 satisfy (C2), then all the assumptions of Theorem 6.1 are met and therefore this theorem provides the five classical invariant manifolds (cf. Figure 8):
S~ = {(6,6,6) eKN So = {(6,6,6) eKN Co = {(6,6,6) eKN Rt = {(6,6,6) eKN R+ = {(6,6,6) eK"
(6,6) = 3-«0}, 6 = ^0(6,6)}, (6,6) = co(6)}, 6 = r+(6,6)}, (6,6) = r + (6)},
where 5", SQ , Co, r j and r + are Lipschitz continuous. The following remarks are to illuminate both the names of these invariant manifolds and the reason for assuming /?i < 0 < a2 in the above theorem. In this context we also refer to Remark 6.2. • Stable manifold S~: Due to ax + 8 < 7 l < ft - 6 < 0 and the dynamical characterization contained in Theorem 6.1, all solutions on the stable manifold converge to 0 exponentially as t -^ 00 (in the sense of 7^-quasiboundedness with negative 71).
6. The Classical Five Integral Manifoids
105
• Center-stable manifold SQ : All solutions of (93) which are not growing too fast as t —* oo (in the sense of 72"-quasiboundedness with 0 < cti + S < 72 < @2 — 8) are contained in the center-stable manifold. In particular, all solutions which are bounded as t —» 00 or periodic are contained in SQ . • Center manifold Co: The center manifold consists of those solutions which are contained both in the center-stable and the center-unstable manifold. Particu larly, all bounded and periodic solutions lie in this manifold. • Center-unstable manifold RQ : All solutions of (93) which are not growing too fast as t —> —00 (in the sense of 7f-quasiboundedness with cti-\-8 < 71 < fl\—8 < 0) are contained in the center-unstable manifold. This time, all solutions which are bounded as t —* —00 or periodic lie in RQ. • Unstable manifold R+: All solutions on the unstable manifold converge expo nentially to 0 as t —*■ —00 (in the sense of 7^"-quasiboundedness with 72 such that 0 < a 2 + 6 < 72 < /?2 - 8).
Figure 8: The classical five invariant manifolds Remark 6.6 Since we are free in choosing the constants c*i,^i according to maxJEeA : A € 00 in the sense of 7 + -quasiboundedness for some 7 < 0 (which may depend on the solution \i). We only have to choose #1, /?i and 6 such that 7 € [«i + <S,fi\— 8}. Of course, this way of reasoning is deceiving! The condition on L required in Theorem 6.1 depends on 6 and will force L to approach 0 as /3i and 6 tend to 0. So in general the above-mentioned claim is only true for
Bernd Aulbaci & Thomas Wanner
106
L = 0, i.e. for the unperturbed linear case. It is a good exercise to discuss the simple S-dimensional dynamical system Xi
=
-Xi
x 2 = —Lx 2 X3
=
S3
where Ai = - 1 , A2 = 0, A3 = 1, i 7 i(xi,x 2 ,x 3 ) = -F3(zi,z 2 ,x 3 ) = 0 and 2*2(3:1, $2> £3) = — Lx2) L > 0. Similar remarks apply to the other four types of invariant manifolds. D
7
The Missing Sixth Integral Manifold
We now return to the problem posed at the end of Section 5 for general systems of n equations and at the beginning of Section 6 for the special case n = 3. Because we are going to present a counterexample it is enough to focus attention on the special case of three equations. In this context the question under consideration is, which of the invariant subspaces of the linear system (85) actually survive a small nonlinear perturbation? Prom the results of the previous section we know that all subspaces survive — with only one possible exception, namely the subspace K13 defined in (87). So our problem boils down to the question if .K13 survives as an integral manifold. The answer to this question is no, and the following counterexample which is taken from Aulbach [3] is to confirm this. Example 7.1 We consider the 3-dimensional autonomous differential equation Xi
= -Xi
(94)
x 2 = X1X3 x 3 = £3
Setting Ai := - 1 , A2 := 0, A 3 := 1, /i(xi,x 2 ,x 3 ) := 0, / 2 (xi,x 2 ,x 3 ) := X1X3 and fz{xi,x2,xz) := 0 this equation is of the appropriate form needed for an application of Theorem 6.1, only assumption (C2) is not yet satisfied. To overcome this deficiency we use the following cut-off technique. First of all, we have
lim
\\fi{x)-fi(x
(x,x) — (0,0)
= 0
for i = 1,2,3
X
Thus, for every L > 0 there exists a closed ball Bo(0) C R 3 of radius Q such that for all x, x € Be(Q) and i = 1,2,3 we have
||/l(x) -/,(S)|| < x l k - z l
(95)
7. The Missing Sixth Integral Manifold
107
Now consider the so-called radial retraction re : R 3 —»■ Be(0) denned by X
r(x\-f
for
Nl^c
which for any g > 0 has the global Lipschitz constant 2 (see e.g. Amann [1]). If we define the mappings F, : R 3 -» E. for 8 = 1,2,3 by W*)
■■= fi(re(x))
,
then (95) implies for all x, x G R 3 the estimate \\Fi{x) - Fi(x)\\ =
||/,(rff(x))-/,(r,(x))||
< ^\\re{x)-r0(x)\\
<
L\\x-x\\.
Thus, by appropriately choosing L and g the equation i i = AiXi + F1(x1,x2,x3) x2 = A2x2 + F2(x1,x2,x3) x3 = A3x3-rF3(x1,x2,x3,)
(96)
satisfies the assumptions (Cl) and (C2) (stated prior to Theorem 5.1), and — what is even more important — it coincides with system (94) on Be(0). So in order to prove that equation (96) has no nonlinear analogue to the invariant subspace K\3 of the unperturbed linear equation it suffices to prove the following proposition. Proposition 7.2 For every e > 0 equation (94) has no local invariant manifold of the form K iz = {(zi>0(zi>*3),Z3) G R 3 . XijX3 e ( _ £ > e ) j . , where the mapping g : (—£,e)2 —» R is Lipschitz continuous with #(0,0) = 0. Here local invariance means that every solution fi(t) = (ni(t), {j,2(t), fi3(t)) of (94) starting on the set K^f remains in this set as long as (fii(t),fi3(t)) remains in the domain of g(xi,x3). Proof: Suppose there exists an e > 0 such that a local invariant manifold of the above form K[^ exists. Let £i, £3 G (0, e) be arbitrary, and let n(t) denote the unique solution of (94) satisfying fi(0) = ( f i , 0 ( 6 , 6 ) , 6 ) - It c a n readily be checked that the identity
rit) = (&e-<,<7(6,6) + 66*,6e«) is valid for all t € R. In particular for U '= \ In ^ we then get
108
Bernd Aulbach k Thomas Wanner
and the explicit form of [i(t) given above shows that for all t between 0 and tm we have {fii(t), ^(t)) € (0, e) 2 . Hence the local invariance of K[^ furnishes for these values of t the identity which for t = t+ implies
forall6,6e(0,£).
(97)
Now consider the unique solution v(t) of (94) satisfying v(0) = (0,<7(0,6), 6 ) , where £3 € (0, e) is arbitrary, but fixed. We have v(t) = ( 0 , 0 ( 0 , 6 ) , &e')
for all * <E R ,
so for all t < 0 the solution v(i) stays on if^0. This provides the relation = 0(0,foe1) -» 5(0,0) = 0 as f-► - c o .
9(0,(3) = i*M = 9(vi(t)Mt)) Therefore we have 5(0,6)
= 0 for all & € ( 0 , e ) .
(98)
Similarly it can be shown that 5(6,0) = 0 for all 6 € (0,e). Now choose a sequence (y„)neN in (0, f) converging to 0 as n —* 00. Because of the limiting relation lim n _ +oo 0(y n ,y n ) = #(0,0) = 0 we may assume without loss of generality (after passing to subsequences if necessary) that either we have g(yn, Vn) > 0 for all n 6 N or g(yn, yn) < 0 for all n G N. Let us assume the first case is true and define z := | and zn := ™.. Then for every n £ N we deduce with the help of (97) and (98) that 9(Zn,z)-g{0,z)
9{Zn,z)
zg{yn,yn) = ^ y„ >0
Z ( /
x
2T„2r
zn
n
\
z y2n yn - I n — > —z In— —► 00 as n —> 00 , 2 *2 z
contradicting the presupposed Lipschitz continuity of g(xi,x3) the case g(yn,yn) < 0 for all n £ N one can show that
9(z,zn)-g(z,0)
2
—> —00
This completes the proof of the proposition.
in (0,0). Similarly, in
a s n —> 00 .
O
8. Epilogue
109
The previous proposition shows that in some sense the number of integral man ifolds we have constructed in Sections 5 and 6 is maximal. Recall, however, that we were looking for nonlinear analogues of linear subspaces being defined as graphs of continuous mappings which are Lipschitz continuous on the hyperplanes t = r. If we would change the notion of nonlinear analogue we could discover additional integral manifolds which in fact are homeomorphic images of linear subspaces. Ques tions of this kind can be answered in the context of topological equivalence and the Hartman-Grobman theorem which we briefly address in the next section.
8
Epilogue
Coming to the end of this lecture does not mean that the topic treated here has been exhausted. Quite the opposite is true, we just have reached a new starting point. To make this clear we briefly describe the possible applications of our results which — to a large extent — can be found in the forthcoming paper [4]. For the special case of continuous ^-dependence we refer to Hilger [15] and Wanner [24] and for the finite-dimensional autonomous case we mention the book of Kirchgraber and Palmer [19]In the present paper we have considered a class of differential equations admitting the trivial solution. Under suitable conditions on the linear and the nonlinear part of this equation we have constructed first a pair and later a so-called hierarchy of integral manifolds intersecting along this trivial solution. In a first step it next can be shown that — without any additional assumptions — a corresponding pair or hierarchy of integral manifolds exists through any solution of the given equation. This leads to a vast and boundless set of integral manifolds crowding the extended phase space of the system. However, by means of a suitable equivalence relation one can gain some overview which in fact leads to the observation of a structure perfectly representing the complete dynamics of the given equation in terms of two geometric foliations of the extended phase space. Exploiting this geometric constellation it is then possible to obtain detailed information about the asymptotic behavior of all solutions, in particular one gets the so-called reduction principle which for finitedimensional autonomous systems has been established by Pliss [22] and Kelley [18], and for nonautonomous systems by Aulbach [2]. Furthermore, the precise information about the dynamically adapted decomposition of the extended phase space makes it possible to construct topological mappings which allow first to decouple the original system into independent subsystems and then to linearize some or all of the resulting subsystems. Depending on the assumptions we then arrive at the generalizations of the theorems of Hartman-Grobman-type (cf. Grobman [10, 11], Hartman [12, 13, 14], Palmer [20, 21] and Sositaisvili [23]) to our general nonautonomous setting in Banach spaces. Finally, we want to drop a few words about "real world" applications of the results obtained in the present paper and the announced continuation [4]. The global
Bernd Aulbaci k, Thomas Wanner
110
assumptions we impose on the equations underlying our investigations are literally never satisfied by an equation coming from whatever applications. However, by means of suitable cut off techniques — as demonstrated in Section 7 — it may be possible to obtain some local insight into a "real world" problem from our "purely academic" global study.
Appendix In the following two sections we collect some results from analysis and nonlinear functional analysis. Most of these results are not stated in greatest possible generality, but according to the use within these notes.
A
Strong Measurability and the Bochner Integral
The primary object of the integration theory for real valued functions (see e.g. Cohn [5, Chapter 2]) are the so-called measurable functions f : M —» R defined on some measurable space (M, A4) 1 6 . With respect to pointwise addition and multiplication by a scalar the set of measurable functions becomes a linear space which is closed under the formation of pointwise limits, i.e. if (/ n )neN is a sequence of measurable functions fn : M —■> R such that lim /„(x) = f(x)
for all x € M
n—*oo
for some function / : M —*■ R, then / is measurable as well (cf. Cohn [5, Proposition 2.1.4]). If in addition there is a measure /i on the measurable space (M, M), then (M, A4,//) is called a measure space17 and it is possible to introduce a notion of integrability. Roughly speaking, this is accomplished by first defining the integral for certain simple functions in the obvious way 18 , and then by suitably approximating a measurable function / by a sequence (/T»)T»€N of simple functions and defining the 16
Recall that a measurable space (M, M) consists of a set M together with a family M. of subsets of M forming a cr-algebra, i.e. the family M contains M, for every A € M. the set theoretic complement M\A belongs to M, and for every sequence (A„)n€N of elements of M the union \J^=lAn is contained in M. A prominent example of a measurable space is the set M of real numbers equipped with the Borel a-algebra B, which is the smallest K is called measurable if for every set B G B the preimage f-1(B) is contained in M. 17 A measure n on a measurable space (M, M) is a mapping \i : M. —► [0, oo] such that /i(0) = 0 and that /i is countably additive, i.e. for any sequence (An)nEn of disjoint sets An 6 M one has /i(U~ =1 4„) = E ^ r i / ' U n ) - For the measurable space (M, B) the most important measure is the Lebesgue measure X defined by the identity A([a, b)) := b — a for any a, b E K with a < b. 16 A function / : M — ► M is called simple if it is measurable and admits only finitely many values, i.e. if one has f(x) = £)f=1 at • XAi(x) for certain a,- G M and A,- € M. The function / is called iniegrable if £,* =1 |aj| • p(Ai) < oo and the integral of / is defined by / fd/j, := £ ? _ , Oj • ft(AA.
Appendix
111
integral of / as the limit of the integrals of the / „ , provided this limit exists. (For more details we refer to the book of Conn [5].) Of course, for many applications it is not sufficient to integrate only real-valued functions. One would like to replace the set R by some more general space. For the case of mappings / : M -► X taking values in a finite-dimensional Banach space X it is very easy to extend the notion of integrability. To this end one just has to choose a basis {xit...,xn} of X and define the real-valued component mappings /, through the relation n x
f( )
='■ E fi(x) ■ *i for x € M . «=i
Then / is called measurable or integrable, if all of the mappings /, are measurable or integrable, respectively, and the integral of / is defined by
However, if we consider functions with values in infinite-dimensional Banach spaces X, the situation becomes somewhat intricate. This is mainly due to the following two facts: • Let (/n)n€N denote a sequence of simple mappings /„ : M —> X converging pointwise to a mapping / : M —> X. Then the image f(M) of the mapping / is contained in the closure of the union U^L 1 /„(M) of the images of the mappings /„. According to the simplicity of the / „ , the sets fn{M) are finite, and this in turn implies the countability of the set U™=1fn(M). Consequently, the image / ( M ) is separable, i.e. it contains a dense countable subset. • If the mappings f\,J2'.M^X are measurable 19 then their sum / i + fi is not necessarily measurable any more (see the example in Cohn [5, Appendix E, Exercise 2]). As the first observation demonstrates, a mapping / whose image /(M) is not separable cannot be approximated by simple mappings. On the other hand, the second obser vation shows that the set of measurable mappings from M to an infinite-dimensional Banach space in general is not even a linear space. With these remarks in mind it is obvious that in order to develop an integration theory for mappings with values in a (not necessarily finite-dimensional) Banach space one has to replace the class of measurable mappings by a different, more adequate class of mappings. This partly motivates the following definition. 19
In the Banach space X we always choose the Borel a-algebra B generated by the open subsets of*.
Bernd Auibaci & Thomas Wanner
112
Definition A . l Let (M,M) be o measurable space, X an arbitrary Banach space and B the smallest a-algebra in X containing all open subsets of X. Furthermore, let f be a mapping from M to X. Then (a) f is called measurable if for every set B 6 B the preimage f~x(B)
is an element
ofM, (b) f is called strongly measurable if f is measurable and the set f{M) i.e. if f(M) contains a dense countable subset, (c) f is called simple if f is measurable and has only finitely many
is separable,
values.
Obviously, every simple mapping is strongly measurable. Moreover, if X is a separable Banach space — which is particularly true if X is finite-dimensional — then a mapping is measurable if and only if it is strongly measurable. If the set M even has a topological structure we get the following result. L e m m a A. 2 Suppose M is a separable topological space, M. its Borel a-algebra and X an arbitrary Banach space. Then every continuous mapping f : M —* X is strongly measurable. Proof: Since every continuous mapping is measurable with respect to the corre sponding Borel (T-algebra, we only have to prove the separability of f(M). To this end choose any dense countable subset S of M, let x € M be arbitrary and set y := f(x) 6 f{M). Furthermore, let V C X denote an arbitrary open neighborhood of y. Then according to the continuity of / the preimage / _ 1 ( V ) C M is an open neighborhood of the point x, so there is an element x* G S fl / - 1 ( V ) . This in turn implies f(x*) 6 f(S) D V, and therefore the countable set f(S) is dense in f(M). This completes the proof of the lemma. <> The following proposition shows that the set of strongly measurable mappings has all the nice properties we described above for real-valued measurable functions. P r o p o s i t i o n A . 3 Let (M,A4) be a measurable space and X an arbitrary space. Then the following holds true:
Banach
(a) The set of strongly measurable mappings from M to X is a linear space with respect to pointwise addition and multiplication by a scalar. (b) The set of strongly measurable mappings from M to X is closed under the formation of pointwise limits. (c) If f : M —► X is strongly measurable then there exists a sequence ( / „ ) „ € N of simple mappings fn:M^X which converge pointwise to f and satisfy the estimate H/nWH < H/WII for all xeM.
Appendix
113
Proof: See Cohn [5, Propositions E.l, E.2, Corollary E.3].
O
Now we are able to define the notion of integrability for strongly measurable mappings. Definition A.4 Let (M,M.,fi) be a measure space and X an arbitrary Banach space. Then a strongly measurable mapping f : M —> X is called (Bochner) integrable if the real-valued mapping \\f\\ is Lebesgue-integrable. In this case, the (Bochner) integral of f is defined in the following way: (a) Assume first that f is a simple mapping, i.e. we have n x
f( )
= Z) a » *
XAM
for all x £ M ,
for certain a{ £ X and At € M, i — 1 , . . . ,n. Then Proposition 2.3.9 in Cohn [5] implies (J,(Ai) < oo for every i, and we define the integral of f by I fdfj, := ^2ai-n(Ai)
.
(b) For general f we choose a sequence of simple mappings fn according to Proposition A.3(c). Then Lebesgue's dominated convergence theorem for realvalued functions (cf. Cohn [5, Theorem 2.4-4]) provides the limiting relations lirn^oo / ||/ n - f\\dfi = 0 and limn,™^ / ||/ n - fm\\dfj, = 0. Because of I fndfjL - J fmdfi
=
I (/„ - fm)d(i
< I \\fn - fm\\dfi
this implies that the sequence (/ / n ^ ) n e N *5 a Cauchy sequence in the Banach space X, and we may define the integral of f by
J ffy := ]xmj fndp (The reader may easily check that the so-defined integral f fd\i does not depend on the choice of the sequence (/n)n€N•) In the literature the above-defined integral is called Bochner integral. However, since we are not using any other notion of integral in this report we omit the prefix "Bochner". The following proposition collects some basic properties of this integral. Proposition A.5 Let (M,M,fi) space. Then the following holds:
be a measure space and X an arbitrary Banach
(a) If f and g are integrable mappings and a. and fi are scalars (from K = M. or K =
Bernd Auibacii & Thomas Wanner
114
(b) If f is an integrable mapping, then the following estimate holds true:
Jfd?\
< J\\f\\dii.
Proof: See Cohn [5, Propositions E.4, E.5].
O
The next result shows how Lebesgue's dominated convergence theorem reads in our Banach space setting. Proposition A.6 Let (M,M,fi) be a measure space and X an arbitrary Banach space. Furthermore, let g : M —► [0, oo] be integrable and let (/n)r»eN be a sequence of strongly measurable mappings from M to X converging pointwise to some mapping f : M —* X. Finally assume that the estimate
H/nWII < g(x) is valid for almost all x G M and all n € N. Then the mappings f and / „ , n E N are integrable and one gets the identity / fd/j, = lim / fn dfi . J
n-too J
Proof: See Cohn [5, Theorem E.6].
B
O
Banach's Fixed Point Theorem and Related Re sults
In this section we describe the fixed point theorems which are used in this article. We begin with the well-known fixed point theorem of Banach, whose simple proof will be given for the sake of completeness. Theorem B . l (Banach's Fixed Point Theorem) Suppose X is a Banach space and T : X —» X a contraction, i. e. we have \fTxi-TxtW
< c\\Xl-x2\\
for all xux2£X
,
where 0 < c < 1 is some real constant. Then T has exactly one fixed point in X. Proof: Let x 0 € X be arbitrary, but fixed, and define a sequence (z n ) n6 N 0 in X recursively by xn+i := Txn for all n € N0 .
Appendix
115
Then for arbitrary m, n £ No with m > n we get m—1
m-1 c
n
x
||xm-a?„|| < J 3 ll*t+i-*l|| < S i l i i=n
_a:
o | | < r—-||xi-rc0|| • i
i=n
C
Hence, because of lim^oo c* = 0, the sequence (x„)n€N0 iS a Cauchy sequence and since X is complete it has a limit x £ X. Observing that T is continuous we now deduce from the above definition of the sequence (z„)r»eN0 the identity x = lim xn+i n—»oo
= lim Txn = T lim xn = Tx , n—»oo
n—*oo
i.e. i is a fixed point of T. In order to conclude the proof of the theorem let y denote an arbitrary fixed point of T. Then we have \\x-y\\
= \\Tx-Ty\\
<
c\\x-y\\,
and due to 0 < c < 1 this implies ||x — y|| = 0, i.e. y = x.
O
For contractions on Banach spaces the above theorem guarantees a unique fixed point. But beyond this fact, what can be said if this contraction depends continuously on some parameter? Does the fixed point depend continuously on the parameter, too? This situation frequently occurs in this report and the desired positive answer is stated in the following theorem. Theorem B.2 (Uniform Contraction Principle) Let X be a Banach space, V a topological space and T : X x V —+ X a continuous mapping. Suppose in addition that T is a uniform contraction, i.e. assume that for all xi,x2 G X and p EV we have \\T(xup)-T(x2,p)\\
< c\\x1-x2\\,
(99)
where 0 < c < 1 is some real constant. Then for every p G V there exists a unique fixed point f(p) € X of the mapping T(-,p) : X —> X and the so-defined mapping f : V —> X is continuous. Proof: In view of the preceding theorem we only have to verify the continuity of / . To this end, let p,po £V be arbitrary. Then we have II/W-/WH \\T(M,p)
= \\T(f(p),p)-T(f(p0),po)\\
<
~ T(/(pd),rtH + \\T(f(jpo),p) ~ T(f(Po),Po)\\
c 11/00 - / M i l + \\T(f(Po),p)
<
- T(/(p 0 ),Po)||
and consequently H / t o - / M i l < j - ~ \\T(f(Po),p)
- T(/MMII •
(100)
Bernd Aulbach & Thomas Wanner
116
The continuity of T implies \\T(f(po),p)-T(f{po),p0)\\ -> 0 as p -> p 0 , and therefore \\f{p) — f(Po)\\ —► 0 as p —► p0- This implies the continuity of / . In these notes the uniform contraction principle will be applied repeatedly with great advantage. However, in certain situations it is too weak, as e.g. in the proof of existence and uniqueness of the cocycle of a parameter dependent differential equation (cf. Theorem 2.4). Although the contraction property (99) is valid for the mapping occuring in this proof, Theorem B.2 cannot be applied since the inequality c < 1 is not satisfied in general. Nevertheless, this mapping has a unique fixed point according to the following theorem which is taken from Daleckii & Krein [7, pp. 52f ]. Before stating and proving this result, we first have to introduce the following notion. Let T : X x V —> X be an arbitrary mapping. Then the n-th iterate Tn : X x V -> X is defined for all (x,p) £ X x V recursively by Tn, 1 [X P)
'
x ._ f T(x,p) n - \ T{T -\x,p),p)
for n = l for n > 2 .
(iUij
It is easy to see that for all n > 2 we get the identity
Tn(T(x,P)iP) = Tn+1(x,P) . Theorem B.3 Let X be a Banach space, V a topological space, and T : X x V —> X a continuous mapping. Suppose there exists an n € N and a constant 0 < c < 1 such that for all rci,X2 G X and p £ V the inequality ||T"(xllp)-2,"(»alp)|| <
c||si-zs||
is satisfied. Then for every p € V there exists exactly one fixed point f(p) of the mapping T(-,p) : X —> X, and the so-defined mapping f : V —► X is continuous. Proof: By induction the continuity of Tn follows easily from the continuity of T. Applying the uniform contraction principle (Theorem B.2) to Tn yields a unique fixed point f{p) of Tn(-,p) for every p £ V, and the mapping / is continuous. It remains to be shown that f(p) is the unique fixed point of T(-,p). First of all, the above definition of the n-th iterate implies Tn(T(f(p),p),p)
= Tn+1(f(p),p)
= T(Tn(f(p),p),p)
since f(p) is a fixed point of Tn(-,p). Hence, T(f(p),p) and the uniqueness of this fixed point implies
= T(f(p),p)
,
is also a fixed point of T n (-,p)
r ( / ( p ) , p ) = f(p) ■ Thus, f{p) is a fixed point of T(-,p). Finally, let x be an arbitrary fixed point of T(-,p). By means of induction it follows immediately that T"(x,p) = x, i.e. x is a
O
117
References fixed point of Tn(-,p) as well, implying x = f(p). theorem.
This completes the proof of the O
The continuity of the mapping T : X xV —> X is a crucial prerequisite in Theorems B.2 and B.3. In order to make the verification of this continuity as simple as possible, the following lemma is frequently used throughout these notes. Lemma B.4 Let X and y be Banach spaces, V a topological space, and T : X x V —> y a mapping with the following properties: (1) There exists a constant c > 0 such that the inequality \\T(xup)-T(x2,p)\\
< cllsj-sall
holds for all Xi, x2 G X and p G V. (2) For every x G X the mapping T(x, •) : V —> y is continuous. Then T is continuous. Proof: Let xo G X and po G V be arbitrary, but fixed. Then the estimate
||r(*,ri-T(«o,*0|| < \\T(x,p) - T{x0,p)\\ + \\T(x0,p) - T(x0lPo)\\ c\\x-xo\\ + \\T(x
<
together with (2) implies T(x,p) -* T(x0,p0)
as
(xtp) -> (x0lpo) .
Hence, T is continuous in the arbitrarily chosen point
(XQ,PO)
G X x V.
O
References [1] H. Amann, Ordinary Differential Equations : An Introduction to Nonlinear Anal ysis (De Gruyter Studies in Mathematics, Volume 13). De Gruyter, Berlin - New York (1990). [2] B. Aulbach, A reduction principle for nonautonomous differential equations. Archiv der Mathematik 39 (1982), 217-232. [3] B. Aulbach, Hierarchies of invariant manifolds. Journal of the Nigerian Mathe matical Society 6 (1987), 71-89. [4] B. Aulbach, Th. Wanner, The Hartman-Grobman theorem for Caratheodory type differential equations in Banach spaces. Preprint, University of Augsburg (1996).
118
Bernd Aulbach k Thomas Wanner
[5] D. L. Conn, Measure Theory. Birkhauser, Boston - Basel - Stuttgart (1980). [6] B. D. Craven, Lebesgue Measure and Integral. Pitman, Boston - London - Mel bourne - Toronto (1982). [7] J. L. Daleckii, M. G. Krein, Stability of Solutions of Differential Equations in Banach Space (Translations of Mathematical Monographs, Volume 43). American Mathematical Society, Providence, Rhode Island (1974). [8] K. Deimling, Ordinary Differential Equations in Banach Spaces (Springer Lec ture Notes in Mathematics 596). Springer, Berlin - Heidelberg - New York (1977). [9] J. Dieudonne, Foundations of Modern Analysis (Pure and Applied Mathematics, Volume 10-1). Academic Press, New York - London (1969). 10] D. M. Grobman, Homeomorphisms of systems of differential equations. Doklady Akademii Nauk SSSR 128 (1959), 880. 11] D. M. Grobman, The topological classification of the vicinity of a singular point in n-dimensional space. Math. USSR-Sbornik 56 (1962), 77-94. 12] P. Hartman, A lemma in the theory of structural stability of differential equations. Proceedings of the American Mathematical Society, 11 (1960), 610-620. 13] P. Hartman, On the local linearization of differential equations. Proceedings of the American Mathematical Society 14 (1963), 568-573. 14] P. Hartman, Ordinary Differential Equations. Birkhauser, Boston - Basel Stuttgart (1982). 15] S. Hilger, Ein Mafikettenkalkul mit Anwendung auf Dissertation, Universitat Wurzburg (1988).
Zentrumsmannigfaltigkeiten.
16] M. W. Hirsch, S. Smale, Differential Equations, Dynamical Systems, and Lin ear Algebra (Pure and Applied Mathematics, Volume 60). Academic Press, San Diego (1974). 17] A. Kelley, The stable, center-stable, center, center-unstable, unstable manifolds. Journal of Differential Equations 3 (1967), 546-570. 18] A. Kelley, Stability of the center-stable manifold. Journal of Mathematical Anal ysis and Applications 18 (1967), 336-344. 19] U. Kirchgraber, K. J. Palmer, Geometry in the Neighborhood of Invariant Man ifolds of Maps and Flows and Linearization. Pitman, London (1991).
References
119
[20] K. J. Palmer, A generalization of Hartman's linearization theorem. Journal of Mathematical Analysis and Applications 41 (1973), 753-758. [21] K. J. Palmer, Linearization near an integral manifold. Journal of Mathematical Analysis and Applications 51 (1975), 243-255. [22] V. A. Pliss, Principle reduction in the theory of the stability of motion. Izv. Akad. Nauk S.S.S.R., Mat. Ser. 28 (1964), 1297-1324 (Russian). [23] A. N. Sositaisvili, Bifurcations of topological type of a vector field near a singular point. Trudy Sem. Petrovsk. 1 (1975), 279-309. [24] Th. Wanner, Invariante Faserbundel und topologische Aquivalenz bei dynamischen Prozessen. Diplomarbeit, Universitat Augsburg (1991). [25] Th. Wanner, Zur Linearisierung zufalliger dynamischer Systeme. Dissertation, Universitat Augsburg (1993). [26] Th. Wanner, Linearization of random dynamical systems. In: C.K.R.T. Jones, U. Kirchgraber, H.-O. Walther (eds.), Dynamics Reported, Volume 4, pages 203269, Springer, Berlin - Heidelberg - New York (1995). [27] Th. Wanner, Qualitative behavior of random differential equations. Proceedings of the "Fifth International Colloquium on Differential Equations", Plovdiv, Bul garia, 18.-23. August 1994. [28] E. Zeidler, Nonlinear Functional Analysis and its Applications, Volume I: FixedPoint Theorems. Springer, New York - Berlin - Heidelberg - Tokyo (1986).
CONTROL THEORY A N D DYNAMICAL
F R I T Z COLONIUS
SYSTEMS
W O L F G A N G KLIEMANN
Institut fur Mathematik Universitat Augsburg 86159 Augsburg, Germany
Department of Mathematics Iowa State University Ames, Iowa 50011 USA
ABSTRACT. Control systems can be considered as dynamical systems on the space U x M , where U is the set of admissible control functions, and the manifold M is the s t a t e space of the control system. This point of view allows us to study in this survey paper single trajectories depending on the control and the initial value, and it results in a number of connections between control theory and the theory of dy namical systems. On the one hand, one obtains new results for control theoretic questions, on the other hand one finds new (explicit) examples for many concepts in dynamical systems. Of particular importance are concepts like topological transitiv ity, chain recurrence, limit sets, Morse decompositions, linearized flows, subbundle decompositions and spectral theory (Lyapunov exponents), and their control theoretic analogues. This approach also yields, among others, new perturbation theorems for ordinary differential equations. We will study in detail applications to the (feedback) control about hyperbolic fixed points and the controllability around the attractor in the Lorenz equations ('control of chaos').
1. Introduction The analysis of complex behavior in dynamical systems has made rapid progress in the last years, and it has attracted considerable interest with mathematics (and also general scientific) audiences. In the center of this analysis is the study of nontrivial limit behavior (attractors, fractals, ergodic and entropy theory) and its parameter dependence (bifurcation theory, perburbation theory). The recent text books of Mane [62], Ruelle [75], and Schuster [77] illustrate these points. If a dynamical system (in continuous time) is given as an ordinary differential equation x = XQ(X), one can consider a family of differential equations m
i=Xo(«)+ £ ««(*)**(*).
(1)
t=l
1991 Mathematics Subject Classification. 93C10, 93B, 58F. Key words and phrases, topological transivity, chain recurrence, Morse decompositon, lin earized flows, Lyapunov exponents, feedback construction, control of complex behavior. Research supported in part by DFG grants C o l 2 4 / 6 - l and C o l 2 4 / 8 - l , NSF grant DMS 8813976, and O N R grant no. N00014-93-1-0868. 121
122
FRITZ COLONIUS AND WOLFGANG KLIEMANN
where the X{t i = 1 . . . m are vector fields, and the u,, i = 1 . . . m are functions with values in R, i.e. (u,-)i=i...m = u G U := {u: R -► U C R m } . T h e additional t e r m on the right hand side of (1) can be interpreted in different ways, leading to different but closely connected mathematical problems: (i) as global, time dependent perturbations of an ordinary differential equation by the vector fields X\ ... Xm. Here the perturbation is given, a n d one wants to study the limit behavior of the trajectories of (1) for t —> oo relative to the limit behavior of x = Xo(x). For u G U time invariant and small one obtains the typical setup of perturbation theory. (ii) as control, where the vectorfields X\ . . . Xm determine the input structure and U C Rm is the given control range. Here the problem is to choose among the admissible control functions u € U one function in such a way that the system (1) has a particular behavior, e.g. reachability of a point y starting from x, stabilization at a fixed point or a periodic trajectory, sometimes with additional properties. (iii) as parameter uncertainty, where the question is e.g.: Given X\ .. . X m , how large can the uncertainty range U be, such that a stable fixed point of the "nominal system" x = X0(x) remains stable? This problem can be combined with (ii): Consider the equation x = Xo(x) + Et/j(tf)Jfj(x) + *Evj(t)Yj(x), where the second term on the r.h.s. describes the control, the third term is the parameter uncertainty. Now we can study the question, for which uncertainty range V C R n , i.e. (vj)j = 1 ,..., n G V = {v: R -> V C R n } is there a u G U, such that the system with this control u is stable for all v G V (stabilization of uncertain systems). (iv) as stochastic process, e.g. as "white noise", leading to an ltd stochastic dif ferential equation. Here one can discuss e.g. questions about the existence of a stationary (ergodic) solution, about the law of large numbers, large deviations, etc. In this paper we will discuss in particular the aspects (i) and (ii), and its relations to the theory of dynamical systems. The interpretation of (1) as a dynamical system (control flow) is the starting point of the analysis, which will lead, among others, to two quite close connections between control and chaos. W i t h respect to (iii) and (iv) a few short remarks must suffice here. The ergodic theory of Markov stochastic processes, e.g. as solutions of stochastic differential equations, has always been developed in close vicinity to the ergodic theory of dynamical systems (cp. e.g. Ventcel [93] and Maiie [62]) by analyzing the limit behavior of Markov transition semigroups on the corresponding function spaces. The so-called support theorem for stochastic differential equations (cp. Stroock and Vaxadhan [90], Kunita [56],[57]) allows furthermore, to associate the trajectories of a diffusion process with those of a control system, and to characterize in a control theoretic way the supports of transition probabilities or of invariant mea-
CONTROL THEORY AND DYNAMICAL SYSTEMS
123
sures, see K u n i t a [57] or Kliemann [54] and the domains of multistability, Colonius et al. [33]. For certain problems, like the exponential convergence of trajectories, the analysis of transition probabilities or invariant measures on the state space is too rough (see Baxendale [7]). Here the dynamics in form of the induced stochastic flow (random dynamical system) plays a crucial role: To study exponential convergence, one linearizes the stochastic system over a stationary solution, and characterizes it locally using the theorem of Oseledec [67] and associated invariant manifolds (see e.g. Ruelle [73], Carverhill [18], Boxler [16], Dahlke [40]). In the same way, by associating stochastic flows and control flows, one can clarify the fine structure of invariant measures etc. (Colonius and Kliemann [24]), also for non-Markov sto chastic systems. In this approach, Markov processes are characterized by certain measurability and hyperbolicity properties (Crauel [36]," [37]). All in all, these few remarks concerning (iv) show the close proximity of approaches for the analysis of the long term behavior of stochastic, dynamical , and control systems. Many more detailed results can be found in the conference proceedings [3] and [71]. Meanwhile, a consistent stochastic bifurcation theory (Arnold and Boxler [2], Boxler [17]), a theory of stochastic normal forms (Arnold and Kedaj [4]) and entropy theory (Bogenschiitz [10]) has been developed on the basis of stochastic flows, see also Arnold Concerning (iii), just a few remarks shall suffice, since a theory of nonlinear systems with uncertain parameters is still in its infancy. In uncertainty theory, the state or output of a system are affected in a noticable way (which is different from the problem of disturbance decoupling), but for stability or stabilization the entire, uncertain system is to remain stable. This leads to a worst case analysis: If one knows in a system the growth behavior with respect to all possible uncertainties about, say, a fixed point, then the maximal (exponential) growth rate determines, whether the uncertain system is stable at this point. For linear systems, such considerations are made e.g. in H°° theory, (see e.g. Francis [43], Doyle et al. [42]), or by Hinrichsen and Pritchard [49], Rotea and Khargonekar [72], and Townley and Ryan [92]. See also Knobloch et al. [55] for an exposition of linear H°° theory and an approach to the nonlinear counterpart. Precise results are obtained by using the Lyapunov exponents of the associated control flow, see [22],[28],[34]. In the case of stochastic uncertainties one can analyze again a control system, and the connections are described using the theory of large deviations, see Arnold and Kliemann [5] and Colonius and Kliemann [22]. In this paper we will treat the system (1) in particular with respect to (i) and (ii), i.e. from a control theoretic and perturbation point of view. It will become clear t h a t control theoretic aspects are also crucial for (i), together with an analysis of (1) as a dynamical system (control flow). In various ways connections between control systems and complex dynamics will show up: On the one hand, controllable systems themselves are "chaotic", i.e. they have a dense set of periodic points, are topologically mixing and transitive, and show
124
FRITZ COLONIUS AND WOLFGANG KLIEMANN
sensitive dependence on initial conditions. (The fact t h a t an embedded chaotic behavior helps in controlling a system, is emphasized also in some applications, see e.g. O t t et al. [66] or Shinbrot et al. [85].) We will introduce in Section 2., after the discussion of some basic control theoretic questions, the concept of control flows, and relate control theoretic concepts to those from the theory of dynamical systems. This will allow for a finer analysis of control systems t h a n the usual reachability and controllability sets. Using those concepts and a weak form of local accessibility, we will analyze the limit sets of control systems in Section 3. As applications we obtain. • Generically the limit sets of globally perturbed ordinary differential equa tions are contained in certain control sets, in which the periodic points are again dense. "Generic" is understood here in the strong, topological sense of "valid on an open and dense set". Genericity results of this kind are rather rare in the theory of dynamical systems (they hold e.g. for the hyperbolicity of linear systems, or for Peixoto-systems on 2-manifolds, see [69]), where one often has to settle for statements on residual sets (see e.g. Kupka-Smale sys tems, Pugh's closing lemma, Lyapunov regularity in the sense of Oseledec). For small perturbations this result can be strengthened to include the re lation with the finest Morse decomposition of x — XQ(X). One obtains a topological analogue to the measure theoretic result of Ruelle [74], which says that dynamical systems under small stochastic perturbations live basi cally on attractors. •
Chain recurrent components of ordinary differential equations x = XQ(X) can be steered to periodic solutions, which can be chosen arbitrarily in the control sets that belong to these components. This result is closely related to the 'control of chaos', as described e.g. in O t t et al. [66] or Shinbrot et al. [85], see also experiments in Ditto et al. [41]. Here we present as an example the controllability of the (chaotic) attractor in the Lorenz equation.
The last Sections 6. and 7. are devoted to the discussion of linearized systems on the tangent and the projective bundle. They show, on the one hand, how the control structures on these bundles are related to Morse decompositions (and we obtain a new class of examples, for which finest Morse decompositions exist); on the other hand, we develop a spectral theory for control systems and discuss connections with other spectral concepts. Applications of this theory to stabilization of bilinear systems, and to linear feedback systems with bounded feedback again show how one can utilize the ideas and techniques developed here to answer classical control theoretic questions — results in this direction can be found e.g. in [22], [31], [46]. Furthermore, robust feedback design for nonlinear systems can be based on the detailed analysis of the linearized system and on the global structure of (1) using
CONTROL THEORY AND DYNAMICAL SYSTEMS
125
invariant manifolds. 2. C o n t r o l S y s t e m s a s D y n a m i c a l S y s t e m s In the following, we consider a family of differential equations m
x = X0(x)
+ ^2 Ui(t)Xi(x)
(2.1)
on a Riemannian C°° manifold M , with dim M = d < oo. Here the Jf,, i = 0 . . . m are C°° vector fields and as functions U{ we take (ui)j=i... m = u E W : = { u : R ^ U C R m , locally integrable}. We assume that (2.1) has a unique solution (0, x, u) = x and being defined for all t E R. If one interprets (2.1) as a control system, the first important question is that of reachability, i.e. denote by 0+(x)
= {y E M ; there is u E U and t > 0 with y>(<, x, y) = y}
the positive orbit (reachable set) from x G M , and analogously by 0~{x)
= {yG M ; there is u 6 i/ and < < 0 with y>(tf,x,u) = y} = {y 6 M ; there is u E U and t > 0 with <^>(t, y, u) = x}
the negative orbit, then we are looking for conditions such that, given x, y G M , we have y E C? + (x) (or x E (9~(y)). Problems concerning reachability under additional assumptions, like stability, optimality, etc., can be treated once some basic results in this direction are obtained. In general, the answer to this question is very difficult. For linear systems of the form x = Ax + Bu in Rd with U = Rm a satisfactory criterion can be given (Kalman's controllability rank condition): (2.2) is completely controllable (for all x , y E R d ) iff rank {B,AB,..., Ad~1B) = d. T h e proof simply uses the explicit solution of (2.2) (variation of constants for mula) and the Cay ley-Hamilton theorem. If the rank of the reachability matrix (B, AB,..., Ad~lB) < d, one can steer x into y, if b o t h points are in the smallest A-invariant subspace of Kd which contains i?, i.e. in the linear space generated by the columns of the reachability matrix. Complete controllability of linear systems (with U = R m ) is equivalent to a seem ingly weaker condition, namely int 0+(x) ^ <j> for all x E Rrf (accessibility), where 'int' denotes the interior of a set. The equivalence is proved via the observation t h a t accessibility holds iff the Lie-algebra
C = CA{Ax + Bu; ue Rm} = CA{Ax, 6 l t ..., bm}
126
FRITZ COLONIUS AND WOLFGANG KLIEMANN
has rank d for all x £ Rd. (Here the 6 1 , . . . , 6 m are the columns of B, and for a set H of vector fields CA{H] denotes the Lie algebra generated by the elements of H.) For x = 0 this is exactly Kalman's criterion. In this sense accessibility and controllability are the same for linear systems (2.2). In the case of nonlinear systems (2.1) there is a gap between these two concepts: accessibility does not imply controllability. The accessibility problem is very well understood these days with the help of geometric control theory: A somewhat sharper version (local accessibility, i.e. for all neighborhoods N C M of x and all t > 0 it holds that int 0 0) can be described again by a Lie algebraic criterion, namely C = CA{X0
+ S u j X i ( x ) ; (ui) = u £ U] has rank d for all x £ M.
(These are the theorems of Frobenius [44] and Chow [20].) If C has the maximal integral manifolds property then the state space of (2.1) can be reduced to such a maximal integral manifold, since these are invariant for (2.1), and there the above Lie-algebraic condition holds, see e.g. Sussmann [88]. If the Lie-algebra C is not integrable, the orbits of (2.1) in M are still immersed submanifolds; however, one has to give up the connection between accessibility and the rank criterion. For complete controllability there is — under the assumption of accessibility — a series of sufficient conditions, all of which use specific properties of the system's vector fields, see e.g. the textbooks of Isidori [51] or Nijmeijer and van der Schaft [65]. However, in general this property is not even satisfied for relatively simple classes of systems, such as systems on the unit sphere S d _ 1 C K d , which are obtained as projections of linear systems in R d onto S r f - 1 , cp. Section 6. Therefore it is important to clarify the control structure of accessible systems, i.e. to identify those regions in M , where any two points are reachable from each other. At least on compact manifolds, or in compact, invariant sets of (2.1), such regions always exist. For the rest of this paper we always assume (local) accessibility, i.e. dim CA{X0
+ XuiXi]
(ui) = u£ U}(x) = d for all x £ M
(H)
holds, and also U C R m is compact and convex. 2 . 1 . D e f i n i t i o n . A set D C M is a control set of (2.1) if (i) D C ciO+{x) for all x £ JD, (ii) for all x £ D there is u £ U with ip(t, x,u) £ D for all t £ R, (iii) D is maximal (with respect to set inclusion) with the properties (i) and (ii). (Here 'c^' denotes the closure of a set.) In the context of control theory, in particular for the construction of suitable feedback laws, only those control sets D play a role, for which int D ^ holds. For
CONTROL THEORY AND DYNAMICAL SYSTEMS
127
these control sets (ii) is automatically satisfied, and we have furthermore: Control sets are pairwise disjoint, connected, ci{int D) = c£ D, and int D C G+(x) for all x £ D, i.e. each point in int D is precisely reachable from any point in D. Besides controllability the concept of limit sets is crucial for the analysis of the long term behavior as t —* ± 0 0 , such as stability, global perturbations, control of complex behavior. For this aspect, a study of the control sets is, in general, not sufficient: Reachability is a finite time concept, i.e. y is reachable from x if there i s u G W and t > 0 with 0 there are n £ N, x = x o , . . . , x n = y in M , to .. . < n - i > T and uo ■ • . u „ _ i G U with d(<^(tj,Xi,Ui),x I + i) < e for all i = 0 . . . n — 1, where d(-, •) is a Riemannian metric on M, (ii) for all x £ E there is u 6 U with y>(i, x, u) 6 E for all t £ R, (iii) £? is maximal with the properties (i) and (ii).
Chain control sets are pairwise disjoint, connected, and closed. The following example illustrates the difference between control sets and chain control sets. 2 . 3 . E x a m p l e . Consider the control system on M = S 1 , given by
x = — sin 2 x + a cos 2 x — u(t) cos 2 x, x £ R mod 2?r,
a > 0,
U = [A, a] C R.
This system has four control sets with nonvoid interior (see Figure 1.)
D,=
0 , a r c t a n ( a — A)1?2
D3 = Dl + 7T,
,
D2 = In — arctan(a — A ) 1 / 2 , ^ ) , DA = D2 + 7T.
However, there is only one chain control set E = S 1 , cp. [24], where a general procedure is described to determine the control sets and chain control sets on one-
128
FRITZ COLONIUS AND WOLFGANG KLIEMANN
dimensional manifolds.
Figure 1. Control sets and dynamics for Example 2.3. This example shows in particular that chain control sets do not necessarily reflect the reachability structure of a system. Therefore, the relation between the control and the limit structure plays an important role in the sequel, in particular we look for conditions, under which the limit sets are contained in the interior of control sets. This will enable us to analyze various aspects of the long term behavior also for systems that are not completely controllable. So far, we have argued with the orbits and chain orbits of the system (2.1), where the contribution of each single trajectory {<£>(<,£, u); t G R} is lost. A precise analysis of the global fine structure of control systems is not possible with these concepts alone, just as for stochastic systems, where one has to use the associated stochastic flow to be able to answer certain questions. In complete analogy we will define the control flow o n W x M, which describes the precise behavior of (2.1) and which yields via the theory of dynamical systems, results for control systems. In this way another mathematical area, which has enjoyed substantial progress over the last years, can be utilized for control theory, in addition to the theory of ordinary differential equations, differential geometry, Lie groups and Lie algebras, linearization techniques and linear algebra. A continuous dynamical system (or flow) on a metric space S is given by a continuous m a p rj): R x S —> S with (i) t/'o = id and (ii) tpt+s = ij>t o r/)a for all t,s 6 R. (Here we have used ij>t = >(*,-).) For a given, nonconstant function u G U the m a p (t,x) *-* y?(t,a;,u) does not define a flow, as u is time varying. If one considers, however, the entire family of differential equations (2.1), indexed by u € U, then one can define a corresponding control flow on S = U x M, in the
CONTROL THEORY AND DYNAMICAL SYSTEMS
129
following manner: $:RxWxM-»WxM,
$(t,u,x)
= (u(t +
-),ip(t,x,u)).
The shift 6tu(-) = u(t + •) on U, which is itself a dynamical system, guarantees the desired group property (ii), and turns $ = (0, (?) into a skew product flow. For compact and convex U C R m the set U is a compact, complete, metric space, if equipped with the weak* topology o f W c L ° ° ( R , R m ) = ( L ^ R ™ ) ) * . This also yields continuity of $ . T h e use of the weak*-topology on U is appropriate for control theoretic considerations, because convergence of un —► u in U implies uniform convergence of ip(- , i , u n ) —*■ <^( - ,£,u) on compact time intervals. 2.4- Remark. For a fixed feedback u = F(x) 6 U with F Lipschitz continuous, the equation x = XQ(X) -f T,Fi(x)X{(x) defines, of course, a dynamical system on M. But for this one has to choose a certain feedback, which restricts the possible control functions a priori. Furthermore, for nonlinear systems it is not appropriate to consider only continuous feedback laws, see e.g. Sontag [84]. Sussmann [89] and [86] describe a construction to obtain piecewise smooth feedbacks from open-loop controllability of points for controllable systems. 2.5. Remark. T h e control flow $ consists in its first component (U,B) of the time shift, for which only the concepts of topological dynamics are appropriate. In the second component, which by itself is not a flow, we find the smooth dynamics of the vector fields — and hence linearization techniques etc. can be used there, cp. Sections 6. and 7. Similar constructions for the definition of flows corresponding to non-autonomous differential equations were described in the 60's by Sell [79] and Miller [63], in particular for the almost periodic case. In the theory of stochastic differential equations with random perturbations £t instead of u(t) in (2.1), it is common place to consider the system over the trajectory space of (t. The classical construction of Kolmogorov leads, for stationary £/, t o a shift invariant probability measure P on this space, which is considered given in the stochastic theory. In contrast, for the ergodic theory of control flows one first has to construct shiftinvariant measures, e.g. via the Krylov-Bogolgubov device, see e.g. [CK4]. Let us recall the following concepts from the topological theory of dynamical systems (see e.g. Maiie [63]). In the following (.?, VO denotes a flow on a metric space. 2.6. D e f i n i t i o n . The limit set u>(s) of 5 £ S is given by w(s) = {y € 5 ; there is tk —* oo with tp(tk,s)
—» y}.
(S,ift) is topologically transitive, if there exists s G S with u>(s) = S. (S, ip) is topologically mixing, if for all open sets V\,V2 C S there exist times To G R, Ti > 0 such t h a t for all n e N we have ^{-nTx + T 0 , Vi) D V2 ^ .
130
FRITZ COLONIUS AND WOLFGANG KLIEMANN
A closed V'-invariant subset W C S is maximal topologically transitive, if (W, il>\w) is topologically transitive, and if for each closed W D W with ( W , if)\ w) topologically transitive, we have W = W. Similarly maximal topologically mixing sets are denned. We obtain a relation between these concepts for the control flow (U x M, $ ) and the control sets of (2.1) in the following manner: Define the lift of a control set D C M with int D ^ to a ^-invariant set V in U x M by V = ci{{u,x)£UxM;
tp(t,x,u)
6 intD for all * G R } .
(2.3)
2.7. T h e o r e m . Let U C R m be compact and convex, and assume (H). (i) If D C M is a control set with int D ~£ <j>, then V, de£ned maximal, topologically transitive (and mixing) set with int
D = int TTMT>
and
by (2.3), is a
ci D = ci KM *D.
(2-4)
Here -KM denotes the projection from U x M onto the second component. (ii) If T> C U X M is a maximal, topologically transitive (or mixing) set of {U X M, $ ) with int KM *D ^ $, then there is a control set D C M satisfying (2.4). 2.8. Remark. In fact, under the assumptions of Theorem 2.7.(i) one obtains more: The periodic points are dense in {T>, $\v) and $ has sensitive dependence on initial conditions in T>. Furthermore, one obtains immediately from this theorem: The system (2.1) is completely controllable on M iff the flow {U x M, $ ) is topologically transitive (or mixing). For a proof see [25], Theorem 3.9. Next we describe the limit set structure of a control system and define for a flow ( 5 , T/») (compare, in particular, Conley [35]): 2.9. D e f i n i t i o n . Let e, T > 0. An (e, T)-chain from x £ S to y G S is given by n G N, x = x0 ■ ■ .xn = y in S, t0,... , t n _ i > T such t h a t d(t/>(i,-, Xi),X{+i) < e for i = 0 . . . n — 1. Here d(-, •) is the metric on S. The chain limit set of x G 5 is fi(x) = {y G 5 ; for all e, T > 0 there is an (e, T)-chain from x
toy),
and the chain recurrent set is defined as CR = {x G S; x G 0 ( z ) } . The flow ( S , ^ ) is c k m recurrent, if 5 = Ci?, and chain transitive, if y G ft(z) for all x,y G 5*. For the control flow (£/ x M, $ ) we lift again the chain control sets E C M to W x M via £ = c£{(u,x) 6 W x M ; p f c s . u ) G E for all t € R } . The analogue of Theorem 2.7 is the following result.
(2.5)
CONTROL THEORY AND DYNAMICAL SYSTEMS
131
2 . 1 0 . T h e o r e m . Let U C R m be compact and convex, and assume (H). For a set E C W X M, the set E = KM £ is a chain control set in M iff E is a maximal, chain transitive set of (U x M , $ ) . In particular it holds: (i) For all ( u , x ) G chain control set 7 T M ^ ( U , x) C E. (ii) For all minimal, such that TTM W
U x M with {(p(t,x,u), t > 0} bounded, there exists a E C M with w(u, x) 6 E, the corresponding lift, and hence (Here the limit set is with respect to the flow {U x M , $ ) . ) ^-invariant sets W C U x M there is a control set D C M C C£ D.
For the proof of Theorem 2.10 see [25], Theorem 4.1 and Lemma 5.3. Theorems 2.7 and 2.10 clarify some basic relations between the control and limit structure of (2.1) on the one hand, and the control flow on the other hand. In the next section we analyze the connections between these two structures, aiming at the control of (complicated) limit behavior. 3 . L i m i t B e h a v i o r of C o n t r o l l e d T r a j e c t o r i e s In this section we discuss the behavior of controlled trajectories as t -> ±oo. According to Theorem 2.10, the limit sets are contained in chain control sets and their lifts. For control theoretical purposes it is important to know, under which conditions trajectories enter areas of complete controllability. A characterization of this property is the aim of this section, various applications will be discussed in the remaining parts. We start by defining (partial) orders on the sets of control sets and of chain control sets in the following way: Let D\,D2 C M be control sets of (2.1), define Dx -< D2 if there is xl g Dx with 0^(xl)
D D2 ^ .
(3.1)
"-<" is a partial order on the set {D C M ; D is a control set of (2.1)}, and under the hypothesis (H) we have: 3.1. Lemma. (i) Open control sets are minimal, and closed control sets are maximal elements w.r.t. -<. (ii) Invariant control sets C C M, i.e. ciO+(x) = c£C for all x G C, are a/ways closed, and hence maximal w.r.t. -<. (iii) IfM is compact, or if K C M is a compact, invariant set of (2.1), then there exist (at least) one open and one closed control set in M (or in K C M, respectively), and these are exactly the minimal and the maximal elements w.r.t. -<.
132
FRITZ COLONIUS AND WOLFGANG KLIEMANN
In a similar way we define for chain control sets E, E' C M E -<E'
if there are chain control sets E = Ex . . . Ek = E' and (tii,*i).
•. {uk,xk)
i n W x M with JTMW*(wi,x,) C E{
and 7rMW(ui, x.) C £,+i for « = 1...k
- 1.
(3.2)
(Here w* denotes the limit sets for t -* - c o . ) '-<' is a partial order on the set {E C M; £ is chain control set of (2.1)}, and it holds: For each control set D C M there exists exactly on chain control set E{D) with D C E{D). If D1 X D2, then £(£>!) =$ £ ( D 2 ) , and as Example 2.3 shows, equality may hold here. The connection with Morse decompositions is given by 3.2 Proposition. The number k of chain control sets is finite iff the control Sow (U x M, $ ) has a finest Morse decomposition, i.e. iff the number k' of the connected components of the chain recurrent set is finite. In this case we also have k = k'. The proof follows from Theorem 2.10. This theorem and Proposition 3.2. show that chain control sets and their order describe the limit behavior of the trajectories. For control sets we know first of all that each minimal set of the flow $ , projected onto M, is contained in the closure of a control set (Theorem 2.10(H)). From this fact we see immediately that for all (u,x) G U x M there is a control set D with TTMU;(U, x) n clD ^ . But this does not guarartee thth int D ^ or that 7rMa>>u, x)nint D^ hold. This last statement would imply that TTMU;(U, x)Cc£D for some control set with int D ^ 0, and dhen nne eould db eblb eo oontrol the limit behavior of this trajectory. The following example shows the difficulties that can arise, if these conditions are not fulfilled. 3.3 Example. Consider the linear system in R2
\y)
\Ul(t)
u2(t))\y)
WlthU
[ 0 '2jx^ 1,2 ''
and its projection onto the unit sphere S 1 C R 2 . We parametrize S 1 by the angle a G R mod 2TT with a = 0 for x = 1, y = 0, and obtain for the projected system four control sets with nonvoid interior
*„(*.), „=[!'2], » . * + , „ . a + , and a continuum of one-point control sets
Da = {a}, « e S 1 \ | j A j ='A.
CONTROL THEORY AND DYNAMICAL SYSTEMS
The points in A are fixed points on S 1 corresponding to u\(t) see [26], Example 5.3 and [24].
133
= 0 and u2(t)
= 1,
Figure 2. Control sets and dynamics for Example 3.3. For a G A and u(t) = (°) we have 7r§iu;(u,a) = DQ, but the projected system cannot be steered back to a after a small perturbation to ft > a, and it cannot be stabilized at the point a . Therefore, we try to find conditions, under which 7TM<*>(U,X) C int D for some control set D holds. 3 . 4 . D e f i n i t i o n . T h e pair (u, x) G U x M is called an inner pair, if there are T > 0 and S > 0 with 0. Now the property of inner pairs means that the trajectory ?(•, x, u) is eventually in the interior of the reachable set from x. This excludes basically those trajectories that appear as optimal ones in time optimal control problems. Using the concept above we obtain the following characterization: 3 . 5 . T h e o r e m . For(u,x) £UxM let the positive trajectory ip+(x,u) 0} be bounded. Then the following statements are equivalent:
: = {?(<, x , u ) ; t >
(i) u(u,x) consists of inner pairs, (ii) 7TAfu;(u,x) C int D for some control set D C M of (2.1). The proof of this theorem can be found in [28], Theorem 4.4. T h e remaining problem is to find simple criteria for (w,x) such that u{u, x) consists of inner pairs. In Section 5. we will demonstrate strategies for two examples, the model of a
134
FRITZ COLONIUS AND WOLFGANG KLIEMANN
chemical reaction and the Lorenz equation. Here we point at two rather general criteria. 3.6. Remark. The maps ip(t, - , u ) : M -> M are diffeomorphisms on M , forming for t > 0 a semigroup S. If S is a subsemigroup of a Lie group acting on a homogeneous space M , then (H) implies that S has nonvoid interior in , the group generated by <S, see e.g. Brockett [12]. In this case it is easy to see that