WWW.DISSERTATION.XLIBX.INFO FREE ELECTRONIC LIBRARY - Dissertations, online materials

<< HOME
CONTACTS

Pages:   || 2 |

# «Zentrum Mathematik, Technische Universit¨t M¨nchen, a u John-von-Neumann Lecture, 2013 Sergiy Kolyada Topological Dynamics: Minimality, Entropy and ...»

-- [ Page 1 ] --

Topological Dynamics:

Minimality, Entropy and Chaos.

Institute of Mathematics, NAS of Ukraine, Kyiv

Zentrum Mathematik, Technische Universit¨t M¨nchen,

a u

John-von-Neumann Lecture, 2013

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers

7. On Lyapunov Numbers

Throughout this lecture (X, f ) denotes a topological dynamical system,

where X is a compact metric space with metric d and f : X → X is a continuous map.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers

7. On Lyapunov Numbers Throughout this lecture (X, f ) denotes a topological dynamical system, where X is a compact metric space with metric d and f : X → X is a continuous map.

Recall that a dynamical system (X, f ) is called sensitive if there exists a positive ε such that for every x ∈ X and every neighborhood Ux of x, there exist y ∈ Ux and a nonnegative integer n with d(f n (x), f n (y )) ε.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers Recently several authors studied the diﬀerent properties related to sensitivity. The following proposition holds.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers Recently several authors studied the diﬀerent properties related to sensitivity. The following proposition holds.

Proposition 1.1 Let (X, f ) be a topological dynamical system. The following conditions are equivalent.

1. (X, f ) is sensitive.

2. There exists a positive ε such that for every x ∈ X and every neighborhood Ux of x, there exists y ∈ Ux with lim supn→∞ d(f n (x), f n (y )) ε.

3. There exists a positive ε such that in any opene U in X there are x, y ∈ U and a nonnegative integer n with d(f n (x), f n (y )) ε.

4. There exists a positive ε such that in any opene U ⊂ X there are x, y ∈ U with lim supn→∞ d(f n (x), f n (y )) ε.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers For a dynamical system (X, f ) a point x ∈ X is Lyapunov stable if the dependence of the orbit upon the initial position is continuous at x. This

is most easily deﬁned using the f −extension of the metric d:

df (x, y ) = sup {d(f n (x), f n (y )) : n ≥ 0} for x, y ∈ X. Clearly, df is a metric on X and df (x, y ) = max[ d(x, y ), df (f (x), f (y )) ].

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

–  –  –

Using these metrics we deﬁne the diameter and f-diameter for A ⊂ X, the radius and f-radius for a neighborhood Ux of a point x ∈ X diam(A) = sup {d(x, y ) : x, y ∈ A}, diamf (A) = sup {df (x, y ) : x, y ∈ A}, radius(Ux ) = sup {d(x, y ) : y ∈ Ux }, radiusf (Ux ) = sup {df (x, y ) : y ∈ Ux }.

–  –  –

The topology obtained from the metric df is usually strictly coarser than the original d topology. When we use a term like “open”, we refer exclusively to the original topology.

–  –  –

The topology obtained from the metric df is usually strictly coarser than the original d topology. When we use a term like “open”, we refer exclusively to the original topology.

A point x ∈ X is called Lyapunov stable if for every ε 0 there exists a δ 0 such that radius(Ux ) δ implies radiusf (Ux ) ≤ ε. This condition says exactly that the sequence of iterates {f n : n ≥ 0} is equicontinuous at x. Hence, such a point is also called an equicontinuity point.

–  –  –

As the label suggests, Eq(f ) is the set of equicontinuity points. If Eq(f ) = X, i.e. every point is equicontinuous, then the two metrics d and df are topologically equivalent and so, by compactness, they are uniformly equivalent. Such a system is called equicontinuous. Thus, (X, f ) is equicontinuous exactly when the sequence {f n : n ≥ 0} is uniformly equicontinuous.

–  –  –

If the Gδ set Eq(f ) is dense in X then the system is called almost equicontinuous. On the other hand, if Eqε (f ) = ∅ for some ε 0 then it is the same that the system shows sensitive dependence upon initial conditions or, more simply, (X, f ) is sensitive.

–  –  –

