Measure Theory Introduction to Fractal Geometry and Chaos

Total Page:16

File Type:pdf, Size:1020Kb

Measure Theory Introduction to Fractal Geometry and Chaos Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli MAT1845HS Winter 2020, University of Toronto M 1-2 and T 10-12 BA6180 Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Measure Spaces rigorous theory of \volumes" (and of probabilities) • measure space( X ; Σ; µ) σ-algebra Σ on a set X Σ collection of subsets of X such that ; and X belong to Σ complements: Ac = X r A is in Σ whenever A is in Σ S1 countable unions: k=1 Ak is in Σ if Ak 2 Σ for all k 2 N measure µ :Σ ! R+ [ f1g µ(;) = 0 monotonicity: µ(A1) ≤ µ(A2) if A1 ⊆ A2 1 P1 disjoint additivity: µ(tk=1Ak ) = k=1 µ(Ak ) additive on disjoint unions • probability distribution: a measure space where µ(X ) = 1 A 2 Σ events µ(A) their probabilities Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Examples X 1 Σ = 2 all subsets of X and µ = δx (Dirac delta measure supported at a chosen point x 2 X ) with 1 x 2 A δ (A) = x 0 x 2= A X 2 Σ = 2 and counting (cardinality) measure #AA finite µ(A) = 1 A infinite 3 If X finite, counting measure can be normalized to a probability (uniform probability) #A µ(A) = #X Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Support of a measure measure space (X ; Σ; µ) assume Borel measure: (X ; T ) topological space and open sets U 2 T of the topology are all measurable sets U 2 Σ support of µ supp(µ) = fx 2 X j µ(U) > 0 8U 2 T with x 2 Ug an open set U 2 T has µ(U) > 0 iff U \ supp(µ) 6= ; and µ(U) = 0 otherwise Dirac delta measure δx has supp(δx ) = fxg Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Continuity of measures • limits of sets 1 1 1 1 lim inf An = [k=1 \j=k Aj lim sup An = \k=1 [j=k Aj n!1 n!1 same for increasing or decreasing sequence • (X ; Σ; µ) measure space increasing sequence A1 ⊂ A2 ⊂ · · · An ⊂ · · · µ( lim An) = lim µ(An) n!1 n!1 decreasing sequence A1 ⊃ A2 ⊃ · · · An ⊃ · · · µ( lim An) = lim µ(An) n!1 n!1 arbitrary sequences µ(lim inf An) ≤ lim inf µ(An) n!1 n!1 Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli increasing sequence: limit is union, use 1 1 [n=1An = A1 tk=2 (Ak r Ak−1) and additivity of measure 1 X µ([k Ak ) = µ(A1) + µ(Ak r Ak−1) k=2 1 = lim µ(A1 tk=2 (Ak r Ak−1)) = lim µ(Ak ) k k decreasing sequence: limit is intersection, use Bk = A1 r Ak increasing sequence µ(\k Ak ) = µ(A1) − µ([j Bj ) = µ(A1) − lim µ(Bj ) = lim µ(Aj ) j j 1 arbitrary sequence: use Bk = \j=k Aj increasing sequence 1 µ(lim inf An) = µ([k=1Bk ) = lim µ(Bk ) ≤ lim inf µ(Ak ) n!1 k k Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Almost everywhere properties • (X ; Σ; µ) measure space, a property of X holds almost everywhere if it fails to hold on a set of µ-measure zero • Examples: X with δx Dirac measure: two functions f1; f2 : X ! R agree almost everywhere iff f1(x) = f2(x) at the point x where δx is supported (sets of measure zero = those not containing x) X with counting measure: two functions f1; f2 : X ! R agree almost everywhere iff f1(x) = f2(x) at all points x 2 X (no non-empty sets of measure zero) • Note: in the case of probability spaces probability zero does not mean impossibility • How to construct more interesting measures than the Dirac and counting examples? Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Outer measures and measures ∗ X • µ : 2 ! R+ [ f1g defined on all subsets with µ∗(;) = 0 µ(A1) ≤ µ(A2) if A1 ⊆ A2 countable subadditivity: 1 1 ∗ [ X µ ( Ak ) ≤ µ(Ak ) k=1 k=1 even when disjoint union require only ≤ not additivity • use an outer measure µ∗ to construct a σ-algebra Σ and a measure space (X ; Σ; µ) σ-algebra determined by µ∗ ∗ ∗ ∗ Σ := fE ⊆ X : µ (A) = µ (A\E)+µ (A\(X rE)); 8A ⊆ X g ∗ µ = µ jΣ is a measure (the definition of Σ forces additivity on disjoint unions) Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli • σ-algebra property of ∗ ∗ ∗ Σ := fE ⊆ X : µ (A) = µ (A \ E) + µ (A \ (X r E)); 8A ⊆ X g ; and X are in Σ condition defining Σ is symmetric in E and X r E so if a set is in Σ its complement also is given a sequence of sets Ek in Σ ∗ ∗ ∗ µ (A) = µ (A \ E1) + µ (A r E1) = ∗ ∗ ∗ µ (A \ E1) + µ ((A r E1) \ E2) + µ ((A r E1) r E2) = k X ∗ j−1 ∗ k µ ((A r [i=1Ei ) \ Ej ) + µ (A r [j=1Ej ) j=1 k X ∗ j−1 ∗ 1 ≥ µ ((A r [i=1Ei ) \ Ej ) + µ (A r [j=1Ej ) j=1 Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli estimate for all k so in the limit 1 ∗ X ∗ j−1 ∗ 1 µ (A) ≥ µ ((A r [i=1Ei ) \ Ej ) + µ (A r [j=1Ej ) j=1 1 1 j−1 then use A \[j=1Ej = [j=1((A r [i=1Ei ) \ Ej ) ∗ ∗ 1 ∗ 1 µ (A) ≤ µ (A \[j=1Ej ) + µ (A r [j=1Ej ) and by previous also ∗ 1 ∗ 1 ∗ µ (A \[j=1Ej ) + µ (A r [j=1Ej ) ≤ µ (A) 1 so [j=1Ej 2 Σ closed under countable unions Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli ∗ • restriction µ = µ jΣ is a measure disjoint union of sets Ei in Σ, use estimate 1 ∗ X ∗ j−1 ∗ 1 µ (A) ≥ µ ((A r ti=1Ei ) \ Ej ) + µ (A r tj=1Ej ) j=1 applied to A = tj Ej gives 1 ∗ 1 X ∗ µ (tj=1Ej ) ≥ µ (Ej ) j=1 together with subadditivity of the outer measure gives additivity on disjoint unions in Σ Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Carath´eodory construction • General idea: 1 start with a class of sets S for which have a good definition of what an extension ` (length, area, volume) should be (example: intervals on the real line and their length) 2 define an outer measure on all subsets of the ambient X by setting ∗ X µ (A) := inf `(Sk ) A⊂∪ S k k k infimum over all sequences of sets in the sample class whose union covers A 3 then pass to σ-algebra and measure (X ; Σ; µ) defined by this outer measure 4 this measure µ will still have the property that it agrees with the original ` on sets S 2 S belonging to the chosen sample class, µ(S) = `(S) Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Existence of non-measurable sets • distinction between the σ-algebra Σ defined by an outer measure and the full set 2X of all subsets of X lies in the possible existence of non-measurable sets • for the case of S = intervals in the real line and ` = length, with µ the Lebesgue measure on R (translation invariant measure) existence of non-measurable sets not constructive: use of the axiom of choice • existence of non-measurable sets on the sphere S2 with respect to the rotation invariant measure related to Banach-Tarski paradox of duplication of the sphere Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Non-measurable sets: Banach-Tarski paradox F2 free group on two generators a; b all words of arbitrary length in the letters a; b; a−1; b−1 with no cancellations (no a preceded or followed by a−1 and no b preceded or followed by b−1) additional \empty word ; (identity element of the group) product = concatenation of words (with elimination of cancellations) −1 −1 F2 = f;g [ W(a) [W(b) [W(a ) [W(b ) W(x) = words starting with letter x can also write as −1 −1 F2 = W(a) [ a W(a ) or F2 = W(b) [ bW(b ) piece a W(a−1) contains all other possibilities because of cancellation of aa−1, same for bW(b−1) Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli • realize F2 as a subgroup of rigid motions of the sphere choose two different axes of rotation e1; e2 (straight lines through the center of the sphere) choose two angles θ1; θ2 that are not rationally related (θi /π lin independent over Q) group generated by a = Re1,θ1 and b = Re2,θ2 Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli choose a point P on the sphere not on the axes e1; e2 take orbits of P under transformations in each set W(a), W(b), W(a−1), W(b−1) these orbits do not cover the whole sphere S2 keep choosing new points outside of the orbits already obtained and take their orbits under the same sets of transformations until the whole S2 is covered Note: this requires infinitely many choices (axiom of choice is implicit here) Then choose a point xα from each of the orbits constructed (Note: again infinitely many choices) obtain 4 disjoint sets covering the sphere S2 A = [αW(a)xα; B = [αW(b)xα; −1 −1 C = [αW(a )xα; D = [αW(b )xα Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli • duplication of the sphere (Banach-Tarski paradox) break S2 into the pieces A; B; C; D −1 transform C = [αW(a )xα by the rigid motion a = Re1,θ1 0 −1 −1 into C = [αaW(a )xα and transform D = [αW(b )xα by 0 −1 rigid motion b = Re2,θ2 into D = [αbW(b )xα −1 −1 by F2 = W(a) [ aW(a ) = W(b) [ bW(b ) and 2 2 [αF2xα = S obtain two copies of S by reassembling these pieces as 2 0 [ −1 S = A [ C = [αW(a)xα [αaW(a )xα 2 0 [ −1 S = B [ D = [αW(b)xα [αbW(b )xα The decomposition into sets A; B; C; D necessarily involves non-measurable sets! Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Hausdorff measures µH;s N • ambient space X = R some fixed N with Euclidean distance (or more generally a metric space (X ; d)) ∗ • Hausdorff outer measure for a given s 2 R+ ∗ X s µH;s (A) := lim inf (diamUα) !0 U α where U = fUαg an open covering of A with diameters at most • Hausdorff measure µH;s obtained from the Hausdorff outer measure via the Carath´eodory construction Measure Theory Introduction to Fractal Geometry and Chaos Matilde Marcolli Behavior of the Hausdorff measures P s • for fixed > 0 define µH,,s (E) := infU α(diamUα) for N E ⊂ R , infimum over all countable coverings U = fUαg with 0 < diamUα ≤ N For a given E ⊂ R in the fixed ambient space, the function s 7! µH;s (E) is non-increasing
Recommended publications
  • Geometric Integration Theory Contents
    Steven G. Krantz Harold R. Parks Geometric Integration Theory Contents Preface v 1 Basics 1 1.1 Smooth Functions . 1 1.2Measures.............................. 6 1.2.1 Lebesgue Measure . 11 1.3Integration............................. 14 1.3.1 Measurable Functions . 14 1.3.2 The Integral . 17 1.3.3 Lebesgue Spaces . 23 1.3.4 Product Measures and the Fubini–Tonelli Theorem . 25 1.4 The Exterior Algebra . 27 1.5 The Hausdorff Distance and Steiner Symmetrization . 30 1.6 Borel and Suslin Sets . 41 2 Carath´eodory’s Construction and Lower-Dimensional Mea- sures 53 2.1 The Basic Definition . 53 2.1.1 Hausdorff Measure and Spherical Measure . 55 2.1.2 A Measure Based on Parallelepipeds . 57 2.1.3 Projections and Convexity . 57 2.1.4 Other Geometric Measures . 59 2.1.5 Summary . 61 2.2 The Densities of a Measure . 64 2.3 A One-Dimensional Example . 66 2.4 Carath´eodory’s Construction and Mappings . 67 2.5 The Concept of Hausdorff Dimension . 70 2.6 Some Cantor Set Examples . 73 i ii CONTENTS 2.6.1 Basic Examples . 73 2.6.2 Some Generalized Cantor Sets . 76 2.6.3 Cantor Sets in Higher Dimensions . 78 3 Invariant Measures and the Construction of Haar Measure 81 3.1 The Fundamental Theorem . 82 3.2 Haar Measure for the Orthogonal Group and the Grassmanian 90 3.2.1 Remarks on the Manifold Structure of G(N,M).... 94 4 Covering Theorems and the Differentiation of Integrals 97 4.1 Wiener’s Covering Lemma and its Variants .
    [Show full text]
  • On Stochastic Distributions and Currents
    NISSUNA UMANA INVESTIGAZIONE SI PUO DIMANDARE VERA SCIENZIA S’ESSA NON PASSA PER LE MATEMATICHE DIMOSTRAZIONI LEONARDO DA VINCI vol. 4 no. 3-4 2016 Mathematics and Mechanics of Complex Systems VINCENZO CAPASSO AND FRANCO FLANDOLI ON STOCHASTIC DISTRIBUTIONS AND CURRENTS msp MATHEMATICS AND MECHANICS OF COMPLEX SYSTEMS Vol. 4, No. 3-4, 2016 dx.doi.org/10.2140/memocs.2016.4.373 ∩ MM ON STOCHASTIC DISTRIBUTIONS AND CURRENTS VINCENZO CAPASSO AND FRANCO FLANDOLI Dedicated to Lucio Russo, on the occasion of his 70th birthday In many applications, it is of great importance to handle random closed sets of different (even though integer) Hausdorff dimensions, including local infor- mation about initial conditions and growth parameters. Following a standard approach in geometric measure theory, such sets may be described in terms of suitable measures. For a random closed set of lower dimension with respect to the environment space, the relevant measures induced by its realizations are sin- gular with respect to the Lebesgue measure, and so their usual Radon–Nikodym derivatives are zero almost everywhere. In this paper, how to cope with these difficulties has been suggested by introducing random generalized densities (dis- tributions) á la Dirac–Schwarz, for both the deterministic case and the stochastic case. For the last one, mean generalized densities are analyzed, and they have been related to densities of the expected values of the relevant measures. Ac- tually, distributions are a subclass of the larger class of currents; in the usual Euclidean space of dimension d, currents of any order k 2 f0; 1;:::; dg or k- currents may be introduced.
    [Show full text]
  • Hausdorff Measure
    Hausdorff Measure Jimmy Briggs and Tim Tyree December 3, 2016 1 1 Introduction In this report, we explore the the measurement of arbitrary subsets of the metric space (X; ρ); a topological space X along with its distance function ρ. We introduce Hausdorff Measure as a natural way of assigning sizes to these sets, especially those of smaller \dimension" than X: After an exploration of the salient properties of Hausdorff Measure, we proceed to a definition of Hausdorff dimension, a separate idea of size that allows us a more robust comparison between rough subsets of X. Many of the theorems in this report will be summarized in a proof sketch or shown by visual example. For a more rigorous treatment of the same material, we redirect the reader to Gerald B. Folland's Real Analysis: Modern techniques and their applications. Chapter 11 of the 1999 edition served as our primary reference. 2 Hausdorff Measure 2.1 Measuring low-dimensional subsets of X The need for Hausdorff Measure arises from the need to know the size of lower-dimensional subsets of a metric space. This idea is not as exotic as it may sound. In a high school Geometry course, we learn formulas for objects of various dimension embedded in R3: In Figure 1 we see the line segment, the circle, and the sphere, each with it's own idea of size. We call these length, area, and volume, respectively. Figure 1: low-dimensional subsets of R3: 2 4 3 2r πr 3 πr Note that while only volume measures something of the same dimension as the host space, R3; length, and area can still be of interest to us, especially 2 in applications.
    [Show full text]
  • An Introduction to Random Walks on Groups
    An introduction to random walks on groups Jean-Fran¸coisQuint School on Information and Randomness, Puerto Varas, December 2014 Contents 1 Locally compact groups and Haar measure 2 2 Amenable groups 4 3 Invariant means 9 4 Almost invariant vectors 13 5 Random walks and amenable groups 15 6 Growth of groups 18 7 Speed of escape 21 8 Subgroups of SL2(R) 24 1 In these notes, we will study a basic question from the theory of random walks on groups: given a random walk e; g1; g2g1; : : : ; gn ··· g1;::: on a group G, we will give a criterion for the trajectories to go to infinity with linear speed (for a notion of speed which has to be defined). We will see that this property is related to the notion of amenability of groups: this is a fun- damental theorem which was proved by Kesten in the case of discrete groups and extended to the case of continuous groups by Berg and Christensen. We will give examples of this behaviour for random walks on SL2(R). 1 Locally compact groups and Haar measure In order to define random walks on groups, I need to consider probability measures on groups, which will be the distribution of the random walks. When the group is discrete, there is no technical difficulty: a probability measure is a function from the group to [0; 1], the sum of whose values is one. But I also want to consider non discrete groups, such as vector spaces, groups of matrices, groups of automorphisms of trees, etc.
    [Show full text]
  • Integral Geometry – Measure Theoretic Approach and Stochastic Applications
    Integral geometry – measure theoretic approach and stochastic applications Rolf Schneider Preface Integral geometry, as it is understood here, deals with the computation and application of geometric mean values with respect to invariant measures. In the following, I want to give an introduction to the integral geometry of polyconvex sets (i.e., finite unions of compact convex sets) in Euclidean spaces. The invariant or Haar measures that occur will therefore be those on the groups of translations, rotations, or rigid motions of Euclidean space, and on the affine Grassmannians of k-dimensional affine subspaces. How- ever, it is also in a different sense that invariant measures will play a central role, namely in the form of finitely additive functions on polyconvex sets. Such functions have been called additive functionals or valuations in the literature, and their motion invariant specializations, now called intrinsic volumes, have played an essential role in Hadwiger’s [2] and later work (e.g., [8]) on integral geometry. More recently, the importance of these functionals for integral geometry has been rediscovered by Rota [5] and Klain-Rota [4], who called them ‘measures’ and emphasized their role in certain parts of geometric probability. We will, more generally, deal with local versions of the intrinsic volumes, the curvature measures, and derive integral-geometric results for them. This is the third aspect of the measure theoretic approach mentioned in the title. A particular feature of this approach is the essential role that uniqueness results for invariant measures play in the proofs. As prerequisites, we assume some familiarity with basic facts from mea- sure and integration theory.
    [Show full text]
  • Construction of Geometric Outer-Measures and Dimension Theory
    Construction of Geometric Outer-Measures and Dimension Theory by David Worth B.S., Mathematics, University of New Mexico, 2003 THESIS Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science Mathematics The University of New Mexico Albuquerque, New Mexico December, 2006 c 2008, David Worth iii DEDICATION To my lovely wife Meghan, to whom I am eternally grateful for her support and love. Without her I would never have followed my education or my bliss. iv ACKNOWLEDGMENTS I would like to thank my advisor, Dr. Terry Loring, for his years of encouragement and aid in pursuing mathematics. I would also like to thank Dr. Cristina Pereyra for her unfailing encouragement and her aid in completing this daunting task. I would like to thank Dr. Wojciech Kucharz for his guidance and encouragement for the entirety of my adult mathematical career. Moreover I would like to thank Dr. Jens Lorenz, Dr. Vladimir I Koltchinskii, Dr. James Ellison, and Dr. Alexandru Buium for their years of inspirational teaching and their influence in my life. v Construction of Geometric Outer-Measures and Dimension Theory by David Worth ABSTRACT OF THESIS Submitted in Partial Fulfillment of the Requirements for the Degree of Master of Science Mathematics The University of New Mexico Albuquerque, New Mexico December, 2006 Construction of Geometric Outer-Measures and Dimension Theory by David Worth B.S., Mathematics, University of New Mexico, 2003 M.S., Mathematics, University of New Mexico, 2008 Abstract Geometric Measure Theory is the rigorous mathematical study of the field commonly known as Fractal Geometry. In this work we survey means of constructing families of measures, via the so-called \Carath´eodory construction", which isolate certain small- scale features of complicated sets in a metric space.
    [Show full text]
  • Probability Measures on Metric Spaces
    Probability measures on metric spaces Onno van Gaans These are some loose notes supporting the first sessions of the seminar Stochastic Evolution Equations organized by Dr. Jan van Neerven at the Delft University of Technology during Winter 2002/2003. They contain less information than the common textbooks on the topic of the title. Their purpose is to present a brief selection of the theory that provides a basis for later study of stochastic evolution equations in Banach spaces. The notes aim at an audience that feels more at ease in analysis than in probability theory. The main focus is on Prokhorov's theorem, which serves both as an important tool for future use and as an illustration of techniques that play a role in the theory. The field of measures on topological spaces has the luxury of several excellent textbooks. The main source that has been used to prepare these notes is the book by Parthasarathy [6]. A clear exposition is also available in one of Bour- baki's volumes [2] and in [9, Section 3.2]. The theory on the Prokhorov metric is taken from Billingsley [1]. The additional references for standard facts on general measure theory and general topology have been Halmos [4] and Kelley [5]. Contents 1 Borel sets 2 2 Borel probability measures 3 3 Weak convergence of measures 6 4 The Prokhorov metric 9 5 Prokhorov's theorem 13 6 Riesz representation theorem 18 7 Riesz representation for non-compact spaces 21 8 Integrable functions on metric spaces 24 9 More properties of the space of probability measures 26 1 The distribution of a random variable in a Banach space X will be a probability measure on X.
    [Show full text]
  • 3. Invariant Measures
    MAGIC010 Ergodic Theory Lecture 3 3. Invariant measures x3.1 Introduction In Lecture 1 we remarked that ergodic theory is the study of the qualitative distributional properties of typical orbits of a dynamical system and that these properties are expressed in terms of measure theory. Measure theory therefore lies at the heart of ergodic theory. However, we will not need to know the (many!) intricacies of measure theory. We will give a brief overview of the basics of measure theory, before studying invariant measures. In the next lecture we then go on to study ergodic measures. x3.2 Measure spaces We will need to recall some basic definitions and facts from measure theory. Definition. Let X be a set. A collection B of subsets of X is called a σ-algebra if: (i) ; 2 B, (ii) if A 2 B then X n A 2 B, (iii) if An 2 B, n = 1; 2; 3;:::, is a countable sequence of sets in B then S1 their union n=1 An 2 B. Remark Clearly, if B is a σ-algebra then X 2 B. It is easy to see that if B is a σ-algebra then B is also closed under taking countable intersections. Examples. 1. The trivial σ-algebra is given by B = f;;Xg. 2. The full σ-algebra is given by B = P(X), i.e. the collection of all subsets of X. 3. Let X be a compact metric space. The Borel σ-algebra is the small- est σ-algebra that contains every open subset of X.
    [Show full text]
  • Statistical Properties of Dynamical Systems - Simulation and Abstract Computation
    Statistical properties of dynamical systems - simulation and abstract computation. Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas To cite this version: Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas. Statistical properties of dynamical systems - simulation and abstract computation.. Chaos, Solitons and Fractals, Elsevier, 2012, 45 (1), pp.1-14. 10.1016/j.chaos.2011.09.011. hal-00644790 HAL Id: hal-00644790 https://hal.inria.fr/hal-00644790 Submitted on 25 Nov 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Statistical properties of dynamical systems { simulation and abstract computation. Stefano Galatolo Mathieu Hoyrup Universita di Pisa LORIA - INRIA Crist´obalRojas Universidad Andres Bello October 11, 2011 Abstract We survey an area of recent development, relating dynamics to the- oretical computer science. We discuss some aspects of the theoretical simulation and computation of the long term behavior of dynamical sys- tems. We will focus on the statistical limiting behavior and invariant measures. We present a general method allowing the algorithmic approx- imation at any given accuracy of invariant measures. The method can be applied in many interesting cases, as we shall explain. On the other hand, we exhibit some examples where the algorithmic approximation of invariant measures is not possible.
    [Show full text]
  • Invariant Measures for Set-Valued Dynamical Systems
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 351, Number 3, March 1999, Pages 1203{1225 S 0002-9947(99)02424-1 INVARIANT MEASURES FOR SET-VALUED DYNAMICAL SYSTEMS WALTER MILLER AND ETHAN AKIN Abstract. A continuous map on a compact metric space, regarded as a dy- namical system by iteration, admits invariant measures. For a closed relation on such a space, or, equivalently, an upper semicontinuous set-valued map, there are several concepts which extend this idea of invariance for a measure. We prove that four such are equivalent. In particular, such relation invari- ant measures arise as projections from shift invariant measures on the space of sample paths. There is a similarly close relationship between the ideas of chain recurrence for the set-valued system and for the shift on the sample path space. 1. Introduction All our spaces will be nonempty, compact, metric spaces. For such a space X let P (X) denote the space of Borel probability measures on X with δ : X P (X) → the embedding associating to x X the point measure δx. The support µ of a measure µ in P (X) is the smallest∈ closed subset of measure 1. If f : X | |X is 1 → 2 Borel measurable then the induced map f : P (X1) P (X2) associates to µ the measure f (µ) defined by ∗ → ∗ 1 (1.1) f (µ)(B)=µ(f− (B)) ∗ for all B Borel in X2. We regard a continuous map f on X as a dynamical system by iterating. A measure µ P (X) is called an invariant measure when it is a fixed point for the map f : P (∈X) P (X), i.e.
    [Show full text]
  • Arxiv:1611.00621V1 [Math.DS] 2 Nov 2016
    PROPERTIES OF INVARIANT MEASURES IN DYNAMICAL SYSTEMS WITH THE SHADOWING PROPERTY JIAN LI AND PIOTR OPROCHA ABSTRACT. For dynamical systems with the shadowing property, we provide a method of approximation of invariant measures by ergodic measures supported on odometers and their almost 1-1 extensions. For a topologically transitive system with the shadowing prop- erty, we show that ergodic measures supported on odometers are dense in the space of in- variant measures, and then ergodic measures are generic in the space of invariant measures. We also show that for every c ≥ 0 and e > 0 the collection of ergodic measures (supported on almost 1-1 extensions of odometers) with entropy between c and c + e is dense in the space of invariant measures with entropy at least c. Moreover, if in addition the entropy function is upper semi-continuous, then for every c ≥ 0 ergodic measures with entropy c are generic in the space of invariant measures with entropy at least c. 1. INTRODUCTION The concepts of the specification and shadowing properties were born during studies on topological and measure-theoretic properties of Axiom A diffeomorphisms (see [3] and [4] by Rufus Bowen, who was motivated by some earlier works of Anosov and Sinai). Later it turned out that there are many very strong connections between specification properties and the structure of the space of invariant measures. For example in [32, 33], Sigmund showed that if a dynamical system has the periodic specification property, then: the set of measures supported on periodic points is dense in the space of invariant measures; the set of ergodic measures, the set of non-atomic measures, the set of measures positive on all open sets, and the set of measures vanishing on all proper closed invariant subsets are complements of sets of first category in the space of invariant measures; the set of strongly mixing measures is a set of first category in the space of invariant measures.
    [Show full text]
  • Dynamical Systems and Ergodic Theory
    MATH36206 - MATHM6206 Dynamical Systems and Ergodic Theory Teaching Block 1, 2017/18 Lecturer: Prof. Alexander Gorodnik PART III: LECTURES 16{30 course web site: people.maths.bris.ac.uk/∼mazag/ds17/ Copyright c University of Bristol 2010 & 2016. This material is copyright of the University. It is provided exclusively for educational purposes at the University and is to be downloaded or copied for your private study only. Chapter 3 Ergodic Theory In this last part of our course we will introduce the main ideas and concepts in ergodic theory. Ergodic theory is a branch of dynamical systems which has strict connections with analysis and probability theory. The discrete dynamical systems f : X X studied in topological dynamics were continuous maps f on metric spaces X (or more in general, topological→ spaces). In ergodic theory, f : X X will be a measure-preserving map on a measure space X (we will see the corresponding definitions below).→ While the focus in topological dynamics was to understand the qualitative behavior (for example, periodicity or density) of all orbits, in ergodic theory we will not study all orbits, but only typical1 orbits, but will investigate more quantitative dynamical properties, as frequencies of visits, equidistribution and mixing. An example of a basic question studied in ergodic theory is the following. Let A X be a subset of O+ ⊂ the space X. Consider the visits of an orbit f (x) to the set A. If we consider a finite orbit segment x, f(x),...,f n−1(x) , the number of visits to A up to time n is given by { } Card 0 k n 1, f k(x) A .
    [Show full text]