DOCSLIB.ORG

DYNAMICAL SYSTEMS, TRANSFER OPERATORS and FUNCTIONAL

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
DYNAMICAL SYSTEMS, TRANSFER OPERATORS and FUNCTIONAL DYNAMICAL SYSTEMS, TRANSFER OPERATORS and FUNCTIONAL ANALYSIS Brigitte Vallee´ , Laboratoire GREYC (CNRS et Universit´ede Caen) S´eminaire CALIN, LIPN, 5 octobre 2010 A Euclidean Algorithm ⇓ Arithmetic properties of the division ⇓ Geometric properties of the branches ⇓ Spectral properties of the transfer operator ⇓ Analytical properties of the Quasi-Inverse of the transfer operator ⇓ Analytical properties of the generating function ⇓ Probabilistic analysis of the Euclidean Algorithm Dynamical analysis of a Euclidean Algorithm. Geometric properties of the branches ⇓ Spectral properties of the transfer operator ⇓ Analytical properties of the Quasi-Inverse of the transfer operator ⇓ Analytical properties of the generating function ⇓ Probabilistic analysis of the Euclidean Algorithm Dynamical analysis of a Euclidean Algorithm. A Euclidean Algorithm ⇓ Arithmetic properties of the division ⇓ ⇓ Analytical properties of the generating function ⇓ Probabilistic analysis of the Euclidean Algorithm Dynamical analysis of a Euclidean Algorithm. A Euclidean Algorithm ⇓ Arithmetic properties of the division ⇓ Geometric properties of the branches ⇓ Spectral properties of the transfer operator ⇓ Analytical properties of the Quasi-Inverse of the transfer operator Dynamical analysis of a Euclidean Algorithm. A Euclidean Algorithm ⇓ Arithmetic properties of the division ⇓ Geometric properties of the branches ⇓ Spectral properties of the transfer operator ⇓ Analytical properties of the Quasi-Inverse of the transfer operator ⇓ Analytical properties of the generating function ⇓ Probabilistic analysis of the Euclidean Algorithm u0 := v; u1 := u; u0 ≥ u1 u0 = m1u1 + u2 0 < u2 < u1 u = m u + u 0 < u < u 1 2 2 3 3 2 ... = ... + up−2 = mp−1up−1 + up 0 < up < up−1 up−1 = mpup + 0 up+1 = 0 up is the gcd of u and v, the mi’s are the digits. p is the depth. u u 1 CFE of : = , v v 1 m + 1 1 m + 2 . 1 .. + mp The (standard) Euclid Algorithm: the grand father of all the algorithms. On the input (u, v), it computes the gcd of u and v, together with the Continued Fraction Expansion of u/v. u u 1 CFE of : = , v v 1 m + 1 1 m + 2 . 1 .. + mp The (standard) Euclid Algorithm: the grand father of all the algorithms. On the input (u, v), it computes the gcd of u and v, together with the Continued Fraction Expansion of u/v. u0 := v; u1 := u; u0 ≥ u1 u0 = m1u1 + u2 0 < u2 < u1 u = m u + u 0 < u < u 1 2 2 3 3 2 ... = ... + up−2 = mp−1up−1 + up 0 < up < up−1 up−1 = mpup + 0 up+1 = 0 up is the gcd of u and v, the mi’s are the digits. p is the depth. The (standard) Euclid Algorithm: the grand father of all the algorithms. On the input (u, v), it computes the gcd of u and v, together with the Continued Fraction Expansion of u/v. u0 := v; u1 := u; u0 ≥ u1 u0 = m1u1 + u2 0 < u2 < u1 u = m u + u 0 < u < u 1 2 2 3 3 2 ... = ... + up−2 = mp−1up−1 + up 0 < up < up−1 up−1 = mpup + 0 up+1 = 0 up is the gcd of u and v, the mi’s are the digits. p is the depth. u u 1 CFE of : = , v v 1 m + 1 1 m + 2 . 1 .. + mp ui Replace the integer pair (ui, ui−1) by the rational xi := . ui−1 The division ui−1 = miui + ui+1 is then written as 1 1 xi+1 = − or xi+1 = T (xi), where xi xi 1 1 T : [0, 1] −→ [0, 1],T (x) := − for x 6= 0,T (0) = 0 x x An execution of the Euclidean Algorithm (x, T (x),T 2(x),..., 0) = A rational trajectory of the Dynamical System ([0, 1],T ) = a trajectory that reaches 0. The dynamical system is a continuous extension of the algorithm. The underlying Euclidean dynamical system (I). The trace of the execution of the Euclid Algorithm on (u1, u0) is: (u1, u0) → (u2, u1) → (u3, u2) → ... → (up−1, up) → (up+1, up) = (0, up) An execution of the Euclidean Algorithm (x, T (x),T 2(x),..., 0) = A rational trajectory of the Dynamical System ([0, 1],T ) = a trajectory that reaches 0. The dynamical system is a continuous extension of the algorithm. The underlying Euclidean dynamical system (I). The trace of the execution of the Euclid Algorithm on (u1, u0) is: (u1, u0) → (u2, u1) → (u3, u2) → ... → (up−1, up) → (up+1, up) = (0, up) ui Replace the integer pair (ui, ui−1) by the rational xi := . ui−1 The division ui−1 = miui + ui+1 is then written as 1 1 xi+1 = − or xi+1 = T (xi), where xi xi 1 1 T : [0, 1] −→ [0, 1],T (x) := − for x 6= 0,T (0) = 0 x x The underlying Euclidean dynamical system (I). The trace of the execution of the Euclid Algorithm on (u1, u0) is: (u1, u0) → (u2, u1) → (u3, u2) → ... → (up−1, up) → (up+1, up) = (0, up) ui Replace the integer pair (ui, ui−1) by the rational xi := . ui−1 The division ui−1 = miui + ui+1 is then written as 1 1 xi+1 = − or xi+1 = T (xi), where xi xi 1 1 T : [0, 1] −→ [0, 1],T (x) := − for x 6= 0,T (0) = 0 x x An execution of the Euclidean Algorithm (x, T (x),T 2(x),..., 0) = A rational trajectory of the Dynamical System ([0, 1],T ) = a trajectory that reaches 0. The dynamical system is a continuous extension of the algorithm. 1 1 T (x) := − x x 1 1 T :] , [−→]0, 1[, [m] m + 1 m 1 T (x) := − m [m] x 1 1 h :]0, 1[−→] , [ [m] m + 1 m 1 h (x) := [m] m + x The set H builds one step of the CF’s. The set Hn of the inverse branches of T n builds CF’s of depth n. The set H? := S Hn builds all the (finite) CF’s. u 1 = = h ◦ h ◦ ... ◦ h (0) v 1 [m1] [m2] [mp] m + 1 1 m2 + . 1 .. + mp The Euclidean dynamical system (II). A dynamical system with a denumerable system of branches (T[m])m≥1, 1 1 1 T :] , [−→]0, 1[,T (x) := − m [m] m + 1 m [m] x The set H of the inverse branches of T is 1 1 1 H := { h :]0, 1[−→] , [; h (x) := } [m] m + 1 m [m] m + x The Euclidean dynamical system (II). A dynamical system with a denumerable system of branches (T[m])m≥1, 1 1 1 T :] , [−→]0, 1[,T (x) := − m [m] m + 1 m [m] x The set H of the inverse branches of T is 1 1 1 H := { h :]0, 1[−→] , [; h (x) := } [m] m + 1 m [m] m + x The set H builds one step of the CF’s. The set Hn of the inverse branches of T n builds CF’s of depth n. The set H? := S Hn builds all the (finite) CF’s. u 1 = = h ◦ h ◦ ... ◦ h (0) v 1 [m1] [m2] [mp] m + 1 1 m2 + . 1 .. + mp Transfer operator (Ruelle): X 0 s Hs[f](x) = |h (x)| f ◦ h(x). h∈H The k-th iterate satisfies: k X 0 s Hs [f](x) = |h (x)| f ◦ h(x) h∈Hk The transfer operator (I). Density Transformer: For a density f on [0, 1], H[f] is the density on [0, 1] after one iteration of the shift X X 1 1 H[f](x) = |h0(x)| f◦h(x) = f( ). (m + x)2 m + x h∈H m∈N The k-th iterate satisfies: k X 0 s Hs [f](x) = |h (x)| f ◦ h(x) h∈Hk The transfer operator (I). Density Transformer: For a density f on [0, 1], H[f] is the density on [0, 1] after one iteration of the shift X X 1 1 H[f](x) = |h0(x)| f◦h(x) = f( ). (m + x)2 m + x h∈H m∈N Transfer operator (Ruelle): X 0 s Hs[f](x) = |h (x)| f ◦ h(x). h∈H The transfer operator (I). Density Transformer: For a density f on [0, 1], H[f] is the density on [0, 1] after one iteration of the shift X X 1 1 H[f](x) = |h0(x)| f◦h(x) = f( ). (m + x)2 m + x h∈H m∈N Transfer operator (Ruelle): X 0 s Hs[f](x) = |h (x)| f ◦ h(x). h∈H The k-th iterate satisfies: k X 0 s Hs [f](x) = |h (x)| f ◦ h(x) h∈Hk With a cost c : H → R+ extended to H? by additivity, it gives rise to the weighted transfer operator X 0 s Hs,w : Hs,w[f](x) := exp[wc(h)] · |h (x)| · f ◦ h(x) h∈H ( ) Multiplicative properties of the derivative =⇒ Additive properties of the cost n X 0 s Hs,w[f](x) := exp[wc(h)] · |h (x)| · f ◦ h(x) h∈Hn The n–th iterate of Hs,w generates the CFs of depth n. −1 P n The quasi inverse (I −Hs,w) = n≥0 Hs,w generates all the finite CFs. The transfer operator (II) The density transformer H expresses the new density f1 as a function of the old density f0, as f1 = H[f0]. It involves the set H X H : H[f](x) := |h0(x)| · f ◦ h(x) h∈H ( ) Multiplicative properties of the derivative =⇒ Additive properties of the cost n X 0 s Hs,w[f](x) := exp[wc(h)] · |h (x)| · f ◦ h(x) h∈Hn The n–th iterate of Hs,w generates the CFs of depth n.
Load more

Recommended publications
  • The Transfer Operator Approach to ``Quantum Chaos
    Front Modular surface Spectral theory Geodesics and coding Transfer operator Connection to spectral theory Conclusions Front page The transfer operator approach to “quantum chaos” Classical mechanics and the Laplace-Beltrami operator on PSL (Z) H 2 \ Tobias M¨uhlenbruch Joint work with D. Mayer and F. Str¨omberg Institut f¨ur Mathematik TU Clausthal [email protected] 22 January 2009, Fernuniversit¨at in Hagen Front Modular surface Spectral theory Geodesics and coding Transfer operator Connection to spectral theory Conclusions Outline of the presentation 1 Modular surface 2 Spectral theory 3 Geodesics and coding 4 Transfer operator 5 Connection to spectral theory 6 Conclusions Front Modular surface Spectral theory Geodesics and coding Transfer operator Connection to spectral theory Conclusions PSL Z The full modular group 2( ) Let PSL2(Z) be the full modular group PSL (Z)= S, T (ST )3 =1 = SL (Z) mod 1 2 h | i 2 {± } 0 1 1 1 1 0 with S = − , T = and 1 = . 1 0 0 1 0 1 a b az+b if z C, M¨obius transformations: z = cz+d ∈ c d a if z = . c ∞ Three orbits: the upper halfplane H = x + iy; y > 0 , the 1 { } projective real line PR and the lower half plane. z , z are PSL (Z)-equivalent if M PSL (Z) with 1 2 2 ∃ ∈ 2 M z1 = z2. The full modular group PSL2(Z) is generated by 1 translation T : z z + 1 and inversion S : z − . 7→ 7→ z (Closed) fundamental domain = z H; z 1, Re(z) 1 . F ∈ | |≥ | |≤ 2 Front Modular surface Spectral theory Geodesics and coding Transfer operator Connection to spectral theory Conclusions PSL Z H The modular surface 2( )\ The upper half plane H = x + iy; y > 0 can be viewed as a hyperbolic plane with constant{ negative} curvature 1.
    [Show full text]
  • Arxiv:1910.08491V3 [Math.ST] 3 Nov 2020
    Weakly stationary stochastic processes valued in a separable Hilbert space: Gramian-Cram´er representations and applications Amaury Durand ∗† Fran¸cois Roueff ∗ September 14, 2021 Abstract The spectral theory for weakly stationary processes valued in a separable Hilbert space has known renewed interest in the past decade. However, the recent literature on this topic is often based on restrictive assumptions or lacks important insights. In this paper, we follow earlier approaches which fully exploit the normal Hilbert module property of the space of Hilbert- valued random variables. This approach clarifies and completes the isomorphic relationship between the modular spectral domain to the modular time domain provided by the Gramian- Cram´er representation. We also discuss the general Bochner theorem and provide useful results on the composition and inversion of lag-invariant linear filters. Finally, we derive the Cram´er-Karhunen-Lo`eve decomposition and harmonic functional principal component analysis without relying on simplifying assumptions. 1 Introduction Functional data analysis has become an active field of research in the recent decades due to technological advances which makes it possible to store longitudinal data at very high frequency (see e.g. [22, 31]), or complex data e.g. in medical imaging [18, Chapter 9], [15], linguistics [28] or biophysics [27]. In these frameworks, the data is seen as valued in an infinite dimensional separable Hilbert space thus isomorphic to, and often taken to be, the function space L2(0, 1) of Lebesgue-square-integrable functions on [0, 1]. In this setting, a 2 functional time series refers to a bi-sequences (Xt)t∈Z of L (0, 1)-valued random variables and the assumption of finite second moment means that each random variable Xt belongs to the L2 Bochner space L2(Ω, F, L2(0, 1), P) of measurable mappings V : Ω → L2(0, 1) such that E 2 kV kL2(0,1) < ∞ , where k·kL2(0,1) here denotes the norm endowing the Hilbert space L2h(0, 1).
    [Show full text]
  • An Introduction to Fractal Uncertainty Principle
    An introduction to fractal uncertainty principle Semyon Dyatlov (MIT / UC Berkeley) The goal of this minicourse is to give a brief introduction to fractal uncertainty principle and its applications to transfer operators for Schottky groups Part 1: Schottky groups, transfer operators, and resonances Schottky groups of SL ( 2 IR ) on the action , Using ' 70 d z 3- H = fz E l Im its and on boundary H = IRV { a } by Mobius transformations : f- (Ibd ) ⇒ 8. z = aztbcztd Schottky groups provide interesting nonlinear dynamics on fractal limit sets and appear in many important applications To define a Schottky group, we fix: of r disks • 2. a collection nonintersecting IR in ¢ with centers in := . AIR Q . , Dzr Ij Dj := and 1 . • denote A { ,2r3 . Ifa Er Atr if I = , f - r if rsaE2r a , that • 8 . such , . Kr fix maps . , ' )= ti racial D; Da , E- Pc SLC 2,112) • The Schottky group free ti . is the group generated by . .fr Example of a Schottky group Here is a picture for the case of 4 disks: IC = = Cil K ( ) Dz , 8. ( Dj ) Dz , IDE - =D ID ) - Ds ( IC ID:) BCCI : , Oy , 83 ⇒ A Schottky quotients ' of Ta k i n g the quotient CH , ) action of P we a the , get by surface co - . convex compact hyperbolic µ ' - M - T l H IIF plane # Three-funneled surface in G - funnel infinite end Words and nested intervals the = 2r encodes Recall I 91 . } that , . P of the I := at r generators group , n : • Words of length " = W . an far / Vj , ajt, taj } ' = : . ⇒ = . ⑨ . - A , An OT A , Ah i • Group elements : : = E T - .
    [Show full text]
  • Reproducing Kernel Hilbert Space Compactification of Unitary Evolution
    Reproducing kernel Hilbert space compactification of unitary evolution groups Suddhasattwa Dasa, Dimitrios Giannakisa,∗, Joanna Slawinskab aCourant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA bFinnish Center for Artificial Intelligence, Department of Computer Science, University of Helsinki, Helsinki, Finland Abstract A framework for coherent pattern extraction and prediction of observables of measure-preserving, ergodic dynamical systems with both atomic and continuous spectral components is developed. This framework is based on an approximation of the generator of the system by a compact operator Wτ on a reproducing kernel Hilbert space (RKHS). A key element of this approach is that Wτ is skew-adjoint (unlike regularization approaches based on the addition of diffusion), and thus can be characterized by a unique projection- valued measure, discrete by compactness, and an associated orthonormal basis of eigenfunctions. These eigenfunctions can be ordered in terms of a Dirichlet energy on the RKHS, and provide a notion of coherent observables under the dynamics akin to the Koopman eigenfunctions associated with the atomic part of the spectrum. In addition, the regularized generator has a well-defined Borel functional calculus allowing tWτ the construction of a unitary evolution group fe gt2R on the RKHS, which approximates the unitary Koopman evolution group of the original system. We establish convergence results for the spectrum and Borel functional calculus of the regularized generator to those of the original system in the limit τ ! 0+. Convergence results are also established for a data-driven formulation, where these operators are approximated using finite-rank operators obtained from observed time series. An advantage of working in spaces of observables with an RKHS structure is that one can perform pointwise evaluation and interpolation through bounded linear operators, which is not possible in Lp spaces.
    [Show full text]
  • Asymptotic Spectral Gap and Weyl Law for Ruelle Resonances of Open Partially Expanding Maps Jean-François Arnoldi, Frédéric Faure, Tobias Weich
    Asymptotic spectral gap and Weyl law for Ruelle resonances of open partially expanding maps Jean-François Arnoldi, Frédéric Faure, Tobias Weich To cite this version: Jean-François Arnoldi, Frédéric Faure, Tobias Weich. Asymptotic spectral gap and Weyl law for Ruelle resonances of open partially expanding maps. Ergodic Theory and Dynamical Systems, Cambridge University Press (CUP), 2017, 37 (1), pp.1-58. 10.1017/etds.2015.34. hal-00787781v2 HAL Id: hal-00787781 https://hal.archives-ouvertes.fr/hal-00787781v2 Submitted on 4 Jun 2013 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. Asymptotic spectral gap and Weyl law for Ruelle resonances of open partially expanding maps Jean Francois Arnoldi∗, Frédéric Faure†, Tobias Weich‡ 01-06-2013 Abstract We consider a simple model of an open partially expanding map. Its trapped set in phase space is a fractal set. We first show that there is a well defined K discrete spectrum of Ruelle resonances which describes the asymptotisc of correlation functions for large time and which is parametrized by the Fourier component ν on the neutral direction of the dynamics. We introduce a specific hypothesis on the dynamics that we call “minimal captivity”.
    [Show full text]
  • Spectral Structure of Transfer Operators for Expanding Circle Maps
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Queen Mary Research Online SPECTRAL STRUCTURE OF TRANSFER OPERATORS FOR EXPANDING CIRCLE MAPS OSCAR F. BANDTLOW, WOLFRAM JUST, AND JULIA SLIPANTSCHUK Abstract. We explicitly determine the spectrum of transfer operators (acting on spaces of holomorphic functions) associated to analytic expanding circle maps arising from finite Blaschke products. This is achieved by deriving a convenient natural representation of the respective adjoint operators. 1. Introduction One of the major strands of modern ergodic theory is to exploit the rich links between dynamical systems theory and functional analysis, making the powerful tools of the latter available for the benefit of understanding complex dynamical be- haviour. In classical ergodic theory, composition operators occur naturally as basic objects for formulating concepts such as ergodicity or mixing [28]. These operators, known in this context as Koopman operators, are the formal adjoints of transfer op- erators, the spectral data of which provide insight into fine statistical properties of the underlying dynamical systems, such as rates of mixing (see, for example, [2, 7]). There exists a large body of literature on spectral estimates for transfer operators (and hence mixing properties) for various one- and higher-dimensional systems with different degree of expansivity or hyperbolicity (see [1] for an overview). However, to the best of our knowledge, no sufficiently rich class of dynamical systems to- gether with a machinery allowing for the explicit analytic determination of the entire spectrum is known. This is the gap the current contribution aims to fill. In the literature, the term `composition operator' is mostly used to refer to compositions with analytic functions mapping a disk into itself, a setting in which operator-theoretic properties such as boundedness, compactness, and most impor- tantly explicit spectral information are well-established (good references are [23] or the encyclopedia on the subject [9]).
    [Show full text]
  • Eigendecompositions of Transfer Operators in Reproducing Kernel Hilbert Spaces
    Eigendecompositions of Transfer Operators in Reproducing Kernel Hilbert Spaces Stefan Klus1, Ingmar Schuster2, and Krikamol Muandet3 1Department of Mathematics and Computer Science, Freie Universit¨atBerlin, Germany 2Zalando Research, Zalando SE, Berlin, Germany 3Max Planck Institute for Intelligent Systems, T¨ubingen,Germany Abstract Transfer operators such as the Perron{Frobenius or Koopman operator play an im- portant role in the global analysis of complex dynamical systems. The eigenfunctions of these operators can be used to detect metastable sets, to project the dynamics onto the dominant slow processes, or to separate superimposed signals. We propose kernel transfer operators, which extend transfer operator theory to reproducing kernel Hilbert spaces and show that these operators are related to Hilbert space representations of con- ditional distributions, known as conditional mean embeddings. The proposed numerical methods to compute empirical estimates of these kernel transfer operators subsume ex- isting data-driven methods for the approximation of transfer operators such as extended dynamic mode decomposition and its variants. One main benefit of the presented kernel- based approaches is that they can be applied to any domain where a similarity measure given by a kernel is available. Furthermore, we provide elementary results on eigende- compositions of finite-rank RKHS operators. We illustrate the results with the aid of guiding examples and highlight potential applications in molecular dynamics as well as video and text data analysis. 1 Introduction Transfer operators such as the Perron{Frobenius or Koopman operator are ubiquitous in molecular dynamics, fluid dynamics, atmospheric sciences, and control theory (Schmid, 2010, Brunton et al., 2016, Klus et al., 2018a).
    [Show full text]
  • An Overview of Transfer Operator Methods in Nonautonomous Dynamics: Geometry, Spectrum, and Data
    An overview of transfer operator methods in nonautonomous dynamics: geometry, spectrum, and data Gary Froyland School of Mathematics and Statistics University of New South Wales, Sydney Workshop on Operator Theoretic Methods in Dynamic Data Analysis and Control IPAM, UCLA, 11–15 February 2019 G. Froyland, UNSW, Sydney Nonautonomous transfer operator methods Status This talk Autonomous Nonautonomous Nonautonomous (finite-time) Nonautonomous (finite-time) – advective limit G. Froyland, UNSW, Sydney Nonautonomous transfer operator methods Key tool: the transfer operator Suppose I have a dynamical system T : X → X . The transformation T tells me how to evolve points, or more generally, sets of points. One can canonically identify a subset A ⊂ X with its indicator function 1A contained in some function space B(X ) (= B). For simplicity, if T is invertible and volume preserving, then the transfer operator (or Perron-Frobenius operator), P : B→B is defined by Pf = f ◦ T −1 for all f ∈B. Why composition with T −1 and not with T ? Set Function Object A 1A −1 Evolved object T (A) P(1A)= 1A ◦ T = 1T (A) More generally, the transfer operator is designed to be the natural push forward of a density under T to another density. G. Froyland, UNSW, Sydney Nonautonomous transfer operator methods Key tool: the transfer operator Suppose I have a dynamical system T : X → X . The transformation T tells me how to evolve points, or more generally, sets of points. One can canonically identify a subset A ⊂ X with its indicator function 1A contained in some function space B(X ) (= B). For simplicity, if T is invertible and volume preserving, then the transfer operator (or Perron-Frobenius operator), P : B→B is defined by Pf = f ◦ T −1 for all f ∈B.
    [Show full text]
  • 4 Analysis of Transfer Operators
    4 Analysis of Transfer Operators In the preceding section we have presented an algorithmic approach to the identification of metastable subsets under the two conditions (C1) and (C2), which are functional analytical statements on the spectrum of the propaga- tor Pτ . In this section, we want to transform these conditions into a more probabilistic language, which will result in establishing equivalent condi- tions on the stochastic transition function. For general Markov processes it 1 is natural to consider Pτ acting on L (µ), the Banach space that includes all probability densities w.r.t. µ. Yet, for reversible Markov processes it is advantageous to restrict the analysis to L2(µ), since the propagator will then be self{adjoint. Therefore, in the first two sections we start with analyzing the conditions (C1) and (C2) in L1(µ), while in the third section, we then 2 concentrate on L (µ). For convenience we use the abbreviation P = Pτ and n p(x; C) = p(τ; x; C) for some fixed time τ > 0. As a consequence, P = Pnτ corresponds to the Markov process sampled at rate τ with stochastic tran- sition function given by pn( ; ) = p(nτ; ; ). The results presented in this section mainly follow [?]. · · · · 4.1 The Spectrum and its Parts Consider a complex Banach space E with norm and denote the spec- trum6 of a bounded linear operator P : E E byk ·σ k(P ). For an eigenvalue λ σ(P ), the multiplicity of λ is defined! as the dimension of the general- ized2 eigenspace; see e.g., [?, Chap. III.6].
    [Show full text]
  • Introduction to the Transfer Operator Method
    Omri Sarig Introduction to the transfer operator method Winter School on Dynamics Hausdorff Research Institute for Mathematics, Bonn, January 2020 Contents 1 Lecture 1: The transfer operator (60 min) ......................... 3 1.1 Motivation . .3 1.2 Definition, basic properties, and examples . .3 1.3 The transfer operator method . .5 2 Lecture 2: Spectral Gap (60 min) ................................ 7 2.1 Quasi–compactness and spectral gap . .7 2.2 Sufficient conditions for quasi-compactness . .9 2.3 Application to continued fractions. .9 3 Lecture 3: Analytic perturbation theory (60 min) . 13 3.1 Calculus in Banach spaces . 13 3.2 Resolvents and eigenprojections . 14 3.3 Analytic perturbations of operators with spectral gap . 15 4 Lecture 4: Application to the Central Limit Theorem (60 min) . 17 4.1 Spectral gap and the central limit theorem . 17 4.2 Background from probability theory . 17 4.3 The proof of the central limit theorem (Nagaev’s method) . 18 5 Lecture 5 (time permitting): Absence of spectral gap (60 min) . 23 5.1 Absence of spectral gap . 23 5.2 Inducing . 23 5.3 Operator renewal theory . 24 A Supplementary material ........................................ 27 A.1 Conditional expectations and Jensen’s inequality . 27 A.2 Mixing and exactness for the Gauss map . 30 A.3 Hennion’s theorem on quasi-compactness . 32 A.4 The analyticity theorem . 40 A.5 Eigenprojections, “separation of spectrum”, and Kato’s Lemma . 41 A.6 The Berry–Esseen “Smoothing Inequality” . 43 1 Lecture 1 The transfer operator 1.1 Motivation A thought experiment Drop a little bit of ink into a glass of water, and then stir it with a tea spoon.
    [Show full text]
  • Reproducing Kernel Hilbert Space Compactification of Unitary Evolution Groups
    Appl. Comput. Harmon. Anal. 54 (2021) 75–136 Contents lists available at ScienceDirect Applied and Computational Harmonic Analysis www.elsevier.com/locate/acha Reproducing kernel Hilbert space compactification of unitary evolution groups Suddhasattwa Das a, Dimitrios Giannakis a,∗, Joanna Slawinska b a Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA b Finnish Center for Artificial Intelligence, Department of Computer Science, University of Helsinki, Helsinki, FI-00014, Finland a r t i c l e i n f o a b s t r a c t Article history: A framework for coherent pattern extraction and prediction of observables of Received 1 April 2019 measure-preserving, ergodic dynamical systems with both atomic and continuous Received in revised form 23 spectral components is developed. This framework is based on an approximation November 2020 of the generator of the system by a compact operator W on a reproducing Accepted 26 February 2021 τ kernel Hilbert space (RKHS). The operator W is skew-adjoint, and thus can Available online 3 March 2021 τ Communicated by E. Le Pennec be represented by a projection-valued measure, discrete by compactness, with an associated orthonormal basis of eigenfunctions. These eigenfunctions are ordered in Keywords: terms of a Dirichlet energy, and provide a notion of coherent observables under the Koopman operators dynamics akin to the Koopman eigenfunctions associated with the atomic part of tWτ Perron-Frobenius operators the spectrum. In addition, Wτ generates a unitary evolution group {e }t∈R on the Ergodic dynamical systems RKHS, which approximates the unitary Koopman group of the system.
    [Show full text]
  • Conservative L-Systems and the Livšic Function 1
    CONSERVATIVE L-SYSTEMS AND THE LIVSICˇ FUNCTION S. BELYI, K. A. MAKAROV, AND E. TSEKANOVSKI˘I Dedicated to Yury Berezansky, a remarkable Mathematician and Human Being, on the occasion of his 90th birthday. Abstract. We study the connection between the classes of (i) Livˇsic functions s(z), i.e., the characteristic functions of densely defined symmetric operators A˙ with de- ficiency indices (1, 1); (ii) the characteristic functions S(z) of a maximal dissipative extension T of A,˙ i.e., the M¨obius transform of s(z) determined by the von Neu- mann parameter κ of the extension relative to an appropriate basis in the deficiency subspaces; and (iii) the transfer functions WΘ(z) of a conservative L-system Θ with the main operator T . It is shown that under a natural hypothesis the functions S(z) 1 − 1 and WΘ(z) are reciprocal to each other. In particular, WΘ(z)= S(z) = s(z) when- ever κ = 0. It is established that the impedance function of a conservative L-system with the main operator T belongs to the Donoghue class if and only if the von Neu- mann parameter vanishes (κ = 0). Moreover, we introduce the generalized Donoghue class and obtain the criteria for an impedance function to belong to this class. We also obtain the representation of a function from this class via the Weyl-Titchmarsh function. All results are illustrated by a number of examples. 1. Introduction Suppose that T is a densely defined closed operator in a Hilbert space such that H its resolvent set ρ(T ) is not empty and assume, in addition, that Dom(T ) Dom(T ∗) is ∩ ˙ ∗ dense.
    [Show full text]