If the Gδ set Eq(f ) is dense in X then the system is called almost equicontinuous. On the other hand, if Eqε (f ) = ∅ for some ε 0 then it is the same that the system shows sensitive dependence upon initial conditions or, more simply, (X, f ) is sensitive.

We deﬁne Lr := sup{ε : for every x ∈ X and every neighborhood Ux of x there exist y ∈ Ux and a nonnegative integer n with d(f n (x), f n (y )) ε} and call it the (ﬁrst) Lyapunov number.

–  –  –

If the Gδ set Eq(f ) is dense in X then the system is called almost equicontinuous. On the other hand, if Eqε (f ) = ∅ for some ε 0 then it is the same that the system shows sensitive dependence upon initial conditions or, more simply, (X, f ) is sensitive.

We deﬁne Lr := sup{ε : for every x ∈ X and every neighborhood Ux of x there exist y ∈ Ux and a nonnegative integer n with d(f n (x), f n (y )) ε} and call it the (ﬁrst) Lyapunov number.

It can happen that Eqε (f ) = ∅ for all positive ε and yet still the intersection, Eq(f ), is empty.

–  –  –

This cannot happen when the system is transitive.

Theorem 1.1 Let (X, f ) be a topologically transitive dynamical system.

Exactly one of the following two cases holds.

Case i (Eq(f ) = ∅) Assume there exists an equicontinuity point for the system. The equicontinuity points are exactly the transitive points, i.e. Eq(f ) = Trans(f ), and the system is almost equicontinuous. The map f is a homeomorphism and the inverse system (X, f −1 ) is almost equicontinuous. Furthermore, the system is uniformly rigid meaning that some subsequence of {f n : n = 0, 1,...} converges uniformly to the identity.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers This cannot happen when the system is transitive.

Theorem 1.1 Let (X, f ) be a topologically transitive dynamical system.

Exactly one of the following two cases holds.

Case i (Eq(f ) = ∅) Assume there exists an equicontinuity point for the system. The equicontinuity points are exactly the transitive points, i.e. Eq(f ) = Trans(f ), and the system is almost equicontinuous. The map f is a homeomorphism and the inverse system (X, f −1 ) is almost equicontinuous. Furthermore, the system is uniformly rigid meaning that some subsequence of {f n : n = 0, 1,...} converges uniformly to the identity.

Case ii (Eq(f ) = ∅) Assume the system has no equicontinuity points. The system is sensitive, i.e. there exists ε 0 such that Eqε (f ) = ∅.

–  –  –

So, various deﬁnitions of sensitivity, formally give us diﬀerent Lyapunov numbers – quantitative measures of these sensitivities.

Directly from the deﬁnitions, the following inequalities hold

–  –  –

So, various deﬁnitions of sensitivity, formally give us diﬀerent Lyapunov numbers – quantitative measures of these sensitivities.

Directly from the deﬁnitions, the following inequalities hold

–  –  –

Beweis.

Let Ld be the second Lyapunov number of (X, f ). Fix a (small enough) δ 0, a point x ∈ X and a neighborhood Ux of x.Let U0 = Ux and n0 be the ﬁrst positive integer, for which diam(f n0 (U0 )) Ld − δ. There exists a point y0 ∈ U0 such that d(f n0 (x), f n0 (y0 )) (Ld − δ)/2.

–  –  –

Beweis.

Let Ld be the second Lyapunov number of (X, f ). Fix a (small enough) δ 0, a point x ∈ X and a neighborhood Ux of x.Let U0 = Ux and n0 be the ﬁrst positive integer, for which diam(f n0 (U0 )) Ld − δ. There exists a point y0 ∈ U0 such that d(f n0 (x), f n0 (y0 )) (Ld − δ)/2.Choose an opene U1 with its closure contained in U0 such that y0 ∈ U1 and diam(f m (U1 )) ≤ δ/2 for every non-negative integer m ≤ n0. Let n1 be the ﬁrst positive integer, for which diam(f n1 (U1 )) Ld − δ.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers Beweis.

