Chaotic Dynamics and Transport in Classical and Quantum Systems
NATO Science Series A Series presenting the results of scientific meetings supported under the NATO Science Programme. The Series is published by IOS Press, Amsterdam, and Kluwer Academic Publishers in conjunction with the NATO Scientific Affairs Division Sub-Series I. II. III. IV. V.
Life and Behavioural Sciences Mathematics, Physics and Chemistry Computer and Systems Science Earth and Environmental Sciences Science and Technology Policy
IOS Press Kluwer Academic Publishers IOS Press Kluwer Academic Publishers IOS Press
The NATO Science Series continues the series of books published formerly as the NATO ASI Series. The NATO Science Programme offers support for collaboration in civil science between scientists of countries of the Euro-Atlantic Partnership Council. The types of scientific meeting generally supported are “Advanced Study Institutes” and “Advanced Research Workshops”, although other types of meeting are supported from time to time. The NATO Science Series collects together the results of these meetings. The meetings are co-organized bij scientists from NATO countries and scientists from NATO’s Partner countries – countries of the CIS and Central and Eastern Europe. Advanced Study Institutes are high-level tutorial courses offering in-depth study of latest advances in a field. Advanced Research Workshops are expert meetings aimed at critical assessment of a field, and identification of directions for future action. As a consequence of the restructuring of the NATO Science Programme in 1999, the NATO Science Series has been re-organised and there are currently Five Sub-series as noted above. Please consult the following web sites for information on previous volumes published in the Series, as well as details of earlier Sub-series. http://www.nato.int/science http://www.wkap.nl http://www.iospress.nl http://www.wtv-books.de/nato-pco.htm
Series II: Mathematics, Physics and Chemistry – Vol. 182
Chaotic Dynamics and Transport in Classical and Quantum Systems edited by
P. Collet Ecole Polytechnique, Paris, France
M. Courbage Université Paris 7-Denis Diderot, France
S. Métens Université Paris 7-Denis Diderot, France
A. Neishtadt Space Research Institute, Moscow, Russia and
G. Zaslavsky New-York University, New York, NY, U.S.A.
KLUWER ACADEMIC PUBLISHERS NEW YORK, BOSTON, DORDRECHT, LONDON, MOSCOW
eBook ISBN: Print ISBN:
1-4020-2947-0 1-4020-2946-2
©2005 Springer Science + Business Media, Inc. Print ©2005 Kluwer Academic Publishers Dordrecht All rights reserved No part of this eBook may be reproduced or transmitted in any form or by any means, electronic, mechanical, recording, or otherwise, without written consent from the Publisher Created in the United States of America Visit Springer's eBookstore at: and the Springer Global Website Online at:
http://ebooks.springerlink.com http://www.springeronline.com
Contents Preface
vii
Participants
ix
Part I : Theory P. Collet : A SHORT ERGODIC THEORY REFRESHER
1
M. Courbage: NOTES ON SPECTRAL THEORY, MIXING AND TRANSPORT 15 Valentin Affraimovich, Lev Glebsky: COMPLEXITY, FRACTAL DIMENSIONS AND TOPOLOGICAL ENTROPY IN DYNAMICAL SYSTEMS
35
G.M. Zaslavsky, V. Afraimovich: WORKING WITH COMPLEXITY FUNCTIONS
73
Giovanni Gallavotti: SRB DISTRIBUTION FOR ANOSOV MAPS
87
P. Gaspard : DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
107
Walter T. Strunz: ASPECTS OF OPEN QUANTUM SYSTEM DYNAMICS
159
Eli Shlizerman, Vered Rom Kedar: ENERGY SURFACES AND HIERARCHIES OF BIFURCATIONS. 189 Monique Combescure: PHASE-SPACE SEMICLASSICAL ANALYSIS. AROUND SEMICLASSICAL TRACE FORMULAE 225
Part II : Applications
Ariel Kaplan, Mikkel Andersen, Nir Friedman and Nir Davidson: ATOM-OPTICS BILLIARDS
239
Fereydoon Family, C. Miguel Arizmendi, Hilda A. Larrondo: CONTROL OF CHAOS AND SEPARATION OF PARTICLES IN INERTIA RATCHETS
269
v
vi F. Bardou: FRACTAL TIME RANDOM WALK AND SUBRECOIL LASER COOLING CONSIDERED AS RENEWAL PROCESSES WITH INFINITE MEAN WAITING TIMES
281
Xavier Leoncini, Olivier Agullo, Sadruddin Benkadda, George M. Zaslavsky: ANOMALOUS TRANSPORT IN TWO-DIMENSIONAL PLASMA TURBULENCE
303
Edward Ott,Paul So,Ernest Barreto,Thomas Antonsen: THE ONSET OF SYNCHRONISM IN GLOBALLY COUPLED ENSEMBLES OF CHAOTIC AND PERIODIC DYNAMICAL UNITS
321
A. Iomin, G.M. Zaslavsky: QUANTUM BREAKING TIME FOR CHAOTIC SYSTEMS WITH PHASE SPACE STRUCTURES
333
S.V.Prants: HAMILTONIAN CHAOS AND FRACTALS IN CAVITY QUANTUM ELECTRODYNAMICS 349 M. Cencini,D. Vergni, A. Vulpiani: INERT AND REACTING TRANSPORT
365
Michael A. Zaks: ANOMALOUS TRANSPORT IN STEADY PLANE FLOWS OF VISCOUS FLUIDS 401 J. Le Sommer, V. Zeitlin: TRACER TRANSPORT DURING THE GEOSTROPHIC ADJUSTMENT IN THE EQUATORIAL OCEAN 413 Antonio Ponno: THE FERMI-PASTA-ULAM PROBLEM IN THE THERMODYNAMIC LIMIT 431
Lectures
441
Preface
From the 18th to the 30th August 2003 , a NATO Advanced Study Institute (ASI) was held in Cargèse, Corsica, France. Cargèse is a nice small village situated by the mediterranean sea and the Institut d'Etudes Scientifiques de Cargese provides ∗ a traditional place to organize Theoretical Physics Summer Schools and Workshops in a closed and well equiped place.The ASI was an International Summer School* on "Chaotic Dynamics and Transport in Classical and Quantum Systems". The main goal of the school was to develop the mutual interaction between Physics and Mathematics concerning statistical properties of classical and quantum dynamical systems. Various experimental and numerical observations have shown new phenomena of chaotic and anomalous transport, fractal structures, chaos in physics accelerators and in cooled atoms inside atom-optics billiards, space-time chaos, fluctuations far from equilibrium, quantum decoherence etc. New theoretical methods have been developed in order to modelize and to understand these phenomena (volume preserving and ergodic dynamical systems, non-equilibrium statistical dynamics, fractional kinetics, coupled maps, space-time entropy, quantum dissipative processes etc). The school gathered a team of specialists from several horizons lecturing and discussing on the achievements, perspectives and open problems (both fundamental and applied). The school, aimed at the postdoctoral level scientists, non excluding PhD students and senior scientists, provided lectures devoted to the following topics : Statistical properties of Dynamics and Ergodic Theory Chaos in Smooth and Hamiltonian Dynamical Systems Anomalous transport, fluctuations and strange kinetics Quantum Chaos and Quantum decoherence Lagrangian turbulence and fluid flows Particle accelerators and solar systems More than 70 lecturers and students from 17 countries have participated to the ASl. The school has provided optimal conditions to stimulate contacts between young and senior scientists. All of the young scientists have also received the opportunity to present their works and to discuss them with the lecturers during two posters sessions that were organized during the School. The proceedings are divided into two parts as follows: I. Theory This part contains the lectures given on basic concepts and tools of modern dynamical systems theory and their physical implications. Concepts of ergodicity and mixing, complexity and entropy functions, SRB measures, fractal dimensions and bifurcations in hamiltonian systems have been thoroughly developed. Then,
∗
http://www.ccr.jussieu.fr/lptmc/Cargese/CargeseMainPage.htm
vii
viii models of dynamical evolutions of transport processes in classical and quantum systems have been largly explained. II. Applications In this part, many specific applications in physical systems have been presented. It concerns transport in fluids, plasmas and reacting media. On the other hand, new experiments of cold optically trapped atoms and electrodynamics cavity have been thoroughly presented. Finally, several papers bears on synchronism and control of chaos. We also provide most recent references of the other given lectures at the school. These lecture notes represent, in our views, the vitality and the diversity of the research on Chaos and Physics, both on fundamental f and applied levels, and we hope that this summer-school will be followed by similar meetings. The summer-school was mainly supported by NATO and the staff of the University Paris 7. M. Courbage was a coordinator off the Summer-School, G. Zaslavsky was a director of the NATO-ASI and A. Neishtadt was a co-director. We would like to thank all the institutions who provided support and encouragements, namely, NATO ASI programm, the European Science Foundation through Prodyn programm, the Collectivités Territoriale Corse, the Laboratoire de Physique Théorique de La Matière Condensée (LPTMC) and the Présidence of the University Paris 7. Thanks also to the Centre de Physique Théorique de l'Ecole Polytechnique de Paris. The meeting was an occasion for a warm interactive atmosphere beside the scientific exchanges. We want to thank those who contributed to its success: the director and the staff of the Institut d'Etudes Scientifiques de Cargèse and, the team of the Université Paris 7, especially Evelyne Authier, Secretary of the LPTMC, who provided essential help to organize this ASI. P . Collet, M. Courbage, S. Metens, A. Neishtadt, G.W. Zaslavsky
PARTICIPANTS Valentin Afraimovich IICO UASLP. Communication Optica. Universitet Autonomny de San Luis. Karakorum 1470, Iomas, 4eme section. CP78200 San Luis Potosi. SLP Mexico
[email protected] Omar Al Hammal Institute “Carlos I” for Theoretical and Computational Physics. Universidad de Granada Avda. Fuente Nueva, s/n, 1 18071 Granada Spain
[email protected] Athanasios Arvanitidis Dept. of MathematicsAristotle University of Thessaloniki 54006 Thessaloniki, Geece
[email protected] Francois Bardou IPCMS-CNRS, 23, rue du Loess, BP 43 67037 Strasbourg Cedex 2 France
[email protected] Maxim Barkov Space Plasma Physics-Space Research InstituteProfsoyuznaya str. 84/32 117997 Moscow Russie
[email protected] Jacopo Bellazzini Universita’ di Pisa - Dipartimento Ingegneria AerospazialeVia Caruso 120 56100 Pisa Italie
[email protected] Viatcheslav Belyi Theoretical department-Russian Academy of Sciences IZMIRAN 142190 Troitsk, Russia
[email protected] Cristel Chandre CPT -- CNRS-Centre de Physique Théorique Campus de Luminy - case 907 13288 Marseille, France
[email protected] Hugues Chaté SPEC - CEA - Saclay, 91191 Gif-sur-Yvette, France
[email protected] Guido Ciraolo Centre de Physique Theorique,CNRS case 907 13288 Marseille cedex 9, France
[email protected] Steliana Codreanu Department of Theoretical Physics-Babes-Bolyai University Kogalniceanu str. 1 2400 CLUJ-NAPOCA Roumanie
[email protected] Pierre Collet Centre de physique theorique-CNRS Ecole Polytechnique, route de Saclay 91128 Palaiseau cedex France
[email protected] Pieter Collins Control and computation-CWIKruislaan 413 1098 SJ Amsterdam Nederland
[email protected]
ix
x Monique Combescure Institut de Physique Nucléaire de Lyon, CNRS-Bât Paul Dirac, 4 rue Enrico Fermi 69622 VILLEURBANNE France
[email protected] Maurice Courbage LPTMC case 7020-Université de Paris 7, 2 place Jussieu 75231 Paris Cedex 05 France
[email protected] Giampaolo Cristadoro Center for Nonlinear and Complex Systems and Dipartimento di Scienze Chimiche, Fisiche e MatematicheUniversita’ dell’Insubria (sede di Como)-via Valleggio,11 22100 Como Italie
[email protected] Nir Davidson Dept. of Physics of Complex Systems-Weizmann Institute of Science Rehovot 76100 Israel
[email protected] Filippo De Lillo Dipartimento di Fisica Generale-University of TorinoVia Giuria,1 10125 Torino Italie
[email protected] Jean-Pierre Eckmann Departement de Physique Theorique and Section de Mathematiques Universite de Geneve-32, Bld D’Yvoy 1211 Geneva 4 Suisse
[email protected] Massimiliano Esposito Service de Chimie Physique CP 231-Universite Libre de Bruxelles Boulevard du Triomphe B-1050 Bruxelles Belgique
[email protected] Fereydoon Family Physics Department-Emory UniversityPhysics Department, Emory University GA Atlanta USA
[email protected] Stefano Galatolo Dipartimento di matematica applicata-Universita di PisaVia Bonanno Pisano 25b 56126 Pisa Italie
[email protected] Govanni Gallavotti Fisica -Univ. Roma 1P.le Moro 2 00185 Roma Italie
[email protected] Pierre Gaspard Center for Nonlinear Phenomena and Complex SystemsCampus Plaine, CP 231 B-1050 Brussels Belgique
[email protected] Alessandro Giuliani Physics department-Universita’ di Roma “La Sapienza”- Via Ivanoe Bonomi, 92, 00139 Roma, Italy
[email protected] Vasiliy Govorukhin Rostov State University - Computational mathematics Zorge str. 5 344090 Rostov-on-Don Russie
[email protected]
xi Seiichiro Honjo University of Tokyo, Graduate School of Arts and Sciences-Department of Basic Science, Kaneko LaboratoryKomaba 3-8-1, Meguro-ku 153-8902 Tokyo Japon
[email protected] Alexander Iomin Department of Physics, Technion 32000 Haifa Israel
[email protected] Alexander Itin Lab. 627 Space Research Institute-Profsoyuznaya str. 84/32 117997 Moscow Russia
[email protected] Brunon Kaminski Faculty of Mathematics and Informatics Nicholas Copernicus University, ul Chopina 12/18, 87-100 Torun, POLAND
[email protected] Janina Kotus Warsaw Univ.of Technology-Department of MathematicsPlac Politechniki 1 00-661 Warsaw Pologne
[email protected] Alexandra Landsman Princeton University, 235 Thunder Circle PA 19020 Ben Salem USA
[email protected] Jacques Laskar Astronomie et Systemes Dynamiques-IMC77, Av. Denfert-Rochereau F-75014 PARIS France
[email protected] Xavier Leoncini PIIM-Université de Provence, Centre de St Jerome, case 321 13396 Marseille Cedex 20 France
[email protected] Fabio Lepreti Section of Astrophysics, Astronomy, and Mechanics-Department of Physics, Aristotle University of ThessalonikiDepartment of Physics, Aristotle University of Thessaloniki 54124 Thessaloniki Grèce
[email protected] Emanuel Lima Instituto de Física de São Carlos-Universidade de São PauloMajor Júlio Salles 870, Vila Pureza, 13561-010 16 São Carlos Brazil
[email protected] Helen Makarenko Department of Physics-V.Karazin National University4 Svobody square 61077 Kharkiv Ukraine
[email protected] Amar Makhlouf Université de Annaba-Labo de Mathématiques, 14 Rue Zighoud Youcef, DREAN 36 ELTARF, ALGERIE
[email protected] Miguel Manna Physique Mathematique et Theorique CNRS-UMR5825-Universite Montpellier 2Place Eugene Bataillon 34095 Montpellier, France
[email protected]
xii Paul Manneville Laboratoire d’Hydrodynamique-CNRS-Ecole PolytechniqueEcole polytechnique 91128 Palaiseau, France
[email protected] Stéphane Métens LPTMC, case 7020-Université Paris 7-Denis Diderot, 2 place Jussieu 75231 Paris Cedex 05, France
[email protected] Stavros Muronidis Dept. of MathematicsAristotle University of Thessaloniki 54006 Thessaloniki, Grèce
[email protected] Stefano Musacchio Dipartimento di Fisica Generalevia Pietro Giuria 1 10125 Torino, Italie
[email protected] Anatoly Neishtadt Space Research Institute -Russian Academy of Sciences, Profsoyuznaya 84/32 Moscow 117997, Russia
[email protected] Tali Oliker Technionyuvalim 56 20142 d.n. misgav, Israel
[email protected] Edward Ott I.R.E.A.P.-University of Maryland, City COLLEGE PARK 20742 MARYLAND, USA
[email protected] Séverine Pache ITP-EPFL, Ecublens 1015 Lausanne, Suisse
[email protected] Antonio Politi ISTITUTO NAZIONALE DI OTTICA APPLICATA, LARGO E. FERMI 6 50125 FIRENZE, Italy
[email protected] Antonio Ponno Dipartimento di Matematica-Universita’ di Milano, Via Saldini 50 20133 Milano, Italie
[email protected] Serguei Prants Institution Pacific Institute of the Russian Academy of Sciences 43 BALTIISKAYA St. 690041 VLADIVOSTOK RUSSIA
[email protected] Saar Rahav Technion-Department of Physics 32000 Haifa Israel
[email protected] Vered Rom-Kedar Weizmann InstituteP.O. Box 26-Department of Computer science and applied mathematics 76100 Rehovot, Israel
[email protected] Majid Saberi
LPTMC, case 7020-Université Paris 7-Denis Diderot, 2 place Jussieu 75231 Paris Cedex 05, France Marc Senneret LPTMC, case 7020-Université de Paris 72 place Jussieu 75251 PARIS CEDEX 05 France
[email protected]
xiii Michael Shlesinger Office of Naval Research, 800 n°Quincy Str., Arlington, VA22217-5660, USA
[email protected] Eli Shlizerman Computer Science and Applied Mathematics - Dynamical Systems- Weizmann Institute of Science 76100 Rehovot Israel
[email protected] Dominique Simpelaere Université Paris 6-Pierre et Marie Curie, Lab. De Probabilié, 4, Place Jussieu 75252 Paris cedex 05, France
[email protected] Tom Solomon Bucknell University Lewisburg, PA 17837, USA
[email protected] George Stilogiannis Dept. of Mathematics Aristotle University of Thessaloniki 54006 Thessaloniki, Grèce
[email protected] Ion Stroe Mechanics-POLITEHNICA University of Bucharest Splaiul Independentei 313 RO-77206 Bucharest ROMANIA
[email protected] Walter Strunz Physikalisches Institut, Universitat Freiburg, Hermann-Herder-Str. 3, 79104 Freiburg, Germany
[email protected] Vladimir Ten Dept of Mathematics and Mechanics Moscow State University-MSU, Vorobevy gory 119899 Moscow Russia
[email protected] Sandro Vaienti University of Toulon and Centre de Physique TheoriqueCase 907 3288 Marseille Cedex 09 France
[email protected] Jiri Vanicek Jefferson Physical LaboratoryMSRI, 1000 Centennial Drive CA 94720 Berkeley USA
[email protected] Alexei Vasiliev Laboratory of Chaotic Dynamics Space Research Institute-Profsoyuznaya 84/32 117997 Moscow Russie
[email protected] Sebastien Viscardy Universite Libre de Bruxelles-Service de Chimie-PhysiqueCampus Plaine, CP 231 1050 Brussels Belgium
[email protected] Thérèse Vivier UMR5584 (CNRS) - Institut Mathématiques de Bourgogne BP47970 21078 Dijon Cedex France
[email protected] Angelo Vulpiani Dipartimento di Fisica, Universita di Roma La Sapienza P.le A. Moro 2 I-00185 Roma Italie
[email protected] Piotr Waz Center for Astronomy-Nicholaus Copernicus University, Gagarina 11 87-100 Torun Pologne
[email protected]
xiv Tatiana Yelenina Numerical Simulation of Electrodynamics and Magnetohydrodynamics-Keldysh Institute of Applied Mathematics of RAS4, Miusskaya sq. 125047 Moscow Russie
[email protected] L.S. Young Courant Institute, New-York University, 251, Mercer Street, NY-10012-1182 New-York, USA
[email protected] Michael Zaks Humboldt University of Berlin-Dept of Stochastic Processes, Newtonstr. 15 D-12489 Berlin Allemagne
[email protected] Georges Zaslavsky Courant Institute, New-York University, 251, Mercer Street, NY-10012-1182 New-York, USA
[email protected] Vladimir Zeitlin Laboratoire de Meteorologie Dynamique, E N S, 24 Rue Lhomond 75231 PARIS CEDEX 05 France
[email protected]
A SHORT ERGODIC THEORY REFRESHER. P. Collet Centre de Physique Th´eorique CNRS UMR 7644 Ecole Polytechnique F-91128 Palaiseau Cedex (France)
[email protected]
Abstract
1.
We give a short refresher on some of the main definitions and results in ergodic theory. This is not intended to be an introduction nor a review of the subject. There are many very good texts about ergodic theory some of them are given in the references.
Introduction.
A system is characterized by the set Ω of all its possible states. At a given time, all the properties of the system can be recovered from the knowledge of the instantaneous state x ∈ Ω. The system is observed using the so called observables which are real valued functions on Ω. Most often the space of states Ω is a metric space (so we can speak of nearby states) and we will only consider below Borel measurable observables. As time goes on, the instantaneous state changes (unless the system is in a situation of rest). The time evolution is a rule giving the change of the state with time. Time evolutions come in different flavors. Discrete time evolution. This is a map from the state Ω into itself producing the new state after one unit of time given the initial state. If x0 is the state of the system at time zero, the state at time one is x1 = T (x0 ) and more generally the state at time n is given by xn = T (xn−1 ). This is often written xn = T n (x0 ) with T n = T ◦ T ◦ · · · ◦ T n-times. Continuous time semi flow. This is a family (ϕt )t∈R+ of maps of Ω satisfying ϕ0 = Id , ϕs ◦ ϕt = ϕs+t .
1 P. Collet et al. (eds.), Chaotic Dynamics and Transport in Classical and Quantum Systems, 1–14. © 2005 Kluwer Academic Publishers. Printed in the Netherlands.
2 The dynamics can be given by a differential equation on a manifold associated to a vector field F dx = F (x) . dt This is for example the case of a mechanical system in the Hamiltonian formalism. Under regularity conditions on F , the integration of this equation leads to a semi-flow (and even a flow). There are other more complicated situations like non-autonomous systems (in particular stochastically forced systems), systems with memory, etc. A dynamical system is a set of states Ω equipped with a time evolution. If a sigma-algebra is given on Ω, we will always assume that the time evolution is measurable. This will often be a Borel sigma-algebra. One would like to understand the effect of the time evolution and in particular the behaviour at large time. For example, if A is a subset of the phase space Ω (describing the states with a given property), one would like to know in a long time interval [0, N ] (N large) how much time the system has spent in A, namely how often the state has the property described by A. Assume for simplicity we have a discrete time evolution. If χA denotes the characteristic function of the set A, the average time the system has spent in A over a time interval [0, N ] starting in the initial state x0 is given by N 1 AN (x0 , A) = χ (T j (x0 )) . (1) N + 1 j=0 A It is natural to ask if this quantity has a limit when N tends to infinity. The answer may of course depend on A and x0 , but we can already make two important remarks. Assume the limit exists and denote it by µx0 (A). First, it is easy to check that the limit also exists for T (x0 ) and for any y ∈ T −1 (x0 ) = {z | T (z) = x0 }, and moreover µT (x0 ) (A) = µy (A) = µx0 (A) .
(2)
Second, the limit also exists if A is replaced by T −1 (A) and is equal, namely µx0 (T −1 (A)) = µx0 (A) . (3)
3
A short ergodic theory refresher.
If one assumes that µx0 does not depend on x0 at least for measurable sets, one is lead to the notion of invariant measure. By definition a measure µ is invariant if for any measurable set A µ(T −1 (A)) = µ(A) .
(4)
Similar considerations and definitions hold for continuous time. Unless otherwise stated, when speaking below of an invariant measure we will assume it is a probability measure. We will denote by (Ω, T, B, µ) the dynamical system with state space Ω, discrete time evolution T , B is a sigma-algebra on Ω such that T is measurable with respect to B and µ is a measure on B invariant by T . We can now come back to the question of the asymptotic limit of the ergodic average (1). This is settled by the ergodic theorems. The ergodic theorem of Von-Neumann [22] applies in an L2 context, while the Birkhoff ergodic theorem [2] applies almost surely (we refer to [14], [20] for proofs and extensions). We now state the Birkhoff ergodic theorem. Theorem 1 Let (Ω, T, B, µ) be a dynamical system (recall that T is measurable for the sigma algebra B and the measure µ on B is T invariant). Then for any f ∈ L1 (dµ) AN (x, f ) =
N 1 f (T j (x)) . N + 1 j=0
converges when N tends to infinity for µ almost every x. We now make several remarks about this fundamental result. By (2), the set of points where the limit exists is invariant (and of full measure by Birkhoff’s Theorem). Moreover, if we denote by g(x) the limiting function (which exists for µ almost every x), it is invariant, namely g(T (x)) = g(x). The set of µ measure zero where nothing is claimed depends on f and µ. One can often use a set independent of f (for example if L1 (dµ) is separable). We will comment below on the dependence on µ. The theorem is often remembered as saying that the time average is equal to the space average. This has to be taken with a grain of salt. As we will see below changing the measure may change drastically the exceptional set of measure zero and this can lead to completely different results.
4 The set of initial conditions where the limit does not exist, although small from the point of view of the measure µ may be big from other points of views (see [1]). The most interesting case is of course when the limit in the ergodic theorem is independent of the initial condition (except for a set of µ measure zero). This leads to the definition of ergodicity. A measure µ invariant for a dynamical system (Ω, A, T ) is ergodic if any invariant function (i.e. any measurable function f such that f ◦ T = f , µ almost surely) is µ almost surely constant. There are two often used equivalent conditions. The first one is in terms of invariant sets. An invariant (probability) measure is ergodic if and only if µ(A∆T −1 (A)) = 0 ⇐⇒ µ(A) = 0 or µ(A) = 1 .
(5)
The second equivalent condition is in terms of the Birkhoff average. An invariant (probability) measure is ergodic if and only if for any f ∈ L1 (dµ) N 1 j f (T (x)) = f dµ (6) lim N →∞ N + 1 j=0 µ almost surely. We now make some remarks about the definition of ergodicity and its equivalent formulations. In the condition (6), the limit exists µ almost surely by the Birkhoff ergodic Theorem (1). It is enough to require that the limit is µ almost surely constant since the constant has to be equal to the integral. In formula (6), the state x does not appear on the right hand side, but it is hidden in the fact that the formula is only true outside a set of measure zero. It often happens that a dynamical system (Ω, A, T ) has several ergodic invariant (probability) measures. Let µ and ν be two different ones. It is easy to verify that they are disjoint. One can find a set of measure one which is of measure zero for the other and vice versa. This explains why the ergodic theorem applies to both measures leading in general to different time averages. For non ergodic measures, one can use an ergodic decomposition (disintegration). We refer to [14] for more information. However in concrete cases this may lead to rather complicated sets.
A short ergodic theory refresher.
5
In probability theory, the ergodic theorem is usually called the law of large numbers for stationary sequences. Birkhoff’s ergodic theorem holds for semi flows (continuous time average). It also holds of course for the map obtained by sampling the semi flow uniformly in time. However non uniform sampling may spoil the result (see [23] and references therein). Simple cases of non ergodicity come from Hamiltonian systems with the invariant Liouville measure. First of all since the energy is conserved the system is not ergodic if the number of degrees of freedom is larger than one. One has to restrict the consideration to each energy surface. More generally if there are other independent constants of the motion one should restrict oneself to lower dimensional manifolds. For completely integrable systems, one is reduced to a constant flow on a torus which is ergodic if the frequencies are incommensurable. It is also known that generic Hamiltonian systems are neither integrable nor ergodic (see [16]).
2.
Rate of convergence in the ergodic theorem.
It is natural to ask how fast is the convergence of the ergodic average to its limit in Theorem 1. At this level of generality any kind of velocity above 1/n can occur. Indeed Halasz and Krengel have proven the following result (see [10] for a review). Theorem 2 Consider a (measurable) automorphism T of the unit interval Ω = [0, 1], leaving the Lebesgue measure dµ = dx invariant. 1 ) For any increasing diverging sequence a1 , a2 , · · ·, with a1 ≥ 2, and for any number α ∈]0, 1[, there is a measurable subset A ∈ Ω such that µ(A) = α, and n−1 1 a χA ◦ T j − µ(A) ≤ n n n j=0
µ almost surely, for all n. 2 ) For any sequence b1 , b2 , · · ·, of positive numbers converging to zero, there is a measurable subset B ∈ Ω with µ(B) ∈]0, 1[ such that almost surely 1 n−1 lim χB ◦ T j − µ(B) = ∞ . n→∞ nbn j=0
6 In spite of this negative result, there is however an interesting and somewhat surprising theorem by Ivanov dealing with a slightly different question. To formulate the result we first define the sequence of down-crossings for a non-negative sequence (un )n∈N . Let a and b be two numbers such that 0 < a < b. For an integer k ≥ 0 such that uk ≤ a, we define the first down crossing from b to a after k as the smallest integer nd > k (if it exists) such that 1 ) und ≤ a, 2 ) There exists at least one integer k < j < nd such that uj ≥ b. Let now (nl ) be the sequence of successive down-crossings from a to b (this sequence may be finite and even empty). We denote by N (a, b, p, (un )) the number of successive down-crossings from b to a occurring before
time p for the sequence (un ), namely N (a, b, p, (un )) = sup {l | nl ≤ p} . Theorem 3 Let (Ω, A, T, µ) be a dynamical system. Let f be a non negative observable with µ(f ) > 0. Let a and b be two positive real numbers such that 0 < a < µ(f ) < b, then for any integer r r a n µ x N a, b, ∞, f (T (x)) >r ≤ . b
We refer to [9], [5], [12] for proofs and extensions. In order to get some information on the rate of convergence in the ergodic theorem, one has to make some hypothesis on the dynamical system and on the observable. If one considers the numerator of the ergodic average, namely the ergodic sum Sn (f )(x) =
n−1
f (T j (x))
(7)
j=0
this can be considered as a sum of random variables, although in general not independent. It is however natural to ask if there is something similar to the central limit theorem in probability theory. To have such a theorem, one has first to obtain the limiting variance. Assuming for simplicity that the average of f is zero, we are faced with the question of convergence of the sequence 1 n
2
Sn (f )(x)
dµ(x)
7
A short ergodic theory refresher. 2
=
f (x) dµ(x) + 2
n−1 j=1
n−j n
f (x) f (T j (x)) dµ(x) .
Here we restrict of course the discussion to observables which are square integrable. This sequence may diverge when n tends to infinity. It may also tend to zero. This is for example the case if f = u − u ◦ T with n 2 u ∈ L2 (dµ). Indeed, √ in that case Sn = u − u ◦ T is of order one in L and not of order n (see [10] for more details and references). A quantity which occurs naturally from the above formula is the autocorrelation function Cf,f which is the sequence given by
Cf,f (j) =
f (x) f (T j (x)) dµ(x) .
(8)
If this sequence belongs to l1 , the limiting variance exists and is given by σf2 = Cf,f (0) + 2
∞
Cf,f (j) .
j=1
If moreover σf > 0, we say that the central limit theorem holds if
t Sn (f )(x) 1 2 √ lim µ x =√ e−u /2 du . ≤t n→∞ σf n 2π −∞
We emphasize that this kind of result has been only established for certain classes of dynamical systems and observables. We refer to [6] for a review. There are also results like Berry-Essen inequalities, law of iterated logarithms, invariance principles, large deviations etc. A natural generalization of the auto-correlation is the cross correlation between two square integrable observables f and g. This function (sequence) is given by
f (x) g(T j (x)) dµ(x) −
Cf,g (j) =
f dµ
g dµ .
The second term appears in the general case when neither f nor g has zero average. The case where f and g are characteristic functions is particularly interesting. If f = χA and g = χB , we have
Cχ
A
χB (n) =
,
A
χB ◦ T n dµ = µ(A) µ(T n (x) ∈ B|x ∈ A) .
If for large time the system looses memory of its initial condition, it is natural to expect that µ(T n (x) ∈ B|x ∈ A) converges to µ(B). This
8 leads to the definition of mixing. We say that for a dynamical system (Ω, A, T ) the T invariant measure µ is mixing if for any measurable subsets A and B of Ω, we have lim µ(A ∩ T −n (B)) = µ(A)µ(B) .
n→∞
There are many other mixing conditions including various aspects and velocity of convergence. We refer to [8] for details.
3.
Entropies.
Often one does not have access to the points of phase space but only to some fuzzy approximation. For example if one uses a real apparatus which always has a finite precision. There are several ways to formalize this idea. The phase space Ω is a metric space with metric d. For a given precision > 0, two points at distance less than are not distinguishable. One gives a (measurable) partition P of the phase space, P = {A1 , · · · , Ak } (k finite or not) , Aj ∩ Al = ∅ for j = l and Ω=
k
Aj .
j=1
If there is a given measure µ on the phase space it is often useful to use partitions modulo sets of µ measure zero. The notion of partition leads naturally to a coding of the dynamical system. This is a map Φ from Ω to {1, · · · , k}N given by Φn (x) = l
if
T n (x) ∈ Al .
If the map is invertible, one can also use a bilateral coding. If S denotes the shift on sequences, it is easy to verify that Φ ◦ T = S ◦ Φ. In general Φ(Ω) is a complicated subset of {1, · · · , k}N , i.e. it is difficult to say which codes are admissible. There are however some examples of very nice codings like for Axiom A attractors (see [4] [17] and [21]). Let P and P be two partitions, the partition P ∨ P is defined by P ∨ P = {A ∩ B , A ∈ P , B ∈ P } . If P is a partition,
T −1 P = {T −1 (A)}
9
A short ergodic theory refresher.
is also a partition. Recall that (even in the non invertible case) T −1 (A) = {x , T (x) ∈ A}. A partition P is said to be generating if (modulo sets of measure zero) ∞
T −n P =
n=0
with the partition into points. In this case the coding is injective (modulo sets of measure zero). We now come to the definition of entropies. There are two main entropies, the topological entropy and the so called metric or KolmogorovSinai entropy. Both measure how many different orbits one can observe through a fuzzy observation. The topological entropy is defined independently of a measure. We will only consider here the case of a metric phase space. The topological entropy counts all the orbits modulo fuzziness. We say that two orbits of initial condition x and y respectively are (the precision) different before time n (with respect to the metric d) if sup d(T k (x), T k (y)) > . 0≤k≤n
Let Nn () be the maximum number of pairwise different orbits up to time n. In other words this is the maximum number of pairwise different films the dynamics can generate up to time n if two images differing at most by are considered identical. The topological entropy is defined by htop = lim lim sup 0 n→∞
1 log Nn () . n
When an ergodic invariant measure µ is considered, the disadvantage of the topological entropy is that it measures the total number of (distinguishable) trajectories, including trajectories which have an anomalously small probability to be chosen by µ. It even often happens that these trajectories are much more numerous than the ones favored by µ. The metric or Kolmogorov-Sinai entropy is then more adequate. If P is a (measurable) partition, its entropy Hµ (P) with respect to the measure µ is defined by Hµ (P) = −
µ(A) log µ(A) .
A∈P
In communication theory one often uses the logarithm base 2.
10 The entropy of the dynamical system with respect to the partition P and the (invariant, ergodic, probability) measure µ is defined by 1 −j Hµ (∨n−1 P) . j=0 T n→∞ n
Hµ (T, P) = lim
Finally the metric or Kolmogorov-Sinai entropy is defined by hµ (T ) =
sup
P finite or countable
Hµ (T, P) .
If P is generating, and hµ (T ) < ∞, then hµ (T ) = Hµ (T, P) . One has also the general inequality hµ (T ) ≤ htop (T ) , and moreover htop (T ) =
sup
hµ (T ) .
µ, T ergodic
However the maximum may not be reached. We refer to [24] for proofs and more results. An important application of the entropy is Ornstein’s isomorphism theorem for Bernoulli shifts, we refer to [18] for more information. Another important application of the entropy is the Shannon-McMillan-Breiman theorem which in a sense counts the number of typical orbits for the measure µ. Theorem 4 Let P be a finite generating partition. For any > 0 there is an integer N () such that for any n > N () one can separate the −j P into two disjoint subsets atoms of the partition Pn = ∨n−1 j=0 T Pn = Bn ∪ Gn
such that
µ
A ≤
A∈Bn
and for any A ∈ Gn e−n(hµ (T )+) ≤ µ(A) ≤ e−n(hµ (T )−) In other words, the atoms in Bn are in some sense the “bad” atoms, but their total mass is small. On the other hand, the good atoms (those
11
A short ergodic theory refresher.
in Gn ) have almost the same measure, and of course their union gives almost the total weight. An immediate consequence is that # Gn en hµ (T ) , where # Gn denotes the cardinality of the set Gn . This is similar to the well known formula of Boltzmann in statistical mechanics relating the entropy to the logarithm of the (relevant) volume in phase space. There is also an obvious connection with the equivalence of ensembles. We refer to [14] and [15] for more information. As mentioned before, it often happens that # Gn # Bn . A simple example is given by the Bernoulli shift on two symbols. Let p ∈]0, 1[ with p = 1/2. Consider the probability measure ν on {0, 1} with ν({0}) = p, and the measure µ on Ω = {0, 1}N which is the infinite product of ν. The distance between two elements x and y of Ω is defined by d(x, y) = e− inf {i , xi =yi } . It is easy to prove that the measure µ is invariant and ergodic for the shift S on sequences. Moreover, htop (S) = log 2. The partition
P = {x0 = 0 }, {x0 = 1 } is generating. For the entropy one has hµ (S) = −p log p − q log q with q = 1 − p. However for n large we get (since p = 1/2) # Gn en hµ (S) 2n # Bn . Another way to formulate the Shannon-McMillan-Breiman theorem is to look at the measure of cylinder sets. For a point x ∈ Ω, let Cn (x) −j P which contains x. In other words, C (x) is be the atom of ∨n−1 n j=0 T j j the set of y ∈ Ω such that for 0 ≤ j ≤ n − 1, T (x) and T (y) belong to the same atom of P (the trajectories are indistinguishable up to time n − 1 from the fuzzy observation defined by P). Then for µ almost every x we have 1 hµ (T ) = − lim log µ(Cn (x)) . n→∞ n A similar result holds using a metric instead of a partition. It is due to Brin and Katok, and uses the so called Bowen balls defined for x ∈ Ω, the transformation T , δ > 0 and an integer n by
B(x, T, δ, n) = y , d(T (x), T (y)) < δ for j = 0, · · · , n − 1 . j
j
12 These are again the initial conditions leading to trajectories indistinguishable (at precision δ) from that of x up to time n − 1 . Theorem 5 If µ is T ergodic, we have for µ almost any initial condition 1 hµ (T ) = lim lim inf − log µ(B(x, T, δ, n)) . δ0 n→∞ n We refer to [3] for proofs and related results. A way to measure the entropy in coded systems was discovered by Ornstein and Weiss using return times to the first cylinder. The result was motivated by the investigation of the asymptotic optimality of Ziv’s compression algorithms. Let q be a finite integer, and assume the phase space of a dynamical system is a shift invariant subset of {1, · · · , q}N . As before, we denote the shift by S. Let µ be an ergodic invariant measure. Let n be an integer and for x ∈ Ω, define Rn (x) as the smallest integer such that the first n symbols of x and S Rn (x) (x) are identical. Theorem 6 For µ almost every x we have lim
n→∞
1 log Rn (x) = hµ (T ) . n
We refer to [19] for the proof. A metric version was recently obtained by Donarowicz and Weiss, using again Bowen balls, in the context of dynamical systems with a metric phase space. Let for δ > 0 and the integer n
R(x, T, δ, n) = inf l > 0 , T (x) ∈ B(x, T, δ, n) . l
In other words
R(x, T, δ, n) = inf l > 0 , d(T l+j (x), T j (x)) < δ for j = 0, · · · , n − 1 . Theorem 7 For µ almost every x, we have lim lim sup
δ0 n→∞
1 log R(x, T, δ, n) = hµ (T ) . n
We refer to [7] for the proof and related results.
13
References [1] L.Barrera, J.Schmeling. Sets of “non typical” points have full topological entropy and full Hausdorff dimension. Israel J. Math. 116, 29-70 (2000). [2] G.D.Birkhoff. Proof of the ergodic theorem. Proc. Nat. Acad. Sci. USA, 17, 656-660 (1931). [3] M.Brin, A.Katok. On local entropy. In Geometric dynamics. Lecture Notes in Math., 1007, 30-38 Springer, Berlin, 1983. [4] R.Bowen. Equilibrium States and Ergodic Theory of Anosov Diffeomorphisms. Lecture Notes in Mathematics 470. Springer-Verlag, Berlin Heidelberg New York 1975. [5] P.Collet, J.-P.Eckmann. Oscillations of Observables in 1-Dimensional Lattice Systems. Math. Phys. Elec. Journ. 3, 1-19 (1997). [6] M.Denker.The central limit theorem for dynamical systems. In Dynamical systems and ergodic theory. Banach Center Publ., 23, 33-62 PWN, Warsaw, 1989. [7] T.Donarowicz, B.Weiss. Entropy theorems along the time when x visits a set. Illinois Journ. Math. To appear. [8] P.Doukhan. Mixing. Properties and examples. Lecture Notes in Statistics, 85. Springer-Verlag, New York, 1994. [9] V.Ivanov. Geometric properties of monotone fluctuations and probabilities of random fluctuations. Siberian Math. Journal 37, 102-129 (1996). Oscillation of means in the ergodic theorem. Doklady Mathematics 53, 263-265 (1996). [10] A.Kachurovskii. The rate of convergence in the ergodic theorems. Russian Math. Surveys 51, 73-124 (1996). [11] S.Kalikow. Outline of Ergodic troy.msci.memphis.edu/ quasa/kalikow/kalikow.pdf.
Theory.
[12] S.Kalikov, B.Weiss. Fluctuations of the ergodic averages. Illinois J. Math. 43, 480-488 (1999). ´ Y.Sinai, S.Fomin. Ergodic Theory. Springer-Verlag New-York, 1980. [13] I.Kornfeld, [14] U.Krengel. Ergodic Theorems. Walter de Gruyter, Berlin, New York 1985. [15] O.Lanford. Entropy and equilibrium states in classical statistical mechanics. In Statistical mechanics and Mathematical Problems. Lecture Notes in Physics 20, 1-113, Springer-Verlag, Berlin 1973. [16] L.Markus, K.Meyer. Generic Hamiltonian dynamical systems are neither integrable nor ergodic. Memoirs of the American Mathematical Society, 144. American Mathematical Society, Providence, R.I., 1974.
14 [17] M.Keane. Ergodic theory and subshifts of finite type. In Ergodic theory, symbolic dynamics, and hyperbolic spaces, 35-70. Oxford Sci. Publ., Oxford Univ. Press, New York, 1991. [18] D.Ornstein. Ergodic Theory, Randomness, and Dynamical Systems. Yale University Press, New Haven London 1974. [19] D.Ornstein, B.Weiss. Entropy and data compression schemes. stationary random fields. IEEE Trans. Information Theory 39, 78-83 (1993). [20] K.Petersen. Ergodic Theory. Cambridge University Press, Cambridge 1983. See also http://www.math.unc.edu/Faculty/petersen. [21] D.Ruelle. Thermodynamic formalism. Addison-Wesley, Reading, 1978. [22] J.von-Neumann Proof of the quasi ergodic hypothesis. Proc. Nat. Acad. Sci. USA, 18, 70-82 (1932). [23] K.Reinhold. A smoother ergodic average. Illinois Journ. Math. 44, 843-859 (2000). [24] Y.Sinai. Introduction to Ergodic Theory. Princeton University Press, Princeton 1976.
NOTES ON SPECTRAL THEORY, MIXING AND TRANSPORT. Maurice Courbage Universit´e Paris 7 - Denis Diderot. L.P.T.M.C. Tour 24-14.5`eme ´etage 2, Place Jussieu 75251 Paris Cedex 05 - FRANCE
[email protected]
Abstract
1.
The purpose of this paper is to survey shortly some notions in the spectral theory of ergodic dynamical systems and their relevance to mixing and weak mixing. In addition, we present some dynamical systems of particles submitted to collisions with nondispersive obstacles and their ergodic and spectral properties. Transport is formulated in terms of random walk generated by deterministic dynamical systems and their moments.
Introduction
Transport in physical systems is mainly modelled by diffusion processes. For systems of noninteracting particles having ”chaotic” motion, diffusion appears in the long-time limit as a result of a random walk generated by the deterministic dynamics with invariant probability measure. The machinery is an extension of the central limit theorem to deterministic dynamical systems. Such extensions goes back to works by Sinai [26] in 1960. It is generally beleived that diffusion is related to mixing properties of the motion of the particles. However, this question is not yet quite clear. We shall discuss in the last section some recent results on central limit theorem and mixing properties. Spectral theory of Dynamical Systems provided powerful tools to study mixing and its rate. In 1931, B.O. Koopman pubished his paper entitled ” Hamiltonian systems and transformations in Hilbert space” in which he showed how a measure-preserving transformation T induces a unitary operator U on the Hilbert space of the measurable functions 15 P. Collet et al. (eds.), Chaotic Dynamics and Transport in Classical and Quantum Systems, 15–33. © 2005 Kluwer Academic Publishers. Printed in the Netherlands.
16 of L2 type [18]. This led von Neumann to publish in 1932 a proof of the ergodic theorem in this Hilbert space (see reference in the paper of P. Collet in this volume [9]). Hopf, Koopman and von Neumann studied the relationship between mixing properties and the spectrum of U showing that for T , being weakly mixing is equivalent, for U , to having continuous spectrum [16, 19]. Later on, von Neumann and Halmos classified completely the dynamical systems having purely discrete spectrum. All these results are presented in the Halmos book in 1956 [14]. In the sixties, many progresses were made in studying the stucture of the continuous spectrum of K-systems with works of Kolmogorov, Sinai and Rokhlin [10]. In the same period, Anzai introduced a new class of dynamical systems, the class of skew products which have zero entrpoy and continuous spectrum. Continuous spectrum has been found also in other examples of dynamical systems with zero entropy, namely interval exchanges. During the last 30 years, there were many spectral studies in this kind of dynamical systems ( for a review, see [13]). On the other hand, some results on the central limit theorem in weakly dependent processes and its relation to mixing have been presented, namely by I.A. Ibragimov [17] and P. Billingsley [3], see also the review by A. Liverani [21].
2.
Preliminaries on Spectral Theory of Dynamical Systems
We shall only consider DS with an invariant probability measure. For an ergodic system, as a result of the Birkhoff theorm (see [9]) applied to the characteristic function 1A of a subset A, the invariant measure describes the frequency of visit of a typical trajectory to any given measurable set. Definition 2.1 Let X be a measurable space with a probability measure µ and let A be the family of all measurable subsets. A dynamical system (DS) is an invertible measurable transformation T on a X , which is measure-preserving, that is, µ(T −1 A)) = µ(A) for any A ∈ A. In what follows we shall denote a DS simply by (X, T, µ). As T may have many invariant measures, the measure µ will be specified in each example. The Koopman unitary operator associated to T is defined on the Hilbert space H = L2 (X, µ) by : U f (x) = f (T x)
(2.1)
Notes on Spectral Theory, Mixing and Transport.
17
In order to stress on the dependence of U with respect to T, we should use the notation UT , but we shall omit it and use it only when necessary. The spectral properties of this operator are called the spectral properties of the DS. The first important spectral property of a DS is a characterization of its ergodicity. Recall that (X, T, µ) is ergodic if any invariant measurable subset A (i.e. T A = A, eventually modulo a subset of zero measure) has either zero measure or full measure. Spectral characterization of ergodicity is given by: Theorem 2.2 (X, T, µ) is ergodic if and only if the only eigenfunction of U for the eigenvalue 1 is the constant function. The famous elementary example in this respect is the rotation of the circle. Let X = S 1 be the circle of length 1, identified with the interval [0, 1[, let α ∈ [0, 1[, T (x) = x + α and µ = µL the Lebesgue measure, then the orthonormal basis of L2 (X, µ) given by: ϕn (x) = exp(2inπx), n ∈ Z, is a family of eigenfunctions of U for the eigenvalues λn = exp(2iπnα). The above theorem implies that T is ergodic if and only if α is an irrational number. Definition 2.3 T is said to have a discrete spectrum if U has a complete orthonormal family of eigenfunctions. The spectrum of U was very important since the early stage of the Ergodic Theory when Halmos and von Neumann proved that two ergodic systems, (X, T, µ) and (Y, S, ν), both having discrete spectrum, are isomorphic if and only if UT and US have the same set of eigenvalues. This is no more true when one of these systems has not a purely discrete spectrum. Let us call, in this case, the discrete spectrum subspace of U , Hd , the subspace generated by all the eigenfunctions of U , this means that the orthogonal complement of this subspace, H⊥ d , called the continuous spectrum subspace, Hc , is not reduced to zero. A useful quantity in order to characterize the continuous spectrum is given by the spectral measure of a function f . One needs here to use the notion of Fourier coefficients of any measure µ on the circle S 1 defined by: 1 µ ˆ(n) = exp(2iπnλ)dµ(λ) (2.2) 0
The Bochner-Hergoltz theorem asserts that any positive definite sequence of numbers is a sequence of Fourier coefficients of some measure uniquely defined by it (we refer to [10, 24] for more informations) . That
18 is the case for the sequence < U n f, f > called the auto-correlation coefficients of f , where < f, g > is the scalar product on H = L2 (X, µ). Thus, we associate to each f of H = L2 (X, µ) a unique spectral measure σf on the circle S 1 such that:
1
n
< U f, f >=
exp(2iπnλ)dσf (λ) = σ ˆf (n)
(2.3)
0
In other words, these autocorrelations coefficients of f are the Fourier coefficients of the spectral measure σf . It is possible to show that a function f ∈ Hc if and only if σf (λ) = 0, ∀λ. Then, the measure σf is said to be continuous.The Wiener Lemma asserts that: 1 lim | σˆf (k) |2 = (σf (λi ))2 n→∞ n n−1
(2.4)
i
k=0
where λi are the points of the circle such that σf (λi ) > 0 (for a proof, see [10]). The left hand side of the above equation is called the Cesaro-mean of | σˆf (k) |2 . Thus, the convergence to zero or not of the above Cesaromean gives a characterization of the continuity or not of the spectral measure of f . A sufficient condition for the continuity of the spectral measure is the decay of the auto-correlation coefficients ( for, the convergence to zero of a numerical sequence implies the convergence to zero of its Cesaro-mean), but it is not necessary. The relation of the continuity of the spectral measure to the behavior of the auto-correlations coefficients of f can be further characterized and we refer to [10]. A continuous measure σf is said to be ”absolutely continuous with respect to the Lebesgue measure” if it has a density with respect to the Lebesgue measure, dσf (λ) = ρ(λ)dλ, where: ρ(λ) =
∞
σ ˆf (n)exp(2iπnλ)
(2.5)
n=−∞
It follows that σf is the Lebegue measure (i.e. ρ = 1) if σ ˆf (n) = 0, ∀n = 0. If an absolutely continuous measure has density ρ(λ) which can vanish only on a subset of zero Lebesgue measure, then it is said to be equivalent to the Lebesgue measure. This is the case, for instance, if the Fourier coefficients σ ˆf (n) decay exponentially rapidly as |n| → ∞. In fact, the density ρ(λ) given above as an entire series of z = exp(2iπλ) will be uniformly convergent, so that it has analytic continuation in some annulus around the unit circle. Therefore ρ(λ) has only finite number of zeros.
19
Notes on Spectral Theory, Mixing and Transport.
Singular continuous measures σf are such that one can find a set of zero Lebesgue measure which is of measure 1 for σf and vice versa. They are often obtained in DS with zero entropy. Definition 2.4 A DS is mixing if for any A, B ∈ A, lim µ(T −n A ∩ B) = µ(A)µ(B)
(2.6)
n→∞
It is weakly mixing if for any A, B ∈ A, 1 | µ(T −n A ∩ B) − µ(A)µ(B) |= 0 n→∞ n n−1
lim
(2.7)
k=0
We have the following hierarchy of ergodic properties: Mixing ⇒ Weak mixing ⇒ Ergodicity Mixing is equivalent to the decay of correlations of two functions f and g of L2 (X, µ), which means : n | f (T x)g(x)dµ − f (x)dµ g(x)dµ |→ 0 as n → ∞ (2.8) X
X
X
and weakly mixing is equivalent to the decay in Cesaro-mean, i.e. 1 | n→∞ n n−1
k=0
f (T n x)g(x)dµ −
lim
X
g(x)dµ |= 0
f (x)dµ X
(2.9)
X
The following theorem gives a spectral characterization of these properties: Theorem 2.5 Let (X, T, µ) be a DS. • T is mixing iff, for any function f such that f dµ = 0, σˆf (n) → 0 as n → ∞ • T is weakly mixing iff for any function f such that f dµ = 0, σf is continuous. Rapid decay of correlations is the short memory signature of deterministic dynamical systems, among them the class of Bernoulli systems is the most ”stochastic”. Bernoulli systems are systems that are isomorphic to a sequence of independent identically distributed (I.I.D.) random variables. This means that the system (X, T, µ) posseses a generating partition, P = A1 , · · · , Ak (k finite or not), which is independent, Z that is, the map Φ from X to 1, · · · , k given by: Φn (x) = l
if
T n (x) ∈ Al .
20 is one-to-one and this sequence of random variables is independent. The best known example of such system is the baker tranformation, for which the partition P is the division of the unit rectangle into left and right halves. Then, the system is mixing and the entropy of the system is equal to the entropy of the Bernoulli shift (for this notion see [9]). Kolmogorov introduced an intermediate class of transformations, the so-called Ksystems which are in between mixing and Bernoulli systems. A convenient definition is given in terms of the entropy Hµ (T, P). Although the entropy was introduced by Kolmogorov as an invariant quantity preserved by isomorphisms of DS, it can be understood as the measure the non-predictability of the system under observations of the partitition P [22]. The K-systems are characterized as those for which this entropy is strictly positive for any finite partition P. As we mentioned above, Bernoulli systems satisfy the K-property. Thus, we have the following hierarchy: Bernoulli ⇒ K- property ⇒ Mixing ⇒ Weak mixing ⇒ Ergodicity The spectral properties of K-systems are all the same, so we can say that all K-systems are spectrally isomorphic. In particular, there is no spectral difference between those K-systems that are Bernoulli and those which are not. We have the following theorem: Theorem 2.6 Let (X, T, µ) be a K-system. Then, U has countable Lebesgue spectrum as an operator restricted to the orthocomplement of the constant function, {1}⊥ . The theorem means that {1}⊥ decomposes into a countable direct sum of orthogonal invariant subspaces ⊕Hi , i ∈ Z such that U is reduced in each subspace Hi to shift operator acting on an orthonormal basis {ei,j , j ∈ Z}: U ei,j = ei,j+1 . As a consequence, the spectral measure σei,j is the Lebesgue measure. This follows from the computation of the Fourier coefficients: σ ˆei,j (k) are all zero for any i = j and they are identical to the Fourier coefficients of the Lebesgue measure on the circle.
3.
Dynamical Systems with Zero Entropy
This is a rich family of systems including nondispersive billiards and aperiodic transformations which display divergence of trajectories with a power-law rate and some mildly unpredictabililty in the sense of the linear prediction theory (see references in [12]) among them we shall consider mainly examples of skew products of dynamical systems. We first define the general concept of skew products of DS.
Notes on Spectral Theory, Mixing and Transport.
21
Definition 3.1 Let (X, τ, µ) be a DS, (Y, ν) be a probability measure space and for µ-almost all x ∈ X, let Sx be a ν-measure-preserving transformations on Y . The transformation T acting on the product space X × Y defined by : T (x, y) = (τ (x), Sx (y))
(3.10)
preserves the product measure µ × ν. The DS (T, X × Y, µ × ν) is called a skew product of transformations. A particularly important case which occurs in quasi-periodic integrable systems, is the one where Y is a compact group G endowed with the Haar measure m ( a kind of ”Lebesgue measure” on G) and where Sx is given by a ”cocycle”, that is, a function φ : x ∈ X → G and defined by : g ∈ G → Sx (g) = φ(x).g. The skew product T : X × G → X × G defined by: T (x, g) = (τ (x), φ(x).g)
(3.11)
is called a group extension of τ . It is possible to study the ergodic properties of T in terms of the properties of τ and φ . An important property proved by Abramov-Rokhlin is that the metric entropy is zero if τ has zero entropy (see [23]). Here we shall consider two examples of group extensions of the circle rotation on X = S 1 , with τ (x) = x+α, and µ the Lebesgue measure on the circle. I. First Example : G = {±1} We start in showing a relation between these transformations and the plate billiard model with slit introduced by Zaslavsky [27]. A particle moves on an infinite plane among periodically distributed plate obstacles of length β < 1 separated by slits, the spatial period in both (x,y) directions is 1 (see fig.1, in the case β = 1/2 ). The particle reflects elastically at each collision with the obstacle. Let θ be the absolute value of the angle between the outgoing velocity vector and the obstacle. The particle will move either always to the right or always to the left undergoing reflections, according to the value of the angle θ. Let us suppose that 0 < θ < π2 . At time t=0, the coordinates of the particle are given by its position (x0 , 0) and the direction of its ingoing velocity .The position of the particle will increase between time t=0 and time t=1 by α along x-direction and by ±1 along y-direction where α = 1/tg(θ). The trajectory of the particle will be specified, at times t=n, by its x-coordinate xn and the projection of the ingoing velocity vector along the y-direction, n , which will change under a collision. Thus, n = ±1 according as the velocity is upward or downward. We call
22
Figure 1.
Trajectory of particle in the plate billiard with slits
n the ”veolcity direction of the particle”. Let us introduce the ”cocycle ” function: x ∈ [0, 1[→ {±1} as follows : −1 if x ∈ [0, β[ χ(x) = (3.12) +1 if x ∈ [β, 1[ The transformation T maps the state of the particle (x, ) at time t = 0 into the state of the particle at time t=1 according to the formula: T (x, ) = (x + α(mod1), χ(x)ε)
(3.13)
So T maps an ingoing arrow to the next ingoing arrow. When G is endowed with the Haar measure m(±1) = 1/2, T is a two-elements group extension of the rotation. Spectral Properties As well known, the space H = L2 (S 1 × G, µ × m) is a tensor product L2 (S 1 , µ) ⊗ L2 (G, m). It decomposes, by using the orthonormal basis {1, ε} of L2 (G, m), into a direct sum H = H1 ⊕ H2 where : H1 = {g(x) ∈ L2 (S 1 , µ)} H2 = {εh(y), h ∈ L2 (S 1 , µ)}
(3.14) (3.15)
In other words, for any f ∈ L2 (S 1 , µ) ⊗ L2 (G, m), there are g, h ∈ L2 (S 1 , µ) such that : f (x, ε) = g(x) + εh(x). The action of U restricted
Notes on Spectral Theory, Mixing and Transport.
23
to H1 (resp. H2 ) is given by: U g(x) = g(x + α) (resp. U (εh(x)) = εχ(x)h(x + α)). It shows that H1 and H2 are invariant. Therefore, the spectrum of U restricted to H1 is reduced to the spectrum of the the Koopman operator of the rotation on H1 . The spectral measure associated to any function from H2 is given through the Fourier coefficients: < U n (εh), εh) >. It is convenient to introduce the unitary operator Vχ on L2 (S 1 , µL ) given by: Vχ h(x) = χ(x)h(x + α)
(3.16)
Now, using the relation U n (εh) = εVχn (h) we obtain: < U n (εh), εh) >=< εVχn (h), εh) >=< Vχn (h), h) > which means that the spectrum of U restricted to H2 is reduced to the spectrum of Vχ on L2 (S 1 , µ). The spectrum of this operator have been studied first in the case β = 1/2 and later in more general case . In the first case, it is shown that for any irrational α, Vχ has no eigenfunction in L2 (S 1 , µ), which means that U restricted to H2 has only continuous spectrum. This immediately implies that the system is ergodic. In the general case, the same result holds for some class of α and β with diophantine properties. The spectrum is singularly continuous for every irrational α and almost all β. We refer to [10, 24] for more informations on the ergodic and spectral properties of these transformations. Decay of correlations Now, back to the direction of the (ingoing) velocity at time t = n: εn (x, ε) = χ(x + (n − 1)α) × ....χ(x)ε
(3.17)
If we define the function f (x, ε) = ε, we have εn (x, ε) = f (T n (x, ε)). Clearly the expectation of the velocity directions at all time εi (x, ε) with respect to the invariant measure is zero and its autocorrelation coefficients are < εn , ε0 >=< Vχn (1), 1) >. As the spectrum of Vχ is continuous for α = 1/2, by the Wiener Lemma we have only a decay of correlations in Cesaro-mean: 1 |< εn , ε0 >|2 = 0 n→∞ n n−1
lim
(3.18)
k=0
This result holds also for the absolute value. While the distance traveled by the particle along the x-direction is alway xn = nα, the distance traveled by the particle along y-direction depend on the initial condition (x, ε) and seems as a random walk. This distance, at t=n, is : Sn (x, ε) =
n i=1
εi (x, ε)
(3.19)
24 The mean value of Sn over the initial conditions is zero and the problem is to estimate the asymptotic behavior of the variance of Sn . We shall come back to this question in the next section. II.Second example: G = S 1 A particle moves on an infinite plane among periodically distributed obstacles with spatial period equal to 1 along both (q1 , q2 )-directions. In the q1 -direction, the motion of the particle is uniformly accelerated at each regular time interval by an amount α and has uniform free motion along the q2 -direction. That is, define the velocity p1 (n) = q1 (n + 1) − q1 (n) , then the equations of the projection of the motion in the q1 direction are : q1 (n) = q1 (n − 1) + p1 (n − 1) p1 (n) = p1 (n − 1) + α
(3.20) (3.21)
It is the result of the action of the mapping: T : (p1 , q1 ) → T (p1 , q1 ) given by: T (p1 , q1 ) = (p1 + α, q1 + p1 )
(3.22)
q1 (n) = q1 (0) + np1 (0) + n(n − 1)α/2
(3.23)
Thus, we obtain:
The particle is moreover submitted at the begining of each time interval to a deterministic ”collision” changing the direction of the motion motion up and down along q2 -direction in the following way: the projection of the velocity of the particle p2 at time t = n is given by χ(q1 (n)) where χ(x) is a periodic discontinuous function defined by: −1 if x ∈]0, 1/2] χ(x) = (3.24) 1 if x ∈]1/2, 1] That is, the direction of the velocity at time t = n is : εn (p1 (0), q1 (0)) = χ(q1 (n)) = χ(q1 (0) + np1 (0) + n(n − 1)α/2) (3.25) and the value of the variable q2 at time t = n + 1 is:
q2 (n + 1) = q2 (n) + χ(q1 (n)) =
n
εi (p1 (0), q1 (0))
(3.26)
1
A trajectory is shown in the figure 2. The transformation (3.22) on the Torus T2 is a particular case of the group extension given by a function
25
Notes on Spectral Theory, Mixing and Transport.
2
1
25
50
75
100
125
150
-1
-2
-3
-4
-5
Figure 2. Trajectory of a particle of the example II moving with initial null velocity with α = 1/ (7)
φ(x) from S 1 into R and defined as a transformation of the Torus T2 by: T (x, y) = (x + α, y + φ(x))
mod 1
(3.27)
Spectral properties What are the spectral properties of T ? A function f ∈ L2 (T2 ) can be decomposed into a sum of orthogonal functions as: f (x, y) =
∞
e2iπny hn (x)
n=−∞
The subspace of functions depending only of x is invariant and, as above, the restriction of U to this subspace has the discrete spectrum of the rotation on S 1 . All other subspaces of functions of the form e2iπny hn (x) are invariant. Thus the operator U decomposes into direct sum of operators ⊕ Un each acting on these subspaces. The spectrum of Un depends on the properties of φ(x). In the case of equation (3.22), the spectrum is equivalent to the Lebesgue measure. This is also the case for (3.27) if φ(x) = x + g(x) where g has rapidly decreasing Fourier coefficients. But, in general, the spectrum can be purely discrete, or singularly continuous according to the properties of φ(x), we refer to [13] for more detailed
26 results and references. Decay of Correlations If φ(x) = kx, k ∈ Z, k = 0 , there are functions f for which the autocorrelation coefficients decay exponentially rapidly [11]. In particular, the function f (x, y) = χ(y), for example, has vanishing autocorrelations coefficients: σ ˆχ (n) = 0 for any n = 0, so that its spectral measure is the Lebesgue measure. It defines a pairwise independent process with long range dependence. The two-valued function χ(y) on T2 defines a partition {A, AC } of the torus into two regions, the upper half and the lower half of the torus: A = {(x, y) : χ(y) = 1} and AC = {(x, y) : χ(y) = −1} such that: µ(Ai ∩ T −n Aj ) = µ(Ai )µ(Aj ) for any n = 0, where Ai is either A or Ac . We call such partitions pairwise independent. In [11] and [12], it was determined a large family of pairwise independent partitions. That is equivalent to say that for the functions f = 1A − µ(A), the family of functions f ◦ T n are pairwise independent random variables, which does not imply that these variables are jointly independent or Markovian. Actually, the process has infinite memory and its metric entropy is zero. That is on the opposite of the Markov chains of finite memory which have always positive entropy. We conclude that the velocity direction εn is a pairwise independent process with Lebesgue spectrum and zero entropy. Neverthless, this process is unpredictable in the sense of least squares prediction theory [12].
4.
Transport properties
The mechanical origin of transport processes has been discusssed from several points of view ranging from the Boltzmann equation to the derivation of the Brownian motion. As a model of a particle dynamics producing a transport process, the Lorentz gas model of noninteracting particles moving among scatterers have been abundantly studied in order to illustrate these points of view. One classical way consists in the derivation of the Boltzmann equation, either from the Liouville equation or directly under the Grad limit [15], obtaining then a hydrodynamic description. In 1981, Bunimovich and Sinai [5, 6] used methods of probability theory and dynamical systems theory to obtain a diffusion equation for the motion of noninteracting gas of particles elastically scattered among a periodic array of fixed convex discs. The machinery used is that of the central limit theorems in dynamical systems under
Notes on Spectral Theory, Mixing and Transport.
27
the invariant measure. This is a generalization of the usual central limit theorem which is formulated in the following terms. If (X, T, µ) is a dynamical system and f ∈ L2 (X, µ) is a function with zero mean and a finite second moment σ 2 , such that {f (T n x)} form an independent sequence of random variables (with respect to µ), then f satisfies the central limit theorem, that is,
n−1 1 1 x2 n f (T x) ∈ I = √ exp(− 2 )dx (4.28) lim µ x : √ n→∞ 2σ n 2πσ I i=0
n converges in law In other words, the normalized sum √1n n−1 i=0 f ◦ T to a gaussian variable of zero mean value and variance σ 2 . Moreover, f satisfies to the ”invariance principle” which means that the following rescaled sums converge to the Wiener process, i.e. [t/τ ] √ τ f ◦ T n → Yt n=0
τ →0
(4.29)
where t ∈ [0, 1] and Yt is the Brownian process. The simplest ”toy model” of random walk generated by a deterministic ”chaotic” DS is the following: a particle with an internal state x ∈ X, moves on the lattice Z where it is subject to a deterministic ”collision” with an obstacle at each node of the lattice. The ”collision” is modelled by a Bernoulli DS (X, B, µ). Let m ∈ Z denote the initial position of the particle. The dynamics of the system is defined by a transformation T : X ×Z → X ×Z : T (x, m) = (Bx, m + ξ0 (x))
(4.30)
where ξ0 is a function taking the values ±1. At time t = n, the state of the particle is (B n (x), m + ξ0 (x) + ξ0 (B(x)) + .... + ξ0 (B (n−1) (x))) and the position the particle, for an initial condition m = 0, is given of n−1 i i by Sn ξ0 (x) = i=0 ξ0 (B (x)). If the variables {ξ0 (B (x))} are independent with respect to µ, then this random walk will converge to the diffusion process. For example, in the special case of the baker transform (B, T2 , µ) where µ is the Lebesgue measure on T2 , the independence of ξ0 (B i (x, y) is equivalent to the independence of the traditional partition of the square in two half squares corresponding to ξ0 (x, y) = ±1 according that (x, y) belongs to one or another element of this partition (we refer to most textbooks in ergodic theory and dynamical systems for more mathematical details on the Bernoulli systems).
28 In general, a given two-valued or smooth function will not generate an independent sequence. There were in probability theory several generalizations of the central limit theorem to the case where the sequence is not independent. It was first proved in the case of a markovian sequence (for a proof see in [2]), then extended to the case of a weakly dependent sequence [3] with some mixing properties. Related results in hyperbolic DS go back to the geodesic flow [26] and later to Anosov systems [25]. The ”diffusion coefficient” σ is defined by the convergence of the following limit: 1 n
n−1 ( f (T n x))2 dµ(x) −→ σ 2 n→∞
I i=0
(4.31)
which exists only for some ”large” class of ”smooth” functions f . If the stationary sequence of random variables f (T n x)) are independent, the n variance of the ”Birkhoff sums” Sn f (x) = n−1 i=0 f (T x)) is equal to: Sn f 2 =
n−1 i=0
(f (T n x))2 dµ(x) = nf 2
(4.32)
I
since the independence implies that the autocorrelation coefficients < U n f, f >= 0 for any n = 0. This relation holds also if the sequence is pairwise independent, which occurs even with zero Kolmogorov entropy (see explained above). In that case σ = f . For the Lorentz model with finite horizon, studying the hyperbolic properties of collisions of a particle among a periodic array of convex obstacles, Bunimovich and Sinai proved the property (4.31) for the position of the particle and showed a central limit theorem and the convergence to diffusion. For a recent survey see [8]. All these results imply the K-property. Beck and Roepstorff developped an analogous model of the Langevin equation by the convergence of such kind of random walk generated by Bernoulli DS to the Ornstein-Uhlenbeck process [1]. In general nonhyperbolic DS, (X, T, µ), a first question is the convergence of (4.31) to a finite non zero ”diffusion coefficient” σ for some ”large” class of ”smooth” functions f. But, this quantity may diverge or converge to zero.Then the central limit theorem means the convergence of the normalized sums Sn1 f Sn f (x) in distribution to the reduced normal law. Such theorem does not imply necessarly mixing properties. The correlations may not decay at all, as shown in the examples of Burton and Denker [7]. They constructed a class of functions f satisfying CLT for any aperiodic DS (including the irrational rotation). Clearly,
29
Notes on Spectral Theory, Mixing and Transport.
the correlation coefficients will not decay when the spectral measure is discrete. These examples have been generalized and there were other results on the convergence of normalized Birkhoff sums to self-similar processes [20]. In our first example of random walk of the previous section, numerical simulations of Zaslavsky and Edelman [27] have shown that anomalous superdiffusion is expected and the property (4.31) is likely not to hold for the sum ni=1 f (T i (x, ε)). Let us compute the second moment of Sn2 in the case where α is a rational number. For the initial condition (x,), we have: (x1 , 1 ) = (x + α, φ(x)) (x2 , 2 ) = (x + 2α, φ(x + α)φ(x)) ... (xn , n ) = (x + nα, φ(x + (n − 1)α) ... φ(x)).
(4.33)
φn (x) = φ(x + (n − 1)α) ... φ(x)
(4.34)
Denote by:
Then:
n
Sn =
φi (x), < Sn >= 0
(4.35)
i=1
We have: <
Sn2
> =
n i,j=1
=
i
φi (x)φj (x) dx
0 1
0
= n +2
1
φ2i (x)
dx + 2
i−1 n i=2 j=1
(4.36)
1
φi (x)φj (x) dx
0
i<j 1
φi (x)φj (x) dx
(4.37)
0
But, φi (x)φj (x) = φ(x + jα) ... φ(x + (i − 1)α)
(4.38)
So < Sn2 > = n + 2
i−1 n i=2 j=1
= n+2
n−1 k=1
1
φi−j (x) dx
(4.39)
0
(n − k)
1
φk (x) dx 0
(4.40)
30 For α = pq . φk+2q (x) = φk (x), for (φ(x))2 = 1. So let n − 1 = 2rq + l, l ≤ 2q − 1. Therefore
<
Sn2
2qr >= n + 2 (n − k)
φk (x) dx + 0
k=1
2qr+l
1
1
(n − k)
φk (x) dx 0
k=2qr+1
(4.41) However, 2qr
=
r−1
(s+1)2q
(4.42)
s=0 k=s2q+1
k=1
Using m = k − 2qs, the second part of (4.41) could be rewritten as
=
=
=
2q r−1 s=0 m=1 2q r−1
(n − s2q − m)
1
φs2q+m (x) dx
(4.43)
φm (x) dx
(4.44)
0
(n − s2q − m)
s=0 m=1 2q 1 m=1
=
1
0
φm (x) dx
r−1
0
r(r − 1)2q rn − 2
s=0 2q
(n − s2q − m)
m=1 0
1
φm (x) dx − r
(4.45) 2q
1
m φm (x) dx
m=1 0
with rn − r(r − 1)q = qr2 + r(2l + q) ∼ = Cn2 where C is a constant. So this is a balistic motion. In the second example, although the second moment of Sn f is of the n 2 2 order of n, since Sn f 2 = I ( n−1 f i=0 (T x)) dµ(x) = nf , the behavior of the higher order moments depend on α. As this random walk is symmetrical with respect to zero, all odd moments are zero. Consider, for example, the moment of order 4. It behaves like n3 for rational α, and like n2 for all α having continous fraction expansion with bounded quotients. More generally, the moments of order 2k behave like n2k−1 in the rational case, and like nk for the irrational case with bounded quotients [4]. For all other cases, the behavior of the moments depend on the behavior of the quotients of the expansion of α excluding any asymptotic normal behavior for the normalized sum n1 εi (p1 (0), q1 (0))
Notes on Spectral Theory, Mixing and Transport.
31
Acknowledgments We would like to thank G.M. Zaslavsky for fruitful discussions on the plate billards.
32
References
[1] C. Beck and G. Roepstorff, From dynamical systems to the Langevin equation, Physica A, 145, 1-14, 1987. [2] P. Billingsley, Probability and measure, Wiley, NY, 1986 [3] P. Billingsley, Convergence of probability measures, Wiley, 1968 [4] M. Bernardo, M. Courbage , T.T. Truong , Multidimensional gaussian sums arising from distributions of sums of pairwise independent sequence of zero entropy, preprint LPTMC, and , Random walks generated by area preserving maps with zero Lyapounov exponents, Communications in Nonlinear Science and Numerical Simulations, 8, 189-199 (2003). [5] L.A. Bunimovich , Ya. G. Sinai, Statistical properties of Lorentz gas with periodic configuration of scatterers. Comm. Math. Phys. 78, 1981, 479–497. [6] L. A. Bunimovich, Ya. G. Sinai , N. I. Chernov, Markov partitions for twodimensional hyperbolic billiards. (Russian) Uspekhi Mat. Nauk. 45, 1990, no. 3 (273), 97–134; translation in Russian Math. Surveys , 45, 1990, no. 3, 105–152 [7] B.Burton and M. Denker, On the central limit theorem for dynamical systems, Trans. Amer. Math. Soc. 302, 121-134 [8] N.I. Chernov, L.S. Young, Decay of correlations for Lorentz gases and hard balls. Hard ball systems and the Lorentz gas, 89–120, Encyclopaedia Math. Sci., 101, Springer, Berlin, 2000. [9] P. Collet, A short ergodic theory refresher, in this volume. [10] I.P. Cornfeld, S.V. Fomin, Ya.G. Sinai, ”Ergodic theory”, Springer, New York, (1981). [11] M. Courbage, D. Hamdan, Decay of Correlation and mixing properties in a dynamical system with zero entropy. Ergod. Th. Dynam. Syst. 17, no.1, 87-103, 1997. [12] M. Courbage, D. Hamdan, Unpredictability in some nonchaotic dynamical systems, Phys.Rev.Lett. 74, 5166-5169, 1995. [13] G.R.Goodson, A survey of recent results in the spectral theory of ergodic dynamical systems , J. Dynam. Control Systems, 5, 173-226, 1999. [14] P.R. Halmos, Lectures in Ergodic Theory Chelsea Publishing Company, NY, 1956 [15] E.H. Hauge, What can we learn from Lorentz models, in G. Kirczenow and J. Marro ed. , Transport phenomena, p.337, Springer , 1974.
33 [16] E. Hopf, Proof of Gibbs hypothesis Proc.Natl. Acad. Sci. U.S.A. 18 , 333-340, 1932. [17] I.A. Ibragimov, Some limit theorems for stationary processes, Theory Prob. Appl., 7, 349-382, 1962. [18] B.O. Koopman, Hamiltonian systems and transformations in Hilbert space, Proc.Natl. Acad. Sci. U.S.A. 17 , 315-318, 1931. [19] B.O. Koopman and J. von Neumann, Dynamical systems and continuous spectra, Proc.Natl. Acad. Sci. U.S.A. 18, 255-263, 1932. [20] Michael T. Lacey, On weak convergence in dynamical systems to self-similar processes with spectral representation, Trans.Amer. Math. Soc. 328, 767-778, 1991. [21] C. Liverani ”Central limit for deterministic systems. ” in: International Conference on Dynamical Systems (Montevideo, 1995), 56–75, Pitman Res. Notes Math. Ser., 362, Longman, Harlow, 1996. [22] Donald S., Ornstein, Ergodic theory, randomness, and dynamical systems. Yale University Press, New Haven. [23] K.Petersen, Ergodic Theory, Cambridge University Press, 1983. [24] Martine Queffelec, Substitution Dynamical Systems-Spectral Analysis. LNM 1294, Springer -Verlag 1987. [25] M.E. Ratner, A central limit theorem for Y-flows on three-dimensional manifolds, Dokl. Akad. Nauk. SSSR, 186, 1969, 519-521, English translation : Soviet. Math. Dokl., 10, 629-631, 1969. [26] Ya.G. Sinai, The central limit theorem for geodesic flows on manifold with negative constant curvature, Soviet. Math.1, 983-986, 1960. [27] G.M. Zaslavsky and E. Edelman, Weak mixing and anomalous kinetics along filamented surfaces, CHAOS, 11 , 295-305, 2001.
This page intentionally left blank
COMPLEXITY, FRACTAL DIMENSIONS AND TOPOLOGICAL ENTROPY IN DYNAMICAL SYSTEMS Valentin Affraimovich, Lev Glebsky IICO–UASLP Av. Karakorum 1470, Lomas 4a. San Luis Potosı, ´ SLP. M´ ´xico
Abstract
Instability of orbits in dynamical systems is the reason for their complex behavior. Main characteristics of this complexity are –complexity, topological entropy and fractal dimension. In this two lectures we give a short introduction to ideas, results and machinery of this part of modern nonlinear dynamics
35 P. Collet et al. (eds.), Chaotic Dynamics and Transport in Classical and Quantum Systems, 35–72. © 2005 Kluwer Academic Publishers. Printed in the Netherlands.
This page intentionally left blank
37
PART I DYNAMICAL CHAOS IN TERMS OF THE -COMPLEXITY 1.
Definition of the (, n)-complexity.
Instability of orbits in a dynamical system causes complexity of their behaviour. There are some characteristics of instability. Among them are the local ones: for example Lyapunov exponents let measure the local rates of divergence of neighbouring orbits from a basic one; and the global ones: for example topological entropy that measures the number of –different types of segments of orbits of temporal lenghts t as t goes to infinity. Here we shall deal with the –complexity function. It is a global characteristic of instability that shows, roughly speaking, how many from very close to each other at the initial moment orbits became –recognizable at the moment t. It seems to us that the –complexity is worth studying in details because of the following: It is pre–limiting quantity — this function contains an information not only about asymptotics but about fluctuations as well; There is a direct link to fractal dimensions and the topological entropy, main parameters of dynamical chaos; It contains a non-trivial information not only in hyperbolic situations but also in “polynomial” ones.
1.1
(, n)-complexity
The definition of (, n)-complexity will be discussed following mainly Bowen [19]. Let us consider a dynamical system generated by an evolution operator f on the phase space M . Let A ⊂ Mbe a subset of initial points n−1 k f x an orbit segment of (it could be invariant or not) and n (x) = k=0 temporal length n going through an initial point x ∈ A. Two segments n (x) and n (y), x, y ∈ A, are said to be (, n)-separated if there exists k, 0 ≤ k ≤ n−1, such that dist(f k x, f k y) ≥ , where dist means distance in the phase space M . The maximal possible number of distinct segments of orbits with accuracy is defined by C,n (A) = max{#segments in a (, n) − mutually separated set}
(1)
38 and is said to be (, n)-complexity of the set A. One may define it in another way. Given a metric d on M introduce the metric dn as follows dn (x, y) =
max d(f i x, f i y).
0≤i≤n−1
Definition 1.1 1 Given > 0, n > 0, A ∈ M , a set Y ∈ A is (, n)–separated iff for any diferent x, y ∈ Y one has dn (x, y) ≥ . 2 The number C,n (A) = max{|Y |, Y is an (, n)–separated set}, where | · | denotes the cardinality of a set, i.e., the number of points in it, is called the (, n)–complexity of A It was shown in [B] (see also [24] for compact invariant subset of initial points) that h = htop (A) =: lim limn→∞ →0
log C,n (A) n
(2)
is the topological entropy of the dynamical system (f k , M ) on the set A, and in [T] (for Lipschitz–continuous f ) that b =: lim lim→0 n→∞
log C,n − log
(3)
is the upper box dimension of the set A. Thus, we may think that if 0 < b < ∞, 0 < h < ∞ then ¯ n) C,n (A) = −b · ehn · C(,
(4)
¯ n) is a subexponential function of ln and n. where C(, To illustrate the property (2), consider one-dimensional mixing dynamics on the interval [0, ], x ∈ [0, ] with an exponential divergence of trajectories. Let δx0 is the initial distance at t = 0 between two trajectories and δxt ≥ is the distance at time t. Then ≤ δx0 exp ht
(5)
i.e. for τ ≥ t two trajectories are separated. The number of such trajectories is A A ht C,t (A) e = (6) δx0 where A is the length of a small initial interval A. The properties (1) and (2) follow directly from (6) for b = 1. If the set A has the box-dimension b, then (5) should be replaced by (/δx0 )b ≤ eht
(7)
39
Dynamical Chaos in Terms of the -complexity
and correspondingly, instead of (6) C,t (A) (A /δx0 )b = (A /)b eht
(8)
For more general situations we may assume ¯ t) C,t (A) = (A /)b eht C(,
(9)
¯ t) is a slow varying function of ln and t. where C(, The expression (9) shows in an explicit way how the (, n)-complexity depends on the time interval t, accuracy and the domain A of a set of initial conditions. Remark 1.1 Complexity of an orbit. k If one chooses an orbit Γ(x0 ) = ∪∞ k=0 f x0 in the capacity of the set A of initial points, one will arrive to a definition of the -complexity of the orbit Γ(x0 ). It is not difficult to show that for any small δ > 0, C(1+δ),n (clos(Γ(x0 ))) ≤ C,n (Γ(x0 )) ≤ C,n (clos(Γ(x0 ))) , i.e., the complexity of the closure of an orbit asymptotically behaves in the same way as the complexity of the orbit. Furthermore, making use of the definition of complexity for an arbitrary set A, one may introduce the complexity of a measure. Definition 1.2 Given an invariant measure µ, the quantity C,t (µ) := inf {C,t (A) | µ(A) = 1} A
(10)
ia called the complexity of the measure µ.
1.2
Hausdorff and Box dimensions
Let X be a metric space with a distance d(x, y), x, y ∈ X. For any subset Z ⊂ X let {Ui } be a finite or countable collection of open sets of diameter less than such that Ui ⊃ Z; here diamUi := sup{d(x, y) : x, y ∈ Ui }. For any α > 0 we introduce (diam Ui )α , (11) m(α, , Z) = inf {Ui }
i
where infimum is taken over all covers {Ui } with diameter ≤ , and m(α, Z) = lim m(α, , Z), →0
(12)
40 the α–dimensional Hausdorff measure (the limit exists because of monotonicity of m(α, , Z) as a function of ). It is simple to see that m(β, , Z) ≤β−α m(α, , Z),which implies thatthere existsa unique critical value αc of α such that m(α, Z) = 0 if α > αc and m(α, Z) = ∞ if α < αc . The quantity αc =: dimH Z is called the Hausdorff dimension. We already mentioned the upper box dimension. It could be defined in a different way. In the sum 11 one may consider open set of diameter equals , i.e., m(α, , Z) = N · α where N is the number of such sets. Then m(α, Z) = lim sup→0 m(α, , Z), m(α, Z) = lim inf →0 m(α, , Z), and dimB Z = sup{α|m(α, Z) = ∞} is the upper box dimension, and dimB Z = sup{α|m(α, Z) = ∞} is the lower box dimension. If dimB Z = dimB Z = b then b is called the box dimension. Example 1.1 Let J be an invariant set of the map g : [0, λ0 ] ∪ [1 − λ1 , 1] → [0, 1], x/λ0 if x ∈ [0, λ0 ], g(x) = (13) 1−λ1 x if x ∈ [1 − λ1 , 1] λ1 − λ1 where 0 < λ0 < λ1 < 1, λ0 + λ1 < 1, consisting of all points of all orbits belonging to [0, 1]. It is clear that J is a Cantor set. Proposition 1.1 For the set J we have that dimH J = s0 , where s = s0 is the root of the equation λs0 + λs1 = 1.
(14)
To make (14) evident, consider the cover of J by basic sets of the n–th generation. Then the sum i (diam Ui )α in (11), up to a constant, becomes n−1 λαik = (λα0 + λα1 )n . (15) i0 ,...,in−1 k=0
If α > s0 , then (15) goes to zero as n → ∞, that shows us that dimH J ≤ s0 . To get the opposite inequality, people use the technique of so–called Moran covers [34]. Similar formulas could be obtained in the case when not all words are admissible, i.e., in the case of subshifts. In these cases Hausdorff dimensions of invariant sets can be expressed in terms of topological pressure. It was R. Bowen who introduced this quantity in the theory of dynamical systems [34, 20].
2.
Dynamical Chaos
We give a definition of dynamical chaos following mainly Takens’ ideas see [39, 40] and [8].
Dynamical Chaos in Terms of the -complexity
41
We say that a signal (an observable) φ(t) is generated by a dynamical system (f t , M ) if there exist an initial point x0 belonging to M and the function ψ : M → R such that φ(t) = ψ(f t x0 ). Consider the case of discrete time t ∈ Z. Introduce space of all bounded observables b = {a = (a0 , a1 , . . .), ai = φ(i) ∈ R} and endow it |ai | with the norm ||a|| = ∞ 0 2i , so that B becomes a Banach space. The shift map T a = (a1 , a2 , . . .) generates a “universal” dynamical system that generates all bounded observables. i Fix an observable a = (a0 , a1 , . . .) and denote by M the set clos ∞ i=0 T a , the set of limiting points of the orbit {T i a }. We say that an observable a = ( a0 , a1 , . . . ) is deterministically generated if
1 The fractal dimension dimB M = b < ∞
(16)
2 The topological entropy of f = T |M , h(f ) < ∞.
(17)
Because of the Ma˜ ne Theorem (see for instance[8]), the condition 16 implies that, generally speaking, for any n ≥ 2b + 1 the system (f t , M ) is topologically conjugated to the system generated by the map Tˆ : (ak , . . . , ak+n−1 ) → (ak+1 , . . . , ak+n ). It gives a clue how to “reconstruct” the original system (f t , M ) by knowing the only observable a . According to many specialists begining with Alekseyev [12], we deal with dynamical chaos if 0 < h(f ) < ∞. Thus, in terms of –complexity dynamical chaos means, in fact, the validity of ( 4) with 0 ≤ b < ∞, 0 < h < ∞.
3.
Symbolic dynamics
If one chooses a partition of the phase space by finitely many pieces, labels them by symbols, say {0, . . . , p − 1}, and denotes the position of the point at the moment n by the symbol an ∈ {0, . . . , p − 1}, then one determines a symbolic sequence corresponding to the orbit with the shift map corresponding to the evolution operator. More rigurously, given + p ∈ N, consider the set Ωp = {0, · · · , p − 1}Z endowed with the product topology and a distance compatible with this topology. A subshift is the
42 dynamical system (Ω, σ) where σ is the shift operator and Ω ⊂ Ωp is a closed and σ–invariant subset. A point in Ω is denoted by ω = {ωk }k≥0 . Given the word ω0 · · · ωn , ωi ∈ {0, · · · , p − 1}, the subset [ω0 · · · ωn ] := {ω ∈ Ω : ωi = ωi , 0 ≤ i ≤ n} is called a cylinder. Every cylinder is open and closed. A word ω0 · · · ωn , ωi ∈ {0, · · · , p − 1}, is said to be admissible in Ω if the corresponding cylinder [ω0 · · · ωn ] is not empty. There are many distances on Ω corresponding to the topology in which Ω is compact. For example let (λ0 , . . . , λq−1 ), 0 < λi < 1, be real numbers. Then, for every pair of points ω, ω ∈ Ω define the real non– negative function λω0 · · · λωi−1 , if ωk = ωk , 0 ≤ k < i, ωi = ωi (18) dΩ (ω, ω ) = 1, if ω0 = ω0 and dΩ (ω, ω) = 0. Very often people use this metric with λi = e−1 . A subshift (Ω, σ) is said to be (topologically) mixing if there exists k0 ∈ Z+ (the mixing time) such that for any admissible words ω0 · · · ωn and any k ≥ k , there exists a word ω · · · ω such that and ω0 · · · ωm 0 0 k is admissible. the concatenated word ω0 · · · ωn ω0 · · · ωk ω0 · · · ωm The subshift (Ω, σ) is said to be specified (or to have the specification property) if there exists n0 ∈ Z+ such that for any pair of admissible , there exists k ≤ n and a word ω · · · ω words, ω0 · · · ωn and ω0 · · · ωm 0 0 k is admissisuch that the concatenated word ω0 · · · ωn ω0 · · · ωk ω0 · · · ωm ble. For very important subshifts, so called topological Markov chains, a set Ω is defined by a transition matrix A, i.e. ω ∈ Ω iff Aωk ,ωk+1 = 1, k ≥ 0. Any mixing topological Markov chain is specified and has positive topological entropy.
3.1
Multipermutative systems
Among non–trivial systems with zero topological entropy the simplest one are multipermutative systems. Let Ω = {0, 1, . . . , q − 1}N0 with the metric (18). Definition 3.1 [2] A map T : Ω → Ω is said to be multipermutative if for every ω ∈ Ω the sequence T ω is given by T ω = (ω0 + p0 , ω1 + p1 (ω0 ), . . . , ωi + pi (ω0 , . . . , ωi−1 ), . . . ) with pi : Ai → A for i > 0 and p0 ∈ A = {0, . . . , q − 1}. At every coordinate addition is understood to be modulo q.
Dynamical Chaos in Terms of the -complexity
43
Cylinders of length L are denoted by ω L := [ω0 , . . . , ωL−1 ] ⊂ Ω, and i they determine the integer value ||ω L ||q = L−1 i=0 ωi q . Example 3.1 The q–adic adding machine is a multipermutative system (Ω, S) such that Sω = (ω0 + 1, ω1 + s1 (ω0 ), . . . , ωi + si (ω0 , . . . , ωi−1 ), . . . ), with si (ω0 , . . . , ωi−1 ) = 1 if (ω0 , . . . , ωi−1 ) is maximal and si (ω0 , . . . , ωi−1 ) = 0 otherwise. The word (ω0 , . . . , ωi−1 ) is maximal when ωj = q − 1 for j = 0, . . . , i − 1. For every L ≥ 1, a map {0, 1, . . . , q L − 1} → {0, 1, . . . , q − 1}L is well–defined where n → S n 0L = ω L is a bijection, and n = ||ω L ||q . For every L ≥ 1, the set {S n 0L : n = 0, 1, . . . , q L − 1} is a cycle of period q L . The next result is a dynamical characterization of minimal multipermutative systems. Theorem 1 [2] For (Ω, T ), a multipermutative system, the following four statements are equivalent. 1). (Ω, T ) is minimal. 2). For every L > 0 and every cylinder ω L := [ω0 , . . . , ωL−1 ], the sequence ω L , T ω L , T 2 ω L , . . . is periodic with smallest period q L . 3). For every L > 0, the numbers (“integrals”) πL := ω pL (ω L ) and L the constant p0 ∈ A are relatively prime to q. 4). (Ω, T )is topologically conjugate to the q–adic adding machine (Ω, S). The theorem tells us about universality of multipermutative systems in the case when one has the same number of symbols for every level. The next section is devoted to a more general situation.
Polysymbolic generalization. We consider now multipermutative systems with different alphabets Ai = {0, . . . , qi −1} at every coordinate i = 0, 1, . . . . Such systems will be referred to as polysymbolic systems. The set of sequences is Ωq∗ = A0 × A1 × · · · , and the size of alphabets at every coordinate i is denoted by the sequence q∗ = (q0 , q1 , . . .) of positive integers qi = card(Ai ), i ≥ 0. A polysymbolic system (Ωq∗ , T ) is multipermutative if for every ω = (ω0 , ω1 , . . . ) the map T : Ωq∗ → Ωq∗ is defined by T ω = (ω0 + p0 , ω1 + p1 (ω0 ), . . . , ωi + pi (ω0 , . . . , ωi−1 ), . . . ) with pi : A0 × · · · × Ai−1 → Ai and p0 ∈ A0 .
(19)
44 A polyadic adding machine (Ωq∗ , S) (called an odometer, too) is defined as the usual q–adic adding machine, except that a word (ω0 , . . . , ωi−1 ) ∈ A0 ×· · · ×Ai−1 is maximal when ωj = qj − 1 for each j = 0, . . . , i − 1. Theorem 1 is extended to polysymbolic systems as follows. Theorem 2 Let (Ωq∗ , T ) be a multipermutative system which is polysymbolic. Then the following statements are equivalent. (P1). (Ωq∗ , T ) is minimal. (P2). For every L > 0 and every cylinder ω L := [ω0 , . . . , ωL−1 ] the se quence ω L , T ω L , T 2 ω L , . . . is periodic with smallest period L−1 i=0 qi . (P3). For every L > 0 the numbers πL := ω pL (ω L ) and the constant L p0 ∈ A are relatively prime to qL and q0 , respectively. (P4). (Ωq∗ , T ) is topologically conjugate to the polyadic adding machine (Ωq∗ , S). Remark 3.1 If a multipermutative system is not minimal then its phase space can be partitioned into an infinite collection of invariant minimal sets and on each of them the system behaves in the way described in the theorem.
4.
Invariant sets as a result of inductive procedures
The global behavior of orbits could be very complex (here, an (semi– i x ; a union of )orbit through an initial point x0 is Γ(x0 ) := ∞ f 0 i=0 orbits Y is an invariant set: f (Y ) ⊂ Y ). Complexity of such a behavior is reflected in the geometry of invariant sets and can be measured by Hausdorff and box dimensions and other dimension–like characteristics. Invariant sets are constructed by using methods of symbolic dynamics.
4.1
Geometric constructions for repellers
Many invariant sets are resulting from so–called geometric constructions [34]. Let (σ, Ω), Ω ⊂ Ωp = {0, . . . , p−1}N , be a subshift, a closed σ– invariant subset of the full shift with p symbols. The word (i0 , . . . , in−1 ) is admissible if the corresponding cylinder [i0 , . . . , in−1 ] has nonempty intersection with Ω. Consider p closed subsets ∆0 , . . . , ∆p−1 ⊂ Rm . Define basic sets ∆i0 ,...,in−1 which satisfy the following assumptions: (A). ∆i0 ,...,in−1 are closed and nonempty if (i0 , . . . , in−1 ) is admissible. (B). ∆i0 ,...,in−1 j ⊂ ∆i0 ,...,in−1 , j = 0, . . . , p − 1.
Dynamical Chaos in Terms of the -complexity
45
(C). diam∆i0 ,...,in−1 → 0 as n → ∞. We can define now a nonempty set ∞
F =
∆i0 ,...,in−1 .
(20)
n=1 (i0 ,...,in−1 )
The closed set F becomes a Cantor set, provided that the following “separation conditions” hold (D). ∆i0 ,...,in−1 ∩∆j0 ,...,jn−1 ∩F = ∅ whenever (i0 , . . . , in−1 ) = (j0 , . . . , jn−1 ). The coding map χ : Ω ! → F is defined as follows: for any ω= (i0 , . . . , in−1 , . . .) ∈ Ω, χ(ω) = x if x ∈ ∆i0 ,...,in−1 . The simplest constructions are of Moran type. In this case Ω = Ωp and basic sets satisfy additional axioms.
(M1). Every basic set is the closure of its interior. (M2). For any n, Int∆i0 ,...,in−1 ∩ Int∆j0 ,...,jn−1 = ∅ if (i0 , . . . , in−1 ) = (j0 , . . . , jn−1 ). (M3). The basic set ∆i0 ,...,in−1 ,j is homeomorphic to ∆i0 ,...,in−1 . (M4). There are numbers 0 < λj < 1, j = 0, . . . , p − 1, such that diam∆i0 ,...,in−1 ,j = λj diam∆i0 ,...,in−1 . Moran proved that in this case dimH F = s0 , where s = s0 is the root of the (Moran) equation p−1 λsi = 1. (21) i=0
Conditions (M1)–(M4) provide a more general geometric scenario than the one presented in [35]. In all these cases the Hausdorff and box dimensions of the set F coincide and are equal to the root sλ of an equation of the Bowen type. For our construction this equation is PS (sλ log λ) = 0, where PS (φ) is the topological pressure of the function φ on the set S with respect to σ (see below). The set J is constructed with the help of the contractions u0,1 : [0, 1] → [0, 1], u0 (x) = λ0 x,
u1 (x) = λ1 x + 1 − λ1 ,
such that g ◦ ui = id on [0, 1]. For every word i = (w0 , · · · , wi−1 ) ∈ {0, 1}i , define the sets ∆w0 ,··· ,wi−1 := uwi−1 ◦ · · · ◦ uw0 ([0, 1]),
46 i.e., the ∆–sets are basic sets of the geometric construction for the set J. Moreover, diam ∆w0 ,··· ,wi−1 = λw0 · · · λwi−1 and dist(∆i0 , ∆i1 ) = (1 − λ0 − λ1 )λw0 · · · λwi−1 > 0
(22)
where dist(x, y) = |x − y|. Thus, J is resulting from a Moran construction.
4.2
Sticky sets in Hamiltonian systems
An area preserving map f of the plane, possessing an infinite hierarchy of islands–around–islands structure, has invariant sets of zero Lebesgue measure on which it behaves similarly to multipermuitative systems [9, 2]. The map T , generating a multipermutative system, is not chaotic and its topological entropy is zero. A set F on which f is topologically conjugate to T , nevertheless, may appear as a result of a Moran type geometric construction. Sticky sets are the sets of all limiting points of infinite hierarchy of islands. A closed topological disk P is said to be an island of stability if f n (P ) = P for some integer n. We now give a definition of infinite hierarchy of islands–around–islands structure (sticky riddle) for the general case when not all words i = (i0 , . . . , in−1 ) might be admissible. A collection P of islands {Pi : i is Ω–admissible} is said to be a sticky riddle if the sets Pi are pairwise disjoint, are contained in a compact set, and (i) for any island Pi ∈ P there is an island Pj ∈ P, |i| = |j|, such that f (Pi ) = Pj ; (ii) if f (Pi ) = Pj then for any admissible ik there is s ∈ {0, 1, . . . , q−1} such that f (Pik ) = Pjs ; (iii) diam(Pi ) → 0 as |i| → ∞; (iv) for any ω = (i0 , i1 , . . .) ∈ Ω, if xn ∈ Pi0 ,...,in−1 , n > 0, then limn→∞ xn exists; (v) if xn ∈ Pi , yn ∈ Pj , |i| = |j| = n, n > 0, and i = j at least for one value of n then limn→∞ xn = limn→∞ yn . These axioms reflect our understanding of an infinite islands–around– islands hierarchy: (i) an island of the n–th generation is mapped into an island of the same generation;
Dynamical Chaos in Terms of the -complexity
47
(ii) if an island Pik lies in the vicinity of the island Pi then its image Pjs lies in a vicinity of Pj ; (iii) to be packed into a compact set, the islands of the n–th generation should be small if n >> 1; (iv) there should be only one point of accumulation of islands Pi0 ,...,in−1 for any fixed ω = (i0 , . . . , in−1 , . . .); (v) for different points ω = (ω0 , ω1 , . . .), ω = (ω0 , ω1 , . . .) in Ω the corresponding points of accumulation of islands should be different. Let P be a sticky riddle. For any ω = (i0 , i1 , . . .) ∈ Ω and any sequence xn ∈ Pi0 ,...,in−1 , define x = x(ω) := limn→∞ xn . The set Λ = {x(ω) : ω ∈ Ω} is said to be a sticky set. It is well defined thanks to Axioms (iii)–(v). It was shown in [2] that f |Λ is topologically conjugate to a multipermutative system, i.e., f |Λ has zero topological entropy.
4.3
Geometric constructions of sticky sets
Some numerical observation [15] show that sometimes every island of stability Pi , together with all its satellites Pij , belongs to a basic set ∆i of a geometric construction. So, the set Λ can be resulted from this construction. Axiomatically, the conditions for that can be expressed as follows. (P1) There exists a collection of sets {∆i : i is admissible} that are closed, and for each admissible word i, Pij ⊂ ∆i for every admissible word ij. (P2) Pi ∩ ∆ij = ∅ for every admissible i and ij. (P3) ∆ij ⊂ ∆i , for every admissible words i and ij. (P4) diam∆i0 ...in−1 → 0 as n → ∞. (P5) Separation axiom. ∆i ∩ ∆j ∩ F = ∅ if i = j, |i| = |j|, where ∞
n=1
i0 ,...,in−1
F =
∆i0 ...in−1
is admissible
Thus, if these axioms are satisfied, then Λ = F . Let us emphasize that an invariant set with nonchaotic dynamics is resulted from a geometric construction, modeled by a full subshift (σ, Ωp ) or a subshift with positive topological entropy. In other words, we have a big difference between
48 temporal and spatial behavior of a system. To describe such a situation, we need characteristics which could take into account both temporal and spatial behavior. We introduce them in the following Lecture.
Measures of –complexity
5.
To study complexity functions in details, one needs to know more about general properties of the ε-complexity of a metric space (without dynamics). We introduce and describe some quantities which contain an essential information about ε-complexity, the measures of ε-complexity in an “abstract” metric space. The main results will be related to the εcomplexity defined on the base of the notion of ε-separability. The notion was used first by Kolmogorov and Tikhomirov [29] in their study of solutions of PDE and realization of random processes (Shannon suggested to pay attention to this notions in 1949, though). We will also describe ε-complexities based on the notion of ε-nets. We prove that measure of ε-complexity defined on the base of the notion of ε-separability is equivalent to the dual measure that is defined through ε-nets. [11] It appeared naturally that some results and ideas from discrete mathematics are worth to be exploited. We believe that we made the first step in this direction.
5.1
Set-up and definitions
Separated sets and complexity. space with a distance d.
Let X, d be a compact metric
Definition 5.1 1 Given > 0, a set Y ⊆ X is -separated iff for any different x, y ∈ Y one has d(x, y) ≥ . 2 The number C (X, d) = C := max{|Y |, Y is an -separated set}, where | · | denotes the cardinality of a set, is called the -complexity of X. 3 An -separated set Y is optimal iff |Y | = C . Let us show the following natural inequality. Proposition 5.1 Given D1 , D2 ⊆ X and ε > 0 one has Cε (D1 ∪ D2 ) ≤ Cε (D1 ) + Cε (D2 ).
49
Dynamical Chaos in Terms of the -complexity
Proof 5.1 Let Y ⊆ D1 ∪ D2 be an optimal ε-separated set in D1 ∪ D2 . Then Yi = Y ∩ Di is an ε-separated set in Di and |Y | ≤ |Y1 | + |Y2 | ≤ Cε (D1 ) + Cε (D2 ). Remark 5.1 Invariant sets in some dynamical systems can be treated as results of inductive procedures. Come back to the example 1.1 with λ1 = λ2 = 13 The dynamical system generated by the map f : R → R, 3x, x ≤ 1/2, f (x) = 3x − 3, x > 1/2, has an invariant set K containing all orbits belonging to the interval [0, 1]. One can see that K is the one-third Cantor set, so that ∞
K=
∆i0 ...in−1 ,
n=1 (i0 ...in−1 )
where ij ∈ {0, 1}, ∆i0 ...in−1 are intervals of the length 3−n arising on the n-th step of construction of the Cantor set. Therefore, if ε ≈ 3−n then Cε ≈ 2n = {the number of different words of length n in the full shift with 2 symbols} = ehn , where h = ln 2 is the topological entropy of the full shift. Thus, ln Cε ln 2 h ≈ = = dimH K, − ln ε − ln 1/3 ln λ where dimH K is the Hausdorff dimension of K and λ = 1/3 is the contraction coefficient. We obtained the familiar Furstenberg formula [25]. This example shows that if a subset of a metric space is the result of an inductive procedure governed by a symbolic dynamical system then the ε-complexity contains, in fact, an important dynamical information. ε-nets and complexity. In this subsection we give a dual definition of complexity. Given x ∈ X let O (x) = {y : d(x,y) < }, the ball of radius centered at x. Given Y ⊆ X let O (Y ) = O (x). x∈Y
1 Given > 0, a set Y ⊆ X is an -net iff Oε (Y ) =
Definition 5.2 X. 2 The number
R (X, d) = R := min{|Y |, Y is an -net},
50 is called the dual -complexity of X. 3 An -net Y is optimal iff |Y | = R . The similar results to the one in Proposition 5.1 holds for dual complexities. Proposition 5.2 Given D1 , D2 ⊆ X and ε > 0 one has Rε (D1 ∪ D2 ) ≤ Rε (D1 ) + Rε (D2 ). Proof 5.2 Let Yi ⊆ Di be an optimal ε-net in Di . Then Y = Y1 ∪ Y2 is an ε-net in D1 ∪ D2 and Rε (D1 ∪ D2 ) ≤ |Y | ≤ |Y1 | + |Y2 | = Rε (D1 ) + Rε (D2 ). Any optimal ε-separated set is an ε net, therefore Cε ≥ Rε . On the other hand the following statement holds. Proposition 5.3 Rε/2 ≥ Cε Proof 5.3 It follows directly from the definition that any pair of different points in an ε-separated set Z can not belong to a ball of radius ε/2. Thus we cannot cover Z by less than |Z| balls of radius ε/2. Assuming that Z is optimal we obtain the inequality above. Let us introduce bε = sup Rε/2 (Oε (x)). x∈X
Obviously, for any D ⊆ X one has bε Rε (D) ≥ Rε/2 (D). It is not difficult to check that bε ≤ 2d (2d + 1) for a subset of the Euclidean space Rd .
Ultrafilters. Now we give some known results and definitions that can be found, for instance, in [18]. Definition 5.3 A set F ⊂ 2N is called to be a filter over N iff it satisfies the following conditions: If A ∈ F and B ∈ F, then A ∩ B ∈ F, If A ∈ F and A ⊂ B then B ∈ F, ∅ ∈ F. Let an be a sequences of real numbers, a is called to be a limit of an with respect to a filter F, a = limF an , if for any ε > 0 one has {n | |an − a| < ε} ∈ F. ¿From the definition of a filter it follows that limF an is unique, if exists.
Dynamical Chaos in Terms of the -complexity
51
Example 5.1 Let FF = {A ⊆ N | N\A is finite }. FF is said to be a Frech´et filter. One can check that it is, indeed, a filter. A limit with respect to FF coincides with ordinary limit. Definition 5.4 A filter F is called to be ultrafilter iff for any set A ⊆ N one has A ∈ F or N\A ∈ F. Theorem 3 A bounded sequences has a limit with respect to an ultrafilter. This limit is unique. Example 5.2 For i ∈ N let Fi = {A ⊆ N | i ∈ A}. It is an ultrafilter. Such an ultrafilter is called proper for i. One can check that limFi an = ai . So, limits with respect to a proper ultrafilter are not interesting. Proposition 5.4 An ultrafilter F is proper (for some i ∈ N) if and only if it contains a finite set. This proposition implies that an ultrafilter is non-proper if and only if it is an extension of the Frech´et filter FF .
5.2
Measures of complexity
Our goal is to define a measure reflecting an asymptotic behavior of the -complexity as goes to 0. For that we will use the technique of ultrafilters. Given > 0, consider an optimal -separated set A . Introduce the following functional 1 I (φ) = φ(x) C x∈A
where φ : X → R is a continuous function. It is clear that I is a positive bounded linear functional on C(X). Moreover, for any φ ∈ C(X) the family I (φ) is bounded. Fix a sequence E = {εn }, εn → 0 as n → ∞ and an arbitrary non-proper ultrafilter F. Consider I(φ) = lim Iεn (φ). F
I is a positive bounded linear functional on C(X). Theorem 4 The functional I is independent of the choice of an optimal sets Aε . Proof 5.4 The proof is based on the following proposition. Proposition 5.5 Let A and B be optimal -separated sets. There exists a one-to-one map α : A → B such that d(x, α(x)) ≤ for any x ∈ A.
52 Let Aε and Bε be optimal -separated sets, ε ∈ E. Let αε : Aε → Bε be the map from Proposition 5.5. Then 1 1 1 | φ(x) − φ(x)| = | (φ(x) − φ(αε (x))) | ≤ rφ () Cε Cε Cε x∈Aε
x∈Bε
x∈Aε
where rφ () = sup{|φ(x)−φ(y)| : d(x, y) < }, the modulus of continuity of φ. Since X is a compact, rφ () → 0 as → 0. It implies the desired result due to the choice of the ultrafilter F. So, we need only to prove Proposition 5.5; it will be done below. In the proof of Proposition 5.5 we will need the Marriage Lemma of P. Hall, see for instance [37]. Lemma 5.1 For an indexed collections of finite sets F1 , F2 , . . . , Fk the following conditions are equivalent: there exists an injective function α : {1, 2, ..., k} →
k
Fi such that
i=1
α(i) ∈ Fi ; For all S ⊆ {1, 2, . . . , k} one has |
Fi | ≥ |S|.
i∈S
y) < }, the ball of radius centered Recall that O (x) = {y : d(x, at x. Given Y ⊆ X let O (Y ) = O (x). x∈Y
Proof 5.5 Proposition 5.5 For any x ∈ A let Bx = O (x) ∩ B. If we show that for any S ⊆ A the following inequality holds Bx | ≥ |S|, (24) | x∈S
then the proposition follows from Lemma 5.1 due to |A| = |B| = C . To prove inequalities (24), suppose that | Bx | = |O (S) ∩ B| < |S| for some S ⊆ A. Then
x∈S
|S ∪ (B \ (O (S) ∩ B)| = |S| + (|B| − |O (S) ∩ B|) > |B| = C , on the other hand, the set S ∪ (B \ (O (S) ∩ B) is -separated. We have a contradiction with optimality of B. So, we have defined a functional I which may depend on the choice of the sequence E and the ultrafiter F only. Sometimes we will write IE,F to emphasize this dependence. It is well known, that IE,F generate unique regular Borel measure µE,F on X such that µE,F (X) = 1.
Dynamical Chaos in Terms of the -complexity
53
Definition 5.5 The measures µE,F (X) will be called measures of complexity. We are going to show examples of (X, d) when µE,F = µ is independent on E, F and when µE,F depends on E, F. In the first case IE,F (φ) = I(φ) = lim Iε (φ). ε→0
Of course, it is difficult to find optimal sets and construct directly measures of complexity in real situations. Nevertheless, it is possible to work with them by using some of their intrinsic properties. Let us show now that measures of complexity are invariant with respect to local isometries. Definition 5.6 A homeomorphism τ : X → X is called to be ε-isometry iff d(x, y) = d(τ (x), τ (y)) for all x, y ∈ X, d(x, y) ≤ ε A homeomorphism τ : X → X is called to be local isometry iff it is ε isometry for some ε > 0. It is clear that an isometry is a local isometry. Proposition 5.6 Local isometries with composition form a group. Proof 5.6 It is easy to check that the composition of two ε-isometries is an ε-isometry. Let τ be an ε-isometry. Then τ −1 is uniformly continuous and there exists ε > 0 such that if d(x, y) ≤ ε ,then d(τ −1 (x), τ −1 (y)) ≤ ε.Consequently,if d(x, y) ≤ ε then d(x, y) = d(τ −1 (x), τ −1 (y)), so, τ −1 is an ε -isometry. We do not know if ε-isometries form a group. Proposition 5.7 Let τ be an ε0 -isometry and A be an ε-separated set, ε ≤ ε0 . Then τ −1 (A) is also ε-separated. Proof 5.7 Assume, on the contrary, that τ −1 (A) is not ε-separated, i.e., there are different x, y ∈ τ −1 (A) with d(x, y) < ε ≤ ε0 . Then d(τ (x), τ (y)) = d(x, y) < ε, so A cannot be ε-separated. Theorem 5 Let τ be a local isometry. Then µE,F is invariant, i.e. µE,F (A) = µE,F (τ −1 (A)) for all measurable A. Proof 5.8 It is enough to show that for all φ ∈ C(X) IF (φ ◦ τ ) = IF (φ).
(25)
There exists ε0 > 0, such that τ is an 0 -isometry. Let Aε be an optimal ε-separated set, ε ≤ ε0 . It follows from Proposition 5.7 that τ −1 (Aε )
54 is an optimal ε-separated set. It implies the validity of Equation (25). Indeed, I (φ) =
1 1 φ(x), I (φ ◦ τ ) = C C x∈A
φ(x),
x∈τ −1 (A )
and the result follows from Theorem 4. Corollary 5.1 Let a continuous group operation ∗ be defind on X such that right shifts rg (x) = g ∗x (left shifts lg (x) = x∗g) are local isometries for all g ∈ X. Then µE,F is the normalized Haar measure on (X, ∗). In particular, µE,F does not depend on E, F. Example 5.3 Let X = Ωp , the full shift with p symbols, i.e. Ωp = + {0, 1, ..., p − 1}Z with the distance dq (x, y) =
∞ |xi − yi | i=0
qi
, q > 1.
Ωp can be equipped by the group operation ⊕ as follows: (x ⊕ y)i = xi + yi ,
mod p
It is clear that (Ωp , ⊕) is a continuous group. Moreover, the right translation by any element is an isometry. Therefore µE,F = µ coincides with the Haar measure which, in fact, is the (1/p, ..., 1/p)-Bernoulli measure. Example 5.4 Let X = ΩM be a topological Markov chain, defined by a finite matrix M : {0, 1, ..., p − 1}2 → {0, 1}, i.e. ΩM = {< x0 , x1 , ... > | xi ∈ {1, 2, ..., p − 1} and M (xi , xi+1 ) = 1}. Metric d is the same as in Example 5.3. Cylinder [a0 , a1 , ..., an−1 ] of the length n is the set of all x ∈ ΩM , such that xi = ai for i = 0, 1, ..., n − 1. A word < a0 , a1 , ..., an−1 > is admissible iff [a0 , a2 , ..., an−1 ] = ∅. Let Wn be the set of all admissible words of the length n and α be a permutation of Wn such that (α(w))n−1 = wn−1 for every w ∈ Wn (admissible permutation). Given such an α define gα : X → X as follows gα (x) = (α(x0 , x1 , ..., xn−1 ), xn , xn+1 , ...). It is simple to see that gα is a local isometry. It implies that µE,F ([a0 , a1 ,..., , 0,b1 ...,bn−1 ])if [a0,a1,...,an−1]= ∅, [b0 , b1 , ..., bn−1 ] = ∅ and an−1 ])=µE,F ([b an−1 = bn−1 . Indeed, under these assumptions there exists an admissible permutation α : Wn → Wn such that α(a0 , a1 , ..., an−1 ) = b0 , b1 , ..., bn−1 .
Dynamical Chaos in Terms of the -complexity
55
So, the measure µE,F of a nonempty cylinder [a0 , a1 , ..., an−1 ] depends only on an−1 and n. Let vi (n) = µE,F ([a0 , a1 , ..., an−2 , i]) for an admissible < a0 , a1 , ..., an−2 , i > (vi (n) = 0 if there is no admissible words of length n ending by i). It is simple to check that vj (n + 1) vi (n) = j,M (i,j)=1
This relation can be rewritten in the matrix form v(n) = M v(n + 1), where v(n) = (v0 (n), v1 (n), ..., vp−1 (n))T is a column vector. If M is a primitive matrix (M p > 0 for some p) then this equation uniquely defines the measure µE,F , which in this case turns out to be independent of E, F. Indeed, by Perron Theorem matrix M has unique positive eigenvector e with eigenvalue λ > 0 (in our case, in fact, λ > 1). Let P be the set of all lines in Rp , generated by non-negative vectors. From the proof of Perron Theorem (see, for example, [28]) M n (P ) = {le }, n∈N
where le is a line, generated by e. Since v(n) > 0 and v(k) = M n v(n+k), one has lv(k) ∈ M n (P ) for any n. Hence, v(k) = ck e. So, v(n) = λ−n c0 e. We have proved the following Proposition 5.8 Let M be a primitive matrix and C ⊂ ΩM is an admissible cylinder of length n, ending by i. Then µE,F (C) = λ−n ei , where (e0 , e1 , ..., ep−1 ) is the positive eigenvector of M , with e0 +e1 +...ep−1 = 1. Remark 5.2 It was constructed in [11] an example where µE,F is not unique.
5.3
Measures of dual complexity
To define measures of dual complexity we proceed in the same way as in Subsection 5.2, just replacing ε-separated sets by ε-nets. Given > 0, consider an optimal -net A . Introduce the following functional 1 I˜ (φ) = φ(x). R x∈A
Consider ˜ I(φ) = lim I˜εn (φ). F
56 Theorem 6 The functional I˜ is independent of the choice of an optimal ε-nets Aε . Proof 5.9 The proof is similar to the one of Theorem 4, just instead of Proposition 5.5 one should use Proposition 5.9, formulated below. Proposition 5.9 Let A be an optimal -net and B be an ε-net. There exists an injective map α : A → B such that d(x, α(x)) ≤ 2 for any x ∈ A. The proof is based again on the Marriage Lemma. Definition 5.7 The measures νE,F (X) corresponding to I˜E,F will be called dual measures of complexity. Proposition 5.10 Let τ be an ε0 -isometry and A be an ε-net, ε ≤ ε0 . Then τ (A) is also an ε-net. Proof 5.10 Given x ∈ X we have to prove that x ∈ Oε (τ (A)). Due to surjectivity of τ there exists y ∈ X, x = τ (y). There exists a ∈ A such that y ∈ Oε (a). By the definition of ε-isometry x = τ (y) ∈ Oε (τ (a)). Using Proposition 5.10, Proposition 5.6 one can prove the following analogue of Theorem 5. Theorem 7 Let τ be a local isometry. Then νE,F is invariant, i.e. νE,F (A) = νE,F (τ −1 (A)) for all measurable A. We don’t know if µE,F and νE,F can be different, but we can prove the following theorem. Theorem 8 If there exists k ∈ N such that for any x ∈ X and any small enough ε > 0 one has Cε (Oε (x)) ≤ k, then µ and ν are equivalent and, moreover, 1 νE,F (A) ≤ µE,F (A) ≤ kνE,F (A) k for any Borel set A ⊆ X. It can be easily seen that if X is a subspace of a finite dimensional Euclidean space then the conditions of the Theorem are satisfied
57
PART II : SPATIO-TEMPORAL CHARACTERISTICS OF COMPLEXITY 1. Generalized Caratheodory construction We describe here a general approach developed by Ya. Pesin on the basis of classical Carath´´eodory results. It is convenient to represent them in the form of tables. The quadruple (F, ψ, ξ, η) is said to be a Carath´ ´eodory structure where ψ, ξ, η are defined in Table 1.
Table 1 Generalized Caratheodory Construction (Pesin ’86) X–space ≡ set
F –collection of subsets
Example Metric Space Open Subsets; Balls B (x) = {y : dist(x, y) < }
ψ : F → R+ – a function, s.t. Axiom A: For any > 0 there is a finite or Ui ) ≤ , s.t. countable subcollection Ui } with Ψ(U {U U ⊃ X i i ξ, η : F → R+ are functions s.t. ξ(U ) ≥ 0, ∀U ∈ F Axiom B: η(U ) > 0, ∀U = ∅, U ∈ F
ψ(U ) = diam(U ) diam Ui ≤
Haussdorff ξ(U ) η(U )
≡ =
1 diam (U )
Carath´ ´edory Axiom C: For any δ < 0 ∃ > 0 such that η(U ) ≤ δ provided that ψ(U ) ≤ (for any U ∈ F ).
ξ(U ) η(U )
≡ =
1 φ(diam U )
58 Given Z ⊂ X, let us consider a finite or countable cover G = {Ui } of Z by elements of F, with ψ(Ui ) ≤ . Then, introduce the sum Mξ (α, , G, Z) =
ξ(Ui )η(Ui )α
(1)
ξ(Ui )η(Ui )α ,
(2)
i
and consider its infimum Mξ (α, , Z) = inf
G
i
where the infimum is taken over all cover G ⊂ F of Z with ψ(Ui ) ≤ . The quantity M (α, , Z) is a monotone function in ; therefore, there exists the limit m(α, Z) = lim M (α, , Z). →0
It was shown in [34] that there exists a critical value αc ∈ [−∞, ∞] such that m(α, Z) = 0, α > αc if αc = +∞ . m(α, Z) = ∞, α < αc if αc = −∞ The number αc is said to be the Charath´eodory dimension of Z relative the structure (F, ψ, ξ, η). See Table 1
1.1
Examples
If F is the collection of all open balls {B(x, } of all diameters > 0 centered at all points x ∈ X, ξ(B(x, )) ≡ 1, η(B(x, )) = , then αc = dimH Z, the Hausdorff dimension. Another nontrivial example is dimension–like definition of the topological entropy [34]. Assume that X is compact and f : X → X is a continuous map. Given n > 0, 0 > 0, the Bowen set is defined as Bn (x, 0 ) = {y ∈ X : ρ(f i x, f i y) ≤ 0 , 0 ≤ i ≤ n}. Let F be the set of all Bowen sets, ξ(Bn (x, 0 )) ≡ 1, ψ(Bn (x, 0 )) = 1/n and η(Bn (x, 0 )) = e−n . Then the 0 –topological entropy of f on Z, htop (f |Z, 0 ), is the Carath´eodory dimension αc and htop (f |Z) := lim sup0 →0 htop (f |Z, 0 ). It was shown in [34] that this entropy coincides with the standard topological entropy if Z is compact and f –invariant set.
59
Spatio-temporal Characteristics of Complexity
Table 2 Carath´ ´eodory dimensions Z⊂X
Example
Mc (Z, α, ) =
Mc (Z, α, )
inf
G ψ(ui )≤ ui ⊃Z ui ∈G ψ(ui )≤
if
ξ(ui ) · ν(ui )α
inf G
diam Ui ≤
⇒
∃ lim Mc (Z, α, ) = mc (Z, α)
diam Uiα
or
inf G
φ(diam Ui )α
i
diam Ui ≤
→0
Properties of mc as a function of Z (i) Z1 ⊂ Z2 ⇒ mc (Z1 , α) ≤ mc (Z2 , α) (ii) mc k Zk , α ≤ k (Zk , α)
mH (Z, α) outer Haussdorf measure
(If mc (Φ, α) = 0 then m is outer measure) mc as a function of α
dimH (Z) Haussdorff dimension
αc
=
sup{α : mc (Z, α) = ∞}
=
inf{α : mc (Z, α) = 0}
=
dimc Z –
Caratheodory ´ dim. of Z
60
Table 3 Examples
F
ξ
ψ
ν
1
diam U
diam U
Open sets
diamH (x)
U (or
diamB (x)
balls)
Bowen
1
sets B(u)
same
Balls B (x)
Result
exp
sup x∈B(u)
m|u >−1
1 m(u)
e−m(u)
same
same
htop (if X inv. and compact)
P (φ) – top pressure k φ(f x)
(if x is inv. and comp.)
k=0
dimq (X) (if µ is regular) µ (B (x))q
including HPq (µ) and Correlation dimenssion
Open {U }
e−qτ (u)
diamU
diamU
•
•
•
•
Dimenssion for Poincar´e recurrences
•
61
Spatio-temporal Characteristics of Complexity
2. 2.1
Topological pressure and Hausdorff dimension Dimension-like definition of topological pressure
Let us remind the definition for subshifts (the definition for arbitrary dynamical systems can be found in [28]). Let ψ be a real–valued continuous function on a subshift Ω. Let |ω|−1 (3) Zn (ψ, Ω) = exp sup ψ(σ j ω) , ω∈ω
|ω|=n
j=0
where the sum is taken over all cylinders [ω] ⊂ Ω of length |ω| = n. It is proved in [41] that the limit PΩ (ψ) = lim
n→∞
1 log Zn (ψ, Ω) n
(4)
exists. The limit is called the topological pressure of the function ψ on Ω with respect to σ. For every constant c ∈ R, the topological pressure satisfies the property PΩ (c + ψ) = c + PΩ (ψ).
(5)
Consider the potential ψ ≡ 0 then PΩ (0) = htop (σ|Ω), the topological entropy. Roughly speaking, the system (σ, Ω) has ehtop n different paths of temporal length n (with some accuracy), each of them “costs” |ω|−1 j nPΩ (ψ) is the total price for passing exp j=0 ψ(σ ω) units, and e through all of them. It is known that topological pressure is independent of the metric (preserving a given topology) and is invariant under topological conjugacy [28]. Example 2.1 Let us calculate the topological pressure in the case where Ω = ΩA , the topological Markov chain with a p × p transition matrix A, and the function ψ(ω) depends only on the first symbol: ψ(ω) = ψ(ω0 ). In this case Zn (ψ, Ω) =
(i0 ,...,in−1 )
n−1
exp
j=0
ψ(ij )
(6)
62 where the sum is taken over all ΩA –admissible words (i0 , . . . , in−1 ). Set ψ(i) = log ρi , i = 0, . . . , p − 1, then Zn (ψ, ΩA ) =
n−1
ρk .
(7)
(i0 ,...,in−1 ) k=0
It is not a difficult algebraic exercise to show that Zn (ψ, ωA ) = RB n−1 E T
(8)
where R = (ρ0 , . . . , ρp−1 ), E = (1, . . . , 1) and B = A · diag(ρ0 , . . . , ρp−1 ).
(9)
As a corollary of formula (9) we obtain that PΩ (ψ) = log λ0 where λ0 is the spectral radius of the matrix B. For a finite or a countable cover C of Ω by cylinders of lengths greater than n and β ∈ R let |ω|−1 Z(β, ψ, C, Ω) = (10) exp −β|ω| + sup ψ(σ j ω) . ω∈[ω] j=0
[ω]∈C
It is proved in [34] that the topological pressure PΩ (ψ) coincides with the threshold value ) * PΩ (ψ) = sup β : lim (inf{Z(β, ψ, C, Ω) : |C| ≥ n}) = ∞ . (11) n→∞
2.2
Bowen’s equation
Let us show now how the topological pressure is related to the Hausdorff dimension. Assume that a set F is modeled by a Moran construction and the corresponding subshift is a topological Markov chain (σ, ΩA ). Choose a cover of F by basic sets of the n-th generation. Then,
diam∆i0 ,...,in−1
α
=
n−1
λαik
(i0 ,...,in−1 ) k=0
(i0 ,...,in−1 )
=
(i0 ,...,in−1 )
n−1 exp α ϕ(ij ) = Zn (αϕ, ΩA ) (12) j=0
63 where ϕ(i0 , . . . , ) = log λi0 . We know that Zn (αϕ, ΩA ) ≈ exp nPΩA (αϕ) . Hence, Zn (αϕ, ΩA ) 1 if PΩA (αϕ) > 0 and Zn (αϕ, ΩA ) 1 if PΩA (αϕ) < 0. It follows that if α0 is the root of the (Bowen’s) equation Spatio-temporal Characteristics of Complexity
PΩA (αϕ) = 0
(13)
then dimH F ≤ α0 . The opposite inequality can be proven by using the technique of Moran covers and the dimension–like definition of topological pressure [34]. Example 2.2 Let us come back to Example 1.1. In this case A = 1 1 , 0 < λ0,1 < 1 are rates of contraction, ψ(i0 , i1 , . . .) = α log λi0 = 1 1 α λα λ 0 1 and PΩ2 (αϕ) = αϕ(i0 , i1 , . . .). Thus, ρi = λαi , i = 0, 1, B = α λ0 λα1 log λα0 + λα1 . The Bowen’s equation (13) becomes the Moran’s equation (14). Example 2.3 Consider now the “golden mean” topologicalMarkovchain with the transition matrix A =
1 1
. Assume that 0 < λ0,1 < 1 are 1 0 α rates of contraction. Here again ρi = λi but the matrix B has the form λα0 λα1 . The characteristic equation of matrix B is µ2 −µλα0 − B= α λ0 0 α α (λ0 λ1 ) = 0 and spectral radius is r = (1/2) λα0 + λ2α 0 + 4(λ0 λ1 ) . Thus, the Hausdorff dimension of the corresponding set F is the root α of the Bowen’s equation log (1/2) λα0 + λ2α = 0. If 0 + 4(λ0 λ1 ) √ Λ0 = λ1 = λ then the equation becomes α log λ + log (1 + 5)/2 , √ i.e., dimH F = α0 = log (1 + 5)/2 / − log λ. If you take into account √ that log (1 + 5)/2 = htop , the topological entropy of the topological Markov chain (σ, ΩA ), then we obtain the relation ([25]) dimH F =
htop . − log λ
64
2.3
General subshifts
It was shown in [34, 35] that the Bowen’s equation (13) holds not only for topological Markov chains and not only for finitely many values of rates of contraction. Consider Ω ⊂ Ωp an arbitrary subshift with positive topological entropy and let λ : Ω → R+ be an arbitrary H¨ older continuous positive function, such that λ(ω) < 1 for any ω ∈ Ω. We may replace the Moran axiom (M4) by the following assumptions: there are positive constants c and c such that |ω|−1
diam ∆i0 ,...,in−1 ≥ c inf
ω∈[ω]
λ(σ j ω),
(14)
λ(σ j ω).
(15)
j=0 |ω|−1
diam ∆i0 ,...,in−1 ≤ c sup
ω∈[ω] j=0
One can show that the following statement holds. Lemma 2.1 There exists a positive constant d such that |ω|−1
d
λ(σ j ω) ≤ |χ([ω])|,
(16)
j=0
for every ω ∈ [ω]. By using this Lemma, it was shown in [34, 35] that the dimH F = αc , where αc is the root of the Bowen’s equation PΩ (α log λ) = 0. Similar formula was obtained for conformal repellers [36] and in many other situations [34]. The examples of sticky sets in previous sections show us that, in general, we should apply a wider notion than the Hausdorff dimension to describe simultaneously behavior of orbits on invariant sets and their geometric features. The generalized Carath´eodory construction allows us to do it.
3.
Spectra of dimension for Poicare recurrences
In the study of spatio–temporal behaviour of orbits, it is natural to take into account that typical orbits in Hamiltonian systems and orbits in attractors in dissipative systems repeat their behavior in time. This repetition can be expressed in terms of Poincar´e recurrences. Consider a dynamical system (Rm , f ) where the mapping f : Rm → Rm is continuous. Let F ⊂ Rm be an f –invariant subset. In the framework of the general Carath´eodory construction we consider covers by
Spatio-temporal Characteristics of Complexity
65
open balls. For each Z ⊂ F , denote by B (Z) the class of all finite or countable covers of Z by balls of diameter less than or equal to . For an open ball B ⊂ Rm let the Poincar´e recurrence be defined as τ (B) = inf{τ (x, B) : x ∈ B}, where τ (x, B) = min{t ≥ 1 : f t (x) ∈ B} is the first return time of x ∈ B. Given G ∈ B (Z) and α, q ∈ R, consider the sum ξ(τ (B))q diam B α , (17) Mξ (α, q, , G, Z) = B∈G
where the real nonnegative function ξ : R → R is such that ξ(t) → 0 as t → ∞. Below we will consider the functions ξ(t) = e−t and ξ(t) = 1/t. Next we define Mξ (α, q, , Z) = inf{Mξ (α, q, , G, Z) : G ∈ B (Z)}.
(18)
For fixed q the limit mξ (α, q, Z) = lim→0 Mξ (α, q, , Z) has an abrupt change from infinity to zero as one varies α from minus infinity to infinity. There is a unique critical value αc (q, ξ, Z) = sup{α : mξ (α, q, Z) = ∞}
(19)
such that mξ (α, q, Z) = ∞ if α < αc (q, ξ, Z), provided that αc (q, ξ, Z) = −∞, and mξ (α, q, Z) = 0 if α > αc (q, ξ, Z), provided that αc (q, ξ, Z) = ∞. The function αc (q, ξ) := αc (q, ξ, F ) is said to be the spectrum of dimensions for Poincar´e recurrences, specified by the function ξ. The value q0 (ξ) = sup{q : αc (q, ξ) > 0} is said to be the dimension for Poincar´e recurrences specified by the function ξ. The definition has been introduced in [6, 7] and [9]. In the case ξ(t) = exp(−t), a quantity similar to q0 was introduced in [33] and was called the AP–dimension. Roughly speaking, q0 is the smallest solution of the equation αc (q, ξ, A) = 0. Notmany specific examples are known where the dimension for Poincar´e recurrences has been explicitly computed or estimated ([22], [30]).
3.1
Non-homogeneous Bowen’s equation
Let (F, f ) be a dynamical systems over a Cantor set F ⊂ Rd whose geometric construction is described symbolically a ` la Moran and f has the specification property and positive topological entropy (for which we use ξ(t) = e−t in (17)). For the sake of simplicity, we impose some aditional conditions.
66 Controlled packing of cylinders. Given an open ball B ∈ Rd , a cylinder [ω0 , ω1 . . ., ωn−1 ] is called B–maximal iff χ([ω0 , ω1 . . ., ωn−1 ]) ⊂ F ∩ B and χ([ω0 , ω1 . . ., ωn−2 ]) ⊂ F ∩ B. The set of all B–maximal cylinders is denoted by CMax(B). Let C be a cover of F by sets out of := B . The collection of all B–maximal cylinders in C, CMax(C) d has CMax(B), is a cover of S by cylinders. We say that F ⊂ R B∈C controlled packing of cylinders if there exist positive constants C0 and a, independent of and C, such that for every open ball B ∈ C, every 0 < ρ < 1 and every positive integer N one has + # [ω] ∈ CMax(B) : |χ([ω])| ∈ ρN +1 , ρN ≤ C0 N a .
(20)
A fractal set F resulting from a Moran construction satisfying (20) is said to have the controlled–packing property. We proved in [3] that for dimension d = 1 fractal sets always satisfy the controlled–packing condition (20).
A strong Moran construction. We define a subclass of Moran constructions, satisfying (M1)–(M3), by adding the following “gap condition”. There is a constant (gap) G > 0 such that for all admissible words (ω0 , . . . , ωi−1 , ωi ) and (ω0 , . . . , ωi−1 , ωi ) one has dist(∆ω0 ...ωi−1 ωi , ∆ω0 ...ωi−1 ωi ) ≥ G diam ∆ω0 ...ωi−1 , dist(∆ω0 , ∆ω0 ) ≥ G,
(21) (22)
if ωi = ωi in (21) and ω0 = ω0 in (22). Moran constructions satisfying condition (21) and (22) are said to be strong Moran constructions and the corresponding fractal sets F are said to satisfy a gap condition. Theorem 1 ([3]) Assume that set F either has the controlled–packing property or it satisfies the gap condition (21–22). Let the system (F, f ) be topologically conjugate to a subshift (S, σ) with the specification property and positive topological entropy. Then, for ξ(t) = e−t and the parameter region q ≥ 0 and α ≥ 0, the spectrum αc (q) is the solution of the equation PS (α log λ) = q.
(23)
The dimension for Poincar´e recurrences coincides with the topological entropy of the subshift (S, σ), i.e., q0 = htop (σ|S).
Spatio-temporal Characteristics of Complexity
3.2
67
Poincare recurrences and Lyapunov exponents; multifractality
When (F, f ) in Theorem 1 is a d–dimensional conformal repeller [34, 14], there exists a relation between the entropy spectrum of Lyapunov exponents and the spectrum of dimensions for Poincar´e recurrences. Let us remind that a conformal repeller F is an f –invariant set such that: (i) Df (x) = a(x)Isom(x), x ∈ F , where a(x) > 1 is a scalar and Isom(x) is an isometry and (ii)!F is locally–maximal, i.e., there is a neighborhood U ⊃ F such that i≥0 f i (U ) = F . Let x ∈ F and denote by Λ(x) the expression 11 log Df j (x) f , lim n→∞ n d n−1 j=0
whenever this limit exists, and call it the Lyapunov exponent. We denote by E the set of points x ∈ F where the Lyapunov exponent does not exist. For β ∈ R we set Eβ := {x ∈ F \ E : Λ(x) = β} . We have that F = E ∪ β∈R Eβ . Let us define the entropy spectrum of the Lyapunov exponents by f (β) := htop (σ|Eβ ). Here, htop denotes the topological entropy for non– compact sets as it is defined in [34, 19]. Following the proofs of Theorem 1 and Theorem 2 in [21] one can show that in this case f (β) = inf {PF (αφ) + αβ} α
where φ(x) = −(1/d) log Dx f . In view of Theorem 1 αc (q) fulfills the equation q = PS (αc log(λ(ω))). Since PS (αc log(λ(ω))) = PF (−αc (1/d) log Dx f ) we get
f (β) = min{αc−1 (α) + αβ}. α
The spectrum f (β) is strictly concave and defined on a closed interval. Hence, the entropy Lyapunov spectrum f (β) and the inverse of the recurrence spectrum αc−1 form a Legendre transform pair. In this case the spectrum αc is strictly decreasing. It is strictly convex iff φ(x) = −(1/d) log Dx f is not cohomologous to a constant. In the latter case the support of f (β) reduces to a point and αc (q) is linear: αc (q) =
q − htop (σ|S) . log λ
68 For all the systems we consider we have that αc (htop (f |F )) = 0 and αc (0) = dimH (F ). Hence, for the quasi–conformal repellers considered in this paragraph and for 0 ≤ q ≤ htop (σ|S) the critical value αc (q) lies in the interval [0, dimH (F )]. Let us emphasize that if q = 0 then αc (0) = htop / log λ = dimH ΩA , thus, the spectrum of dimensions can be treated as a family “joining” the extreme values: the topological entropy and the Hausdorff dimension. Another relation between Lyapunov exponents and local rates of Poincar´e recurrences was exposed in [38]. Itw assho wn that for a large class of interval maps with an invariant measure µ with possitive entropy, the 1 ratio − lnr τ (Br (x)) goes to λ−1 µ as r → 0 a.e., where λµ is the Lyapunov exponent of µ. A similar relaton was obtained in [4].
3.3
A case of sticky sets
Let us adopt the assumptions of Section 4.2, i.e., a sticky set Λ is a result of a Moran type geometric construction, so that inequalities (14) and (15) are satisfied and f |Λ is topologically conjugate to a multipermutative system (T, Ωp ), see Section 4.2. Since htop (T ) = 0, then the gauge function ξ(t) should be different from e−t . We know that if multipermutative system is minimal, the time needed to come back to a cylinder of the length n is exactly pn . It allows us to guess that the right gauge function is ξ(t) = 1/t. So, we find the spectrum αc (q, ξ, Λ) for ξ(t) = 1/t. Theorem 2 ([3]) Assume that F is modeled by the full shift (Ωp , σ) and satisfies the gap condition. Let the system (F, f ) be topologically conjugate to a minimal multipermutative system (Ωp , T ). Then, for ξ(t) = 1/t and the parameter region q ≥ 0 and α ≥ 0, the spectrum αc (q, ξ) is the solution of the equation PΩp (α log λ) = q log p,
(24)
The dimension for Poincar´e recurrences is equal to 1. Thus, we see that again for q = 0, αc (0, ξ, Λ) = dimH Λ, the Hausdorff dimension of set Λ. Moreover, if α = 0, the equation becomes: htop (f |Λ) = q log p, and, since htop (f |Λ) = log p, then q0 (ξ) = 1. This result is completely consistent with the observation that τ ([ω0 , . . . , ωn−1 ]) = pn . There are generalizations of this result that, together with Theorem, show that some features os space–time behaviour of orbits are reflected
Spatio-temporal Characteristics of Complexity
69
in spectra of dimensions for Poincar´e recurrences, and these spectra can be calculated in terms of a non-homogeneous Bowen equation.
Conclusions and Aknowledgements As one can see, this course of lectures is just an introduction to chaotic dynamics and complexity. The list of references is also far from being complete. A description of the subject from a physical viewpoint can be found in [10, 1, 13, 17, 43, 23] and references therein. Neverteless, I believe that this course may be usefull for people who are interested in nonlinear problems. W would like to thank J.–R. Chazottes, P. Collet, M. Courbage, E. Ugalde, J. Ur´ıas and G. Zaslavsky for valuable disscusions. V.A. was partially supported by CONACyT grant 485100-5-36445-E. L.G. was partially supported by CONACyT-NSF grant E120.0547 and PROMEP grant PTC-62.
References [1] M. Abel, L. Biferale, M. Cencini, M. Falcione, D. Vergni and A. Vulpiani, Exit time and –entropy for dynamical systems, tochastic processes and turbulence, Physica D, 147 (2000) 12-35 [2] V. Afraimovich, A. Maass and J. Ur´ıas, Symbolic dynamics for sticky sets in Hamiltonian systems, Nonlinearity 13 (2000) 1–21. [3] V. Afraimovich, J. Schmeling, E. Ugalde an d J. Ur´ıas, Spectra of dimensions for Poincar´e recurrences, Discrete and Continuous Dynamical Systems 6 (2000) 901–914. [4] V. Afraimovich, J.–R. Chazottes and B. Saussol, Pointwise dimensions for Poincar´e recurrences associated with maps and special flows, Discrete and Continuous Dyn. Syst. 9 (2003) 263–280. [5] V. A. Afraimovich, M. Courbage, B. Fernandez and A. Morante. Directional entropy in lattice dynamical systems in: Mathematical Problems in Nonlinear Dynamics, ed. by L. M. Lerman and L. P. Shilnikov. University of Nijni Novgorod Press, (2002), 9-30. [6] V. Afraimovich, Pesin’s dimension for Poincar´e recurrences. Chaos 7, pp. 12–20 (1997).
70 [7] V. Afraimovich, Poincar´e recurrences of coupled subsystems in synchronized regimes, Taiwanese J. of Math. 3 (1999) 139–161. [8] V. Afraimovich, S.-B. Hsu, Lectures on Chaotic Dynamical Systems, AMS Studies in Advanced Mathematics, 28 International Press, 2003 [9] V. Afraimovich and G.M. Zaslavsky, Sticky orbits of chaotic Hamiltonian dynamics, 519-532 Lecture Notes in Physics, 511 (1998) 59–82 [10] V. Afraimovich, G. M. Zaslavsky, Space–time complexity in Hamiltonian dynamics, Chaos, 13 (2003) 519-532 [11] V. Afraimovich and L. Glebsky, Measures of –complexity, Preprint, math.DS/0312042 in http://xxx.land.gov [12] V.M. Alekseyev, Quasirandom Dynamical Systems I: Quasirandom Diffeomorphisms, MAth. USSR Sbornik, 5, (1968), 73-128. [13] R. Badii and A. Politi, Complexity, Cambridge University Press, Cambridge, 1999. [14] L. Barreira, A non–additive thermodynamic formalism and applications to dimension theory of hyperbolic dynamical systems, Ergod. Theory and Dyn. Syst., 16 (1996) 871–928. [15] S. Benkadda and G.M. Zaslavsky (Eds.) Chaos, Kinetics and Nonlinear Dynamics in Fluids and Plasmas, Lecture Notes in Physics, 511 (1998). [16] F. Blanchard, B. Host, A. Maass, Topological complexity, Ergod. Theory Dyn. Syst. 20 (2000), 641-662. [17] G. Boffetta, M. Cencini, M. Falcione and A. Vulpiani, Predictability: A way to characterize complexity, Phys. Rep. 356 (2002), 367-474. [18] N. Bourbaki, Elements of mathematics. General topology. Part 1. Hermann, Paris, 1966. [19] R. Bowen, Topological entropy for non–compact sets, Trans. Amer. Math. Soc. 184 (1973), 125–136. [20] R. Bowen, Hausdorff dimension of quasi–circles. Publ. Math. IHES, 50 (1979), 259–273. [21] T. Bohr and D. Rand, Entropy function for characteristic exponents, Physica 25D (1987), 387–398.
Spatio-temporal Characteristics of Complexity
71
[22] H. Bruin, Dimensions of recurrence times and minimal subshifts, in: Dynamical systems: from crystal to chaos, (J.–M. Gambaudo, P. Hubert, P. Tisseur and S. Vaienti, Eds.) World Scientific (2000) 117–124. [23] F. Ceccone, M. Falcione and A. Vulpiani, Complexity Charachterization of dynamical Systems through Predictability. Preprint (2003) [24] E. I. Dinaburg, Relation between diferent entropy characteristics of dynamical systems, Math. Izvestia AN SSSR, 35, (1971), 324-366. [25] H. Furstenberg, Disjointness in ergodic theory, minimal sets and a problem in Diophantine approximation, Mathematical Systems Theory 1 (1967), 1–49. [26] Furstenberg H, Amer. J. Math. 85 (1963), 477. [27] P.R. Halmos, Measure theory, Springer-Verlag, 1974. [28] A. Katok and B. Hasselblatt, Introduction to the modern theory of dynamical systems, Cambridge University Press, London New York (1995). [29] A.N.Kolmogorov and V.M. Tikhomirov, ε-entropy and ε capacity of sets in functional spaces, Usp. Mat. Nauk. 14 (1959), 3-86. [30] P. Kurka and A. Maass, Recurrence dimension in Toeplitz subshifts, in: Dynamical systems: from crystal to chaos, (J.–M. Gambaudo, P. Hubert, P. Tisseur and S. Vaienti, Eds.) World Scientific (2000) 165–175 [31] M. I. Malkin, Rotation intervals and the dynamics of Lorentz-type mappings, Selecta Mathematica Sovietica, 8, (1991) 267-275. [32] J. Milnor, On the entropy geometry of cellular automata, Complex Syst. 2 (1997) 357-385 [33] V. Penn´e, B. Saussol, S. Vaienti, Dimensions for recurrence times: topological and dynamical properties. Discrete and Continuous Dynamical Systems 5 (1999) 783–798. [34] Y. B. Pesin, Dimension Theory in Dynamical Systems: Contemporary Views and Applications. Chicago Lectures in Mathematics, The University of Chicago Press (1997). [35] Ya.B. Pesin and H. Weiss, A multifractal analysis of equilibrium measures for conformal expanding maps and Markov Moran geometric constructions, J. Stat. Phys. 86:1–2 (1997) 233–275.
72 [36] D. Ruelle, Repellers for real analytic maps, Erg. Th. Dyn. Syst. 2 (1982), 99–107. [37] H. J. Ryser, Combinatorial mathematics, The Carus Mathematical Monographs, 15 The Mathematical Association of America, 1963. [38] B. Saussol, S. Troubetzkoy and S. Vaienti, Recurrences, dimensions and Lyapunov exponents, J. of Stat. Physics, 106, (2002), 623–634. [39] F. Takens, Detecting Strange Attractors in Turbulence, Lecture Notes in Maths Springer–Verlag, Berlin, 898 (1980), 336-382 [40] F. Takens, Distinguishing deterministic and random systems, Nonlinear Dynamics and Turbulence, G.I. Barrenblatt, G.Iooss, D.D. Joseph, eds., Pitman, (1983), 314-333 [41] Peter Walters, A variational principle for the pressure of continuous transformations, Amer. J. Math. 97 (1976) 937–971. [42] Peter Walters, An Introduction to Ergodic Theory, Springer Graduate Texts in Math 79, New York (1982). [43] G.M. Zaslavsky Physics of Chaos in Hamiltonian Systems, Imperial College Press, London–Singapore (1998).
WORKING WITH COMPLEXITY FUNCTIONS G. M. Zaslavsky1 V. Afraimovich2 1 Courant
Institute of Mathematical Sciences, New York University 251 Mercer Street, New York, New York 10012 and Department of Physics, New York University, 2-4 Washington Place New York, New York 10003. 2 Instituto
Abstract
de Investigaci´ on en Comunicaci´on Optica UASLP Av. Karakorum 1470, Lomas 4ta secci´on San Luis Potosı, ´ SLP, 78210, M´ ´exico.
Complexity function are described that reflects evolution of instability in dynamical systems. They grow exponentially fast for systems with positive entropy and polynomially for the ones with zero entropy. These quantities can be measured and we show in this lecture notes how to do it in specific situations.
[DOI: 10.1063/1.1566171]
1.
Introduction
The main reason of complexity of behavior of orbits in dynamical systems is their instability, that implies unpredictability. In an oversimplified way one can say that the less predictable is a system, the larger complexity should be assigned to the system. The original version of the dynamics complexity was closely linked to the system’s instability and entropy [KT], [T], [Bo]. A typical situation of the chaotic dynamics could be associated with a positive Kolmogorov– Sinai entropy, or be similar to the Anosov–type systems. This type of randomness and complexity of the systems can be characterized by the 73 P. Collet et al. (eds.), Chaotic Dynamics and Transport in Classical and Quantum Systems, 73–85. © 2005 Kluwer Academic Publishers. Printed in the Netherlands.
74 exponential divergence of trajectories in phase space, and because of that the complexity function grows exponentially in time. As long as investigation of chaotic dynamics reveals new and more detailed pictures of chaos, it was found out that typical Hamiltonians do not posses ergodicity, the boundary of islands in phase space makes the dynamics singular in their vicinity, and even zero measure phase space sets in the Sinai billiard are responsible for the anomalous kinetics. There are numerous examples of the Hamiltonian systems, referred as the chaotic ones, that do not have exponential dispersion of trajectories for arbitrary long time intervals. These pieces of trajectories, called flights, appear with a probability that is not exponentially small [Z1], [Z2]. The behavior of systems with zero Lyapunov exponents definitely has some level of complexity that is reflected in polynomial growth of the complexity function. Thus, the complexity function distinguishes strongly chaotic systems and the weakly chaotic ones. Furthermore, the complexity function contains an information not only about asymptotics but about pre–limiting behavior as well. For example, if for some time interval close orbits belong to chaotic sea in the phase space of a Hamiltonian system then they contain a greater amount of instability than for another time interval for which they are close to a sticky set. Therefore the rate of growth of the complexity function on the first interval will be greater than on the second one. In other words, some details about fluctuations can be extracted from the behavior of the complexity function.
2.
Definition of complexity function
What kind of dynamics should be consider as a simple one and what as a complex one? We do not assume that there is the only definition of complexity which particularly depends on how this notion will be applied to the dynamics. A more or less accustomed definition of the complexity depends on how trajectories are mixed in phase space due to the dynamics. The stronger is mixing, the more complex is the dynamics. One can immediately comment on some weak features of this type of approach that deals with global phase space and global mixing. The process of mixing can be non–uniform in time and it can have local space–different rates. We call these features of mixing as space–time non–uniformities
75
Working with complexity functions
and, speaking about the space, we have in mind the full phase space or its part where the dynamics is ergodic. The former comment leads us to a necessity of such definition of the complexity which could embrace non–uniformity of space–time dynamics represented by trajectories. Let Tˆt : M → M be evolution operators of a dynamical system with the phase space M and x(t) = Tˆt x0 be a point on the trajectory going through x0 at time instant t. Then the function d(x(t), y(t)) = dist(Tˆt x0 , Tˆt y0 )
(1)
defines a distance between two trajectories x(t) = Tˆt x0 , y(t) = Tˆt y0 , x0 , y0 ∈ M
(2)
with initial conditions x0 , y0 . For a discrete time t = n, one should make a corresponding replacement in (2). Any segment of a trajectory of the temporal length n can be written as n−1
Sn (x) = ∪ Tˆk x. k=0
(3)
Two segments Sn (x), Sn (y) are said to be (ε, n)–separated if there exist k, such that d(Tˆk x, Tˆk y) ε, 0 k n − 1. (4) Consider a set A ⊂ M of initial conditions x ∈ A and the corresponding bunch of trajectories started at x ∈ A. After time n we have a set of segments, and some of them are mutually ε–separated. Definition 2.1 The magnitude Cε,n = max{# segments of mutually ε, n − separated}
(5)
is said to be (ε, n)–complexity of the set A. As the function of time n it is called the ε–complexity function. The value ln Cε,n (A) is called the ε–capacity of the set A. To get more details on the introduced definitions, let us consider a one–dimensional system with uniform mixing dynamics on the interval [0, l], x ∈ [0, l], with an exponential divergence of trajectories and with the constant rate of divergence h. Let δx0 be the initial distance at t = 0 between two trajectories and δxt = ε be the distance at time t. Then ε = δx0 exp ht,
(6)
76 that is, for τ t two trajectories are ε–separated. The number of such trajectories is A A ht = (7) Cε,t (A) = e , δx0 ε where A is the length of a small initial interval A. For τ > t the complexity grows exponentially. If the set A has the box–dimension b, then (6) should be replaced by (ε/δx0 )b = eht
(8)
and correspondingly, instead of (7), Cε,t (A) = (A /δx0 )b = (A /ε)b eht .
(9)
For more general situations we may assume Cε,t (A) = (A /ε)b eht C(ε, t),
(10)
where C(ε, t) is a slow varying function of ln ε and t compared to the main terms. It also can be written as follows b = lim lim
n→∞ ε→0
ln Cε,n (A) ln (1/ε)
(11)
[Ta]. The expression (10) shows an explicit way how the complexity depends on the time interval t, accuracy ε, and dimension b, and also, the domain A of a set of initial conditions. The equations (7) and (10) can be treated as follows. Let again M be the phase space (we assume here that it has a finite volume). Let Γ = Γ(M ) be its phase volume, and Γ0 be the phase volume of a set of initial conditions A0 ⊂ M at time t0 = 0 and consider their evolution At up to time t. Let Γt be the volume of the minimal convex enveloping set At . Then for systems with exponential divergence of trajectories Γt = Γ0 eht
(12)
To find how many different states can occupy the volume Γ, one should define an “elementary” minimal volume of one state, i.e., εb . Then max {# states in Γt } = (Γ0 /εb ) eht , A
(13)
Working with complexity functions
77
where maximum is considered with respect to different sets A in Γ0 . Expressions (7) and (8) permit an important physical interpretation. Hamiltonian chaotic dynamics preserves the phase volume, i.e. ˆ t = Γ0 = Γ(At ). The enveloped or coarse–grained phase volume Γt Γ grows approximately as in (12). The number of states in Γt depends on the definition of a state in the enveloped phase volume. Let one state occupies an elementary volume ∆Γ. Then the number of states that occupy the volume Γt is simply N (t; ∆Γ) = Γt /∆Γ = (Γ0 /∆Γ) exp (ht) Γ(M )/∆Γ (14) Let us emphasize that this interpretation stops working when t > (1/h) log(Γ(M )/Γ0 ). Remark. The examples and considerations of the previous section where based on the exponentially increasing complexity or, which is the same, on the exponential uniform dispersion of trajectories. Real Hamiltonian dynamics does not possess uniformity. There are singular zones of different types where Lyapunov exponent is close to zero. As a result, for a time that can be astronomically large and not achievable in any practice, the corresponding segments of trajectories have only polynomial in time dispersion. The formal expression (10) for Cε,t (A) has a limitation for the bounded Hamiltonian dynamics: Cε,t (A) Γ(M )/εb (15) The constraint (15) does not depend on time and therefore it implies the existence of tmax = tc (ε) or tmax = tN (∆Γ) (16) such that trajectories or their segments, being non–separated during the tmax , will be indistinguishable.
3.
Local Complexity Functions
As before, we deal with Hamiltonian dynamics of systems in a phase space M endowed with a distance dist and discrete or continuous time t. The dynamical system Tˆt : M → M defines a distance dist (Tˆt x, Tˆt y) between points on two trajectories at time t with initial states x, y ∈ M . We will need the following definition: Two trajectories with initial points x, y ∈ A will be (ε, t)–indistinguishable if dτ (x, y) = dist (Tˆτ x, Tˆτ y) < ε, 0 τ t. (17) A useful notion of local complexity is based on the verification of divergence of trajectories from fixed ones.
78 Consider a small domain A ⊂ M with diameter δA , and fix some number ε δA ε δM .
(18)
where δM is the diameter of the phase space M (that is assumed to be bounded). Let us pick a point x0 ∈ A and call the corresponding trajectory the basic one. A set QN = {xk ∈ A}N k=1 is said to be locally (ε, t)–separated if (a) For every xk there is 0 τk t such that dist (xk (τk ), x0 (τk )) ε
(19)
dist (xk (τ ), x0 (τ )) < ε, 0 τ < τk ,
(20)
and
(b) for every pair (k, k ), 0 k, k N , dist (xk (τk ), xk (τk )) ε, 0 τk , τk t.
(21)
The time τk in (19) can be considered as the “first arrival” to separation. If (21) is not valid, then a pair of trajectories corresponding to the pair (k, k ) is ε–indistinguishable, and it should be treated as one trajectory during the time t. Definition 3.1 The number C(ε, t; x0 , A) = max{N |QN is locally (ε, t) − separated }
(22)
is called the local complexity function of t. A set QN is called (ε, t)–optimal if it is locally (ε, t)–separated and N = C(ε, t; x0 , A). It is simple to see that C(ε, t ; x0 , A) C(ε, t; x0 , A) if t t
(23)
From the physical point of view there is a restriction on the growth of this function:
79
Working with complexity functions
C(ε, t; x0 , A) Γ(M )/εb = N .
(24)
So, if we are interested in the separation of a bunch QN of N trajectories with initial points xj ∈ QN , j = 1, . . . , N , and their evolution xj (t) = Tˆt (xj ), then after time t we find out that there are N0 = N0 (ε, t, QN ) ε–separated (from the basic one) trajectories – denote this set by QN0 – and N − N0 indistinguishable (from the basic one) trajectories. If QN0 is locally separated then we obtain an estimate, N0 (ε, t, QN ) C(ε, t; x0 , A)
(25)
If, in addition, QN0 is (ε, t)–optimal, then N0 (ε, t, QN ) = C(ε, t; x0 , A).
(26)
In Definition 3.1 we consider (ε, t)–separation of the set A of trajectories that are close to the basic one started at x0 . That is why the complexity C(ε, t; x0 , A) is called local. Now we can consider a set B (m) (m) of basic trajectories with initial points x0 ∈ B. for each x0 we can (m) attach a set {A(m) } of trajectories with initial conditions xk in the (m) vicinity of x0 . For the sake of definiteness assume that (m)
(m )
dist (x0 , x0
) > 2ε, m = m ,
(27)
so that any two trajectories from the vicinities of different basic trajectories are disjoint at least by ε and thus (ε, t)–separated. Each basic trajectory generates the corresponding local complexity (m) function C(ε, t; x0 , {A(m) }). The set B of initial points of basic trajectories will be called B–ensemble. Definition 3.2 The number C(ε, t; B, {A}) =
(m)
C(ε, t; x0 , {A(m) })
(28)
m
is called complexity function of the B–ensemble. (m)
The B– ensemble is specified by the B–set of x0 and initial con(m) (m) (m) ditions xk ∈ A(m) around each x0 within domain δA (compare to (18)). While the construction of sets A(m) can be done fairly uniformly due to its small size, the choice of B–ensemble is free and makes it flexible
80 depending on the problem to be solved. The complexity functions C(ε, t; x0 , A) and C(ε, t; B, {Ak }) show a level of time–proliferation of ε–separated trajectories from the initial set of a large number of indistinguishable points. If we are interested in the only typical (for some measure) orbits we may adjust definitions above to this situation by assuming that B–set (k) always consists of typical points x0 for this measure. Remark. There is a special measure so called the measure of complexity, for calculation of ε–complexity, that distinguishes important ini tial points from non–important ones, see the lecture notes of V. Afraimovich and L. Glebsky in this volume. Roughly speaking, if the measure of complexity of the set A is positive in definitions above, then the local complexity function or the complexity function of the ensemble behaves asymptotically in the same way as the complexity function of the whole phase space with some slow evoluting positive factor. Numerical simulations show that it often occurs for randomly chosen basic orbits and A–sets.
4.
Probability of ε–Divergence
One of the main points we are interested in is behavior of complexity functions in a neighborhood of the sticky set [AZ98]. It is well–known that a “standard” trajectory in chaotic sea behaves in the intermittent way: after relatively short chaotic burst it is attracted to the sticky set for a long time, then comes back to mixing part of the chaotic sea, etc. If our consideration is restricted to a neighborhood of one (or several) basic orbit, then fast separated pieces of orbits correspond to a mixing type of behavior and their initial points are situated much “far” from the sticky set than initial points of slow–separated pieces of orbits. By using this observation, we may eliminate fast–separated points, that is, in fact we may choose such initial points in B–set which practically belong to the sticky set. In other words, we may in principle calculate local or non local complexity of a measure concentrated on the sticky set. More rigorously, assume that an invariant measure ρ is given. Then in definition 3.1 we consider only sets QN = {xj }N j=1 such that (a) QN is locally (ε, t)–separated;
Working with complexity functions
81
(b) the points xj are ρ–typical points (or points which are very close to the ρ–typical ones). The maximal number of elements in such sets QN will be called the local (ε, t)–complexity of measure ρ. We denote it by Cρ (ε, t; x0 , A). Similarly in definition 3.2 we consider only sets QN containing ρ– typical (or very close to them) points. Then we obtain the (ε, t)– complexity of measure ρ, Cρ (ε, t; B, {A}). It is useful to introduce the following quantity 1 [Cρ (ε, t + ∆t; x0 , A) − Cρ (ε, t; x0 , A)] ≈ pρ (ε, t; x0 )∆t, N (29) where N = Cρ (ε, t; x0 , A). This quantity gives a probability to diverge by distance ε from the basic orbits during the time interval [τ, τ + ∆t], and pρ (ε, t, ; x0 ) is the corresponding probability density function. We call them ε–divergence probability and ε–divergence probability density.
Pρ (ε, t; ∆t, x0 ) =
Similarly, 1 [Cρ (ε, t + ∆t; B, {A}) − Cρ (ε, t; B, {A})] N (30) ≈ pρ (ε, t; B)∆t,
Pρ (ε, t; ∆t, B) =
gives the probability to diverge from basic orbits going through B– ensemble during the time interval [τ, τ + ∆t], and pρ (ε, t, B) is the corresponding probability density function.
5.
Calculation of Local Complexity Function
In this section we would like to show that the above introduced definitions of complexity or ε–divergence probabilities are constructive and fairly simple for the utilization. From now, we will choose initial points xj in A in such a way that the distances between xj and the basic point x0 are the same for all j, and we denote it by δ. Moreover, for the sake of simplicity we omit the argument A in C(ε, t; x0 , A) and {A} in C(ε, t; B, {A}). So C(ε, t; x0 ) = C(ε, t; x0 , A) and C(ε, t; B) = C(ε, t; B, {A}).
82 As usual in numerical simulations we sill assume that randomly cho(k) sen points x0 , x0 are typical with respect to some measure ρ we are interested in. The values of N0 in (25), (26) and in (29), (30) depend on the choice of δ, ε, xo (or B). The smaller is δ, the longer t should be considered until the maximal value of C(ε, t; B) or C(ε, t, x0 ) will be achieved. This makes the limit δ → 0 fairly simple. Understanding a way to work with the parameter ε is more complicated. Consider one trajectory xt that starts at x. Let t be very big and select a set of points xk along a trajectory and, approximately, almost uniformly distributed. We can operate with points xk in the same way as with the basic points x(k) in (27). As a result, we obtain the quantity Γ(A) =N (31) εb where points xk belong to the same trajectory. That means that while C(ε, t; x) characterizes the ε–divergence from x during t, C(ε, t; xk ) characterizes the ε–divergence from xk , points x are taken in different places of the phase space and points xk are taken along the only trajectory. It is natural to believe that for an appropriately typical set of x ∈ M and of xk ∈ St and fairly large t, the equality C(ε, t; xk ) = N0 (ε, t; xk )
C(ε, t; x) = C(ε, t; x), t → ∞
(32)
holds where subscripts k are omitted. This equality can be treated as an analog of the ergodic theorem. A corresponding simulation for C(ε, t; x) was performed in [LZ]. The scheme of calculation of C(ε, t; x) is similar to one used for calculation of the Lyapunov exponents, except for some details: (a) The value of ε is much less than the distance typically used to evaluate the Lyapunov exponents. (b) Trajectories of some tracers are ε–separated after a very long time. Just these trajectories correspond to events of our main interest and their statistics should be collected. (c) The scheme of obtaining of C(ε, t; x) provides the “probability” C(ε, t; x)/N to have ε–separation at time t. Therefore one needs to use more general distribution than C(ε, t; x), [AZ].
Working with complexity functions
Figure 1. time
6.
83
Sticky domain Ac where a pair of trajectories is separated by ε after long
Concluding Remarks 1 The complexity of behavior of trajectories is characterized not only by complexity functions but by a flight complexity function as well that takes into account spacial separation (in addition to the temporal one). We omitted in these lecture notes the discussion of the flight complexity function and its relevance to the description of the non–uniformity of behavior of trajectories in the phase space of the typical Hamiltonian system – see [AZ] for definitions and discussions.
2 The growing interests of specialists to characterize the non–longtime evolution (specially in some biological models) and, in fact, the absence of corresponding machinery allow us to believe that the complexity function very soon will find its application to problems in many areas of nonlinear sciences. In [AZ] we made the first step in this direction by giving rigorous definitions and studying simple examples. Now, it is the time to make real use of these quantities which reflect adequately enough the evolution of instability in Hamiltonian and non–Hamiltonian systems.
84 3 There are different ways how complexity function can be applied to real systems. Here is one of them [ZE]. Consider a trajectory that starts at the domain A and visit a singular zone Ac before the first return to A (Fig. 1). There are many such trajectories if the dynamics is topologically transitive. The singular domain Ac is characterized by a long time during which trajectories are staying in Ac . Moreover, distribution density of recurrences Prec (t) is defined by the following asymptotics [Z2]
Prec (t) ≈ 1/tγ ,
t→∞
(33)
(or more specifically, t 1/h). Assume that there is the only one singular domain Ac . Consider now a large number N of pairs of trajectories with initial distances of the order δ 1, fix ε and calculate for them C(ε, t, x)/N . Conjecture: In the limit δ → 0, N → ∞, t → ∞, we have ∞ Prec (t) → const
dx C(ε, t, x).
(34)
0
Since the probability to enter Ac is small, the probability to enter Ac more than one time can be neglected, and a finite dispersion of a pair by ε during a large t can occur only in the case where both trajectories enter a tube of the diameter ε around Ac . Typically, it can be an annulus of the width ε around a sticky island’s border. More results on this conjecture will appear in [ZE].
7.
Acknowledgments
V. A. was partially supported by CONACyT grant 36445-E. G. Z. was supported by the U. S. Navy Grant N00014-02-1-0934 and the U. S. Department of Energy Grant DE-FG02-92ER54184.
References [AZ] V. Afraimovich and G. M. Zaslavsky, Space-time complexity in Hamiltonian dynamics, Chaos 13 (2003) 519–532.
Working with complexity functions
85
[AZ98] V. Afraimovich and G. M. Zaslavsky , Sticky orbits of chaotic Hamiltonian dynamics, Lecture notes Physics, 511 (1998), 59–82. [Bo] R. Bowen, Topological entropy for non-compact sets, Trans. AMS 84 (1973), 125–136. [KT] A. N. Kolmogorov and V. M. Tikhomirov, ε–entropy and ε–capacity of sets in functional spaces, Usp. Math. Nauk 14 (1959), 3–86. [LZ] X. Leoncini and G. M. Zaslavsky, Jets, stickiness, and anomalous transport, Phys. Review E. 65 (2002), 046216. [T]
V. M. Tikhomirov, , Usp. Math. Nauk 18 (1963) 55.
[Ta] F. Takens, Distinguishing deterministic and random systems in Nonlinear Dynamics and Turbulence, edited by G. I. Barenblatt, G. Iooss, and D. D. Joseph (Pitman, New York), (1983) 314–333. [Z1] G. M. Zaslavsky, Physics of Chaos in Hamiltonian systems , Imperial College Press, London, (1999). [Z2] G. M. Zaslavsky, Chaos, fractional kinetics, and anomalous transport, Phys. rep. 371 (2002), 461–580. [ZE] G. M. Zaslavsky and M. Edelman, to be submitted.
This page intentionally left blank
SRB distribution for Anosov maps Giovanni Gallavotti Fisica Roma 1, I.N.F.N. Abstract: Lectures on the construction of the SRB distributions for Anosov maps 1. Anosov maps and Gibbs distributions. Anosov maps are the paradigm of systems with chaotic evolution. Here I consider only smooth maps and in fact I shall illustrate them through the simplest examples which are wo dimensional maps of the torus T 2 . In general a smooth map S of a compact smooth manifold M is a map with the property that around each point x one can establish a system of curvilinear coordinates based on smooth surfaces Wxs and Wxu of complementary positive dimension which is i (1) covariant: S∂W Wxi = WSx , i = u, s; this means that the tangent planes ∂W Wxi to the coordinate surfaces at x are mapped over the corresponding planes at Sx (2) continuous: ∂W Wxi depends continuously on x (3) hyperbolic: the length of a tangent vector v is amplified by a factor Cλ−k for k > 0 under the action of S k if v ∈ Wxu and under the action of S −k if v ∈ Wxs with C > 0 and λ < 1. This means that if an observer moves with the point x it sees the nearby points moving around it as if it was an hyperbolic fixed point. (4) transitivity: there is a point with a dense orbit A key example is the map of the torus T 2 defined by ϕ1 1 1 ϕ1 S = (1.1) ϕ2 1 0 ϕ2 This is a very simple system and one checks immediately the above four properties. The first three are immediate; the existence of a dense orbit follows from the fact that the dϕ map preserves the probability distribution µ0 (dϕ) = (2π)2 (“volume distribution”) and that
T −1 1 f (S i ϕ)g(ϕ)µ0 (dϕ) = f (ϕ)µ0 (dϕ) · g(ϕ)µ0 (dϕ) T →∞ T i=0 lim
(1.2)
for all f, g smooth (say analytic): this means that the dynamical system (S, µ0 ) is mixing hence ergodic and therefore µ–almost all points have a dense orbit. f by Fourier analysis, making use of the fact that the eigenvectors of the matrix proof: 1 1 have components whose ratio is an irrational number.] 1 0 Anosov maps in general do not have an invariant distribution which admits a density with respect to the volume. Very simple examples are small perturbations of the above map, e.g. ϕ1 + ϕ2 + ε sin ϕ1 (1.3) Sε ϕ = ϕ1 which has no invariant distribution with density with respect to the volume i.e. Lebesgue) distribution as we shall see (this is non trivial).
The key question is which is the statistics µ of motions? this means to ask which are the asymptotic properties of a point x chosen randomly with respect to the volume distribution. The question is interesting because it is believed that the properties that 87 P. Collet et al. (eds.), Chaotic Dynamics and Transport in Classical and Quantum Systems, 87–105. © 2005 Kluwer Academic Publishers. Printed in the Netherlands.
88 are usually observed when studying the motions of a system started from an initial datum typical for random choices with a distribution continuous with respect to the volume. Precisely this means considering the limit T −1 1 f (S i x) T →∞ T i=0
lim
(1.4)
and to if it exists for all smooth functions f and for almost all points x with respect to the volume and, furthermore, for all such f and for almost all points x it is independent of x. If so this will define a unique probability distribution µ on M such that
T −1 1 f (S i x) = µ(dy) f (y) T →∞ T M i=0 lim
(1.5)
and the distribution µ is naturally called the statistics of the map S. It is also called the SRB distribution or the SRB statistics of the dynamical system (M, S). The lack of a density of µ with respect to µ0 is at the same time a difficulty and a main point of interest: clearly we cannot imagine to write µ(dx) = ρ(x)µ0 (dx) because, in general, ρ(x) does not exist and we must give up the hope of setting up a differential equation determining ρ. Of course the question of existence of a statistics SRB can be raised in much more general contexts: however in the case of Anosov maps it can be solved quite explicitly and completely (in the affirmative). More generally it is believed that in physical applications the systems will behave chaotically enough so that a SRB distribution (i.e. a statistics of almost all points with respect to the volume) exists: for this reason it is important to understand Anosov maps. They play in chaotic dynamics the role plaid by harmonic oscillators in regular dynamics. No system is a harmonic oscillator but one always tries to show that a system can be reduced “for practical purposes” to a system of harmonically coupled harmonic oscillators; and likewise in chaotic dynamics one tries to show that the system behaves as an Anosov map (or its continuous time version which is a “Anosov flow”, which I will not consider here). Some even go to the point of stating a Chaotic hypothesis that essentially says that for practical purposes a chaotic system can be regarded as an Anosov system, [GG99, GG02]. The technical advance on the theory of Anosov systems is easily understood if one first studies the simple map in (1.1). In fact we can imagine to define a partition P = (P1 , . . . , Pn ) of phase space fine enough so that if two points x, y have the same history on the partition, i.e. if for all k ∈ Z it is S k x, S k y ∈ Pσk then x = y; i.e. if two points x, y have the same history σ on P then they coincide. Anosov maps admit special partitions P, called Markov partitions, which have the very special property that the sequences of symbols that can be histories of points in M are simply characterized by a compatibility matrix T : this is a n × n–matrix Tσσ with entries 0, 1. And a sequence σ = (σj )j∈N can be the history on P of a point if Tσi σi+1 = 1 for all i ∈ N , such sequences are called T –compatible; and almost all points (with respect to the volume µ0 ) are represented by a unique T –compatible sequence. A few points may admit several compatible sequences that represent them: however there is a bound on the number of different sequences.1 Note that the above statement is quite non trivial: in general given any partition we can define the histories of points on it: however the set of sequences that one obtains 1
The latter ambiguity is closely related to the ambiguity that one has in representing a real number in basis 10 (say): the number 1 can be represented as 1.00000... or as 0.99999....
89 are subject to subtle compatibility relations rather than the simple nearest neighbor compatibility just mentioned. The compatibility will in general involve conditions on infinitely many symbols in σ . In a more colorful language we can say that via a Markovian partition we turn the phase space M into the configuration space of a one dimensional lattice spin system with a hard core nearest neighbor exclusion. The main result will be that the SRB distribution, regarded as a probability distribution on the set of histories corresponding to the points of the phase space M , will be a Gibbs state with a short range interaction potential on the configurations of the hard core lattice spin system just mentioned. Consider the map in (1.1) or its perturbation in (1.3). Note that the origin is a fixed point and if ε = 0 its stable and unstable manifolds are two (orthogonal) straight lines emerging from the the origin and with quadratic irrational slopes (that can be elementarily computed). We imagine drawing some finite parts of them, see fig. 1.
Fig. 1:
O
Portions of the stable and unstable manifolds of the Arnold’s cat map drawn after representing T as a lattice of copies of the square [0, 2π]2 with opposite sides identified. The heavy dots mark the endpoints. 2
Of course, since the slopes are irrational, the lines will fill densely the torus, if continued indefinitely and drawn in T 2 . We however stop in a strategic way depicted in fig. 2. Namely after reporting inside T 2 the lines in fig. 1 above we realize that we have divided T 2 into rectangles with a few exceptions. These exist because the end points (marked by bullets in fig. 1) may (and will in general) end up in the “middle” of some rectangle. This is not desired as we want to have a partition into exact rectangles: hence we continue the drawn lines beyond their endpoints until there is an intersection with the orthogonal lines and we stop there. We do this first for the expanding line (i.e. the one with positive slope) and then for the contracting line (the one with negative slope). The construction is described in fig. 2.
Since the boundaries of the rectangles are subintervals cut on the drawn portions of stable and unstable manifolds of the origin we call ∂s Pσ and ∂u Pσ the sides of the rectangle Pσ which lie on the drawn stable and unstable lines. Therefore applying S to Pσ it will be stretched along the direction of ∂u Pσ and contracted along the direction ∂s Pσ . Nevertheless the a priori very unlikely event will happen that the S–image of the
90 5
10
11
9
9
4 3
1 7
7
2 6
8 10
5 4
11
8
Fig. 2: The continuation parts are marked as dashed and come out of the points marked in fig. 1; note that the four vertices of the square are in reality the same point (i.e. the origin) because of the periodic conditions that must be imagined at the boundaries. sides in ∂s Pσ (respectvely the S −1 -image of the sides of ∂u Πσ ) will become subsets of the union of the sides of the same type.
91 s
s ∆
S∆ u u Fig. 3: The figures illustrate, symbolically as squares, a few elements of a markovian pavement. An element ∆ of it is transformed by S into S∆ in such a way that the part of the boundary that contracts ends up exactly on a boundary of some elements of P.
This is the markovian property of the partition P. To it we always add the condition that the rectangles are so small that the streching cannot elongate any of them so that S applied to a rectangle transforms it into a set which intersects twice another rectangle of the partition. The latter smallness property can be achieved simply by choosing the two drawn parts of stable and unstable lines emerging from the prigin long enough (and using the if continued indefinitely they would be dense). Define Tσσ = 1 if the image of the interior of Pσ intersects the interior of Pσ and Tσσ = 0 otherwise; then a moment of reflection shows that if σ is a sequence such that Tσi σi+1 ≡ 1 then there is a point x ∈ M whose history on P is precisely σ and viceversa if x is a point it admits one history which is T –compatible. If the elements of the partition are small enough so that the situation in fig. 3 is realized and no S–stretched rectangle crosses twice or more any other rectangle there is a unique x with history σ . A point x might admit more compatible histories but not more than 4: multiple compatible histories for the same point occur when the point or one of its S k –images falls on the boundary of some of the rectangles: the set of such points has zero volume. Hence apart from points which in their motion visit the boundaries of the rectangles and which, therefore, form a set of zero volume there is a 1-1 correspondence between points and sequences.
Remark: Note that the above constructions are really only based on the existence of a fixed point with dense stable and unstable manifolds (i.e. curves, as we consider two dimensional cases). Therefore the construction is not really heavily using the special structure of the map S. Indeed in general one can show that in Anosov systems the stable and unstable manifolds of every point are dense. Furthermore the construction based on the existence of a fixed point can be easily extended to the case in which the fixed point is replaced by a periodic point: hence it is very general because one can prove that Anosov maps admit a dense set of periodic points. The correspondence point–history can be used to transform the volume distribution into a probability distribution on the space of the compatible sequences: this is due to the property that points that have multiple compatible histories form a set of zero volume. Hence the volume distribution µ0 becomes a probability distribution m0 on the configurations σ of a lattice spin system with a nearest neighbor hard core. Very remarkable is that m0 turns out to be a Gibbs state with short range interaction. We shall check that this is true both for the map (1.1) and for (1.3) and is a general property of all Anosov maps. The Gibbs property of the volume distribution once coded into a probability distrifbution on the space {1, 2, . . . , n}Z T of T –compatible sequences can be checked by studying the probability of the set of points that between time −N and time N have preassigned
92 history σ−N , . . . , σN . The property illustrated in fig. 3, i.e. the markovian property, im −k Pσk , whose histories form the set of compatible plies that the latter set of points ∩N −N S N ...0 ... N sequences denoted Cσ−−N , is a small rectangle whose size decreases exponentially ...σ0 ...σN with min(N, N ); we call x , x , x the points in its lower left corner and, resectively, to the right of it or above it (see fig. 4). S N Pσ−N Pσ0
S −N PσN δux
δsx
Fig. 4: The angle ϕ(x ) is marked in the dashed region (in general it is not 90o ) around the corner denoted x in the text; the marked corners represent x and x (with the first up and the latter on the −j P , with σ = σ . left of x ); the shadowed region represents the intersection ∩N σj 0 0 −N S
...0 ... N This is illustrated in the fig. 4. Therefore the m0 –probability of Cσ−N is the −N ...σ0 ...σN −k area of the rectangle ∩N S P which can be read directly from the figure to be simply σk −N λN +N δσuN δσs −N if δσuN is the size of the unstable side of QσN and δσs −N is the size of the stable side of Qσ−N . in formulae
−k Pσk ) = λN +N δσuN δσs −N m0 (∩N −N S
N −1
Tσj σj+1
(1.6)
j=−N
where we have inserted the product to say explicitly that m0 vanishes unless the string σ−N . . . σN is T –compatible. It is a very instructive exercise to check that setting pσσ = (δσu )−1 λ Tσσ δσu ,
pσ = δσs δσu
(1.7)
the (1.6) is the probability of the sequence of events σ−N . . . σN in the stationary Markov probability pσσ . The check is easy chain with single event distribution pσ and transition if one notes that it must be σ δσs δσu = 1 and σ λ Tσσ δσu = δσu (the relations express that the sum of the areas of the squares Pσ is equal to the volume of the torus T 2 i.e. 1 with our normalizations and likewise that the sum over σN of the areas of the rectangles N −1 −k −k Pσk equals the area of the rectangle ∩−N S Pσk ). ∩N −N S Thus we see that the volume distribution becomes a Markov process on the symbolic representation of the points of phase space. This is a special Gibbs state with nearest neighbor potential − log pσσ or equivalently with potential − log Tσσ , i.e. a purely nearest neighbor hard core potential. More generally consider the map (1.3): the stable and unstable manifolds of the origin will be slightly modified and curved. We perform the “same” construction and we see that not only we construct a partition with the markovian property described by fig. 3 but the partition is very close to the one constructed above for the ε = 0 case and in particular it has the same compatibility matrix. This means that the symbolic description
93 of the two systems is exactly the same and the remark could be used to dervive in this case the important Anosov theorem that states that two Anosov diffeomorphisms S and S of M that are close enough as maps (in the C 2 –topology at least) are isomorphic in the sense that there is a homeomorphism h of M into itself such that Sh = hS , i.e. they differ by a change of coordinates (which in general is, however, only H¨ older continuous). For ε small the figure fig. 4 remains the same, with the sides of the rectangles slightly −k Pσk is now curved for ε small and the result is that the area of the “rectangle” ∩N −N S approximately sin ϕ(x)
N
−i λ−1 u (S x)
i=1
N
λs (S i x)δσu−N δσs N
(1.8)
i=1
−k Pσk and the size of the sides has to be computed by compowhere x is a point in ∩N −N S sition rule of differentiations and λu (x), λs (x) denote the expansion and the contraction rates of the length of the unstable manifold and of the stable manifold under S. Proceeding heuristically we express (1.8) in terms of symbolic dynamics. This is possible because the functions λu (x), λs (x), ϕ(x) which are no longer constant can be shown to be H¨older continuous with exponent α < 1:
|λu (x) − λu (x )| ≤ Ld(x, x )α ,
| sin ϕ(x) − sin ϕ(x )| ≤ Ld(x, x )α
(1.9)
if d(x, x ) is the distance between x and x and L > 0 is a constant. Suppose for simplicity that Tσσ ≡ 1,i.e. that there is no compatibility condition to fulfill: this is usually not the case if T arises from an Anosov map (in fact I think that it is possible that this is never the case), nevertheless suppose so for a moment. Then we can consider the sequence 1 with entries 1 and if σ is the history of x write def
log λu (x) = Λu (σ ) and Λu (σ ) =Λu (1) + (Λu (1σ0 1) − Λu (1))+ + (Λu (1σ−1 σ0 σ1 1) − Λu (1σ0 1)) + . . . =
∞
Φuk (σ−k . . . σk )
(1.10)
k=0
where 1σ−j . . . σj 1 denotes the symbolic sequence obtained by completing with symbols 1 to the right and to the left the string σ−j . . . σj and def
Φuk (σ ) = Λu (1σ−k . . . σk 1) − Λu (1σk+1 . . . σk−1 1)
(1.11)
The property (1.9) implies that |Φuk (σ )| ≤ F e−kκ Φuk
(1.12)
dependsonly on σ−k . . . , σk . Likewise we can introduce for some F, κ > 0; note that Φsk (σ−k . . . σk ), sk (σ−k . . . σk ) to represent − log λs (x) and − log sin ϕ(x). The case of hard core (i.e. nontrivial compatibility matrix) can be treated similarly: instead of continuing with 1 to the right and left we continue in some “standard way” depending on the compatibility matrix: we prefix a compatible sequence of symbols and continue a given finite string to the right with the right half of the fixed string of symbols after interposing a string to allow the matching between the last symbol of the given finite string and the first of the right half of the prefixed string: the interplating string a exists because transitivity implies that there is a power a of T such that Tσσ > 0. Hence for every pair of symbols σ, σ we can find, and fix once and for all, an interpolating
94 string which is compatible and has σ as first symbol and σ as a–th. Likewise we can proceed for the continuation to the left. The expression (1.8) with N = N becomes, if τ denotes the shift operation on sequences σ N N h − Φu Φsk (τ −h σ )+c(σ)+∆N (σ ) k (τ σ )− h≥k≥1 h≥k≥1 e (1.13) with ∆N (σ ) depending only on the values of σj with j close to ±N in the sense that |∆N (σ ) − ∆N (σ )| < De−κ if σ and σ differ only at distance ≥ from ±N ; likewise c(σ ) depends only on the values of σ at sites near the origin. One recognizes that (1.13) is the formula that would describe a Gibbs state for the one dimensional lattice spin system in [−N, N ] ∩ Z with a nontranslation invariant potential which is Φu to the right of the origin and Φs to the left in an external field which is appreciably different from 0 only near the origin and near the boundary at ±N . The reason the expression (1.8) is approximate is due to the finiteness of N, N . Therefore taking the limit as N → ∞ in (1.13) we find, at the heuristic level in which we are working, that the volume distribution µ0 is coded via the symbolic dynamics into a Gibbs state fr the one-dimensional lattice with hard core nearest neighbor interaction and with potential Φu to the right of the origin and Φs to the left of the origin, and with a further potential given by a potential c localized around the origin. Few systems are better understood than one dimensional lattice spin systems with short range interaction. Such systems, when translation invariant, are ergodic, mixing and isomporphic to Bernoulli shifts; furthermore their correlation functions decay exponentially fast. The nontranslation invariant case is similar: to the far right of the origin the Gibbs state looks like the translation invariant state with potential Φu and to the far left like the translation invariant state with potential Φs . This means that if F (σ ) is a H¨older continuous function T −1 1 F (τ j σ ) = dm(σ )F (σ ) T →∞ T j=0 lim
(1.14)
with m0 probability 1 if m is the Gibbs state with potential Φu . Hence the SRB distribution will exist and it will be the probability distribution that is coded into m by the correspondence between points and histories on the Markovian partition. Note that changing sign to time we likewise construct the SRB distribution that gives the statistics of the motions observed backward in time: it is the probability distribution that, by the correspondence between points and histories on the Markovian partition, is coded into the Gibbs state m− with potential Φs . Clearly the above discussion solves the problem in a very theoretical form: the real problem remaining is how to control the SRB distribution, i.e. how to compute Φu and, therefore, the time averages of the observables. This will be discussed in the next lecture. Problems. (1) Consider the map S of T 2 in (1.1) into itself. Show that the following partition is not markovian because the corresponsence thatit establishes between points and histories is not one–to–one even excluding a set of zero volume of points. (2) Show that the following refinement of the previous partition is Markovian, (3) Three dimensional Anosov map Consider the torus T 3 and the map on it defined by the matrix
95 2
1
1
3
2 Fig. 5: A pavement with three rectangles whose sides lie on two connected portions of stable and unstable manifold of the fixed point at the origin.
2
23
1
1
3
3 4 43
1 1
3
1 1
4
2 23
2
2 1 1
Fig. 6: A Markovian pavement (left) for the square root S0 of Arnold’s cat map. It is obtained from the partition in Fig. 5 by continuing a little further the stable manifold of the origin breaking into two parts the rectangle labeled 2 (whose large size was responsible for the non-Markovian nature of the pavement in Fig. 5). The images under S0 of the pavement rectangles is shown in the right figure: corresponding rectangle are marked by the same colors.
0 1 0 N =
0 1
0 0
1 0
1
Nk
,
def
=
0 0
p k
def
= vk
qk rk
and show that this is an Anosov map of T 3 . (Hint: check that the eigenvectors have the three components which verify a Diophantine property. See the following problems.) (4) (Rationally independent 3–vectors,) Suppose that the two equations n3 = an ± b, with a, b integers, do not admit integer solutions, and let ω be real and a root of the equation ω 3 = aω + b. Show that the vector w = (1, ω, ω 2 ) has rationally independent components. The case a = b = 1 defines a real root ω which is called the spiral mean. (Hint: If not ν · w = ν1 + ν2 ω + ν3 ω 2 = 0 with 0 = ν ∈ Z3 and ω would be a quadratic number, i.e. a √ number of the form ω = (x + y) with x, y rational. Since ω is also a solution of the third order equation √ √ y must be rational: in fact if y is irrational then the equation ω 3 = aω + b implies
x3 + 3xy − ax − b +
√
y (y + 3x2 − a) = 0,
and necessarily y + 3x2 − a = 0 and x3 + 3xy − ax − b = 0, which means that 8x3 − 2ax + b = 0 admits a rational root x = p/q, with p, q relatively prime, i.e. 8p3 − 2apq 2 + bq 3 = 0. This says that (2p)3 is is integer: therefore n3 = an − b admits an integer divisible by q 2 so that q = 1 or q = 2 and n = 2p q solution, in contradiction with the hypothesis. Hence ω has to be rational. If ω = p/q, p, q relatively prime integers, then p3 = a p q 2 + q 3 and q 2 divides p3 , hence q = 1 and p is an integer solution of n3 = a n + b, which again contradicts the hypothesis.)
(5) (Tartaglia’s formula and rational independence) Let 3 p, 2 q be integers with q 2 + p3 > 0 and suppose that the equations z 3 = 3pz ± 2q do not admit 1 1 integer solutions. Show that w = (1, ω, ω 2 ) is a rationally independent vector if ω = (q + (p3 + q 2 ) 2 ) 3 + 1
1
1
1
(q − (p3 + q 2 ) 2 ) 3 . Show that, therefore, w = (1, 2 3 , 4 3 ) is a rationally independent vector. Check that the spiral mean is , ,
ω=
3
1 2
+
1 2
23
27
+
3
1 2
−
1 2
23
27
.
(Hint: By Tartaglia’s formula, divulged by Cardano, ω is a real root of ω 3 = −3pω + 2q: hence one applies problem (4). Note that 21/3 is a root of ω 3 = 2.)
96 (6) (An example of a Diophantine 3–vector,) Let 0 1 0 N = 0 0 1 , 1 1 0
Nk
1 0 0
def
p
=
k
qk rk
def
= vk
Show that ρj = pj , qj , rj verify the recursion ρj = ρj −2 + ρj −3 , j ≥ 3. Let λ > 1, λ+ , λ− be the three eigenvalues of N , |λ+ | = |λ− | = λ−1/2 and let w0 , w+ , w − = (1, λj , λ2j ), j = 0, ± be the respective
eigenvectors (note that λ3j = λj + 1). Let N T be the transposed of N . Given ν ∈ Z3 define, if it exists, k so that for 0 ≤ h ≤ k |(N T )h ν · w0 | ≤ max |(N T )h ν · w± |, ±
|(N T )(k+1) ν · w0 | > max |(N T )(k+1) ν · w± |, ±
k
otherwise set k = −1. Check that |ν | > B |λ± |−k = B λ 2 for some B > 0 (which only depends on the matrix N ); deduce that therefore w0 is a Diophantine vector with exponent τ = 2. (Hint: The recursion can be derived from the remark that N 3 v 0 = v 0 + N v 0 . To check the Diophantine property remark that 1 ≤ |(N T )k ν | because N has no zero eigenvalue; hence by the definition of k and for a suitable b > 0 depending on the basis w0 , w± , one has 1 ≤ |(N T )k ν | ≤ b max± |w± · (N T )k ν | ≤ k
b |ν | λ− 2 max± |w± | (in fact in R3 all metrics are equivalent). Therefore, by the definition of k, one has |w 0 · ν | = λ−(k+1) |w0 · (N T )(k+1) ν | ≥ b λ−(k+1) |(N T )(k+1) ν | ≥ b λ−(k+1) ≥ b |ν |−2 .)
(7) (More examples of Diophantine 3–vectors,) Show that the example of problem (6) can be extended by considering 3 × 3 integer entries matrices N with only one eigenvalue with modulus greater than 1 and two others with modulus less than 1 and with eigenvectors with rationally independent components. Find a few examples by studying matrices whose characteristic equation has roots that can be discussed by the techniques of problems (4),(5). The vectors constructed in this way are all in a class called Pisot–Vijayaraghavan Diophantine 3–vectors. (Hint: For instance consider matrices obtained from N in problem (5) by replacing the last row (0, 1, 0) by (0, p, q).)
Bibliographical note The Markov partitions construction for Anosov maps based on the stable and unstable manifolds of a fixed point is very simple but it applies only to two–dimensional maps with a fixed point or a periodic point: I learnt it from M. Campanino. The general construction goes way back to Adler–Weiss, who gave the first example [AW68], to Sinai [Si68], to Bowen [Bo70], Ruelle [Ru73]. The three dimensional Diophantine vectors theory and construction is taken from C. Chandre, [Ch99],[CM01]. The general theory of Markov partitions is due to Y. Sinai, [Si68a], [Si68b]; Bowen and Ruelle extended it to more general systems. 2. Perturbative construction of the conjugation. The lack of smoothness of the stable and unstabe manifolds, of the isomorphism conjugating close Anosov maps and the lack of absolute continuity of the SRB distribution may induce pessimism about being able to say something concrete about the qualitative properties of such systems. In reality the situation is much better than one might fear. For instance in the context of perturbation theory it is possible to study the perturbations of Arnold map quite easily. In a sense the lack of regularity is only an apparent phenomenon due to a somewhat inappropriate a priori hope of continuity. The change of properties of motions following small changes of the time evolution map are very smooth and regular if seen from the appropriate point of view and this will be the key to the study of the SRB distribution for syste,s close to syste,s ad,itting a si,ple SRB distribution, Like (1.1). To illustrate this I shall discuss the map (1.3) as a function of ε for ε small. The result to be discussd is
97 Let f (ϕ) be a real trigonometric polynomial, f (ϕ) =
the two-dimensional torus T 2 and let
ν ∈Z2 ,|ν|≤N
Sε ϕ = S0 ϕ − εf (ϕ),
with
S0 =
1 1
1 0
eiν ·ϕ f ν , defined on
.
(2.1)
For β ∈ (0, 1) there exist C(β) < ∞ and ε0 (β) > 0 such that for |ε| < ε0 (β) the equation H ◦ S0 = Sε ◦ H
(2.2)
defines a unique homeomorphism ϕ → H(ϕ) which is analytic in ε in the complex disk older continuous with exponent at least as large as β and with H¨ older |ε| < ε0 (β) and H¨ continuity modulus bounded by C(β).
This tells us that we can conjugate the map Sε to the map S0 via a function H that is analytic in ε. However, in general it is not true that we can conjugate S0 to Sε via an analytic homeomorphism. Indeed the equation - ◦ Sε = S0 ◦ H H
(2.3)
cannot be studied with the method developed in the proof below because it would require - ) in powers of ψ . an expansion of H(ψ Proof: We shall write ϕ = H(ψ ) = ψ + h(ψ ), ψ ∈ T 2 ; then the relation (2.1) becomes an equation for h, namely S0 h(ψ ) − h(S0 ψ ) = εf (ψ + h(ψ)),
(2.4)
Hence we look for a solution which is analytic in ε: h(ψ ) = εh(1) (ψ ) + ε2 h(2) (ψ) + · · · with h(k) an ε–independent function. For instance the equation for the first order is S0 h(1) (ψ) − h(1) (S0 ψ ) = f (ψ).
(2.5)
√ We call v + , v − the two normalized eigenvectors of S0 relative to the eigenvalues (1± 5)/2 √ and we call λ the inverse of the largest one (λ = ( 5−1)/2), so that λ+ = λ−1 , λ− = −λ: in the following the only property that we shall use is λ < 1. The functions f , h can be split into two components along the vectors v ± :
f (ψ ) = f+ (ψ)v + + f− (ψ )v − ,
(2.6)
h(ψ ) = h+ (ψ)v+ + h− (ψ )v − , (1)
and the equations (2.5) for h± are (1)
(1)
(1)
(1)
λ+ h+ (ψ ) − h+ (S0 ψ ) = f+ (ψ ),
(2.7)
λ− h− (ψ ) − h− (S0 ψ ) = f− (ψ ). The equations (2.7) can be solved by simply setting h(1) α (ψ ) = −
p∈Zα
−|p+1|α αλα fα (S0p ψ ),
α = ±,
(2.8)
98 where Z+ = [0, ∞) ∩ Z and Z− = (−∞, 0) ∩ Z are subsets of the integers is taken of the inequality λ = λ−1 + = |λ− | < 1 to ensure convergence. (k) Therefore the equations for h± become h(k) α (ψ ) =
·
s
∞ 1 s! s=0
k1 +···+ks =k−1, ki ≥0 α1 ,...,αs =±
p∈Zα
(v αj · ∂ϕ )
s
fα (S0p ψ )
Z
and advantage
αλ−|p+1|α · α
(2.9)
p j) h(k αj (S0 ψ )
,
j=1
j=1
and proceeding as usual in perturbation theory we shall use a graphical representation for the (2.9). (k1 ) α1 (k2 ) α, p α 1 (k) = v v s! r s>0 k1 +...+ks =k−1 (ks−1 ) αs (ks ) Fig. 7: Graphical interpretation of (2.9) for k ≥ 1. (k)
Here the l.h.s. represents hα (ψ ). Representing again, in the same way, the graph (k)
elements that appear on the r.h.s. one obtains an expression for hα (ψ ) in terms of trees, oriented toward the root. v5
ν v1 j r
0
v1
ν v0
v6 v3
ν =ν 0 v0
v7 v8 v4
v2 v12
v9 v10 v11
Fig. 8:
A tree ϑ with k = 13, and some decorations. Only two mode labels (see below) and two momentum labels (see below) are explicitly marked on the lines 0 , 1 ; the number labels, distinguishing the branches, are not shown. The arrows represent the partial ordering on the tree.
A tree ϑ with k nodes will carry on the branches a pair of labels α , p , with p ∈ Z and α ∈ {−, +}, and on the nodes v a pair of labels αv , pv , with αv = αv and pv ∈ Zαv such that pv , (2.10) p(v) ≡ pv = wv
where the sum is over the nodes following v (i.e. over the nodes along the path connecting v to the root), v denotes the branch v v exiting from the node v, and to each tree we
99 shall assign a value given by
Val(ϑ) =
v αv −|pv +1|αv p(v) λαv ∂αvj fαv (S0 ψ ), sv ! j=1
s
v∈V (ϑ)
(2.11)
def
where ∂α = v α · ∂ ϕ , V (ϑ) is the set of nodes in ϑ, the nodes v1 , . . . , vsv are the sv nodes preceding v (if v is a top node then the derivatives are simply missing). If Θk,α denotes the set of all trees with k nodes and with label α associated to the root line, then one has ∞ hα (ψ ) = εk Val(ϑ), (2.12) k=1
ϑ∈Θk,α
and the “only” problem left is to estimate the radius of convergence of the above formal power series. For this purpose it is convenient to study the Fourier transform of the function hα (ψ ). This is easily done graphically because it is enough to attach a label (“mode label”) ν v ∈ Z2 to each node and define the momentum that flows on the tree def branch v v, i.e. ν v = wv ν w . Then (2.12) becomes
hα (ψ ) =
∞
εk
h(k) α,ν =
ϑ∈Θk,ν,α pv ∈Zαv
·
−
v∈V (ϑ)
−p(v ) S0 ν v
eiν ·ψ h(k) α,ν ,
(2.13)
ν∈Z2
k=1
with
αv −|pv +1|αv λαv fαv ,S −p(v) ν · 0 v sv !
· v αv ,
(2.14)
v∈V (ϑ) v =v0
where Θk,ν ,α denotes the set of all trees with k nodes and with labels ν and α associated with the root line. (k) Calling F = maxν |fν | we can estimate ν |ν |β |hα,ν |. The only problem is given by the presence of the factor |ν|β . In fact consider first the case β = 0: since we are assuming that f is a trigonometric polynomial there are only (2N + 1)2 possible choices for each ν v , given pv , such that |S0−pv ν v | ≤ N . Hence fixed ϑ, {αv }v∈V (ϑ) and {pv }v∈V (ϑ) the remaining sum of products in (2.14) is bounded by (if λ ≡ λ−1 + ≡ −λ− )
(3N )2k N k F k
v∈V (ϑ)
λ|pv | . sv !
(2.15)
The sum over the pv is a geometric series bounded by(2/(1 − λ))k . The combinatorial problem is well known: the factor v (1/sv !) becomes, after summing over all the trees, simply bounded by 23k , (22k due to the number of trees for fixed labels and 2k due to the sum of labels αv ). This is nt the best bound but it suffices in our case in which f is a trigonometric polynomial. In fact we have not used the (sv !)−1 and we have bounded them by 1: they would be necessary if we had supposed f to be only analytic rather than a trigonometric polynomial. Therefore for β = 0 we have proved that the conjugating function H exists and that def inside the complex domain |ε| < ε0 (0) = (3N )−3 F −1 2−4 (1−λ) it is uniformly continuous and uniformly bounded with a uniformly summable Fourier transform.
100 Taking β > 0 requires estimating |ν |β : we bound it by v |ν v |β . Then we can make −p(v) use of the fact that |S0 ν v | ≤ N to infer that |ν v | ≤ λ−|p(v)| BN , where B ≥ 1 is a components with ratio a quadratic suitable constant (because the eigenvectors of S0 have β irrational, hence a Diophantine irrational). The sum v |ν v | is over k terms which we estimate separately so that we can write v |ν v |β ≤ k|ν v |β where |ν v | = maxv |ν v |. This can be taken into account by multiplying (2.15) by an extra factor (BN )β λ−β|p( v)| ≤ BN λ−β
v
|pv |
. Therefore if β < 1 the bound that we found for β = 0 is modified into ε0 (β) = (3N )−3 F −1 (1 − λ1−β )2−5 .
(2.16)
This shows that H(ψ ) analytic in ε in the disk with radius ε0 (β). Furthermore, since in (2.16) we inserted (for simplicity) an extra factor 2−1 in excess of the result obtained by the procedure described, the H¨ older modulus is also uniformly bounded by a suitable function C(β) of β. Note that ε0 (β) → 0 for β → 1. The map H is a homeomorphism. In fact it is one-to-one because if ϕ = ψ i + h(ψ i ) for i = 1, 2 and ψ 1 = ψ 2 one would have S0k ψ 1 + h(S0k ψ 1 ) = S0k ψ 2 + h(S0k ψ 2 ) for all k, which is impossible being incompatible with the hyperbolicity of S0 (as a matrix). Furthermore given any ϕ there is a ψ such that H(ψ ) = ϕ: this is a general property of injective maps of the torus T d of the form ϕ = ψ + h(ψ ), with h H¨older continuous and smaller tha π. Indeed if d = 1 we see that as ψ runs around the circle the point ϕ = ψ + h(ψ) follows and must pass through all points of the circle as well: hence if ψ is given there is a ϕ and a function k(ϕ) such that ψ = ϕ + k(ϕ) and the function k is continuous. If d = 2 one repeats twice the argument: first we compute the partial inverse of ϕ1 = ψ1 + h1 (ψ1 , ψ2 ) by fixing ψ2 and determining k (ϕ1 , ψ2 ) such that ψ1 = ϕ1 + k (ϕ1 , ψ2 ), with k continuous; then one considers the map ϕ2 = ψ2 + h2 (ϕ1 + k (ϕ1 , ψ2 ), ψ2 ) and repeats the argument obtaining ψ2 = ϕ2 + k2 (ϕ1 , ϕ2 ). One finally sets ψ1 = ϕ1 + k1 (ϕ1 , ϕ2 ) with k1 (ϕ1 , ϕ2 ) = k (ϕ1 , ϕ2 + k2 (ϕ1 , ϕ2 )).
Problems. (1) (A property of the golden mean) Prove that since λ is Diophantine the correlations of Arnold’s cat map decay superexponentially. (Hint: Given two functions f and g, analytic on T2 , write their correlation in Fourier space, C=
ν
fν g−S −p ν ≤ F G
e−κ|ν | e−κ
|S −p ν |
ν
where F, G, κ, κ are constants depending on f, g. Then use the Diophantine condition to deduce the inequality |S −p ν | > cλp /|ν |−τ , for suitable constants c and τ . If λ is the golden mean one can take τ = 1.)
(2) Show that if |S0p ν | ≤ N , then there is a constant B = O(N ) such that |ν| ≤ λ−|p| B and B = N is a possible choice. (Hint: Call the eigenvectors v α , α = ±, and let 2B = maxµ∈Z2 ,|µ|≤N,α=± |v α · µ|;
then note that, by the spectral decomposition of the matrix S0 , one has |ν| = |S0−p µ| ≤ 2|λ|−|p| |µ| ≤ B|λ|−|p| .)
(3) (Alternative to the convergence proof for H) Show without using the Fourier transform that the series for H defined by (2.11) converges. (Hint: Bound the s-th derivatives by the maximum of F of the Fourier coefficients of f times N s .)
(4) (Homeomorphism in the case of analytic f ) Show that the series for H defined by (2.11) converges under the only assumption that f is analytic. (Hint: Bound the m-th derivatives by the maximum F∞ of |f (ϕ)| in a strip |Im ϕj | < ξ (for some ξ > 0) times m!ξ −mv F∞ . The factorial is compensated by the sv !’s in (2.11) and the estimate proceeds as in the trigonometric polynomial case.)
(5) (Continuity of Markov pavements in d = 2) Consider a two-dimensional Anosov map (Ω, S) and assume that it admits a fixed point x0 . Let Sε be
101 a small perturbation of S (in class C ∞ ) depending on a parameter ε. Show that the map Sε admits a Markov pavement Pε = {P0ε , . . . , Pnε } with the same compatibility matrix T as that of P0 . (Hint: Construct a Markov pavement P = {P0 , . . . , Pn } for (Ω, S) by the method of Section 1. Note that Sε will have a fixed point xε which merges differentially with x0 as ε → 0 together with any finite portion of its stable and unstable manifolds. Note that the construction of P is based on two finite connected portions of the stable and of the unstable manifolds of x0 .)
Bibliographical note The methods in this section are essentially due to F. Bonetto and P. Falco, see [GBG03] Sect. 10.1; they provide analyticity in ε. They can be extended to cover the case of chains of weakly coupled maps, see [BFG03] and [GBG03]. 3. Perturbative construction of SRB distribution. We have seen that the conjugation H that transforms a perturbed cat map Sε of the torus T 2 into a “free” Arnold’s map S0 is not differentiable (in general) and we could only prove that it can be taken to be H¨ older continuous with a prefixed exponent β < 1 for a perturbation strength that is suitably small. In spite of the lack of regularity we can still use the homeomorphism ϕ = H(ψ ) to construct the dynamics as well as the stable and unstable manifolds of each point. If ϕ = H(ψ ) the latter manifolds are given by parametric equations of the form
ϕ(t) = H (ψ + tv α )
t ∈ R, α = ±,
(3.1)
where t → ψ + t v α is the unstable or stable manifold for the unperturbed map S0 through ψ if α = + or α = −. However the above parameterization is not very useful because the function H(ψ + tvα ) is not regular as a function of t. This can be seen already from the fact that the first order term in its expansion in powers of ε cannot be (in general) differentiated with respect to (1) t at t = 0. Indeed we see from (2.7) that the component h− (ψ ) can be differentiated in the direction v + because term by term differentiation enhances convergence since p < 0; (1) on the other hand the component h+ (ψ ) cannot be differentiated in the direction v + −(p+1)
(unless special cancellations occur) because the convergence factor λ+ in (2.7) is compensated by the λp+ that the differentiation along v + brings out since p ≥ 0. To (2) second order in ε not even the t–derivative of the component h− (ψ + v + t) can be shown to exist.
To construct the stable an unstable manifolds as well as the other necessary ingredients to define the SRB distribution we apply once more the technique discussed in the previous . the (non compact) space T 2 × R2 we define the dynamical system two sections. Calling Ω S.0 (ϕ, v ) = (S0 ϕ, S0 v ).
(3.2)
This is a system that fails to be an Anosov system because the phase space is not compact. We can nevertheless consider its perturbation S.ε (ϕ, v ) = (S0 ϕ + εf (ϕ), S0 v + ε(v · ∂ϕ )f (ϕ)), - -
(3.3)
and we can attempt at finding an isomorphism between S.ε and S.0 or, since this turns out to be in general impossible (as it will be implicit in what follows), between S.ε and S.0,ε defined by S.0,ε (ϕ, v ) = (S0 ϕ, (S0 + Γε (ϕ))v ),
(3.4).
102 with Γε (ϕ) a matrix diagonal on the basis v ± (on which S0 is diagonal too). Therefore . =H . ◦ S.0,ε , i.e. . of a simple form and such that S.ε ◦ H we look for a map H
. : (ψ, w) ← → (ϕ, v ) = (ψ + h(ψ ), w + K(ψ)w), H
(3.5)
as we already know how to conjugate Sε with S0 , from the analysis of Section 2. The equation that the matrix K(ψ ) has to verify is (S0 K(ψ ) − K(S0 ψ )S0 )ij = −ε∂ϕj fi (ψ + h(ψ ))−
− ε∂ϕs fi (ψ + h(ψ ))K(ψ )sj + Γε (ψ)ij + (K(S0 ψ )Γε (ψ ))ij ,
(3.6)
where ∂ϕ denotes a derivative of f with respect to its original argument and repeated indices mean implicit summation (to abridge notations). We write the above matrix equation on the basis in which S0 and Γε are diagonal, i.e. on the basis formed by the two eigenvectors v ± of S0 in which the matrices K, Γ have been assumed to take the form 0 γ+ (ψ ) 0 k+ (ψ ) Γ(ψ ) = , K(ψ ) = . (3.7) 0 γ− (ψ ) k− (ψ ) 0 If α = ± and β = −α (3.6) becomes, by setting ∂α = v α · ∂ϕ ,
0 = −ε∂α fα (ϕ) − εKβα (ψ )∂β fα (ϕ) + γα (ψ ), (λα Kαβ (ψ ) − λβ Kαβ (S0 ψ )) =
(3.8)
= −ε∂β fα (ϕ) − εKαβ (ψ)∂α fα (ϕ) + Kαβ (S0 ψ )γβ (ψ ), where ϕ means ψ + h(ψ), λ+ = λ−1 , λ− = −λ are the eigenvalues of S0 (with λ = √ ( 5 − 1)/2), and γα (ψ) = v α · Γ(ψ)v α . The above equations for K, Γ can be solved uniquely by the same technique employed in Secton 2: we skip the details. The K, Γ matrices turn out as in Section 2 to be H¨ older continuous in ψ and analytic in ε at ε small and given by an explicitly constructed power series in ε. Once the K matrix has been constructed we have access to the vectors tangent to the stable and unstable manifolds. One just notes that if ϕ = H(ψ ) then the unstable direction at ϕ will be w+ (ψ) = v + + K(ψ )v + . Furthermore a Markov pavement for Sε will be the image of a Markov pavement for S0 under the map ψ → H(ψ ); therefore ψ evolved with S0 and ϕ evolved with Sε will have the same symbolic history σ on such pavements. Hence Xε (σ ) = ϕ and X0 (σ ) = ψ if ϕ = ψ + h(ψ ). The expansion rate along the unstable manifold will be λu (σ ) = eΛu (σ) with |w+ (S0 ψ )| (3.9) Λu (τ σ ) = − log λ+ + γ+ (ψ ) |w+ (ψ)| where |w+ (ψ )| = 1 + k+ (ψ)2 .2 2
. v) = The chain of identities stemming from (3.5), (3.7) and leading to (3.9) is (ϕ, w(ϕ)) = H(ψ, (H(ψ), (1 + K(ψ ))v ) and .ε (ϕ, wu ) = S .ε H(ψ . , v+ ) = H(S . 0 ψ , (λ+ + γ+ (ψ )v + )) = (Sε ϕ, (1 + K(S0 ψ ))(λ+ + γ+ (ψ))v + ) S which says that the vector (1 + K(ψ ))v + is mapped by the differential of Sε to (λ+ + γ+ (ψ))(1 + K(S0 ψ ))v + , whence (3.9).
103 The functions γ+ , k+ are analytic in ε and H¨ older continuous in ψ with a uniformly bounded modulus C(β) if β < 1 and ε is small enough and since σ fixed means ψ fixed (because σ is the history of a point ψ on a Markov pavement for the ε–independent map older continuous in σ as well as in S0 ) we see that Λu (σ ) is analytic in ε at fixed σ and H¨ ψ and therefore in ϕ. Hence the function Λu (σ ) can be written as in (1.10) in terms of a exponentially decaying potential. Therefore we have completed the construction of the potential for the symbolic dynamics whose Gibbs state is the SRB distribution. Since one dimensional short range lattice systems with nearest neighbor hard core are well understood we can proceed to use their theory to compute properties of the SRB distribution in powers of the perturbation parameter ε. For instance the SRB distribution µε will be a Gibbs state for the energy function Λu (σ ) and, therefore, it will mix at an exponential rate any pair of H¨ older continuous function. Note that if G is a H¨older continuous function then G ◦ H −1 has a representation on the Markov pavement Pε that is independent of ε. Moreover Gibbs states with exponentially decaying potential (in the sense of (1.12)) have the property that the expectation values of observables depend analytically on the parameters on which the potential itself depends analytically. This can be summarized in the following corollary.
(Mixing for SRB distributions) Let F and G be two H¨ older continuous “observables” (i.e. functions on T 2 ). Then if µε denotes the SRB distribution for Sε the following properties hold. older continuous in ε. (i) The expectation values µε (F ) and µε (G) are defined and H¨ Moreover the expectation values µε (F ◦ H −1 ) and µε (G ◦ H −1 ) are analytic function in ε for |ε| ≤ ε0 , with ε0 independent of F or G. (ii) If F is an analytic observable then the expectation value µε (F ) is analytic in ε for ε ≤ εF , with εF dependent on F . (iii) The functions F, G mix at an exponential rate in the sense that the difference between the l.h.s. and the r.h.s. of
−−−−→ µε (F )µε (G) µε (dϕ)F (S n ϕ)G(ϕ) −n→±∞
µε ((Sεn F )G) ≡
(3.10)
tends to 0 bounded by a constant (depending of F, G) times e−κF,G n , for a suitable constant κF,G > 0. (iv) The volume distribution µ0 (dϕ) = dϕ/(2π)2 “mixes with the SRB distribution” exponentially fast in the sense that given the functions F, G the difference between the l.h.s. and the r.h.s. of µ0 ((Sεn F )G) ≡
−−−−→ µε (F )µ0 (G) µ0 (dϕ)F (S n ϕ)G(ϕ) −n→+∞
(3.11)
tends to 0 bounded by a constant (depending of F, G) times e−κF,G n . The latter limit has, in general, a different value if n → −∞ and one has to replace the SRB distribution µε with the one for Sε−1 (which essentially has the same properties as µε ). We can therefore appreciate the power of the perturbation expansion method which allows us to obtain rather detailed and precise informations about the Markov partition (which of course can be defined as the H–image of the trivial partition for Arnold’s cat map S0 ); and, what is more important, it provides us with an analytic description of the SRB distribution (in the considered small perturbation problem).
104 In particular it is possible and interesting to compute the derivatives of µε (F ) at ε = 0. One easily finds the following special case of a general resul ∞ µ0 (∂ (F ◦ S0k ) · f ◦ S0−1 ); ∂ε µε (F )ε=0 = −
(3.12)
k=0
This formula was proved, in a much more general setting, by Ruelle, see [Ru97], and is very interesting for applications because it closely resembles the standard Green-Kubo formula, [GR97]. Bibliographical note The methods in this section are also essentially due to F. Bonetto and P. Falco, see [GBG03] Sect. 10.3; they provide analyticity in ε. They can be extended to cover the case of chains of weakly coupled maps, see [BFG03] and [GBG03]; the extension can be remarkably based on classical techniques of Statistical Mechanics (Mayer expansion or cluster expansion): see [GBG03]. Problem. (1) Show that the map in (1.3) does not admit an invariant probability distribution with density with respect to the volume µ0 , for ε small enough and not 0. (Hint: first show that the phase space contractin has negative average with repect to the SRB ditribution, for ε > 0 small using (3.12). This i,plies that the SRB distribution is singular with respect to ν0 . Then let µe be a distribution invariant and with density:
µε (F ) ≡ µε (Sεn F ) ≡
µ0 (dxc)ρε (x)F (S n x) −n→∞ −−−→ µ0 (ρe )µε (F ) ≡ µε (F )
so that µε ≡ µε .)
References [AW68] Adler, R., Weiss, B.: Similarity of automorphism of the tours, Memoirs of the American Mathematical Society, no. 98, 1970. [BFG03] Bonetto, F., Falco, P.L., Giuliani, A.: , Analyticity and large deviations for the SRB measure of a lattice of coupled hyperbolic systems, to appear in Journal of Mathematical Physics, 2004. [Bo70] Bowen, R.: Markov partitions for Axiom A diffeormorphisms, American Journal of Mathematics 92 (1970), 725-747. [Ch99] Chandre, C.: PhD thesis, Physics Dept., Universit´e de Bourgogne, 1999. [CM01] Chandre, C., MacKay, R.S.D.: Approximate renormalization with codimension-one fixed point for the break-up of some three-frequency tori, Physics Letters A 275 (2000), no. 5-6, 394–400. [GBG03] Gallavotti, G., Bonetto, F., Gentile, G.: Aspects of the ergodic, qualitative and statistical theory of motion, p. 1–415, Springer–Verlag., 2004. [Ru73) Ruelle, D.: A measure associated with axiom A attractors, Americqn Journal of Mathematics, 98 (1976), 619–654. [Ru97] Ruelle, D.: Differentiation of SRB states, Communications in Mathematical Physics, , 187 (1997), 227–241. [Si68a] Sinai, Ya.G.: Markov partitions and C-Diffeormorphisms, Functional Analysis and Applications 2 (1968), 64–69.
105 [Si68b] Sinai, Ya.G.: Costruction of Markov partitions, Functional analysis and Applications 2 (1968), no. 2, 70–80.
This page intentionally left blank
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY Pierre Gaspard Center for Nonlinear Phenomena and Complex Systems, Faculte´ des Sciences, Universit´e Libre de Bruxelles, Campus Plaine, Code Postal 231, B-1050 Brussels, Belgium
Abstract
1.
Recent work on the connections between dynamical systems theory and nonequilibrium statistical mechanics is reviewed with emphasis on results which are compatible with Liouville’s theorem. Starting from a general discussion of time-reversal symmetry in the Newtonian scheme, it is shown that the Liouvillian eigenstates associated with the PollicottRuelle resonances spontaneously break the time-reversal symmetry. We explain that such a feature is compatible with the time reversibility of Newton’s equations because of a selection of trajectories which are not time-reversal symmetric. The Pollicott-Ruelle resonances and their associated eigenstates can be constructed not only for decay processes but also for transport processes such as diffusion or viscosity, as well as for reaction-diffusion processes. The Pollicott-Ruelle resonances thus describe the relaxation toward the thermodynamic equilibrium. The entropy production of these relaxation processes can be calculated and shown to take the value expected from nonequilibrium thermodynamics. In nonequilibrium steady states, an identity is obtained which shows that the entropy production directly characterizes the breaking of timereversal symmetry by nonequilibrium boundary conditions. The extension to quantum systems is also discussed.
Introduction
The methods of dynamical systems theory are ubiquitous in nonequilibrium statistical mechanics since the pioneering work by Sinai and coworkers on the ergodic theory of hard-ball systems [1, 2, 3, 4]. The defocusing character of elastic collisions shows that typical many-particle systems have a spectrum of positive Lyapunov exponents and a positive Kolmogorov-Sinai entropy per unit time [5, 6, 7, 8]. This chaotic behavior can be expected from the typical master equations ruling the stochastic processes of nonequilibrium statistical mechanics such as the
107 P. Collet et al. (eds.), Chaotic Dynamics and Transport in Classical and Quantum Systems, 107–157. © 2005 Kluwer Academic Publishers. Printed in the Netherlands.
108 Boltzmann-Lorentz, the Fokker-Planck, or the Pauli equations, which all develop a positive (and even infinite) Kolmogorov-Sinai entropy per unit time [9, 10]. Moreover, a vanishing Kolmogorov-Sinai entropy would be in contradiction with experimental observation [11]. The connection between dynamical systems theory and nonequilibrium statistical mechanics has been strengthened by the discovery of relationships between the decay or escape rates of a system and the characteristic quantities of its dynamical instability, randomness or fractality [12, 13, 14, 15]. These characteristic quantities are large-deviation properties of the temporal dynamics. These new relationships are connecting the large-deviation properties of the temporal evolution of the probabilities or phase-space volumes to the irreversible properties such as the transport coefficients or the entropy production. All these new relationships from the escape-rate formula [12, 13, 14, 15] to the fluctuation theorem [16, 17, 18, 19, 20, 21, 22, 23] share this very same structure, as will be explained later. Besides, Pollicott and Ruelle have introduced a concept of resonance for Axiom A systems, showing that hyperbolic systems can present exponential decays which are intrinsic to their dynamics and independent of the circumstances of extraneous observation [24, 25, 26, 27]. The concept of Pollicott-Ruelle resonance leads to a spontaneous breaking of the time-reversal symmetry in the statistical description of the time evolution, which provides an explanation of irreversibility in agreement with the microreversibility. This explanation has recently been documented in great detail for deterministic diffusive systems with the verification that the decaying modes associated with the Pollicott-Ruelle resonances have the entropy production expected from the irreversible thermodynamics of diffusive processes [28, 29, 30, 31, 32]. One of the basic difficulties has here been to respect Liouville’s theorem that phase-space volumes are preserved by the microscopic Hamiltonian dynamics. It should here be emphasized that Liouville’s theorem is playing a central role in Boltzmann’s considerations. The violation of Liouville’s theorem by some hypothetical phase-space contraction leads to the catastrophic situation where the differential entropy – which should naturally be associated with the stationary probability distribution of the system itself according to Boltzmann’s statistical interpretation – is equal to minus infinity instead of remaining bounded. The purpose of the present paper is to show that it is possible to develop a theory of irreversibility for an underlying microscopic dynamics which is time-reversal symmetric and moreover preserves the phase-space volumes in conformity with Liouville’s theorem. This allows us to construct, in particular, nonequilibrium steady states with a well-defined
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
109
entropy. The general idea of the theory is to consider special solutions of Liouville’s equation, which are decaying in time. These solutions turn out to be concentrated on the unstable manifolds which are distinct from the stable manifolds. This leads to a natural breaking of the time-reversal symmetry in the statistical description. The plan of the paper is the following. Elementary considerations on the time-reversal symmetry and its breaking are developed in Sec. 2. The general theory is presented in Sec. 3. The theory is applied to simple decay processes in Sec. 4. The escape-rate formalism which gives access to the transport coefficients is presented in Sec. 5. The hydrodynamic modes of diffusion are constructed for infinite spatially extended systems in Sec. 6. The entropy production is obtained in Sec. 7. The case of nonequilibrium steady states is treated in Sec. 8. The possible extension to quantum systems is discussed in Sec. 9. Conclusions are drawn in Sec. 10.
2.
Time-reversal symmetry and its breaking
The phenomenon of spontaneous symmetry breaking is well known. Typically, the solutions of an equation have a lower symmetry than the equation itself. This is in particular the case for the time-reversal symmetry of Newton’s equations. The purpose of the present section is to develop this remark, which sheds some light on the apparent dichotomy between the everyday experience of an irreversible world ruled by timereversible laws. If we consider a system of particles of masses ma interacting with electromagnetic or gravitational forces, it is well known that Newton’s equations d2ra = Fa (r1 , r2 , ..., rN ) (a = 1, 2, ..., N ) (1) dt2 ruling the motion of the particles is time-reversal symmetric. Time redra a versal consists in reversing the velocities dr dt or momenta pa = ma dt of the particles while keeping invariant their positions ra : ma
Θ (r1 , r2 , ..., rN , p1 , p2 , ..., pN , t) = (r1 , r2 , ..., rN , −p1 , −p2 , ..., −pN , −t) (2) Time reversal is an involution: Θ2 = 1. We denote by Φt the flow of trajectories induced by Newton’s equations (1) in the phase space of positions and momenta Γ = (r1 , r2 , ..., rN , p1 , p2 , ..., pN ) ∈ M
(3)
The phase space M is made of all the possible physically distinct states of the system. The flow Φt exists and is unique according to Cauchy’s
110 theorem, which is the property of determinism. The time-reversal symmetry of Newton’s equations is expressed by Θ ◦ Φt ◦ Θ = Φ−t
(4)
which means that if the phase-space curve C = {Γt = Φt (Γ0 ) : t ∈ R}
(5)
is a solution of Newton’s equations, then the time-reversed curve ˜ t = Φt ◦ Θ(Γ0 ) : t ∈ R} Θ(C) = {Γ
(6)
starting from the time-reversed initial conditions Θ(Γ0 ) is also a solution of Newton’s equations. The further question is to know if the solution C of Newton’s equations is or is not identical to its time-reversal image Θ(C). If we have a timereversal symmetric solution: C = Θ(C)
(7)
the solution has inherited of the time-reversal symmetry of the equation. However, the solution does not have the time-reversal symmetry of the equation if we have a time-reversal non-symmetric solution: C = Θ(C)
(8)
in which case we can speak of the breaking of the time-reversal symmetry by the solution C. For the one-dimensional harmonic oscillator of Hamiltonian H=
p2 1 + mω2r2 2m 2
(9)
or the particle falling with a uniform acceleration H=
p2 + mgr 2m
(10)
all the trajectories are time-reversal symmetric: C = Θ(C), ∀ C. In contrast, this is no longer the case for the free particle in uniform motion p2 (11) H= 2m because the solution rt = (p0 /m)t + r0 is distinct from the time-reversed solution rt = −(p0 /m)t + r0 (unless the momentum vanishes: p0 = 0).
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
111
Indeed, the momentum of these solutions points in different spatial directions so that different successions of events happen along these trajectories. For the inverted harmonic potential H=
1 p2 − mλ2r2 2m 2
or, more generally, for the potential barriers r2ν p2 + V0 exp − 2ν − V0 H= 2m 2a
(12)
(ν = 1, 2, ...)
(13)
the trajectories CE with a negative energy E are identical to their timereversal image: CE = Θ(CE ) for E < 0. But those with a positive or vanishing energy are not: CE = Θ(CE ) for E ≥ 0. In particular, the trajectories with a vanishing energy are the stable Ws and unstable Wu manifolds of the equilibrium point r = p = 0 and they are distinct. The time-reversal symmetry maps these manifolds onto each other Wu = Θ(Ws )
(14)
and, here, we have that Wu = Ws . In conclusion, the solutions of Newton’s equations typically break the time-reversal symmetry notwithstanding the fact that the equation itself possesses the symmetry. This phenomenon is known as spontaneous symmetry breaking and it manifests itself in different contexts. We owe to Newton – and his contemporaries who cast his laws of motion into differential equations – the separation between the law and its realizations into specific solutions. This is a major historical step with respect to pre-Newtonian science. Newton’s ordinary differential equations leave open the determination of the initial conditions which thus remain arbitrary and out of the law in the Newtonian scheme. The few preceding examples suggest that, in typical systems, many initial conditions lead to solutions which are not time-reversal symmetric, i.e., such that C = Θ(C). The separation between time-reversible laws and its irreversible realizations thus appears at the origin of problems with the arrows of time, which were absent in pre-Newtonian science. The preceding discussion shows that an irreversible world – which is given by a specific trajectory of Newton’s equations – is not incompatible with a time-reversible equation of motion. The phenomenon of spontaneous symmetry breaking should have familiarized us with such an apparent dichotomy. Similar considerations apply to Liouville’s equation ruling the time evolution of statistical ensembles of trajectories in classical statistical
112 mechanics. Liouville’s equation is time-reversal symmetric if the underlying Hamiltonian system is. Similar considerations also apply to Schr¨ odinger’s equation of quantum mechanics, as well as to von Neumann-Landau equation of quantum statistical mechanics. The breaking of the time-reversal symmetry is the feature of transport processes such as diffusion or viscosity. Diffusion is ruled by the irreversible equation ∂t n = D ∇2n (15) for the density n(r, t) of tracer particles which can be so dilute that they do not interact with each other while they diffuse in the surrounding fluid. The previous discussion suggests that the diffusion equation (15) describes the time evolution of ensembles of trajectories which are not time-reversal symmetric. The anti-diffusion equation ∂t n = −D ∇2n
(16)
describes the time evolution of the time-reversed trajectories. The purpose of the following sections is to show how the previous considerations can be developed into a quantitative theory of irreversibility which is not incompatible with the time-reversal symmetry of Newton’s equations.
3.
General theory
A probability density is associated with a statistical ensemble {Γ(i) }∞ i=1 of phase-space points as N 1 δ Γ − Γ(i) N →∞ N
p(Γ) = lim
(17)
i=1
If these points are the initial conditions of trajectories, the probability density evolves in time according to N 1 (i) δ Γ − Φt Γ0 N →∞ N
pt (Γ) = lim
(18)
i=1
The time evolution of this probability density is ruled by Liouville’s equation ˆ ∂t p = {H, p} ≡ Lp (19) given in terms of the Poisson bracket with the Hamiltonian of the system according to Liouville’s theorem, which defines the Liouvillian operator
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
113
ˆ The time integral of Liouville’s equation is the Frobenius-Perron L. operator ˆ p0 (Γ) = p0 (Φ−t Γ) pt (Γ) = Pˆ t p0 (Γ) = exp(Lt)
(20)
The probability density allows us to calculate the mean values of the observables which are functions of the phase-space variables: (21) !A"t = A(Γ) pt (Γ) dΓ as well as the time correlation functions !A(0)B(t)" or !A(0)A(t)". If the evolution operator is defined on a Hilbert space of phase-space functions, we can define a unitary group of time evolution ˆ t p0 = exp(−iGt) ˆ p0 pt = U
(22)
with the Hermitian generator given in terms of the Liouvillian operator by ˆ = iL ˆ G (23) The resolvent of the Hermitian operator is defined by ∞ 1 ˆ ˆ R(z) = eizt e−iGt dt = −i ˆ z−G 0
(24)
The unitary operator can be recovered by integration in the complex variable z along the contour C+ + C− as ˆt = 1 ˆ U dz (25) e−izt R(z) 2πi C+ +C− (see Fig. 1). The retarded or advanced evolution operator can be obtained by integrating along the contour C± as 1 t ˆ ˆ θ(±t)U = dz (26) e−izt R(z) 2πi C± By deforming the contour of integration C+ to the lower half-plane of the complex variable z, we can pick up the contributions from several complex singularities of the analytic continuation of the resolvent. These complex singularities can be poles, branch cuts, or else. The poles are called the Pollicott-Ruelle resonances [24, 25, 26, 27]. The sum of the contributions from the resonances, the branch cuts, etc... gives us an expansion which is valid for positive times t > 0 and which defines the forward semigroup: ˆ ˜ α |p0 " + · · · !A"t = !A| exp(Lt)|p !A|Ψα " exp(sα t) !Ψ (27) 0" α
114
Re s
anti-resonances
backward semigroup
C+
0
C−
resonances
forward semigroup
0 Im s = ω Figure 1. Complex plane of the variable s = −iz. The vertical axis Re s = Im z is the axis of the rates or complex frequencies. The horizontal axis Im s = −Re z is the axis of real frequencies ω. The contour C+ is slightly above the real-frequency axis and is deformed in the lower half-plane to get the contributions of the resonances for the forward semigroup. The contour C− is slightly below the real-frequency axis and is deformed in the upper half-plane to get the contributions of the anti-resonances for the backward semigroup. The resonances is mapped onto the anti-resonances by time reversal. Complex singularities such as branch cuts are also possible but not depicted here.
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
115
where the dots denote the contributions beside the simple exponentials due to the resonances (see Fig. 1). In such an expansion, the dependence on the observables appears via the right-eigenvectors of the Liouvillian operator ˆ α " = sα |Ψα " L|Ψ (28) and the dependence on the initial probability density via the lefteigenvectors ˆ = sα !Ψ ˜ α| ˜ α |L !Ψ
(29)
On the other hand, the analytic continuation to the upper half-plane of the complex variable z gives an expansion valid for negative times t < 0, which defines the backward semigroup: ˆ ˜ α ◦ Θ|p0 " + · · · !A"t = !A| exp(Lt)|p !A|Ψα ◦ Θ" exp(−sα t) !Ψ 0" α
(30) The time-reversal symmetry implies that a singularity located in the upper half-plane at −zα = −isα corresponds to each complex singularity in the lower half-plane of the variable zα = isα . The analytic continuation has the effect of breaking the time-reversal symmetry and shows that the semigroups are necessarily restricted to one of the two semi-axes of time. Several important mathematical questions should be answered in order to obtain such expansions: What is the spectrum of complex singularities of the resolvent? ˜ α, What is the nature of the right- and left-eigenvectors, Ψα and Ψ in each term of the expansion? For which class of observables A is defined the right-eigenvector Ψα ? For which class of initial ˜ α? probability density p0 is defined the left-eigenvector Ψ Once each term is well defined, does the whole series converge for some classes of observables A and initial probability densities p0 ? Important results have been obtained for Axiom A systems which is a class of dynamical systems having the properties that: (1) Their non-wandering set Ω is hyperbolic; (2) Their periodic orbits are dense in Ω. For these systems, Pollicott and Ruelle have proved that the spectrum close to the real axis contains resonances (poles) which are independent of the observable and initial probability density within whole classes of smooth enough functions [24, 25, 26, 27]. The resonances are responsible for exponential decays exp(sα t) at rates −sα which are thus intrinsic
116 to the dynamics. If the resonances are degenerate of multiplicity mα , Jordan-block structures may appear which introduce polynomial corrections to the exponential decays, leading to tmα −1 exp(sα t) [10]. In specific systems such as the multibaker maps and the simple examples given in the next section, the whole resonance spectrum as well as the complete expansions of the semigroups have been constructed for very smooth observables and probability density [10, 33, 34]. If the observable and the probability density have a certain degree of regularity, the expansion can be limited to the contributions of the first few resonances plus a rest which decays faster than the decay rate of the last used resonance. This rest becomes negligible after a long enough time. For non-hyperbolic systems such as intermittent maps or bifurcating equilibrium points, branch cuts appear which are associated with powerlaw decays [35, 36, 37, 38]. An important remark is that the eigenvectors (28) and (29) are not given by functions but by mathematical distributions of the Schwartz type. Therefore, their density does not exist as a function and their cumulative function is required for their representation. In bounded systems which are mixing, there exists a unique eigenvalue at s0 = 0. The non-trivial Pollicott-Ruelle resonances of the forward semigroup are then located away from the real-frequency axis with Re sα < 0. However, there exist most interesting situations in which the leading Pollicott-Ruelle resonance has a non-vanishing real part Re s0 < 0. This happens for open systems with escape as shown in Secs. 4 and 5, as well as for spatially periodic systems as shown in Sec. 6. In open systems with escape, the leading Pollicott-Ruelle resonance defines the escape rate γ = −s0 (31) The associated eigenvector Pˆ t Ψ0 = es0 t Ψ0
(32)
is given by the conditionally invariant measure of density Ψ0 = lim e−s0 t Pˆ t Υ t→∞
(33)
where Υ is an arbitrary function. The density Ψ0 is typically singular so that we define the cumulative function ξ Ψ0 (Γξ )dξ (34) F0 (ξ) = 0
where the integral is carried out over a curve {Γξ } in the phase space.
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
117
In hyperbolic systems, the escape rate can be expressed in terms of the Lyapunov exponents and the Kolmogorov-Sinai entropy per unit time which is defined with respect to the natural invariant measure having the non-wandering set for support [10, 39, 40]: γ= λi − hKS (35) λi >0
If we introduce the partial information dimensions 0 ≤ di ≤ 1 associated with the Lyapunov exponents according to the fundamental work by Young and others [39, 41, 42], the escape rate can be rewritten as γ=
(1 − di )λi
(36)
λi >0
These remarkable formulas generalize Pesin’s identity [43]. The escape implies that some partial dimensions are smaller than unity, which shows that the non-wandering set is fractal in some unstable directions as well as in the corresponding stable directions by time-reversal symmetry. In contrast, the conditionally invariant measure associated with the escape rate γ and defined by the density (33) is absolutely continuous with respect to the Lebesgue measure along the unstable directions but fractal in the stable directions.
4.
Decay processes
In this section, we consider simple systems with escape of particles from a phase-space region where the non-wandering set is located. The number of particles remaining in this region is decaying so that the process is transient.
4.1
Inverted harmonic potential
The first example is the Hamiltonian (12) with an inverted harmonic potential. The equilibrium point at r = p = 0 constitutes the nonwandering set of this system. The equilibrium point is hyperbolic so that we here have a simple example of Axiom A systems. Its Lyapunov exponents are given by (+λ, −λ). The invariant measure is a Dirac delta distribution located at the phase-space point r = p = 0. Its KolmogorovSinai entropy is equal to zero so that the system is nonchaotic as expected. According to Eqs. (31) and (35), the leading Pollicott-Ruelle resonance should here be given in terms of the positive Lyapunov exponent: s0 = −γ = −λ (37)
118 It is straightforward to verify this result and even obtain the full spectrum of the Pollicott-Ruelle resonances together with their associated eigenvectors, as shown here below. After the canonical transformation 1 q = √2mλ (x − y) , (38) (x + y) p = mλ 2 the Hamiltonian (12) becomes H=λxy
(39)
In the new coordinates, the unstable manifold is the axis of the xcoordinate and the stable manifold is the axis of the y-coordinate. The solutions of Hamilton’s equations x˙ = + ∂H ∂y = +λ x (40) y˙ = − ∂H = −λ y ∂x Φt (x, y) = e+λt x, e−λt y
define the flow
(41)
In the long-time limit t → +∞, exp(−λt) is a small parameter in terms of which we can carried out a Taylor expansion of the statistical averages according to [10]
−λt dx dy A e/+λt 01 x2, e y p0 (x, y) =x dx dy A x , e−λt y p0 e−λt x , y = e−λt
!A"t =
=
(43)
∞ ∞ 1 −λlt l l 1 −λmt m m e y ∂y A(x , 0) e x ∂x p0 (0,y ) m! l! m=0 l=0 (44) ∞ 1 −λ(l+m+1)t 1 l m m l e dx x ∂y A(x , 0) dy y ∂x p0 (0, y) (45) m! l!
= e−λt
=
(42)
l,m=0 ∞
dx dy
˜ lm |p0 " e−λ(l+m+1)t !A|Ψlm " !Ψ
(46)
l,m=0
We can therefore identify the right- and left-eigenstates as
Ψlm (x, y) = ˜ lm (x, y) = Ψ
1 l x (−∂y )m δ(y) m! 1 m y (−∂x )l δ(x) l!
(47) (48)
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
119
The eigenstates are given by the derivatives of the Dirac distribution. The right-eigenstates Ψlm have the unstable manifold y = 0 for support, ˜ lm have the stable manifold x = 0 for support. while the left-eigenstates Ψ We can check that these distributions are respectively the eigensolutions of the Liouvillian operator and of its adjoint: ˆ Ψlm = −λ (l + m + 1) Ψlm L ˜ lm ˆΨ ˜ lm = −λ (l + m + 1) Ψ L
(49) (50)
Accordingly, the Pollicott-Ruelle resonances of the inverted harmonic potential are simply given by the integer multiples of the Lyapunov exponent λ: slm = −λ (l + m + 1) (51) with l, m = 0, 1, 2, 3, ... The right- and left-eigenstates are given by Schwartz distributions defined on smooth enough test functions A and p0 . In order for !A|Ψlm " to be defined, the observable A(x, y) must be m-times differentiable transversally to the unstable manifold y = 0 and integrable with xl ˜ lm |p0 " is defined along the unstable manifold. On the other hand, !Ψ if the probability density p0 (x, y) is l-times differentiable transversally to the stable manifold x = 0 and integrable with y m along the stable manifold. The full series (46) converges if A(x, y) is an entire analytic function of exponential type in y and an infinitely differentiable function of compact support in x, while p0 (x, y) is an entire analytic function of exponential type in x and an infinitely differentiable function of compact support in y. The exponential decay at the escape rate γ = λ proceeds continuously for the conditionally invariant measure given by the leading righteigenstate Ψ00 (x, y) = δ(y): Pˆ t Ψ00 = e−γt Ψ00
(52)
This conditionally invariant measure corresponds to a statistical ensemble of trajectories which are uniformly distributed on the unstable manifold y = 0 and nowhere else. This is an example of selection of trajectories (or initial conditions). The irreversible process of decay is the feature of trajectories located on the unstable manifold y = 0 which is distinct from the time-reversed manifold x = 0. The trajectories have been selected by the time evolution. Indeed, if we start from an ensemble of initial conditions located in the vicinity of the equilibrium point x = y = 0, this cloud of points tends to concentrate along the unstable manifold during the time evolution. In the long-time limit, we obtain
120 with Eq. (33) the leading eigenstate Ψ00 (x, y) = δ(y) which has the unstable manifold for support. This support has a zero Lebesgue measure because the decay process is transient. In this way, we end up in the long-time limit with a time-reversal non-symmetric trajectory associated with the irreversible decay process.
4.2
Generic potential barrier
A generic potential barrier is defined as a barrier with a quadratic maximum. An example of such potential is given by the Hamiltonian (13) with ν = 1. This Hamiltonian system has a unique equilibrium point of saddle type at r = p = 0 and is a further example of Axiom A system. Here, the Lyapunov exponent is given by 3 V0 λ= (53) ma2 The Kolmogorov-Sinai entropy is here again vanishing, hKS = 0, so that this system is nonchaotic. The motion in the vicinity of the saddle equilibrium point r = p = 0 is described by the aforementioned inverted harmonic potential (12). At large distances, the particle is no longer accelerated and moves in free motion contrary to the situation in the inverted harmonic potential, but this difference does not affect the spectrum of Pollicott-Ruelle resonances which is the same in both systems. The spectrum of Pollicott-Ruelle resonances of the generic potential barrier is thus given by slm = −λ (l + m + 1)
(54)
with l, m = 0, 1, 2, 3, .... Accordingly, this system presents a dynamical instability without chaos. Indeed, the particle remains at the top of the hill if it has no momentum, so that r = p = 0 is a stationary solution. However, perturbed trajectories escape to infinity. Figure 2b depicts different trajectories issued from several initial conditions which are very close to the point r = p = 0. Figure 2c represents the fraction of trajectories which are still in the interval −a ≤ r ≤ +a at the current time t. This fraction defines the survival probability. We observe that this survival probability decays exponentially at long times. The rate of decay defines the escape rate γ of the hill. Since the trajectories which escape at very long times are issued from very near the point r = p = 0, we can understand that the long-time decay is controlled by the dynamical instability near r = p = 0 and, thus, that the escape rate is equal to the Lyapunov exponent, γ = λ. In Fig. 2d, the phase portrait is drawn in the plane
121
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
(c)
(a) V(r)
P(t)
1
0.1
r
1
2
3
t
4
4
0
Ws
(d)
Wu
()
0
1
p
t
2
3
()
Wu
Ws
()
()
0
(b)
r
r
Figure 2. Particle moving down a hill under the Hamiltonian (13): (a) the potential V (r) versus position r; (b) positions r of different trajectories issued from initial conditions very close to the unstable equilibrium point versus time t; (c) a typical survival probability P (t) versus time t; (d) the phase portrait in the (r, p)-plane with (±) (±) the stable Ws and unstable Wu manifolds of r = p = 0. (±)
(±)
Γ = (r, p). The stable and unstable manifolds Ws,u = {Γs,u (t), t ∈ R} are connected to the stationary solution at Γ = 0. The signs denote both branches of these manifolds. For t → +∞, the probability density tends to concentrate along the unstable manifold. We can check that the distribution 4 5 +∞ Ψ00 (Γ) = exp(γτ ) δ Γ − Γ() (τ ) dτ (55) u =± −∞
is an exact eigenstate of the Frobenius-Perron operator Pˆ t Ψ00 (Γ) = Ψ00 (Φ−t Γ) = exp(−γt) Ψ00 (Γ)
(56)
corresponding to the leading Pollicott-Ruelle resonance s0 = −γ = −λ. () () The result (56) is a consequence of Φt Γu (τ ) = Γu (τ + t) and of the Liouville theorem [44]. The distribution (55) is the density of the conditionally invariant measure associated with the escape rate. We here have a further example of selection of initial conditions. The irreversible character of the escape is the feature of trajectories located on the unstable
122 manifold. The fact that the unstable manifold is distinct from its time reversal – which is the stable manifold – expresses the irreversibility of the escape process and allows for the unidirectional decay (56) in time. Although the time-reversed process is ideally possible because Hamilton’s equations are time-reversal symmetric there are at least two reasons that prevent the realization of such a time-reversed process. A first reason is that dynamical instability can spoil the preparation of a timereversed state initially prepared in a realistic way. In order to prepare such a state, particles must be placed on their initial conditions. Since the phase space is a continuum, this operation is affected by errors. For the time-reversed state, the initial conditions must be aligned precisely on the stable manifold. But any error transverse to the stable manifold gives to the initial condition a small component in the unstable direction that will be amplified over a time of the order of the inverse of the Lyapunov exponent multiplied by the logarithm of the inverse of the error. Therefore, the cloud of trajectories will be concentrated along the unstable manifold after a time longer than this Lyapunov time and the forward semigroup will anyway control the long-time evolution. This problem of sensitivity to initial conditions does not manifest itself if the eigenstate is prepared on the unstable manifold because the errors are exponentially damped in this case. The second reason is that the eigenstate (55) belongs to the spectral decomposition of the forward semigroup which is only defined for positive times t > 0. On the other hand, the timereversed eigenstate belongs to the backward semigroup which is defined for negative times t > 0. It turns out that the backward semigroup may not be prolongated to positive time because, for typical initial probability densities and observables, the asymptotic series only converges for t < 0 and diverges for t ≥ 0. The origin of time is therefore an unbreakable horizon for the use of the backward semigroup. This horizon is stronger than the horizon due to the positive Lyapunov exponent of a trajectory. Indeed, the Lyapunov horizon can be postponed by taking smaller errors on the initial conditions. In contrast, the horizon of an expansion such as Eq. (46) cannot be postponed.
4.3
Nongeneric potential barriers
The Hamiltonians (13) with ν = 2, 3, 4, ... give examples of nonhyperbolic systems which do not satisfy Axiom A. The system is both nonhyperbolic and nonchaotic. The equilibrium point r = p = 0 is still unstable but the instability is no longer exponential. The decay is here given by a power law. If we prepare a statistical ensemble of trajectories in the vicinity of the top of the hill and we measure the time Tesc taken
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
123
by these trajectories to escape from the hill, we find that the probability that the escape happens beyond the current time t decays according to the power law 1 Prob{Tesc > t} ∼ 1 (57) t ν−1 The decay is no longer exponential so that the resonances of the previous examples are here replaced by a branch cut {Re s + i Im s : Re s ≤ 0, Im s = 0} in the plane of the complex variable s of the Liouvillian ˆ −1 for the forward semigroup. By time-reversal symresolvent (s − L) metry, the spectrum of the backward semigroup has a branch cut in the upper half-plane. Stable and unstable manifolds are still associated with the equilibrium point r = p = 0 and the decay process forward in time will here also be controlled by trajectories concentrated on the unstable manifold and thus distinct from the time-reversed trajectory. Therefore, there is here also a spontaneous symmetry breaking of the time-reversal symmetry but due to an instability which is weaker than exponential. This shows the great generality of the present theory since it may also apply to nonhyperbolic and nonchaotic systems. The difference with respect to hyperbolic systems is that the spectrum of complex singularities controlling the semigroups may be dominated by branch cuts instead of resonances in nonhyperbolic systems. Branch cuts appear in other examples of nonhyperbolic systems such as bifurcating vector fields and intermittent maps [35, 36, 37, 38]. Only a precise analysis of the spectrum can determine the long-time behavior of the statistical ensembles of trajectories. We should notice that, generically, the potential barrier has a quadratic maximum so that exponential decay controlled by Pollicott-Ruelle resonances is the generic behavior in the family of Hamiltonian systems (13). The robustness of hyperbolicity is an important property which has been pointed out in many circumstances.
4.4
The disk scatterers
The disk scatterers form a family of open dynamical systems with escape which includes chaotic systems. The disk scatterers or disk billiards are Hamiltonian-type systems in which a free particle undergoes elastic collisions on a finite number of immobile hard disks. Energy as well as the phase-space volumes are conserved. Since elastic collisions on circular disks are defocusing these systems are hyperbolic with a positive Lyapunov exponent. Axiom A is satisfied if the disks are sufficiently far apart and do not hide each other. The non-wandering set is composed of
124 0
(a)
-1
1
...12121212...
Re s
2
(b))
-2 -3 -4
0
5
Im s
10
15
Figure 3. Two-disk scatterer: (a) configuration of the system; (b) spectrum of Pollicott-Ruelle resonances.
the trajectories bouncing forever between the disks. The non-wandering set is of zero Lebesgue measure so that almost all the trajectories escape in free motion to infinity. A first example is the two-disk scatterer. Here, the non–wandering set is composed of the unique periodic orbit bouncing between the two disks along the line joined their centers. This periodic orbit is unstable with stable and unstable manifold. The situation is similar to the case of the generic potential barrier: the escape rate is equal to the Lyapunov exponent, γ = λ, and the Kolmogorov-Sinai entropy is vanishing, hKS = 0. The system is hyperbolic but nonchaotic. The spectrum of PollicottRuelle resonance is however more complicated because of the periodic bouncing motion of frequency ω between both disks: slm = −λ(l + 1) + i m ω
(58)
with l = 0, 1, 2, 3, ... and m = 0, ±1, ±2, ±3, ... The resonances form a half periodic array extending toward negative values of Re s and separated from Re s = 0 by a gap given by the escape rate γ = λ (see Fig. 3). An example of chaotic system is given by the three-disk scatterer. The scatterer is made of three disks at the vertices of an equilateral triangle. After each collision on a disk, the particle has the choice to go to one or the other of the two other disks. This generates an exponential proliferation of possible orbits so that the non-wandering set here contains an uncountable fractal set of trajectories. If the disks are sufficiently far apart, these trajectories can be put in correspondence with a symbolic dynamics. The properties of the three-disk scatterer can be analyzed in
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
125
Figure 4. Three-disk scatterer: (a) configuration of the system; (b) spectrum of Pollicott-Ruelle resonances. A1 , A2 , and E denote the irreducible representations of the group C3v of symmetry of the scatterer with the three disks forming an equilateral triangle. Each resonance belongs to one of these irreducible representations. The A1 and A2 -resonances are simply degenerate and the E-resonances are doubly degenerate.
great detail [10, 45, 46, 47]. The Kolmogorov-Sinai entropy is here positive so that the escape rate is no longer entirely given by the Lyapunov exponent but by the escape-rate formula (35): γ = λ − hKS
(59)
The spectrum of Pollicott-Ruelle resonances can be obtained with great precision by periodic-orbit theory (see Fig. 4) [47]. The resonances which are the closest to the real-frequency axis control the decay of statistical ensembles of trajectories escaping the scatterer. Indeed, the survival probability presents an exponential decay modulated by irregular oscillations. The gross exponential decay is controlled by the escape rate while oscillations appear which are the feature of the other PollicottRuelle resonances. This important observation has been obtained in the three- and four-disk scatterers [47].
5.
Escape-rate formalism
The idea of the escape-rate formalism is to consider first-exit problems in deterministic systems sustaining transport processes such as diffusion or viscosity [12, 13, 14, 15, 48]. First-exit or first-passage problems are
126 very well known in stochastic theory and reaction-rate theory [49]. Firstexit problems have been considered since Kramers’ pioneering work [50]. In Kramers’ problem, the escape of particles over a barrier is a way to obtain the reaction rate. This problem has many applications in a variety of physical, chemical, and astronomical systems [51]. The aforementioned disk scatterers are simple models of unimolecular reactions [45], but the escape here occurs for a deterministic dynamics. That the transport coefficients can also be obtained by setting up a first-exit problem does not seem to have been largely noticed. The advantage of this method is to work with a finite system on which boundary conditions are imposed. Boundary conditions as well as initial conditions can be changed at will although the equations of motion may not.
5.1
Viscosity and other transport coefficients
In order to set up a first-exit problem for a given transport property, absorbing boundary conditions should be imposed in the space of variation of the so-called Helfand moment [52], which is the time integral of the corresponding microscopic current [14, 48]. For viscosity, the Helfand moment is given by G= √
N 1 xa pya V kB T a=1
(60)
where T is the temperature, V the volume of the system, and kB Boltzmann’s constant. This Helfand moment gives the center along the x-axis of the y-component of the momenta of the particles. The shear viscosity coefficient is known to be given by the Einstein type of formula η = lim
t→∞
1 !(Gt − G0 )2" 2t
(61)
There exists a Helfand moment associated with each transport coefficient [52]. Einstein’s formula (61) shows that the Helfand moment has a diffusive motion. The corresponding diffusivity coefficient is simply given by the viscosity coefficient according to Eq. (61). We can set up a first-exit problem by considering the escape of trajectories out of the interval − χ2 < G < + χ2 in the space of variation of the Helfand moment. The escape rate is directly proportional to the viscosity coefficient and inversely propertional to the square of the distance between the absorbing boundaries at ± χ2 : π 2 (62) γη χ
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
127
We may now consider the same problem for the underlying deterministic dynamics in the phase space of this N -particle system [12, 13, 14, 15]. In the phase space R6N , the absorbing boundaries are imposed on the hypersurfaces N χ 1 (63) xa pya = ± G= √ 2 V kB T a=1
We can consider the set of trajectories forever trapped between these hypersurfaces. We should here point out that, in the three-dimensional physical space, the particles are in a box of finite volume V and they bounce on the walls of the box so that trajectories exist for which the Helfand moment can remain in a compact phase-space region such as the region between the hypersurfaces (63). If the dynamics is hyperbolic, the trajectories which never escape this region are unstable and form a subset of vanishing probability in the phase space. Almost all trajectories escape from this region with an escape rate γ which can be estimated by Eq. (62). On the other hand, the escape rate is given by dynamical systems theory as the difference between the sum of positive Lyapunov exponents and the Kolmogorov-Sinai entropy according to Eq. (35) or in terms of the partial information dimensions by Eq. (36). Combining with the result (62), we obtain a relationship between the transport coefficient and the characteristic quantities of chaos: χ η = lim 2 lim (1 − di )λi (64) χ→∞ V,N =nV →∞ π λi >0
V,χ
This formula has recently been used to calculate the viscosity coefficients in a hard-disk model of fluid [48]. An important remark is that irreversible properties such as the transport coefficients already appear in systems with few particles if the dynamics is spatially extended by periodic boundary conditions. This is well known for diffusion in the Lorentz gases but it also true for the other transport coefficients. This is natural because the transport coefficients are routinely computed by molecular dynamics with periodic boundary conditions. It is important to increase the number of particles in the computation in the regimes where the collective effects become essential at high densities n, but the transport properties can already be obtained from the collision between two or three particles at low densities [53]. The escape-rate formalism has the advantage of displaying the irreversibility in the leading Pollicott-Ruelle resonance. In closed systems,
128 the leading Pollicott-Ruelle resonance is vanishing and the interesting behavior is hidden in the next-to-leading resonance. By imposing absorbing boundary conditions, the irreversible behavior is promoted to the leading resonance. For the first-exit problem of viscosity of escape rate (62), the spectrum of Pollicott-Ruelle resonances can be expected to be given by πj sj −η 2 (65) χ with j = 1, 2, 3, ..., if the system is hyperbolic. The associated righteigenstates and, in particular, the conditionally invariant measure associated with the leading Pollicott-Ruelle resonance s1 = −γ, is smooth in the unstable directions but fractal in the stable ones [13]. This measure decays according to Eq. (32) for t → +∞. The time-reversed measure belongs to the backward semigroup and is clearly distinct from the conditionally invariant measure of the forward semigroup. We here have another manifestation of the spontaneous breaking of the time-reversal symmetry: this one explicitly for transport properties.
5.2
Diffusion and mobility
The escape-rate formalism can be applied to a broad variety of situations. For diffusion in a two-degree-of-freedom system such as the Lorentz gas, the Helfand moment is just given by the position of the tracer particle Gt = xt and Einstein’s formula (61) gives the diffusion coefficient D. Alternatively, the diffusion coefficient can be given by Eq. (64) where the partial information dimension can be replaced by the partial Hausdorff dimension 0 ≤ dH ≤ 1 in the unique unstable direction of Lyapunov exponent λ [12] L D = lim (66) 2 [λ(1 − dH )]L L→∞ π which has been applied to the hard-disk Lorentz gas [13]. We can also consider the mobility µ in a conservative Lorentz gas with an external electric field F [54, 10]. On large spatial scales, this process is described by the biased diffusion equation ∂t n = ∇ · (D∇n − µFn)
(67)
where µ is the mobility coefficient. If two absorbing boundaries are placed at a distance L from each other and transverse to the electric field F, the escape rate is given by π µ2F 2 γD 2+ (68) L 4D
DYNAMICAL SYSTEMS THEORY OF IRREVERSIBILITY
129
By combining with the escape-rate formula (35), the diffusion coefficient can be obtained in the limit L λi − hKS (69) 2 D = lim lim L→∞ F →0 π λi >0
L,F
and, thereafter, the mobility coefficient in the limit 4D µ2 = lim lim λi − hKS F →0 L→∞ F 2 λi >0
(70) L,F
Other problems can be envisaged with similar considerations.
5.3
Reaction-diffusion
Reaction-diffusion processes have also been considered in which a point particle undergoes elastic collisions in a hard-disk Lorentz gas with sinks [55, 56]. The sinks are circular holes replacing some disks in the Lorentz gas. If we denote by X a moving point particle and by ∅ its annihilation, the reaction scheme is given by X + disk X + sink
X + disk → ∅ + sink
(71) (72)
Accordingly, the number of point particles in the Lorentz gas decreases with time because of their annihilation at the sinks. This decrease is characterized by the survival probability of a point particle. The time evolution of this survival probability depends on the geometry of the Lorentz gas. For a Lorentz gas with a periodic lattice of disks and a periodic superlattice of sinks, the same cell containing one sink and several disks repeats itself in a superlattice over the whole system. In this case, the decay is exponential and an escape rate γ can be defined: periodic geometry:
P (t) ∼ exp(−γt)
(73)
If the sinks are sufficiently far apart and form a triangular s