DOCSLIB.ORG

A Proof of Theorem 3 B Operator Norms and the Spectral

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Proof of Theorem 3 B Operator Norms and the Spectral Guo, Kara, Zhang A Proof of Theorem 3 Given the setup in Theorem 3, we first restate (Fill, 1991, Theorem 2.1) (note that the norm in (Fill, 1991)is twice the total variation distance): t 2 (1 λ(R(P ))) P t(σ, ) π − . (10) · − TV ≤ π(σ) ! ! 4e2 ! ! 1 4e2 Let λ := λ(R(P )) and T := log Trel(P )= log . Then it is easy to verify that πmin 1 √1 λ πmin − − " # " # 2 2e T log ≥ λ √π $ min % and by (10), we have that (1 λ)T/2 max P T (σ, ) π − σ Ω · − TV ≤ π ∈ √ min ! ! 1 2e λ− log ! ! (1 λ) √πmin − ! " ≤ √πmin log 2e e− √πmin ! " ≤ √πmin 1 = . 2e In other words, 4e2 T (P ) T = log T (P ). mix ≤ π rel $ min % B Operator Norms and the Spectral Gap We also view the transition matrix P as an operator that mapping functions to functions. More precisely, let f be a function f :Ω R and P acting on f is defined as → Pf(x):= P (x, y)f(y). y Ω &∈ This is also called the Markov operator corresponding to P . We will not distinguish the matrix P from the operator P as it will be clear from the context. Note that Pf(x) is the expectation of f with respect to the distribution P (x, ). We can regard a function f as a column vector in RΩ, in which case Pf is simply matrix · multiplication. Recall (4) and P ∗ is also called the adjoint operator of P .Indeed,P ∗ is the (unique) operator that satisfies f,Pg = P ∗f,g . It is easy to verify that if P satisfies the detailed balanced condition (1), ⟨ ⟩π ⟨ ⟩π then P is self-adjoint, namely P = P ∗. Ω The Hilbert space L2(π) is given by endowing R with the inner product f,g := f(x)g(x)π(x), ⟨ ⟩π x Ω &∈ Ω where f,g R . In particular, the norm in L2(π) is given by ∈ f := f,f . ∥ ∥π ⟨ ⟩π The spectral gap (2) can be rewritten in terms of the operator norm of P ,whichisdefinedby Pf π P π := max ∥ ∥ . ∥ ∥ f =0 f ∥ ∥π ̸ ∥ ∥π Layerwise Systematic Scan Indeed, the operator norm equals the largest eigenvalue (which is just 1 for a transition matrix P ), but we are interested in the second largest eigenvalue. Define the following operator Sπ(σ,τ ):=π(τ). (11) It is easy to verify that S f(σ)= f,1 for any σ. Thus, the only eigenvalues of S are 0 and 1, and the π ⟨ ⟩π π eigenspace of eigenvalue 0 is f L (π): f,1 =0 . This is exactly the union of eigenspaces of P excluding { ∈ 2 ⟨ ⟩π } the eigenvalue 1. Hence, the operator norm of P S equals the second largest eigenvalue of P , namely, − π λ(P )=1 P S . (12) −∥ − π∥π The expression in (12) can be found in, for example, (Ullrich, 2014, Eq. (2.8)). In particular, using (12), we show that the definition (5) coincides with (3)whenP is reversible. Proposition 7. Let P be the transition matrix of a reversible matrix with the stationary distribution π. Then 1 1 = . λ(P ) 1 1 λ(R(P )) − − ' Proof. Since P is reversible, P is self-adjoint, namely, P ∗ = P . Hence (P S )∗ = P ∗ S and − π − π (P S )(P S )∗ =(P S )(P ∗ S ) − π − π − π − π = PP∗ PS S P ∗ + S S − π − π π π = PP∗ S , − π where we use the fact that PSπ = SπP ∗ = SπSπ = Sπ. It implies that 1 λ(R(P )) = R(P ) S (by (12)) − ∥ − π∥π = PP∗ S ∥ − π∥π = (P S )(P S )∗ − π − π π 2 = !P Sπ ! ∥! − ∥π ! =(1 λ(P ))2 . − Rearranging the terms yields the claim. C Proof of Theorem 1 The transition matrix of updating a particular variable x is the following x,s π(σ ) x,s x,s if τ = σ for some s S; s S π(σ ) Tx(σ,τ )= ∈ ∈ (13) (0# otherwise. Moreover, let I be the identity matrix that I(σ,τ )= (σ,τ ). Lemma 8. Let π be a bipartite distribution, and PRU , PAS, Tx be defined as above. Then we have that I 1 1. P = + T . RU 2 2n x x V &∈ n1 n2 2. PAS = Txi Tyj . i=1 j=1 ) ) I Proof. Note that Tx is the transition matrix of resampling σ(x). For PRU ,theterm 2 comes from the fact that the chain is “lazy”. With the other 1/2 probability, we resample σ(x) for a uniformly chosen x V . This explains 1 ∈ the term 2n x V Tx. ∈ For PAS, we* sequentially resample all variables in V1 and then all variables in V2, which yields the expression. Guo, Kara, Zhang Lemma 9. Let π be a bipartite distribution and Tx be defined as above. Then we have that 1. For any x V , T is a self-adjoint operator and idempotent. Namely, T = T ∗ and T T = T . ∈ x x x x x x 2. For any x V , T =1. ∈ ∥ x∥π 3. For any x, x′ V where i =1or 2, T and T commute. In other words T T = T T if x, x′ V for ∈ i x x′ x′ x x x′ ∈ i i =1or 2. Proof. For Item 1, the fact that Tx is self-adjoint follows from the detailed balance condition (1). Idempotence is because updating the same vertex twice is the same as a single update. Item 2 follows from Item 1. This is because 2 T = T T = T T ∗ = T . ∥ x∥π ∥ x x∥π ∥ x x ∥π ∥ x∥π For Item 3, suppose i =1.Sinceπ is bipartite, resampling x or x′ only depends on σ2. Therefore the ordering of updating x or x′ does not matter as they are in the same partition. Define n n I 1 1 I 1 2 P := + T , and P := + T . GS1 2 2n xi GS2 2 2n yj 1 i=1 2 j=1 & & Then, since n1 + n2 = n, 1 P = (n P + n P ) . (14) RU n 1 GS1 2 GS2 Similarly, define n1 n2 PAS1 := Txi , and PAS2 := Tyj . i=1 j=1 ) ) Then PAS = PAS1PAS2. (15) With this notation, Lemma 9 also implies the following. Corollary 10. The following holds: 1. P 1 and P 1. ∥ AS1∥π ≤ ∥ AS2∥π ≤ 2. PAS1PGS1 = PAS1 and PGS2PAS2 = PAS2. Proof. For Item 1, by the submultiplicity of operator norms: n1 n1 PAS1 π = Txi Txi π ∥ ∥ ! ! ≤ ∥ ∥ !i=1 !π i=1 !) ! ) =1!. ! (By Item 2 of Lemma 9) ! ! The claim P 1 follows similarly. ∥ AS2∥π ≤ Layerwise Systematic Scan Item 2 follows from Item 1 and 3 of Lemma 9. We verify the first case as follows. n n 1 I 1 1 P P = T + T AS1 GS1 xi ⎛2 2n xj ⎞ i=1 1 j=1 ) & n n n 1 1 ⎝ 1 1 ⎠ 1 = T + T T 2 · xi 2n · xi xj i=1 1 i=1 j=1 ) ) & n n n 1 1 1 1 1 = T + T T 2 · xi 2n · xj xi i=1 1 j=1 i=1 ) & ) n n 1 1 1 1 = Tx + Tx Tx Tx Tx Tx (By Item 3 of Lemma 9) 2 · i 2n · 1 2 ··· j j ··· n1 i=1 1 j=1 ) & n n n 1 1 1 1 1 = T + T (By Item 1 of Lemma 9) 2 · xi 2n · xi i=1 1 j=1 i=1 ) & ) n n 1 1 1 1 = T + T 2 · xi 2 · xi i=1 i=1 ) ) = PAS1. The other case is similar. Item 2 of Corollary 10 captures the following intuition: if we sequentially update all variables in Vi for i =1, 2, then an extra individual update either before or after does not change the distribution. Recall Eq. (5). Lemma 11. Let π be a bipartite distribution and PRU and PAS be defined as above. Then we have that R(P ) S P S 2 . ∥ AS − π∥π ≤∥ RU − π∥π Proof. Recall (11), the definition of Sπ, using which it is easy to see that PAS1Sπ = SπPAS2 = SπSπ = Sπ. (16) Thus, n n P (P S )P = P 1 P + 2 P S P (By (14)) AS1 RU − π AS2 AS1 n GS1 n GS2 − π AS2 n1 " n2 # = P P P + P P P P S P n AS1 GS1 AS2 n AS1 GS2 AS2 − AS1 π AS2 n n = 1 P P + 2 P P S (By Item 2 of Cor 10) n AS1 AS2 n AS1 AS2 − π = P P S AS1 AS2 − π = P S , (17) AS − π where in the last step we use (15). Moreover, we have that n1 n2 ∗ P ∗ = T T AS ⎛ xi yj ⎞ i=1 j=1 ) ) ⎝n2 n1 ⎠ = Ty∗n +1 j Tx∗n +1 i 2 − 1 − j=1 i=1 ) ) n2 n1 = Tyn +1 j Txn +1 i (By Item 1 of Lemma 9) 2 − 1 − j=1 i=1 ) ) n2 n1 = Tyj Txi (By Item 3 of Lemma 9) j=1 i=1 ) ) = PAS2PAS1. Guo, Kara, Zhang Hence, similarly to (17), we have that P (P S )P = P P S AS2 RU − π AS1 AS2 AS1 − π = P ∗ S . (18) AS − π Using (16), we further verify that (P S )(P ∗ S )=P P ∗ P S S P ∗ + S S AS − π AS − π AS AS − AS π − π AS π π = P P ∗ S (19) AS AS − π Combining (17), (18), and (19), we see that R(P ) S = P P ∗ S ∥ AS − π∥π ∥ AS AS − π∥π = (P S )(P ∗ S ) ∥ AS − π AS − π ∥π = P (P S ) P P (P S ) P ∥ AS1 RU − π AS2 AS2 RU − π AS1∥π P P S P P P S P ≤∥ AS1∥π ∥ RU − π∥π ∥ AS2∥π ∥ AS2∥π ∥ RU − π∥π ∥ AS1∥π P S 2 , ≤∥ RU − π∥π where the first inequality is due to the submultiplicity of operator norms, and we use Item 1 of Corollary 10 in the last line.
Load more