Let Ld be the second Lyapunov number of (X, f ). Fix a (small enough) δ 0, a point x ∈ X and a neighborhood Ux of x.Let U0 = Ux and n0 be the ﬁrst positive integer, for which diam(f n0 (U0 )) Ld − δ. There exists a point y0 ∈ U0 such that d(f n0 (x), f n0 (y0 )) (Ld − δ)/2.Choose an opene U1 with its closure contained in U0 such that y0 ∈ U1 and diam(f m (U1 )) ≤ δ/2 for every non-negative integer m ≤ n0. Let n1 be the ﬁrst positive integer, for which diam(f n1 (U1 )) Ld − δ. By the deﬁnition of U1, we clearly have n1 n0.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers Beweis.

Let Ld be the second Lyapunov number of (X, f ). Fix a (small enough) δ 0, a point x ∈ X and a neighborhood Ux of x.Let U0 = Ux and n0 be the ﬁrst positive integer, for which diam(f n0 (U0 )) Ld − δ. There exists a point y0 ∈ U0 such that d(f n0 (x), f n0 (y0 )) (Ld − δ)/2.Choose an opene U1 with its closure contained in U0 such that y0 ∈ U1 and diam(f m (U1 )) ≤ δ/2 for every non-negative integer m ≤ n0. Let n1 be the ﬁrst positive integer, for which diam(f n1 (U1 )) Ld − δ. By the deﬁnition of U1, we clearly have n1 n0.

We deﬁne recursively opene sets U2, U3,... and positive integers n2, n3,...

as follows.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers Beweis.

Let Ld be the second Lyapunov number of (X, f ). Fix a (small enough) δ 0, a point x ∈ X and a neighborhood Ux of x.Let U0 = Ux and n0 be the ﬁrst positive integer, for which diam(f n0 (U0 )) Ld − δ. There exists a point y0 ∈ U0 such that d(f n0 (x), f n0 (y0 )) (Ld − δ)/2.Choose an opene U1 with its closure contained in U0 such that y0 ∈ U1 and diam(f m (U1 )) ≤ δ/2 for every non-negative integer m ≤ n0. Let n1 be the ﬁrst positive integer, for which diam(f n1 (U1 )) Ld − δ. By the deﬁnition of U1, we clearly have n1 n0.

We deﬁne recursively opene sets U2, U3,... and positive integers n2, n3,...

as follows. Since nk−1 is deﬁned, there exists a point yk−1 ∈ Uk−1 such that d(f nk−1 (x), f nk−1 (yk−1 )) (Ld − δ)/2.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers Beweis.

Let Ld be the second Lyapunov number of (X, f ). Fix a (small enough) δ 0, a point x ∈ X and a neighborhood Ux of x.Let U0 = Ux and n0 be the ﬁrst positive integer, for which diam(f n0 (U0 )) Ld − δ. There exists a point y0 ∈ U0 such that d(f n0 (x), f n0 (y0 )) (Ld − δ)/2.Choose an opene U1 with its closure contained in U0 such that y0 ∈ U1 and diam(f m (U1 )) ≤ δ/2 for every non-negative integer m ≤ n0. Let n1 be the ﬁrst positive integer, for which diam(f n1 (U1 )) Ld − δ. By the deﬁnition of U1, we clearly have n1 n0.

We deﬁne recursively opene sets U2, U3,... and positive integers n2, n3,...

as follows. Since nk−1 is deﬁned, there exists a point yk−1 ∈ Uk−1 such that d(f nk−1 (x), f nk−1 (yk−1 )) (Ld − δ)/2. So we can choose an opene Uk in Uk−1 such that yk−1 ∈ Uk and diam(f m (Unk )) ≤ δ/2 for every non-negative integer m ≤ n0. Let nk be the ﬁrst positive integer, for which diam(f nk (Uk )) Ld − δ.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers Beweis.

Let Ld be the second Lyapunov number of (X, f ). Fix a (small enough) δ 0, a point x ∈ X and a neighborhood Ux of x.Let U0 = Ux and n0 be the ﬁrst positive integer, for which diam(f n0 (U0 )) Ld − δ. There exists a point y0 ∈ U0 such that d(f n0 (x), f n0 (y0 )) (Ld − δ)/2.Choose an opene U1 with its closure contained in U0 such that y0 ∈ U1 and diam(f m (U1 )) ≤ δ/2 for every non-negative integer m ≤ n0. Let n1 be the ﬁrst positive integer, for which diam(f n1 (U1 )) Ld − δ. By the deﬁnition of U1, we clearly have n1 n0.

