Lecture Notes in Mathematics Editors: J.-M. Morel, Cachan F. Takens, Groningen B. Teissier, Paris
1954
Philippe Biane · Luc Bouten · Fabio Cipriani Norio Konno · Nicolas Privault · Quanhua Xu
Quantum Potential Theory Editors: Michael Schürmann Uwe Franz
ABC
Editors Uwe Franz
Michael Schürmann
Département de mathématiques de Besancon Université de Franche-Comté 16, route de Gray 25030 Besancon cedex France
[email protected] and Graduate School of Information Sciences Tohoku University 6-3-09 Aramaki-Aza-Aoba, Aoba-ku Sendai 980-8579 Japan
Institut für Mathematik und Informatik Ernst-Moritz-Arndt-Universität Greifswald Jahnstrasse 15a 17487 Greifswald Germany
[email protected]
ISBN: 978-3-540-69364-2 e-ISBN: 978-3-540-69365-9 DOI: 10.1007/978-3-540-69365-9 Lecture Notes in Mathematics ISSN print edition: 0075-8434 ISSN electronic edition: 1617-9692 Library of Congress Control Number: 2008932185 Mathematics Subject Classification (2000): 58B34, 81R60, 31C12, 53C21 c 2008 Springer-Verlag Berlin Heidelberg This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: SPi Publishing Services Printed on acid-free paper 9 8 7 6 5 4 3 2 1 springer.com
Preface
This volume contains the notes of lectures given at the School “Quantum Potential Theory: Structure and Applications to Physics”. This school was held at the Alfried Krupp Wissenschaftskolleg in Greifswald from February 26 to March 9, 2007. We thank the lecturers for the hard work they accomplished in preparing and giving these lectures and in writing these notes. Their lectures give an introduction to current research in their domains, which is essentially self-contained and should be accessible to Ph.D. students. We hope that this volume will help to bring together researchers from the areas of classical and quantum probability, functional analysis and operator algebras, and theoretical and mathematical physics, and contribute in this way to developing further the subject of quantum potential theory. We are greatly indebted to the Alfried Krupp von Bohlen und HalbachStiftung for the financial support, without which the school would not have been possible. We are also very thankful for the support by the University of Greifswald and the University of Franche-Comt´e. One of the organisers (UF) was supported by a Marie Curie Outgoing International Fellowship of the EU (Contract Q-MALL MOIF-CT-2006-022137). Special thanks go to Melanie Hinz who helped with the preparation and organisation of the school and who took care of all of the logistics. Finally, we would like to thank all the students for coming to Greifswald and helping to make the school a success. Sendai and Greifswald, June 2008
Uwe Franz Michael Sch¨ urmann
v
Contents
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1
Potential Theory in Classical Probability . . . . . . . . . . . . . . . . . . . . . Nicolas Privault 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Analytic Potential Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Markov Processes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 Stochastic Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Probabilistic Interpretations . . . . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3
Introduction to Random Walks on Noncommutative Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Philippe Biane 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Noncommutative Spaces and Random Variables . . . . . . . . . . . 3 Quantum Bernoulli Random Walks . . . . . . . . . . . . . . . . . . . . . . 4 Bialgebras and Group Algebras . . . . . . . . . . . . . . . . . . . . . . . . . 5 Random Walk on the Dual of SU (2) . . . . . . . . . . . . . . . . . . . . . 6 Random Walks on Duals of Compact Groups . . . . . . . . . . . . . 7 The Case of SU (n) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Choquet-Deny Theorem for Duals of Compact Groups . . . . . 9 The Martin Compactification of the Dual of SU (2) . . . . . . . . 10 Central Limit Theorems for the Bernoulli Random Walk . . . 11 The Heisenberg Group and the Noncommutative Brownian Motion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 Dilations for Noncompact Groups . . . . . . . . . . . . . . . . . . . . . . . 13 Pitman’s Theorem and the Quantum Group SUq (2) . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
3 4 24 31 46 58 61 61 62 68 73 76 80 82 87 90 94 100 106 110 114
vii
viii
Contents
Interactions between Quantum Probability and Operator Space Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Quanhua Xu 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Completely Positive Maps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Concrete Operator Spaces and Completely Bounded Maps . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 Ruan’s Theorem: Abstract Operator Spaces . . . . . . . . . . . . . . 5 Complex Interpolation and Operator Hilbert Spaces . . . . . . . 6 Vector-valued Noncommutative Lp -spaces . . . . . . . . . . . . . . . . 7 Noncommutative Khintchine Type Inequalities . . . . . . . . . . . . 8 Embedding of OH into Noncommutative L1 . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Dirichlet Forms on Noncommutative Spaces . . . . . . . . . . . . . . . . . . Fabio Cipriani 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Dirichlet Forms on C∗ -algebras and KMS-symmetric Semigroups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Dirichlet Forms in Quantum Statistical Mechanics . . . . . . . . . 4 Dirichlet Forms and Differential Calculus on C∗ -algebras . . . 5 Noncommutative Potential Theory and Riemannian Geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 Dirichlet Forms and Noncommutative Geometry . . . . . . . . . . 7 Appendix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 List of Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Applications of Quantum Stochastic Processes in Quantum Optics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Luc Bouten 1 Quantum Probability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Conditional Expectations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Quantum Stochastic Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 Quantum Filtering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Quantum Walks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Norio Konno Part I: Discrete-Time Quantum Walks 1 Limit Theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Disordered Case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Reversible Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . 4 Quantum Cellular Automata . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Cycle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 Absorption Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
117 117 119 120 126 130 132 137 156 158 161 161 168 218 224 245 259 265 270 272 277 277 286 290 298 306 309
311 350 357 368 377 387
Contents
Part II: Continuous-Time Quantum Walks 7 One-Dimensional Lattice . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Tree . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Ultrametric Space . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 Cycle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
ix
401 410 420 432 441
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453
Contributors
Philippe Biane Institut d’´electronique et d’informatique Gaspard-Monge, 77454 Marne-laVall´ee Cedex 2, France
[email protected] Luc Bouten Caltech Physical Measurement and Control, MC 266-33, 1200 E California Blvd, Pasadena, CA 91125, USA
[email protected] Fabio Cipriani Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci, 32 I-20133 Milano, Italy
[email protected] Norio Konno Department of Applied Mathematics, Yokohama National University, 79-5 Tokiwadai, Yokohama 240-8501, Japan
[email protected] Nicolas Privault Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong, Hong Kong
[email protected] Quanhua Xu UFR Sciences et techniques, Universit´e de Franche-Comt´e, 16, route de Gray, F-25 030 Besan¸con Cedex, France
[email protected]
xi
Introduction
The term potential theory comes from 19th century physics, where the fundamental forces like gravity or electrostatic forces were described as the gradients of potentials, i.e. functions which satisfy the Laplace equation. Hence potential theory was the study of solutions of the Laplace equation. Nowadays the fundamental forces in physics are described by systems of non-linear partial differential equations such as the Einstein equations and the Yang-Mills equations, and the Laplace equation arises only as a limiting case. Nevertheless, the Laplace equation is still used in applications in many areas of physics and engineering like heat conduction and electrostatics. And the term “potential theory” has survived as a convenient label for the theory of functions satisfying the Laplace equation, i.e. so-called harmonic functions. In the 20th century, with the development of probability and stochastic processes, it was discovered that potential theory is intimately related to the theory of Markov processes, in particular diffusion processes and Brownian motion. The distributions of these processes evolve according to a heat equation, and invariant distributions satisfy a Laplace-type equation. Conversely, these processes can be used to express solutions of, e.g., the Laplace equation. For more details see Nicolas Privault’s lecture “Potential Theory in Classical Probability” in this volume. The notions of quantum stochastic processes and quantum Markov processes were introduced in the 1970’s and allow to describe open quantum systems in close analogy to classical probability and classical Markov processes. Roughly speaking, one can now recognize two different trends in the subsequent development of the theory of quantum Markov processes. The first is guided by physical applications, studies concrete physically motivated models, and develops tools for filtering noisy quantum signals or controling noisy quantum systems. The second aims to develop a mathematical theory, by generalizing or extending key results of the theory of Markov processes to the quantum (or noncommutative) case, and by looking for analogues of important tools that greatly influenced the development of classical potential theory, like stochastic calculus, Dirichlet forms, or boundaries of random U. Franz, M. Sch¨ urmann (eds.) Quantum Potential Theory. Lecture Notes in Mathematics 1954. c Springer-Verlag Berlin Heidelberg 2008
1
2
Introduction
walks. In our school the first direction was represented by Luc Bouten’s lecture “Applications of Controlled Quantum Processes in Quantum Optics”, the second by Philippe Biane’s lecture “Introduction to Random Walks on Noncommutative Spaces” and by Fabio Cipriani’s lecture “Noncommutative Dirichlet Forms”, see also the corresponding chapters of this book. Besides providing important background material on operator algebras and noncommutative analogues of function spaces used in other lectures, Quanhua Xu’s lecture on “Interactions between Quantum Probability and Operator Space Theory” shows how quantum probability can be applied to modern functional analysis. For example, a clever choice of sequences of quantum random variables plays an essential role in establishing key results like noncommutative Khintchine type inequalities. Central questions from probabilistic potential theory like the computation of hitting times and the study of the asymptotic behaviour of a walk are also the main topic in Norio Konno’s lecture on “Quantum Walks”. These quantum walks are not quantum Markov processes in the sense of the lectures by Biane, Bouten, and Cipriani, but another type of quantum analogue of random walks and Markov chains, and many of the classical potential theoretical methods have interesting analogues adapted to this case. By giving an introduction and survey of this quickly developing field this lecture was an enrichment of the school and nicely complements the other chapters. The goal of the School “Quantum Potential Theory: Structure and Applications to Physics” and these lecture notes is two-fold. First of all we want to provide an introduction to the rapidly developing theory of quantum Markov semigroups and quantum Markov processes with its manifold aspects ranging from functional analysis and probability theory to quantum physics. We hope that we have succeeded in preparing a monograph that is accessible to graduate students in mathematics and physics. But furthermore we also hope that this book will catch the interest of experienced mathematicians and physicists working in this field or related fields, in order to stimulate more communication between researchers working on “pure” and “applied” aspects. We believe that a strong collaboration between these communities will be to everybody’s benefit. Keeping in mind the physical applications will help to sharpen the theoreticians’ eye for the relevant questions and properties, and new powerful mathematical tools will allow to get a better and deeper understanding of concrete physical systems.
Potential Theory in Classical Probability Nicolas Privault
Abstract These notes are an elementary introduction to classical potential theory and to its connection with probabilistic tools such as stochastic calculus and the Markov property. In particular we review the probabilistic interpretations of harmonicity, of the Dirichlet problem, and of the Poisson equation using Brownian motion and stochastic calculus.
1 Introduction The origins of potential theory can be traced to the physical problem of reconstructing a repartition of electric charges inside a planar or a spatial domain, given the measurement of the electrical field created on the boundary of this domain. In mathematical analytic terms this amounts to representing the values of a function h inside a domain given the data of the values of h on the boundary of the domain. In the simplest case of a domain empty of electric charges, the problem can be formulated as that of finding a harmonic function h on E (roughly speaking, a function with vanishing Laplacian, see § 2.2 below), given its values prescribed by a function f on the boundary ∂E, i.e. as the Dirichlet problem: ⎧ y ∈ E, ⎨ ∆h(y) = 0, ⎩
h(y) = f (y),
y ∈ ∂E.
N. Privault Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong, Hong Kong e-mail:
[email protected] U. Franz, M. Sch¨ urmann (eds.) Quantum Potential Theory. Lecture Notes in Mathematics 1954. c Springer-Verlag Berlin Heidelberg 2008
3
4
N. Privault
Close connections between the notion of potential and the Markov property have been observed at early stages of the development of the theory, see e.g. [Doo84] and references therein. Thus a number of potential theoretic problems have a probabilistic interpretation or can be solved by probabilistic methods. These notes aim at gathering both analytic and probabilistic aspects of potential theory into a single document. We partly follow the point of view of Chung [Chu95] with complements on analytic potential theory coming from Helms [Hel69], some additions on stochastic calculus, and probabilistic applications found in Bass [Bas98]. More precisely, we proceed as follow. In Section 2 we give a summary of classical analytic potential theory: Green kernels, Laplace and Poisson equations in particular, following mainly Brelot [Bre65], Chung [Chu95] and Helms [Hel69]. Section 3 introduces the Markovian setting of semigroups which will be the main framework for probabilistic interpretations. A sample of references used in this domain is Ethier and Kurtz [EK86], Kallenberg [Kal02], and also Chung [Chu95]. The probabilistic interpretation of potential theory also makes significant use of Brownian motion and stochastic calculus. They are summarized in Section 4, see Protter [Pro05], Ikeda and Watanabe [IW89], however our presentation of stochastic calculus is given in the framework of normal martingales due to their links with quantum stochastic calculus, cf. Biane [Bia93]. In Section 5 we present the probabilistic connection between potential theory and Markov processes, following Bass [Bas98], Dynkin [Dyn65], Kallenberg [Kal02], and Port and Stone [PS78]. Our description of the Martin boundary in discrete time follows that of Revuz [Rev75].
2 Analytic Potential Theory 2.1 Electrostatic Interpretation Let E denote a closed region of Rn , more precisely a compact subset having a smooth boundary ∂E with surface measure σ. Gauss’s law is the main tool for determining a repartition of electric charges inside E, given the values of the electrical field created on ∂E. It states that given a repartition of charges q(dx) the flux of the electric field U across the boundary ∂E is proportional to the sum of electric charges enclosed in E. Namely we have q(dx) = 0 n(x), U(x)σ(dx), (2.1) E
∂E
where q(dx) is a signed measure representing the distribution of electric charges, 0 > 0 is the electrical permittivity constant, U(x) denotes the
Potential Theory in Classical Probability
5
electric field at x ∈ ∂E, and n(x) represents the outer (i.e. oriented towards the exterior of E) unit vector orthogonal to the surface ∂E. On the other hand the divergence theorem, which can be viewed as a particular case of the Stokes theorem, states that if U : E → Rn is a C 1 vector field we have div U(x)dx = n(x), U(x)σ(dx), (2.2) E
∂E
where the divergence div U is defined as div U(x) =
n ∂Ui i=1
∂xi
(x).
The divergence theorem (2.2) can be interpreted as a mathematical formulation of the Gauss law (2.1). Under this identification, div U(x) is proportional to the density of charges inside E, which leads to the Maxwell equation 0 div U(x)dx = q(dx),
(2.3)
where q(dx) is the distribution of electric charge at x and U is viewed as the induced electric field on the surface ∂E. When q(dx) has the density q(x) at x, i.e. q(dx) = q(x)dx, and the field U(x) derives from a potential V : Rn → R+ , i.e. when U(x) = ∇V (x),
x ∈ E,
Maxwell’s equation (2.3) takes the form of the Poisson equation: x ∈ E,
0 ∆V (x) = q(x),
(2.4)
where the Laplacian ∆ = div ∇ is given by ∆V (x) =
n ∂2V j=1
∂x2i
(x),
x ∈ E.
In particular, when the domain E is empty of electric charges, the potential V satisfies the Laplace equation ∆V (x) = 0
x ∈ E.
As mentioned in the introduction, a typical problem in classical potential theory is to recover the values of the potential V (x) inside E from its values on the boundary ∂E, given that V (x) satisfies the Poisson equation (2.4). This can be achieved in particular by representing V (x), x ∈ E, as an integral with respect to the surface measure over the boundary ∂E, or by direct solution of the Poisson equation for V (x).
6
N. Privault
Consider for example the Newton potential kernel V (x) =
1 q , 0 sn x − yn−2
x ∈ Rn \{y},
created by a single charge q at y ∈ Rn , where s2 = 2π, s3 = 4π, and in general 2π n/2 , n ≥ 2, sn = Γ (n/2) is the surface of the unit n − 1-dimensional sphere in Rn . The electrical field created by V is U(x) := ∇V (x) =
q x−y , 0 sn x − yn−1
x ∈ Rn \{y},
cf, Figure 1. Letting B(y, r), resp. S(y, r), denote the open ball, resp. the sphere, of center y ∈ Rn and radius r > 0, we have ∆V (x)dx = n(x), ∇V (x)σ(dx) B(y,r) S(y,r) = n(x), U(x)σ(dx) S(y,r)
q = , 0 where σ denotes the surface measure on S(y, r). From this and the Poisson equation (2.4) we deduce that the repartition of electric charge is q(dx) = qδy (dx) i.e. we recover the fact that the potential V is generated by a single charge located at y. We also obtain a version of the Poisson equation (2.4) in distribution sense: 1 = sn δy (dx), ∆x x − yn−2 where the Laplacian ∆x is taken with respect to the variable x. On the other hand, taking E = B(0, r)\B(0, ρ) we have ∂E = S(0, r) ∪ S(0, ρ) and ∆V (x)dx = n(x), ∇V (x)σ(dx) + n(x), ∇V (x)σ(dx) E
S(0,r)
S(0,ρ)
= csn − csn = 0, hence ∆x
1 = 0, x − yn−2
x ∈ Rn \{y}.
The electrical permittivity 0 will be set equal to 1 in the sequel.
Potential Theory in Classical Probability
-2
-1.5
-1
-0.5
7
0
0.5
1
1.5
2
Fig. 1 Electrical field generated by a point mass at y = 0.
2.2 Harmonic Functions The notion of harmonic function will be first introduced from the mean value property. Let 1 σrx (dy) = σ(dy) sn rn−1 denote the normalized surface measure on S(x, r), and recall that ∞ n−1 f (x)dx = sn r f (z)σry (dz)dr. 0
S(y,r)
Definition 2.1. A continuous real-valued function on an open subset O of Rn is said to be harmonic, resp. superharmonic, in O if one has f (y)σrx (dy), f (x) = S(x,r)
resp. f (x) ≥
f (y)σrx (dy), S(x,r)
for all x ∈ O and r > 0 such that B(x, r) ⊂ O.
8
N. Privault
Next we show the equivalence between the mean value property and the vanishing of the Laplacian. Proposition 2.2. A C 2 function f is harmonic, resp. superharmonic, on an open subset O of Rn if and only if it satisfies the Laplace equation x ∈ O,
∆f (x) = 0, resp. the partial differential inequality ∆f (x) ≤ 0,
x ∈ O.
Proof. In spherical coordinates, using the divergence formula and the identity d 0 f (y + rx)σ1 (dx) = x, ∇f (y + rx)σ10 (dx) dr S(0,1) S(0,1) r = ∆f (y + rx)dx, sn B(0,1) yields
∆f (x)dx = rn−1
∆f (y + rx)dx
B(y,r)
B(0,1)
x, ∇f (y + rx)σ10 (dx)
= sn rn−2 S(0,1)
n−2 d f (y + rx)σ10 (dx) = sn r dr S(0,1) n−2 d f (x)σry (dx). = sn r dr S(y,r) If f is harmonic, this shows that ∆f (x)dx = 0, B(y,r)
for all y ∈ E and r > 0 such that B(y, r) ⊂ O, hence ∆f = 0 on O. Conversely, if ∆f = 0 on O then f (x)σry (dx) S(y,r)
is constant in r, hence f (y) = lim ρ→0
S(y,ρ)
f (x)σρy (dx) =
f (x)σry (dx),
r > 0.
S(y,r)
The proof is similar in the case of superharmonic functions.
Potential Theory in Classical Probability
9
The fundamental harmonic functions based at y ∈ Rn are the functions which are harmonic on Rn \{y} and depend only on r = x−y, y ∈ Rn . They satisfy the Laplace equation ∆h(x) = 0, x ∈ Rn , in spherical coordinates, with ∆h(r) =
d2 h (n − 1) dh (r). (r) + 2 dr r dr
In case n = 2, the fundamental harmonic functions are given by the logarithmic potential ⎧ 1 ⎪ ⎨ − log x − y, x = y, s2 hy (x) = (2.5) ⎪ ⎩ +∞, x = y, and by the Newton potential kernel in case n ≥ 3: ⎧ ⎪ ⎨ hy (x) =
⎪ ⎩
1 1 , x = y, (n − 2)sn x − yn−2 +∞,
(2.6)
x = y.
More generally, for a ∈ R and y ∈ Rn , the function x → x − ya , is superharmonic on Rn , n ≥ 3, if and only if a ∈ [2 − n, 0], and harmonic when a = 2 − n. We now focus on the Dirichlet problem on the ball E = B(y, r). We consider h0 (r) = −
1 log(r), s2
r > 0,
in case n = 2, and h0 (r) =
1 , (n − 2)sn rn−2
if n ≥ 3, and let x∗ := y +
r > 0,
r2 (x − y) y − x2
10
N. Privault
denote the inverse of x ∈ B(y, r) with respect to the sphere S(y, r). Note the relation r2 ∗ (x − y) z − x = z − y − 2 y − x x − y r r (z − y) − (x − y) = , x − y r y − x hence for all z ∈ S(y, r) and x ∈ B(y, r), z − x∗ = r
x − z , x − y
(2.7)
x − y z − y − r x − y = x − z. z − y y − x
since
¯ r). Instead of The function z → hx (z) is not C 2 , hence not harmonic, on B(y, ¯ r), ∗ hx we will use z → hx (z), which is harmonic on a neighborhood of B(y, to construct a solution of the Dirichlet problem on B(y, r). Lemma 2.3. The solution of the Dirichlet problem (2.10) for E = B(y, r) with boundary condition hx , x ∈ B(y, r), is given by y − xz − x∗ x → h0 , z ∈ B(y, r). r Proof. We have if n ≥ 3: y − xz − x∗ 1 rn−2 = h0 r (n − 2)sn x − yn−2 z − x∗ n−2 rn−2 = hx∗ (z), x − yn−2 and if n = 2: h0
y − xz − x∗ r
y − xz − x∗ r y − x 1 = hx∗ (y) − log . s2 r
1 = − log s2
This function is harmonic in z ∈ B(y, r) and is equal to hx on S(y, r) from (2.7). Figure 3 represents the solution of the Dirichlet problem with boundary condition hx on S(y, r) for n = 2 as obtained after truncation of Figure 2.
Potential Theory in Classical Probability
3.5 3 2.5 2 1.5 1 0.5 0 −0.5 −1 −1.5 −2 −3
−2
−1
x
0
1
2
3
11
4 −3
−2
−1
0
2
1
y
3
4
Fig. 2 Graph of hx and of h0 (y − xz − x∗ /r) when n = 2.
0 −0.5 −1 −1.5
−2 −1.5
−1 −0.5 x
0
0.5
1
1.5
2
−2
−1.5
−1
−0.5 0
0.5
1 1.5
2
y
Fig. 3 Solution of the Dirichlet problem.
2.3 Representation of a Function on E from its Values on ∂E As mentioned in the introduction, it can be of interest to compute a repartition of charges inside a domain E from the values of the field generated on the boundary ∂E. In this section we present the representation formula for the values of an harmonic function inside an arbitrary domain E as an integral over its boundary ∂E, that follows from the Green identity. This formula uses a kernel which can be explicitly computed in some special cases, e.g. when E = B(y, r) is an open ball, in which case it is called the Poisson formula, cf. Section 2.4 below. Assume that E is an open domain in Rn with smooth boundary ∂E and let ∂n f (x) = n(x), ∇f (x) denote the normal derivative of f on ∂E.
12
N. Privault
Applying the divergence theorem (2.2) to the products u(x)∇v(x) and v(x)∇u(x), where u, v are C 2 functions on E, yields Green’s identity: (u(x)∆v(x)−v(x)∆u(x))dx = (u(x)∂n v(x)−v(x)∂n u(x))dσ(x). (2.8) E
∂E
On the other hand, taking u = 1 in the divergence theorem yields Gauss’s integral theorem ∂n v(x)dσ(x) = 0, (2.9) ∂E
provided v is harmonic on E. In the next definition, hx denotes the fundamental harmonic function defined in (2.5) and (2.6). Definition 2.4. The Green kernel GE (·, ·) on E is defined as GE (x, y) := hx (y) − wx (y),
x, y ∈ E,
where for all x ∈ Rn , wx is a smooth solution to the Dirichlet problem ⎧ y ∈ E, ⎨ ∆wx (y) = 0, (2.10) ⎩ wx (y) = hx (y), y ∈ ∂E. In the case of a general boundary ∂E, the Dirichlet problem may have no solution, even when the boundary value function f is continuous. Note that since (x, y) → hx (y) is symmetric, the Green kernel is also symmetric in two variables, i.e. x, y ∈ E, GE (x, y) = GE (y, x), and GE (·, ·) vanishes on the boundary ∂E. The next proposition provides an integral representation formula for C 2 functions on E using the Green kernel. In the case of harmonic functions, it reduces to a representation from the values on the boundary ∂E, cf. Corollary 2.6 below. Proposition 2.5. For all C 2 functions u on E we have u(x) = u(z)∂n GE (x, z)σ(dz) + GE (x, z)∆u(z)dz, ∂E
x ∈ E. (2.11)
E
Proof. We do the proof in case n ≥ 3, the case n = 2 being similar. Given x ∈ E, apply Green’s identity (2.8) to the functions u and hx , where hx is harmonic on E\B(x, r) for r > 0 small enough, to obtain hx (y)∆u(y)dy − (hx (y)∂n u(y) − u(y)∂n hx (y))dσ(y) E\B(x,r)
1 = n−2
S(x,r)
∂E
1 n−2 ∂n u(y) + u(y) dσ(y), sn rn−2 sn rn−1
Potential Theory in Classical Probability
since y → ∂n
13
1 ∂ 2−n n−2 ρ|ρ=r = − n−1 . = n−2 y − x ∂ρ r
In case u is harmonic, from the Gauss integral theorem (2.9) and the mean value property of u we get hx (y)∆u(y)dy − (hx (y)∂n u(y) − u(y)∂n hx (y))dσ(y) E\B(x,r) ∂E u(y)σrx (dy) = S(x,r)
= u(x). In the general case we need to pass to the limit as r tends to 0, which gives the same result: u(x) = hx (y)∆u(y)dy + (u(y)∂n hx (y) − hx (y)∂n u(y))dσ(y). E\B(x,r)
∂E
(2.12) Our goal is now to avoid using the values of the derivative term ∂n u(y) on ∂E in the above formula. To this end we note that from Green’s identity (2.8) we have wx (y)∆u(y)dy = (wx (y)∂n u(y) − u(y)∂n wx (y))dσ(y) E ∂E = (hx (y)∂n u(y) − u(y)∂n wx (y))dσ(y) (2.13) ∂E
for any smooth solution wx to the Dirichlet problem (2.10). Taking the difference between (2.12) and (2.13) yields (hx (y) − wx (y))∆u(y)dy + u(y)∂n (hx (y) − wx (y))dσ(y) u(x) = E ∂E = GE (x, y)∆u(y)dy + u(y)∂n GE (x, y)dσ(y), x ∈ E. E
∂E
Using (2.5) and (2.6), Relation (2.11) can be reformulated as 1 1 1 u(x) = − ∂n u(z) σ(dz) u(z)∂n (n − 2)sn ∂E x − zn−2 x − zn−2 1 1 + ∆u(z)dz, x ∈ B(y, r), (n − 2)sn E x − zn−2
14
N. Privault
if n ≥ 3, and if n = 2: 1 u(x) = − (u(z)∂n log x − z − (log x − z)∂n u(z))σ(dz) s2 ∂E x ∈ B(y, r). − (log x − z)∆u(z)dz, E
Corollary 2.6. When u is harmonic on E we get u(x) = u(y)∂n GE (x, y)dσ(y),
x ∈ E.
(2.14)
∂E
As a consequence of Lemma 2.3, the Green kernel GB(y,r) (·, y) relative to the ball B(y, r) is given for x ∈ B(y, r) by ⎧ 1 r z − x ⎪ ⎪ − log , z ∈ B(y, r)\{x}, x = y, ⎪ ⎪ ⎪ s2 y − x z − x∗ ⎪ ⎪ ⎪ ⎨ B(y,r) z − y 1 G (x, z) = log , z ∈ B(y, r)\{x}, x = y, − ⎪ ⎪ ⎪ s2 r ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ +∞, z = x, if n = 2, cf. Figure 4 and ⎧ 1 1 1 rn−2 ⎪ ⎪ − , ⎪ ⎪ ⎪ (n − 2)sn z − xn−2 x − yn−2 z − x∗ n−2 ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ z ∈ B(y, r)\{x}, x = y, ⎪ ⎪ ⎪ ⎪ ⎨ 1 1 1 GB(y,r) (x, z) = − n−2 , ⎪ ⎪ ⎪ (n − 2)sn z − yn−2 r ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ z ∈ B(y, r)\{x}, x = y, ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎩ +∞, z = x, if n ≥ 3. The Green kernel on E = Rn , n ≥ 3, is obtained by letting r go to infinity: GR (x, z) = n
1 = hx (z) = hz (x), (n − 2)sn z − xn−2
x, z ∈ Rn . (2.15)
Potential Theory in Classical Probability
15
3.5 3 2.5 2 1.5 1 0.5 0 −2 −1.5 −1 −0.5 0 0.5
1
1.5 2 −2
0
−0.5
−1.5 −1
0.5
1
1.5
2
Fig. 4 Graph of z → G(x, z) with x ∈ E = B(y, r) and n = 2.
2.4 Poisson Formula B(y,r)
Given u a sufficiently integrable function on S(y, r) we let Iu (x) denote the Poisson integral of u over S(y, r), defined as: r2 − y − x2 1 IuB(y,r) (x) = u(z)σ(dz), x ∈ B(y, r). sn r S(y,r) z − xn Next is the Poisson formula obtained as a consequence of Proposition 2.5. Theorem 2.7. Let n ≥ 2. If u has continuous second partial derivatives on ¯ r) then for all x ∈ B(y, r) we have E = B(y, B(y,r) (x) + GB(y,r) (x, z)∆u(z)dz. (2.16) u(x) = Iu B(y,r)
Proof. We use the relation B(y,r) u(z)∂n G (x, z)σ(dz) + u(x) = S(y,r)
GB(y,r) (x, z)∆u(z)dz,
B(y,r)
x ∈ B(y, r), and the fact that z → ∂n G
B(y,r)
y − x z − x∗ 1 (x, z) = − ∂n log s2 r z − x r2 − x − y2 1 = (n − 2) sn rz − x2
if n = 2, and similarly for n ≥ 3.
16
N. Privault
7 6 5 4 3 2 1
x
0 2 1 0 −1 −2
2
1.5
1
0.5
0 y
−0.5
−1
−1.5
−2
Fig. 5 Poisson kernel graphs on S(y, r) for n = 2 for two values of x ∈ B(y, r).
¯ r) we obtain the Poisson When u is harmonic on a neighborhood of B(y, ¯ representation formula of u on E = B(y, r) using the values of u on the sphere ∂E = S(y, r), as a consequence of Theorem 2.7. ¯ r). We Corollary 2.8. Assume that u is harmonic on a neighborhood of B(y, have r2 − y − x2 1 u(z)σ(dz), x ∈ B(y, r), (2.17) u(x) = sn r S(y,r) z − xn for all n ≥ 2. Similarly, Theorem 2.7 also shows that u(x) ≤ IuB(y,r) (x),
x ∈ B(y, r),
when u is superharmonic on B(y, r). Note also that when x = y, Relation (2.17) recovers the mean value property of harmonic functions: 1 u(y) = u(z)σ(dz), sn rn−1 S(y,r) and the corresponding inequality for superharmonic functions. The function r2 − x − y2 z → x − zn is called the Poisson kernel on S(y, r) at x ∈ B(y, r) cf. Figure 5. A direct calculation shows that the Poisson kernel is harmonic on Rn \ (S(y, r) ∪ {z}): ∆x
r2 − y − x2 = 0, z − xn
x∈ / S(y, r) ∪ {z},
(2.18)
Potential Theory in Classical Probability
17
hence all Poisson integrals are harmonic functions on B(y, r). Moreover Theorem 2.17 of du Plessis [dP70] asserts that for any z ∈ S(y, r), letting x tend to z without entering S(y, r) we have lim IuB(y,r) (x) = u(z).
x→z
Hence the Poisson integral solves the Dirichlet problem (2.10) on B(y, r). Proposition 2.9. Given f a continuous function on S(y, r), the Poisson integral r2 − x − y2 1 B(y,r) (x) = f (z)σ(dz), x ∈ B(y, r), If sn r S(y,r) x − zn provides a solution of the Dirichlet problem ⎧ x ∈ B(y, r), ⎨ ∆w(x) = 0, ⎩
w(x) = f (x), x ∈ S(y, r),
with boundary condition f . Recall that the Dirichlet problem on B(y, r) may not have a solution when the boundary condition f is not continuous. In particular, from Lemma 2.3 we have B(y,r)
Ihx
(z) =
rn−2 hx∗ (z), x − yn−2
x ∈ B(y, r),
for n ≥ 3, and B(y,r) (z) Ihx
1 = hx∗ (z) − log s2
x − y r
,
x ∈ B(y, r),
for n = 2, where x∗ denotes the inverse of x with respect to S(y, r). This function solves the Dirichlet problem with boundary condition hx , and the corresponding Green kernel satisfies B(y,r)
GB(y,r) (x, z) = hx (z) − Ihx B(y,r)
(z),
x, z ∈ B(y, r).
When x = y the solution Ihy (z) of the Dirichlet problem on B(y, r) with 2−n boundary condition hy is constant and equal to (n − 2)−1 s−1 on B(y, r), n r and we have the identity r2 − y − z2 1 σ(dx) = r2−n , z ∈ B(y, r), n−1 sn r x − zn S(y,r) for n ≥ 3, cf. Figure 6.
18
N. Privault
−0.6 −0.8 −1 −1.2 −1.4 −1.6 −1.8 −4
−3
−2 x
−1
0
1
2
3
−3
−2
−1
0
2
1
3
4
y
Fig. 6 Reduced of hx relative to D = R2 \B(y, r) with x = y.
2.5 Potentials and Balayage In electrostatics, the function x → hy (x) represents the Newton potential created at x ∈ Rn by a charge at y ∈ E, and the function x → hy (x)q(dy) E
represents the sum of all potentials generated at x ∈ Rn by a distribution q(dy) of charges inside E. In particular, when E = Rn , n ≥ 3, this sum equals n x → GR (x, y)q(dy) Rn
from (2.15), and the general definition of potentials originates from this interpretation. Definition 2.10. Given a measure µ on E, the Green potential of µ is defined as the function x → GE µ(x) := GE (x, y)µ(dy), E
where GE (x, y) is the Green kernel on E. Potentials will be used in the construction of superharmonic functions, cf. Proposition 5.1 below. Conversely, it is natural to ask whether a superharmonic function can be represented as the potential of a measure. In general, recall (cf. Proposition 2.5) the relation E u(x) = u(z)∂n G (x, z)σ(dz) + GE (x, z)∆u(z)dz, x ∈ E, (2.19) ∂E
E
Potential Theory in Classical Probability
which yields, if E = B(y, r): u(x) = IuE (x) + GE (x, z)∆u(z)dz,
19
x ∈ B(y, r),
(2.20)
E
where the Poisson integral IuE is harmonic from (2.18). Relation (2.20) can be seen as a decomposition of u into the sum of a harmonic function on B(y, r) and a potential. The general question of representing superharmonic functions as potentials is examined next in Theorem 2.12 below, with application to the construction of Martin boundaries in Section 2.6. Definition 2.11. Consider i) an open subset E of Rn with Green kernel GE , ii) a subset D of E, and iii) a non-negative superharmonic function u on E. The infimum on E over all non-negative superharmonic function on E which are (pointwise) greater than u on D is called the reduced function of u relative to D, and denoted by RD u. In other terms, letting Φu denote the set of non-negative superharmonic functions v on E such that v ≥ u on D, we have RD u := inf{v ∈ Φu }. The lower regularization ˆ D (x) := lim inf RD (y), R u u y→x
x ∈ E,
is called the balayage of u, and is also a superharmonic function. In case D = Rn \B(y, r), the reduced function of hy relative to D is given by + h0 (r)1{z∈B(y,r)} , RD / hy (z) = hy (z)1{z ∈B(y,r)}
z ∈ Rn ,
(2.21) B(y,r)
on cf. Figure 7. More generally if v is superharmonic then RD v = Iv R2 \D = B(y, r), cf. p. 62 and p. 100 of Brelot [Bre65]. Hence if D = B c (y, r) = Rn \B(y, r) and x ∈ B(y, r), we have B c (y,r)
R hx
B(y,r)
(z) = Ihx (z) x − yz − x∗ = h0 r =
rn−2 1 , (n − 2)sn x − yn−2 z − x∗ n−2
z ∈ B(y, r).
20
N. Privault
Using Proposition 2.5 and the identity B c (y,r)
∆Rhy
= σry , B c (y,r)
in distribution sense, we can represent Rhy B c (y,r)
R hy =
(x) B c (y,r)
R hy S(y,R) = h0 (R) +
on E = B(y, R), R > r, as
(z)∂n GB(y,R) (x, z)σ(dz) +
GB(y,R) (x, z)σry (dz) B(y,R)
x ∈ B(y, R).
GB(y,R) (x, z)σry (dz),
S(y,r)
Letting R go to infinity yields B c (y,r)
R hy
(x) =
GR (x, z)σry (dz) n
S(y,r)
hx (z)σry (dz)
= S(y,r)
= hx (y),
x∈ / B(y, r),
since hx is harmonic on Rn \B(y, r), and y − xz − x∗ B c (y,r) (x) = h0 R hy σry (dz) r S(y,r) y − xy − x∗ = h0 r = h0 (r), x ∈ B(y, r), which recovers the decomposition (2.21). More generally we have the following result, for which we refer to Theorem 7.12 of Helms [Hel69]. Theorem 2.12. If D is a compact subset of E and u is a non-negative suˆ D is a potential, i.e. there exists a measure perharmonic function on E then R u µ on E such that ˆ D (x) = R GE (x, y)µ(dy), x ∈ E. (2.22) u E
If moreover RD v is harmonic on D then µ is supported by ∂D, cf. Theorem 6.9 in Helms [Hel69].
Potential Theory in Classical Probability
21
0.5 0 −0.5 −1 −1.5 −2 −4
−3
−2
−1 x
0
1
2
−3
3
−2
−1
0
1 y
2
3
4
Fig. 7 Reduced of hx relative to D = R2 \B(y, r) with x ∈ B(y, r)\{y}.
2.6 Martin Boundary The Martin boundary theory extends the Poisson integral representation described in Section 2.4 to arbitrary open domains with a non smooth boundary, or having no boundary. Given E a connected open subset of Rn , the Martin ˆ ˆ boundary ∆E of E is defined in an abstract sense as ∆E := E\E, where E is a suitable compactification of E. Our aim is now to show that every nonnegative harmonic function on E admits an integral representation using its values on the boundary ∆E. For this, let u be non-negative and harmonic on E, and consider an increasing sequence (En )n∈N of open sets with smooth boundaries (∂En )n∈N and compact closures, such that ∞
E=
En .
n=0 n Then the balayage RE u of u relative to En coincides with u on En , and from Theorem 2.12 it can be represented as En Ru (x) = GE (x, y)dµn (y)
En
where µn is a measure supported by ∂En . Note that since n RE u (x) = u(x),
x ∈ Ek ,
k ≥ n,
and lim GE (x, y)|y∈∂En = 0,
n→∞
x ∈ E,
22
N. Privault
the total mass of µn has to increase to infinity: lim µn (En ) = ∞.
n→∞
For this reason one decides to renormalize µn by fixing x0 ∈ E1 and letting n ∈ N,
µ ˜n (dy) := GE (x0 , y)µn (dy), so that µ ˜n has total mass µ ˜n (En ) = u(x0 ) < ∞,
independently of n ∈ N. Next, let the kernel Kx0 be defined as GE (x, y) , GE (x0 , y)
Kx0 (x, y) :=
x, y ∈ E,
with the relation ˆ En (x) = R u
Kx0 (x, y)d˜ µn (y). En
The construction of the Martin boundary ∆E of E relies on the following theorem by Constantinescu and Cornea, cf. Helms [Hel69], Chapter 12. Theorem 2.13. Let E denote a non-compact, locally compact space and consider a family Φ of continuous mappings f : E → [−∞, ∞]. ˆ in which E is everywhere dense, Then there exists a unique compact space E such that: a) every f ∈ Φ can be extended to a function f ∗ on Eˆ by continuity, ˆ b) the extended functions separate the points of the boundary ∆E = E\E in the sense that if x, y ∈ ∆E with x = y, there exists f ∈ Φ such that f ∗ (x) = f ∗ (y). ˆ in which E The Martin space is then defined as the unique compact space E is everywhere dense, and such that the functions {y → Kx0 (x, y) : x ∈ E} ˆ admit continuous extensions which separate the boundary E\E. Such a ˆ of E exists and is unique as a consequence of the compactification E Constantinescu-Cornea Theorem 2.13, applied to the family Φ := {x → Kx0 (x, z) : z ∈ E}. In this way the Martin boundary of E is defined as ˆ ∆E := E\E.
Potential Theory in Classical Probability
23
The Martin boundary is unique up to an homeomorphism, namely if x0 , x0 ∈ E, then Kx0 (x, z) Kx0 (x, z) = Kx0 (x0 , z) and Kx0 (x, z) =
Kx0 (x, z) Kx0 (x0 , z)
ˆ which still separate the boundary ∆E. For may have different limits in E this reason, in the sequel we will drop the index x0 in Kx0 (x, z). In the next theorem, the Poisson representation formula is extended to Martin boundaries. Theorem 2.14. Any non-negative harmonic function h on E can be represented as K(z, x)ν(dz), x ∈ E, h(x) = ∆E
where ν is a non-negative Radon measure on ∆E. Proof. Since µ ˜n (En ) is bounded (actually it is constant) in n ∈ N we can ˆ i.e. extract a subsequence (˜ µnk )k∈N converging vaguely to a measure µ on E, lim f (x)˜ µnk (dx) = f (x)µ(dx), f ∈ Cc (E), k→∞
ˆ E
ˆ E
see e.g. Ex. 10, p. 81 of Hirsch and Lacombe [HL99]. The continuity of z → ˆ then implies K(x, z) in z ∈ E ˆ En (x) h(x) = lim R u n→∞
nk ˆE (x) = lim R u k→∞ = lim K(z, x)νnk (dz) k→∞ E ˆ = K(z, x)µ(dz), x ∈ E.
ˆ E
Finally, ν is supported by ∆E since for all f ∈ Cc (En ), f (x)µ(dx) = lim f (x)˜ µnk (dx) = 0. E
k→∞
Ek
When E = B(y, r) one can check by explicit calculation that lim Ky (x, ζ) =
ζ→z
r2 − x − y2 , z − xn
z ∈ S(y, r),
24
N. Privault
is the Poisson kernel on S(y, r). In this case we have µ = σry , which is the normalized surface measure on S(y, r), and the Martin boundary ∆B(y, r) of B(y, r) equals its usual boundary S(y, r).
3 Markov Processes 3.1 Markov Property Let C0 (Rn ) denote the class of continuous functions tending to 0 at infinity. Recall that f is said to tend to 0 at infinity if for all ε > 0 there exists a compact subset K of Rn such that |f (x)| ≤ ε for all x ∈ Rn \K. Definition 3.1. An Rn -valued stochastic process, i.e. a family (Xt )t∈R+ of random variables on a probability space (Ω, F , P ), is a Markov process if for all t ∈ R+ the σ-fields Ft+ := σ(Xs : s ≥ t) and Ft := σ(Xs : 0 ≤ s ≤ t). are conditionally independent given Xt . The above condition can be restated by saying that for all A ∈ Ft+ and B ∈ Ft we have P (A ∩ B | Xt ) = P (A | Xt )P (B | Xt ), cf. Chung [Chu95]. This definition naturally entails that: i) (Xt )t∈R+ is adapted with respect to (Ft )t∈R+ , i.e. Xt is Ft -measurable, t ∈ R+ , and ii) Xu is conditionally independent of Ft given Xt , for all u ≥ t, i.e. IE[f (Xu ) | Ft ] = IE[f (Xu ) | Xt ],
0 ≤ t ≤ u,
for any bounded measurable function f on Rn . In particular, P (Xu ∈ A | Ft ) = IE[1A (Xu ) | Ft ] = IE[1A (Xu ) | Xt ] = P (Xu ∈ A | Xt ), A ∈ B(Rn ). Processes with independent increments provide simple examples of Markov processes. Indeed, if (Xt )t∈Rn has independent increments, then for all bounded measurable functions f , g we have
Potential Theory in Classical Probability
25
IE[f (Xt1 , . . . , Xtn )g(Xs1 , . . . , Xsn ) | Xt ] = IE[f (Xt1 − Xt + x, . . . , Xtn − Xt + x) ×g(Xs1 − Xt + x, . . . , Xsn − Xt + x)]x=Xt = IE[f (Xt1 − Xt + x, . . . , Xtn − Xt + x)]x=Xt ×IE[g(Xs1 − Xt + x, . . . , Xsn − Xt + x)]x=Xt = IE[f (Xt1 , . . . , Xtn ) | Xt ]IE[g(Xs1 , . . . , Xsn ) | Xt ], 0 ≤ s1 < · · · < sn < t < t1 < · · · < tn . In discrete time, a sequence (Xn )n∈N of random variables is said to be a Markov chain if for all n ∈ N, the σ-algebras Fn = σ({Xk : k ≤ n}) and Fn+ = σ({Xk : k ≥ n}) are independent conditionally to Xn . In particular, for every Fn+ -measurable bounded random variable F we have IE[F | Fn ] = IE[F | Xn ],
n ∈ N.
3.2 Transition Kernels and Semigroups A transition kernel is a mapping P (x, dy) such that i) for every x ∈ E, A → P (x, A) is a probability measure, and ii) for every A ∈ B(E), the mapping x → P (x, A) is a measurable function. The transition kernel µs,t associated to a Markov process (Xt )t∈R+ is defined as µs,t (x, A) = P (Xt ∈ A | Xs = x) 0 ≤ s ≤ t, and we have µs,t (Xs , A) = P (Xt ∈ A | Xs ) = P (Xt ∈ A | Fs ),
0 ≤ s ≤ t.
The transition operator (Ts,t )0≤s≤t associated to (Xt )t∈R+ is defined as Ts,t f (x) := IE[f (Xt ) | Xs = x] = f (y)µs,t (x, dy), x ∈ Rn . Rn
Letting ps,t (x) denote the density of Xt − Xs we have ps,t (y − x)dy, A ∈ B(Rn ), µs,t (x, A) = A
26
N. Privault
and Ts,t f (x) =
Rn
f (y)ps,t (y − x)dy.
In discrete time, a sequence (Xn )n∈N of random variables is called a homogeneous Markov chain with transition kernel P if IE[f (Xn ) | Fm ] = P n−m f (Xm ),
0 ≤ m ≤ n.
(3.1)
In the sequel we will assume that (Xt )t∈R+ is time homogeneous, i.e. µs,t depends only on the difference t−s, and we will denote it by µt−s . In this case the family (T0,t )t∈R+ is denoted by (Tt )t∈R+ . It defines a transition semigroup associated to (Xt )t∈R+ , with Tt f (x) = IE[f (Xt ) | X0 = x] = f (y)µt (x, dy), x ∈ Rn , Rn
and satisfies the semigroup property Tt Ts f (x) = IE[Ts f (Xt ) | X0 = x] = IE[IE[f (Xt+s ) | Xs ] | X0 = x] = IE[IE[f (Xt+s ) | Fs ] | X0 = x] = IE[f (Xt+s ) | X0 = x] = Tt+s f (x), which can be formulated as the Chapman-Kolmogorov equation µs+t (x, A) = µs ∗ µt (x, A) = µs (x, dy)µt (y, A).
(3.2)
Rn
By induction, using (3.2) we obtain Px ((Xt1 , . . . , Xtn ) ∈ B1 × · · · × Bn ) = ··· µ0,t1 (x, dx1 ) · · · µtn−1 ,tn (xn−1 , dxn ) B1
Bn
for 0 < t1 < · · · < tn and B1 , . . . , Bn Borel subsets of Rn . If (Xt )t∈R+ is a homogeneous Markov processes with independent increments, the density pt (x) of Xt satisfies the convolution property ps+t (x) = ps (y − x)pt (y)dy, x ∈ Rn , Rn
which is satisfied in particular by processes with stationary and independent increments such as L´evy processes. A typical example of a probability density satisfying such a convolution property is the Gaussian density, i.e.
Potential Theory in Classical Probability
27
1 1 exp − x2Rn , 2t (2πt)n/2
pt (x) =
x ∈ Rn .
From now on we assume that (Tt )t∈R+ is a strongly continuous Feller semigroup, i.e. a family of positive contraction operators on C0 (Rn ) such that i) Ts+t = Ts Tt , s, t ≥ 0, ii) Tt (C0 (Rn )) ⊂ C0 (Rn ), iii) Tt f (x) → f (x) as t → 0, f ∈ C0 (Rn ), x ∈ Rn . The resolvent of (Tt )t∈R+ is defined as ∞ Rλ f (x) := e−λt Tt f (x)dt,
x ∈ Rn ,
0
i.e. Rλ f (x) = IEx
∞
e−λt f (Xt )dt ,
x ∈ Rn ,
0
for sufficiently integrable f on Rn , where IEx denotes the conditional expectation given that {X0 = x}. It satisfies the resolvent equation Rλ − Rµ = (µ − λ)Rλ Rµ ,
λ, µ > 0.
We refer to [Kal02] for the following result. Theorem 3.2. Let (Tt )t∈R+ be a Feller semigroup on C0 (Rn ) with resolvent Rλ , λ > 0. Then there exists an operator A with domain D ⊂ C0 (Rn ) such that λ > 0. (3.3) Rλ−1 = λI − A, The operator A is called the generator of (Tt )t∈R+ and it characterizes (Tt )t∈R+ . Furthermore, the semigroup (Tt )t∈R+ is differentiable in t for all f ∈ D and it satisfies the forward and backward Kolmogorov equations dTt f = Tt Af, dt Note that the integral
∞
and
Γ (n/2 − 1) − yn−2 n−2 = 2sn x − yn−2 = (n/2 − 1)hy (x)
pt (x, y)dt = 0
dTt f = ATt f. dt
2π n/2 x
28
N. Privault
of the Gaussian transition density function is proportional to the Newton potential kernel x → 1/x − yn−2 for n ≥ 3. Hence the resolvent R0 f associated to the Gaussian semigroup Tt f (x) = Rn f (y)pt (x, y)dy is a potential in the sense of Definition 2.10, since: ∞ R0 f (x) = Tt f (x)dt 0
= IEx
f (Bt )dt 0
=
∞
f (y) Rn
=
∞
n−2 2sn
Rn
pt (x, y)dtdy 0
f (y) dy. x − yn−2
More generally, for λ > 0 we have Rλ f (x) = (λI − A)−1 f (x) ∞ = e−λt Tt f (x)dt 0
∞
=
e−λt etA f (x)dt
0
∞
= 0
∞
e−λt Tt f (x)dt
= 0
Rn
f (y)e−λt pt (x, y)dydt
f (y)g λ (x, y)dy,
= Rn
x ∈ Rn ,
where g λ (x, y) is the λ-potential kernel defined as ∞ e−λt pt (x, y)dt, g λ (x, y) :=
(3.4)
0
and Rλ f is also called a λ-potential. Recall that the Hille-Yosida theorem also allows one to construct a strongly continuous semigroup from a generator A. In another direction it is possible to associate a Markov process to any time homogeneous transition function satisfying µ0 (x, dy) = δx (dy) and the Chapman-Kolmogorov equation (3.2), cf. e.g. Theorem 4.1.1 of Ethier and Kurtz [EK86].
Potential Theory in Classical Probability
29
3.3 Hitting Times Definition 3.3. An a.s. non-negative random variable τ is called a stopping time with respect to a filtration Ft if {τ ≤ t} ∈ Ft ,
t > 0.
The σ-algebra Fτ is defined as the collection of measurable sets A such that A ∩ {τ < t} ∈ Ft for all t > 0. Note that for all s > 0 we have {τ < s}, {τ ≤ s}, {τ > s}, {τ ≥ s} ∈ Fτ . Definition 3.4. One says that the process (Xt )t∈R+ has the strong Markov property if for any P -a.s. finite Ft -stopping time τ we have IE[f (X(τ + t)) | Fτ ] = IE[f (X(t)) | X0 = x]x=Xτ = Tt f (Xτ ),
(3.5)
for all bounded measurable f . The hitting time τB of a Borel set B ⊂ Rn is defined as τB = inf{t > 0 : Xt ∈ B}, with the convention inf ∅ = +∞. A set B such that Px (τB < ∞) = 0 for all x ∈ Rn is said to be polar. In discrete time it can be easily shown that hitting times are stopping times, from the relation {τB ≤ n}c = {τB > n} =
n
{Xk ∈ / B} ∈ Fn ,
k=0
however in continuous time the situation is more complicated. From e.g. Lemma 7.6 of Kallenberg [Kal02], we have that τB is a stopping time provided B is closed and (Xt )t∈R+ is continuous, or B is open and (Xt )t∈R+ is rightcontinuous. Definition 3.5. The last exit time from B is denoted by lB and defined as lB = sup{t > 0 : Xt ∈ B}, with lB = 0 if τB = +∞. We say that B is recurrent if Px (lB = +∞) = 1, x ∈ Rn , and that B is transient if lB < ∞, P -a.s., i.e. Px (lB = +∞) = 0, x ∈ Rn .
30
N. Privault
3.4 Dirichlet Forms Before turning to a presentation of stochastic calculus we briefly describe the notion of Dirichlet form, which provides a functional analytic interpretation of the Dirichlet problem. A Dirichlet form is a positive bilinear form E defined on a domain ID dense in a Hilbert space H of real-valued functions, such that i) the space ID, equipped with the norm f ID := f 2H + E(f, f ), is a Hilbert space, and ii) for any f ∈ ID we have min(f, 1) ∈ ID and E(min(f, 1), min(f, 1)) ≤ E(f, f ). The classical example of Dirichlet form is given by H = L2 (Rn ) and E(f, g) :=
n ∂g ∂f (x) (x)dx. ∂x ∂x i i Rn i=1
The generator L of E is defined by Lf = g, f ∈ ID, if for all h ∈ ID we have E(f, h) = −g, hH . It is known, cf. e.g. Bouleau and Hirsch [BH91], that a self-ajoint operator L on H = L2 (Rn ) with domain Dom(L) is the generator of a Dirichlet form if and only if f ∈ Dom(L). Lf, (f − 1)+ L2 (Rn ) ≤ 0, On the other hand, L is the generator of a strongly continuous semigroup (Pt )t∈R+ on H = L2 (Rn ) if and only if (Pt )t∈R+ is sub-Markovian, i.e. for all f ∈ L2 (Rn ), t ∈ R+ . 0 ≤ f ≤ 1 =⇒ 0 ≤ Pt f ≤ 1, We refer to Ma and R¨ ockner [MR92] for more details on the connection between stochastic processes and Dirichlet forms. Coming back to the Dirichlet problem ⎧ x ∈ D, ⎨ ∆u = 0, ⎩
u(x) = 0,
x ∈ ∂D.
If f and g are C 1 with compact support in D we have g(x)∆f (x)dx = − D
n i=1
D
∂g ∂f (x) (x)dx = −E(f, g). ∂xi ∂xi
Potential Theory in Classical Probability
31
Here, ID is the subspace of functions in L2 (Rn ) whose derivative in distribution sense belongs to L2 (Rn ), with norm f 2ID =
Rn
|f (x)|2 dx +
n 2 ∂f (x) dx. Rn i=1 ∂xi
Hence the Dirichlet problem for f can be formulated as E(f, g) = 0, for all g in the completion of Cc∞ (D) with respect to the · ID -norm. Finally we mention the notion of capacity of an open set A, defined as C(A) := inf{uID : u ∈ ID and u ≥ 1 on A}. The notion of zero-capacity set is finer than that of zero-measure sets and gives rise to the notion of properties that hold in the quasi-everywhere sense, cf. Bouleau and Hirsch [BH91].
4 Stochastic Calculus 4.1 Brownian Motion and the Poisson Process Let (Ω, F , P ) be a probability space and (Ft )t∈R+ a filtration, i.e. an increasing family of sub σ-algebras of F . We assume that (Ft )t∈R+ is continuous on the right, i.e. Ft = Fs , t ∈ R+ . s>t
Recall that a process (Mt )t∈R+ in L1 (Ω) is called an Ft -martingale if IE[Mt |Fs ] = Ms , 0 ≤ s ≤ t. For example, if (Xt )t∈[0,T ] is a (non homogeneous) Markov process with semigroup (Ps,t )0≤s≤t≤T satisfying Ps,t f (Xs ) = IE[f (Xt ) | Xs ] = IE[f (Xt ) | Fs ],
0 ≤ s ≤ t ≤ T,
on Cb2 (Rn ) functions, with Ps,t ◦ Pt,u = Ps,u ,
0 ≤ s ≤ t ≤ u ≤ T,
then (Pt,T f (Xt ))t∈[0,T ] is an Ft -martingale: IE[Pt,T f (Xt ) | Fs ] = IE[IE[f (XT ) | Ft ] | Fs ] = IE[f (XT ) | Fs ] 0 ≤ s ≤ t ≤ T. = Ps,T f (Xs ),
32
N. Privault
Definition 4.1. A martingale (Mt )t∈R+ in L2 (Ω) (i.e. IE[|Mt |2 ] < ∞, t ∈ R+ ) and such that IE[(Mt − Ms )2 |Fs ] = t − s,
0 ≤ s < t,
(4.1)
is called a normal martingale. Every square-integrable process (Mt )t∈R+ with centered independent increments and generating the filtration (Ft )t∈R+ satisfies IE[(Mt − Ms )2 |Fs ] = IE[(Mt − Ms )2 ],
0 ≤ s ≤ t,
hence the following remark. Remark 4.2. A square-integrable process (Mt )t∈R+ with centered independent increments is a normal martingale if and only if IE[(Mt − Ms )2 ] = t − s,
0 ≤ s ≤ t.
In our presentation of stochastic integration we will restrict ourselves to normal martingales. As will be seen in the next sections, this family contains Brownian motion and the standard compensated Poisson process as particular cases. Remark 4.3. A martingale (Mt )t∈R+ is normal if and only if (Mt2 − t)t∈R+ is a martingale, i.e. IE[Mt2 − t|Fs ] = Ms2 − s,
0 ≤ s < t.
Proof. This follows from the equalities IE[(Mt − Ms )2 |Fs ] − (t − s) = IE[Mt2 − Ms2 − 2(Mt − Ms )Ms |Fs ] − (t − s) = IE[Mt2 − Ms2 |Fs ] − 2Ms IE[Mt − Ms |Fs ] − (t − s) = IE[Mt2 |Fs ] − t − (IE[Ms2 |Fs ] − s). Throughout the remainder of this chapter, (Mt )t∈R+ will be a normal martingale. We now turn to the Brownian motion and the compensated Poisson process as the fundamental examples of normal martingales. Our starting point is now a family (ξn )n∈N of independent standard (i.e. centered and with unit variance) Gaussian random variables under γN , constructed as the canonical projections from (RN , BRN , γN ) into R. The measure γN is characterized by its Fourier transform
Potential Theory in Classical Probability
33
∞ α → IE eiξ,α2 (N) = IE ei n=0 ξn αn =
∞
e−αn /2 2
n=0
=e
− 12 α 22 (N)
α ∈ 2 (N),
,
i.e. ξ, α 2 (N) is a centered Gaussian random variable with variance α2 2 (N) . Let (en )n∈N denote an orthonormal basis of L2 (R+ ). Definition 4.4. Given u ∈ L2 (R+ ) with decomposition u=
∞
u, en en ,
n=0
we let J1 : L2 (R+ ) −→ L2 (RN , γ N ) be defined as J1 (u) =
∞
ξn u, en .
n=0
We have the isometry property IE[|J1 (u)|2 ] = =
∞ k=0 ∞
|u, en |2 IE[|ξn |2 ]
(4.2)
|u, en |2
k=0
= u2L2 (R+ ) , and ∞ IE eiJ1 (u) = IE eiξn u,en
=
n=0 ∞ n=0
e
− 12 u,en 2L2 (R
+)
1 2 = exp − uL2(R+ ) , 2 hence J1 (u) is a centered Gaussian random variable with variance u2L2 (R+ ) . Next is a constructive approach to the definition of Brownian motion, using the decomposition t ∞ en en (s)ds. 1[0,t] = n=0
0
34
N. Privault 2
1.5
1
Bt
0.5
0
-0.5
-1
-1.5
-2
0
0.2
0.4
0.6
0.8
1
Fig. 8 Sample paths of one-dimensional Brownian motion.
Definition 4.5. For all t ∈ R+ , let Bt (ω) := J1 (1[0,t] ) =
∞ n=0
ξn (ω)
t
en (s)ds.
(4.3)
0
Clearly, Bt − Bs = J1 (1[s,t] ) is a Gaussian centered random variable with variance: IE[(Bt − Bs )2 ] = IE[|J1 (1[s,t] )|2 ] = 1[s,t] 2L2 (R+ ) = t − s,
(4.4)
cf. Figure 8. Moreover, the isometry formula (4.2) shows that if u1 , . . . , un are orthogonal in L2 (R+ ) then J1 (u1 ), . . . , J1 (un ) are also mutually orthogonal in L2 (Ω), hence from Corollary 16.1 of Jacod and Protter [JP00], we get the following. Proposition 4.6. Let u1 , . . . , un be an orthogonal family in L2 (R+ ), i.e. ui , uj L2 (R+ ) = 0,
1 ≤ i = j ≤ n.
Then (J1 (u1 ), . . . , J1 (un )) is a vector of independent Gaussian centered random variables with respective variances u1 2L2 (R+ ) , . . . , u1 2L2 (R+ ) . As a consequence of Proposition 4.6, (Bt )t∈R+ has centered independent increments hence it is a martingale.
Potential Theory in Classical Probability
35
Moreover, from Relation (4.4) and Remark 4.2 we deduce the following proposition. Proposition 4.7. The Brownian motion (Bt )t∈R+ is a normal martingale. The n-dimensional Brownian motion will be constructed as (Bt1 , . . . , Btn )t∈R+ where (Bt1 )t∈R+ , . . .,(Btn )t∈R+ are independent copies of (Bt )t∈R+ , cf. Figure 9 and Figure 10 below. The compensated Poisson process provides a second example of normal martingale. Let now (τn )n≥1 denote a sequence of independent and identically exponentially distributed random variables, with parameter λ > 0, i.e. ∞ ∞ n IE[f (τ1 , . . . , τn )] = λ ··· e−λ(s1 +···+sn ) f (s1 , . . . , sn )ds1 · · · dsn , 0
0
for all sufficiently integrable measurable f : Rn+ → R. Let also Tn = τ1 + · · · + τn ,
n ≥ 1.
We now consider the canonical point process associated to the family (Tk )k≥1 of jump times. Definition 4.8. The point process (Nt )t∈R+ defined as Nt :=
∞
t ∈ R+
1[Tk ,∞) (t),
(4.5)
k=1
is called the standard Poisson point process. The process (Nt )t∈R+ has independent increments which are distributed according to the Poisson law, i.e. for all 0 ≤ t0 ≤ t1 < · · · < tn , (Nt1 − Nt0 , . . . , Ntn − Ntn−1 ) is a vector of independent Poisson random variables with respective parameters (λ(t1 − t0 ), . . . , λ(tn − tn−1 )). We have IE[Nt ] = λt and Var[Nt ] = λt, t ∈ R+ , hence according to Remark 4.2, the process λ−1/2 (Nt − λt) is a normal martingale. Compound Poisson processes provide other examples of normal martingales. Given (Yk )k≥1 a sequence of independent identically distributed random variables, define the compound Poisson process as Xt =
Nt k=1
Yk ,
t ∈ R+ .
36
N. Privault
The compensated compound Poisson martingale defined as Xt − λtIE[Y1 ] , Mt := λVar[Y1 ]
t ∈ R+ ,
is a normal martingale.
4.2 Stochastic Integration In this section we construct the Itˆo stochastic integral of square-integrable adapted processes with respect to normal martingales. The filtration (Ft )t∈R+ is generated by (Mt )t∈R+ : Ft = σ(Ms : 0 ≤ s ≤ t),
t ∈ R+ .
A process (Xt )t∈R+ is said to be Ft -adapted if Xt is Ft -measurable for all t ∈ R+ . Definition 4.9. Let Lpad (Ω ×R+ ), p ∈ [1, ∞], denote the space of Ft -adapted processes in Lp (Ω × R+ ). Stochastic integrals will be first constructed as integrals of simple predictable processes. Definition 4.10. Let S be a space of random variables dense in L2 (Ω, F , P ). Consider the space P of simple predictable processes (ut )t∈R+ of the form ut =
n
Fi 1(tni−1 ,tni ] (t),
t ∈ R+ ,
(4.6)
i=1
where Fi is Ftni−1 -measurable, i = 1, . . . , n. One easily checks that the set P of simple predictable processes forms a linear space. On the other hand, from Lemma 1.1 of Ikeda and Watanabe [IW89], p. 22 and p. 46, the space P of simple predictable processes is dense in Lpad (Ω × R+ ) for all p ≥ 1. Proposition 4.11. The stochastic integral with respect to the normal martingale (Mt )t∈R+ , defined on simple predictable processes (ut )t∈R+ of the form (4.6) by ∞ n ut dMt := Fi (Mti − Mti−1 ), (4.7) 0
extends to u ∈
i=1
× R+ ) via the isometry formula ∞ ∞ ∞ ut dMt vt dMt = IE ut vt dt . IE L2ad (Ω
0
0
0
(4.8)
Potential Theory in Classical Probability
37
Proof. We start by showing that the isometry (4.8) holds for the simple predictable process u = ni=1 Gi 1(ti−1 ,ti ] , with 0 = t0 < t1 < · · · tn :
2
∞
IE
ut dMt
⎡ 2 ⎤ n Gi (Mti − Mti−1 ) ⎦ = IE ⎣
0
= IE
n
i=1
|Gi | (Mti − Mti−1 ) 2
2
i=1
⎡
⎤
+2IE ⎣
Gi Gj (Mti − Mti−1 )(Mtj − Mtj−1 )⎦
1≤i<j≤n
=
n
IE[IE[|Gi |2 (Mti − Mti−1 )2 |Fti−1 ]]
i=1
+2
IE[IE[Gi Gj (Mti − Mti−1 )(Mtj − Mtj−1 )|Ftj−1 ]]
1≤i<j≤n
=
n
IE[|Gi |2 IE[(Mti − Mti−1 )2 |Fti−1 ]]
i=1
+2
IE[Gi Gj (Mti − Mti−1 )IE[(Mtj − Mtj−1 )|Ftj−1 ]]
1≤i<j≤n
|Gi | (ti i=1 IE[u2L2 (R+ ) ].
= IE =
n
2
− ti−1 )
The stochastic integral operator extends to L2ad (Ω × R+ ) by density and a Cauchy sequence argument, applying the isometry (4.8). Proposition 4.12. For any u ∈ L2ad (Ω × R+ ) we have IE
∞
t us dMs Ft = us dMs ,
0
In particular,
t 0
t ∈ R+ .
0
us dMs is Ft -measurable, t ∈ R+ .
Proof. Let u ∈ P have the form u = G1(a,b] , where G is bounded and Fa measurable. i) If 0 ≤ a ≤ t we have ∞ us dMs Ft = IE [G(Mb − Ma )|Ft ] IE 0
= GIE [(Mb − Ma )|Ft ]
38
N. Privault
= GIE [(Mb − Mt )|Ft ] + GIE [(Mt − Ma )|Ft ] = G(Mt − Ma ) ∞ = 1[0,t] (s)us dMs . 0
ii) If 0 ≤ t ≤ a we have for all bounded Ft -measurable random variable F : ∞ us dMs = IE [F G(Mb − Ma )] = 0, IE F 0
hence IE
∞
us dMs Ft = IE [G(Mb − Ma )|Ft ] = 0 =
0
∞
1[0,t] (s)us dMs .
0
This statement is extended by linearity and density, since from the continuity of the conditional expectation on L2 we have: ∞ 2 t IE us dMs − IE us dMs Ft 0
0
t
uns dMs
= lim IE n→∞
∞
−
uns dMs
0
≤ lim IE n→∞
= lim IE
uns dMs
∞
2 us dMs Ft
− 0
2
(uns − us )dMs
0 ∞
2 us dMs Ft
0 ∞
∞ 0
∞
≤ lim IE IE n→∞
2 us dMs Ft
0
= lim IE IE
n→∞
− IE
0
n→∞
∞
|uns − us |2 ds
0
= 0. In particular, since F0 = {∅, Ω}, the Itˆo integral is a centered random variable by Proposition 4.12, i.e. ∞ us dMs = 0. IE (4.9) 0
The following is an immediate corollary of Proposition 4.12.
Potential Theory in Classical Probability
39
Corollary 4.13. The indefinite stochastic integral L2ad (Ω
t 0
us dMs
× R+ ) is a martingale, i.e.: IE
t
ur dMr Fs =
0
t∈R+
of u ∈
s
ur dMr ,
0 ≤ s ≤ t.
0
Clearly, from Definitions 4.5 and (4.7), J1 (u) coincides with the single stochastic integral I1 (u) with respect to (Bt )t∈R+ . On the other hand, since the standard compensated Poisson martingale (Mt )t∈R+ = (Nt − t)t∈R+ is a normal martingale, the integral
T
ut dMt 0
is also defined in the Itˆ o sense, i.e. as an L2 (Ω)-limit of stochastic integrals of simple adapted processes.
4.3 Quadratic Variation We now introduce the notion of quadratic variation for normal martingales. Definition 4.14. The quadratic variation of (Mt )t∈R+ is the process ([M, M ]t )t∈R+ defined as [M, M ]t = Mt2 − 2
t
Ms dMs ,
t ∈ R+ .
(4.10)
0
Let now π n = {0 = tn0 < tn1 < · · · < tnn−1 < tnn = t} denote a family of subdivision of [0, t], such that |π n | := maxi=1,...,n |tni −tni−1 | converges to 0 as n goes to infinity. Proposition 4.15. We have [M, M ]t = lim
n→∞
n
(Mtni − Mtni−1 )2 ,
t ≥ 0,
i=1
where the limit exists in L2 (Ω) and is independent of the sequence (π n )n∈N of subdivisions chosen. Proof. As an immediate consequence of the definition 4.7 of the stochastic integral, we have t Ms (Mt − Ms ) = Ms dMr , 0 ≤ s ≤ t, s
40
N. Privault
and [M, M ]tni − [M, M ]tni−1 = Mt2ni − Mt2ni−1 − 2
tn i
Ms dMs tn i−1
= (Mtni − Mtni−1 )2 + 2
tn i
tn i−1
(Mtni−1 − Ms )dMs ,
hence ⎡ 2 ⎤ n IE ⎣ [M, M ]t − (Mtni − Mtni−1 )2 ⎦ i=1
⎡ 2 ⎤ n [M, M ]tni − [M, M ]tni−1 − (Mtni − Mtni−1 )2 ⎦ = IE ⎣ i=1
⎡ 2 ⎤ n t 1(tni−1 ,tni ] (s)(Ms − Mtni−1 )dMs ⎦ = 4IE ⎣ i=1
= 4IE
= 4IE
n
0
tn i
n i=1 ti−1 n n ti
i=1
tn i−1
(Ms − Mtni−1 ) ds 2
(s −
tni−1 )2 ds
≤ 4t|π|. Proposition 4.16. The quadratic variation of Brownian motion (Bt )t∈R+ is [B, B]t = t,
t ∈ R+ .
Proof. (cf. e.g. Protter [Pro05], Theorem I-28). For every subdivision {0 = tn0 < · · · < tnn = t = t} we have, by independence of the increments of Brownian motion: ⎡ 2 ⎤ n IE ⎣ t − (Btn − Btn )2 ⎦ i
i−1
i=1
⎡ 2 ⎤ n (Btni − Btni−1 )2 − (tni − tni−1 ) ⎦ = IE ⎣ i=1
⎡ 2 ⎤ 2 n − Btn (B ) t i i−1 (tni − tni−1 )2 IE ⎣ −1 ⎦ = n − tn t i i−1 i=1 n
Potential Theory in Classical Probability
41
= IE[(Z 2 − 1)2 ]
n
(tni − tni−1 )2
i=0
≤ t|π|IE[(Z 2 − 1)2 ],
where Z is a standard Gaussian random variable.
A simple analysis of the Poisson paths shows that the quadratic variation of the compensated Poisson process (Mt )t∈R+ = (Nt − t)t∈R+ is [M, M ]t = Nt ,
t ∈ R+ .
Similarly for the compensated compound Poisson martingale Xt − λtIE[Y1 ] , Mt := λVar[Y1 ] we have [M, M ]t =
Nt
|Yk |2 ,
t ∈ R+ ,
t ∈ R+ .
k=1
Definition 4.17. The angle bracket M, M t is the unique increasing process such that Mt2 − M, M t , t ∈ R+ , is a martingale. As a consequence of Remark 4.3 we have M, M t = t,
t ∈ R+ ,
for every normal martingale. Moreover, [M, M ]t − M, M t ,
t ∈ R+ ,
is also a martingale as a consequence of Remark 4.3 and Proposition 4.12, since by Definition 4.14 we have t [M, M ]t − M, M t = [M, M ]t − t = Mt2 − t − 2 Ms dMs , t ∈ R+ . 0
(4.11) Definition 4.18. We say that the martingale (Mt )t∈R+ has the predictable representation property if any square-integrable martingale (Xt )t∈R+ with respect to (Ft )t∈R+ can be represented as
t
Xt = X0 +
us dMs , 0
t ∈ R+ ,
(4.12)
42
N. Privault
where (ut )t∈R+ ∈ L2ad (Ω × R+ ) is an adapted process such that u1[0,T ] ∈ L2 (Ω × R+ ) for all T > 0. It is known that Brownian motion and the compensated Poisson process have the predictable representation property. This is however not true of compound Poisson processes in general. Definition 4.19. An equation of the form t [M, M ]t = t + φs dMs ,
t ∈ R+ ,
(4.13)
0
where (φt )t∈R+ is a square-integrable adapted process, is called a structure ´ equation, cf. Emery [E90]. As a consequence of (4.11) and (4.12) we have the following proposition. Proposition 4.20. Assume that (Mt )t∈R+ is in L4 (Ω) and has the predictable representation property. Then (Mt )t∈R+ satisfies the structure equation (4.13), i.e. there exists a square-integrable adapted process (φt )t∈R+ such that t [M, M ]t = t + φs dMs , t ∈ R+ . 0
Proof. Since ([M, M ]t −t)t∈R+ is a martingale, the predictable representation property shows the existence of a square-integrable adapted process (φt )t∈R+ such that t φs dMs , t ∈ R+ . [M, M ]t − t = 0
In particular, a) the Brownian motion (Bt )t∈R+ satisfies the structure equation (4.13) with φt = 0, since the quadratic variation of (Bt )t∈R+ is [B, B]t = t, √ t ∈ R+ . Informally we have ∆Bt = ± ∆t with equal probabilities 1/2. b) The compensated Poisson martingale (Mt )t∈R+ = λ(Nt − t/λ2 )t∈R+ , where (Nt )t∈R+ is a standard Poisson process with intensity 1/λ2 satisfies the structure equation (4.13) with φt = λ ∈ R, t ∈ R+ , since [M, M ]t = λ2 Nt = t + λMt ,
t ∈ R+ .
In this case, ∆Mt ∈ {0, λ} with respective probabilities 1 − λ−2 ∆t and λ−2 ∆t. The Az´ema martingales correspond to φt = βMt , β ∈ [−2, 0), and provide examples of processes having the chaos representation property, but whose ´ increments are not independent, cf. Emery [E90]. Note that not all normal martingales have the predictable representation property. For instance, the compensated compound Poisson martingales do not satisfy a structure equation and do not have the predictable representation property in general.
Potential Theory in Classical Probability
43
4.4 Itˆ o’s Formula We consider a normal martingale (Mt )t∈R+ satisfying the structure equation d[M, M ]t = dt + φt dMt . Such an equation is satisfied in particular if (Mt )t∈R+ has the predictable representation property, cf. Proposition 4.20. The following is a statement of Itˆo’s formula for normal martingales, cf. ´ Emery [E90], Proposition 2, p. 70. Proposition 4.21. Assume that φ ∈ L∞ ad (R+ ×Ω). Let (Xt )t∈R+ be a process given by t
Xt = X0 +
t
us dMs +
vs ds,
0
(4.14)
0
where (us )s∈R+ , (vs )s∈R+ are adapted processes in L2ad ([0, t]×Ω) for all t > 0. We have for f ∈ C 1,2 (R+ × R):
f (s, Xs− + φs us ) − f (s, Xs− ) dMs φs
t
f (t, Xt ) − f (0, X0 ) = 0
t
f (s, Xs + φs us ) − f (s, Xs ) − φs us
+
φ2s
0
+ 0
(4.15)
t
∂f (s, Xs )vs ds + ∂x
0
t
∂f (s, Xs ) ∂x ds
∂f (s, Xs )ds. ∂s
If φs = 0, the terms f (Xs− + φs us ) − f (Xs− ) φs and
f (Xs + φs us ) − f (Xs ) − φs us f (Xs ) φ2s
can be replaced by their respective limits us f (Xs− ) and φs → 0.
1 2 − 2 us f (Xs )
as
Examples i) For the d-dimensional Brownian motion (Bt )t∈R+ , φ = 0 and the Itˆ o formula reads t 1 t ∇f (Bs ), dBs + ∆f (Bs )ds, f (Bt ) = f (B0 ) + 2 0 0
44
N. Privault
for all C 2 functions f , hence Tt f (x) = IEx [f (Bt )] t 1 t = IEx f (x) + ∇f (Bs ), dBs + ∆f (Bs )ds 2 0 0 t 1 = IEx f (x) + ∆f (Bs )ds 2 0 t 1 = f (x) + IEx [∆f (Bs )] ds 2 0 1 t Ts ∆f (x)ds, = f (x) + 2 0 1 ∆. 2 ii) For the compensated Poisson process (Nt − t)t∈R+ we have φs = 1, s ∈ R+ , hence
and as a Markov process, (Bt )t∈R+ has generator
t (f (1 + Ns− − s) − f (Ns− − s))d(Ns − s) f (Nt − t) = f (0) + 0 t (f (1 + Ns − s) − f (Ns − s) − f (Ns − s))ds, + 0
which can actually be recovered by elementary calculus. Hence the generator of the compensated Poisson process is Lf (x) = f (x + 1) − f (x) − f (x). From Itˆo’s formula we have for any stopping time τ and C 2 function u, under suitable integrability conditions: τ τ 1 ∇u(Bs ), dBs + IEx ∆u(Bs )ds IEx [u(Bτ )] = u(x) + IEx 2 0 0∞ τ 1 = u(x) + IEx 1{s≤τ } ∇u(Bs ), dBs + IEx ∆u(Bs )ds 2 0 0 τ 1 = u(x) + IEx ∆u(Bs )ds , (4.16) 2 0 which is called Dynkin’s formula, cf. Dynkin [Dyn65], Theorem 5.1. Let now σ : R+ × Rn → Rd ⊗ Rn and b : R+ × Rn → R satisfy the global Lipschitz condition
Potential Theory in Classical Probability
45
σ(t, x) − σ(t, y)2 + b(t, x) − b(t, y)2 ≤ K 2 x − y2 , t ∈ R+ , x, y ∈ Rn . Then there exists (cf. e.g. [Pro05], Theorem V-7) a unique strong solution to the stochastic differential equation t t Xt = X0 + σ(s, Xs )dBs + b(s, Xs )ds, 0
0
and (Xt )t∈R+ is a Markov process with generator L=
n n 1 ∂2 ∂ ai,j (t, x) + bi (t, x) , 2 i,j=1 ∂xi ∂xj ∂xi i=1
where a = σ T σ.
4.5 Killed Brownian Motion Let D be a domain in R2 . The transition operator of the Brownian motion (BtD )t∈[0,τ∂D ] killed on ∂D is defined as qtD (x, A) = Px (BtD ∈ A, τ∂D > t), where τ∂D = inf{t > 0 : Bt ∈ ∂D} is the first hitting time of ∂D by (Bt )t∈R+ . By the strong Markov property of Definition 3.4 we have Px (Bt ∈ A) = Px (Bt ∈ A, t < τ∂D ) + Px (Bt ∈ A, t ≥ τ∂D ) = qtD (x, A) + Px (Bt ∈ A, t ≥ τ∂D ) = qtD (x, A) + IEx [1{Bt ∈A} 1{t≥τ∂D } ] = qtD (x, A) + IEx [IE[1{Bt ∈A} 1{t≥τ∂D } | Fτ∂D ]] = qtD (x, A) + IEx [1{t≥τ∂D } IE[1{Bt ∈A} 1{t≥τ∂D } | Fτ∂D ]] = qtD (x, A) + IEx [1{t≥τ∂D } IE[1{Bt−τ∂D ∈A} | B0 = x]x=Bτ∂D ] = qtD (x, A) + IEx [Tt−τ∂D 1A (BτD∂D )1{t≥τ∂D } ], hence qtD (x, A) = Px (Bt ∈ A) − IEx [Tt−τ∂D 1A (BτD∂D )1{t≥τ∂D } ], and the killed process has the transition densities D pD t (x, y) := pt (x, y) − IEx [pt−τ∂D (Bτ∂D , y)1{t≥τ∂D } ],
x, y ∈ D, t > 0. (4.17)
46
N. Privault
The Green kernel is defined as
∞
gD (x, y) :=
pD t (x, y)dt,
0
and the associated Green potential is ∞ GD µ(x) = gD (x, y)µ(dy), 0
with in particular
τ∂D
GD f (x) := IE
f (Bt )dt 0
when µ(dx) = f (x)dx has density f with respect to the Lebesgue measure. When D = Rn we have τ∂D = ∞ a.s. hence GRn = G. Theorem 4.22. The function (x, y) → gD (x, y) is symmetric and continuous on D2 , and x → gD (x, y) is harmonic on D\{y}, y ∈ D. Proof. For all bounded domains A in Rn , the function GD 1A defined as τ∂D gD (x, y)1A (y)dy = IEx 1A (Bt )dt GD 1A (x) = Rn
0
¯ and the property extends to gD by has the mean value property in D\A, linear combinations and an limiting argument. From (4.17), the associated λ-potential kernel (3.4) is given by ∞ λ g λ (x, y) = e−λt pt (x, y)dt = gD (x, y) + g λ (z, y)hλD (x, dz),
(4.18)
0
where λ gD (x, y)
:=
∞
e−λt qtD (x, y)dt,
0
and
hλD (x, A) = IEx [e−λτ∂D 1{BτD
∂D
∈A} 1{τ∂D <∞} ].
5 Probabilistic Interpretations 5.1 Harmonicity We start by two simple examples on the connection between harmonic functions and stochastic calculus. First, we show that Proposition 2.2, i.e. the fact
Potential Theory in Classical Probability
47
that harmonic functions satisfy the mean value property, can be recovered using stochastic calculus. Let τr = inf{t ∈ R+ : Bt ∈ S(x, r)} denote the first exit time of (Bt )t∈R+ from the open ball B(x, r). Due to the spatial symmetry of Brownian motion, Bτr is uniformly distributed on S(x, r), hence IEx [u(Bτr )] = u(x)σxr (dy), S(x,r)
where σxr denotes the uniform surface measure on the sphere S(x, r). On the other hand, from Dynkin’s formula (4.16) we have τr 1 ∆u(Bs )ds . IEx [u(Bτr )] = u(x) + IEx 2 0 Hence the condition ∆u = 0 implies the mean value property u(y)σyr (dy), u(x) =
(5.1)
S(x,r)
and similarly the condition ∆u ≤ 0 implies u(x) ≥ u(y)σyr (dy).
(5.2)
S(x,r)
From Remark 3, page 134 of Dynkin [Dyn65], for all n ≥ 1 we have IEx [u(Bτ1/n )] − u(x) 1 ∆u(x) = lim , n→∞ 2 IEx [τ1/n ]
(5.3)
which shows conversely that (5.1), resp. (5.2), implies ∆u ≤ 0, resp ∆u = 0, which recovers Proposition 2.2. Next, we recover the superharmonicity property of the potential ∞ R0 f (x) = Tt f (x)dt (5.4) 0 ∞ = IEx f (Bt )dt ∞ 0 = f (y)pt (x, y)dtdy 0 Rn n−2 = hx (y)f (y)dy, x ∈ Rn . 2 Rn
48
N. Privault
Proposition 5.1. Let f be a non-negative function on Rn . Then the potential R0 f given in (5.4) is a superharmonic function provided it is C 2 on Rn . Proof. For all r > 0, using the strong Markov property (3.5) we have τr ∞ g(x) = IEx f (Bt )dt + IEx f (Bt )dt 0
τr
= IEx
τr
∞
f (Bt )dt + IEx IE 0
τr
f (Bt )dtBτr
τr
f (Bt )dt + IEx [g(Bτr )]
= IEx 0
≥ IEx [g(Bτr )] = g(y)σxr (dy), S(x,r)
which shows that g is ∆-superharmonic from Proposition 2.2.
Other non-negative superharmonic functionals can also be constructed by convolution, i.e. if f is ∆-superharmonic and g is non-negative and sufficiently integrable, then x → g(y)f (x − y)dy Rn
is non-negative and ∆-superharmonic. We now turn to an example in discrete time, with the notation of (3.1). Here a function f is called harmonic when (I − P )f = 0, and superharmonic if (I − P )f ≥ 0. Proposition 5.2. A function f is superharmonic if and only if the sequence (f (Xn ))n∈N is a supermartingale. Proof. We have IE[f (Xm ) | Fn ] = IE[f (Xm−n ) | X0 = x]x=Xn = Pm−n f (Xn ) ≤ f (Xn ).
5.2 Dirichlet Problem In this section we revisit the Dirichlet problem using probabilistic tools. Theorem 5.3. Consider an open domain in Rn and f a function on Rn , and assume that the Dirichlet problem
Potential Theory in Classical Probability
49
2
1.5
1
0.5
0
-0.5
-1
-1.5
-2 -2
-1.5
-1
-0.5
0
0.5
1
1.5
2
2.5
Fig. 9 Sample paths of a two-dimensional Brownian motion.
⎧ ⎨ ∆u = 0, ⎩
x ∈ D,
u(x) = f (x),
x ∈ ∂D,
has a C 2 solution u. Then we have u(x) = IEx [f (Bτ∂D )],
¯ x ∈ D,
where τ∂D = inf{t > 0 : Bt ∈ ∂D} is the first hitting time of ∂D by (Bt )t∈R+ . Proof. For all r > 0 such that B(x, r) ⊂ D we have u(x) = IEx [f (Bτ∂D )] = IEx [IE[f (Bτ∂D ) | Bτr ]] = IEx [u(Bτr )] = u(y)σxr (dy),
¯ x ∈ D,
S(x,r)
hence u has the mean value property, thus ∆u = 0 by Proposition 2.2.
50
N. Privault
5.3 Poisson Equation In the next theorem we show that the resolvent ∞ −λt Rλ f (x) = IEx e f (Bt )dt ∞ 0 = e−λt Tt f (x)dt, x ∈ Rn , 0
solves the Poisson equation. This is consistent with the fact that Rλ = (λI − ∆/2)−1 , cf. Relation (3.3) in Theorem 3.2. Theorem 5.4. Let λ > 0 and f a non-negative function on Rn , and assume that the Poisson equation 1 ∆u(x) − λu(x) = −f (x), 2 has a Cb2 solution u. Then we have ∞ e−λt f (Bt )dt , u(x) = IEx
x ∈ Rn ,
(5.5)
x ∈ Rn .
0
Proof. By Itˆ o’s formula, t e−λt u(Bt ) = u(B0 ) + e−λs ∇u(Bs ), dBs 0 t 1 t −λs e ∆u(Bs )ds − λ e−λs u(Bs )ds + 2 0 0 t 1 t −λs −λs e ∇u(Bs ), dBs − e f (Bs )ds, = u(B0 ) + 2 0 0 hence by taking expectations on both sides and using (4.9) we have t 1 −λt −λs e IEx [u(Bt )] = u(x) − IEx e f (Bs )ds , 2 0 and letting t tend to infinity we get 1 0 = u(x) − IEx 2
∞
e−λs f (Bs )ds .
0
When λ = 0, a similar result holds under the addition of a boundary condition on a smooth domain D.
Potential Theory in Classical Probability
51
2 1.5 1 0.5 0 -0.5 -1 -1.5 -2 -2
-1.5
-1
-0.5
0
0.5
1
1.5
2 2
1 1.5
0 0.5
-1 -0.5
-2 -1.5
Fig. 10 Sample paths of a three-dimensional Brownian motion.
Theorem 5.5. Let f a non-negative function on Rn , and assume that the Poisson equation ⎧ 1 ⎪ ⎨ ∆u(x) = −f (x), x ∈ D, 2 (5.6) ⎪ ⎩ u(x) = 0, x ∈ ∂D, has a Cb2 solution u. Then we have τ∂D f (Bt )dt , u(x) = IEx
x ∈ D.
0
Proof. Similarly to the proof of Theorem 5.4 we have t 1 t u(Bt ) = u(B0 ) + ∇u(Bs ), dBs + ∆u(Bs )ds 2 0 0 t t ∇u(Bs ), dBs − f (Bs )ds, = u(B0 ) + 0
hence
0
0 = IEx [u(Bτ∂D )] = u(x) − IEx l
τ∂D
f (Bs )ds .
0
We easily check that the boundary condition u(x) = 0 is satisfied on x ∈ ∂D since τ∂D = 0 a.s. given that B0 ∈ ∂D. The probabilistic interpretation of the solution of the Poisson equation can also be formulated in terms of a Brownian motion killed at the boundary ∂D, cf. Section 4.5.
52
N. Privault
Proposition 5.6. The solution u of (5.6) is given by u(x) = GD f (x) = gD (x, y)f (y)dy, Rn
x ∈ D,
where gD and GD f are the Green kernel and the Green potential of Brownian motion killed on ∂D. Proof. We first need to show that the function gD is the fundamental solution of the Poisson equation. We have τ∂D τ∂D 1A (Bt )dt = IEx 1A (BtD )dt IEx 0 0 τ∂D = IEx 1{BtD ∈A} dt 0 ∞ 1{BtD ∈A} dt = IEx ∞ 0 = Px (BtD ∈ A)dt 0
∞
qtD (x, A)dt ∞ pD = t (x, y)dydt =
0
0
A
= GD 1A (x) gD (x, y)1A (y)dy, = Rn
hence u(x) = IEx
τ∂D
f (BtD )dt
0
= GD f (x) =
Rn
gD (x, y)f (y)dy.
The solution of (5.6) can also be expressed using the λ-potential kernel g λ . Proposition 5.7. The solution u of (5.5) can be represented as ∞ u(x) = e−λt qtD (x, y)f (y)dydt 0 Rn + f (y) g λ (z, y)IEx [e−λτ∂D 1{BτD ∈dz} 1{τ∂D <∞} ]dy, Rn
x ∈ D.
Rn
∂D
Potential Theory in Classical Probability
53
Proof. From (4.18) we have u(x) = Rλ f (x) = g λ (x, y)f (y)dy Rn λ gD (x, y)f (y)dy + f (y) g λ (z, y)hλD (x, dz)dy = Rn Rn Rn ∞ = e−λt qtD (x, y)f (y)dydt n 0 R + f (y) g λ (z, y)IEx [e−λτ∂D 1{BτD ∈dz} 1{τ∂D <∞} ]dy. Rn
∂D
Rn
In discrete time, the potential kernel of P is defined as G=
∞
P n,
n=0
and satisfies Gf (x) = IEx
∞
f (Xn ) ,
n=0
i.e. G1A (x) =
∞
Px ({Xn ∈ A}).
n=0
The Poisson equation with second member f is here the equation (I − P )u = f. Let τD = inf{n ≥ 1 : Xn ∈ D} denote the hitting time of D ⊂ E. Then the function τ D u(x) := IEx f (Xk ) , x ∈ E, k=1
solves the Poisson equation ⎧ ⎨ (I − P )u(x) = f (x), ⎩
u(x) = 0,
x ∈ D.
x ∈ E,
54
N. Privault
5.4 Cauchy Problem This section presents a version of the Feynman-Kac formula. Consider the partial differential equation (PDE) ⎧ ∂u 1 ⎪ ⎨ (t, x) = ∆u(t, x) − V (x)u(t, x) ∂t 2 (5.7) ⎪ ⎩ u(0, x) = f (x). Proposition 5.8. Assume that f, V ∈ Cb (Rn ) and V is non-negative. Then the solution of (5.7) is given by t V (Bs )ds f (Bt ) , t ∈ R+ , x ∈ Rn . (5.8) u(t, x) = IEx exp − 0
Proof. Let t ˜ Tt f (x) = IEx exp − V (Bs )ds f (Bt ) ,
t ∈ R+ ,
x ∈ Rn .
0
We have t+s V (Bu )du f (Bt+s ) T˜t+s f (x) = IEx exp − 0 t+s t = IEx exp − V (Bu )du exp − V (Bu )du f (Bt+s ) 0 t t+s = IEx IE exp − V (Bu )du f (Bt+s )Ft 0 t+s t V (Bu )du IE exp − V (Bu )du f (Bt+s )Ft = IEx exp − 0 t s t V (Bu )du IE exp − V (Bu )du f (Bs )B0 = x = IEx exp − = IEx
0
t V (Bu )du T˜s f (Bt ) exp −
0
x=Bt
0
= T˜t T˜s f (x), hence (T˜t )t∈R+ has the semigroup property. Next we have t 1 T˜t f (x) − f (x) = V (Bu )du f (Bt ) − f (x) IEx exp − t t 0 t 1 1 = (IEx [f (Bt )] − f (x)) + IEx exp − V (Bu )du f (Bt ) + o(t), t t 0
Potential Theory in Classical Probability
55
hence
dT˜t 1 |t=0 f (x) = ∆f (x) − V (x)f (x), dt 2 and u given by (5.8) satisfies
x ∈ R,
(5.9)
dT˜t ∂u (t, x) = f (x) ∂t dt dT˜t = |t=0 T˜t f (x) dt 1 ∆ − V (x) T˜t f (x) = 2 1 = ∆u(t, x) − V (x)u(t, x). 2 Moreover, (5.9) also yields 1 t f (y)pt (x, y)dy = f (x) + ∆x f (y)ps (x, y)dyds 2 0 Rn Rn 1 t f (y)∆x ps (x, y)dyds, = f (x) + 2 0 Rn for all sufficiently regular functions f on Rn , where pt (x, y) is the Gaussian density kernel. Hence we get, after differentiation with respect to t, ∂pt 1 (x, y) = ∆x pt (x, y). ∂t 2
(5.10)
From (5.10) we recover the harmonicity of hy on Rn \{y}: ∞ ∆x hy (x) = ∆x pt (x, y)dt 0 ∞ = ∆x pt (x, y)dt 0 ∞ ∂pt (x, y)dt =2 ∂t 0 = 2 lim pt (x, y) − 2 lim pt (x, y) t→∞
t→0
= 0, provided x = y. The backward Kolmogorov partial differential equation ⎧ ∂u 1 ⎪ ⎨ − (t, x) = ∆u(t, x) − V (x)u(t, x), ∂t 2 (5.11) ⎪ ⎩ u(T, x) = f (x), can be similarly solved as follows.
56
N. Privault
Proposition 5.9. Assume that f, V ∈ Cb (Rn ) and V is non-negative. Then the solution of (5.11) is given by T V (Bs )ds f (BT )Bt = x , (5.12) u(t, x) = IE exp − t
t ∈ R+ , x ∈ Rn . Proof. Letting u(t, x) be defined by (5.12) we have t exp − V (Bs )ds u(t, Bt ) 0 t T V (Bs )ds IE exp − V (Bs )ds f (BT )Ft = exp −
0
= IE exp −
T
t
V (Bs )ds f (BT )Ft ,
0
o’s formula t ∈ R+ , x ∈ Rn , which is a martingale by construction. Applying Itˆ to this process we get t exp − V (Bs )ds u(t, Bt ) 0 s t = u(0, B0 ) + exp − V (Bτ )dτ ∇x u(s, Bs ), dBs 0 0 s 1 t + exp − V (Bτ )dτ ∆x u(s, Bs )ds 2 0 0 s t − V (Bs ) exp − V (Bτ )dτ u(s, Bs )ds 0 0 t s ∂u + u(s, Bs )ds. exp − V (Bτ )dτ ∂s 0 0 The martingale property shows that the absolutely continuous finite variation terms vanish (see e.g. Corollary II-1 of Protter [Pro05]), hence 1 ∂u ∆x u(s, Bs ) − V (Bs )u(s, Bs ) + (s, Bs ) = 0, 2 ∂s which leads to (5.11).
s ∈ R+ ,
Potential Theory in Classical Probability
57
5.5 Martin Boundary Our aim is now to provide a probabilistic interpretation of the Martin boundary in discrete time. Namely we use the Martin boundary theory to study the way a Markov chain with transition operator P leaves the space E, in particular when E is a union E=
∞
En ,
n=0
of transient sets En , n ∈ N. We assume that E is a metric space with distance δ and that the Cauchy completion of E coincides with its Alexandrov compactification (E, xˆ). For simplicity we will assume that the transition operator P is self-adjoint with respect to a reference measure m. Let now G denote the potential Gf (x) :=
∞
x ∈ E.
P n f (x),
n=0
with kernel g(·, ·), satisfying Gf (x) = f (y)g(x, y)m(dy),
x ∈ E,
E
for a given reference measure m. Fix x0 ∈ E1 . For f in the space Cc (E) of compactly supported function on E, define the kernel kx0 (x, z) =
g(x, z) , g(x, x0 )
x, z ∈ E,
and the operator Kx0 f (x) :=
Gf (x) = g(x, x0 )
kx0 (x, z)f (z)m(dz),
x ∈ E.
E
Consider a sequence (fn )n∈N dense in Cc (E) and the metric defined by d(x, y) :=
∞
ζn |Kx0 fn (x) − Kx0 fn (y)|,
n=1
where (ζn )n∈N is a sequence of non-negative numbers such that ∞ n=1
ζn Kx0 fn ∞ < ∞.
58
N. Privault
ˆ for X started with distribution rm is constructed as the The Martin space E Cauchy completion of (E, δ + d). Then Kx0 f , f ∈ Cc (E), can be extended ˆ since for all ε > 0 there exists n ∈ N such that for all by continuity to E x, y ∈ E, |Kx0 f (x) − Kx0 f (y)| ≤ |Kx0 f (x) − Kx0 fn (x)| + |Kx0 fn (x) − Kx0 fn (y)| + |Kx0 fn (y) − Kx0 f (y)| ≤ ε + ζn d(x, y), and, from Proposition 2.3 of Revuz [Rev75], the sequence (Kx0 fn )n∈N is dense in {Kx0 f : f ∈ Cc (E)}. If x ∈ ∆E, a sequence (xn )n∈N ⊂ E converges to x if and only if it converges to point at infinity x ˆ for the metric δ and (Kx0 f (xn ))n∈N converges to Kx0 f (x) for every f ∈ Cc (E). Finally we have the following result, for which we refer to [Rev75]. ˆ and the law Theorem 5.10. The sequence (Xn )n∈N converges Px0 -a.s. in E of X∞ under Px0 is carried by ∆E.
References [Bas98]
R.F. Bass. Diffusions and elliptic operators. Probability and its Applications (New York). Springer-Verlag, New York, 1998. [BH91] N. Bouleau and F. Hirsch. Dirichlet Forms and Analysis on Wiener Space. de Gruyter, 1991. [Bia93] Ph. Biane. Calcul stochastique non-commutatif. In Ecole d’Et´ e de Probabilit´ es de Saint-Flour, volume 1608 of Lecture Notes in Mathematics. Springer-Verlag, 1993. ´ ements de la th´ [Bre65] M. Brelot. El´ eorie classique du potentiel. 3e ´ edition. Les cours de Sorbonne. 3e cycle. Centre de Documentation Universitaire, Paris, 1965. Re-edited by Association Laplace-Gauss, 1997. [Chu95] K.L. Chung. Green, Brown, and probability. World Scientific, 1995. [Doo84] J.L. Doob. Classical potential theory and its probabilistic counterpart. SpringerVerlag, Berlin, 1984. [dP70] N. du Plessis. An introduction to potential theory. Oliver & Boyd, 1970. [Dyn65] E.B. Dynkin. Markov processes. Vols. I, II. Die Grundlehren der Mathematischen Wissenschaften. Academic Press Inc., New York, 1965. ´ ´ [E90] M. Emery. On the Az´ema martingales. In S´ eminaire de Probabilit´ es XXIII, volume 1372 of Lecture Notes in Mathematics, pages 66–87. Springer Verlag, 1990. [EK86] S.N. Ethier and T.G. Kurtz. Markov processes, characterization and convergence. John Wiley & Sons Inc., New York, 1986. [FOT94] M. Fukushima, Y. Oshima, and M. Takeda. Dirichlet Forms and Symmetric Markov Processes. de Gruyter, 1994. [Hel69] L.L. Helms. Introduction to potential theory, volume XII of Pure and applied mathematics. Wiley, 1969. [HL99] F. Hirsch and G. Lacombe. Elements of functional analysis, volume 192 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1999.
Potential Theory in Classical Probability [IW89] [JP00] [Kal02] [MR92] [Pro05] [PS78] [Rev75]
59
N. Ikeda and S. Watanabe. Stochastic Differential Equations and Diffusion Processes. North-Holland, 1989. J. Jacod and Ph. Protter. Probability essentials. Springer-Verlag, Berlin, 2000. O. Kallenberg. Foundations of modern probability. Probability and its Applications. Springer-Verlag, New York, second edition, 2002. Z.M. Ma and M. R¨ ockner. Introduction to the theory of (nonsymmetric) Dirichlet forms. Universitext. Springer-Verlag, Berlin, 1992. Ph. Protter. Stochastic integration and differential equations. Stochastic Modelling and Applied Probability, Vol. 21. Springer-Verlag, Berlin, 2005. S.C. Port and C.J. Stone. Brownian motion and classical potential theory. Academic Press, 1978. D. Revuz. Markov chains. North Holland, 1975.
Introduction to Random Walks on Noncommutative Spaces Philippe Biane
Abstract We introduce several examples of random walks on noncommutative spaces and study some of their probabilistic properties. We emphasize connections between classical potential theory and group representations.
1 Introduction Whereas random walks form one of the most investigated class of stochastic processes, their noncommutative analogues have been studied only recently. In these lectures I will present some results on random walks which take their values in noncommutative spaces. The notion of a noncommutative space has emerged progressively from the development of quantum physics, see e.g. [C]. The key idea is to consider not the space itself but the set of real, or complex functions on it. For a usual space, this forms an algebra, which is commutative by nature. A noncommutative space is given by a noncommutative (usually complex) algebra which is to be thought of as the algebra of complex functions on the space. We shall explain this idea in more details in section 2, and in particular define noncommutative probability spaces. Once noncommutative spaces have been defined in this way it is easy to define random variables, and stochastic processes taking their values in these spaces. Rather than starting an abstract theory, these lectures will consist mainly in a collection of examples, which I think show that this notion is interesting and worth studying. We shall begin with the most simple stochastic process namely the Bernoulli random walk. We shall show how to quantize it in order to construct the quantum Bernoulli random walk. Simple as it is this P. Biane Institut d’´electronique et d’informatique Gaspard-Monge, 77454 Marne-la-Vall´ee Cedex 2, France e-mail:
[email protected] U. Franz, M. Sch¨ urmann (eds.) Quantum Potential Theory. Lecture Notes in Mathematics 1954. c Springer-Verlag Berlin Heidelberg 2008
61
62
P. Biane
noncommutative stochastic process exhibits quite deep properties, related to group representation and potential theory. Actually interpreting it as a random walk with values in a noncommutative space, the dual of SU (2), we will be lead to define random walks with values in duals of compact groups. The study of such random walks in the case of special unitary groups uncovers connections with potential theory, in particular with the Martin boundary. We will investigate more on these connections. From the Bernoulli random walk we can take limit objects, as in the central limit theorem. One of these objects is a noncommutative Brownian motion which we construct as a family of operators on a Fock space and interpret then as a continuous time stochastic process with independent increments, with values in the dual of the Heisenberg group. We then extend this construction to more general noncompact locally compact groups. Finally we will also start to consider quantum groups in the last section. The next section consists in preliminaries about C ∗ and von Neumann algebras and noncommutative spaces.
2 Noncommutative Spaces and Random Variables 2.1 What are Noncommutative Spaces? The random walks that we are going to study take their values in noncommutative spaces, so we should start by making this notion more precise. In many parts of mathematics, one studies spaces through the set of functions defined on them. There can be many kind of functions, e.g. measurable, integrable, continuous, bounded, differentiable, and so on. Each property of the functions reflects a property of the space on which they are defined. Sometimes, in probability theory for example, one is even not interested at all in the space, but only in the functions themselves, the random variables. Also very often the set of complex functions considered determines completely the underlying space. This is the case for example for compact topological spaces, determined by their algebra of continuous functions, or differentiable manifolds which are determined by their smooth functions. The common feature shared by these situations is that all these spaces of complex valued functions are commutative algebras. It has been realized, since the beginning of quantum mechanics that one can obtain a better description of nature by relaxing this commutativity hypothesis. Henceforth we shall consider a non commutative space as given by a complex algebra, which plays the role of space of functions on the space. We will see many examples throughout these lectures. Some algebras may come equipped with a supplementary structure, for example an antilinear involution, a norm, a preferred linear form, a topology, etc... Actually most of the times these algebras will be algebras
Introduction to Random Walks on Noncommutative Spaces
63
of operators on some complex Hilbert space H, and the involution will be given by the adjoint operation. We shall decribe the kind of algebras we will consider, mainly C ∗ and von Neumann algebras. We will use the language and some basic results in the theory of these objects, but we will need no deep knowledge of them. We will only assume that the reader is familiar with the spectral theorem for selfadjoint operators on a Hilbert space. We refer for example to the treatises [D1], [D2] or [T] for more details.
2.2 C ∗ Algebras A C ∗ algebra is a normed ∗-algebra which is isometric with a subalgebra of the algebra B(H) of all bounded operators on some complex Hilbert space H, stable under taking the adjoint, and closed for the operator norm topology. Elements in a C ∗ -algebra of the form aa∗ for some a ∈ A are called positive. Positive elements are exactly the selfadjoint positive operators which belong to the algebra. Let X be a locally compact topological space, then the algebra of complex continuous functions on X, vanishing at infinity, is a C ∗ -algebra, and the famous Gelfand-Naimark theorem states that any commutative C ∗ -algebra is isomorphic to such an algebra. The topological space is compact if and only if the algebra has a unit, and there is a one to one correspondence between the points of the space and the characters of the algebra, that is, the continuous algebra homomorphisms with values in the complex numbers, or equivalently with the maximal closed ideals, therefore the space is unique up to homeomorphism and can be recovered from the algebra. It is usually denoted by spec(A) if A is the C ∗ -algebra. Thus we should think of a C ∗ -algebra as providing the algebra of continuous functions on some noncommutative space. Note that C ∗ algebras are closed under continuous functional calculus, namely if a is a self-adjoint element in a C ∗ algebra, and f a continuous functions on its spectrum, then the operator f (a) also belongs to the algebra C. This can be easily seen by approximating uniformly f by polynomials on the spectrum of a. If A ⊂ B(H) is a C ∗ -algebra, then the multiplier algebra M (A) of A is the set of all operators x such that xA ⊂ A and Ax ⊂ A. It is a C ∗ algebra with a unit, containing A. It coincides with A if and only if A has a unit. If A is abelian, then M (A) is just the algebra of all bounded continuous functions on spec(A). In the noncommutative situation, it corresponds to the Stone-Cech compactification of the topological space underlying the algebra. Continuous positive linear functionals on a C ∗ algebra play the role of positive bounded measures. Here positivity for a functional means that it is positive on positive elements. Again in the commutative case, by Riesz’ theorem, such linear functionals correspond to finite positive Borel measures on the underlying topological space. Positive linear functionals of norm one
64
P. Biane
are called states, and correspond to probability measures in the commutative case. A large supply of states is given by unit vectors in the Hilbert space on which the C ∗ algebra acts. Indeed any such vector ψ defines a state by the formula a∈A ωψ (a) = aψ, ψ Given a self adjoint element a in a C ∗ algebra A, and a state σ on A, there exists a unique measure on R, with compact support, such that σ(f (a)) = f (x)dµ(x) for all continuous f on R. The support of this measure is included in the spectrum of a. The GNS construction assigns to every C ∗ algebra, with a continuous positive linear functional σ, a representation of the algebra on a Hilbert space. A linear functional is called tracial if for any a, b ∈ A one has τ (ab) = τ (ba). Each continuous map between topological spaces f : X → Y gives rise to a continuous algebra morphism Φf : C0 (Y ) → C0 (X); h → h ◦ f , and conversely any such algebra morphism comes from a continuous map, therefore one can think of a homomorphism between C ∗ algebras as a continuous map between the underlying noncommutative spaces (with the direction of the arrows reversed). One must note however that there may exist very few morphisms between two C ∗ algebras. For example there does not exist any nonzero homomorphism from the finite dimensional C ∗ algebra Mn (C) to Mm (C) if n > m. Indeed this is a purely algebraic fact, since Mn (C) is a simple algebra, if a homomorphism from Mn (C) is not injective, then it must be 0.
2.3 von Neumann Algebras Let S be a subset of B(H), then its commutant S is the set of bounded operators which commute with every element of S. A von Neumann algebra is a subalgebra of B(H) which is closed under under taking the adjoint, and is equal to its bicommutant, i.e. the commutant of its commutant. By the von Neumann bicommutant theorem the von Neumann algebras are the ∗-subalgebra of B(H), containing the identity operator, and closed for the strong topology. Since the strong topology is weaker than the operator norm topology any von Neumann algebra is also a unital C ∗ algebra, although generally too large to be interesting as such. A von Neumann algebra is closed under Borel functional calculus, namely if a ∈ M is self-adjoint and f is a bounded Borel function on the spectrum of a, then f (a) belongs to M , and again, the same is true for f (a1 , . . . , an ) where a1 , . . . , an are commuting selfadjoint operators in the von Neumann algebra, and f is a bounded Borel function defined on the product of their spectra.
Introduction to Random Walks on Noncommutative Spaces
65
The nuance between C ∗ algebras and von Neumann algebras can be grasped by looking at the commutative case. Indeed commutative von Neumann algebras correspond to measure spaces, more precisely any commutative von Neumann algebra is isomorphic to the algebra L∞ (X, m) where X is a measure space and m a positive measure (the algebra actually depends only on the class of the measure). This statement can be seen as a reformulation of the spectral theorem for commuting self-adjoint operators on a Hilbert space. Therefore it is natural to think of von Neumann algebras as “algebras of noncommutative random variables”. A normal state on a von Neumann algebra is a positive linear form which is continuous for the σ-weak topology and takes the value 1 on the unit. It corresponds, in the commutative case, to a probability measure, which is absolutely continuous with respect to the measure m. We shall sometimes call a von Neumann algebra, with a normal state, a “non commutative probability space”. A weight on a von Neumann algebra is a map ϕ from the cone of positive elements of the von Neumann algebra to [0, +∞], which is additive, and homogeneous, i.e. ϕ(λx) = λϕ(x) for x positive and real λ > 0. A weight is called normal if supi∈I ϕ(xi ) = ϕ(sup(xi )i∈I ) for every bounded increasing net (xi )i∈I . Coming back to the commutative case, weights are positive, possibly unbounded measures, in the measure class of m. A weight µ is called finite if µ(1) < ∞, in this case µ is a multiple of a state. Given a selfadjoint element, a ∈ M and a normal state σ on M , we denote by µa the distribution of a, namely the measure such that σ(f (a)) = f (x)dµa (x) for all bounded Borel functions on spec(a). More generally if a1 , . . . , an is a family of commuting self-adjoint operators in M , their joint distribution is the unique probability measure µa1 ,...,an on Rn such that σ(f (a1 , . . . , an )) = f (x)dµa1 ,...,an (x) for all bounded Borel function f on Rn . Let N ⊂ M be a von Neumann subalgebra, and σ a state on M , then a conditional expectation of M onto N is a norm one projection σ(.|N ) such that σ(a|N ) = a for all a ∈ N , σ(abc|N ) = aσ(b|N )c for all a, c ∈ N, b ∈ M , and σ(σ(b|N )) = σ(b) for all b ∈ M . Given M, N and σ, such a map need not exist, but it always exists, and is unique, if σ is tracial. We will consider spatial tensor products of von Neumann algebras. If A ⊂ B(H) and B ⊂ B(K) are two von Neumann algebras, their algebraic tensor product acts on the Hilbert space H ⊗ K, and the spatial tensor product of A and B is defined as the von Neumann algebra generated by this tensor product. Given an infinite family of von Neumann algebras (Ai ; i ∈ I) equipped with normal states ωi it is possible to construct an infinite tensor
66
P. Biane
product ⊗i (Ai , ωi ) which is a von Neumann algebra with a state ⊗i ωi . One considers operators of the form ⊗i∈I ai where ai ∈ Ai and ai = Id only for a finite number of i ∈ I. These generate an algebra, which is the algebraic tensor product of the Ai . One can define a positive linear functional on this ωi (ai ). The GNS construction algebraic tensor product by ω(⊗i∈I ai ) = then yields a Hilbert space H, with a pure state on B(H), and the von Neumann algebra tensor product is the von Neumann algebra in B(H) generated by this algebraic tensor product.
2.4 Random Variables, Stochastic Processes with Values in some Noncommutative Space Given a von Neumann algebra M equipped with a normal state σ, and a C ∗ algebra C, a random variable with values in C (or, more appropriately, in the noncommutative space underlying C), is a norm continuous morphism from C to M . The distribution of the random variable ϕ : C → M is the state on C given by σ ◦ ϕ. If the algebra C is commutative, then it corresponds to some topological space, and the state σ ◦ ϕ to a probability measure on this space. When C = C0 (R) there exists a self-adjoint element a ∈ M such that ϕ(f ) = f (a) for all f ∈ C, and we are back to the situation in the preceding section, where the distribution of a was defined. We will call the state σ ◦ ϕ the distribution of the random variable ϕ. More generally a family of random variables with values in some noncommutative space, indexed by some set, is a stochastic process. If A and B are two C ∗ -algebras, a positive map Φ : A → B is a linear map such that Φ(a) is positive for each positive a ∈ A. When A and B are commutative, thus A = C0 (X) and B = C0 (Y ), such a linear map can be realized as a measure kernel k(y, dx) where for each y ∈ Y one has a finite positive measure k(y, dx) on X. If A and B are unital, and Φ(I) = I then this kernel is a Markov kernel, i.e. all measures are probability measures. Thus we see that the generalization of a Markov kernel to the non-commutative context can be given by the notion of positive maps. It turns out however that this notion is slightly too general to be useful and it is necessary to restrict oneself to a particular class called completely positive maps. Definition 2.1. linear map between two C ∗ algebras A and B is called completely positive if, for all n ≥ 0, the map Φ ⊗ Id : A ⊗ Mn (C) → B ⊗ Mn (C) is positive. It is called unit preserving if furthermore Φ(Id) = Id. We shall consider semigroups of unit preserving, completely positive maps on a C ∗ algebra C. These will be indexed by a set of times which will be either the nonnegative integers (discrete times) or the positive real line (continuous time). Thus a discrete time semigroup of unit preserving, completely positive maps on a C ∗ algebra C will be a family (Φn : C → C)n≥0 of completely
Introduction to Random Walks on Noncommutative Spaces
67
positive maps, such that Φn ◦ Φm = Φn+m . In continuous time we will have a family (Φt )t∈R+ which satisfies Φt ◦ Φs = Φt+s . In the discrete time setting one has Φn = (Φ1 )n and the semigroup is deduced from the value at time 1. We shall denote generally the time set by T when we do not specify whether we are in discrete or continuous time. Definition 2.2. Let C be a C ∗ algebra, then a dilation of a semigroup (Φt )t∈T of completely positive maps on C is given by a von Neumann algebra M , with a normal state ω, an increasing family of von Neumann subalgebras Mt ; t ∈ T , with conditional expectations ω(.|Mt ), and a family of morphisms jt : C → (M, ω) such that for any t ∈ T and a ∈ C, one has jt (a) ∈ Mt and for all s < t (2.1) ω(jt (a)|Ms ) = js (Φt−s (a)) A dilation of a completely positive semigroup is the analogue in noncommutative probability of a Markov process, and the equation (2.1) expresses the Markov property of the process: the conditional expectation of the future on the past is a function of the present. Given a completely positive semigroup and an initial state, a dilation always exists [S]. Consider a completely positive semigroup on a C ∗ algebra C, and let B ⊂ C be a commutative C ∗ subalgebra, thus isomorphic to C0 (X) for some locally compact topological space X. If the image algebras jt (B); t ∈ T generate a commutative von Neumann algebra N ⊂ M , then there exists a probability space (Ω, F , P ) such that (N , ω) ∼ L∞ (Ω, F , P ), and random variables Xt : Ω → X, corresponding to the morphisms jt restricted to B, which form a classical stochastic process. If furthermore the C ∗ algebra B is invariant by the completely positive semigroup, then this semigroup defines a Markov semigroup of transition probabilities on the space X, and the stochastic process (Xt )t∈T is a Markov process with these probability transitions. This remark will be at the basis of many constructions of classical stochastic processes starting from quantum ones. Once a dilation of a completely positive semigroup is given, one can compute, for times t1 < · · · < tn , and a1 , . . . , an ∈ C, ω(jt1 (a1 ) . . . jtn (an )) = σ(Φt1 (a1 (Φt2 −t1 (a2 (. . . Φtn −tn−1 (an )) . . .) where σ = ω ◦ j0 is the initial state on C (the distribution of the process at time 0). Observe however that when the algebras jt (C); t ∈ T do not commute, this condition does not specifiy the values of ω(jt1 (a1 ) . . . jtn (an )) when the times t1 , . . . , tn are not ordered. We will say that two dilations j (1) , ω1 and j (2) , ω2 , are equivalent if one has (1)
(1)
(2)
(2)
ω1 (jt1 (a1 ) . . . jtn (an )) = ω2 (jt1 (a1 ) . . . jtn (an ))
68
P. Biane
where t1 , . . . , tn is an arbitrary sequence of times (i.e. not necessarily increasing) and a1 , . . . , an ∈ C. Thus if C is a commutative algebra, then all commutative dilations with the same initial distribution are equivalent, but for a given semigroup of completely positive maps there may exist a lot of non equivalent dilations. Actually we shall encounter in these lectures some natural noncommutative dilations of Markov semigroups on classical spaces! An important source of such dilations comes from restrictions: if B ⊂ C is a subalgebra and the completely positive semigroup leaves B invariant, then the restriction of (jt )t∈T to the subalgebra B is a dilation of the restriction of the completely positive semigroup.
3 Quantum Bernoulli Random Walks 3.1 Quantization of the Bernoulli Random Walk Our first example of a quantum random walk will be the quantization of the simple (or Bernoulli) random walk. This is just the random walk whose independent increments have values ±1. In order to quantize it we will replace the set of increments {±1} by its quantum analogue, namely the space of two by two complex matrices, with its structure of C ∗ -algebra. The subset of hermitian operators is a four dimensional real subspace, generated by the identity matrix I as well as the three matrices 01 0 −i 1 0 σy = σz = σx = 10 i 0 0 −1 The matrices σx , σy , σz are the Pauli matrices. They satisfy the commutation relations [σx , σy ] = 2iσz ;
[σy , σz ] = 2iσx ;
[σz , σx ] = 2iσy .
(3.1)
The group SU (2) acts by the automorphisms A → U AU ∗ on this C ∗ -algebra. We observe that this group is much larger than the group of symmetries of the two points space (which consists just of a two elements group). This action leaves the space generated by I invariant, and acts by rotations on the real three dimensional space generated by the Pauli matrices. Indeed the inner product on the space of hermitian matrices A, B = T r(AB) is invariant by unitary conjugation. A state ω on M2 (C) is given by a positive hermitian matrix S with trace 1, by the formula ω(A) = T r(AS). The most general such matrix can be written as 1 1 + u v + iw S= 2 v − iw 1 − u
Introduction to Random Walks on Noncommutative Spaces
69
where (u, v, w) ∈ R3 satisfies u2 + v 2 + w2 ≤ 1. The extreme points on the unit sphere (sometimes called the “Bloch sphere” in the physics litterature), correspond to pure states, when S is a projection on a one dimensional subspace. Any hermitian operator has a two-point spectrum, hence in a state ω its distribution is a probability measure on R supported by at most two points. In particular, for each of the Pauli matrices, its distribution in the state ω is a probability measure on {±1}, given by P (σx = 1) =
1+v 2
P (σy = 1) =
1+w 2
P (σz = 1) =
1+u 2
(3.2)
Mimicking the construction of a random walk, we use the infinite product algebra (M2 (C), ω)⊗N (recall the construction of section 2.3). For each Pauli matrix we build the matrices xn = I ⊗(n−1) ⊗σx ⊗I ⊗∞
yn = I ⊗(n−1) ⊗σy ⊗I ⊗∞ ,
zn = I ⊗(n−1) ⊗σz ⊗I ⊗∞
which represent the increments of the process. It is easy to see that, for example, the operators xn , for n ≥ 1, form a commuting family of operators, which is distributed, in the state ω ∞ , as a sequence of independent Bernoulli random variables. Then we put Xn =
n i=1
xi ;
Yn =
n
yi
Zn =
i=1
n
zi .
i=1
This gives us three families of operators (Xn )n≥1 ; (Yn )n≥1 and (Zn )n≥1 on this space. We observe that each of these three families consists in commuting operators, hence has a joint distribution. It is not difficult to check that this distribution is that of a Bernoulli random walk, whose increments have distribution given by the probability distributions on {±1} of formula (3.2). The three families of operators, however do not commute. In fact using the commutation relations (3.1) one sees that for n, m positive integers, [xn , ym ] = 2izm δnm and [Xn , Ym ] = 2iZn∧m
(3.3)
as well as the similar relations obtained by cyclic permutation of X, Y, Z. We will call the family of triples of operators (Xn , Yn , Zn ); n ≥ 1 a quantum Bernoulli random walk. We shall later interpret this noncommutative process as a random walk with values in some noncommutative space, however for the moment we will study some of its properties related to the automorphisms of the algebra M2 (C).
70
P. Biane
3.2 The Spin Process Because of the rotation invariance of the commutation relations (3.1), we see that for any unitary matrix U we can define conjugated variables ⊗(n−1) xU ⊗ U σx U ∗ ⊗ I ⊗∞ n = I
ynU = I ⊗(n−1) ⊗ U σy U ∗ ⊗ I ⊗∞ znU = I ⊗(n−1) ⊗ U σz U ∗ ⊗ I ⊗∞ and XnU =
n
xU i ;
YnU =
i=1
n
yiU
ZnU =
i=1
n
ziU
i=1
then this new stochastic process is obtained from the original quantum Bernoulli random walk by a rotation matrix. It follows by a simple computation, using the commutation relations, that Xn2 + Yn2 + Zn2 is invariant under conjugation, namely one has Xn2 + Yn2 + Zn2 = (XnU )2 + (YnU )2 + (ZnU )2 for any unitary matrix U . Lemma 3.1. For all m, n ≥ 1 one has 2 2 + Ym2 + Zm ]=0 [Xn2 + Yn2 + Zn2 , Xm 2 2 + Ym2 + Zm ] = 0 if m ≤ n. This follows Actually we shall prove that [Xn , Xm from the computation
[Xn , Ym2 ] = [Xn , Ym ]Ym + Ym [Xn , Ym ] = 2i(Zm Ym + Ym Zm ) 2 [Xn , Zm ] = [Xn , Zm ]Zm + Zm [Xn , Ym ] = −2i(Zm Ym + Ym Zm )
Using invariance of the commutation relations by cyclic permutation of 2 2 2 2 + Ym2 + Zm ] = [Zn , Xm + Ym2 + Zm ] = 0, and X, Y, Z we also have [Yn , Xm the result follows. We deduce from this that the family of operators (Xn2 + Yn2 + Zn2 ); n ≥ 1 is commutative, and therefore defines a classical process. Weshall compute its distribution now. For this we introduce the operators Sn = Xn2 + Yn2 + Zn2 + I. By the preceding Lemma, the family (Sn )n≥0 is a commuting family of operators, therefore one can consider their joint distribution. Theorem 3.2. Let us take for ω the tracial state, then the operators (Sn ; n ≥ 1) form a Markov chain, with values in the positive integers, such that P (S1 = 2) = 1, and transition probabilities p(k, k + 1) =
k+1 ; 2k
p(k, k − 1) =
k−1 . 2k
Introduction to Random Walks on Noncommutative Spaces
71
In order to prove the theorem, it is enough to consider the process up to a finite time n. So we shall restrict considerations to a finite product M2 (C)⊗n acting on (C2 )⊗n . We remark that the state ω ⊗n on (C2 )⊗n is the unique tracial state, and it gives, to every orthogonal projection on a subspace V , the ) value dim(V 2n . We shall find a basis of this space consisting of joint eigenvectors of the operators (Sk ; 1 ≤ k ≤ n). For this we analyze the action of the 1 1 − operators A+ n := 2 (Xn − iYn ) and An = 2 (Xn + iYn ). One has A+ n =
n
I ⊗(j−1) ⊗ α+ ⊗ I ⊗n−j
A− n =
j=1
n
I ⊗(j−1) ⊗ α− ⊗ I ⊗n−j
j=1
where α+ =
00 10
α− =
01 . 00
Let us call e0 , e1 the canonical basis of C2 . An orthonormal basis of (C2 )⊗n is given by the vectors eU ; U ⊂ {1, 2, . . . , n} where eU = ei1 ⊗ . . . ⊗ ein , ik = 1 − / U . In terms of this basis the action of A+ if k ∈ U and ik = 0 if k ∈ n and An is given by A+ n eU = k∈U / eU∪{k} A− e = n U k∈U eU\{k} Zn eU = (n − 2|U |)eU Let us consider the vector e∅ = e⊗n and its images by the powers of A− n, 0 normalized to have norm one. These are the vectors ! j!(n − j)! j εn = eU j = 0, 1, . . . , n n! U⊂{1,2,...,n};|U|=j
− and these vectors are orthogonal. The action of the operators A+ n , An , Zn on these vectors is given by j (j + 1)(n − j)εj+1 A+ n εn = n j A− j(n − j + 1)εj−1 n εn = n Zn εjn = (n − 2j)εjn Sn εjn = (n + 1)εjn
In particular we see that these vectors belong to the eigenspace of Sn of eigenvalue n + 1. We shall generalize this computation to find the common eigenspaces of the operators S1 , S2 , . . . , Sn . Lemma 3.3. Let J = (j1 , . . . , jn ) be a sequence of integers such that • i) j1 = 2 • ii) ji ≥ 1 for all i ≤ n • iii) |ji+1 − ji | = 1 for all i ≤ n − 1
72
P. Biane
then there exists a subspace HJ of (C2 )⊗n of dimension jn = l + 1, which is an eigenspace of S1 , . . . , Sn , with respective eigenvalues j1 , . . . , jn , and an orthonormal basis (φ0 , . . . , φl ) such that A+ (j + 1)(l − j)φj+1 n φj = − An φj = j(l − j + 1)φj−1 Zn φj = (l − 2j)φj Furthermore, the spaces HJ are orthogonal and (C2 )⊗n = ⊕J HJ . Proof of the lemma. We shall use induction on n. The lemma is true for n = 1, using φ0 = e0 ; φ1 = e1 . Assume the lemma holds for n, and let J = (j1 , . . . , jn ) be a sequence satisfying the conditions i), ii), iii), of the lemma. We shall decompose the space HJ ⊗ C2 as a direct sum of two subspaces. Let the vectors ψj and ηj be defined by ! ψj = and
l−j+1 φj ⊗ e0 + l+1
! ηj =
j+1 φj+1 ⊗ e0 − l+1
!
j φj−1 ⊗ e1 l+1
!
l−j φj ⊗ e1 l+1
j = 0, . . . , l + 1
j = 0, . . . , l − 1
It is easy to check that these vectors form an orthonormal basis of the tensor product HJ ⊗ C2 , and a simple computation using Xn+1 = Xn + I ⊗n ⊗ σx , Yn+1 = Yn + I ⊗n ⊗ σy , Zn+1 = Zn + I ⊗n ⊗ σz shows that these vectors have the right behaviour under these operators. We can now prove theorem 3.2, indeed for any sequence satisfying the hypotheses of lemma 3.3 one has P (S1 = j1 , . . . , Sn = jn ) =
jn j1 j2 jn = ... 2n 2 2j1 2jn−1
where the right hand side is given by the distribution of the Markov chain of theorem 3.2. We shall give another, more conceptual, proof of the former result in section 5, using the representation theory of the group SU (2) and ClebschGordan formulas. For this we shall interpret the quantum Bernoulli random walk as a Markov process with values in a noncommutative space, but we need first to give some definitions pertaining to bialgebras and group algebras, which we do in the next section.
Introduction to Random Walks on Noncommutative Spaces
73
4 Bialgebras and Group Algebras 4.1 Coproducts Let X be a finite set, and F (X) be the algebra of complex functions on X. A composition law on X is a map X × X → X. This gives rise to a unit preserving algebra morphism ∆ : F (X) → F (X × X), where F (X × X) is the algebra of functions on X × X, and one has a natural isomorphism F (X × X) ∼ F(X) ⊗ F(X). Conversely, such an algebra morphism ∆ : F (X) → F (X) ⊗ F(X) comes from a composition law, and many properties of the composition law can be read on it. For example, associativity translates into coassociativity of the coproduct which means that (∆ ⊗ I) ◦ ∆ = (I ⊗ ∆) ◦ ∆ whereas commutativity gives cocommutativity for the coproduct, which means that v◦∆=∆ where v : F (X) ⊗ F(X) → F (X) ⊗ F(X) is the flip automorphism v(a ⊗ b) = b ⊗ a. In order to obtain an analogue of a composition law in the noncommutative context, one can define a coproduct for any algebra A as a morphism ∆ : A → A ⊗ A, however in general the algebraic tensor product is too small for obtaining interesting examples. Think for example to the case A = Cb (X), X a locally compact space, and see that A ⊗ A ⊂ Cb (X × X) is a small subspace. We shall therefore consider coproducts which take values in a suitable completion of the algebraic tensor product. An algebra endowed with a coassociative coproduct is called a bialgebra. If the algebra is a C ∗ (resp. a von Neumann) algebra and the tensor product is the minimal C ∗ product (resp. the von Neumann algebra tensor product), then one has a C ∗ (resp. a von Neumann) bialgebra. Some further properties of a coproduct are the existence of the dual notion of the unit element and the inverse, which are respectively called a counit, ε : A → C and an antipode, i : ∆ → ∆. A Hopf algebra is a bialgebra with a unit and an antipode, satisfying some compatibility conditions. I refer for example to [K] for an exposition of Hopf algebras and quantum groups.
4.2 Some Algebras Associated to a Compact Group We shall investigate in more details the notions above in the case of the group algebra of a compact group, which we assume for simplicity to be separable. Recall that every representation of a compact group can be made unitary, and can be reduced to an orthogonal direct sum of irreducible representations. The
74
P. Biane
right regular representation of a compact group G is the representation of G on L2 (G, m) (where m is a Haar measure on G) by right translations ρg f (h) = f (hg −1 ) and the left regular representation acts by left translations λg f (h) = f (gh). A fundamental theorem is the Peter-Weyl theorem. It states that every irreducible representation of G arises in the decomposition of the left (or right) regular representation, actually one has an orthogonal direct sum L2 (G) = ⊕χ∈Gˆ Eχ ˆ is the (countable) set of equivalence classes of irreducible representawhere G ˆ Eχ is the space of coefficients of the representation tions of G, and for χ ∈ G, i.e. the vector space generated by functions on G of the form f (g) = χ(g)u, v where u, v are vectors in the representation space of χ (., . being an invariant hermitian product on the space). The space Eχ is finite dimensional, its dimension being dim(χ)2 , and it is an algebra for the convolution product on G, isomorphic to the matrix algebra Mn (C) with n = dim(χ). We shall denote this space Mχ when we want to emphasize its algebra structure. We shall describe several algebras associated to G. The first one is the convolution algebra A0 (G) generated by the coefficients of the finite dimensional representations. As a vector space it is the algebraic direct sum A0 (G) = ⊕χ Mχ ∼ ⊕χ Mdim(χ) (C). There are larger algebras such as L1 (G) the space of integrable functions (with respect to the Haar measure on G), and C ∗ (G) the C ∗ algebra generated by L1 (G). This algebra consists of seˆ such that mχ ∈ Mχ ; |mχ | → 0 as χ → ∞. quences (mχ ; χ ∈ G) The multiplier algebra of C ∗ (G) coincides with the von Neumann algebra A(G), which is generated (topologically) by the left translation operators ˆ such that sup |mχ | < ∞. In λg ; g ∈ G, it consists of sequences (mχ ; χ ∈ G) χ both cases, the norm in these algebras is supχ |mχ |. Note that the left and right translation operators λg and ρg are unitary, and the right translation operators generate the commutant of A(G). When the group G is abelian, there is a natural isomorphism, given by ˆ where here G ˆ is Fourier transform, between the algebra A(G) and L∞ (G) the group of characters of G (this is consistent with our earlier notation since then all irreducible representations of G are one dimensional and are thus characters). This group of characters is a discrete abelian group, and its Haar measure is the counting measure. ˆ is isomorphic with the center of In the general case, the algebra L∞ (G) ˆ A(G), since a bounded function on G can be identified with a sequence (mχ )χ∈Gˆ of scalar operators. Any closed subgroup of G generates a von Neumann subalgebra A(H) furthermore the coproduct ∆ restricts to this subalgebra and defines a coproduct ∆ : A(H) → A(H) ⊗ A(H). If the subgroup is abelian, then this subalgebra ˆ is commutative and is isomorphic to the algebra L∞ (H),
Introduction to Random Walks on Noncommutative Spaces
75
ˆ Finally we shall also use the algebra A(G) = χ Mχ which consists in 2 unbounded operators on L (G), with common dense domain ⊕χ Eχ (algebraic direct sum), affiliated with the von Neumann algebra A(G). One has natural inclusions ˆ A0 (G) ⊂ C ∗ (G) ⊂ M (C ∗ (G)) = A(G) ⊂ A(G) ˆ ˆ The algebra A(G) ⊗ A(G) is an algebra of operators on the algebraic direct ˆ ˆ ˆ A(G) sum ⊕χ,χ Eχ ⊗ Eχ and we denote by A(G) ⊗ its completion for simple convergence on ⊕χ,χ Eχ ⊗ Eχ . One has ˆ ˆ ˆ ˆ ˆ A(G) A(G) ⊗ A(G) = Mχ ⊗ Mχ ⊂ A(G) ⊗ ∼ Mχ ⊗ Mχ χ
χ
χ,χ
ˆ The ∗ algebra structure extends obviously to A(G), and an element is positive if and only if its components are positive.
4.3 The Coproduct The coproduct formula ∆ : λg → λg ⊗ λg extends by linearity and continuity to the von Neumann algebra A(G) if we use the von Neumann algebra tensor product. It defines a structure of cocommutative von Neumann bialgebra on A(G). One can also define an extension of the coproduct ˆ ˆ ˆ ˆ A(G). ∆ˆ : A(G) → A(G) ⊗ ˆ and a ∈ Mχ , the operator ∆(a) Indeed it is easy to check that for any χ ∈ G, is nonzero on the space Eχ ⊗ Eχ if and only if χ has a non zero multiplicity in the decomposition of the tensor product representationEχ ⊗ Eχ . It follows that for any sequence (aχ )χ∈Gˆ ∈ χ∈Gˆ Mχ the sum χ∈Gˆ ∆(aχ ) is a finite sum in each component Eχ ⊗ Eχ therefore it defines an element in ˆ ˆ ˆ A(G) A(G) ⊗ ∼ χ,χ Mχ ⊗ Mχ . One can define the convolution of two finite weights µ and ν by the formula µ ∗ ν = (µ ⊗ ν) ◦ ∆ since the coproduct is cocommutative and coassociative, one checks that this is an associative and commutative operation.
4.4 The Case of Lie Groups For compact Lie groups there is another algebra of interest, which is the envelopping algebra of the Lie algebra. Recall that the Lie algebra of a Lie
76
P. Biane
group is composed of right invariant vector fields on the group. As such it acts on the L2 space as a family of unbounded operators. Therefore the Lie ˆ algebra is a subspace of the “big” algebra A(G), and the algebra generated by this subspace is naturally isomorphic to the envelopping Lie algebra (for simply connected groups). The elements of the Lie algebra have the following ˆ behaviour with respect to the extended coproduct on A(G) ∆(X) = X ⊗ I + I ⊗ X This can be seen by taking derivatives with respect to s in the equation ∆(esX ) = esX ⊗ esX where esX ; s ∈ R is the one parameter subgroup generated by X.
4.5 States and Weights A normal state ν on A(G) is determined by its value on the generators λg , thus by the function φν (g) = ν(λg ). It is a classical result that a function φ on G corresponds to a state on C ∗ (G), and to a normal state on A(G), if and only if it is a continuous positive definite function on the group, satisfying φ(e) = 1. Every normal weight on A(G) is given by a sequence of weights (νχ )χ∈Gˆ on each of the subalgebras Mχ , therefore for a weight ν on A(G) there exists a sequence of positive elements fχ ∈ Mχ such that νχ (a) = T r(afχ ) for all a ∈ Mχ . Conversely any such sequence fχ defines a normal weight, thus ˆ normal weights on A(G) correspond to positive elements in A(G).
5 Random Walk on the Dual of SU (2) 5.1 The Dual of SU (2) as a Noncommutative Space We shall now interpret the process constructed in section 3 as a random walk on a noncommutative space. For this we consider the group SU (2) of unitary 2×2 matrices with determinant 1. It is well known that the irreducible representations of this group are finite dimensional, moreover, for each integer n ≥ 1 there exists, up to equivalence, exactly one irreducible representation of dimension n, therefore one has A(SU (2)) = ⊕∞ n=1 Mn (C)
Introduction to Random Walks on Noncommutative Spaces
77
as a von Neumann algebra direct sum and similarly the C ∗ algebra of SU (2) can be identified with the algebra of sequences (Mn )n≥1 where Mn is an n × n matrix and one has Mn → 0 as n → ∞. We shall interpret this C ∗ -algebra as the space of “functions” vanishing at infinity on some noncommutative space. The associated von Neumann algebra corresponds to the space of “bounded functions” on our noncommutative space. In order to get a better picture of this space it is desirable to have a geometric understanding of its structure. For this we first note that this space has a continuous group of symmetries, since the group SU (2) acts on the algebra by inner automorphisms. Since the elements ±I act trivially, this is really an action of the quotient SU (2)/{±I} which is isomorphic with the group SO(3), therefore this space has a three dimensional rotational symmetry. We can understand this symmetry by looking at some special elements in the larger algebra ˆ A(SU (2)), which correspond to “unbounded functions”. Let us consider the self-adjoint elements corresponding to the Pauli matrices, viewed as elements of the Lie algebra of SU (2) (or rather the complexified Lie algebra). These define unbounded operators on L2 (SU (2)), which we shall denote X, Y, Z, ˆ and which lie in A(SU (2)). A good way to think about these three functions is as three “coordinates” on our space, corresponding to three orthogonal directions. Each of these elements has a spectrum which is exactly the set of integers (which you can view as the group dual to the one parameter group generated by one of these Lie algebra elements). Moreover this is true also of any linear combination xX + yY + zZ with x2 + y 2 + z 2 = 1. This means that if you are in this space and try to measure your position, you can measure, as in quantum mechanics, one coordinate in some direction (x, y, z) using the operator xX + yY + zZ, and you will always find an integer. Thus the space has some discrete feature, in that you always get integer numbers for your coordinates, but also a continuous rotational symmetry which comes from the action of SU (2) by automorphisms of the algebra. This is obviously impossible to obtain in a classical space. Of course since the operators in different directions do not commute, you cannot measure your position in different directions of space simultaneously. What you can do nevertheless is measure simultaneoulsy one coordinate in space, and your distance to the origin. This √ last measurement is done using the operator D = I + X 2 + Y 2 + Z 2 − I ˆ which is in the center of the algebra A(SU (2)), and therefore can be measured simultaneously with any other operator. Its eigenvalues are the nonnegative integers 0, 1, 2 . . . , and its spectral projections are the identity elements of ˆ (2)) the algebras Mn (C), more precisely, one has in A(SU D=
∞
(n − 1)IMn (C)
n=1
We thus see that the subalgebra Mn (C) is a kind of “noncommutative sphere of radius n − 1”, and moreover by looking at the eigenvalues of the operators xX + yY + zZ in the corresponding representation, we see
78
P. Biane
A(SU(2)) Fig. 1 Noncommutative space underlying A(SU (2)).
that on any “radius” of this sphere, corresponding to a direction of space, the coordinate on this radius can only take the n values n − 1, n − 3, n − 5, . . . , −n + 1. If we rescale the noncommutative sphere of large radius to have radius 1, it looks more and more like a classical sphere, see e.g. [Rie] for a precise statement.
5.2 Construction of the Random Walk Let ω be a state on M2 (C), which we can also consider as a state on A(SU (2)) by the projection A(SU (2)) → M2 (C). Let us consider the infinite tensor product algebra, with respect to the product state ν = ω ⊗∞ on N = ⊗∞ 1 A(SU (2))). Let T : N → N be defined by ∆ ⊗ s where s : A(SU (2))[2,∞[ → A(SU (2))[3,∞[ is the obvious shift isomorphism. Let jn : A(SU (2)) → N be the morphisms defined by by jn = T n ◦ i where i(a) = a ⊗ I ∞ is the GNS representation of A(SU (2)) associated with ω, acting on the first fac∞ where tor. Note that one has actually N = ⊗∞ 1 M2 (C) and i(a) = ρ2 (a) ⊗ I ρ2 is a two dimensional irreducible representation. The morphisms jn can be ˆ extended to the large algebra A(SU (2)) and for V in the Lie algebra, using the formula for the coproduct one checks that jn (V ) =
n i=1
I ⊗(i−1) ⊗ V ⊗ I ⊗∞
Introduction to Random Walks on Noncommutative Spaces
79
Thus the quantum Bernoulli random walk is obtained by taking the operators (jn (X), jn (Y ), jn (Z)) where X, Y, Z are the Lie algebra elements corresponding to the Pauli matrices. For n ≥ 0, we let Nn be the algebra generated by the first n factors in the tensor product. There exists a conditional expectation ν(.|Nn ) with respect to the state ν onto such a subalgebra, it is given simply by I ⊗ω ∞ on the factorization N = A(SU (2))⊗n ⊗A(SU (2))⊗[n+1,∞[ . The family of morphisms (jn )n≥1 form a noncommutative process wih values in the dual of SU (2). The following proposition is left to the reader, as an exercise in manipulation of coproducts. Proposition 5.1. The family of morphisms jn ; n ≥ 1, together with the family of algebras N , Nn ; n ≥ 1, and the conditional expectations ν(.|Nn ), form a dilation of the completely positive map A(SU (2)) → A(SU (2)) given by Φω = (I ⊗ ω) ◦ ∆. Let us now consider the three one-parameter subgroups generated by the Pauli matrices, they consist respectively of the matrices iθ cos θ i sin θ cos θ sin θ e 0 θ ∈ [0, 2π[ i sin θ cos θ − sin θ cos θ 0 e−iθ Each of these subgroups generates a commutative von Neumann subalgebra of A(SU (2)), which is isomorphic with the group von Neumann algebra of the group U (1) of complex numbers of modulus 1. Such a von Neumann algebra is isomorphic, by Pontryagin duality, to the algebra of bounded functions on the dual group, therefore the restriction of the dilation to this subalgebra provides a random walk on this dual group, which is isomorphic to Z. Thus we recover, from the abstract considerations on duals of compact groups, our concrete Bernoulli random walks. In terms of our noncommutative space, we can observe a particle undergoing this random walk along any fixed direction of space, and what we see is a Bernoulli random walk (recall that the coordinate in some fixed direction of space can only take integer values). We now turn to the spin process which can be interpreted in terms of the restriction of the dilation (jn )n≥1 to the center of the group algebra A(G). ˆ where each mχ is This center consists of operators of the form (mχ ; χ ∈ G) a scalar operator in Mχ , it is a commutative algebra, isomorphic with the ˆ (recall that we have assumed that G ˆ is algebra of bounded functions on G countable). Equivalently it is the algebra generated by the operator D i.e. the algebra of operators of the form f (D) where f is a bounded complex function on the nonnegative integers. It is also easy to compute the restriction of the completely positive map Φω to this center. It is given by the Clebsch-Gordan formula which computes the decomposition into irreducible of a tensor product of representations of the group SU (2). What we need is the formula (where ρn is the n-dimensional irreducible representation) ρ2 ⊗ ρn = ρn−1 ⊕ ρn+1
80
P. Biane
which tells us that the Markov chain can jump from n to either n− 1 or n+ 1, furthermore the transition probabilities are proportional to the dimensions of the targets, since we are in the trace state. We see that the restriction of jn to this algebra thus corresponds to the spin process. Finally there are other commutative algebras which are invariant under the completely positive map. They are generated by the center of A(SU (2)) and by a one parameter subgroup. Each such algebra is a maximal abelian subalgebra of A(SU (2)), and its spectrum can be identified with the set of pairs (m, n) of integers such that n ≥ 1 and m ∈ {n−1, n−3, . . .−n+1}. One can compute the associated Markov semigroup, using the Clebsch Gordan formulas for products of coefficient functions of the group SU (2). However the images of such an algebra by the morphisms (jn )n≥1 do not commute. Thus in this way we get a noncommutative dilation of a purely commutative semigroup. We will come back to this Markov chain when we study Pitman’s theorem and quantum groups.
6 Random Walks on Duals of Compact Groups It is easy to generalize the construction of the preceding section by replacing the group SU (2) by an arbitrary compact group G. We will do a construction parallel to the usual construction of a random walk on a group. Let φ0 and φ be continuous positive definite functions on G, with φ0 (e) = φ(e) = 1, thus these functions correspond to normal states ν0 and ν on A(G). The state ν0 will play the role of initial condition of our Markov chain, whereas the state ν represents the distribution of the increments. To the state ν is associated a completely positive map Φν : A(G) → A(G)
Φν = (I ⊗ ν) ◦ ∆.
The completely positive map generates a semigroup Φnν ; n ≥ 1. We now build the infinite tensor product N = A(G)∞ with respect to the state ν0 ⊗ ν ⊗∞ , and obtain a noncommutative probability space (N , ω). Let T : N → N defined by ∆⊗s where s : A(G)[1,∞[ → A(G)[2,∞[ is the obvious isomorphism. Let jn : A(G) → N be the morphisms defined by induction jn = T n ◦ i where i(a) = a ⊗ I ∞ is the inclusion of A(G) into the first factor (strictly speaking this is an inclusion only if the state ν0 is faithful). Let us translate the above construction in the case of an abelian group, ˆ The states ν and ν0 correspond to probability in terms of the dual group G. ˆ measures on G, the probability space is now the product of an infinite number ˆ with the product probability ν0 ⊗ ν ⊗∞ , and the maps jn of copies of G, ˆ ∞ → G given by Xn (g0 , g1 , . . . , gk , . . .) = correspond to functions Xn : G g0 g1 . . . gn−1 . We thus recover the usual construction of a random walk.
Introduction to Random Walks on Noncommutative Spaces
81
For n ≥ 0, we let Nn be the algebra generated by the first n + 1 factors in the tensor product. There exists a conditional expectation ω(.|Nn ) with respect to the state ω onto such a subalgebra, it is given simply by I ⊗ ν ∞ on the factorization N = A(G)⊗(n+1) ⊗ A(G)⊗∞ . Proposition 6.1. The morphisms (jn )n≥0 , together with the von Neumann algebras N , Nn , n ≥ 0 and the state ω, form a dilation of the completely positive semigroup (Φnν )n≥1 , with initial distribution ν0 . The proof of this proposition follows exactly the case of SU (2) treated in the preceding section. ˆ Let H be a closed commutative subgroup of G, then its dual group H is a countable discrete abelian group. The von Neumann subalgebra A(H) ˆ and the restriction of generated by H in A(G) is isomorphic to L∞ (H), the positive definite function φ to H is the Fourier transform of a probability ˆ The coproduct ∆ restricts to a coproduct on the subalgebra measure µ on H. generated by H, thus the images of A(H) by the morphisms jn generate commuting subalgebras of N . These restrictions thus give a random walk on ˆ whose independent increments are distributed according the dual group H, to µ. We now consider another commutative algebra, namely the center Z(G) of ˆ of bounded A(G). Recall that this center is isomorphic with the space L∞ (G) functions on the set of equivalence classes of irreducible representations of G. As a von Neumann algebra of operators on L2 (G), it is generated by the convolution operators by integrable central functions (recall that a function f on G is central if it satisfies f (ghg −1 ) = f (h) for all h, g ∈ G). Proposition 6.2. The algebras jn (Z(G)); n ≥ 1 commute. Proof. Let a, b ∈ Z(G) and let k ≤ l we have to prove that jk (a) and jl (b) commute. Let a = i(a), b = i(b), and note that a and b belong to the center of N . One has jk (a)jl (b) = T k (a )T k (T l−k (b )) = T k (a T l−k (b )) = T k (T l−k (b )a ) = T l (b )T k (a ) = jl (b)jk (a) Furthermore one has. Proposition 6.3. If the function φ is central then Φν (Z(G)) ⊂ Z(G). Proof. Indeed if ψ is central function, belonging to A0 (G), then Φν (ψ) = φψ is a central function on the group, and thus defines an element of Z(G). We deduce from the preceding propositions that, in the case when the increments correspond to a central state, the restriction of the dilation (jn )n≥0 ˆ whose to the center of the algebra A(G) defines a Markov process on G,
82
P. Biane
transition operator is given by the restriction of Φν to the center Z(G). We shall now give a more concrete form of the transition probabilites of this Markov chain. Proposition 6.4. For χ an irreducible character of G, let hφ (χ , χ)χ φχ = ˆ χ ∈G
be the expansion of the positive definite central function φχ into a combination characters, then the probability transitions of the Markov chain obtained from the restriction of (jn )n≥1 to the center are given by pφ (χ , χ) =
dim(χ) hφ (χ , χ) dim(χ )
ˆ the convolution operator associated with the function Proof. For χ ∈ G, dim(χ)χ is the minimal projection of Z(G) associated with χ. In other words ˆ it corresponds to the indicator function 1χ in the isomorphism of L∞ (G) with Z(G). The transition operator for the restriction of the dilation to the center is the restriction to this center of Φω . On the other hand, the transition probabilities pφ (χ, χ ) are related to these indicator functions by Φω (1χ ) = p (χ , χ)1 χ . The conclusion follows immediately. χ φ
7 The Case of SU (n) 7.1 Some Facts About the Group SU (n) We shall investigate the quantum random walk defined in the preceding section when the group G is the group SU (n) of unitary matrices with determinant 1. First we recall some basic facts about this group and its representations. Let T ⊂ SU (n) be the subgroup of diagonal matrices, which is a maximal torus. The group of characters of T is an n − 1 dimensional lattice, generated by the elements (the notation e is here to suggest the exponential function) ⎞ ⎛ 0 u1 ⎟ ⎜ e(ei )(⎝ . . . ⎠) = uj 0
un
These elements satisfy the relation (written in additive notation) e1 + e2 + . . . + en = 0, which corresponds to the relation e(e1 )e(e2 ) . . . e(en ) = 1 for the characters. We denote by P this group, and by P+ the subset of positive weights, i.e. P+ = {m1 e1 + . . . + mn−1 en−1 |m1 ≥ m2 ≥ . . . ≥ mn−1 }
Introduction to Random Walks on Noncommutative Spaces
83
Fig. 2
We shall also need the set P++ = {m1 e1 + . . . + mn−1 en−1 |m1 > m2 > . . . > mn−1 } and note that the two sets are in bijection by P++ = P+ + ρ
(7.1)
where ρ = (n − 1)e1 + (n − 2)e2 + . . . + en−1 is the half sum of positive roots. The symmetric group acts on this character group by permutation of the ei . Below is a picture of P and P+ for the group SU (3). Thus P consists of the points in a triangular lattice in the plane, and P+ is the intersection of this triangular lattice with a cone, fundamental domain for the action of the symmetric group S3 . The subset P++ consists in points of P+ which are in the interior of the cone. Recall from the representation theory of the group SU (n) (see e.g. [BtD], [GW], or [Z]) that the equivalence classes of irreducible representations of SU (n) are in one to one correspondence with the elements of P+ , which are called “highest weights”. For each x ∈ P let e(x) be the associated character of T, then the character of the representation with highest weight x ∈ P+ given, for u ∈ T, by Weyl’s character formula σ∈Sn (σ)e(σ(x + ρ))(u) (7.2) χx (u) = σ∈Sn (σ)e(σ(ρ))(u) In particular the defining representation of SU (n) has character e(e1 ) + . . . + e(en ) corresponding to the highest weight e1 . The normalized positive definite
84
P. Biane
1/3
1/3 1/3
Fig. 3 The random walk on the dual of the maximal torus for SU(3).
function on SU (n) corresponding to this character is φ(g) = n1 T r(g). We shall investigate the quantum random walk associated with this positive definite function.
7.2 Two Classical Markov Chains We shall obtain two classical Markov chains by restricting the Markov chain associated with φ to suitable subalgebras of C ∗ (SU (n)). The first subalgebra is that generated by the maximal torus T. This algebra is isomorphic to the algebra of functions vanishing at infinity on the dual group P. It is easy to see that the restriction to the torus of the quantum random walk (jn )n≥0 , constructed using φ, is a random walk on the lattice P with increments distributed as n1 (δe1 + . . . + δen ). Its one step transition probabilities are given by p1 (x, y) = n1 if y ∈ {x + e1 , . . . , x + en } p1 (x, y) = 0
if not
We give the picture for the case of the group SU (3). The second subalgebra is the center of C ∗ (SU (n)). By the preceding section, it can be identified with the space of functions vanishing at infinity on P+ . We shall rather use the identification of the set of irreducible representations with P++ given by (7.1). As we saw in section 6 the restriction of the dilation (jn )n≥0 gives a classical Markov chain on the spectrum of the center, therefore we obtain in this way a Markov chain on P++ , the generator of the Markov chain being given by the restriction of the generator of the quantum Markov chain on A(SU (2)).
Introduction to Random Walks on Noncommutative Spaces
85
We shall now derive a relation between these two Markov chains (the one obtained from the maximal torus, and the one from the center). The set of highest weights, P++ is the intersection of P with the Weyl chamber, which is the cone C = {x1 e1 + . . . + xn−1 en−1 |x1 > x2 > . . . > xn−1 } We consider now the random walk on P killed at the exit of this cone. Thus the transition probabilites of this killed random walk are given by p0 (x, y) =
if y ∈ P++ ∩ {x + e1 , . . . , x + en }
1 n
0
p (x, y) = 0
if not.
The sum y p0 (x, y) is < 1 for points near the boundary, corresponding to the fact that the random walk has a nonzero probability of being killed. Let x ∈ P++ and consider the irreducible representation ξx of SU (n), with highest weight x − ρ. We can use Weyl’s character formula (7.2) for decomposing the representation ξx ⊗ ξn (where ξn is the defining representation of SU (n)). n 1 We remark that n1 j=1 e(ej ) = n! σ∈Sn e(σ(e1 )). One has χn χx−ρ
(σ)e(σ(x)) 1 = (e(e1 ) + . . . + e(en )) σ∈Sn n σ∈Sn (σ)e(σ(ρ)) =
1 n
(σ)e(σ(x) + τ (e1 ))(u) σ∈Sn (σ)e(σ(ρ))
σ∈Sn
n!
1 = n =
τ ∈Sn
n
σ∈Sn
j=1
σ∈Sn
(σ)e(σ(x + ej )) (σ)e(σ(ρ))
χy−ρ
y∈{x+e1 ,x+e2 ,...,x+en }∩P++
since if y = x + ej belongs to P+ \ P++ then it is fixed by some reflexion in Sn and thus the sum σ∈Sn (σ)e(σ(x + ej )) vanishes. For x ∈ P++ , let us denote h(x) the dimension of the representation with highest weight x − ρ. We conclude from the preceding computation and Proposition 6.4, that the transition probabilities for the Markov chain on P++ are h(y) 0 p (x, y) x, y, ∈ P++ (7.3) q(x, y) = h(x) Since the transition operator is unit preserving, it follows in particular that the function h is a positive harmonic function with respect to the transition kernel p0 , i.e. satisfies
86
P. Biane
a h(a)/3h(x) h(b)/3h(x) x
b
h(c)/3h(x) c
Fig. 4
h(x) =
h(y)p0 (x, y) for all x ∈ P++ ,
y
Again we draw the picture in the case of SU (3). Let us recall that, given transition (sub)probabilities p(x, y) for a Markov chain, and a positive harmonic function h for p, i.e. a function such that h(y)p(x, y) for all x h(x) = y h(y) one calls the Markov chain with transition probabilities h(x) p(x, y) the Doob conditioning, or h-transform, of the Markov chain with transition probabilities p. We can summarize the preceding discussion in the following proposition.
Proposition 7.1. The Markov chain obtained by restriction to the center is related to the random walk on the dual of the maximal torus by a killing at the exit of the Weyl chamber followed by a Doob conditioning using the dimension function on the set of highest weights. For more information on Doob’s conditioning, I refer to the books by Kemeny, Knapp and Snell [KKS], or Revuz [R]. One could ask whether this relation, between the Markov chains on the dual of the torus and on the center, holds for more general groups and positive definite functions. It turns out that the fundamental concept in this direction is that of a minuscule weight, see [B3] for more details.
Introduction to Random Walks on Noncommutative Spaces
87
8 Choquet-Deny Theorem for Duals of Compact Groups 8.1 The Choquet-Deny Theorem in an Abelian Group As we have seen in the preceding section, the fact that the dimension function is a positive harmonic function on the Weyl chamber plays an important role in understanding the quantum random walk on the dual of SU (n). A natural question arises, is this positive harmonic function unique? We shall answer this question, which is purely a question of “classical” potential theory using the theory of quantum random walks. Actually we shall do this by extending a well known result of Choquet and Deny [CD] on harmonic measures for locally compact abelian goups. The Choquet-Deny theorem describes completely the solutions of the convolution equation µ∗φ =φ
(8.1)
on a locally compact abelian group G, where µ is a positive finite measure, and φ is an unknown positive measure. One assumes that the subgroup generated by the support of µ is the whole group. In order to state the Choquet-Deny theorem, one needs to define the exponentials on the group G. These are the continuous functions f on G, with values in ]0, +∞[, which are multiplicative, i.e. satisfy f (gh) = f (g)f (h) for all
g, h ∈ G. An exponential e : G →]0, +∞[ is called µ-harmonic if one has G e(−x)µ(dx) = 1. The set of µ-harmonic exponentials is a Borel subset of the set of all continuous functions on G, which we denote by Eµ . Let φ be a positive measure on G of the form φ(dx) = e(x)dx where dx is the Haar measure on G and e is a µ-harmonic exponential, then one has for all positive measurable functions f
G f (x)φ ∗ µ(dx) = G G f (x + y)φ(dx)µ(dy)
= G G f (x + y)e(x)dxµ(dy)
= G G f (x)e(x − y)dxµ(dy)
= G f (x)e(x)dx G e(−y)µ(dy)
= G f (x)φ(dx) therefore the measure φ is µ-harmonic. i.e. satisfies the equation (8.1). The Choquet-Deny theorem states that every solution is a convex combination of solutions of this kind. Theorem 8.1 (Choquet-Deny). Assume that the subgroup generated by the support of the measure µ is G, then every positive measure φ, solution of the convolution equation (8.1), is absolutely continuous with respect ot the Haar measure on G, and its density has a unique representation as an integral
88
P. Biane
dφ(x) = dx
Eµ
e(x)dνφ (e)
where νφ is some finite positive measure on Eµ . This result contains in particular the determination of all positive harmonic functions for the transition operator associated with the measure µ, indeed if h is such a positive µ-harmonic function, then the measure h(−x)dx is a µ-harmonic measure. Note that a locally compact abelian group corresponds to a commutative and cocommutative Hopf C ∗ -algebra. What we shall do next is to extend this theorem to (a class of) cocommutative Hopf C ∗ -algebras. This will allow us to answer the question about the uniqueness of the positive harmonic function. Before we state our analogue of the Choquet-Deny theorem on the dual of a compact group, we will first clarify some points about states and weights.
8.2 Some Further Properties of Duals of Compact Groups Let G be a compact group and A(G) be its von Neumann algebra. This von Neumann algebra has a structure of cocommutative Hopf-von Neumann algebra for the coproduct ∆, counit ε and antipode i given respectively by continuous linear extension of ∆(λg ) = λg ⊗ λg
ε(λg ) = δe,g
i(λg ) = λg−1 .
We have seen in section 4.3 that the convolution of two finite normal weights µ and ν on A(G) is defined by the formula µ ∗ ν = (µ ⊗ ν) ◦ ∆. Assume now that µ is a positive finite weight and φ is positive, then we can write φ φ with respect to the restrictions of φ as a sum of finite weights φ = χ χ to the subalgebras Mχ . The sum χ ν ∗ φχ is then a sum of positive finite weights and thus it defines a (not necessarily normal) weight on A(G). We can therefore consider the equation (8.1) where this time µ and φ are positive normal weights, with µ finite. Next we define the notion of exponential. The following definition is a straighforward extension of the definition in the case of abelian groups. ˆ Definition 8.2. A group-like element is a non zero element f of A(G), such that ∆(f ) = f ⊗ f. If this element is positive, then we call it an exponential. If µ is a finite weight, f is an exponential and µ(i(f )) = 1 then we call f a µ-harmonic exponential. ˆ Let f, g, h be positive elements in A(G) then one has the identity tr(f ⊗ g∆(h)) = tr(i(h) ⊗ g∆(i(f )))
(8.2)
Introduction to Random Walks on Noncommutative Spaces
89
ˆ which is easily checked on coefficient functions. Let g ∈ A(G) be associated to µ, i.e. µ(.) = tr(g.), then it follows from 8.2 that for all h φ ∗ µ(h) = tr(f ⊗ g∆(h)) = tr(i(h) ⊗ g∆(i(f ))) = tr(i(h)i(f ))tr(gi(f )) = φ(h) Thus if f is a µ-harmonic exponential, and φ is the weight associated with f , then φ satisfies the equation (8.1).
8.3 The Analogue of the Choquet-Deny Theorem We shall assume that the state ν satisfies a non degeneracy condition which is the analogue, in the noncommutative setting, of the requirement that the support of the measure generates the whole group. This condition states that for every finite weight ρ on A(G) which is supported by some algebra Mχ for ˆ there exists an integer n ≥ 1 and a constant c > 0 such that cν ∗n ≥ ρ. χ ∈ G, Theorem 8.3. Let φ be a ν-harmonic weight, then there exists a unique finite positive measure on the set of ν-harmonic exponentials such that φ= e dmφ (e) Eµ
Sketch of proof. We let Sν be the convex cone of normal weights satisfying φ∗ν ≤φ ˆ and we can use Choquet’s integral repreThis cone is a closed subset of A, sentation theorem to conclude that any element of this cone can be written as the barycenter of a measure supported on the set of its extremal rays. Now one can analyze the extremal rays of this set, and see that such an extremal ray consists in multiples of an exponential. The uniqueness argument comes from the existence of an algebra of functions on the cone, which separates points, see [B4] for details.
8.4 Examples For a finite group, the set of exponentials is reduced to the identity. If the state ν is tracial, then there exists only one ν-harmonic exponential, namely the identity. In the case of the group SU (n), the exponentials are in one to one correspondence with the positive elements in SL(n, C).
90
P. Biane
From these results we deduce that the positive harmonic function h of Proposition 7.1 was unique. Indeed in order to prove that a function h is the unique (up to a multiplicative constant) positive harmonic function for a transition kernel p, it is enough to check that all the positive harmonic h(y) p(x, y) are constant, which is what functions for the relativized kernel h(x) the Choquet-Deny theorem tells us.
9 The Martin Compactification of the Dual of SU (2) In the preceding section we have seen that the classical Choquet-Deny theorem about solutions of convolution equations has an analogue in duals of compact groups. This allows one to give an explicit description of all µ-harmonic positive functions for a finite positive measure µ on a commutative group. By the Choquet-Deny theorem the positive µ-harmonic functions admit a unique integral representation in terms of minimal µ-harmonic functions, and these minimal harmonic functions can be identified with exponentials. The next natural question in this line of ideas is to describe the Martin compactification associated to a random walk with values in Zn . This Martin compactification provides a way to attach a boundary to the space Zn in order to obtain a compact space, where the boundary is naturally identified with the set of minimal µ-harmonic functions. The Martin compactification of Zn was computed by Ney and Spitzer in a classical paper [NS], where they showed that it consists in adding a sphere at infinity, and identifying this sphere with the set of minimal harmonic functions with the help of the Gauss map. In this section we will describe the Martin compactification of some quantum random walks with values in the dual of SU (2). We will first recall some basic facts about classical Martin boundaries, then describe Ney and Spitzer’s theorem, before going to the case of the dual of SU (2).
9.1 The Martin Compactification for Markov Chains Consider a Markov chain on a countable state space E. TheMarkov chain has transition subprobabilities p(x, y), x, y ∈ E, i.e. we have y p(x, y) ≤ 1, so that the kernel is submarkovian and the process may die in a finite time. There is an associated transition operator given by p(x, y)f (y) P f (x) = y∈E
and the iterated operator is given by n-step transition probabilities P n f (x) = pn (x, y)f (y) E
Introduction to Random Walks on Noncommutative Spaces
91
We assume that the associated Markov chain is transient, so that the potential U=
∞
Pn
n=0
is finite, i.e. the function u(x, y) =
∞
pn (x, y) < ∞
n=0
Let us choose an initial distribution r(dx) such that the function rU (y) = E u(x, y)r(dx) is everywhere > 0. The Martin kernel is defined by k(x, y) =
u(x, y) rU (y)
It follows from the Harnack inequalities that the functions k(x, .) form a uniformly continuous family on E. The Martin compactification of the Markov ¯u , which contains E as a chain is the smallest compact topological space E dense subset, and such that these functions extend continuously to the boundary ∂Eu = E¯u \ E. This space exists because the functions k(x, .) separate the points of E and because of the uniform continuity. For any ξ ∈ ∂Eu the function x → k(x, ξ) is a p-harmonic function. Recall that a positive pharmonic function f on E is called minimal if for every positive p-harmonic function g satisfying g ≤ Cf for some C > 0, one has actually g = cf for some constant c. One can prove that any minimal p-harmonic function f , which is r-integrable, is a multiple of k(., ξ) for some ξ ∈ ∂Eu . The subset ∂Em of ξ ∈ ∂Eu such that k(., ξ) is minimal is a Borel subset, and one can prove that any positive p-harmonic function f , which is r-integrable, admits a representation k(., ξ)dmf (ξ) f= ∂Eu
with a unique positive measure mf .
9.2 The Martin Compactification of Zd When the Markov chain is a random walk on Zd , with increments distributed as µ, a (sub)probability measure on Zd , we have seen that every positive µharmonic function admits an integral representation in terms of exponentials. When the increments of the random walk are integrable, Ney and Spitzer have determined explicitly the Martin compactification of Zd , which we shall now describe. Let φ : Rd → [0, +∞] be the function ex,y µ(dy) φ(x) = y∈Zd
92
P. Biane
We assume that it is finite in a neighbourhood of the set Eµ = {x|φ(x) = 1} Then the set Eµ is the boundary of the convex set {x|φ(x) ≤ 1} and it is either reduced to a point or homeomorphic to a sphere. In the latter case the homeomorphism can be expressed thanks to the Gauss map as ∇φ ∇φ Since φ is convex this is a homeomorphism from Eµ onto the unit sphere. Ney and Spitzer proved that the Martin compactification is homeomorphic to the usual compactification of Zd by a sphere at infinity, where the identification between the sphere and the set of minimal µ-harmonic functions is provided by the map above.
9.3 Noncommutative Compactifications Before we investigate the problem of finding an analogue of the Ney-Spitzer theorem for the dual of SU (2) let us translate in the noncommutative language the notion of a compactification of a topological space. So let X be a ¯ a compact space such that X ⊂ X ¯ is a dense open topological space, and X ¯ = X ¯ \ X is the boundary, then C(X) ¯ is can be identified subset, and ∂ X with a subalgebra of Cb (X), the algebra of all bounded continuous functions on X, and one has an exact sequence ¯ → C(∂X) → 0 0 → C0 (X) → C(X) ¯ by 0 on the boundary, where the first map is the continuous extension, to X, of a function on X, and the second map is the restriction to a closed subset. A compactification of C0 (X) is thus given by a certain commutative C ∗ subalgebra of the multiplier algebra of C0 (X), containing C0 (X). In the case of the Martin compactification this subalgebra is just the algebra generated by C0 (X) and by the functions y → k(x, y). The vector space generated by functions of the form y → k(x, y) can be identified with the image of the Martin kernel, considered as an integral operator f → x∈E f (x)k(x, y). It is this interpretation of the Martin kernel that has a natural noncommutative analogue.
9.4 The Martin Kernel for the Quantum Random Walk We consider a central quantum random walk, therefore we have a positive definite central function φ on SU (2) such that φ(e) ≤ 1, and the associated
Introduction to Random Walks on Noncommutative Spaces
93
state ν on A(SU (2)). We have seen that it has an associated transition kernel given by the completely positive map Φν = (I ⊗ ν) ◦ ∆. This map acts as λg → φ(g)λg on the generators λg of the von Neumann algebra A(SU (2)). We know that if φ(e) = 1 then there exists only one φ-harmonic weight, namely the one given by the function 1. In this case we expect that the Martin boundary will be given by a one point compactification, which consists just in adding a unit to the algebra, so in order to avoid this case, we shall assume here that φ(e) < 1. ∞ We can consider the associated potential which is equal to U = n=0 Φnν , ∞ 1 n and which acts by multiplication by the function n=0 φ = 1−φ . We shall consider the action of the potential on the space of coefficients i.e. the direct sum ⊕χ Mχ where each element of this space can be identified with a polynomial function on SU (2) acting by convolution, i.e. by the operator
p(g)λ g dg. Then the Martin kernel will be defined, by analogy with the SU(2) case of classical Markov chains, by
p(g) λ dg SU(2) 1−φ(g) g p → 1 SU(2) 1−φ(g) λg dg
1 Note that the operator SU(2) 1−φ(g) λg dg lies in the center of A(SU (2)), therefore there is no ambiguity in the quotient of the preceding formula.
9.5 Pseudodifferential Operators of Order Zero and the Martin Compactification In order to find the Martin compactification of the quantum random walk, we shall identify the C ∗ -algebra generated by C ∗ (SU (2)) and by the image of the Martin kernel, and show that it gives rise to a three terms exact sequence. We will first exhibit a certain exact sequence 0 → C ∗ (SU (2)) → M → C(S 2 ) → 0
(9.1)
where M is our sought for Martin compactification, and C(S 2 ) is the algebra of continuous functions on the two dimensional sphere S 2 . For this we consider ˆ the three operators in A(SU (2)) associated with Pauli matrices, which we call X, Y, Z, and the Casimir operator C = X 2 +Y 2 +Z 2 +I which acts by (n+1)2 on the space of coefficients of the n-dimensional representation of SU (2), and build three operators x = XC −1/2 , y = Y C −1/2 , z = ZC −1/2 Clearly these operators are self-adjoint and bounded. Using the commutation relations (3.1) one can see that [x, y], [x, z], [y, z] and x2 + y 2 + z 2 − I are
94
P. Biane
compact operators on L2 (SU (2)). It follows that there exists a map from the algebra generated by x, y, z to the algebra of polynomial function on the sphere, sending x, y, z to the three coordinate functions, and this map vanishes on the compact operators. Actually this map extends by continuity to the C ∗ algebra generated by x, y and z and yields the exact sequence (9.1). One can interpret also the algebra M as the algebra of right invariant pseudo differential operators of order zero on SU (2), then the map M → C(S 2 ) of (9.1) is the principal symbol map (see [B5]). Once we have introduced the exact sequence above, we can state the theorem which is the analogue, for central states on the dual of SU (2), of the Ney-Spitzer theorem. Theorem 9.1. The C ∗ algebra generated by the image of the Martin kernel is the algebra M. The Martin kernel yields a section K : C(S 2 ) → M. The proof of the theorem relies on a detailed analysis of the Clebsch-Gordan formulas, see [B5]. Recently the problem of the Martin or Poisson boundary have been considered for quantum groups, see [Col], [I], [INT]
10 Central Limit Theorems for the Bernoulli Random Walk Just as in the classical case there exists central limit theorems for the Bernoulli random walk, however the noncommutativity here plays an important role, and according to whether the state we chose is central or not the limit is quite different.
10.1 The Case of a Central State We consider the triple of processes (Xn , Yn , Zn )n≥1 constructed in section (3.1). We use the tracial state to contruct the product, M2 (C)⊗∞ which is thus endowed with the tracial state σ = ( 12 T r)⊗∞ . We renormalize the three processes according to (λ)
Xt
X[λt] = √ , λ
(λ)
Yt
Y[λt] = √ , λ
(λ)
Zt
Z[λt] = √ λ
where [x] is the integer part of x. This triple of processes converges when λ → ∞, in the sense of moments, towards a three dimensional Bownian motion. Theorem 10.1. Let (Xt , Yt , Zt )t≥0 be a three dimensional Brownian motion, then for any polynomial in 3n noncommuting indeterminates P , and all times t1 , . . . , tn , one has
Introduction to Random Walks on Noncommutative Spaces (λ)
(λ)
(λ)
(λ)
95 (λ)
(λ)
limλ→∞ σ(P (Xt1 , Yt1 , Zt1 , . . . , Xtn , Ytn , Ztn )) = E[P (Xt1 , Yt1 , Zt1 , . . . , Xtn , Ytn , Ztn )] Let us sketch the proof of this result. It is enough to prove the result for monomials. First we see that for any real coefficients x, y, z the process (λ) (λ) (λ) xXt + yYt + zZt converges towards real Brownian motion. By polarization this implies that for any monomial in X, Y, Z the sum over all monomials with the same total partial degrees in X, Y, Z converges towards (λ) (λ) the required limit. Consider two monomials of the form M1 Xt Ys M2 and (λ) (λ) M1 Ys Xt M2 , their difference is, thanks to the commutation relations, √ √ (λ) M1 Zs∧t M2 / λ. This is a monomial of smaller degree, with a factor 1/ λ. We conclude, by induction on degrees of monomials, that the difference betwen (λ) (λ) (λ) (λ) the expectations of the two monomials M1 Xt Ys M2 and M1 Ys Xt M2 converges to 0 as λ → ∞. It follows that the expectations of all monomials with the same partial degrees in variables converge to the same limit. √ We observe that the spin process, normalized by S[λt] / λ converges in distribution to a three dimensional Bessel process as λ → ∞.
10.2 The Case of a Pure State Now we consider the quantum Bernoulli random walk with the pure state given by the vector e0 . We shall consider the convergence of the moments of the triple of processes (λ)
(λ)
(Xt , Yt
X[λt] Y[λt] Z[λt] (λ) ); t ≥ 0. , Zt ) = ( √ , √ , λ λ λ
We shall prove that there exists operators (Xt , Yt , Zt )t≥0 on some Hilbert space H with a vector Ω ∈ H, such that for every polynomial in noncommuting indeterminates P (Xt1 , Yt1 , Zt1 , . . . , Xtn , Ytn , Ztn ) one has ∞ limn→∞ P (Xt1 , Yt1 , Zt1 , . . . , Xtn , Ytn , Ztn )e∞ 0 , e0 ) = (λ)
(λ)
(λ)
(λ)
(λ)
(λ)
P (Xt1 , Yt1 , Zt1 , . . . , Xtn , Ytn , Ztn )Ω, Ω For this we shall first investigate the case where n = 1, t1 = 1, thus we have Yn Zn √n , √ , ) and let n → ∞. Let H be a Hilbert space just three operators ( X n n n with a countable orthonormal basis ε0 , . . . , εn , . . ., and let us define operators, with domain the algebraic sum ⊕ni=0 Cεi , by the formula √ a+ (εi ) = √j + 1 εj+1 (10.1) a− (εj ) = j εi−1
96
P. Biane
Theorem 10.2. For any polynomial in three noncommutative indeterminates one has Xn Yn Zn ⊗n ⊗n 1 )e , e0 = P (a+ + a− , (a+ − a− ), I)ε0 , ε0 lim P ( √ , √ , n n n 0 i
n→∞
The proof is immediate by inspection of the formula (3.2) and comparison with (10.1). Observe that one has the adjointness relations a+ u, v = u, a− v for all u, v in the domain. It follows that the operators a+ +a− and 1i (a+ −a− ) are unbounded symmetric operators on H, and thus are closable. We will see below that they have self-adjoint extensions. They satisfy the commutation relation [a+ , a− ] = −I on their common domain, spanned by the vectors εi . The operators a+ , a− thus obtained are well known under the name of creation and annihilation operators for the quantum harmonic oscillator. One can give a natural model for these operators using a gaussian random variable. For this, remark that the distribution of the operator a+ + a− is gaussian. This follows easily from the fact that each Xn follows a standard binomial distribution, and the convergence of this binomial distribution to the gaussian distribution, by the de Moivre-Laplace theorem. This property of the operator a+ + a− , and the fact that ε0 is a cyclic vector for a+ + a− , i.e. the vectors (a+ + a− )n ε0 span a dense subspace of H, allows us to identify the space H in a natural way with the L2 space of a gaussian random variable. The vectors εn can be obtained from the vectors (a+ +a− )n by the Gram-Schmidt orthogonalization procedure. It is well known that, for a gaussian variable X, the polynomials obtained by the Gram-Schmidt orthonormalization process from the sequence X n are the Hermite polynomials. Thus when we identify the space H with the L2 space of the gaussian measure on R the vectors εn become identified with the Hermite polynomials. Then the operator a− is d d identified with dx and the operator a+ with x − dx . + − The product a a has eigenvalues 0, 1, 2, . . . corresponding to the the respective eigenvectors ε0 , ε1 , . . .. It is known as the number operator in quantum field theory. We will in the next section systematize the construction above and show how to deduce the limit of the renormalized quantum random walk to a quantum Brownian motion.
Introduction to Random Walks on Noncommutative Spaces
97
10.3 Fock Spaces Let H be a complex Hilbert space. For each integer n the symmetric group Sn acts on H ⊗n by permutation of the factors in the tensor product. Definition 10.3. We denote H ◦n the subspace of H ⊗n formed by vectors invariant under the action of Sn . If h1 , . . . , hn ∈ H then we let 1 hσ(1) ⊗ . . . ⊗ hσ(n) h1 ◦ . . . ◦ hn = √ n! σ∈Sn which is a multiple of the orthogonal projection of h1 ⊗ . . . ⊗ hn on H ◦n . One has n h1 . . . ◦ hn , h1 ◦ . . . ◦ hn = hi , hσ(i) σ∈Sn i=1
The Fock space built on H is the Hilbert space direct sum ◦n Γ (H) = ⊕∞ n=0 H
where H ◦0 is a one dimensional Hilbert space spanned by a unit vector Ω, called the vacuum vector of the Fock space. The algebraic direct sum ◦n ⊕∞ alg,n=0 H , denoted by Γ0 (H), is a dense subspace of Γ (H). For every h ∈ H we define the exponential vector associated with h by ξ(h) = one has
∞ h◦n n! n=0
ξ(h), ξ(h ) = eh,k
furthermore the vectors ξ(h); h ∈ H form a linearly free subset, generating algebraically a dense subspace of Γ (H). If the space H is written as the orthogonal direct sum of two Hilbert subspaces H = H1 ⊕ H2 , then there is a canonical isomorphism Γ (H) ∼ Γ (H1 ) ⊗ Γ (H2 )
(10.2)
which can be obtained, for example, by identifying the exponential vector ξ(v1 +v2 ) ∈ Γ (H), where v1 ∈ H1 and v2 ∈ H2 , with the vector ξ(v1 )⊗ξ(v2 ) ∈ Γ (H1 ) ⊗ Γ (H2 ). Let h ∈ H, we define two operators on the domain Γ0 (H) by a+ ◦ h ◦ . . . ◦ hn h (h1 ◦ . . . ◦ hn ) = h n 1 − ˆ i ◦ . . . ◦ hn ah (h1 ◦ . . . ◦ hn ) = i=1 hi , hh1 ◦ . . . ◦ h
98
P. Biane
− Operators of the form a+ h are called creation operators while the ah are called annihilation operators. When H is one dimensional, generated by a unit vector u there is a natural identification of Γ (H) with the Hilbert space √ of the preceding section where the vector u◦n is identified with n!n . Then − + − the operators a+ u and au coincide with a and a . Another operator of interest on Γ (H) is the number operator Λ which has eigenvalue n on the subspace H ◦n . If (ei )i∈I is an orthonormal basis in H, then the number operator Λ has the expansion − a+ Λ= e1 aei . i
One can see that the creation and annihilation operators satisfy the adjoint relation − h, u, v ∈ Γ0 (H) a+ h u, v = u, ah v as well as the commutation relation − [a+ h , ak ] = −h, kI
on the domain Γ0 (H). In particular they are closable, and it is easy to see that the exponential vectors belong to the domain of their closure, with a+ h ξ(h ) =
d ξ(h + th)t=0 dt
a− h ξ(h ) = h , hξ(h)
(10.3)
− We shall see that the real part of the creation operator Ph = a+ h +ah has a selfadjoint extension, as well as its imaginary part Qh . For this we consider the following Weyl operators, given on the vector space generated by exponential vectors by the formula
Wu ξ(h) = ξ(h + u)e−h,u− 2 u,u 1
It is easy to check that Wu ξ(h), Wu ξ(h ) = ξ(h), ξ(h )
(10.4)
for all u, v, h, h ∈ H, therefore the operators Wu extend to unitary operators on Γ (H), furthermore Wu Wv = Wu+v e−iu,v
(10.5)
and for any u ∈ H the operators (Witu ; t ∈ R) form a one parameter group of unitary operators, whose generator is given by Pu on exponential vectors. Similarly, the operators (Wtu ; t ∈ R) form a one parameter group of unitary operators, whose generator is given by Qu , and more generally for θ ∈ [0, 2π[ the vectors (Weiθ tu ; t ∈ R) form a one parameter group of unitary operators, whose generator is given by cos θQu + sin θPu .
Introduction to Random Walks on Noncommutative Spaces
99
It follows from Stone’s theorem that Pu , Qu , and all their linear combinations, have a self adjoint extension. These operators satisfy the commutation relation [Pu , Qv ] = −2iu, v. We observe that if H splits as an orthogonal direct sum H = H1 ⊕ H2 and u ∈ H1 , then the operator Wu admits a decomposition Wu = Wu ⊗ I in the decomposition (10.2). Let now K ⊂ H be a real Hilbert subspace such that u, v = 0 for all u, v ∈ K (if K is maximal, it is called a Lagrangian subspace), then by (10.5) the unitary operators Wiu ; u ∈ K form a commutative family, and the generators Pu , u ∈ K of the one parameter subgroups (Witu ; t ∈ R) form a commuting family of self-adjoint operators with common dense domain Γ0 (H). We can therefore investigate the joint distribution of these operators. Proposition 10.4. The operators Pu , for u ∈ K form a gaussian family with covariance Pu , Pv = u, v. The operators Qu , for u ∈ K form a gaussian family with covariance Qu , Qv = u, v. For the proof it is enough to prove that any linear combination of these operators has a gaussian distribution with the right variance, i.e. that Pu is a gaussian with variance u, u. For this one computes the Fourier transform eiPu Ω, Ω = eiPu ξ(0), ξ(0) = ξ(u)e− 2 u,u , ξ(0) = e− 2 u,u 1
1
The proof for the operators Qu is similar. We let now H = L2 (R+ ), and take as Lagrangian subspace the subspace of real valued functions. Then the family (Pt := P1[0,t] ; t ≥ 0) has the covariance Pt , Ps = s ∧ t, and thus has the distribution of a real brownian motion. The − same is true of the operators Qt := 1i (a+ 1[0,t] − a1[0,t] ) which form another Brownian motion satisfying the commutation relations [Pt , Qt ] = 2it We shall call the pair (Pt , Qt )t≥0 of continuous time processes a noncommutative brownian motion. We can now state the limit result we had in view in the beginning of this section. Theorem 10.5. For any polynomial P in noncommuting variables, one has ∞ limλ→∞ (P (Xt1 , Yt1 , Zt1 , . . . , Xtn , Ytn , Ztn )e∞ 0 , e0 ) = P (Pt1 , Qt1 , t1 .I, . . . , Ptn , Qtn , tn .I))Ω, Ω] (λ)
(λ)
(λ)
(λ)
(λ)
(λ)
The proof is an elaboration of the proof we gave for one time.
100
P. Biane
We shall see in the next section that, again, one can interpret this pair of processes as a noncommutative Markov process with values in a noncommutative space. The noncommutative Brownian motion is the basis of a theory of noncommutative stochastic integration which has been developped by Hudson and Parthasarathy, see e.g. [Pa].
11 The Heisenberg Group and the Noncommutative Brownian Motion The Heisenberg group is the set H = C × R endowed with the group law (z, w) (z , w ) = (z + z , w + w + (z z¯ )) This is a nilpotent group, its center being {0} × R, and the Lebesgue measure on C × R is a left and right Haar measure for this group. The Weyl operators defined in the preceding section on a Fock space Γ (C) define unitary representations of the group H, by setting, for τ ∈ R∗ , ρτ (z, w) = Wzτ 1/2 eiτ w if τ > 0 and ρτ (z, w) = Wz¯|τ |1/2 eiτ w if τ < 0. Another family of representations is given by the one dimensional characters ¯ ρξ (z, w) = ei(zξ) for ξ ∈ C. All these representations are irreducible, are non equivalent and they exhaust the family of equivalence classes of irreducible representations of H. We consider the C ∗ algebra of H, which is the C ∗ -algebra generated by the convolution algebra L1 (H) on L2 (H). This algebra is a sub C ∗ -algebra of B(L2 (H)). Let us denote z = q + ip then the Lie algebra of H is composed of the vector fields ∂ ; ∂w
∂ ∂ +p ; ∂q ∂w
∂ ∂ −q . ∂p ∂w
We shall denote by iT, iQ, iP the unbounded operators on L2 (H), affiliated to C ∗ (H), which correspond to these vector fields. Thus P, Q, T are unbounded self-adjoint operators, which satisfy the commutation relation [P, Q] = −2iT.
Introduction to Random Walks on Noncommutative Spaces
101
The "quantum plane" [P,Q]=it The plane T=0
T T=t
Fig. 5 The dual of the Heisenberg group.
As in the case of SU (2) one can give a heuristic description of the noncommutative space dual to H using the generators of the Lie algebra of H, which define three noncommuting unbounded self-adjoint operators P, Q, T . We think of these operators as coordinate functions on this dual space, satisfying the commutation relations [P, Q] = −2iT
[P, T ] = [Q, T ] = 0.
Since the coordinate T belongs to the center, it allows to decompose the space into slices according to the values of this coordinate. When T = 0, the coordinates P and Q commute, and the corresponding slice is a usual plane, with two real coordinates. This corresponds to the one dimensional representations of the group. When T = τ a non zero real number, the two coordinates P, Q generate a von Neumann algebra isomorphic to B(H), and corresponding to the irreducible representation sending T to τ I. Note that in this representation the operator P 2 + Q2 has a discrete spectrum 2|τ |, 6|τ |, 10|τ |, . . .. Let us consider, for t ≥ 0, the functions on H ±itw− 2 tz z¯ . ϕ± t (z, w) = ρ±t (z, w)Ω, Ω = e 1
By construction, these functions are positive definite functions on H, and form two multiplicative semigroups. To these functions correspond convolution semigroups of states, and semigroups of completely positive maps.
102
P. Biane
The semigroup of noncommutative brownian motion on the dual of H is the associated semigroup of completely positive maps on C ∗ (H). Recall that this semigroup is obtained by composing the coproduct ∆ : C ∗ (H) → M (C ∗ (H)) ⊗ M (C ∗ (H)) (recall that M (A) is the multiplier algebra of A) with the state associated with the function. Thus Φ± t = (νϕ± ⊗ I) ◦ ∆ t
or equivalently
± Φ± t (λg ) = ϕt (g)λg ∗
for g ∈ H. ∗
Let ν be a state on C (H), and ρν : C (H) → B(Hν ) be the associated GNS representation. We consider the two families of homomorphisms jt± : C ∗ (H) → B(Hν ⊗ Γ (L2 (R+ ))) jt± (z, w) = ρν (z, w) ⊗ Wz1[0,t] e±itw We shall prove that these homomorphisms constitute dilations of some completely positive convolution semigroups on C ∗ (H). For each time t ≥ 0 we have a direct sum decomposition L2 (R+ ) = L2 ([0, t]) ⊕ L2 ([t, +∞[) and a corresponding factorization Γ (L2 (R+ )) = Γ (L2 ([0, t])) ⊗ Γ (L2 ([t, +∞[)) Accordingly for each t > 0 there are subalgebras Wt = B(Γ (L2 ([0, t]))) ⊗ I ⊂ B(Γ (L2 (R+ ))) and linear maps Et := Id ⊗ .Ω[t , Ω[t : B(Γ (L2 (R+ ))) → Wt where Ω[t is the vacuum vector of the space Γ (L2 ([0, t])). Lemma 11.1. For each t ≥ 0 the map Et is a conditional expectation with respect to the state .Ω, Ω. Indeed if a ∈ B(L2 (R+ )) has a decomposition a = at] ⊗ a[t then one has Et (a) = at] ⊗ a[t Ω[t , Ω[t and for b, c ∈ B(L2 ([0, t])) bacE(u), E(v) = bEt (a)cE(u1[0,t] ), E(v11[0,t] )a[t E(u1[t,+∞[ ), E(v1[t,+∞[ ) = bEt (a)cE(u), E(v) One checks easily that the homomorphism jt± sends C ∗ (H) to Wt , furthermore we have
Introduction to Random Walks on Noncommutative Spaces
103
Proposition 11.2. The maps (jt± , Et , Wt ) form a dilation of the completely positive semigroup Φ± t , with initial distribution ν. Proof. This is a bookkeeping exercise using the definition of the Weyl operators, one has to check that, for t, s ≥ 0 and u, v ∈ L2 (R+ ), one has ± (z, w)E(u1[0,t] ), E(v1[0,t] ) = e±isw− 2 s|z| jt± (z, w)E(u1[0,t] ), E(v1[0,t] ) jt+s 1
2
For every one parameter subgroup of H, there is a completely positive semigroup given by restriction of (Φ± t )t≥0 . For subgroups of the form (xz, 0); u ∈ R, with z ∈ C∗ isomorphic to R, one sees that the semigroup is that of Brownian motion on the dual group. Thus we recover the Brownian motions (Pt , Qt ) of the preceding section by looking at jt (P ) and jt (Q). The restriction to the center (0, w); w ∈ R gives a semigroup of uniform translation on the real line.
11.1 The Quantum Bessel Process Bessel processes are radial parts of Brownian motions. Here we shall exploit the action of the unitary group U (1) on the Heisenberg group in order to find an abelian algebra which is left invariant by the semigroup and study the Markov process associated with the restriction of Φ± t to this subalgebra. Let eiθ be a complex number with modulus 1, then there exists an automorphism aθ of the Heisenberg group defined by aθ (z, w) = (eiθ z, w) and this automorphism extends to an automorphism of the C ∗ algebra. Proposition 11.3. The subalgebra of C ∗ (H) composed of elements invariant under the above action of U (1) is an abelian C ∗ algebra. The characters of this abelian C ∗ -algebra have been computed by A. Koranyi, they are given by the formula χ(f ) = ω(g)f (g)dg H
for f ∈ L1 (H), invariant under the action of U (1), where ω belongs to the set of functions {ωτ,m|τ ∈ R∗ , m ∈ N} ∪ {ωµ |µ ∈ R+ }
104
P. Biane
Fig. 6 The Heisenberg fan.
with
ωτ,m (z, w) = meiτ w− 2 |τ ||z| Lm (|τ ||z|2 ) 1
2
ωµ (z, w) = j0 (µ|z|2 ) Here Lm are the Laguerre polynomials defined by the generating series ∞ m=0
e− 1−t 1−t xt
Lm (x)tm =
and j0 is the usual Bessel function. ∗ (H) can be identified with a closed subset The spectrum of the algebra CR 2 of R , which consists in the union of the halflines {(x, kx); x > 0} for k ∈ N, the halflines (x, kx); x < 0 for k ∈ N∗ , and the halfline (0, y); y ≥ 0. It is the spectrum of the unbounded operator 12 (P 2 + Q2 − T ), and this algebra is the algebra of functions of this operator. The picture gives a “fan” consisting of a union of halflines originating from 0 as depicted below. We shall call noncommutatif Bessel semigroup the restriction of Φ± t to the ∗ (H). In order to compute this semigroup we need, abelian subalgebra CR for each character ω to decompose the functions ωϕt into an integral of characters. The result is given by the following. Proposition 11.4. The noncommutative Bessel semigroup Φ+ t is given by the following kernel. If x = (σ, −kσ) with σ < 0 and τ = σ + t then qt (x, dy) =
∞ l=k
τ (l − 1)! τ (1 − )l−k ( )k δ(τ,−lτ )(dy) (k − 1)!(l − k)! σ σ
Introduction to Random Walks on Noncommutative Spaces
105
Fig. 7
If x = (σ, −kσ) with σ < 0 and 0 = σ + t, (y = 0, r) then qt (x, dy) =
( rt )k−1 − r e t δ0 ⊗ dr (k − 1)!
If x = (σ, −kσ) with σ < 0 and τ = σ+ > 0 then qt (x, dy) =
∞ (l + k − 1)! l=0
(k − 1)!l!
(1 −
τ l+k τ k ) ( ) δ(τ,lτ ) (dy) t t
If x = (0, r) then
( rt )k−1 − t e lt δt,lt (dy) l! If x = (σ, kσ) with σ > 0 and τ = σ + t qt (x, dy) =
qt (x, dy) =
l=k l=0
σ (l − 1)! σ (1 − )k−l ( )l δ(τ,lτ ) (dy) (k − 1)!(l − k)! τ τ
The computations can be found in [B6]. A typical trajectory of the process is depicted in the above picture. It starts from a point (σ, −σ) with σ < 0. During the whole process the first coordinates follows a uniform translation to the right. The trajectory starts dt , then jumps to the line on the line y = −x, and with an intensity −σ+t (y = −2x), which it follows before jumping to the next line (y = −3x) with 2dt an intensity −σ+t , and so on, until it reaches after infinitely many jumps the line x = 0, then the process on the right half plane does the jumps from the line (y = kx) to (y = (k − 1)x), until it finally reaches the line y = 0 where it stays forever. One can actually construct this process from a birth and death process known as the Yule process, and the embedding of this process into the Heisenberg fan yields a construction of the space-time boundary of this process, see [B6].
106
P. Biane
12 Dilations for Noncompact Groups 12.1 The General Case We shall now extend the preceding construction to the case of arbitrary locally compact groups. Let G be a locally compact group, with right Haar measure m, and consider its convolution algebra L1 (G). We endow this algebra with the norm f = sup ρ(f ) where the supremum is over all unitary representations ρ of the group G, extended to the algebra L1 (G). This yields the full C ∗ -algebra of G, denoted C ∗ (G). When the group G is amenable, for example if G is compact or for the Heisenberg group which we have met before, this coincides with the completion of the action of the group on L2 (G), which is called the reduced C ∗ -algebra of G. When the group is nonamenable, Cr∗ (G) is strictly smaller than C ∗ (G). A continuous positive definite function on G, such that ϕ(e) = 1 defines a state as well as a completely positive contraction on C ∗ (G), whose restriction to L1 (G) is given by f → f ϕ. Let now ψ be a continuous, conditionally negative definite function on G, with ψ(e) = 0. Recall that this means that for all t ≥ 0 the function e−tψ is a positive definite function onG, or equivalently, by Sch¨ onberg’s theorem, that for all z1 , . . . , zn ∈ C with i zi = 0, and g1 , . . . , gn ∈ G one has zi z¯j ψ(gj−1 gi ) ≤ 0. ij
There is an associated semigroup of completely positive contractions on C ∗ (G). We shall now, following Parthasarathy and Schmidt [PS], construct a dilation of this semigroup. Let ν be a state on C ∗ (G) which will be the initial state. The GNS construction yields a unitary representation π of G on a Hilbert space Hπ , and η ∈ Hπ such that ν(x) = π(x)η, η for x ∈ C ∗ (G). A variant of the GNS construction associates to the function ψ a unitary representation of G in a Hilbert space Hψ , and a cocycle v : G → Hψ for this representation. Thus v is a continuous function which satisfies v(gh) = gv(h) + v(g) and
v(g), v(h) = −ψ(h−1 g) + ψ(g) + ψ(h−1 ) − ψ(e)
(12.1)
for all g, h ∈ G. Conversely, any function ψ satisfying the above equation for some representation and cocycle v is conditionally negative definite. Indeed one has zi z¯j ψ(gj−1 gi ) = − zj v(gj )2 ≤ 0 if
ij
j
zj = 0.
j
Introduction to Random Walks on Noncommutative Spaces
107
Let Γ = Γ (L2 (R+ ) ⊗ Hψ ), and let W = B(Hπ ⊗ Γ ) ∼ B(Hπ ) ⊗ B(Γ ). Let ω be the pure state on W associated with the vector η ⊗ Ω. One can define the subalgebras Wt = B(Hπ ⊗ Γt ) ⊗ Id associated with the orthogonal decomposition L2 (R+ ) ⊗ Hψ = (L2 ([0, t]) ⊗ Hψ ) ⊕ (L2 ([t, +∞[) ⊗ Hψ ), and the conditional expectations Et : W → Wt with respect to the state ω. One defines a unitary representation of G on exponential vectors by V t (g)(E(u)) = etψ(g)+1[0,t] ⊗vt (g),u E(U t (g)(u) + 1[0,t] ⊗ vt (g)) One thus gets a representation of G on Hπ ⊗ Γ by taking the tensor product of V t with the representation π, and this yields a family of morphisms jt : C ∗ (G) → W. Proposition 12.1. The family (jt , W, Wt , Et , ω) forms a dilation of the completely positive semigroup, with initial distribution ν. The proof is a bookkeeping exercise. This construction has been extended by Sch¨ urmann to a class of bialgebras, see [Sc], allowing him in particular to give a nice construction of the Az´ema martingales.
12.2 Free Groups Let now Fn be a free group on n generators g1 , . . . , gn . Each element of Fn can be written in a unique way as a reduced word w = giε11 . . . giεkk , where one has εj = ±1 for all j and i1 = i2 = i3 . . . ik−1 = ik . For such an element one defines its length l(w) = k. This is the smallest integer k such that w can be expressed as a product of k elements in the set {g1 , g1−1 , g2 , . . . , gn , gn−1 }. Proposition 12.2. (Haagerup [H]) The function l is conditionally negative definite on Fn . Proof. Consider the Cayley graph of Fn built on the generators. Thus this graph has as vertices the elements of Fn and its edges are the pairs {g, h} such that h−1 g is a generator or the inverse of a generator. This Cayley graph is a regular tree in which each vertex has 2n neighbours. For any g ∈ Fn one can consider the unique shortest path in the graph between Id and g. Let En be the set of edges of the Cayley graph, endowed with the counting measure, then one defines v(g) ∈ L2 (En ) to be the indicator function of this shortest path from Id to g in the Cayley graph. Thus v(g)(e) = 1 if and only if the edge e is on the shortest path from Id to g. One can easily check, using the properties of trees that for any h, h ∈ Fn one has l(g) + l(h) − l(h−1 g) = 2v(g), v(h)L2 (Fn )
108
P. Biane
indeed this scalar product counts the number of common edges in the shortest paths from Id to g and h. This implies, by (12.1) that l is conditionally negative definite. It follows from the previous proposition that there exists, on the full C ∗ algebra of Fn , a semigroup of unit preserving completely positive maps, given by the formula Φt (λg ) = e−tl(g) λg The theory of the previous section allows us to construct a dilation of this semigroup. As before we shall be interested in the restriction of this completely positive semigroup to commutative subalgebras. The first one will be the subalgebra of the subgroup generated by one of the generators. Let gi be this generator, then this subgroup is isomorphic to Z by k → gik , therefore its dual is isomorphic to the group of complex numbers of modulus 1. The restriction gives us a Markov semigroup on the group of complex numbers of modulus 1. This semigroup is easy to characterize, it sends the function eikθ on the unit circle to the function e−|k|+ikθ . In other words this is the integral operator on the unit circle given by the Poisson kernel Pt (θ, θ ) =
1−
1 − e−2t . − θ ) + e−2t
2e−t cos(θ
This is a convolution semigroup, as expected. The other commutative algebra of interest is the algebra R(F n ) consisting of radial elements. It is generated by the elements χl = l(g)=l λg for l = 0, 1, . . . , and it is immediate that the completely positive semigroup associated with the length function leaves this algebra invariant. Actually one has Φt (χl ) = e−tl χl . These elements satisfy the relations χ0 = I χ21 = χ2 + 2nχ0 χl χl = χl+1 + (2n − 1)χl−1
l≥2
From this we conclude that R(Fn ) is the commutative von Neumann algebra generated by the self-adjoint element χ1 , and its spectrum is the spectrum of χ1 . In order to compute the norm of χl we need just to consider the trivial representation of Fn in which all gi are mapped to the identity, and we get χl = 2n(2n − 1)l−1 for l ≥ 1, the number of elements of length l in Fn . Any character ϕ : R(Fn ) → C is determined by its values on χ1 . For such a character ϕ, with ϕ(χ1 ) = x, one has ϕ(χ0 ) = 1; ϕ(χ2 ) = x2 − 2n; from which one infers that
ϕ(χl+1 ) = xϕ(χl ) − (2n − 1)ϕ(χl−1 ) for l ≥ 2
Introduction to Random Walks on Noncommutative Spaces
ϕ(χl ) =
− λl+1 λl+1 λl−1 − λl−1 1 2 2 − 1 λ1 − λ2 λ1 − λ2
109
for l ≥ 1
(12.2)
where λ1 , λ2 are the two roots of the equation λ2 − xλ + 2n − 1 = 0. We verify that the character ϕx defined by the formula above is real and bounded if and only if x ∈ [−2n, 2n]. The spectrum of the algebra R(Fn ) thus coincides with the interval [−2n, 2n], and the element χl corresponds to a polynomial function Pl (χ1 ) = χl , where the polynomials are determined by the recursion P0 = 1,
P1 (x) = x,
xPl (x) = Pl+1 (x) + (2n − 1)Pl−1 .
This three term recursion relation is characteristic of a sequence of orthogonal polynomials. The orthogonalizing measure is the distribution of χ1 in the noncommutative probability space (A(Fn ), δe ) where δe is the pure state, in the left regular representation of Fn , corresponding to the identity. Thus δe (λg ) = 1 if g = e and δe (λg ) = 0 if not. This measure is known as the Kesten measure (see [Ke]) and has the density 4(2n − 1) − x2 2n dmn (x) = 4π 2n − 1 4n2 − x2 √ √ on the interval [−2 2n − 1, 2 2n − 1]. The discrepancy between the interval [−2n, 2n] which is the spectrum of χ1 and the support of the measure mn comes from the fact that Fn is a nonamenable group and therefore some of its unitary representations are not weakly contained in the regular representation. The semigroup of the restriction of (Φt )t≥0 to the subalgebra R(Fn ) sends the polynomial function Pl (x) on the interval [−2n, 2n] to the function e−tl Pl (x). We can compute the transition probabilities pt (x, dy) by finding the integral representation e−tl Pl (x) = pt (x, dy)Pl (y) [−2n,2n]
for each x ∈ [−2n, 2n]. If x belongs to the support of the Kesten measure, then since the polynomials Pl ; l ≥ 0 form an orthogonal basis of the L2 space of the Kesten measure, and Pl 22 = 2n(2n − 1)l one obtains pt through the orthogonal expansion pt (x, dy) = e−t dmn (y) +
∞ l=1
e−tl
1 Pl (x)Pl (y)dmn (y) 2n(2n − 1)l−1
When x is outside this support, then by (12.2) the sequence Pl (x) is un√ x+ x2 −4(2n−1) bounded and has exponential growth of rate ξ = and the 2
110
P. Biane
−tl character value e√ Pl (x) has the asymptotic behaviour e−tl ξ l as l → ∞, and if e−t ξ > 2 2n − 1, then let x(t) = e−t ξ + (2n − 1)et /ξ. The function e−tl Pl (x) can be written as is a linear combination of Pl (x(t)), which picks term as l → ∞ and the Pl (y) for y in the interval √ √ up the dominant [−2 2n − 1, 2 2n − 1]. More precisely the quantity
Qtl (x) = e−tl Pl (x) −
e−t ξ − (2n − 1)et /ξ ξ − (2n − 1)/ξ Pl (x(t)) e−t ξ − et /ξ ξ − 1/ξ
decreases exponentially as l → ∞, and thus one has
pt (x, dy) = ct δx(t) +
∞ l=1
e−tl
1 (Pl (x) − ct Pl (x(t)))Pl (y)dmn (y) 2n(2n − 1)l−1
−t t √ /ξ ξ−(2n−1)/ξ . If ξ(t) < 2 2n − 1 then there is a simiwith ct = e ξ−(2n−1)e e−t ξ−et /ξ ξ−1/ξ lar decomposition, but the term ct is 0. √ √Thus the process starting form a point x ∈ [−2n, 2n] \ [−2 2n − 1, 2 2n − 1] performs a translation towards the central interval, and at some point jumps into it, and √ after that √ performs a certain pure jump process inside the interval [−2 2n − 1, 2 2n − 1] where it remains forever.
13 Pitman’s Theorem and the Quantum Group SUq (2) 13.1 Pitman’s Theorem Let (Bt )t≥0 be a real Brownian motion, with B0 = 0, and let St = sup Bs 0≤s≤t
then Pitman’s theorem states that the stochastic process Rt = 2St − Bt ;
t≥0
is a three dimensional Bessel process, i.e. is distributed as the norm of a three dimensional Brownian motion. There is a discrete version of Pitman’s theorem, actually it is this discrete version that Pitman proved in his original paper [Pi]. We start from a symmetric Bernoulli random walk Xn = x1 +. . .+ xn where the xi are i.i.d. with P (xi ) = ±1 = 1/2, and build the processes Sn = max1≤k≤n Xk , and Tn = 2Sn − Xn . Pitman proved in [Pi] that (Tn )n≥0 is a Markov chain on the nonegative integers, with probability transitions
Introduction to Random Walks on Noncommutative Spaces
111
Fig. 8
p(k, k + 1) =
k+2 2(k + 1)
p(k, k − 1) =
k 2(k + 1)
and the theorem about Brownian motion can be obtained by taking the usual approximation of Brownian motion by random walks. We see that this Markov chain is, up to a shift of 1 in the variable, exactly the one that we obtained in Theorem 3.2 when considering the spin process. This is not a coincidence as we shall see, actually we will understand this connection by introducing quantum groups in the picture. Before that, let us give the proof of Pitman’s theorem We consider the stochastic process ((Sn , Xn ); n ≥ 1), with values in {(s, k) ∈ N × Z | s ≥ k}. It is easy to see that this stochastic process is a Markov chain, with transition probabilities p((s, k), (s, k − 1)) =
p((s, k), (s, k + 1)) = 12 , p((s, s), (s + 1, s + 1)) =
1 2,
1 2
p((s, s), (s, s − 1)) =
for s > k 1 2
from which we can deduce the probability transitions of the Markov chain ((Tn , Xn ); n ≥ 1), with values in {(t, k) ∈ N∗ ×Z | k ∈ (−t, −t+2, . . . , t−2, t)}, p((t, k), (t − 1, k + 1)) = 12 , p((t, t), (t + 1, t + 1)) = 12 ,
p((t, k), (t + 1, k − 1)) = 12 p((t, t), (t + 1, t − 1)) = 12
if t > k (13.1)
The transition probabilities are depicted in this picture. One checks then, by induction on n, that the conditional distribution of Xn , knowing T1 , . . . , Tn , is the uniform distribution on the set {−Tn , −Tn + 2, . . . , Tn − 2, Tn }. Then it follows that (Tn ; n ≥ 0) is a Markov chain with the right transition probabilities.
112
P. Biane
13.2 A Markov Chain Associated with the Quantum Bernoulli Random Walk In section 5.2 we have seen that the quantum Bernoulli random walk gives rise in a natural way to two Markov chains, one being the classical Bernoulli random walk, and the other being the spin process. These two processes were obtained in the preceding section as coordinates of a certain twodimensional Markov chain given by the transition probabilities (13.1). We can also consider a two-dimensional Markov chain having these two processes as marginals, by considering the Markov chain of the end of section 5.2. Recall that this Markov chain was obtained by restricting the generator of the quantum Bernoulli random walk to the commutative subalgebra P(SU (2)) ⊂ A(SU (2)) generated by the center Z(SU (2)) and by a one parameter subgroup. The spectrum of this algebra can be identified with the set Pˆ = {(r, k) ∈ N × Z | k ∈ {−r, −r + 2, . . . , r − 2, r}} Indeed this algebra is generated by the pair of commuting self-adjoint operators X, D in the sense that it consists in bounded functions of the pair (X, D). The joint spectrum of these operators can be computed from the explicit description of the irreducible representations of SU (2), and coincides with Pˆ . The probability transitions can be obtained by using the ClebschGordan formula, or equivalently by the computation in the proof of Lemma 3.3. One finds r+k+2 2(r + 1) r−k+2 p((r, k), (r + 1, k − 1)) = 2(r + 1) r−k p((r, k), (r − 1, k + 1)) = 2(r + 1) r+k . p((r, k), (r − 1, k − 1)) = 2(r + 1)
p((r, k), (r + 1, k + 1)) =
These transition probabilities are on this picture Thus, although this Markov chain has the same one-dimensional marginal as the one of the preceding section, they do not coincide. We will see that in order to recover the transitions (13.1) we will have to introduce quantum groups.
13.3 The Quantum Group SUq (2) The Hopf algebra A(SU (2)) can be deformed by introducing a real parameter q. The algebraic construction proceeds with the introduction of three
Introduction to Random Walks on Noncommutative Spaces
113
Fig. 9
generators t, e, f which are required to satisfy the relations tet−1 = q 2 e,
tf t−1 = q −2 f,
ef − f e =
t − t−1 q − q −1
and a coproduct which is given by ∆(t) = t ⊗ t,
∆(e) = e ⊗ t−1 + 1 ⊗ e,
∆(f ) = f ⊗ 1 + t ⊗ f
Formally putting t = q h and letting q converge to 1 one finds in the limit the defining relations for the envelopping algebra of the Lie algebra of SU (2), as well as the coproduct. One can prove that the irreducible finite dimensional representations of this algebra are deformations of those of SU (2), indeed for each inte+ − and Vr+1 , with bases ger r ≥ 0 there exists two representation in Vr+1 r± vk ; k ∈ {−r, −r + 2, . . . , r − 2, r}, given by tvjr± = ±q j vjr± ( r−j r+j+2 r± r± evj = ± vj+2 2 q 2 q ( r−j+2 r+j f vjr± = v r± . 2 2 q j−2 q −n
−q with [n]q = qq−q −1 . Using the coproduct one can define the tensor product of two representations, and this tensor product obeys the same rules as the n
114
P. Biane
one for representations of SU (2) i.e. one has ) Vr11+1 ⊗ Vr22+1 =
1 2 Vr+1 .
r=|r2 −r1 |,|r2 −r1 |+2,...,r1 +r2
We will now restrict our attention to representations of the kind Vl+ , and con+ ], which sider the von Neumann-Hopf algebra A+ (SUq (2)) = ⊕r≥0 End[Vr+1 is isomorphic, as an algebra, to A(SU (2)), but whose coproduct is deformed. The subalgebra P(SUq (2)) generated by t and by the center remains unchanged in the deformation. We consider the tracial state 12 T r on the twodimensional component, and consider the associated random walk. As in the case of SU (2), the restriction of the associated Markov transtion operator to the commutative algebra P(SUq (2)) defines a Markov chain on the spectrum of this algebra, whose transition probabilities can be computed, using the deformed Clebsch Gordan formulas, as in Klimyk et Vilenkin [KV], formulas (6) et (9), §14.4.3, to give * r+k+2 + q r+1 − q −k−1 2 q (r−k)/2 (13.2) = p((r, k), (r + 1, k + 1)) = q [r + 1]q 2(q r+1 − q −r−1 ) * r−k+2 + q −k+1 − q −r−1 2 q p((r, k), (r + 1, k − 1)) = q −(r+k)/2 = 2[r + 1]q 2(q r+1 − q −r−1 ) * r−k + q −k−1 − q −r−1 2 q p((r, k), (r − 1, k + 1)) = q −(r+k+2)/2 = 2[r + 1]q 2(q r+1 − q −r−1 ) * r+k + q r+1 − q −k+1 2 q p((r, k), (r − 1, k − 1)) = q (r−k+2)/2 = 2[r + 1]q 2(q r+1 − q −r−1 ) Letting q tend to 0, one checks that (13.2) converges to (13.1), and thus we get Pitman’s theorem as an outcome of the q → 0 limit of the quantum Bernoulli random walk, see [B7] for details. This observation is at the basis of a vast generalization of Pitman’s theorem, see e.g. [BBO].
References [B1]
[B2] [B3] [B4]
P. Biane, Some properties of quantum Bernoulli random walks. Quantum probability & related topics, 193–203, QP-PQ, VI, World Sci. Publ., River Edge, NJ, 1991. P. Biane, Quantum random walk on the dual of SU(n). Probab. Theory Related Fields 89 (1991), no. 1, 117–129. P. Biane, Minuscule weights and random walks on lattices. Quantum probability & related topics, 51–65, QP-PQ, VII, World Sci. Publ., River Edge, NJ, 1992. ´ P. Biane, Equation de Choquet-Deny sur le dual d’un groupe compact. Probab. Theory Related Fields 94 (1992), no. 1, 39–51.
Introduction to Random Walks on Noncommutative Spaces [B5]
115
P. Biane, Th´eor`eme de Ney-Spitzer sur le dual de SU(2). Trans. Amer. Math. Soc. 345 (1994), no. 1, 179–194. [B6] P. Biane, Quelques propri´et´ es du mouvement brownien non-commutatif. Hommage a P. A. Meyer et J. Neveu. Ast´erisque No. 236 (1996), 73–101. ` [B7] P. Biane, Le th´eor`eme de Pitman, le groupe quantique SUq (2), et une question de P. A. Meyer. In memoriam Paul-Andr´e Meyer: S´eminaire de Probabilit´es XXXIX, 61–75, Lecture Notes in Math., 1874, Springer, Berlin, 2006. [BBO] P. Biane, P. Bougerol, N. O’Connell, Littelmann paths and Brownian paths. Duke Math. J. 130 (2005), no. 1, 127–167. [BtD] T. Br¨ ocker, T. tom Dieck, Representations of compact Lie groups. Graduate Texts in Mathematics, 98. Springer-Verlag, New York, 1985. [Col] B. Collins, Martin boundary theory of some quantum random walks. Ann. Inst. H. Poincar´e Probab. Statist. 40 (2004), no. 3, 367–384. [C] A. Connes, Noncommutative geometry. Academic Press, 1995. [CD] G. Choquet, J. Deny, Sur l’´equation de convolution µ = µ ∗ σ. C. R. Acad. Sci. Paris 250 1960 799–801. [D1] J. Dixmier Les C ∗ -alg`ebres et leurs repr´esentations. Gauthier-Villars. Paris, 1969. [D2] J. Dixmier Les alg`ebres d’op´erateurs dans l’espace hilbertien (alg`ebres de von Neumann). Gauthier-Villars, Paris, 1969. [GW] R. Goodman, N.R. Wallach, Representations and invariants of the classical groups. Encyclopedia of Mathematics and its Applications, 68. Cambridge University Press, Cambridge, 1998. [H] U. Haagerup, An example of a nonnuclear C ∗ -algebra, which has the metric approximation property. Invent. Math. 50 (1978/79), no. 3, 279–293. [I] M. Izumi, Non-commutative Poisson boundaries and compact quantum group actions. Adv. Math. 169 (2002), no. 1, 1–57. [INT] M. Izumi, S. Neshveyev, L. Tuset, Poisson boundary of the dual of SUq (n). Comm. Math. Phys. 262 (2006), no. 2, 505–531. [K] M. Kashiwara, Bases cristallines des groupes quantiques. R´edig´e par C. Cochet. Cours Spcialis´es, 9. Soci´et´e Mathmatique de France, Paris (2002). [Ke] H. Kesten, Symmetric random walks on groups. Trans. Amer. Math. Soc. 92 1959 336–354. [KKS] J.G. Kemeny, J.L. Snell, A.W. Knapp, Denumerable Markov chains. Second edition. With a chapter on Markov random fields, by David Griffeath. Graduate Texts in Mathematics, No. 40. Springer-Verlag, New York-Heidelberg-Berlin, 1976. [KV] A.U. Klimyk, N.Ja. Vilenkin, Representation of Lie groups and special functions. Vol. 2. Class I representations, special functions, and integral transforms. Mathematics and its Applications (Soviet Series), 74. Kluwer Academic Publishers Group, Dordrecht (1993). [NS] P. Ney, F. Spitzer, The Martin boundary for random walk. Trans. Amer. Math. Soc. 121 1966 116–132. [Pa] K.R. Parthasarathy, An introduction to quantum stochastic calculus. Monographs in Mathematics, 85. Birkhuser Verlag, Basel, 1992. [Pi] J.W. Pitman, One-dimensional Brownian motion and the three-dimensional Bessel process. Advances in Appl. Probability 7 (1975), no. 3, 511–526. [PS] K.R. Parthasarathy, K. Schmidt, Positive definite kernels, continuous tensor products, and central limit theorems of probability theory. Lecture Notes in Mathematics, Vol. 272. Springer-Verlag, Berlin-New York, 1972. [R] D. Revuz, Markov chains. Second edition. North-Holland Mathematical Library, 11. North-Holland Publishing Co., Amsterdam, 1984. [Rie] M.A. Rieffel, Gromov-Hausdorff distance for quantum metric spaces. Matrix algebras converge to the sphere for quantum Gromov-Hausdorff distance. Mem. Amer. Math. Soc. 168 (2004), no. 796. American Mathematical Society, Providence, RI, 2004.
116 [S] [Sc] [T]
[Z]
P. Biane J.L. Sauvageot, Markov quantum semigroups admit covariant Markov C ∗ dilations. Comm. Math. Phys. 106 (1986), no. 1, 91–103. M. Sch¨ urmann, White noise on bialgebras. Lecture Notes in Mathematics, 1544. Springer-Verlag, Berlin, 1993. M. Takesaki, Theory of operator algebras. I, II, III. Encyclopaedia of Mathematical Sciences, 124, 125, 127 Operator Algebras and Non-commutative Geometry, 5, 6, 8. Springer-Verlag, Berlin, 2002/2003. ˇ D.P. Zelobenko, Compact Lie groups and their representations. Translated from the Russian by Israel Program for Scientific Translations. Translations of Mathematical Monographs, Vol. 40. American Mathematical Society, Providence, R.I., 1973.
Interactions between Quantum Probability and Operator Space Theory Quanhua Xu
Abstract We give a brief aspect of interactions between quantum probability and operator space theory by emphasizing the usefulness of noncommutative Khintchine type inequalities in the latter theory. After a short introduction to operator spaces, we present various Khintchine type inequalities in the noncommutative setting, including those for Rademacher variables, Voiculescu’s semicircular systems and Shlyakhtenko’s generalized circular systems. As an illustration of quantum probabilistic methods in operator spaces, we prove Junge’s complete embedding of Pisier’s OH space into a noncommutative L1 , for which Khintchine inequalities for the generalized circular systems are a key ingredient.
1 Introduction It is well-known that probabilistic methods are important methods in Banach space theory. As operator spaces are quantized Banach spaces, one would naturally expect that quantum probability should play a non negligible role in the young operator space theory. This is indeed the case. In fact, quantum probability and operator space theory are intimately related and there exist many interactions between them. For instance, the recent remarkable development of noncommutative martingale inequalities is directly influenced and motivated by operator space theory. In particular, the establishment of the noncommutative Doob maximal inequality by Junge [J1] is inspired by Pisier’s theory of vector-valued noncommutative Lp -spaces. On the other hand, the noncommutative Burkholder/Rosenthal inequalities can be used Q. Xu UFR Sciences et techniques, Universit´e de Franche-Comt´e, 16, route de Gray, F-25 030 Besan¸con Cedex, France e-mail:
[email protected] U. Franz, M. Sch¨ urmann (eds.) Quantum Potential Theory. Lecture Notes in Mathematics 1954. c Springer-Verlag Berlin Heidelberg 2008
117
118
Q. Xu
to determine the linear structure of symmetric subspaces of noncommutative Lp -spaces (see [JX]). The recent works of Pisier/Shlyakhtenko [PS] on the operator space Grothendieck inequality and of Junge [J2] on the complete embedding of OH into a noncommutative L1 are two more beautiful examples of illustration of these interactions. Certain Khintchine type inequalities are key ingredients in both works. It is clear today that quantum probability is of increasing importance in operator space theory. We will try to convince the reader of this in this course by presenting a very brief aspect of interactions between the two theories. Our presentation is around Khintchine type inequalities. In consequence, noncommutative Lp -spaces are at the heart of these lectures. This course can be divided into three parts. The first one gives a brief introduction to operator space theory. We start with a short discussion on completely positive maps between C*-algebras in order to prepare the introduction to operator spaces and completely bounded maps. Our introduction to operator spaces begins with concrete operator spaces, i.e., those which are closed subspaces of B(H) and the Haagerup-Paulsen-Wittstock factorization theorem for completely bounded maps, which should be understood together with its predecessor, Stinespring’s factorization theorem for completely positive maps. We then pass to Ruan’s fundamental characterization of abstract operator spaces. It is Ruan’s theorem that allows us to do basic operations on operator spaces such that duality, quotient and interpolation. Meanwhile, some important examples of operator spaces are given, including column space C, row space R and Pisier’s operator Hilbert space OH. This first part ends with an outline of Pisier’s vector-valued noncommutative Lp -spaces. We concentrate here only on Schatten classes. The second part is of quantum probabilistic character. The main object of this part is various noncommutative Khintchine inequalities. It becomes clear nowadays that Khintchine type inequalities are of paramount importance in operator space theory and more generally in noncommutative analysis. The inequalities we present are those for Rademacher variables, free group generators, Voiculescu’s semicircular systems and Shlyakhtenko’s generalized circular systems. The proofs of these inequalities in noncommutative Lp -spaces are often quite technical and tricky. But what will be needed in the third part concerns only the case p = 1, which is often easier. We should point out that the von Neumann algebra generated by a generalized circular system is of type III, which turns our presentation of noncommutative Lp -spaces somehow more complicated. This is, unfortunately, unavoidable in view of the complete embedding of OH into a noncommutative L1 presented later. The short third part is devoted to Junge’s complete embedding of OH into a noncommutative L1 . We first present OH as a quotient of a subspace of C ⊕ R (a theorem of Pisier), which is given by the graph of a closed densely defined operator on 2 . We then prove that any such graph embeds completely isomorphically into a noncommutative L1 -space.
Interactions between Quantum Probability and Operator Space Theory
119
2 Completely Positive Maps This section gives a brief discussion on completely positive maps between C*-algebras. Our references for operator algebras are [KR] and [T]. Let us fix some notations used throughout this course: • B(H) denotes the space of all bounded linear operators on a complex Hilbert space H. • A often denotes a C*-algebra; so A can be regarded as a C*-subalgebra of B(H) for some H. A+ denotes the positive cone of A. • M denotes a von Neumann algebra and M∗ the predual of M . • Mn denotes the algebra of complex n × n matrices; so Mn can be identified with B(n2 ). • Mn (A) denotes the algebra of n × n matrices with entries in A. This is again a C*-algebra. If A ⊂ B(H), then Mn (A) is a C*-subalgebra of Mn (B(H)) B(n2 (H)). • p denotes the p -space of complex sequences (xk ) such that ( k |xk |p )1/p < ∞, 1 ≤ p ≤ ∞ (with the usual modification for p = ∞). The n-dimensional version of p is denoted by np . Definition 2.1. Let u : A → B be a linear map between two C*-algebras. i) u is called positive if u(A+ ) ⊂ B+ . ii) u is called completely positive (c.p. for short) if un is positive for every n ≥ 1, where un = idMn ⊗ u : Mn (A) → Mn (B) is defined by un ((xij )) = (u(xij )). Remark 2.2. It is easy to check that a positive map u : A → B is automatically continuous. If in addition A is unital, then u = u(1) (see [Pa]). Examples: 1) Homomorphisms. Every homomorphism π : A → B is c.p.. By homomorphism we mean a linear map satisfying: π(xy) = π(x)π(y) and π(x∗ ) = π(x)∗ for all x, y ∈ A. Recall that a homomorphism π is necessarily contractive, i.e., u ≤ 1. If in addition π is injective, then π is isometric. 2) Multiplications. Let a ∈ A and define Ca : A → A by Ca (x) = a∗ xa. Then Ca is c.p. and Ca = a∗ a = a2 . More generally, if H and K are two Hilbert spaces and a : K → H a bounded operator, then Ca : B(H) → B(K) defined by Ca (x) = a∗ xa, is c.p.. The classical theorem of Stinespring states that any c.p. map is the composition of two maps of the previous types.
120
Q. Xu
Theorem 2.3. (Stinespring’s factorization) Let A be a C*-algebra and B a C*-subalgebra of B(K). Let u : A → B be c.p.. Then there are a Hilbert space H, a representation π : A → B(H) (i.e., a homomorphism) and a bounded operator a : H → K such that u(x) = a∗ π(x)a,
∀ x ∈ A.
Namely, u = Ca ◦ π. We refer to [T] for the proof of this theorem. We deduce immediately the following Corollary 2.4. If u : A → B is c.p., then def
ucb = sup un : Mn (A) → Mn (B) < ∞. n
Namely, u is completely bounded. Moreover, ucb = u. Exercises: 1) Prove that a positive map is automatically continuous. 2) Let A be a C*-algebra. Prove that x = (xij )i,j ∈ Mn (A) is positive iff x is a sum of matrices of the form (a∗i aj )i,j with a1 , ..., an ∈ A. 3) Let A and B be C*-algebras with B commutative. Prove that every positive map ϕ : A → B is automatically c.p..
3 Concrete Operator Spaces and Completely Bounded Maps We consider in this section closed subspaces of B(H) and completely bounded maps between them. The analogue for the present setting of the Stinespring factorization given in the previous section is the Haagerup-Paulsen-Wittstock factorization for completely bounded maps, which is fundamental in the theory. The references for this and next sections are [ER], [Pa] and [P3]. Definition 3.1. A (concrete) operator space is a closed subspace E of B(H) for some Hilbert space H. Let E be a Banach space, and let BE ∗ denote the unit ball of the dual E ∗ of E. BE ∗ becomes a compact topological space when equipped with the w*topology. Then E ⊂ C(BE ∗ ) isometrically. More precisely, given x ∈ E define x , : BE ∗ → C by x ,(ξ) = ξ(x). Then x → x , establishes an isometry from E into C(BE ∗ ). But now C(BE ∗ ) is a commutative C*-algebra, so C(BE ∗ ) ⊂ B(H) for some H. In this way, any Banach space is an operator space. However, according to the preceding definition, an operator space E is given together
Interactions between Quantum Probability and Operator Space Theory
121
with an embedding of E into a B(H). More precisely, an operator space is a pair of a Banach space E and an embedding of E into some B(H). On the other hand, B(H) admits a natural matricial structure: Mn (B(H)) = B(n2 (H)) for every n ∈ N. This should be reflected in E too. In particular, the “admissible” morphisms in the category of operator spaces should respect this matricial structure. Matricial Structure. Let E ⊂ B(H) be an operator space. Then E inherits the matricial structure of B(H) by virtue of the embedding Mn (E) ⊂ Mn (B(H)). More precisely, let Mn (E) be the space of n × n matrices with entries in E. Then Mn (E) is equipped with the norm induced by that of B(n2 (H)). Definition 3.2. Let E ⊂ B(H) and F ⊂ B(K) be two operator spaces. Let u : E → F be a linear map. i) u is called completely bounded (c.b. for short) if ucb = sup un < ∞, n≥1
where un = idMn ⊗ u : Mn (E) → Mn (F ) is defined by un ((xij )) = (u(xij )). CB(E, F ) denotes the space of all c.b. maps from E to F . ii) u is called a complete isomorphism if u is a c.b. bijection and u−1 is also c.b.. iii) u is called completely isometric if un is isometric for every n. If u is a bijection and both u and u−1 are completely isometric, u is called a complete isometry . Examples: 1) C*-algebras. Let A be a C*-algebra. Then A is a C*-subalgebra of some B(H); so A is an operator space. The resulting matricial structure on A is called the natural operator space structure of A. In particular, any von Neumann algebra has its natural operator space structure. Note that this natural operator space structure of A is independent, up to complete isometry, of particular representation of A as C*-subalgebra of B(H) for a faithful representation is completely isometric. 2) Minimal structure. Let E be a Banach space. Then we have the isometric embedding E ⊂ C(BE ∗ ), which turns E an operator space, denoted by min(E). This operator space structure is called the minimal structure on E. The adjective “minimal” means that this structure induces the least matricial norms on Mn (E). Indeed, assume that E itself is an operator space and consider also the associated minimal operator space min(E). Then by Proposition 3.3 below, the identity map on E induces a complete contraction from E to min(E). Namely, for any n and any x ∈ Mn (E) xMn (min(E)) ≤ xMn (E) .
122
Q. Xu
3) Maximal structure. Similarly, we can introduce a maximal operator space structure on a Banach space E. Let Φ be the family of all pairs ϕ = (uϕ , Hϕ ) with Hϕ a Hilbert space and uϕ : E → B(Hϕ ) a contraction. Let H be the Hilbert space direct sum of the Hϕ : ) Hϕ . H= ϕ∈Φ
Then B(H) contains as C*-subalgebra the C*-algebra direct sum of the B(Hϕ ): ) B(Hϕ ) . B(H) ⊃ ϕ∈Φ
. Define J : E → B(H) by J(x) = uϕ (x) ϕ∈Φ ∈ ⊕ϕ∈Φ B(Hϕ ). It is clear that J is isometric. This yields an isometric embedding of E into B(H). Identifying E and J(E) ⊂ B(H), we turn E an operator space. This operator space structure is called the maximal structure of E and denoted by max(E). By definition, one sees that if E itself is an operator space, then the identity map idE : max(E) → E is completely contractive. 4) Column and row spaces. Let (eij ) denote the standard matrix units of B(2 ). Define -
C = span(ei1 , i ≥ 1) and R = span(e1j , j ≥ 1). Thus we get two operator spaces C ⊂ B(2 ) and R ⊂ B(2 ). Note that C (resp. R) is identified as the first column (resp. row) subspace of B(2 ). The operator space structures of C and R are easily determined. Let x ∈ Mn (C), y ∈ Mn (R) and write xi ⊗ ei1 , y = yi ⊗ e1i , xi , yi ∈ Mn . x= i
i
Then ∗ 1/2 xMn (C) = xi xi , i
1/2 yMn(R) = yi yi∗ . i
The n-dimensional versions of C and R are denoted by C n and Rn , respectively. As Banach spaces both C and R are isometric to 2 via the identification ei1 ∼ e1i ∼ ei , where (ei ) denotes the canonical basis of 2 . We will see at the end of this section that they are not completely isomorphic. Proposition 3.3. Let E ⊂ B(H) be an operator space and A a commutative C*-algebra. Then any bounded map u : E → A is automatically c.b. and ucb = u.
Interactions between Quantum Probability and Operator Space Theory
123
Proof. Let us first consider the case where A = C. Let u : E → C be a continuous linear functional with u ≤ 1. For any n ∈ N we must show that un : Mn (E) → Mn is a contraction. To this end let x ∈ Mn (E), and let α, β ∈ n2 (α and β being viewed as column matrices). Then n n un (x)α, β = u(xij )αj β¯i = u xij αj β¯i i,j=1
i,j=1
n ≤ xij αj β¯i = β ∗ xα ≤ β x α. i,j=1
Taking the supremum over all x, α, β in the respective unit balls, we deduce that un ≤ 1. Thus u is a complete contraction. The general case can be easily reduced to the previous one. Indeed, since A is commutative, we can assume A = C0 (Ω) for some locally compact topological space Ω, where C0 (Ω) denotes the C*-algebra of all continuous functions on Ω which tend to zero at infinity. Then Mn (A) = C0 (Ω; Mn ), the C*-algebra of continuous functions from Ω to Mn which vanish at infinity. The norm of an element y = (yij ) ∈ C0 (Ω; Mn ) is given by . y = sup yij (ω) M . n
ω∈Ω
Now let u : E → A be bounded. Then /. 0 un = sup u(xij )(ω) M : ω ∈ Ω, x ∈ Mn (E), x ≤ 1 . n
It follows that ucb = sup δω ◦ ucb , ω∈Ω
where δω : C0 (Ω) → C is the evaluation at ω: δω (f ) = f (ω). We are thus reduced to the one dimensional case. Prototypical Examples of c.b. Maps: 1) Homomorphisms between C*-algebras. These maps are c.b. for they are c.p.. Moreover, they are completely contractive. Note also that an injective homomorphism is completely isometric. 2) Multiplications by bounded operators. Given a ∈ B(H) define La : B(H) → B(H), x → ax
and Ra : B(H) → B(H), x → xa.
Then La and Ra are c.b. and La cb = Ra cb = a. Thus if E ⊂ B(H), then La E and Ra E are also c.b..
124
Q. Xu
The following theorem asserts that any c.b. map is the composition of a homomorphism, a left multiplication and a right multiplication. This is the c.b. analogue of Stinespring’s factorization. We refer to [ER] and [P3] for the proof. Theorem 3.4. (Haagerup-Paulsen-Wittstock factorization) Let E ⊂ B(H) and F ⊂ B(K) be two operator spaces. Let u : E → F be a c.b. 1 a representation π : B(H) → B(H) 1 map. Then there are a Hilbert space H, 1 such that and two bounded operators a, b ∈ B(K, H)
Namely, u = Lb∗
u(x) = b∗ π(x)a, ◦ Ra ◦ π E . Moreover,
∀ x ∈ E.
/ 0 ucb = inf a b , where the infimum is taken over all factorizations of u as above. Corollary 3.5. (Hahn-Banach type extension) Every c.b. map u : E → B(K) admits a c.b. extension u ˜ : B(H) → B(K) such that ˜ ucb = ucb. Proof. Take a factorization u = Lb∗ ◦ Ra ◦ π E such that ucb = a b. Then u ˜ = Lb∗ ◦ Ra ◦ π is the desired extension of u. Let E ⊂ B(H) be an operator space. Then E inherits the order of B(H), which allows us to define positive and completely positive maps on E. Thus a map u : E → B(K) is c.p. if un sends the positive part of Mn (E) into that of Mn (B(K)) for every n. Corollary 3.6. (Decomposability of c.b. maps) Every c.b. map u : E → B(K) is decomposable in the sense that there are four c.p. maps uk such that u = u1 − u2 + i(u3 − u4 ) with uk cb ≤ ucb .
Proof. Let u = Lb∗ ◦ Ra ◦ π E according to Theorem 3.4. Then the corollary immediately follows from the polarization identity with uk =
1 C k ◦ π E , 4 a+i b
1 ≤ k ≤ 4,
where Ca is the multiplication by a from the right and by a∗ from the left. Usually, we do not distinguish completely isometric operator spaces. The distance between two operator spaces is measured by the operator space
Interactions between Quantum Probability and Operator Space Theory
125
analogue of the Banach-Mazur distance in the theory of Banach spaces. The Banach-Mazur distance of two Banach spaces E and F is 0 / d(E, F ) = inf u−1 u : u : E → F is an isomorphism . If E and F are isomorphic, d(E, F ) < ∞; otherwise, d(E, F ) = ∞. Definition 3.7. Given two operator spaces E and F define / 0 dcb (E, F ) = inf u−1 cb ucb : u : E → F is a complete isomorphism . Pisier [P1] proved that if dim E = dim F = n, then dcb (E, F ) ≤ n. We will see that the upper bound is attained for the pair (C n , Rn ). To this end, let us introduce a general definition. Definition 3.8. An operator space E is called homogeneous if every bounded map on E is c.b. and ucb = u. E is called Hilbertian if E is isometric to a Hilbert space. It is easy to see that min(E) and max(E) are homogeneous. On the other hand, C and R are homogeneous Hilbertian operator spaces. We refer to Chapiter 10 of [P3] for the proofs of the following two results. Proposition 3.9. Let E and F be two n-dimensional Hilbertian homogeneous operator spaces. Let (e1 , ..., en ) and (f1 , ..., fn ) be orthonormal bases of E and F , respectively. Let u : E → F be the map defined by u(ei ) = fi . Then dcb (E, F ) = u−1 cb ucb . √ Corollary 3.10. dcb (C n , Rn ) = n and dcb (C n , min(n2 ))) = n. Consequently, C, R and min(2 ) are not completely isomorphic each other. Exercises: 1) Let E be a Banach space and F an operator space. Prove that any bounded maps u : F → min(E) and v : max(E) → F are c.b. and ucb = u, vcb = v. 2) Prove that C and R are homogeneous. 3) Prove Corollary 3.10. 4) Let u : C → R. Prove ucb = uHS , where uHS denotes the HilbertSchmidt norm of u regarded as an operator on 2 , i.e., uHS =
∞ - i=1
u(ei )22
.1/2
.
126
Q. Xu
4 Ruan’s Theorem: Abstract Operator Spaces The definition of concrete operator spaces presented in the previous section has a major drawback: it does not allow to do basic operations on concrete operator spaces. For instance, it is not clear at all how to introduce a nice matricial structure on the Banach dual E ∗ of E which reflects the one of E. This drawback is resorbed in Ruan’s definition of abstract operator spaces. We have already seen that a concrete operator space E ⊂ B(H) possesses a natural matricial structure inherited from that of B(H): for each n, Mn (E) ⊂ B(n2 (H)) is again an operator space, equipped with the norm · n induced by that of B(n2 (H)). This sequence ( · n ) of matricial norms clearly satisfy the following properties • (R1 ): αxβn ≤ α x-n β, ∀ α, β. ∈ Mn , x ∈ Mn (E), n ≥ 1. • (R2 ): x⊕yn+m ≤ max xn , ym , ∀ x ∈ Mn (E), y ∈ Mm (E), n, m ≥ 1. Here the product is the usual matrix (n + m)-matrix x 0
product. x ⊕ y denotes the (n + m) × 0 y
.
(R1 ) and (R2 ) above are usually called Ruan’s axioms . Theorem 4.1. (Ruan’s characterization) Let E be a vector space. Assume that each Mn (E) is equipped with a norm · n . If these norms · n satisfy Ruan’s axioms (R1 ) and (R2 ), then there are a Hilbert space H and a linear map J : E → B(H) such that Jn = idMn ⊗ J : Mn (E) → Mn (B(H))
is isometric for every n.
In other words, the sequence ( · n ) comes from the operator space structure of E given by the embedding J : E → B(H). This theorem is proved in [R] (see also [ER] for an alternate proof). Definition 4.2. An (abstract) operator space is a Banach space E together with a sequence ( · n ) of norms satisfying (R1 ) and (R2 ) (with · 1 equal to the original norm of E). Henceforth, we will drop the adjective “concrete” or “abstract” by saying only operator spaces. Thus to have an operator space structure on a Banach space E is to have a sequence of matricial norms verifying Ruan’s axioms. In the remainder of this section we present some basic operations on operator spaces. The complex interpolation is postponed, however, to the next one, where Pisier’s operator Hilbert space will be also introduced. Spaces of c.b. maps. If E and F are two operator spaces, CB(E, F ) denotes again the space of all c.b. maps from E to F . This is a Banach space
Interactions between Quantum Probability and Operator Space Theory
127
equipped with the norm · cb . Now we wish to turn CB(E, F ) an operator space. Let u = (uij ) ∈ Mn-(CB(E, . F )). We view u as a map from E into Mn (F ) by defining u(x) = uij (x) for x ∈ E. Then the matricial norm on Mn (CB(E, F )) is defined by un = u : E → Mn (F )cb . Namely, we have the identification Mn (CB(E, F )) = CB(E, Mn (F )). It is easy to show that Ruan’s axioms are verified. Thus CB(E, F ) becomes an operator space. Duality. Specializing the previous discussion to F = C, we see that CB(E, C) is an operator space. However, Proposition 3.3 implies that CB(E, C) = E ∗ isometrically. Therefore, E ∗ becomes an operator space. The norm of Mn (E ∗ ) is that of CB(E, Mn ). This is usually called the standard dual of E. We will simply say the dual of E since only standard duals are used in the sequel. The bidual E ∗∗ = (E ∗ )∗ is an operator space too. Then it is easy to check that the natural inclusion E → E ∗∗ is completely isometric. This allows to view E as a subspace of E ∗∗ . Thus the duals of C*-algebras and the preduals of von Neumann algebras are operator spaces. Let u : E → F be a map between two operator spaces. Then u is c.b. iff its adjoint u∗ : F ∗ → E ∗ is c.b.. If this is the case, ucb = u∗ cb . Quotient. Let E be an operator space and F ⊂ E a closed subspace. We equip Mn (E/F ) with the quotient norm of Mn (E)/Mn (F ). Then it is easy to check that these norms satisfy (R1 ) and (R2 ), so E/F becomes an operator space. The usual duality between subspaces and quotients in Banach space theory remains available now: F∗ =
E∗ F⊥
and
- E .∗ = F⊥ F
completely isometrically.
Direct sum. Let (Ek ) be a sequence of operator spaces, Ek ⊂ B(Hk ) (the sequence may be finite). Let ∞ ((Ek )) denote the space of all sequences (xk ) with xk ∈ Ek such that supk xk < ∞. This is a Banach space when equipped with the norm (xk ) = sup xk . k
∞ ((Ek )) naturally inherits a matricial structure from ∞ ((B(Hk ))), the latter being a C*-algebra. Thus we have . . Mn ∞ ((Ek )) = ∞ (Mn (Ek )) .
128
Q. Xu
c0 ((Ek )) denotes the subspace of ∞ ((Ek )) consisting of all (xk ) such that xk → 0. On the other hand, we define 1 ((Ek )) to be the space of all sequences (xk ) with xk ∈ Ek such that k xk < ∞. This is again a Banach space with the natural norm. Recall that .∗ 1 ((Ek )) = ∞ ((Ek∗ )) isometrically. Thus 1 ((Ek )) is a predual of ∞ ((Ek )), which allows us to view 1 ((Ek )) as an operator space too. We often use the notations ) ) and ∞ Ek 1 Ek k
k
instead of ∞ ((Ek )k ) and 1 ((Ek )k ), respectively. If all Ek are equal, these spaces are denoted by ∞ (E) and 1 (E), respectively. In particular, if E = C, we recover ∞ and 1 . Let us introduce the continuous version of c0 (E). Let Ω be a locally compact topological space and E ⊂ B(H) an operator space. Let C0 (Ω; E) denote the space of continuous functions from Ω to E which vanish at infinity. C0 (Ω; E) is equipped with the uniform norm f = sup f (ω). ω∈Ω
Then C0 (Ω; E) ⊂ C0 (Ω; B(H)). The latter space is a C*-algebra. In this way, we turn C0 (Ω; E) an operator space. Sum and Intersection. Let (E0 , E1 ) be a couple of operator spaces. Assume (E0 , E1 ) is compatible in the sense that both E0 and E1 continuously embed into a common topological vector space V . This allows us to define 0 / E0 ∩ E1 = x ∈ V : x ∈ E0 , x ∈ E1 and
0 / E0 + E1 = x ∈ V : ∃ x0 ∈ E0 , x1 ∈ E1 s.t. x = x0 + x1 ,
equipped respectively with the intersection and sum norms . xE0 ∩E1 = max xE0 , xE1 , 0 / xE0 +E1 = inf x0 E0 + x1 E1 : x = x0 + x1 , x0 ∈ E0 , x1 ∈ E1 . Note that E0 ∩ E1 can be regarded as the diagonal subspace of E0 ⊕∞ E1 . On the other hand, E0 + E1 is identifiable with the quotient space of E0 ⊕1 E1 by ∆, where ∆ = {(x0 , x1 ) : x0 + x1 = 0}. Equipped with the operator space structures induced by those of E0 ⊕∞ E1 and E0 ⊕1 E1 , respectively, E ∩ E1 and E0 + E1 become operator spaces too.
Interactions between Quantum Probability and Operator Space Theory
129
Let us consider an important example. Take the column and row spaces C and R and view them as compatible by identifying both of them with 2 at the Banach space level. Thus if x ∈ C, we write x= xi ei1 with xi ∈ C. i
Recall that
|xi |2 )1/2 = (xi ) 2 = xi e1i R . xC = ( i
i
Then the compatibility above means that x is identified with the sequence (xi ). Accordingly, we often identify the canonical bases (ei1 ) of C and (e1i ) of R with (ei ) of 2 . Thus as Banach spaces, C ∩ R = C = R (= 2 ). But this is no longer true in the category of operator spaces. Let x ∈ Mn (C ∩ R) = Mn (C) ∩ Mn (R). Write x= xi ⊗ ei with xi ∈ Mn . i
Then . xMn (C∩R) = max xMn (C) , xMn (R) . - ∗ 1/2 xi xi , xi x∗i 1/2 . = max i
i
Using this, we easily check that C ∩ R is not completely isomorphic to C. Indeed, using Proposition 3.3, one easily shows that their n-dimensional versions satisfy the following √ dcb (C n , C n ∩ Rn ) = n. The operator space structure of C + R is a little bit more complicated. Using the complete isomorphism between E1 ⊕∞ E2 and E1 ⊕1 E2 (see Exercise 6 below), we deduce that for x = i xi ⊗ ei ∈ Mn (C + R) / ∗ 1/2 ∗ 1/2 0 1 xMn (C+R) ≤ inf ≤ 2xMn (C+R) , yi yi + zi zi 2 i i where the infimum runs over all decompositions xi = yi +zi with yi , zi ∈ Mn . We will give later a complete isometric description of C + R in terms of the trace class S1 . Exercises: 1) Prove that C ∗ R and R∗ C completely isometrically. More precisely, the map ξ ∈ C ∗ → i ξ(ei1 )e1i establishes a complete isometry between C ∗ and R. 2) Show that the natural inclusion E → E ∗∗ is completely isometric.
130
Q. Xu
3) Let F ⊂ E be operator spaces. Prove F∗ =
E∗ F⊥
and
- E .∗ = F⊥ F
completely isometrically.
4) Prove that a map u : E → F is c.b. iff its adjoint u∗ : F ∗ → E ∗ is c.b.. Moreover, ucb = u∗ cb . 5) Prove .∗ .∗ c0 ((Ek )) = 1 ((Ek∗ )) and 1 ((Ek )) = ∞ ((Ek∗ )) completely isometrically. 6) Prove that the natural inclusion from 1 ((Ek )) into ∞ ((Ek )) is completely contractive. Conversely, prove that the c.b. norm of the formal identity from E1 ⊕∞ · · · ⊕∞ En to E1 ⊕1 · · · ⊕1 En is equal to n. 7) Let (E0 , E1 ) be a compatible couple of operator spaces such that E0 ∩ E1 is dense in both E0 and E1 . Prove .∗ .∗ E0 ∩E1 = E0∗ +E1∗ , E0 +E1 = E0∗ ∩E1∗ completely isometrically.
5 Complex Interpolation and Operator Hilbert Spaces Hilbert spaces are in the center of the family of Banach spaces and play a crucial role there. It is thus natural to find their operator space analogues. One way to define operator Hilbert spaces is complex interpolation, which is of great importance for its own right in operator space theory. Our references for this section are [P1] and [P3]. Interpolation. We first recall the definition of complex interpolation for Banach spaces. Let (E0 , E1 ) be a compatible couple of complex Banach spaces. Let S = {z ∈ C : 0 ≤ Re z ≤ 1}, a strip in C. Let F (E0 , E1 ) be the family of all functions f : S → E0 + E1 satisfying the following conditions: • f is continuous on S and analytic in the interior of S; • f (k + it) ∈ Ek for all t ∈ R and the function t → f (k + it) is continuous from R to Ek for k = 0 and k = 1; • lim|t|→∞ f (k + it)Ek = 0 for k = 0 and k = 1. We equip F (E0 , E1 ) with the norm: 0 / f = max sup f (it)E , sup f (1 + it)E . F (E ,E ) 0
1
t∈R
0
t∈R
1
Then it is a routine exercise to check that F (E0 , E1 ) is a Banach space. For 0 < θ < 1 the complex interpolation space Eθ = (E0 , E1 )θ is defined as the space of all those x ∈ E0 + E1 for which there exists f ∈ F(E0 , E1 ) such that f (θ) = x. Equipped with
Interactions between Quantum Probability and Operator Space Theory
131
/ 0 xθ = inf f F (E0 ,E1 ) : f (θ) = x, f ∈ F(E0 , E1 ) , Eθ becomes a Banach space. Note that by the maximum principle, the map f → f (θ) is a contraction from F (E0 , E1 ) to E0 + E1 . Then (E0 , E1 )θ can be isometrically identified with the quotient of F (E0 , E1 ) by the kernel of this map. Now assume E0 and E1 are operator spaces. Then (Mn (E0 ), Mn (E1 )) is again compatible for any n ≥ 1. This allows to define . Mn (Eθ ) = Mn (E0 ), Mn (E1 ) θ . It is easy to show that Ruan’s axioms are satisfied, so Eθ is an operator space. Let us express Eθ as a quotient of a subspace of C0 (R; E0 ) ⊕∞ C0 (R; E1 ). Using Poisson integral, one sees that C0 (R; E0 ) ⊕∞ C0 (R; E1 ) is just the space of functions f : S → E0 +E1 satisfying the same conditions as above for F (E0 , E1 ) but only with “analytic” replaced by “harmonic”. Then F (E0 , E1 ) is the subspace of C0 (R; E0 )⊕∞ C0 (R; E1 ) consisting of all analytic functions. Therefore, Eθ is the quotient space of F (E0 , E1 ) by the subspace of all f such that f (θ) = 0. Operator Hilbert Spaces. Let H be a complex Hilbert space. Fixing an orthonormal basis (ei )i∈I in H, we can identify H with 2 (I). The classical Riesz representation theorem asserts that H ∗ is isometric to the conjugate ¯ of H. The latter space is H itself with the same norm but with conjugate H ¯ for λ ∈ C and x ∈ H. Viewed as a vector in multiplication: λ · x = λx ¯ H, a vector x ∈ H is often denoted by x¯. Thus if x = (xi ) ∈ 2 (I), then x ¯ = (¯ xi )i∈I . The map x → x ¯ establishes an anti-linear isometry between H ¯ Consequently, H ∗ is isometric to H. In fact, the conjugation can be and H. defined for any Banach space X. It is a well-known elementary fact that the Hilbert spaces are only Banach spaces X such that X ∗ is isometric to X. Now we wish to consider the operator space analogue of this property. The resulting spaces are the so-called operator Hilbert spaces, introduced by ¯ = ¯ by defining Mn (E) Pisier. Note that if E is an operator space, so is E Mn (E). Theorem 5.1. Let I be an index set. For any x = i xi ⊗ ei ∈ Mn (2 (I)) define 1/2 1/2 xn = xi ⊗ x ¯i Mn ⊗Mn = xi ⊗ x ¯i M 2 . i
i
n
Then ( · n ) satisfy Ruan’s axioms. The resulting operator space is denoted by OH(I). Moreover, OH(I) is the unique, up to complete isometry, operator space structure on 2 (I) such that OH(I)∗ is completely isometric to OH(I). If I = N or I = {1, ..., n}, we denote OH(I) simply by OH or OH n . The space OH can be also obtained by interpolating the column and row spaces.
132
Q. Xu
Theorem 5.2. OH = (C, R)1/2 completely isometrically. Exercises: spaces. 1) Let (E0 , E1 ) and (F0 , F1 ) be two compatible couples of operator Let T : E0 + E1 → F0 + F1 be a linear map such that T E : Ek → Fk k is c.b. of cb-norm ck for k = 0, 1. Then T is c.b. from Eθ to Fθ for any cθ1 . 0 < θ < 1 and of cb-norm ≤ c1−θ 0 √ 2) Show that OH is homogeneous and dcb (C n , OH n ) = n. Consequently, OH is not completely isomorphic to C.
6 Vector-valued Noncommutative Lp-spaces Since operator spaces are quantized Banach spaces, noncommutative Lp spaces are quantized Lp -spaces. Thus it is not surprising that noncommutative Lp -spaces play the role in operator space theory as the usual Lp -spaces do in the category of Banach spaces. In this section we introduce the natural operator space structures on noncommutative Lp and Pisier’s vector-valued Schatten classes. We will need essentially the cases p = ∞ and p = 1 (so the case 1 < p < ∞ can be skipped). For these special cases what is presented below becomes extremely simple for noncommutative L∞ and L1 are nothing but von Neumann algebras and their preduals. 6.1 Noncommutative Lp -spaces. Let M be a von Neumann algebra equipped with a normal faithful tracial state τ . For 1 ≤ p < ∞ and x ∈ M define xp = [τ (|x|p )]1/p , where |x| = (x∗ x)1/2 . Then (M, · p ) is a normed space, whose completion is the noncommutative Lp -space associated with (M, τ ), denoted by Lp (M ). By convention, L∞ (M ) = M with the operator norm. Then for any 1 ≤ p < ∞, the dual space of Lp (M ) is Lp (M ) (p being the conjugate index of p): Lp (M )∗ = Lp (M ) isometrically with respect to the duality bracket x, y = τ (xy),
x ∈ Lp (M ), y ∈ Lp (M ).
Consequently, L1 (M ) is the predual of M . Let us consider two special cases. The first is where M is commutative, say, M = L∞ (Ω, µ) for some probability space (Ω, µ) (µ can be, of course, assumed to be a σ-finite measure). Then we recover the usual Lp -spaces Lp (Ω). The second case concerns M = B(n2 ), equipped with the usual trace Tr (which can be normalized to a state if we wish). Then we get the Schatten classes Spn . The infinite dimensional algebra B(2 ) is not covered by this
Interactions between Quantum Probability and Operator Space Theory
133
definition since the usual trace Tr on B(2 ) is not finite. However, it still has a nice trace in the sense that it is normal, semifinite and faithful. The preceding construction can be done for normal semifinite faithful traces too. The resulting spaces for (B(2 ), Tr) are the Schatten classes Sp . Recall that S1 and S2 are respectively the trace and Hilbert-Schmidt classes. Note that by definition S∞ is the whole B(2 ). The previous definition does not apply to type III von Neumann algebras. There are several equivalent constructions of noncommutative Lp -spaces in the type III case. Here we adopt the one by Kosaki [Ko] via complex interpolation. Let M be a von Neumann algebra equipped with a normal faithful state ϕ. Define L∞ (M ) = M as before and L1 (M ) = M∗ . Consider the left injection j of L∞ (M ) into L1 (M ) by j(x) = xϕ. The faithfulness of ϕ implies that j is injective and its range is dense in L1 (M ). This injection makes (L∞ (M ), L1 (M )) compatible. Thus we can consider the complex interpolation spaces between them. Now for 1 < p < ∞ define . Lp (M ) = L∞ (M ), L1 (M ) 1 . p
We refer to the survey paper [PX] for more information and historical references on noncommutative Lp -spaces. 6.2 Operator Space Structures on Noncommutative Lp . Now we turn to describe the natural operator space structure on Lp (M ) (see [P3] for more information). For p = ∞, L∞ (M ) = M has its natural operator space structure as a von Neumann algebra. This also yields an operator space structure on M ∗ , the standard dual of M . To deal with the case p = 1 we consider the opposite von Neumann algebra M op of M . M op is the same as M but with the new multiplication which is opposite to that of M : x · y in M op is equal to yx ∈ M . Note that if M acts on H, then M op acts on H ∗ and coincides with {xt : x ∈ M }, where xt denotes the transpose (= Banach space adjoint) of x. It is clear that the map x → x∗ establishes an isomorphism between M and M op . Thus L1 (M ) is isometric to L1 (M op ) at the Banach space level. This allows us to equip L1 (M ) with the operator space structure inherited from (M op )∗ . The main reason for this choice is , 1 (M ) (operator space that it insures that the equality L1 (Mn ⊗ M ) = S1n ⊗L projective tensor product) holds true. Finally, the operator space structure of Lp (M ) is obtained by complex interpolation. It is worth to mention that L2 (M ) is an operator Hilbert space by virtue of a theorem of Pisier. Thus for every σ-finite measure space (Ω, µ), the commutative Lp -spaces Lp (Ω) are equipped with their natural operator space structures. In particular, the p are operator spaces and 2 = OH. The same happens to the Schatten classes Sp too. If 1 ≤ p < ∞, the dual space of Sp is Sp with respect to the so-called parallel duality bracket x, y = Tr(xy t ) = xij yij i,j
134
Q. Xu
for x = (xij ) ∈ Sp and y = (yij ) ∈ Sp . This is due to our definition that S1 is defined as the predual of B(2 )op . 6.3 Vector-valued Schatten Classes. We wish to define Schatten classes with values in operator spaces. To this end we first recall the minimal tensor product in the category of operator spaces. Let E ⊂ B(H) and F ⊂ B(K) be two operator spaces. Let x ∈ B(H) and y ∈ B(K). The tensor x ⊗ y is an operator on the Hilbert space tensor product H ⊗ K defined by x⊗ y(ξ ⊗ η) = x(ξ) ⊗ y(η). It is easy to check that x ⊗ y is bounded and x ⊗ y = x y. Consequently, the algebraic tensor product E ⊗ F is a vector subspace of B(H ⊗ K). Then the minimal tensor product E ⊗min F is defined to be the closure of E ⊗ F in B(H ⊗ K). Now let E be an operator space. Define S∞ [E] to be S∞ ⊗min E. The elements in S∞ [E] are often represented as infinite matrices with entries in E. To define S1 [E] we use duality. The operator space structure to be put in S1 [E] will be such that the dual space of S1 [E] is S∞ [E ∗ ]. More precisely, let u ∈ S1 ⊗ E. Write u= ak ⊗ xk with ak ∈ S1 , xk ∈ E. k
Consider u as a linear functional on S∞ [E ∗ ] as follows. For v = S∞ ⊗ E ∗ define u, v = ak , bj xk , ξj = Tr(ak btj ) ξj (xk ). k,j
j bj
⊗ ξj ∈
k,j
Then the norm of u is defined to be the linear functional norm of u on S∞ [E ∗ ], which coincides with the norm of u in CB(S∞ [E ∗ ], C) (see Proposition 3.3). We define S1 [E] to be the closure of S1 ⊗E with respect to this norm. Next, we have to introduce a norm · n on Mn (S1 [E]) for any n. This is now easy. As before, every u ∈ Mn (S1 ⊗ E) induces a linear map from S∞ [E ∗ ] to Mn . Then define un = uCB(S∞ [E ∗ ],Mn ) . It is then routine to check that these norms satisfy Ruan’s axioms. Therefore, S1 [E] becomes an operator space. Having defined S∞ [E] and S1 [E], we define Sp [E] by interpolation for any 1 < p < ∞: . Sp [E] = S∞ [E], S1 [E] 1/p . The elements of Sp [E] are often represented as infinite matrices with entries in E. It is not hard to show that finite matrices (i.e., those with only a finite number of nonzero entries) are dense in Sp [E] for p < ∞. The following theorem of Pisier is very useful. The reader is referred to [P2] for its proof.
Interactions between Quantum Probability and Operator Space Theory
135
Theorem 6.1. Let 1 ≤ p < ∞. i) Any x = (xij ) ∈ Sp [E] admits a factorization x = ayb with a, b ∈ S2p and y ∈ S∞ [E]. Here the product is the usual matrix product. Moreover, we have / 0 xSp [E] = inf a2p yS∞ [E] b2p . x=ayb
ii) Conversely, for any x = (xij ) ∈ S∞ [E] / 0 xS∞ [E] = sup axbSp [E] : a, b ∈ S2p , a2p ≤ 1, b2p ≤ 1 . Corollary 6.2. Let E and F be two operator spaces. Let 1 ≤ p < ∞. Then a linear map u : E → F is c.b. iff sup ISpn ⊗ u : Spn [E] → Spn [F ] < ∞; n
moreover in this case the supremum above is equal to ucb . Alternatively, u is c.b. iff ISp ⊗ u extends to a bounded map from Sp [E] to Sp [F ]. Proof. Assume that u is c.b., i.e., n n n ⊗ u : S ucb = sup IS∞ ∞ [E] → S∞ [F ] < ∞. n
Let x = (xij ) be a matrix in Spn [E] with norm less than 1. Then x admits a factorization x = ayb with n ≤ 1, aS2p
n [E] ≤ 1, yS∞
n ≤ 1. bS2p
We have I ⊗ u(x) = a(I ⊗ u)(y)b. Therefore, I ⊗ u(x) n ≤ aS n I ⊗ u(y) n n ≤ ucb ; bS2p 2p S [F ] S [F ] p
whence
∞
sup ISpn ⊗ u : Spn [E] → Spn [F ] ≤ ucb . n
The converse is proved similarly.
The previous corollary is very useful notably for subspaces of noncommutative Lp -spaces for the following reason. Given E ⊂ Lp (M ) it is usually difficult to determine the norm of Mn (E); but it is extremely simple to describe the norm of Sp [E], as shows the next paragraph. We will only need the case where E is a subspace of a noncommutative Lp (M ) in which the previous theory becomes much simpler. Note that there
136
Q. Xu
is a natural algebraic identification of Lp (Mn ⊗ M ) with Mn (Lp (M )). Then Spn [Lp (M )] is nothing but the linear space Mn (Lp (M )) equipped with the norm of Lp (Mn ⊗ M ). More generally, if E ⊂ Lp (M ) is a closed subspace, the norm of Spn [E] is induced by that of Spn [Lp (M )]. In the infinite dimensional ¯ ) for case, Sp [Lp (M )] is completely isometrically identified with Lp (B(2 )⊗M all 1 ≤ p < ∞. If E ⊂ Lp (M ), then Sp [E] is the closure of Sp ⊗ E in ¯ ). Lp (B(2 )⊗M 6.4 Column and Row p-spaces. The column and row spaces, C and R, are pillars of the whole theory of operator spaces. Recall that C and R are respectively the (first) column and row subspaces of S∞ . By analogy, let Cp (resp. Rp ) denote the first column (resp. row) subspace of Sp . Since S2 is an OH space, C2 R2 OH. The n-dimensional versions of these spaces are denoted by Cpn and Rpn . Now let E be an operator space. We denote by Cp [E] (resp. Rp [E]) the closure of Cp ⊗ E (resp. Rp ⊗ E) in Sp [E]. If E is a subspace of a noncommutative Lp (M ), the norm of Cp [E] is easy to determine. We consider only the case where M is semifinite. For any finite sequence (xk ) ⊂ E xk ⊗ ek
Cp [E]
- ∗ .1/2 = xk xk , Lp (M)
k
k
where (ek ) denotes the canonical basis of Cp . More generally, if ak ∈ Cp , then xk ⊗ ak
Cp [E]
k
- .1/2 = aj , ak x∗k xj , Lp (M) j,k
where , denotes the scalar product in Cp . (In terms of matrix product, aj , ak = a∗k aj .) We also have a similar description for Rp [E]. We end this section by describing the operator space structure of C + R with help of Corollary 6.2. To this end we use the identification that C R1 and R C1 (see Exercise 2 below). Thus C + R R1 + C1 , which is the quotient of R1 ⊕1 C1 by the subspace {(x, y) ; x + y = 0}. Therefore, for any finite sequence (xk ) ⊂ S1 / 0 (xk ) = inf (yk )S1 [R1 ] + (zk )S1 [C1 ] S1 [C+R] - ∗ .1/2 0 .1/2 / yk yk∗ zk zk = inf ( )S1 + ( )S1 , k
k
where the infimum runs over all decompositions of xk = yk + zk in S1 . It follows that S1 [C + R] = C1 [S1 ] + R1 [S1 ] with equal norms (even completely isometrically). Exercises: 1) Let 1 have its natural operator space structure. Let x ∈ Mn (1 ) with x = i xi ⊗ ei (with (ei ) the canonical basis of 1 ). Prove
Interactions between Quantum Probability and Operator Space Theory
xMn ( 1 )
/ = sup xi ⊗ yi
Mmn
137
0 : yi ∈ Mm , yi ≤ 1, m ∈ N .
i
On the other hand, show S1 [1 ] = 1 (S1 ) completely isometrically. 2) Let 1 ≤ p ≤ ∞ and p be the conjugate index of p. Prove the following completely isometric identities: (Cp )∗ ∼ = Cp ∼ = Rp
and (Rp )∗ ∼ = Rp ∼ = Cp
by identifying the canonical bases in question. 3) Prove that Cp and Rp are homogeneous Hilbertian spaces. 4) Compute (or estimate) dcb (Cpn , Cqn ) for 1 ≤ p, q ≤ ∞. Then prove that Cp and Cq are not completely isomorphic for p = q.
7 Noncommutative Khintchine Type Inequalities This section is devoted to Khintchine type inequalities in the noncommutative Lp -spaces. These inequalities are of paramount importance in operator space theory and noncommutative analysis. 7.1 The Classical Khintchine Inequalities. Let (εk ) be a Rademacher sequence on a probability space (Ω, P ), i.e., an independent sequence of random variables such that P (εk = 1) = P (εk = −1) = 1/2. The classical Khintchine inequality states that for any 1 ≤ p < ∞ and any finite sequence (xn ) ⊂ C - .1/2 xk εk p ∼cp xk εk 2 = |xk |2 . (7.1) k
k
k
Here as well as in the sequel we use A ∼c B to abbreviate c−1 B ≤ A ≤ cB. cp denotes a positive constant depending only on p. Using the Fubini theorem, we deduce a similar inequality for coefficients xn in a commutative Lp -space, say, in Lp (0, 1). Namely, xk εk
Lp (Ω;Lp (0,1))
- .1/2 ∼ cp |xk |2 . Lp (0,1)
k
(7.2)
k
Note that the norm of Lp (Ω; Lp (0, 1)) in the above equivalence can be replaced by that of Lq (Ω; Lp (0, 1)) for any 1 ≤ q < ∞. (The relevant constant then depends on q too.) This is because of the so-called Khintchine-Kahane inequalities (cf. [Ka]). Let E be a Banach space and 1 ≤ p, q < ∞. Then for any finite sequence (xk ) ⊂ E we have xk εk Lp (Ω;E) ∼cp,q xk εk Lq (Ω;E) . k
k
138
Q. Xu
Now we wish to extend (7.2) to the noncommutative setting, i.e., replacing Lp (0, 1) by a noncommutative Lp . We will consider only the case where the coefficients xk are in the Schatten classes Sp . All inequalities stated below are valid for general noncommutative Lp . On the other hand, we will concentrate mainly on the case p = 1 (and the case p = ∞ in the free case). Thus our goal is to find a deterministic expression for xk εk Lp (Ω;Sp ) . - .1/2 In view of the square function |xk |2 in (7.2), we are naturally led to conjecture that the deterministic expression to be found should involve the term - ∗ .1/2 - .1/2 = . x xk |xk |2 k
p
p
This norm is also equal to (xk )Cp [Sp ] . Hereand in the sequel, we often identify a sequence (xk ) in E with the element k xk ⊗ ek in Cp [E] or Rp [E]. But now because of the noncommutativity, we should also take into account the right modulus, i.e., the term - ∗ 2 .1/2 - .1/2 = = (xk )R [S ] . |xk | xk x∗k p p p p Although ap = a∗ p for a single operator a ∈ Sp , the two terms above are not comparable at all if p = 2. For example, if xk = ek1 , then clearly n - .1/2 = n1/2 x∗k xk p
n - .1/2 = n1/p . and xk x∗k p
k=1
k=1
7.2 Column and Row Subspaces. In this subsection we collect some basic properties of the column and row subspaces Cp [Sp ] and Rp [Sp ]. Proposition 7.1. i) The H¨ older inequality: Let 1 ≤ p, q, r ≤ ∞ such that 1/r = 1/p + 1/q. Then for any sequences (xk ) ∈ Cp [Sp ] and (yk ) ∈ Cq [Sq ] ∗ y x converges in Sr (with respect to the w*-topology if the series k k k r = ∞) and ∗ yk xk r ≤ (xk )C [S ] (yk )C [S ] . p
p
q
q
k
ii) Complementation: Cp [Sp ] and Rp [Sp ] are 1-complemented subspaces of Sp (2 ⊗ 2 ) for any 1 ≤ p ≤ ∞. More precisely, let P : Sp (2 ⊗ 2 ) → Sp (2 ⊗ 2 ) be defined by P (x) = xe, where e = 1 ⊗ e11 . Then P is a contractive projection from Sp (2 ⊗ 2 ) onto Cp [Sp ]. iii) Duality: Let 1 ≤ p < ∞, and let p be the conjugate index of p. Then Cp [Sp ]∗ = Cp [Sp ]
and
Rp [Sp ]∗ = Rp [Sp ]
Interactions between Quantum Probability and Operator Space Theory
139
isometrically with respect to the anti-linear duality bracket: (xk ), (yk ) → Tr(yk∗ xk ). k≥1
Proof. i) Given (xk ) ⊂ Sp define ⎛
x1 ⎜x2 T ((xk )) = ⎝ .. .
⎞ 0 ··· 0 · · ·⎟ ⎠. .. .
We view T ((xk )) as an element in Sp [Sp ] = Sp (2 ⊗ 2 ). Now let (yk ) ⊂ Sq be another finite sequence. Then yk∗ xk = T ((yk ))∗ T ((xk )). k
So the desired inequality follows from the H¨ older inequality in Sp (2 ⊗ 2 ). ii) This is obvious. Note that P (x) is the matrix whose first column is that of x and all others are zero. iii) Using i) one sees that the duality is well-defined. The two duality equalities are immediate consequences of ii) and the duality between Sp (2 ⊗ 2 ) and Sp (2 ⊗ 2 ). Proposition 7.2. Let 1 ≤ p ≤ ∞ and (xk ) ⊂ Sp be a finite sequence. i) If 2 ≤ p ≤ ∞, then 0 - .1/2 / xk 2p . max (xk )Cp [Sp ] , (xk )Rp [Sp ] ≤ k
ii) If 1 ≤ p ≤ 2, then / min (xk )C
p [Sp ]
, (xk )R
0
p [Sp ]
≥
-
xk 2p
.1/2
.
k
Proof. i) Let p ≥ 2. By the triangle inequality in Sp/2 we have (xk )2 = |xk |2 p/2 ≤ xk 2p . Cp [Sp ] k
k
Passing to adjoints we get the inequality on the row norm. ii) This follows from i) by duality.
Corollary 7.3. i) Let (Σ, µ) be a measure space, and let f belong to the algebraic tensor product L2 (Σ) ⊗ Sp . Then if 2 ≤ p ≤ ∞, /* max
Σ
f (t)∗ f (t)dµ(t)
+1/2 * , p
Σ
f (t)f (t)∗ dµ(t)
+1/2 0 ≤ f p L
2 (Σ;Sp )
.
140
Q. Xu
and if 1 ≤ p ≤ 2, f
L2 (Σ;Sp )
/* ≤ min
Σ
f (t)∗ f (t)dµ(t)
+1/2 * , p
Σ
f (t)f (t)∗ dµ(t)
+1/2 0 . p
ii) In particular, if (ϕk ) is an orthonormal sequence in L2 (Σ) and (xk ) a finite sequence in Sp , then for 2 ≤ p ≤ ∞ 0 / xk ϕk L2 (Σ;Sp ) ; max (xk )Cp [Sp ] , (xk )Rp [Sp ] ≤ k
and for 1 ≤ p ≤ 2 / 0 xk ϕk L2 (Σ;Sp ) ≤ inf (yk )Cp [Sp ] + (zk )Rp [Sp ] , k
where the infimum runs over all decompositions xk = yk + zk with yk and zk in Sp . Proof. i) Note that since f ∈ L2 (Σ) ⊗ Sp , the two integrals f (t)∗ f (t)dµ(t) and f (t)f (t)∗ dµ(t) Σ
Σ
are well-defined and belong to Sp/2 . The desired inequalities follow from the corresponding ones in the previous proposition. ii) The first inequality immediately follows from i) above. To prove the second take a decomposition xk = yk + zk . Then again by the previous proposition xk ϕk L2 (Σ;Sp ) ≤ yk ϕk L2 (Σ;Sp ) + zk ϕk L2 (Σ;Sp ) k
k k ≤ (yk )Cp [Sp ] + (zk )Rp [Sp ] ;
whence the desired inequality.
Recall that (C, R) is considered as a compatible pair by identifying their canonical bases with that of 2 . This identification is extended to all spaces Cp and Rp . Thus any pair (Cp , Rq ) is also compatible. Then the maximum and infimum in Corollary 7.3, ii) are respectively (xk )Cp [Sp ]∩Rp [Sp ] and (xk )Cp [Sp ]+Rp [Sp ] . For notational simplicity, we introduce the following Definition 7.4. For 1 ≤ p ≤ ∞ define CRp [Sp ] = Cp [Sp ]∩Rp [Sp ] if p ≥ 2
and CRp [Sp ] = Cp [Sp ]+Rp [Sp ] if p < 2.
Since Cp [Sp ] = Sp [Cp ] and Rp [Sp ] = Sp [Rp ], Cp [Sp ] ∩ Rp [Sp ] = Sp [Cp ∩ Rp ] and Cp [Sp ] + Rp [Sp ] = Sp [Cp + Rp ]
Interactions between Quantum Probability and Operator Space Theory
141
with equivalent norms; moreover, the equivalence constants are controlled by a universal one. By Corollary 6.2, these identities are also completely isomorphic. Thus if we define CRp = Cp ∩ Rp for p ≥ 2 and CRp = Cp + Rp for p < 2, we obtain CRp [Sp ] = Sp [CRp ] with complete equivalent norms. We are now well prepared for our noncommutative Khintchine inequalities. 7.3 Rademacher Sequences. The following is the noncommutative Khintchine inequality for Rademacher variables (εk ) due to Lust-Piquard and Pisier. Theorem 7.5. Let 1 ≤ p < ∞ and (xk ) be a finite sequence in Sp . Then xk εk L (Ω;S ) ∼cp (xk )CR [S ] . p
p
p
p
k
More precisely, i) if 2 ≤ p < ∞, then (xk )
CRp [Sp ]
√ ≤ xk εn Lp (Ω;Sp ) ≤ c p (xk )CRp [Sp ] ; k
ii) if 1 ≤ p < 2, then c−1 (xk )CRp [Sp ] ≤ xk εk Lp (Ω;Sp ) ≤ (xk )CRp [Sp ] , k
where c is a universal positive constant. Proof. The lower estimate in i) and the upper estimate in ii) follow from Corollary 7.3. We will prove only the lower estimate in ii) for p = 1, following the recent approach of Haagerup and Musat [HM]. The reader is referred to [LPP] for the proof of all remaining cases and to [P2] for the optimal order of the best constant for the upper estimate in i). By duality, the lower estimate of ii) for p = 1 is equivalent to the following statement: (∗)For any finite sequence (xk ) ⊂ S∞ there exists a function f ∈ L∞ (Ω; S∞ ) such that f,(εk ) = xk and f L∞ (Ω;S∞ ) ≤ c (xk )CR∞ [S∞ ] , where f,(εk ) = E(f εk ) with E denoting the expectation on the probability space (Ω, P ). Let xk ∈ S∞ be selfadjoint and such that (xk )CR∞ [S∞ ] ≤ 1. Let g=
k
εk xk .
142
Q. Xu
Then
g2 =
x2k +
k
and E(g 4 ) =
εj εk (xj xk + xk xj )
j
-
x2k
.2
+
k
(xj xk + xk xj )2
j
≤ 1+2 (xj x2k xj + xk x2j xk ) j
= 1+2
j
xj
-
. x2k xj ≤ 3.
k=j
Now let λ be a positive number to be determined later. Set fλ = g1l[−λ, λ] (g) and gλ = g − fλ , where 1l[−λ, λ] (g) denotes the spectral projection of g corresponding to the interval [−λ, λ]. By definition, fλ L∞ (Ω;S∞ ) ≤ λ. On the other hand, letting zk = E(gλ εk ), we have zk2 ≤ E(gλ2 ). k
However, λ2 gλ2 ≤ g 4 . Therefore, combining the preceding inequalities, we find - 2 .1/2 . .1/2 ≤ E(g 2 ) 1/2 zk ≤ λ−1 E(g 4 ) ≤ λ ∞ L∞ (Ω;S∞ ) L∞ (Ω;S∞ ) k
√ 3 . λ
√ For λ = 2 3 let f (0) = fλ ,
(0)
xk = E(f (0) εk ),
(0)
zk = zk .
Then (0)
(0)
xk = xk + zk ,
√ f (0) L∞ (Ω;S∞ ) ≤ 2 3 ,
- (0) . 1 z ≤ . k CR∞ [S∞ ] 2
(0)
Repeating the same argument with 2zk instead of xk , we find a function - (1) . f (1) and a finite sequence zk such that (0)
(1)
(1)
2zk = xk + zk ,
√ f (1) L∞ (Ω;S∞ ) ≤ 2 3 ,
where (1)
xk = E(f (1) εk ) .
- (1) . z k
CR∞ [S∞ ]
≤
1 , 2
Interactions between Quantum Probability and Operator Space Theory
Continuing this procedure we obtain a sequence - (n) . in S∞ such that L∞ (Ω; S∞ ) and a sequence xk xk =
2−n xk , (n)
√ f (n) L∞ (Ω;S∞ ) ≤ 2 3 ,
143
- (n) . of functions in f
(n)
xk
= E(f (n) εk ) .
n≥0
Put f=
2−n f (n) .
n≥0
Then
√ f L∞ (Ω;S∞ ) ≤ 4 3 and xk = E(f εk ) .
Thus the statement (∗) is proved for selfadjoint xk . The general case is easily reduced to the selfadjoint one by decomposing each xk into its real and √ imaginary parts. Note that the final constant c obtained in this way is 8 3. We √ refer to [HM] for a more careful argument which yields 3 as constant. Remark 7.6. Let Rp be the closed subspace of Lp (Ω) generated by the εk . Using Corollary 6.2, we can rephrase Theorem 7.5 as the fact that Rp is completely isomorphic to CRp . This remark also applies to Theorems 7.8 and 7.9 below. Remark 7.7. The Rademacher sequence (εk ) can be replaced by a standard Gaussian sequence. More generally, let (ϕk ) be an independent sequence of random variables on (Ω, P ). Assume that (ϕk ) is symmetric in the sense that (ϕk ) has the same distribution as (±ϕk ) for any sequence of signs. Assume further that 0 < inf ϕk p , k
sup ϕk 2 < ∞ for 1 ≤ p < 2 k
and 0 < inf ϕk 2 , k
sup ϕk p < ∞ for 2 ≤ p < ∞. k
Then Theorem 7.5 holds for (ϕk ) instead of (εk ) with relevant constants depending on (ϕk ) too. Since now we are in the noncommutative setting, it is natural to consider Khintchine type inequalities for noncommutative random variables instead of (εk ). We first consider the tracial case by giving two important examples. Namely, free generators and semicircular systems. We start with free generators. 7.4 Free Generators. Consider a discrete group G. Let (δg )g∈G be the canonical basis of 2 (G), i.e., δg is the function on G that takes value 1 at g
144
Q. Xu
and zero elsewhere. Let λ : G → B(2 (G)) be the left regular representation. Namely, for any g ∈ G, λ(g) is the unitary operator on 2 (G) defined by . λ(g)ϕ (h) = ϕ(g −1 h), h, g ∈ G, ϕ ∈ 2 (G). Note that λ(g)δh = δgh for all g, h ∈ G. Then the group von Neumann by algebra V N (G) is the von Neumann subalgebra of B(2 (G)) generated {λ(g) : g ∈ G}. Namely, V N (G) is the w*-closure of all finite sums αg λ(g) with αg ∈ C. V N (G) also coincides with the left convolution algebra of 2 (G). Recall that if ϕ, ψ ∈ 2 (G), their convolution is defined by ϕ ∗ ψ(g) = ϕ(h)ψ(h−1 g), g ∈ G. h∈G
Then x ∈ V N (G) iff there exists ϕ ∈ 2 (G) such that xψ = ϕ ∗ ψ for every ψ ∈ 2 (G). Let τG be the vector state on V N (G) determined by δe , i.e., τG (x) = xδe , δe for any x ∈ V N (G). Then it is easy to check that τG is faithful and tracial. If we identify an operator x ∈ V N (G) with its symbol xδe in 2 (G), then L2 (V N (G)) is nothing but 2 (G). L1 (V N (G)) is traditionally called the Fourier algebra of G and denoted by A(G). Since an operator in L1 (V N (G)) is a product of two operators in L2 (V N (G)), a function ϕ on G belongs to A(G) iff there exist two functions ψ, ρ ∈ 2 (G) such that ϕ = ψ ρ. We refer to [KR] for more information. , so is commutative, where G , is If G is abelian, V N (G) ie equal to L∞ (G), the dual group of G. An important example of non abelian groups is a free group F on n generators (gk ) with n ∈ N ∪ {∞}. The sequence (λ(gk ))k of the unitary operators given by the generators is of particular interest. With a slight abuse of terminology, we will also call it a sequence of free generators . Note that (λ(gk ))k is orthonormal in L2 (V N (F)). Let us determine its linear span in V N (F). To this end let Fk be the closed subspace of 2 (F) generated by all those basic vectors δg for which g is a reduced word starting with gk−1 . The Fk , k = 1, 2, ..., are mutually orthogonal. Let Fk be the orthogonal projection from 2 (F) onto Fk . Now, given a finite sequence (αk ) ⊂ C write αk λ(gk ) = αk λ(gk )Fk + αk λ(gk )Fk⊥ . k
k
k
By the mutual orthogonality of the Fk , we have 2 αk λ(gk )Fk ∞ = ( αk λ(gk )Fk )( αk λ(gk )Fk )∗ ∞ k
k
k
= |αk |2 λ(gk )Fk λ(gk )∗
∞
k
≤
k
|αk |2 .
Interactions between Quantum Probability and Operator Space Theory
145
To treat another term, observe that for k = j the range of λ(gk )∗ λ(gj )Fj⊥ is contained in Fk , so Fk⊥ λ(gk )∗ λ(gj )Fj⊥ = 0. Then it follows that 2 αk λ(gk )Fk⊥ ∞ = ( αk λ(gk )Fk⊥ )∗ ( αk λ(gk )Fk⊥ )∞ k
k
k
= |αk |2 Fk⊥ ∞ ≤ |αk |2 . k
Therefore,
k
αk λ(gk )
∞
≤2
-
k
|αk |2
.1/2
.
k
The converse inequality with constant 1 is obvious for .1/2 - αk λ(gk )∞ ≥ αk λ(gk )2 = |αk |2 . k
k
k
Consequently, for any 1 ≤ p ≤ ∞ the closed subspace generated by the λ(gk ) in Lp (V N (F)) is isomorphic to 2 . More precisely, for any finite sequence (αk ) ⊂ C, - .1/2 αk λ(gk )p ∼c |αk |2 , k
k
where c is a universal constant. This inequality remains true if the scalar coefficients (αk ) are replaced by operator coefficients. The resulting inequalities are the Khintchine inequality for free generators . In the following state¯ N (F)) is the noncommutative Lp -space associated with ment Lp (B(2 )⊗V ¯ N (F), equipped with the tensor the von Neumann tensor product B(2 )⊗V trace Tr ⊗ τF , which is a normal semifinite faithful trace. Note that ¯ N (F)) = Sp [Lp (V N (F))]. Lp (B(2 )⊗V The following theorem is due to Haagerup/Pisier [HP] for p = ∞, 1 and to Pisier [P2] for 1 < p < ∞. Theorem 7.8. Let 1 ≤ p ≤ ∞ and (xk ) be a finite sequence in Sp . Then xk ⊗ λ(gk )Lp (B( 2 )⊗V (7.3) ¯ N (F)) ∼c (xk ) CRp [Sp ] k
with a universal constant c. Moreover, the closed subspace of Lp (V N (F)) generated by the λ(gk ) is completely complemented in Lp (V N (F)) with relevant constant ≤ 2. Proof. Here we prove (7.3) only in the cases p = ∞, 1 and the complementation assertion. The remaining cases are postponed to subsection 7.6. For p = ∞ we have the following inequalities
146
Q. Xu
(xk ) CR∞ [S∞ ]
≤ xk ⊗ λ(gk )
¯ N (F) B( 2 )⊗V
≤ 2(xk )CR∞ [S∞ ]
(7.4)
k
for any finite sequence (xk ) ⊂ S∞ . The proof of the second inequality above is the same as in the scalar case. Let us show the first one. Take a unit vector ξ ∈ 2 . Then 2 xk ⊗ λ(gk )∞ ≥ xk ⊗ λ(gk )(ξ ⊗ δe ), xk ⊗ λ(gk )(ξ ⊗ δe ) k
k
k
xk (ξ) ⊗ δgk , xk (ξ) ⊗ δgk = k
=
k
xk (ξ), xk (ξ) = x∗k xk (ξ), ξ;
k
whence
- ∗ .1/2 xk xk
k
∞
≤ xk ⊗ λ(gk )∞ .
k
k
Taking adjoints, we find - .1/2 ≤ xk x∗k xk ⊗ λ(gk )∞ . ∞ k
k
Therefore, the lower estimate of (7.4) is proved. Dualizing (7.4), we get the case p = 1: 1 (xk ) ≤ xk ⊗ λ(gk )L1 (B( 2 )⊗V ¯ N (F)) ≤ (xk ) CR1 [S1 ] (7.5) CR [S ] 1 1 2 k
for any finite sequence (xk ) ⊂ S1 . Indeed, let (yk ) ⊂ S∞ be such that (xk ) = Tr(yk∗ xk ) and (yk )CR∞ [S∞ ] ≤ 1 CR1 [S1 ] k
(see Proposition 7.1 iii)). Set ¯ N (F)), xk ⊗λ(gk ) ∈ L1 (B(2 )⊗V x= k
y=
¯ N (F). yk ⊗λ(gk ) ∈ B(2 )⊗V
k
Then by (7.4) Tr(yk∗ xk ) = Tr ⊗ τF (y ∗ x) ≤ y∞ x1 ≤ 2(yk )CR∞ [S∞ ] x1 ≤ 2x1 . k
This is the lower estimate of (7.5). To show the upper estimate we consider the projection P from the algebra of all finite sums αg λ(g) with αg ∈ C onto the linear span of the λ(gk ). Let Q = I−P . It is easy to see that P (x) and Q(x) are orthogonal relative to the scalar product of L2 (V N (F)). Thus the
Interactions between Quantum Probability and Operator Space Theory
147
extension of P on L2 (V N (F)) is the orthogonal projection from L2 (V N (F)) onto the closed subspace generated by the λ(gk ). Now let x = g∈F xg ⊗ λ(g) be a finite sum with xg ∈ S∞ . Write xk ⊗ λ(gk ) + idS∞ ⊗ Q(x). x = idS∞ ⊗ P (x) + idS∞ ⊗ Q(x) = k
Then using the argument yielding the first inequality of (7.4), we get (xk ) ≤ x∞ . (7.6) CR∞ [S∞ ] Together with a duality argument as above, this inequality implies the upper estimate of (7.5). Combining (7.4) and (7.6), we get P (x)∞ ≤ 2x∞ . On the other hand, note that Tr ⊗ τF (y ∗ P (x)) = Tr ⊗ τF (P (y)∗ x) for all finite sums x = g∈F xg ⊗ λ(g) and y = g∈F yg ⊗ λ(g) with xg ∈ S∞ and yg ∈ S1 . We then deduce that P extends to a completely bounded map P1 on L1 (V N (F)) (with P1 cb ≤ 2), which is a pre-adjoint of P . This implies that P extends to a completely bounded normal projection on V N (F). Note that P1 coincides with P on the family of finite sums as above, which allows us to denote P1 still by P . Finally, by interpolation P extends to a complete bounded projection on Lp (V N (F)) for every 1 < p < ∞. 7.5 Semicircular Systems. Let H be a complex Hilbert space. The associated free (or full) Fock space is defined by ) H ⊗n , F (H) = n≥0
where H ⊗0 = C1l (1l being a unit vector, called vacuum), and H ⊗n is the n-th Hilbertian tensor power of H for n ≥ 1. The (left) creator associated with a vector ξ ∈ H is the operator on F (H) uniquely determined by c(ξ) η1 ⊗ · · · ⊗ ηn = ξ ⊗ η1 ⊗ · · · ⊗ ηn for any η1 , ..., ηn ∈ H. Here η1 ⊗ · · · ⊗ ηn is understood as the vacuum 1l if n = 0. It is clear that c(ξ) is bounded and c(ξ) = ξ. The adjoint of c(ξ) is given by c(ξ)∗ η1 ⊗ · · · ⊗ ηn = η1 , ξ η2 ⊗ · · · ⊗ ηn for any η1 , ..., ηn ∈ H with n ≥ 1 and c(ξ)∗ 1l = 0. This is the annihilator associated with ξ and is denoted by a(ξ). Note that the map ξ → c(ξ) is
148
Q. Xu
linear, while ξ → a(ξ) is anti-linear. We have the following free commutation relation: a(η)c(ξ) = ξ, η1, ∀ ξ, η ∈ H. (7.7) Now assume that H is the complexification of a real Hilbert space HR . The vectors in HR are called real. Let ξ ∈ H be real and define s(ξ) = c(ξ) + a(ξ). s(ξ) is a semicircular element in Voiculescu’s sense. We will also call it a free Gaussian variable . Note that the map ξ → s(ξ) is real linear from HR into B(F (H)). Then the free von Neumann algebra Γ (H) associated with H is the von Neumann subalgebra of B(F (H)) generated by all s(ξ) with real ξ ∈ H: 0 / Γ0 (H) = s(ξ) : ξ ∈ HR ⊂ B(F (H)) . The vector state τ0 defined by the vacuum, x → x1l, 1l is faithful and tracial on Γ0 (H). We refer to [VDN] for more information. Let us mention some basic properties of free Gaussian variables. Let ξ ∈ H be a unit real vector. By definition, s(ξ) is selfadjoint; its spectrum is [−2, 2] and the corresponding measure induced by τ0 is the so-called Wigner measure dµ(t) = Thus for any 1 ≤ p < ∞ s(ξ) = p
1 4 − t2 dt. 2π
2
−2
|t|p
dt 1/p 4 − t2 . 2π
Therefore, s(ξ) = 2, ∞
s(ξ) = 1, 2
s(ξ) = 8 . 1 3π
Now let (ξk ) be an orthonormal sequence of real vectors of H. (s(ξk )) is then called a standard semicircular system. Like the classical standard Gaussian variables, following invariance property. Let (αk ) ⊂ (s(ξk )) has the opR be such that k |αk |2 = 1. Then n αk s(ξk ) (convergence in the strong erator topology) is again a free Gaussian variable, i.e., s(ξ) with ξ = k αk ξk . More generally, if s(ξ1 ), ..., s(ξn ) is a standard semicircular system and u = (ujk ) an orthogonal n × n matrix, then n -
. ujk s(ξk ) 1≤j≤n
k=1
is still a standard semicircular system. Indeed, n k=1
n ujk s(ξk ) = s( ujk ξk ) = s(ηj ), k=1
Interactions between Quantum Probability and Operator Space Theory
149
where ηj = k ujk ξk . The ηj form an orthonormal family. This orthogonal invariance implies that if (s(ξk )) is a standard semicircular system, then for (αk ) ⊂ R such that k |αk |2 < ∞ and any 1 ≤ p ≤ ∞ .1/2 - s(ξ) . αk s(ξk )p = |αk |2 p k≥1
k≥1
In particular, (s(ξk )) is an orthonormal sequence in L2 (Γ (H)). For simplicity we now assume that H is infinite dimensional and separable and put Γ0 = Γ0 (H). Let (ek ) be an orthonormal basis of H and set sk = s(ek ). Thus (sk ) is a semicircular sequence and Γ0 is generated by the sk . The following inequality for semicircular systems comes from [P2] . Theorem 7.9. Let 1 ≤ p ≤ ∞ and (xk ) be a finite sequence in Sp . Then xk ⊗ sk Lp (B( 2 )⊗Γ (7.8) ¯ 0 ) ∼c (xk ) CRp [Sp ] . k
Moreover, the closed subspace of Lp (Γ0 ) generated by the sk is completely complemented in Lp (Γ0 ) with constant 2. Proof. This proof is similar to that of Theorem 7.8. Again, the case 1 < p < ∞ will be proved later. By the free commutation relation (7.7), we have 2 - ∗ .∗ - . xk ⊗ c(ek )∞ = xk ⊗ c(ek ) xk ⊗ c(ek ) ∞ = xk xk ∞ . k
k
k
k
Similarly, 2 xk ⊗ a(ek )∞ = xk x∗k ∞ . k
k
It follows that - ∗ .1/2 - .1/2 + . xk ⊗ sk ∞ ≤ xk xk xk x∗k ∞ ∞ k
k
k
For the lower estimate, take a unit vector ξ ∈ 2 . Then 2 xk ⊗ sk ∞ ≥ xk ⊗ sk (ξ ⊗ 1l), xk ⊗ sk (ξ ⊗ 1l) k
k
k
= xk (ξ) ⊗ ek , xk (ξ) ⊗ ek k
= x∗k xk (ξ), ξ; k
k
150
whence
Q. Xu
- ∗ .1/2 xk xk
∞
k
Similarly,
k
- .1/2 xk x∗k
∞
k
≤ xk ⊗ sk ∞ . ≤ xk ⊗ sk ∞ . k
Thus the lower estimate of (7.8) for p = ∞ follows. (7.8) for p = 1 and the complementation assertion are proved in the same way as the corresponding assertions of Theorem 7.8. The only difference is the fact that the linear span of the sk is no longer w*-dense in Γ0 . Instead, we have to use the family of polynomials in the sk which is w*-dense in Γ0 . This family is the linear span of all Wick products associated with the elementary tensors formed from the basis vectors ek . It then remains to note that these Wick products form an orthonormal basis of L2 (Γ0 ). We omit the details. Remark 7.10. The free Gaussian variables in the theorem above can be replaced by Bo˙zejko-Speicher’s q-Gaussians for −1 < q < 1 (see [BKS] and [BS]). This inequality remains also true for the case q = −1, for which the corresponding Gaussians become the so-called Fermions. Note that the case q = 1 corresponds to the classical Gaussian case. In strong contrast with the case −1 < q < 1, the analogue for q = ±1 of Theorem 7.9 fails for p = ∞. 7.6 Complete Unconditionality. Noncommutative Khintchine inequalities are closely related to complete unconditionality. Let M be a von Neumann algebra equipped with a normal faithful tracial state τ . Let (ak ) be a sequence in Lp (M ), 1 ≤ p ≤ ∞. Assume that the noncommutative Khintchine inequality holds for (ak ): for any finite sequence (xk ) in Sp xk ⊗ ak Lp (B( 2 )⊗M) ∼ (xk )CRp [Sp ] . ¯ k
It then follows that the subspace E generated by the ak in Lp (M ) is completely isomorphic to CRp (see Remark 7.6). Since the canonical basis of CRp is completely unconditional , so is the sequence (ak ). Namely, there exists a constant λ such that εk xk ⊗ ak p ≤ λ xk ⊗ ak p (7.9) k
k
for any finite sequence (xk ) ⊂ Sp and any εk = ±1. This property can be rephrased as follows. Given any sequence (ε ) of signs the map k k αk ak → ε α a on E is c.b. with cb-norm ≤ λ. Therefore, if the noncommutative k k k k Khintchine inequality holds for (ak ), then (ak ) is a completely unconditional basic sequence. The converse is also true with some additional mild conditions
Interactions between Quantum Probability and Operator Space Theory
151
for p < ∞. We consider here only the case 1 ≤ p < 2. The following result is proved independently by the author and Junge/Oikhberg [JO]. The latter paper contains more results of the same type. Theorem 7.11. Let M be a von Neumann algebra equipped with a normal faithful tracial state τ . Let 1 ≤ p < 2 and (ak )k≥1 ⊂ Lp (M ) be a completely unconditional basic sequence with constant λ. Assume that δ = inf ak p > 0
and
k
∆ = sup ak 2 < ∞. k
Then the noncommutative Khintchine inequality holds for (ak ) with relevant constants depending only on λ, δ and ∆. More precisely, for any finite sequence (xk ) ⊂ Sp c δλ−1 (xk )CRp [Sp ] ≤ xk ⊗ ak p ≤ ∆λ (xk )CRp [Sp ] , (7.10) k
where c is an absolute positive constant. Proof. Let (xk ) ⊂ Sp be a finite sequence. We then have (7.9). Averaging the left hand side of (7.9) over the εn and using the noncommutative Khintchine inequality in Theorem 7.5, we get - /- ∗ .1/2 .1/2 0 + ≤ cλ inf Yk Yk Zk Zk∗ xk ⊗ ak p , p p k
k
k
where the infimum runs over all decompositions xk ⊗ ak = Yk + Zk with Yk ¯ ). Fix such a decomposition xk ⊗ ak = Yk + Zk . Now and Zk in Lp (B(2 )⊗M choose bk ∈ Lp (M ) such that τ (ak bk ) = 1 and bk p = ak −1 p . Then def
xk = id⊗τ ((xk ⊗ak )(1⊗bk )) = id⊗τ (Yk (1⊗bk ))+id⊗τ (Zk (1⊗bk )) = yk +zk . ¯ Note that id ⊗ τ is the natural conditional expectation from B(2 )⊗M ¯ onto B(2 ) (B(2 ) being viewed as a von Neumann subalgebra of B(2 )⊗M via x ↔ x⊗ 1). Also note thatyk and zk belong to Sp . We need to majorize ( yk∗ yk )1/2 p (resp. ( zk zk∗ )1/2 p ) by ( Yk∗ Yk )1/2 p (resp. ∗ 1/2 ( Zk Zk ) p ). To this end, let (uk ) ⊂ Sp be such that ( k uk u∗k )1/2 p ≤ 1. By the H¨older inequality in Proposition 7.1 Tr(yk uk ) = Tr[id ⊗ τ (Yk (1 ⊗ bk ))uk ] = Tr ⊗ τ [Yk (uk ⊗ bk )] k
k
k
- .1/2 - ∗ .1/2 . ≤ uk u∗k ⊗ bk b∗k Yk Yk p p k
k
152
Q. Xu
We claim that - .1/2 uk u∗k ⊗ bk b∗k
p
- .1/2 . ≤ sup bk p uk u∗k p k
k
k
Indeed, this is obvious for p = 2 and p = ∞. Then complex interpolation yields the case 2 < p < ∞. Combining the preceding inequalities, we find - .1/2 - ∗ .1/2 Tr(yk uk ) ≤ sup bk p uk u∗k Yk Yk p p k
k
≤δ
-
−1
k .1/2 ∗ Yk Yk p
k
.
k
Thus taking the supremum over all (uk ), we get - ∗ .1/2 - ∗ .1/2 ≤ δ −1 . yk yk Yk Yk p p k
Similarly,
k
- - .1/2 .1/2 ≤ δ −1 . zk zk∗ Zk Zk∗ p p k
Therefore, we deduce (xk ) CR
k
p [Sp ]
≤ c δ −1 λ xk ⊗ ak p . k
To prove the upper estimate we use again the complete unconditionality of (ak ) and the noncommutative Khintchine inequality. Then we have xk ⊗ ak p ≤ λ k
inf
xk =yk +zk
/- ∗ .1 yk yk ⊗ a∗k ak 2
p
k
- .1 0 + zk zk∗ ⊗ ak a∗k 2 p . k
Now our task is to remove a∗k ak and ak a∗k from the terms on the right. To this ¯ onto B(2 ), end we use the natural conditional expectation E from B(2 )⊗M already mentioned earlier. E is determined by E(x ⊗ u) = τ (u)x ⊗ 1 ∼ τ (u)x for x ∈ B(2 ) and u ∈ M , i.e., E = id ⊗ τ . E is normal and faithful. As usual, ¯ ) for every 1 ≤ q < ∞. E extends to a contractive projection on Lq (B(2 )⊗M For our purpose here we need to consider the case q ≤ 1. We claim that if X ¯ ) ∩ L1 (B(2 )⊗M ¯ ) with q ≤ 1, then is a positive operator in Lq (B(2 )⊗M Xq ≤ E(X)q .
(7.11)
This is a consequence of the operator concavity of the map X → X q for 0 < q ≤ 1. Indeed, using Stinespring’s dilation theorem and Hansen’s
Interactions between Quantum Probability and Operator Space Theory
153
inequality [Ha], we deduce that (E(X))q ≥ E(X q ) for any positive X ∈ ¯ . This clearly implies (7.11). B(2 )⊗M Return back to our task. Using (7.11) with q = p/2 (recalling that 1 ≤ p < 2), we deduce that - ∗ .1/2 2 ∗ = yk yk ⊗ a∗k ak yk yk ⊗ a∗k ak p/2 p k
k
* ∗ + ≤ E yk yk ⊗ a∗k ak p/2 k
∗ = yk yk ⊗ τ (a∗k ak )1p/2 k
- ∗ .1/2 2 . ≤ sup ak 22 yk yk p k
k
Therefore, - ∗ - ∗ .1/2 .1/2 ≤ ∆ . yk yk ⊗ a∗k ak yk yk p p k
k
A similar inequality holds for another term involving the zk . It thus follows that xk ⊗ ak p ≤ ∆ λ (xk )CRp [Sp ] . k
This is the desired upper estimate, and so the proof of the theorem is complete. End of the proofs of Theorems 7.8 and 7.9. The λ(gk ) are unitary, so λ(gk )p = 1 for any 1 ≤ p ≤ ∞. On the other hand, for any sequence (εk ) of signs, there exists a unique representation π of V N (F) determined by π(λ(gk )) = εk λ(gk ). Moreover, π is trace preserving: τF ◦ π = τF . It follows that π extends to a complete isometry on Lp (V N (F)) for every 1 ≤ p ≤ ∞. Therefore, for any finite sequence (xk ) ⊂ Sp we have εk xk ⊗ λ(gk )p = xk ⊗ λ(gk )p . k
k
Thus the sequence (λ(gk )) is completely unconditional with constant 1. Then Theorem 7.11 implies (7.3) for 1 ≤ p < 2. The case p = 2 is trivial. The case 2 < p < ∞ is obtained by duality and using the complementation property in Theorem 7.11. The proof of Theorem 7.9 is similar. This time to get the representation π of Γ0 such that π(sk ) = εk sk , we have to use second quantization (see [VDN]). Remark 7.12. There exist many examples satisfying the assumption of Theorem 7.11. This is the case of a sequence of q-Gaussians mentioned
154
Q. Xu
in Remark 7.10. In particular, for q = −1, we get the noncommutative Khintchine inequality for a sequence of Fermions. 7.7 Generalized Circular Systems. Remind that we wish to embed OH into a noncommutative L1 -space by using a certain noncommutative Khintchine type inequality. Namely, we have to prove that OH is completely isomorphic to the closed subspace generated by a sequence of random variables in an L1 (M ) for a von Neumann algebra M . Such a sequence cannot satisfy the assumption of Theorem 7.11 for OH is not completely isomorphic to CR1 . In fact, Pisier [P5] showed that OH cannot completely embed into an L1 (M ) with M semifinite (i.e., of type I or II). This explains why we are forced to seek for Khintchine type inequalities for random variables in a non tracial probability space, i.e., the underlying von Neumann algebra is of type III. We give below only one example of this kind. Fix an infinite dimensional separable Hilbert space H as in subsection 7.5. Let {e±k }k≥1 be an orthonormal basis of H. We also fix a sequence {λk }k≥1 of positive numbers. Let gk = c(ek ) + λk a(e−k ). (gk )k≥1 is a generalized circular system in Shlyakhtenko’s sense [S]. Let Γ be the von Neumann algebra on the full Fock space F (H) generated by the gk . Let ρ be the vector state on Γ determined by the vacuum 1l. Then ρ is faithful on Γ . By the identification of L1 (Γ ) with the predual Γ∗ , ρ is a positive unit element of L1 (Γ ), so for any 1 ≤ p ≤ ∞, ρ1/p is a positive unit element of Lp (Γ ), and thus gk ρ1/p ∈ Lp (Γ ) for any k. Shlyakhtenko proved that the algebra Γ is a type IIIλ factor (0 < λ ≤ 1) if not all λk are equal to 1. Γ is not hyperfinite. Recall that Γ is the free analogue of the classical Araki-Woods quasi-free CAR factors. The latter factors are hyperfinite type IIIλ . The following is the noncommutative Khintchine type inequalities for generalized circular systems , proved in [PS] for p = ∞ and in [X2] for p < ∞. Theorem 7.13. Let (xn ) be a finite sequence in Sp , 1 ≤ p ≤ ∞. i) If p ≥ 2, 1 xk ⊗ g k ρ p L k
¯ ) p (B(2 )⊗Γ
- 1− p2 / - ∗ . 1 .1 0 ∼c max xk xk 2 p , λk xk x∗k 2 p . k
k
ii) If p < 2, 1 xk ⊗ g k ρ p L k
¯ ) p (B(2 )⊗Γ
- 1− p2 .1 0 / - ∗ . 1 ∼c inf yk yk 2 p + λk zk zk∗ 2 p , k
k
where the infimum runs over all decompositions xk = yk + zk in Sp .
Interactions between Quantum Probability and Operator Space Theory
155
iii) Let Gp be the closed subspace of Lp (Γ ) generated by {gk ρ1/p }k≥1 . Then Gp is completely complemented in Lp (Γ ) with constant 2. Proof. We prove only the cases p = ∞, 1 and the complementation assertion. The proof of i) for p = ∞ is the same as that of (7.4). Let us prove iii), which will imply ii) for p = 1 by duality. As in the semicircular case, consider the projection P from the algebra of polynomials on the gk onto the linear span of the gk . Let Q = I − P . It is easy to see that P (x) and Q(x) are orthogonal relative to both scalar products (a, b) → ρ(b∗ a) and (a, b) → ρ(ab∗ ). Now let x be a polynomial on the gk with coefficients in S∞ . Write x as ak ⊗ gk + idS∞ ⊗ Q(x). x = idS∞ ⊗ P (x) + idS∞ ⊗ Q(x) = k
Then using the argument yielding the first inequality of (7.4), we get - /- ∗ .1/2 . 0 ∗ 1/2 , max ≤ x∞ . ak ak λ a a k k k ∞ ∞ k
k
Therefore, using i) in the case p = ∞, we deduce that P is completely bounded. This implies, in turn, ii) for p = 1 by duality. Let us also note that P extends to a completely bounded normal projection on Γ . Indeed, by the density of {xρ : x polynomial on the gk } in L1 (Γ ), we find that ii) in the case p = 1 shows that P admits a pre-adjoint on L1 (Γ ) which is completely bounded. Finally, by interpolation we obtain iii) for 1 < p < ∞. Remark 7.14. In the spirit of Remark 7.6, Theorem 7.13 can be reformulated as a complete isomorphism between the subspace Gp and a weighted version of CRp . Given a sequence (µk ) of positive numbers we denote by C((µk )) the weighted 2 -space 2 ((µk )) equipped with the column Hilbert space structure. More generally, for any p ≥ 1 we define Cp ((µk )) to be the weighted version of Cp . Note that Cp ((µk )) is completely isometric to Cp and its operator space structure is determined as follows: for any finite sequence (xk ) ⊂ Sp xk ⊗ ek
Sp [Cp ((µk ))]
k
- .1/2 . = µk x∗k xk Sp k
Similarly, we define the weighted p-row space Rp ((µk )). Then Theorem 7.13 implies that Gp is completely isomorphic to Cp ∩ Rp ((µk )) for p ≥ 2 and to 1−2/p . Cp + Rp ((µk )) for p < 2, where µk = λk Remark 7.15. It is worth to note that the proof of the previous Khintchine inequalities in the free case (i.e., for free generators, semicircular systems and generalized circular systems) is relatively easy. The main obstruction in proving these inequalities in the case 1 < p < ∞ is the fact that one cannot proceed by interpolation. Indeed, it is a priori not clear why the spaces CRp [Sp ] form a (complex) interpolation scale. A posteriori this is a consequence of the Khintchine inequalities and the complete complementation in
156
Q. Xu
Theorem 7.8 or Theorem 7.9. This is how Pisier shows that the CRp [Sp ] form a complex interpolation scale (see [P2, Theorem 8.4.8]). In the same way, using Theorem 7.13