Recommended publications
  • Spectral Gap and Asymptotics for a Family of Cocycles of Perron-Frobenius Operators
    Spectral gap and asymptotics for a family of cocycles of Perron-Frobenius operators by Joseph Anthony Horan MSc, University of Victoria, 2015 BMath, University of Waterloo, 2013 A Dissertation Submitted in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY in the Department of Mathematics and Statistics c Joseph Anthony Horan, 2020 University of Victoria All rights reserved. This dissertation may not be reproduced in whole or in part, by photocopying or other means, without the permission of the author. We acknowledge with respect the Lekwungen peoples on whose traditional territory the university stands, and the Songhees, Esquimalt, and WSANE´ C´ peoples whose ¯ historical relationships with the land continue to this day. Spectral gap and asymptotics for a family of cocycles of Perron-Frobenius operators by Joseph Anthony Horan MSc, University of Victoria, 2015 BMath, University of Waterloo, 2013 Supervisory Committee Dr. Christopher Bose, Co-Supervisor (Department of Mathematics and Statistics) Dr. Anthony Quas, Co-Supervisor (Department of Mathematics and Statistics) Dr. Sue Whitesides, Outside Member (Department of Computer Science) ii ABSTRACT At its core, a dynamical system is a set of things and rules for how they change. In the study of dynamical systems, we often ask questions about long-term or average phe- nomena: whether or not there is an equilibrium for the system, and if so, how quickly the system approaches that equilibrium. These questions are more challenging in the non-autonomous (or random) setting, where the rules change over time. The main goal of this dissertation is to develop new tools with which to study random dynamical systems, and demonstrate their application in a non-trivial context.
    [Show full text]
  • Nonlinear Spectral Calculus and Super-Expanders
    NONLINEAR SPECTRAL CALCULUS AND SUPER-EXPANDERS MANOR MENDEL AND ASSAF NAOR Abstract. Nonlinear spectral gaps with respect to uniformly convex normed spaces are shown to satisfy a spectral calculus inequality that establishes their decay along Ces`aroaver- ages. Nonlinear spectral gaps of graphs are also shown to behave sub-multiplicatively under zigzag products. These results yield a combinatorial construction of super-expanders, i.e., a sequence of 3-regular graphs that does not admit a coarse embedding into any uniformly convex normed space. Contents 1. Introduction 2 1.1. Coarse non-embeddability 3 1.2. Absolute spectral gaps 5 1.3. A combinatorial approach to the existence of super-expanders 5 1.3.1. The iterative strategy 6 1.3.2. The need for a calculus for nonlinear spectral gaps 7 1.3.3. Metric Markov cotype and spectral calculus 8 1.3.4. The base graph 10 1.3.5. Sub-multiplicativity theorems for graph products 11 2. Preliminary results on nonlinear spectral gaps 12 2.1. The trivial bound for general graphs 13 2.2. γ versus γ+ 14 2.3. Edge completion 18 3. Metric Markov cotype implies nonlinear spectral calculus 19 4. An iterative construction of super-expanders 20 5. The heat semigroup on the tail space 26 5.1. Warmup: the tail space of scalar valued functions 28 5.2. Proof of Theorem 5.1 31 5.3. Proof of Theorem 5.2 34 5.4. Inverting the Laplacian on the vector-valued tail space 37 6. Nonlinear spectral gaps in uniformly convex normed spaces 39 6.1.
    [Show full text]
  • Spectral Gap and Definability
    SPECTRAL GAP AND DEFINABILITY ISAAC GOLDBRING ABSTRACT. We relate the notions of spectral gap for unitary representations and subfactors with definability of certain important sets in the corresponding structures. We give several applications of this relationship. CONTENTS 1. Introduction 2 1.1. A crash course in continuous logic 3 2. Definability in continuous logic 5 2.1. Generalities on formulae 5 2.2. Definability relative to a theory 7 2.3. Definability in a structure 9 3. Spectral gap for unitary group representations 11 3.1. Generalities on unitary group representations 11 3.2. Introducing spectral gap 12 3.3. Spectral gap and definability 13 3.4. Spectral gap and ergodic theory 15 4. Basic von Neumann algebra theory 17 4.1. Preliminaries 17 4.2. Tracial von Neumann algebras as metric structures 19 4.3. Property Gamma and the McDuff property 20 5. Spectral gap subalgebras 21 5.1. Introducing spectral gap for subalgebras 21 arXiv:1805.02752v1 [math.LO] 7 May 2018 5.2. Spectral gap and definability 22 5.3. Relative bicommutants and e.c. II1 factors 23 5.4. Open questions 24 6. Continuum many theories of II1 factors 25 6.1. The history and the main theorem 25 6.2. The base case 26 6.3. A digression on good unitaries and generalized McDuff factors 27 6.4. The inductive step 28 References 29 Goldbring’s work was partially supported by NSF CAREER grant DMS-1349399. 1 2 ISAAC GOLDBRING 1. INTRODUCTION The notion of definable set is one of (if not the) most important concepts in clas- sical model theory.
    [Show full text]
  • Spectral Perturbation Bounds for Selfadjoint Operators I∗
    Spectral perturbation bounds for selfadjoint operators I∗ KreˇsimirVeseli´c† Abstract We give general spectral and eigenvalue perturbation bounds for a selfadjoint op- erator perturbed in the sense of the pseudo-Friedrichs extension. We also give sev- eral generalisations of the aforementioned extension. The spectral bounds for finite eigenvalues are obtained by using analyticity and monotonicity properties (rather than variational principles) and they are general enough to include eigenvalues in gaps of the essential spectrum. 1 Introduction The main purpose of this paper is to derive spectral and eigenvalue bounds for selfadjoint operators. If a selfadjoint operator H in a Hilbert space H is perturbed into T = H + A (1) with, say, a bounded A then the well-known spectral spectral inclusion holds σ(T ) ⊆ {λ : dist(λ, σ(H)) ≤ kAk} . (2) Here σ denotes the spectrum of a linear operator. (Whenever not otherwise stated we shall follow the notation and the terminology of [3].) If H, A, T are finite Hermitian matrices then (1) implies |µk − λk| ≤ kAk, (3) where µk, λk are the non-increasingly ordered eigenvalues of T,H, respectively. (Here and henceforth we count the eigenvalues together with their multiplicities.) Whereas (2) may be called an upper semicontinuity bound the estimate (3) contains an existence statement: each of the intervals [λk − kAk, λk + kAk] contains ’its own’ µk. Colloquially, bounds like (2) may be called ’one-sided’ and those like (3) ’two-sided’. As it is well-known (3) can be refined to another two-sided bound min σ(A) ≤ µk − λk ≤ max σ(A). (4) In [9] the following ’relative’ two-sided bound was derived |µk − λk| ≤ b|λk|, (5) ∗This work was partly done during the author’s stay at the University of Split, Faculty of Electrotechnical Engineering, Mechanical Engineering and Naval Archtecture while supported by the National Foundation for Science, Higher Education and Technological Development of the Republic of Croatia.
    [Show full text]
  • UCLA Electronic Theses and Dissertations
    UCLA UCLA Electronic Theses and Dissertations Title Spectral Gap Rigidity and Unique Prime Decomposition Permalink https://escholarship.org/uc/item/1j63188h Author Winchester, Adam Jeremiah Publication Date 2012 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California University of California Los Angeles Spectral Gap Rigidity and Unique Prime Decomposition A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Mathematics by Adam Jeremiah Winchester 2012 c Copyright by Adam Jeremiah Winchester 2012 Abstract of the Dissertation Spectral Gap Rigidity and Unique Prime Decomposition by Adam Jeremiah Winchester Doctor of Philosophy in Mathematics University of California, Los Angeles, 2012 Professor Sorin Popa, Chair We use malleable deformations combined with spectral gap rigidity theory, in the framework of Popas deformation/rigidity theory to prove unique tensor product decomposition results for II1 factors arising as tensor product of wreath product factors and free group factors. We also obtain a similar result regarding measure equivalence decomposition of direct products of such groups. ii The dissertation of Adam Jeremiah Winchester is approved. Dimitri Shlyakhtenko Yehuda Shalom Jens Palsberg Sorin Popa, Committee Chair University of California, Los Angeles 2012 iii To All My Friends iv Table of Contents 1 Introduction :::::::::::::::::::::::::::::::::::::: 1 2 Preliminaries ::::::::::::::::::::::::::::::::::::: 8 2.1 Intro to von Neumann Algebras . 8 2.2 von Neumann Subalgebras . 13 2.3 GNS and Bimodules . 14 2.4 The Basic Construction . 17 2.5 S-Malleable Deformations . 18 2.6 Spectral Gap Rigidity . 20 2.7 Intertwining By Bimodules . 20 3 Relative Amenability :::::::::::::::::::::::::::::::: 22 3.1 Definition .
    [Show full text]
  • Eigenvalues in Spectral Gaps of Differential Operators
    J. Spectr. Theory 2 (2012), 293–320 Journal of Spectral Theory DOI 10.4171/JST/30 © European Mathematical Society Eigenvalues in spectral gaps of differential operators Marco Marletta1 and Rob Scheichl Abstract. Spectral problems with band-gap spectra arise in numerous applications, including the study of crystalline structures and the determination of transmitted frequencies in pho- tonic waveguides. Numerical discretization of these problems can yield spurious results, a phenomenon known as spectral pollution. We present a method for calculating eigenvalues in the gaps of self-adjoint operators which avoids spectral pollution. The method perturbs the problem into a dissipative problem in which the eigenvalues to be calculated are lifted out of the convex hull of the essential spectrum, away from the spectral pollution. The method is analysed here in the context of one-dimensional Schrödinger equations on the half line, but is applicable in a much wider variety of contexts, including PDEs, block operator matrices, multiplication operators, and others. Mathematics Subject Classification (2010). 34L, 65L15. Keywords. Eigenvalue, spectral pollution, self-adjoint, dissipative, Schrödinger, spectral gap, spectral band, essential spectrum, discretization, variational method. 1. Introduction In the numerical calculation of the spectrum of a self-adjoint operator, one of the most difficult cases to treat arises when the spectrum has band-gap structure and one wishes to calculate eigenvalues in the spectral gaps above the infimum of the essential spectrum. The reason for this difficulty is that variational methods will generally result in spectral pollution (see, e.g., Rappaz, Sanchez Hubert, Sanchez Palencia and Vassiliev [22]): following discretization, the spectral gaps fill up with eigenvalues of the discrete problem which are so closely spaced that it is impossible to distinguish the spectral bands from the spectral gaps.
    [Show full text]
  • Notes by Fred Naud
    HECKE OPERATORS AND SPECTRAL GAPS ON COMPACT LIE GROUPS. FRED´ ERIC´ NAUD, EXTENDED VERSION OF TALK AT PEYRESQ, MAY 22TH 2016 Abstract. In these notes we review some of the recent progress on questions related to spectral gaps of Hecke operators on compact Lie groups. In particular, we discuss the historical Ruziewicz problem that motivated the discovery of the first examples, followed by the work of Gamburd-Jakobson-Sarnak [5], Bourgain-Gamburd [3],[2] and also the recent paper of Benoist-Saxc´e[1]. 1. Introduction Let G be a compact connected Lie Group whose normalized Haar measure is denoted by m. Let µ be a probability measure on G. On the Hilbert space L2(G; dm), we define a convolution operator by Z Tµ(f)(x) := f(xg)dµ(g): G 2 2 We can check easily that Tµ : L ! L is bounded linear with norm 1. The constant function 1 is an obvious eigenfunction related to the eigenvalue 1. If in addition µ is symmetric i.e. −1 µ(A ) = µ(A) for all Borel set A, then Tµ is self-adjoint. The main purpose of these notes is the following question. Set Z 2 2 L0(G) := f 2 L (G): fdm = 0 : G 2 Clearly L0 is a closed Tµ-invariant space. If we have (ρsp is the spectral radius) ρsp(Tµj 2 ) < 1; L0 then we say that Tµ has a spectral gap. There is an easy case: if µ is symmetric and has a continuous density with respect to Haar, then by Ascoli-Arzuela Tµ is a compact operator and one can check that 1 is a simple eigenvalue while −1 is not in the spectrum.
    [Show full text]
  • Spectral Algorithms
    Spectral Algorithms Ravindran Kannan Santosh Vempala August, 2009 ii Summary. Spectral methods refer to the use of eigenvalues, eigenvectors, sin- gular values and singular vectors. They are widely used in Engineering, Ap- plied Mathematics and Statistics. More recently, spectral methods have found numerous applications in Computer Science to \discrete" as well \continuous" problems. This book describes modern applications of spectral methods, and novel algorithms for estimating spectral parameters. In the first part of the book, we present applications of spectral methods to problems from a variety of topics including combinatorial optimization, learning and clustering. The second part of the book is motivated by efficiency considerations. A fea- ture of many modern applications is the massive amount of input data. While sophisticated algorithms for matrix computations have been developed over a century, a more recent development is algorithms based on \sampling on the fly” from massive matrices. Good estimates of singular values and low rank ap- proximations of the whole matrix can be provably derived from a sample. Our main emphasis in the second part of the book is to present these sampling meth- ods with rigorous error bounds. We also present recent extensions of spectral methods from matrices to tensors and their applications to some combinatorial optimization problems. Contents I Applications 1 1 The Best-Fit Subspace 3 1.1 Singular Value Decomposition . .4 1.2 Algorithms for computing the SVD . .8 1.3 The k-variance problem . .8 1.4 Discussion . 11 2 Mixture Models 13 2.1 Probabilistic separation . 14 2.2 Geometric separation . 14 2.3 Spectral Projection .
    [Show full text]
  • On Hyperboundedness and Spectrum of Markov Operators
    On hyperboundedness and spectrum of Markov operators Laurent Miclo Institut de Math´ematiques de Toulouse Plan of the talk 1 Høegh-Krohn and Simon’s conjecture 2 Higher order Cheeger inequalities in the finite setting 3 An approximation procedure 4 General higher order Cheeger’s inequalities 5 Quantitative links between hyperboundedness and spectrum Reversible Markov operators On a probability space S, S,µ , a self-adjoint operator 2 2 p q M : L µ L µ is said to be Markovian if µ-almost surely, p qÑ p q 2 f L µ , f 0 M f 0 @ P p q ě ñ r sě M 1 1 r s “ So M admits a spectral decomposition: there exists a projection-valued measure El 1 1 such that p qlPr´ , s 1 M l dEl “ 1 ż´ and M is said to be ergodic if 2 f L µ , Mf f f Vect 1 @ P p q “ ñ P p q 2 namely if E1 E1 L µ Vect 1 . p ´ ´qr p qs “ p q Hyperboundedness Stronger requirement: M has a spectral gap if there exists λ 0 2 ą such that E1 E1 λ L µ Vect 1 . Spectral gap: the p ´ ´ qr p qs “ p q supremum of such λ. The Markov operator M is hyperbounded if there exists p 2 such ą that M L2 Lp } } pµqÑ pµq ă `8 Theorem A self-adjoint ergodic and hyperbounded Markovian operator admits a spectral gap. This result was conjectured by Høegh-Krohn and Simon [1972], in the context of Markovian semi-groups.
    [Show full text]
  • Spectral Deformations of One-Dimensional Schrö
    SPECTRAL DEFORMATIONS OF ONE-DIMENSIONAL SCHRODINGER OPERATORS E GESZTESY, B. SIMON* AND G. TESCHL Abstract. We provide a complete spectral characterization of a new method of constructing isospectral (in fact, unitary) deformations of general Schrrdinger operators H = -d2/d.x 2 + V in L2(/l~). Our technique is connected to Dirichlet data, that is, the spectrum of the operator H D on L2((-~,x0)) @ L2((x0, oo)) with a Difichlet boundary condition at x 0. The transformation moves a single eigenvalue of H D and perhaps flips which side of x 0 the eigenvalue lives. On the remainder of the spectrum, the transformation is realized by a unitary operator. For cases such as V(x) ---, ~ as Ixl --" ~, where V is uniquely determined by the spectrum of H and the Dirichlet data, our result implies that the specific Dirichlet data allowed are determined only by the asymptotics as E ~ oo. w Introduction Spectral deformations of Schrrdinger operators in L2(/R), isospectral and cer- tain classes of non-isospectral ones, have attracted a lot of interest over the past three decades due to their prominent role in connection with a variety of top- ics, including the Korteweg-de Vries (KdV) hierarchy, inverse spectral problems, supersymmetric quantum mechanical models, level comparison theorems, etc. In fact, the construction of N-soliton solutions of the KdV hierarchy (and more gener- ally, the construction of solitons relative to reflectionless backgrounds) is a typical example of a non-isospectral deformation of H = -d2/dx 2 in L2(R) since the resulting deformation [1 = -d2/dx 2 + re" acquires an additional point spectrum {A1,..., Au} C (-e~, O) such that o'(H) = or(H) tO {A1,..., AN} (cr(.) abbreviating the spectrum).
    [Show full text]
  • QMATH14: Mathematical Results in Quamtum Physics – Abstracts
    QMath14: Mathematical Results in Quantum Physics Aarhus University, 12–16 August 2019 Programme and abstracts – including posters Programme . .next page Abstracts . page 18 Posters . page 63 http://conferences.au.dk/qmath14/ Last update: 2019-08-13 09:53:41 Foto: Anders Trærum, AU Communication Programme Monday, 12 August 09:00–12:00 Mini course A quantum information travel guide for mathematicians Lecturer: David Pérez García Location: Aud E (1533.103) 12:00–14:00 Lunch Location: MATH Canteen (1536, ground floor) 14:00–15:00 Plenary talk Zeno and the bomb Michael Wolf Chair: Pavel Exner Location: Aud E (1533.103) 15:00–15:30 Coffee break 15:30–16:30 Plenary talk An update on Many-Body Localization Wojciech De Roeck Chair: Pavel Exner Location: Aud E (1533.103) 16:30–17:00 Break 17:00– Welcome reception 1 Tuesday, 13 August 09:30–10:30 Plenary talk Quantized quantum transport in interacting systems Sven Bachmann Chair: Simone Warzel Location: Aud E (1533.103) 10:30–11:00 Break 11:00–12:00 Plenary talk Universal Singularities of Random Matrices Torben Krüger Chair: Simone Warzel Location: Aud E (1533.103) 12:00–14:00 Lunch Location: MATH Canteen (1536, ground floor) 14:00–15:30 Parallel sessions – Main speakers Spectral Theory in Aud F (1534.125) see page 8 Quantum Information in Aud G1 (1532.116) see page 9 Many-Body Systems in Aud G2 (1532.122) see page 10 Random Systems in Koll G3 (1532.218) see page 11 Condensed Matter in Koll G4 (1532.222) see page 12 15:30–16:00 Coffee break 2 16:00–17:55 Parallel sessions – Contributed speakers Spectral
    [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]