We deﬁne recursively opene sets U2, U3,... and positive integers n2, n3,...

as follows. Since nk−1 is deﬁned, there exists a point yk−1 ∈ Uk−1 such that d(f nk−1 (x), f nk−1 (yk−1 )) (Ld − δ)/2. So we can choose an opene Uk in Uk−1 such that yk−1 ∈ Uk and diam(f m (Unk )) ≤ δ/2 for every non-negative integer m ≤ n0. Let nk be the ﬁrst positive integer, for which diam(f nk (Uk )) Ld − δ.As in the previous step, by the deﬁnition of Uk we clearly have nk nk−1.

Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos.

7. On Lyapunov Numbers Beweis.

Let Ld be the second Lyapunov number of (X, f ). Fix a (small enough) δ 0, a point x ∈ X and a neighborhood Ux of x.Let U0 = Ux and n0 be the ﬁrst positive integer, for which diam(f n0 (U0 )) Ld − δ. There exists a point y0 ∈ U0 such that d(f n0 (x), f n0 (y0 )) (Ld − δ)/2.Choose an opene U1 with its closure contained in U0 such that y0 ∈ U1 and diam(f m (U1 )) ≤ δ/2 for every non-negative integer m ≤ n0. Let n1 be the ﬁrst positive integer, for which diam(f n1 (U1 )) Ld − δ. By the deﬁnition of U1, we clearly have n1 n0.

We deﬁne recursively opene sets U2, U3,... and positive integers n2, n3,...

as follows. Since nk−1 is deﬁned, there exists a point yk−1 ∈ Uk−1 such that d(f nk−1 (x), f nk−1 (yk−1 )) (Ld − δ)/2. So we can choose an opene Uk in Uk−1 such that yk−1 ∈ Uk and diam(f m (Unk )) ≤ δ/2 for every non-negative integer m ≤ n0. Let nk be the ﬁrst positive integer, for which diam(f nk (Uk )) Ld − δ.As in the previous step, by the deﬁnition of Uk we clearly have nk nk−1.

Pages:   || 2 |

Similar works:

«Behaviour 152 (2015) 335–357 brill.com/beh Non-reciprocal but peaceful fruit sharing in wild bonobos in Wamba Shinya Yamamoto a,b,∗ a Graduate School of Intercultural Studies, Kobe University, 1-2-1 Tsurukabuto, Nada-ku, 657-8501 Kobe, Japan b Wildlife Research Center, Kyoto University, Yoshida-honmachi, Sakyo-ku, 606-8501 Kyoto, Japan * Author’s e-mail address: shinyayamamoto1981@gmail.com Accepted 30 December 2014; published online 29 January 2015 Abstract Food sharing is considered to...»

«Otty Lake Association Annual General Meeting (AGM) Minutes Saturday, July 9th, 2016, 9:30 – 11:30 am The Perth Legion Welcome – Reid welcomed everyone to the AGM at 9:30 am. He thanked the displayers. He also thanked Cathy Buffam and Tiger Tanner for all their work as the AGM’s technical team for many years. He thanked Gail Read and her daughter Lana, Krista Hearty McLean and Chuck Shenkman for taking over as our technical team this year. In addition to celebrating the 200th anniversary...»

«Proposal for a Scintillator Tile Hodoscope for PANDA Version 1.1 K. Goetzen, H. Orth, G. Schepers, L. Schmitt, C. Schwarz, A. Wilms Abstract In this document a new detector in place of the barrel time-of-ﬂight detector is proposed. This detector is based on small scintillator tiles read out by silicon photomultipliers. The motivation in terms of physics and technical beneﬁts are summarized. Details of the detector layout are given. 1 CONTENTS 2 Contents 1 Introduction 3 2 Physics Motivation...»

«QUASI-ISOMETRIES AND RIGIDITY OF SOLVABLE GROUPS ALEX ESKIN, DAVID FISHER AND KEVIN WHYTE Abstract. In this note, we announce the ﬁrst results on quasi-isometric rigidity of non-nilpotent polycyclic groups. In particular, we prove that any group quasiisometric to the three dimenionsional solvable Lie group Sol is virtually a lattice in Sol. We prove analogous results for groups quasi-isometric to R Rn where the semidirect product is deﬁned by a diagonalizable matrix of determinant one with...»

«Snus – The Swedish Experience The purpose of this paper is to present the views of Swedish Match on the WHO Framework Convention on Tobacco Control, and especially in relation to the Swedish snus. This paper summarises the scientific data available regarding snus, as we, to the best of our knowledge, understand them. Swedish Match is a Sweden based international group and one of the world's leading companies in the area of niche tobacco products, collectively known as Other Tobacco Products...»

«CHAPTER 1 NANO-CMOS SCALING PROBLEMS AND IMPLICATIONS 1.1 DESIGN METHODOLOGY IN THE NANO-CMOS ERA As process technology scales beyond 100-nm feature sizes, for functional and high-yielding silicon the traditional design approach needs to be modiﬁed to cope with the increased process variation, interconnect processing difﬁculties, and other newly exacerbated physical effects. The scaling of gate oxide (Figure 1.1) in the nano-CMOS regime results in a signiﬁcant increase in gate direct...»

«Contract reference no.: ALA/95/21-B7-3010/37 Beneﬁciaries: LALITPUR SUB-METROPOLITAN CITY and KHOKANA VILLAGE DEVELOPMENT COMMITTEE Contractor: City of Chester Periodic Report 15 January 2002 – 14 January 2004 Urban Management and Economic Diversiﬁcation Project Contents Abbreviations 1. Technical section (a) Project Particulars (b) Summary (c) Working conditions (d) Reporting Tables Table 4 Activity 1 Institutional development Activity 2 Orientation/training Seminar at Chester Activity 3...»

«Wildlife'Photography'in'Botswana! With Thom Hogan and Tony Medici August 6 to 18, 2016 (plus optional extensions to August 21/22) Wilderness Travel • 1102 Ninth Street • Berkeley, CA 94710 • 800-368-2794 Photography in Botswana Our destinations on this mostly tent-based photography workshop and safari are all wildlife-related. We’re here to learn about and photograph the African animals, with lions and elephants being the most abundant things everyone wants photos of, but also...»

«Web Site: www.parallax.com Office: (916) 624-8333 Forums: forums.parallax.com Fax: (916) 624-8003 Sales: sales@parallax.com Sales: (888) 512-1024 Technical: support@parallax.com Tech Support: (888) 997-8267 Hackable Electronic Badge Guest (blue, #20000); Staff (white, #20100); Speaker (black, #20200) Energize your events by using the Badges to store and distribute schedules, identify participants, share contact info, and play interactive games. In educational environments, Badges encourage...»

«ECNDT 2006 Tu.2.1.1 In-Service Inspection Concept for GLARE® – An Example for the Use of New UT Array Inspection Systems Wolfgang BISLE, Theodor MEIER, Sascha MUELLER, Sylvia RUECKERT Airbus, Bremen Abstract. UT phased arrays and array transducers for FIT (Field Inspection Technology) open new chances for NDT of complex structure materials in aeronautics. GLARE® is such a new material which will widely be used on the new Airbus A380. Even as GLARE® in the A380 needs no scheduled NDT...»

«O-MINIMALITY AS AN APPROACH TO THE ANDRÉ-OORT CONJECTURE by Thomas Scanlon Abstract. — Employing a proof technique suggested by Zannier and ﬁrst successfully implemented by Pila and Zannier to give a reproof of the Manin-Mumford conjecture on algebraic relations on torsion points of an abelian variety, Pila presented an unconditional proof of the André-Oort conjecture when the ambient Shimura variety is a product of modular curves. In subsequent works, these results have been extended to...»

«Topological Dynamics: Minimality, Entropy and Chaos. Sergiy Kolyada Institute of Mathematics, NAS of Ukraine, Kyiv Zentrum Mathematik, Technische Universit¨t M¨nchen, a u John-von-Neumann Lecture, 2013 Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos. Minimal maps 2. Minimal Maps Introduction Sergiy Kolyada Topological Dynamics: Minimality, Entropy and Chaos. Minimal maps 2. Minimal Maps Introduction Throughout this part of the lecture (X, f ) denotes a topological...»

<<  HOME   |    CONTACTS
2016 www.dissertation.xlibx.info - Dissertations, online materials

Materials of this site are available for review, all rights belong to their respective owners.
If you do not agree with the fact that your material is placed on this site, please, email us, we will within 1-2 business days delete him.