Introduction to Subfactors V. Jones & V. S. Sunder
CAMBRIDGE UNIVERSITY PRESS
London Mathematical Society Lecture Not...
193 downloads
1462 Views
3MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
Introduction to Subfactors V. Jones & V. S. Sunder
CAMBRIDGE UNIVERSITY PRESS
London Mathematical Society Lecture Note Series. 234
Introduction to Subfactors V. Jones University of California, Berkeley V.S. Sunder
Institute of Mathematical Sciences, Madras
CAMBRIDGE UNIVERSITY PRESS
PUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGE
The Pitt Building, Trumpington Street, Cambridge CB2 1RP, United Kingdom CAMBRIDGE UNIVERSITY PRESS
The Edinburgh Building, Cambridge, CB2 2RU, United Kingdom 40 West 20th Street, New York, NY 10011-4211, USA 10 Stamford Road, Oakleigh, Melbourne 3166, Australia
© V. Jones and V.S. Sunder 1997 This book is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press.
First published 1997 Printed in the United Kingdom at the University Press, Cambridge A catalogue record for this book is available from the British Library
ISBN 0 521 58420 5 paperback
Dedicated to
Our wives
Contents Preface Acknowledgement 1
ix xii
Factors
1
. von Neumann algebras and factors 1 . 4 The standard form Discrete crossed products . . . 7 . . 1.4 Examples of factors . . 10 1.4.1 Group von Neumann algebras . . 10 1.4.2 Crossed products of commutative von Neumann algebras 12 . . 17 1.4.3 Infinite tensor products
1.1 1.2 1.3
.
.
2
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
Subfactors and index 2.1 2.2 2.3
19
The classification of modules dimMN . . . . Subfactors and index . .
.
.
.
.
.
.
.
3 Some basic facts 3.1 3.2 3.3
33
The basic construction . Finite-dimensional inclusions The projections e, and the tower .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
. .
4 The principal and dual graphs .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
33 36 41
47
. More on bimodules The principal graphs . . . Bases . . 4.4 Relative commutants vs intertwiners
4.1 4.2 4.3
19 23 28
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
5 Commuting squares
47 50 54 59
65
The Pimsner-Popa inequality . Examples of commuting squares 5.2.1 The braid group example . . 5.2.2 Spin models . . . 5.2.3 Vertex models . 5.3 Basic construction in finite dimensions 5.1 5.2
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
65 70 70 71 71 72
CONTENTS
viii 5.4 5.5 5.6 5.7
. . Path algebras The biunitarity condition . Canonical commuting squares Ocneanu compactness . .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
6 Vertex and spin models .
.
.
80 89 92
101
Computing higher relative commutants . Some examples On permutation vertex models . . 6.4 A diagrammatic formulation 6.1 6.2 6.3
77
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
101 111 115
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
122
133
Appendix A.1 Concrete and abstract von Neumann . . . algebras A.2 Separable pre-duals, Tomita-Takesaki . . . . . theorem A.3 Simplicity of factors . .
.
.
.
.
.
.
.
.
.
.
.
. .
.
.
.
A.4 Subgroups and subfactors A.5 From subfactors to knots
Bibliography Bibliographical Remarks Index
.
.
.
. .
.
.
.
.
. .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
133
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
134 135 136
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
141
.
.
.
151 156 160
ix
Preface It must be stated at the outset that this little monograph has no pretensions to being a general all-purpose text in operator algebras. On the contrary, it is an attempt to introduce the potentially interested reader - be it a graduate student or a working mathematician who is not necessarily an operator algebraist - to a selection of topics in the theory of subfactors, this selection being influenced by the authors' tastes and personal viewpoints. For instance, we restrict ourselves to the theory of (usually hyperfinite) III factors and their subfactors (almost always of finite index); thus, factors of type III do
not make an appearance beyond the first (introductory) chapter, and the Tomita-Takesaki theorem makes only a cameo appearance in the appendix. It is hoped that such `simplifications' will help to make the material more accessible to the uninitiated reader. The aim of this book is to give an introduction to some of the beautiful ideas and results which have been developed, since the inception of the theory of subfactors, by such mathematicians as Adrian Ocneanu and Sorin Popa; an attempt has been made to keep the material as self-contained as possible; in fact, we feel it should be possible to use this monograph as the basis of a twosemester course to second year graduate students with a minimal background in Hilbert space theory. A remark is in order, as far as the references are concerned; when we state certain standard facts without proof, the reader is often referred to a text in operator algebras; if, in this process, it seems that the text by the second author is cited more often than other texts, that is simply because, a reference for that exact fact already being known to exist at that particular place, it was possible to avoid a search for that fact in other texts. We now give a brief outline of the contents of this volume for the sake of the possibly interested specialist. The first chapter begins with a quick introduction to some preliminary facts about von Neumann algebras (Murray-von Neumann classification of
factors and introduction to traces); this first section contains no proofs, but most of the sequel - with the notable exception of Popa's theorem on amenable subfactors - is self-contained modulo the unproved facts here. The
next section starts with the GNS construction and goes on to discuss the standard form of a finite von Neumann algebra and, in particular, identifies the commutant of the left-regular representation with the range of the rightregular representation. The chapter continues with a discussion of crossed products by countable groups and concludes with some examples - the left von Neumann algebra of an ICC group, factors of the three types coming from crossed products of commutative von Neumann algebras with countable groups acting ergodically and freely, a model of the hyperfinite factor which demonstrates that its fundamental group is the entire positive
x
line, and finally infinite tensor products and the definition of the hyperfinite factor. The second chapter starts with the classification of (separable) modules over a von Neumann algebra (with separable pre-dual), continues with the definition and some elementary properties of the M-dimension of a (separable) module over a III factor M, and concludes with the definition and some elementary properties of the index of a subfactor of a III factor, the statement of the result on restrictions on index values and a proof of the fact that all index values in the interval [4, oo) are possible. The third chapter begins with a section on the fundamental notion of the basic construction; the next section gathers together the basic facts about inclusions of finite-dimensional C*-algebras (including the fact about the basic construction and `reflection of Bratteli diagrams' as well as the notion of a Markov trace); the final section introduces the all-important sequence {e,,,}, derives the basic properties of this sequence, and indicates the relation between the theorem on restrictions of index values and the classification of non-negative integral matrices of norm less than 2, as well as an outline of the procedure originally adopted to prove the existence of hyperfinite subfactors
of index 4 cost n The fourth chapter is devoted to the principal (or standard) graph invariant of a subfactor. It starts with a discussion of ('bifinite') bimodules over a pair of III factors (contragredients and tensor products); the second section gives the two descriptions (in terms of the sequence of higher relative commutants as well as in terms of the bimodules that occur in the tower of the basic construction) of the principal graph of a subfactor, reduces the result on restriction of index values to the classification of non-negative integral matrices of small norm, and concludes with some examples of principal graphs; the chapter concludes with a discussion of `Pimsner-Popa bases' and a proof of why the higher relative commutants have an interpretation as intertwiners of bimodules.
The fifth chapter starts with Pimsner and Popa's minimax characterisation of the index of a subfactor, the consequent estimation of the index of a hyperfinite subfactor in terms of an approximating `ladder' of finitedimensional C*-algebras, and introduces the important notion of a commuting square; the second section discusses examples of commuting squares (vertex and spin models, and the braid-group example); the next section is devoted to the relation between commuting squares and the basic construction, and the consequent importance of symmetric or non-degenerate commuting squares (with respect to the Markov trace); the next two sections are devoted to the path-algebra model for a tower of finite-dimensional C*-algebras, and the reformulation of the commuting square condition in terms of `biunitarity', respectively; the sixth section is a discussion (without proofs) of the canonical commuting square associated to a subfactor and Popa's theorem on the completeness of this invariant; the final section of this chapter centres around
xi
Ocneanu's compactness theorem and the prescription it provides for comput-
ing the higher relative commutants of a subfactor built from an arbitrary initial commuting square.
The sixth and final chapter is devoted to the rich class of examples of subfactors provided by the so-called vertex and spin models. This chapter systematically develops a diagrammatic formulation to discuss the higher relative commutants in these examples, and also shows how to push this diagrammatic formulation through for general commuting squares. The book concludes with an appendix, which contains some facts used in the text - such as the non-existence of two-sided (algebraic) ideals in finite factors - as well as a computation of the principal and dual graphs of the `subgroup-subfactor' and the original derivation of the one-variable polynomial invariant of knots. Finally, the book comes equipped with such customary trappings as a bibliography, some remarks of a bibliographic nature, and one index containing both terms and symbols used.
xii
Acknowledgement These notes have a two-part genesis. To start with, the first author gave a series of about seven lectures at the centres of the Indian Statistical Institute at New Delhi and Bangalore during the winter of '92-'93; these lectures were `panoramic' in nature and did not contain too many proofs (because of the obvious time constraints). Later, the second author visited the Research Institute of Mathematical Sciences at Kyoto for nine months during '94-'95, during which period he gave a course of about 25 lectures - which was an expanded version of the earlier abridged version, and which contained proofs of most assertions and was addressed to the graduate students in the audience. These notes were the by-product of those two courses of lectures. The first (resp., second) author would like to express his gratitude to Professors Kalyan Sinha and V. Radhakrishnan, the Indian Statistical Institute, the Raman Research Institute and the National Board for Higher Mathematics in India (resp., Professor Huzihiro Araki and the Research Institute of Mathematical Sciences, Kyoto University) for the hospitality and the roles they played in making these visits possible.
Chapter 1 Factors 1.1
von Neumann algebras and factors
The fundamental notion is that of a von Neumann algebra. This is, typically, what may be called the `symmetries of a group'. The precise way of saying
this is that a (concrete) von Neumann algebra is nothing but a set of the form M = ir(G)' - where 7 is a unitary representation of a group G on a Hilbert space 7-L, and S' denotes, for S a subset of L(7-l) (the algebra of all bounded operators on 7-l), the commutant of S defined by S' = {x' E L(R) : x'x = xx' for all x in S}. In other words M is the set of intertwiners of the representation ir: thus, x E M 4 xir(g) = ir(g)x for all g in G. The usual definition of a von Neumann algebra is: `a self-adjoint subalgebra of L(7-l) satisfying M = M"' (where we write M" for (M')'). This is equivalent to the definition we have chosen to give. Reason: if M = 7r(G)',
then M is a self-adjoint subalgebra and M = M", since S' = S"' for all S C L(7-l); conversely, if M = M" is a self-adjoint subalgebra, we may set G equal to the unitary group of M' and appeal to the almost obvious fact (cf. [Sunl], Lemma 0.4.7) that G linearly spans M' (so that G' = (M')'). The canonical commutative examples of abstract von Neumann algebras turn out to be L°°(X, µ), while the basic non-commutative example is L(7-l). The fundamental `double commutant theorem' of von Neumann states that a self-adjoint unital subalgebra M of L(7-l) is weakly closed - i.e. (x, rl) y E 7-l, x" E M Vn x c M) (if and only if M is a-weakly closed - see §A.1) if and only if M = M". The importance of the notion of a von Neumann algebra was recognised in 1936 by Murray and von Neumann (although of course, they called them `rings of operators') - see [MvNI] - who also quickly realised that the `building blocks' in the theory of von Neumann algebras were (what they, and people after them, called) factors. If M = 7r(G)', then M is a factor precisely when the representation is `isotypical'. (If G is compact and it is a strongly continous representation, this says that it is a multiple of an irreducible representation;
CHAPTER 1. FACTORS
2
for general G, this says that any two non-zero subrepresentations of 7r admit non-zero subrepresentations which are equivalent.) More precisely, a von Neumann algebra M is called a factor if it has trivial
centre - i.e., Z(M) = M fl M' = Cl; and von Neumann proved - see [vN3] - that any von Neumann algebra is `a direct integral of factors'. Projections play a major role in the theory. It is true that any von Neumann algebra is the norm-closed linear span of its projections - i.e., elements p satisfying p = p* = p2. (Reason: if M = L°°(X, µ), .this is because simple functions - i.e., finite linear combinations of characteristic functions of sets - are dense in L°°(X, µ). The preceding statement and the spectral theorem show that any bounded normal operator is norm-approximable by finite linear combinations of its spectral projections. This proves the assertion about general von Neumann algebras.)
Two projections e and f in a von Neumann algebra M are said to be Murray-von Neumann equivalent - written e - f (or e - f (rel M)) - if there exists (a partial isometry) u in M such that u*u = e and uu* = f. It is not too hard to show that if (and only if) M is a factor, any two projections in M are comparable in the sense that one is Murray-von Neumann equivalent to a sub-projection of the other.
Factors were initially classified into three broad types by Murray and von Neumann, on the basis of the structure of the lattice P(M) of projections in M. The key notion they use is that of a finite projection; say that a projection e E P(M) is finite if e is not equivalent to any proper subprojection of e. It should be obvious that a minimal projection of M, should one exist, is necessarily finite. It should also be equally clear that any factor is one and exactly one of the types I-III as defined below. DEFINITION 1.1.1 (a) A factor M is said to be of type:
(i) I, if there exists a non-zero minimal projection in M;
(ii) II, if M contains non-zero finite projections and if M is not of type I; and
(iii) III, if no non-zero projection in M is finite.
(b) A factor M is said to be finite if 1 (the multiplicative identity of M, which always exists - cf. the definition of a concrete von Neumann algebra) is a finite projection in M; equivalently M is finite if M does not contain any non-unitary isometry.
One of the basics facts about finite factors is contained in the following result; for a proof, see, for instance [Takl], Theorem V.2.6. PROPOSITION 1.1.2 If M is a finite factor, then there always exists a unique faithful normal tracial state (henceforth abbreviated simply to `trace) on M;
1.1. VON NEUMANN ALGEBRAS AND FACTORS
3
i.e., there exists a unique linear functional T on M such that: (i) (trace) T(xy) = T(yx); (ii) (state) T(x*x) > 0 and T(1) = 1; (iii) (faithful) T(x*x) 0 0 if x zA 0; and (iv) (normal) T is (a-)weakly continuous. Further, if e, f E P(M), then e - f G T(e) = T(f).
(1.1.1)
We conclude this section with the rudiments of this Murray-von Neumann classification of factors. Suppose then that M is a factor with separable predual. Then consider the above-mentioned three possibilities for the type of M:
(I) If M is a factor of type I, it turns out (and it is not hard to prove cf. [Sunl], Exercise 4.3.1, for instance) that M = .C(7) for some separable Hilbert space 7-l and that M is finite precisely when 7-l is finite-dimensional. In particular, any finite factor of type I is necessarily finite-dimensional. We say that the type I factor M is of type I,,, if 7-l is an n-dimensional Hilbert space, for n = 1, 2, , oo. If M is of type I,,,, 1 < n < oo, then M ^ M,,, (C) and the unique trace tr of Proposition 1.1.2 is just the usual matrix-trace after suitable normalisation: thus, tr((xzj)) = _I E 1 xii (II) If M is a factor of type II, there are two possibilities, according to whether or not M is a finite factor in the sense of Definition 1.1.1(b). We say
that a type II factor M is of type Ill or of type III according to whether or not M is a finite factor. Recall, from Proposition 1.1.2 that every II1 factor is equipped with a faithful normal tracial state T. It is true - for instance, see [Sunl], Propo-
sition 1.3.14 - that if M is a Ill factor, then {T(p) : p E P(M)} = [0, 1]. Thus the trace T induces a bijection between the collection of Murray-von Neumann equivalence classes of projections in a II1 factor and the continuum [0,1]. What attracted von Neumann to II1 factors was the possibility of `continuously varying dimensions'. On the other hand, suppose M is a III factor. Fix an arbitrary finite proj ection p1 E M. It is true, then, that there exists - see, for instance, [Sunl] - a sequence {p,,, 1 < n < oo} of mutually orthogonal projections in M such that (i) pn - p1(rel M)Vn, and (ii) En pn = 1. Pick a partial isometry un E M such that u*nun = pn, unun = p1. (We briefly digress to remark that it is true - see [Taki], for instance - that if M is a von Neumann algebra, and if p E P(M), :
then the so-called `corner' of M defined by Mp = pMp = {pxp : x E M} is again a von Neumann algebra.) It then follows easily that Mp, is a II factor, and that the mapping x ((u?xuj )) establishes an isomorphism of M onto Mp, ®C(B2). Now consider the map Tr : M+(= {x E M : x > 0}) -> [0, co] defined by Tr x = En trM(unxu*n). It is true of this map - see [vNI] - that
(1) {Trp: pEP(M)}=[0,00];
CHAPTER 1. FACTORS
4
(ii) if p, q E P(M), then p - q(rel M) t-. Tr p = Tr q; and
(iii) if p, q E P(M), and pq = 0, then Tr (p + q) = Tr p + Tr q. Notice that this choice of Tr is so `normalised' that it takes the value 1 at pi; it is true that but for this possible choice in scaling, the function Tr is uniquely determined by the above properties. This function Tr is referred to as the faithful normal semifinite trace on the III factor. (III) The factor M is of type III precisely when every non-zero projection is infinite; under our standing assumption on the separability of the pre-dual
of M, it turns out - cf. [Sunl], Corollary 1.2.4(b) - that any two infinite projections are equivalent. Thus M is a type III factor precisely when any non-zero projection is Murray-von Neumann equivalent to the identity 1.
1.2
The standard form
Suppose cp is a normal state on a von Neumann algebra M - i.e., cp is a linear functional on M which is:
(i) positive - i.e., cp(x*x) > 0;
(ii) a state - cp(1) = 1; (iii) normal - i.e., cp is
continuous.
Consider the sesquilinear form on M defined by (x, y) -4 (x, y) = cp(y*x). This satisfies all the requirements of an inner product except positive definiteness - i.e., the set N,o = {x E M : cp(x*x) = 0} may be non-trivial. It is, in any case, a consequence of the Cauchy-Schwarz inequality that N,p is a descends to a genuine inner product on left-ideal of M. Hence the form the quotient space MIN,,; further, the equation 7r (x) (y + N,p) = xy + N,p defines, not just a well-defined, but even a bounded - with respect to the norm Jjy+NwjI2 = cp(y*y)1/2 - linear operator 7r(x) on MIN,,, which hence extends to the completion 7-l.. It is painless to verify that if 7r,(x) denotes the extension to R. of 7r(x), then 7r, defines a normal representation of M on 7-1,x. Further, if ,p = 1+No, then ,o is a cyclic vector for 7ro, i.e., ii
(where [S] denotes the closed subspace spanned by a subset S of Hilbert space), and the given state cp is recovered from the triple (7-l,w, 7r., .) by (p (x) =
x E M.
We summarise the foregoing construction - called the GNS construction after Gelfand, Naimark and Segal - in the following: PROPOSITION 1.2.1 Let cp be a normal state on a von Neumann algebra M. Then there exists a triple (7-l, 7r, ) consisting of a Hilbert space 7L carrying a normal representation it of M, and a distinguished cyclic vector of the representation satisfying V(x) = for all x in M.
1.2. THE STANDARD FORM
5
Notice, incidentally, that if the state co is faithful (meaning y(x*x)
0 if x
0), so is the representation 7r.
EXAMPLE 1.2.2 If M = L°°(X, µ), a typical normal state on M is of the form f f dv, f E L°°(X, p) - where v is a probability measure on X which is absolutely continuous with respect to p. One GNS triple associated to is given by 7-1, = L2(X, v), ir,(f ) = f l;, and is the constant function 1.
It must be clear that a necessary and sufficient condition for a normal representation it of M to occur as a GNS representation (i.e., to be unitarily equivalent to one) is that the representation 7r be a cyclic representation. An easy application of Zorn's lemma shows now that every (separable) normal representation of a von Neumann algebra is a (countable) direct sum of GNS representations.
In the rest of this section, we consider the special case when M admits a faithful normal tracial state, and analyse the GNS construction. Assume thus that there exists a faithful normal tracial state r on M. We write L2(M, 'r) for the Hilbert space underlying the GNS representation
associated with T. This representation is faithful, since ir(x) = 0 = 0 = r(x*x) = x = 0. Hence we may - and do - identify x with ir,(x) and we assume that M C_ G(L2(M, r)) so that there exists a cyclic vector SZ (which is the notation we shall employ for what we earlier called c,-) such
that T(x) = (xe, 0) for all x E M. Besides being a cyclic vector for M, the vector S2 is also separating for M in the sense that x1 = 0(= T(x*x) = IIXQ112 = 0) = x = 0. Hence the Hilbert space L2 (M, T) contains a vector SZ which is simultaneously cyclic and separating for M. We need the fact - which is ensured by the next lemma - that S2 is also a cyclic and separating vector for M'.
LEMMA 1.2.3 If M C G(7i) is a von Neumann algebra, a vector cyclic for M if and only if is separating for M'. Proof : Let
in 7i is
E H. Let p' be the projection onto [Mf], the closed M-cyclic
subspace spanned by . Note that p' E M' and that (1 - p')l; = 0. So, if is separating for M', then p' = 1 so is cyclic for M. Conversely if l; is cyclic for M, then x' E M' and x'l; = 0 = x'rl = 0 for all rl in [Me], since x in M. Thus L2 (M, T) has the vector S2 which is cyclic and separating for M as well as for M'. For any vector in L2, consider the two operators defined by:
fre( )(x'SZ) = x'
x
Vx' E M', b'x E M.
(1.2.1) (1.2.2)
CHAPTER 1. FACTORS
6
M'12 (and dom Me); these operators are Thus, dom densely and unambiguously defined since 12 is a cyclic and separating vector
for M and for M'. Call a vector left-bounded (respectively right-bounded) if the operator ire() (resp., extends to a (necessarily unique) bounded operator on all of 7-l (or equivalently, is bounded on its dense domain of definition). If is left- (resp. right-) bounded, we shall continue to write 7re(6 (resp. 7rr(6)) for the unique continuous extension to all of L2(M,T). In order to state the fundamental proposition concerning L2 (M, T) - or the standard form of the finite von Neumann algebra M, as it is referred to - we need one last bit of notation: the map x12 H x*S2 is a conjugate-linear isometry from M12 C L2 (M, T) onto itself. Denote its extension to L2 (M, T)
by J. It must be clear that J is an anti-unitary involution - i.e., J is a conjugate linear isometry of L2 (M, T) onto itself whose square is the identity;
in particular J = J* = J-1. This operator J is referred to as the modular conjugation operator for M, and sometimes denoted by JM.
THEOREM 1.2.4 (1) JMJ = M. (2) The following conditions on a vector E L2(M, T) are equivalent: (i) 6 is left-bounded; (i)' = x12 for some (uniquely determined) element x of M; (ii) 6 is right-bounded; (ii)' = x'12 for some (uniquely determined) element x' of M'.
Proof: (1) The definition of J shows that if x, y E M, then (Jx*J)(y12) _ yx12; since `left multiplications commute with right multiplications', we find
that
JMJ C M'.
(1.2.3)
On the other hand, if x E M, x' E M', then by the `self-adjointness' of the anti-unitary operator J, we have (Jx 12, x12) = (Jx12, x'12)
= (x*Q, x'Q) = (12, xx'1l) = (12, x'x1l) = (x'*12, x12). Since x was arbitrary, this implies that Jx'12 = x'*12, Vx E M'.
(1.2.4)
The above equation, together with the same reasoning that led to (1.2.3), now shows that
JM'J C M, and the equality in (1) follows from equations (1.2.3) and (1.2.5).
(1.2.5)
1.3. DISCRETE CROSSED PRODUCTS
7
(2) Denote the set of left- (resp., right-) bounded vectors in L2 (M, T) by Lie
(resp., Ur); it is clear from the definitions that E Lie $ ire(e) E (M')' = M and = conversely, if x e M, then xSl E Lie and x = irl(xS2). Thus the map H ireO establishes a bijective linear map of Lie onto M, with inverse being given by x -> xQ. In an identical manner, we also have Ur = M'Q. Thus (i) (i)' and (ii) (ii)'. To complete the proof, we only need to prove that MSl = M'Q. If x E M, then XQ = Jx* JSl E OR hence showing that MSZ C M'fl. An identical reasoning, with the roles of M and M' reversed, proves the reverse inclusion, and hence the theorem.
1.3
Discrete crossed products
The two constructions used initially by Murray and von Neumann - see [vNl] and [vN2] - to construct examples of factors of all possible types were (i) the crossed product construction, and (ii) the infinite tensor product construction. This section is devoted to a discussion of the former, while the latter will be discussed at the end of this chapter. The starting data is a (discrete) group G acting on a von Neumann algebra M - i.e., suppose we are given a group homomorphism t i--> at from G to the
group Aut(M) of (normal) *-automorphisms of M. (It is a fact (cf. [Sunl], Exercise 2.3.4(a)) that all *-algebra automorphisms of a von Neumann algebra
are automatically normal.) The crossed product is a sort of maximal von Neumann algebra containing copies of M and G with `commutation relations governed by the given action of G on M'; a little more precisely, the crossed product of M by the action a of G is a specific von Neumann algebra of the form M = (ir(M) U A(G))" where it : M -> M (resp., .\ : G - U(M), the unitary group of M) is an injective normal *-homomorphism (resp., injective unitary representation) of M (resp., of G), such that the copies -7r(M) and )(G) of M and G satisfy the commutation relations A(t)-7r(x)A(t)* = 7r(at(x)), for all x E M,t E G.
(1.3.1)
The construction of the crossed product (which is usually denoted by M xa G, or simply M x G ) goes as follows: Suppose M C L(7-i). The Hilbert space 7-l on which M will be represented has three (unitarily equivalent) descriptions:
(i) tEG[
[
(ii) 7i = ®x = {((S(t)))tEG : E IIS(t)II2 < Do} tEG
tEG
CHAPTER 1. FACTORS
8
where we think of a typical element of 7i as a column-vector with normsquare-summable entries from R; although this seems an artificial variant of (i), it is this description, in view of the availability of the convenience of matrix manipulations, which will prove most useful for dealing with M x c, G; (iii) 7-l = 7-l ® £2(G), the Hilbert space tensor product of 7i and the Hilbert
space £2(G) of square-summable complex functions on G (or £2(G; C) in
the notation of (i)). Before proceeding further, let us remark that £2(G) carries two natural - the so-called left-regular and right-regular - unitary representations .\, p : G --> 6(u-lt) and (pu6)(t) = 6(tu). AlternaU(G(f2(G))), defined by tively, if {6t t c G} denotes the canonical (or distinguished) orthonormal basis of £2(G) - thus t is the characteristic function of the singleton set {t} - then ),u(6t) = Sut and pu(t) = Stu-1. It is a basic fact - see §1.4 - that :
A(G)' = (p(G))", p(G)' =
A(G)".
To return to the definition of the crossed product, define 7r £ (7-l)
and
(1.3.2)
:M-
A :G-L(R) by:
(iv(x))(t) = at-1WO),
(1 3 3) .
(A(u))(t) =
(u
t).
.
J
It is trivial to verify that -7r : M ---> L (7-l) (resp. A : G --> £(77f)) is a faithful
normal *-homomorphism (resp., faithful unitary representation) and that it and A satisfy equation (1.2.1). Now define M = (ir(M) U ),(G))", so that M is the smallest von Neumann subalgebra of L(R) containing 7r(M) and A(G). This M is, by definition, the crossed product M x a G. We used some realisation of M as a concrete von Neumann algebra to define the crossed product M xc, G. It is true, however - cf., for instance, [Sunl], Proposition 4.4.4 - that the isomorphism class of the von Neumann algebra M x aG so constructed does not depend upon which faithful realisation
M on Hilbert space one started with. We shall now pass to a closer analysis of M, by using the second picture of 7-l as ®tEG 7-1. In this form, it is clear that any bounded operator x E L (?-1) t))),S,tEG where fi(s, t) E G(H) for all is represented by a matrix x =
s, t E G, and
(s) =
x(s,
the sum on the right being intepreted
tEG
as the norm limit of the net of finite sums. In this language, it is clear that (ir(x))(s,t) = 8stat-1(x)
and
(\(u))(s,t) = 6s,ut
for x in M, u, s, t in G.
1.3. DISCRETE CROSSED PRODUCTS
9
The point is that while elements of MatG(C) have two degrees of freedom, the above generators of the crossed product have only one degree of freedom. More precisely, we have the following matricial description of the crossed product (where we identify an element x E C(111) with its matrix ((x(s, t))) (with respect to the orthonormal basis {fit : t e G})).
LEMMA 1.3.1 With the preceding notation, we have t) = at-i (x(st-1)) Vs, t E G}. M = {x E G(?{) : 3x : G -F M s.t.
Proof: On the one hand, the right side is seen, quite easily, to define a (weakly closed self-adjoint algebra of operators and hence a) von Neumann subalgebra of G(?-l), while on the other, the algebra generated by ir(M) U .(G) is seen to be the dense subalgebra, corresponding to finitely supported functions, of the one given by the right side. It follows from Lemma 1.3.1 that the crossed product Mx,G is identifiable
- via the association x H x(s) = x(s, 1) - with a space of functions from G to M - viz. M = {x : G - MI3JE E G(?-l) s.t. x(s, t) = at-,(x(st-1)) Vs, t E G}. (1.3.4)
It is a matter of easy verification to check that the algebra structure inherited from (7r(M) U A(G))" by the set M defined by equation (1.3.4) is:
(x * y)(s) = E at-1(x(st 1))y(t), tEG
(1.3.5)
x*(s) = as-i(x(s-1)*). (The series above is interpreted as the limit, in the weak topology, of the net of finite sums; this converges by the nature of matrix multiplication.) In the new notation, note that 7r (x) (s) = 6s1 x, x E M, and
A(u)(s)=6su 1,uEG. We conclude this section by determining when the crossed product is a finite von Neumann algebra - i.e., admits a faithful normal tracial state. PROPOSITION 1.3.2 Let M = M xa G be as above (cf. the discussion preceding equation (1.3.5)). Then M admits a faithful normal tracial state 'r if and only if M admits a faithful normal tracial G-invariant state T (where G-invariance means T o at = T Vt E G).
CHAPTER 1. FACTORS
10
Proof: If T is a faithful normal tracial state on M, then T(x) = T(ir(x)) defines a faithful normal tracial state on M which is G-invariant since T(at(x)) _ T(7r(at(x))) = T(A(t)7(x)A(t)-i) = T(1r(x)) = T(x). Conversely, if T is a G-invariant faithful normal tracial state, define "F(x)
T(x(1)) (= r(fl(I,1))). Then T is clearly a normal positive linear function; further, T is faithful (since x E M+ and T(T (1, 1)) = 0 implies T(1,1) = 0, whence x(t, t) = at-, (x(1,1)) = 0 for all tin G, whence T, 0 (since a positive operator with zero diagonal is zero)). Finally, T is a trace, since T(x * y) = T((x * y)(1)) T (F_
at-1 (x(t i))y(t))
tEG
_ E T(at-1(x(t 1))y(t)) tEG
(since T is normal) _
E T(x(t-i)at(y(t))) tEG
(since T is G-invariant)
ET(at(y(t))x(t i)) tEG
(since T is a trace)
_
T(as-1(y(s i))x(s)) sEG
= T(y * x).
Before discussing when the crossed product is a factor, we digress for some examples, one of which will motivate the definitions of the necessary concepts.
1.4 1.4.1
Examples of factors Group von Neumann algebras
In the notation of §1.2, the (left) group von Neumann algebra LG of the discrete group G is defined thus:
LG = C x G = A(G)" c £(Q2(G)),
where the crossed product is with respect to the trivial action - at(z) _ z, Vt E G, z E C - of G on C, and, of course, A denotes the left-regular representation of G on £2(G). The analysis of §1.2 translates, in this most trivial case of a crossed prod-
uct, as follows: the elements of LG are those T E G(t2(G)) whose matrix, with respect to the standard orthonormal basis {fit t E G} of £2(G), has :
1.4. EXAMPLES OF FACTORS
11
the form 2(s, t) = x(st-1) V's, t E G for some function x : G -> C. Note that E x(t, so that the function x : G ---> C is nothing but Thus there exists a unique function g : LG -> £2(G) - defined by
such
that , (s,t) = 77(x)(st-1) Vs,t in G. Some of the main features of the von Neumann algebra LG are contained in the next proposition. PROPOSITION 1.4.1 (1) LG is a finite von Neumann algebra; more precisely, defines a faithful normal tracial state on LG; the equation T(x) = (2) (p2(G), idLG, 1) is a GNS triple for the trace T of (1) above, where idLG is the identity representation of LG in f2 (G))- hence LG, realised as operators on £2(G), is in standard form in the sense of §1.2; in particular, A(G)' = p(G)", p(G)' = A(G)".
(1.4.1)
(3) The following conditions on G are equivalent:
(i) LG is a factor;
(ii) G is an ICC group' - i.e., every non-trivial conjugacy class C(t) _ {sts-1 : s E G}, for t 0 1, is infinite. In particular, if G is an ICC group, then LG is a II, factor. Proof : (1) The equation T(A) = A, A E C, is clearly a trace on (M =) C
which is invariant under the trivial action of G and C. Hence (the proof of) Proposition 1.3.2 implies that the equation T(om) _ (1 1) = rl(x)(1) _ (ij,, 1) defines a faithful normal tracial state on LG. t E G}] = £2(G) and so 1 is a cyclic vector (2) D [{fit = for LG such that T(om) _ (xl, 1) Vi E LG. This proves the first assertion in (2).
As for the second, note that the canonical conjugation J is the unique anti-unitary operator in f2(G) such that Jet = t-1 for all t E G, and that
JA Jet = JAs t-i = StS-1
pst Deduce now from Theorem 1.2.4(2) that
A(G)' = A(G)"' = (LG)' = J(LG)J = JA(G)"J = (JA(G)J)" = p(G)". (1.4.2)
Thus A(G)" and p(G)" are commutants of one another, thus proving (2). x 1. An easy computation (3) As before, write g : LG -* £2(G) for shows that Ic E Z(M) if and only if r7(x) is constant on conjugacy classes.
CHAPTER 1. FACTORS
12
Suppose now that G is an ICC group. Then the conditions that constant on conjugacy classes and that 77 (x) E £2(G) force
is
0 for t
i.e., x = (97((1)) idp2(G). Thus Z(LG) = C and LG is a factor. Conversely suppose G is not an ICC group so that there exists a finite conjugacy class 10 C C G; then if 9 = 1c denotes the characteristic function of the finite set C, it follows that n Q2 (G) and that the matrix defined by x(s, t) = lc(st 1) defines a bounded operator on £2(G), so that x E LG and 1
97(x) = 77. The earlier discussion shows that E Z(LG) (since 77 is constant on conjugacy classes) while x V C, since 97 V C 1i thus LG has non-trivial
centre and is not a factor. Finally, if G is an ICC group, then LG is a finite factor by (1) and (2)
of this proposition; the fact that G is an infinite group shows that LG is an infinite-dimensional vector space over C and hence not a type I factor (since finite type I factors are (isomorphic to some M,,,(c) and hence) of finite dimension over C).
Examples of ICC groups are given by: 00
(i) So,, = U S, = the group of those permutations of 1,2,3,... which fix all n=1
but finitely many integers;
(ii) F,, (n > 1), the free group on n generators. Hence LSD and LF., n > 1, are (our first examples of) IIl factors.
1.4.2
Crossed products of commutative von Neumann algebras
Let M = L°°(Sl, .F, µ), where (S2, Jc', µ) is a separable probability space. (The assumption of separability is equivalent to the requirement that L2 (S2, .F, µ) is separable. Also, it is true - see [Takl], for instance - that such an M is the most general example of a commutative von Neumann algebra with separable pre-dual.) By an automorphism of the measure space (S2, .F, µ), we shall mean a bimeasurable bijection T of S2 such that ,u o T-1 and p have the same null sets. (Thus, T : S2 -> S2 is a bijection satisfying: (i) if E is a subset of S2, then
E E F t* T-1(E) E .F; and (ii) if E E F, then µ(E) = 0
µ(T-1(E)) = 0.
Such a map T is also called a non-singular transformation in the literature.) The reason for the above terminology is that the most general automorphism of M is of the form 9(W) = co o T, Vco E L°°(S2, J , /11), for some automorphism
T of (c,.F,µ). If M, 0, T are as above, it is not hard to prove - cf. [Sunl], Exercise 4.1.12 - that the following conditions are equivalent: (i) T acts `freely' on S2 - i.e., µ({w E S2 : Tw = w}) = 0;
(ii)zEM,xy=0(y)xdyEM=x=0.
1.4. EXAMPLES OF FACTORS
13
This is the justification for the following general definition.
DEFINITION 1.4.2 (1) An automorphism 0 of an abstract von Neumann algebra M is said to be free if x E M, xy = 0(y)x Vy E M = x = 0.
(2) An action a of a group G on M - i.e., a group homormorphism a G -> Aut(M) - is said to be free if the automorphism at is free (in the sense of (1) above) for every t 0 1 in G. We need one more definition before we proceed further:
DEFINITION 1.4.3 (1) If a : G -> Aut(M) is an action of a group on any von Neumann algebra, write M' = {x E M : at(x) = x Vt E G} for the fixed-point subalgebra of the action.
(2) The action a : G -+ Aut(M) is said to be ergodic if M' With the notation of Definition 1.4.3, it must be clear that M' is always a von Neumann subalgebra of M. Since any von Neumann algebra is generated, as a von Neumann algebra, by its lattice of projections, it must be clear that the action a is ergodic if and only if P(Ma) = 10, 11.
In the special case when M = L°° (1, .F, µ), it must be clear from the foregoing discussion that any action a : G -+ Aut(M) must be of the form at(co) = cp o T,7', where t -# Tt is a group homomorphism from G into the group of automorphisms of the probability space (S2, F, /L); and that the action
a is ergodic if and only if
E E F, µ(EOTt 1(E)) = 0 Vt E G
µ(E) = 0 or µ(E°) = 0
(1.4.3)
where A denotes symmetric difference (so that AAB = (A - B) U (B - A)) and E° denotes the complement of the set E. (This is the classical notion of ergodicity and the reason for Definition 1.4.3(2).) It would have been more natural to include the next proposition - which concerns general von Neumann algebras - in the last section, but it has been included here since the notions of freeness and ergodicity of an action are most natural in the context of the abelian examples considered in this section.
I
PROPOSITION 1.4.4 Let a : G -> Aut(M) be an action of a discrete group G on any von Neumann algebra M. Let M = M xa G. Then: (i) ir(M)' n M = ir(Z(M)) 4* the action a is free; (ii) Assume the action a is free; then the crossed product k is a factor if and only if the restricted action alz(M) is ergodic. (Here, we use the notation aIM0 to mean the restricted action - (alM0)t(xo) = at(xo) for all xo E Mo of G on any von Neumann subalgebra Mo of M which is invariant under the action a.) In particular, if a is a free action of a discrete group G on L°°(S2, then the crossed product is a factor if and only if the action a is ergodic.
CHAPTER 1. FACTORS
14
Proof: As before, if i E M, we write so that x(s, t) =at-, (x(st-1)). In view of equation (1.3.5), it is easily seen that the condition E 'ir(M)' n M translates into the condition that
x(t)y = at-1 (y)x(t) Vy E M, t E G.
(1.4.4)
Hence, if the action is assumed to be free, then x'7' E7r(M)'nM
x(t)=Obtl ir(x(1)) E 7r(M).
Since the map yr : M --- M is injective, we see that indeed i E ir(M)' n M = 7r(z) for some z(= x(1)) E Z(M).
Conversely, if the action is not free, there exist t 1 in G and xo E M 0 and x0y = at(y)x0 for all y c M. If we now define the such that x0 function x : G - M by x(s) = 6st-1 xo, it is clear that the equation ; (s, u) = a.,n-i (x(su-1)) defines a bounded operator 1 on ?-l; further, it must be equally
clear that Jr E Rr(M)' n M and that 1 V 7r(M) (since ((x(s, u))) is not a diagonal matrix). (ii) Assume the action a is free. It then follows from (i) above that
Z(M) = ir(Z(M)) n )(G)' = {7r(z) : z E Z(M) and z = at(z) dt E G}, whence the desired conclusion.
Thus if a countable group G acts freely and ergodically on M = L°°(S2,
.F, µ), then M = M x G is a factor. The complete details of the Murrayvon Neumann type of the factor thus obtained are contained in the following beautiful theorem due to von Neumann ([vNl]).
THEOREM 1.4.5 Let M = M xa G be as above. (Thus, M = L°°(S2, .F, lc), where li) is a separable probability space, and G is assumed to act freely and ergodically on M via the equations at(p) = cp o Tt 1, where {Tt : t E G} is a group of automorphisms of the measure space (1, ,F, p).) (1) M is of type I if and only if p) contains atoms - i.e., ]E E .F
such that µ(E) > 0 and whenever Eo E F, E0 C_ E, either p(Eo) = 0 or µ(E - Eo) = 0. In this case, there exists a countable partition S2 = 11iEA E2, where each E2 is an atom; further, M is of type In,,1 < n < oo, if and only if IAI = n.
(2) M is of type II if and only if there exists a a-finite measure v on (Q, .F) such that (i) v is non-atomic - i.e v has no atoms, (ii) v and ,i have
the same null sets, and (iii) v is G-invariant - i.e., v o Tt1 = v Vt E G. Further, M is of type IIl or III according as v(S2) < 00 or v(S2) = oo. (3) M is of type III if and only if there exists no or-finite G-invariant measure v which is mutually absolutely continuous with M.
1.4. EXAMPLES OF FACTORS
15
We shall not prove the theorem here. (The interested reader may find such a proof, for instance, in [Sunl], Theorem 4.3.13.) We shall, instead, content ourselves with a discussion of the Ill case, which is the case of interest in this book. We know from Proposition 1.3.2 that M is a finite factor if and only if there
exists a faithful normal tracial state T on M = L°° (S2, F, p) (equivalently, if there exists a probability measure v which has the same null sets as p) which is G-invariant. If v is non-atomic, then M - and hence M - is infinitedimensional, so that M cannot be a factor of type I,,,, n < oo. Since M is a finite factor, the non-atomicity of v implies that M is a factor of type Ill. On the other hand, if v is atomic, the finiteness of v and the ergodicity of the action imply that S2 is the union of a finite number, say n, of atoms. This means that M = C. The assumed freeness (and ergodicity) of the action now forces G to have exactly n elements, and consequently M is a finite factor with n2 elements - i.e., it is a I,,, factor. EXAMPLE 1.4.6 Suppose G is a countably infinite dense subgroup of a compact group. (Two examples to bear in mind are:
(a) K = T = {eZ° : 0 E IR}, G = {ez2n,,I.: n E z}, where Bo is irrational; and
(b) K = {0,1}N = set of all (0, 1) sequences, with group operation being coordinate-wise addition mod 2, and G = the subgroup of those sequences which contain at most finitely many 1's.)
Set S2 = K, F = the a -algebra of Borel sets in K, and p = Haar measure. (In example (a), p is normalised arc-length, so that µ(I) = 6/27r if I is an arc subtending an angle 0 at the origin, and in example (b), µ is the countable product of the measure on {0, 1} which assigns 1/2 to {0} and to {1}.) Fort E G and k E K, define Tt(k) = tk. It should be clear that t --> Tt is a homomorphism from G into the group of automorphisms of the measure space (K, .F, µ). Further, if we define at(c) = ¢ o Tt-,, t E G, 0 E L°° (K,.F, µ), it
follows that a is an action of G on L°°(K,.F, µ) which preserves µ and is ergodic (since G is dense in K). Hence L°°(K) x,, G is a 11, factor, whenever G is an infinite countable dense subgroup of a compact group.
EXAMPLE 1.4.7 A slight variation of the construction in the preceding example yields factors of type III - the so-called Powers factors - see [Pow]. Suppose S2 = {O,1}', equipped with the Borel a-algebra. Now take p to be the countable product of a measure µo on {O, 1} which assigns unequal masses to {0} and {1} thus: µo{0} = 1/(1+.1) and µo{1} = .X/(1+A), where A # 1. If Tt, t E G, is defined as before, it is true that each Tt is still an automorphism
CHAPTER 1. FACTORS
16
of (52, .P, µ), although µ o T ' t for t 1. It is still the case that a, as defined before, is an ergodic action of G on L°°(SZ, .F, A). The crucial difference is that, now, the action does not admit any a-finite invariant measure which is mutually absolutely continuous with t, and hence RA = L°°(S2,.F, t) x,,, G is a factor of type III. In fact, it turns out that RA and RA' are non-isomorphic for 0 < A A' < 1. We shall not prove these facts; the interested reader may consult [Suns], for instance.
EXAMPLE 1.4.8 The group G = SL(2, 7L) admits a natural (linear) action on (1R2, B, µ) - where µ is Lebesgue measure defined on the a-algebra 13 of Borel sets in 'R2. It is true - cf. [Zim], Example 2.2.9 - that this action is ergodic. Since µ is an infinite measure, it follows from Theorem 1.4.5 that M = L°°(1R2,13, p) x SL(2, z) is a factor of type III. ( Note that Lebesgue measure is preserved by linear transformations of determinant 1.)
In the next proposition, we single out a certain feature of the preceding example that we shall need later.
PROPOSITION 1.4.9 Let M = M x,,, G, where M = L°°(1R2,,a) and G = SL(2, 7[), are as in Example 1.4.8. Let pl = 1® denote the characteristic function of the unit disc D {(x, y) E IR2 : x2 + y2 < 1} in IR2 (so that pl is a projection in M). Then (a) R = ir(p1)Mir(p1) is a IIl factor, where it : M -> M is the canonical embedding; and
(b) R = pRp for any non-zero projection p in R.
Proof : We use the notation of §1.3, so that a typical element of M is represented by a matrix of the form ((x(s, t)))8,tEG - which induces a bounded operator on ®7-lt, 7-lt = L2 (J 2, ,a) Vt E G - such that : (s, t) = at-1(x(st-1)), tEG
where {x(s) : s c GI 9 L- (R2, /Z).
Since M is a factor and ir(p1) E P(M), it follows that R ir(p1)M7r(p1) is a factor. Further, the non-atomicity of t shows that MP,, and
hence R, is infinite-dimensional over C. To show that R is a III factor, it suffies, therefore, to exhibit a faithful normal tracial state on R. More generally, let pr = 1IDr, where IDr = {(x, y) E IR2 : x2 + y2 < r2}, for 0 < r < oo. It is easy to see that if x E M, then f E M1f(pr) if and only if
x(s,t) = a,-1(pr)x(s,t)at-1(pr);
(1.4.5)
in other words, I E MM(Pr) if and only if I(s, t) (which is an L°°-function on IR2) is supported in Tt 1(Dr) fl T,-' (B,). In particular, if I E M,r(pr), then
1(1, 1) E L- (B,, µ). It is not hard, using the fact that t o Ti- = µ Vt E G, to show that the equation Tr(x)
f 1(1,1)dµ
(1.4.6)
1.4. EXAMPLES OF FACTORS
17
defines a faithful normal tracial state on Mn(Pr). Hence M, (Pr) is a II1 factor for all r > 0, thus proving (a).
Next, begin by noting that if A > 0, then the equation (BA(f)(x) f (.fix), x e R2, f E L°°(1R2, µ), defines, for each A > 0, an automorphism OA of L°°(R, µ) = M. Since linear maps commute with scalar multiplication, it must be clear that Ba oat = at o Ba VA > 0, t E SL(2, Z). This implies that there exists, for each A > 0, a unique automorphism fix of M such that Ba((x(S1 t))) = ((0A(x(S, t))))
Since 9(i) = ljj
for r, A > 0, it follows from equation (1.4.5) that
M, (PA,); in particular, setting r = 1 and 0 < A < 1 we find (since (Mn(p))_(pa) = R-(pa)) that R = pRp if p = v(PA), 0 <
A<1. Note, finally, that, if 0 < A < 1, then T1(7r(pA)) _ p(IDa) A2, where vrl is as defined in equation (1.4.6), with r = 1). Hence if 0 p E P(R) and A= then T1(p) = T1(7r(pA)); so there exists (by equation (1.1.1)) a unitary u E R such that upu* = 7r(p),), and consequently Rp = R,(p.) (via the isomorphism RP E) x - uxu*), thus completing the proof of the proposition. T1(P)1/2
1.4.3
Infinite tensor products
Fix an integer N, and let
A. = ®" MN
(C)
= MN_ (c).
Regard A. as a subalgebra of A,,,+1 via the embedding x
0
0
0 x 0
X
...
0
0
0
...
0
Xy
0
0 0
0
= x®1N.
X
Then it is clear that A., = U An, is a *-algebra, and that there exists a unique tracial state on A., which restricts on the IN.. factor A. to the unique tracial state trA,,. (In fact, it is clear that this is the only tracial state on A., since finite factors admit unique tracial states.) Let (7-l, 7r, Q) denote the associated GNS triple. We define R(N) = ®N MN(C) = 7r(A°o)".
(1.4.7)
The faithfulness of trA. implies that it embeds A,, as a weakly dense *subalgebra of R(N). Since the equation trR(N) (z) = (x12,12)
18
CHAPTER 1. FACTORS
clearly defines a tracial state on R(N), it follows that the von Neumann algebra R(N) has the property of admitting a unique normal tracial state. This implies
that R(N) is a III factor. (Reason: if h e Z(R(N))+ is arbitrary, then also trR(N) (h.) is a trace; further, in view of the infinite-dimensionality of Ate, the finite factor R(N) cannot be of type I.) (Here is an alternative way of seeing that R(N) is a III factor: consider the compact group K = zN obtained as the direct product of countably infinitely many copies of the discrete group ZN; let G be the dense subgroup consisting of those sequences from ZN which differ from the identity element in at most finitely many places; then R(N) is isomorphic to the III factor constructed as in Example 1.4.6.) Notice that R(N) is clearly approximately finite-dimensional in the sense of the following definition. Not quite so clear, however, is the striking statement of the subsequent theorem due to Murray and von Neumann (which we shall not prove here). (See [MvN3] and also [Conl].)
DEFINITION 1.4.10 A von Neumann algebra M is said to be approximately finite dimensional, or simply AFD, if there exists an increasing sequence
AICA2C...CA, CA,,+IC... of finite-dimensional *-subalgebras, whose union in weakly dense in M.
THEOREM 1.4.11 Every AFD III factor is isomorphic to R(2).
Thus we find that among the class of all III factors, there is one, the socalled hyperfinite III factor - which we shall always denote by the symbol R - which is uniquely determined up to isomorphism by the property that it is approximately finite-dimensional. Thus, for instance, if S" = u' I S. is the group of those permutations of N which move at most finitely many integers, then the group von Neumann algebra LS,, is one model of the hyperfinite
III factor. Less obvious, but also true, is the fact that the algebra denoted by R in Proposition 1.4.9 is another model for the hyperfinite III factor.
Chapter 2 Subfactors and index 2.1
The classification of modules
If M is any von Neumann algebra, we shall, by an M-module, mean a Hilbert space 7-1 equipped with an action of M, i.e., a unital normal homomorphism from M into L(7-I). We shall generally suppress specific mention of the underlying representation it : M - L(7-I) and just write x instead of ir(x) when
If 7-l and K are M-modules, we shall say that a bounded linear operator T : 7-l -* K is M-linear if T Vx E M, E R, and we shall denote the collection of all such M-linear operators from 7-l to K by ML(7-l, K).
When 7-l = K, we shall simply write ML(h) for ML(H,H). (If it denotes the underlying representation of M on 7-1, note that ML(H) _ ir(M)' and consequently ML(H) is a von Neumann algebra. In general, it is true similarly that ML(H, K) is a weakly closed subspace of L(7-1, K) which is well-behaved
under polar decomposition in the sense that if T E C(7-I,IC) has polar decomposition T = UITI, then T is M-linear if and only if U and ITI are.) Two M-modules 7-l and K are said to be isomorphic if there exists an M-linear unitary operator of 7-l onto K. (In view of the parenthetical general remark of the last paragraph, this is equivalent to the existence of an invertible M-linear map of 7{ onto K.)
EXAMPLE 2.1.1 (i) If 0 is a normal state on any von Neumann algebra M, we shall use - here and elsewhere in the sequel - the symbol L2(M, 0) to denote the Hilbert space underlying the GNS representation of M associated with 0, and we shall denote the cyclic vector by Q0. Then, by definition, the Hilbert space L2 (M, 0) is an M-module. (Further, as has already been remarked, every cyclic M-module is isomorphic to such a module, for some normal state 0.) (ii) If {7-i i E I} is any family of M-modules, then their direct sum ®ic, Hi is again an M-module. In particular, if I = N and 7-12 = 7{ Vi, :
this direct sum will be denoted by 7{ ® £2 (for the obvious reason that the
CHAPTER 2. SUBFACTORS AND INDEX
20
underlying Hilbert spaces are isomorphic and the action, in the tensor-product formulation, can be identified thus: x( ®rl) = 7r(x) 0 77). The following result is crucial in the classification of modules over factors.
PROPOSITION 2.1.2 Let M be any von Neumann algebra and let K be a faithful M-module - i.e., a module such that the underlying representation of M is faithful. Then any separable M-module 7-1 is isomorphic to a submodule of K®P2. Proof: First consider the case when 7-l is a cyclic M-module and consequently isomorphic to L2 (M, /) for some normal state 0 on M. The faithfulness assumption says that M is embedded as a von Neumann subalgebra of L(K) and consequently, we may (extend 0 to a normal state on all of L(K) - thanks to the Hahn-Banach extension theorem - and consequently) 1 and O(x) _ find a sequence of vectors in K such that En Vx E M. Notice now that, for each fixed n, we have, for all x E M,
IIx&II2 = (x*g.'' .) < b(x*x) = IIzQPII2;
(2.1.1)
K such that hence there exists a unique bounded operator R,,, : L2(M, x& Vx E M. It follows at once from the definitions that each R is actually an M-linear map. Now consider the (clearly M-linear) operator U : L2(M, 0) -> K ® £2
defined by U _ >n
where {E,,,}°°_1 denotes the standard orthonormal basis for f2. It must be clear that U is an isometric operator, whence L2 (M, b) - and consequently 7i - is isomorphic, as an M-module, to a submodule (viz., the range of the operator U) of K ® P2. Thus we have proved the proposition for cyclic modules. The general case
follows from the facts that (i) every separable module is isomorphic to a countable direct sum of cyclic modules, and (ii) as an M-module, a countable direct sum of copies of the module K ® f2 is isomorphic to K 0 f2 itself.
REMARK 2.1.3 One consequence of the preceding result is a fact which is sometimes termed the `structure of normal isomorphisms'. Suppose then that Mi C L(7-1z), i = 1, 2, are von Neumann algebras and suppose that there exists a normal isomorphism 0 of Ml onto M2. Then put M = M1 and regard 0 as a faithful representation of M, and deduce from Proposition 2.1.2 that 7-11 is isomorphic, as an M-module, to a submodule of 7-12 0 £2. Similarly, 7-12 is isomorphic, as an M-module, to 7i ® e2. Also, it follows that each of the M-modules, 7-li 0 £2, i = 1, 2, is isomor-
phic to a submodule of the other. This implies - by the same reasoning as is employed to prove the classical Schroeder-Bernstein theorem - that these two modules are actually isomorphic. We thus have the so-called `structure
2.1. THE CLASSIFICATION OF MODULES
21
of normal isomorphisms', viz.: the isomorphism B is a composition of three maps, (i) a dilation or 'ampliation' (id 0 le2), (ii) a spatial isomorphism - i.e., one implemented by a unitary isomorphism of the underlying Hilbert spaces (the one establishing the isomorphism of the M-modules ®B2), and (iii) a `reduction' - i.e., the restriction to a submodule.
For us, the importance of Proposition 2.1.2 lies in the classification of modules. For one thing, it says that it is enough to classify, up to isomorphism,
the various submodules of one module - which we may choose as H,,, _ 7Ci ® Q2, where 7-1k = L2(M, 0) for some arbitrary faithful normal state on M. Before proceeding further, we single out two simple facts as lemmas, for ease of reference. LEMMA 2.1.4 Let M be a von Neumann algebra and let K be an M-module.
Then the map p H ran p sets up a bijection between the set P(ML(K)) of M-linear projection operators in K and the set of M-submodules of K. Further, two projections p, q E P(ML(JC)) are Murray-von Neumann equivalent (relative to the von Neumann algebra ML(K)) if and only if their ranges are isomorphic as M-modules. Proof: Easy.
As in our treatment of crossed products, we adopt the convention that if K is a Hilbert space, then K ® £2 is identified with the Hilbert space direct sum of countably infinitely many copies of K; also, we shall identify an operator T E C(K 0 £2) with an infinite matrix ((TTY)) with entries from C(K) (in such
a way that if x E L(K), then the operator x ® ide2 gets identified with the matrix with x on each diagonal entry and zeros elsewhere). Recall that if M C L(K), N C L(f2) are von Neumann algebras, then M ON denotes the von Neumann subalgebra of K ®f2 generated by operators
of the form x ® y, x E M, y E N. Under the identification discussed in the previous paragraph, it should be fairly clear that M ® L(B2) corresponds to the set of those operators T on K®f2 for which all the entries of the associated matrix ((TTY)) come from the von Neumann algebra M. LEMMA 2.1.5 If M C L(K) is a von Neumann algebra, then (M ® 1)' = M' ® L(B2).
(2.1.2)
Proof: This is a routine computation. Now we are ready for the classification of separable modules over factors with separable pre-duals.
CHAPTER 2. SUBFACTORS AND INDEX
22
THEOREM 2.1.6 Let M be a factor with separable pre-dual and let N be a separable M-module. , oo}} (i) If M is of type I, there exists a sequence {N,,, : n E M = {1, 2, of pairwise non-isomorphic M-modules, and there exists (a necessarily unique)
_
n E N such that H = Hn. (ii) If M is of type II, there exists a family {Nd : d E JR = [0, oo]} of pairwise non-isomorphic M-modules, and there exists (a necessarily unique) d E IR such that H = Hd. (iii) If M is of type III, there exists a separable non-zero M-module which is unique up to isomorphism. Proof: We consider the several possible cases.
Case(i): M is of type I As mentioned in §1.1, there exists a separable Hilbert space K such that M = L(K). Deduce from Lemma 2.1.5 that k = mL(K ® £2) (= 1 (9 L (f2)) is a factor of type Imo; it follows that for any projection p E M, it is the case that Mp = pMp is again a factor of type I. On the other hand, it is a consequence of Proposition 2.1.2 that if H is an arbitrary M-module, then H is isomorphic, as an M-module, to p(K®.E2) for some p E M and consequently, that M1(H) is a factor of type I and that in fact, N is isomorphic, as an M-module, to the direct sum of n copies of K, if p = 1 ®po, po E L(.&2) and n = dim ranpo.
Case(ii)1: M is of type II1 In this case, set K = L2(M, tr), where, of course, the symbol tr denotes the unique normal tracial state on M. It follows from Theorem 1.2.4 and Lemma 2.1.5 that ML(K) = JMJ, and consequently, M,C(K ® £2) = JMJ ®,C(E2) is a factor of type III. On the other hand, it follows from Proposition 2.1.2 and Lemma 2.1.4 that the set of isomorphism classes of M-modules is in bijective correspondence with the set of Murray-von Neumann equivalence classes of projections in this III factor; the latter set is, according to the discussion in §1.1, in bijection with [0, oo].
It follows that if 71 is any separable M-module, then there exists p E P(mL(K ® £2)) such that M is isomorphic, as an M-module, to ran p and that ML (H) is a factor of type II; further, the isomorphism class of 7-l depends only upon Trp.
Case(ii)c,,,: M is of type II., In this case - as already mentioned in §1.1 there exists a finite projection p1 E M such that Mo = p1Mp1 is a factor of type 111, and such that M = Mo®c(e2). Set Ko = L2(Mo, tr) and K = K®J2. It is seen then that ML(K) = JMOMoJMO 0 1 - where, of course, the symbol JMo denotes the `modular conjugation' operator on Ko - which is a IIl factor. It follows, as in the last case, that if 7-l is any separable M-module, then there exists a projection p E P(MG(K 0 £2)) such that M is isomorphic, as an Mmodule, to ran p and that ML (H) is a factor of type II .
2.2. DIMMf
23
Case (iii): M is of type III Notice from the cases discussed so far, that if P C G(M), M an arbitrary Hilbert space, and if P is a factor of type I (resp., II), then also P is a factor of type I (resp., II). Hence, if P is a factor of type III, it follows by exclusion that so also is P'. Suppose now that K is an arbitrary faithful M-module. It follows from the previous paragraph that ML (K (& Q2) is a factor of type III. Since any two non-zero projections in such a factor are Murray-von Neumann equivalent, the proof of this case follows at once from Proposition 2.1.2 and Lemma 2.1.4.
0
2.2
dimM?
In order to really be able to use Theorem 2.1.6, we shall find it convenient to work with bimodules. For this reason, we shall make a slight change in terminology: thus, if 7-l is what we have so far been calling an M-module, we shall henceforth refer to 7-l as a left M-module. On the other hand, a Hilbert space 71 is called a right M-module - where M is an arbitrary von Neumann algebra - if there exists a o--weakly continuous linear map lrr : M -+ £(N) which preserves adjoints and reverses products (i.e., 7rr(x*) = (7rr(x))* and iIr(xy) = 7rr(y)lrr(x) for all x, y E M). As with left modules, we shall often omit referring to the map lrr, and simply write x instead of 7rr (x) whenever x E M, E H. (The assumed product-reversal is consistent with writing the operator on the right, as above, in the sense that (xy) = 0) Y dx, y E M, E 7-l.) Every statement about left modules has a corresponding statement about right modules, via the following observation. If M is a von Neumann algebra, recall that there is an opposite von Neumann algebra MP such that there exists a linear isometry x0 f--> x from MOP onto M which preserves adjoints and reverses products. (Note that the conditions of the previous sentence
ensure that (MOP)* = M* and determine the von Neumann algebra MP uniquely up to isomorphism.) Thus, we may - and shall - think of a right M-module as a left MP-module, i.e., as a Hilbert space 7-l equipped with a unital normal homomorphism 2r°P : MOP -> £(7I) - so that 7r°P(x°) _ DEFINITION 2.2.1 (i) If M, N are von Neumann algebras, a Hilbert space 71 is said to be an M-N-bimodule if:
(a) 71 is a left M-module;
(b) 71 is a right N-module; and
(c) the actions of M and N commute; i.e., (mi)n = m(in) Vm E M,n E N, l= E R.
CHAPTER 2. SUBFACTORS AND INDEX
24
Thus, in order for 7-1 to be an M-N-bimodule, there must exist unital normal homomorphisms 71 : M -> L(7-1) and 70 : N°P -> L (H) (i.e., a unital normal anti-homomorphism 7rr : N -> L(7I)) such that 7r°(N°P)
irr(N)) C (ii) If 7-1, IC are M-N-bimodules, an operator T E L(7-i,1C) will be called
M-linear (resp., N-linear) if T(x6) = xT6 (resp., T(6y) = (T6)y) for all x E M, y E N, 6 E H. The collection of such M-linear (resp., N-linear) operators will be denoted by MG(', IC) (resp., LN(',1C)), and an operator is said to be M-N-linear if it is both M-linear and N-linear; we denote the collection of all such operators by ML N(', IC).
We shall be concerned primarily with III factors in this book, and it will serve us well to spell out exactly what Theorem 2.1.6 says in this special case.
If M denotes a III factor with separable pre-dual, the symbol trM will always denote the unique normal tracial state on M and we shall simply write L2(M) for L2(M,trM). We shall assume throughout this section that M denotes a III factor with separable pre-dual, and we shall write 7-11 = L2 (M) and 7i = H1® £2. Consequently, we shall also use the symbols 7r1i ire to denote the representations underlying the above M-modules. (Thus, for instance, ir,,, (x) = 7r1(x) (9 idez.) Also we shall write MO(M) = M 0 G((2) and think of elements of MO(M) as infinite matrices ((xij)) with entries from M .
Notice now that '1 is actually an M-M-bimodule, with the right action of M being given by 7rr(y) = y = Jy*J6; in fact, Theorem 1.2.4 says that in this case, we have an equality ir1(M)' = 7r, (M). In order to deal with 7-1,,,, we shall find it convenient to think of 7-i as Mat1xo,('I) - by which we mean the Hilbert space of norm-square-summable
sequences with entries from '1. A moment's thought should convince the reader that 7-i is actually an M-MO(M)-bimodule with respect to matrix multiplication (explicitly, if = (1i 6, . .), x E M, y = ((yij)) E M. M, and that in fact, we have 7r (M)' _ and r1 = then 71j = >i 9rr(M.(M)). Notice now that MO(M) is a III factor, and the `faithful normal semifinite trace' Tr on it - as discussed at the end of the last section - is given by the obvious formula Tr((pij)) = E-1 trM(pii). (This is the `natural' normalisation to choose, in the sense that Tr(1M 0 q) = 1 whenever q is a projection in £(f2) of rank 1. Throughout the sequel, the symbol Tr - if it is used in the context of MO(M) - will always mean the one defined in this paragraph.) In the above terminology, the content of Theorem 2.1.6, at least as far as III factors are concerned, may be reformulated thus: THEOREM 2.2.2 If'H is any separable M-module, then there exists a projec-
tion p E MO(M) such that ' = 'gyp, and such a projection p is determined uniquely up to Murray-von Neumann equivalence.
2.2. DIMM7-l
25
We now come to a fundamental definition.
DEFINITION 2.2.3 Let 7-l denote an arbitrary separable module over a 11, factor M with separable pre-dual. Then define dimM h = Tr p where p E as an M-module.
is any projection such that 7-(0p is isomorphic to 7-C
We shall soon derive some of the basic properties of the assignment 7-l dimM 7-l, which should convince the reader that there is every reason to call this quantity the M-dimension of the module. Before that, however, we pause to (a) mention an example that might make the reader more favourably disposed to this definition, and (b) make a remark of a historical nature.
EXAMPLE 2.2.4 Suppose r is a discrete subgroup of a semisimple Lie group G such that covol(r) < oo. Assume further that r is an ICC group in the sense discussed in §1.4. Suppose now that it is a 'discrete-series representation' of G, meaning that it is a subrepresentation of the left-regular representation of G, or equivalently, that every (equivalently, that some non-zero) matrix77) where , 77 belong coefficient of 7r (i. e., a function on G of the form to the Hilbert space 7-l, underlying the unitary representation 7r) is squareintegrable with respect to Haar measure. It is then the case that 7rlr extends to an isomorphism of Lr onto 7r(r)"; consequently, the algebra ir(r)" is also a 11, factor; and it can be shown - see
[GHJ] - that dim,(r),, (7-l,) = covol(r) x d,r,
where d.7, denotes the so-called `formal dimension' of the discrete series representation 7r. REMARK 2.2.5 We should mention here that what we have termed dimM 7-l occurred first in the work of Murray and von Neumann ([MvN1]) as the socalled `coupling constant' of the module. Their definition is different from
the one presented here (and depends upon a result we do not prove here, since that is not really essential for our purposes). They define this coupling constant as infinity if ML (7-l) is an infinite factor, and if this is a factor of type III, they show the following is true: pick any 6 54 0 in 7-C and let p E M (resp., p' E mL(R)) be the projection operator whose range is (resp., [M6]); then the quotient trM(p) tr(Mc(x)) (p')
turns out to be a positive finite constant which is independent of the initial choice of vector t;; this is the number that they call the `coupling constant' of the module, and this number agrees with what we have defined as dimM7-l.
CHAPTER 2. SUBFACTORS AND INDEX
26
(In order to minimise notation, we assume in the next proposition that M C L(N) rather than that 7-L is some abstract M-module; there is no real distinction here since every unital normal homomorphism of a IIi factor is an isomorphism onto its image - see the appendix.) PROPOSITION 2.2.6 Let h be a separable Hilbert space, and suppose M C .C(H) is a IIi factor. (i) For each d E [0, oo], there exists an M-module Hd .iuch that dimMHd = d.
(ii) There exists a unique d E [0, oo] such that 7i = qtd; in particular, two M-modules are isomorphic if and only if they have the same M-dimension.
M' is a Ill factor. (iii) dimM 7-l < oo (iv) dimM L2(M) = 1. (v) If {K,,,}n is any countable collection of separable M-modules, then dimM(®n Kl) = E dimM /Cf. n
(vi) If dimM h < oo so that M' is a IIi factor (see (iii) above), and if p' E 'P(M), then dimM(p'9-l) = trM,(p') dimM H. (vii) p E P(M) dimMM(p11) = (trM(p))-' dimM7i. (viii) If dimM h < oo - see (iii) above - then dimM 7i = (dimM ?-()-i.
Proof: The first two assertions follow immediately from Theorem 2.2.2, and from the facts concerning the semifinite trace Tr that were listed out in §1.1.
We shall find the following description of hd, d < oo, convenient.
For d = n E N, H is the direct sum of n copies of ?-ll. As in the case of d = oo, we think of Hn as Matlxn,(7ii); observe, as before, that ?-t,, is naturally an M-M.,,(M)-bimodule (with respect to matrix multiplication) in such a way that MG(q-ln) = irr(Mn(M)).
If d E [0, oo), pick an integer n which is at least as large as d, pick a and set projection q in the Ill factor M,,(M) such that xd = H.q. (iii) Notice that if 7-l = ?-tip for some p E P(MM(M)), then M' _ ,
M,),) (M)P, and that Trp < oo 4= p is a finite projection.
(iv) If p = 1M ® ell, where ell denotes the matrix-unit (with 1 in the (1,1)-place and zeros elsewhere), then 74,0p = L2(M). (v) Let dimM K,, = d.. We can find mutually orthogonal projections pn in M,),) (M) such that Tr p.,. = dn for each n. If P = En p,., the desired assertion
follows from the fact that Tr is `countably additive' on P(M,),)(M)), since
®n, In = H-p. (vi) We may as well assume that 7-t = q'ad, where xd has been constructed
as in the discussion preceding the proof of (iii) of this proposition. Let n, q have the same meanings as above. In this case, since M1(Hd) = Mn(M)q,
27
2.2. DIMM7-l
it follows that there exists a projection p E M,,,(M) such that p < q and p' = 7r, (p). Then, p'R = Hp and consequently, we see that dimM(px) = ntrM (M)(p). On the other hand, it follows from the uniqueness of the trace in a 111 factor
that trM, (p) = trm. (M), (p) trM,(M) (p) trMM.(M) (q)
1-1 dimM(p'iI)
1 dimM H
(vii) Notice that the conclusion is `additive in 7-l', in the sense that if I-l = (D H is a decomposition of 7-l into countably many M-submodules, and if the desired assertion is valid for each 9-1n, then the desired assertion is valid for 7-l as well. Hence there is no loss of generality in assuming that dimM l-l < trMp(< 1). Hence - see the discussion just prior to the proof of (iii) above - we may
assume that R = (i11)q , where q E P(M) and q < p. It is then seen that dimMP(p1) = dimMp(p(iu1)q) = dimMM(p(xl)p - q) = dimMp(L2(MP)q) (by (vi) and (iv)) = trMp(q) . 1 trMq trMp dimM 9-l
trMp
(viii) We may assume that R = 7-ld is constructed as described in the comments preceding the proof of (iii) above. First, if d = 1, this is a consequence of Theorem 1.2.4 (1). Next, if d = n, note that ?-knell = R1 and that 7rr(ell) is a projection in 7r,(Mn(M)) = 7r1(M)' with trace -11; it follows from (vii) above that 1
= dim(M,c(n1)) 7i: dimM c(nn ), , (,11)) (Hnell ) i dim(MG(nn.))(xn); n
(?-1,,,) = 11, thus proving the assertion when d = n. A similar hence dimM reasoning, applied to the fact that 7 d is obtained by `cutting down' / I , proves the general case.
CHAPTER 2. SUBFACTORS AND INDEX
28
2.3
Subfactors and index
We begin with a look at some examples of bimodules (or correspondences, as introduced and popularised by Connes - see [Con2]).
Suppose, to be specific, that M is a III factor and that 7-i = L2(M). Then, as has been already observed, Ill is an M-M-bimodule in a natural fashion; but there are several other bimodule structures on L2 (M) as follows.
Fix an automorphism 8 of M, and define the bimodule 7-le to be L2(M) y = xl`8(y), as a Hilbert space, but where the actions are given by: x where the actions in the right side are as in Rl (and the actions on the left refer to the actions in 718). It is easy to see that 7-1e, so defined, is indeed an M-M-bimodule, which is irreducible in the sense that He has no proper sub-bimodules (or equivalently, the von Neumann algebra ML M(HO) reduces
to the scalar multiples of the identity operator). Thus, there are plenty of irreducible M-M-bimodules, although there are no irreducible M-modules.
Further, since the only left-M-linear maps on L2 (M) are of the form irr (x), x E M, it follows that if Oi E Ant M, i = 1, 2, then the bimodules 7-le, are isomorphic if and only if the automorphisms are -outer equivalent - meaning that there exists a unitary element u E M such that 81(x) = 92(uxu*) Hx E M. Thus, the set of equivalence classes of irreducible M-Mbimodules is at least as rich as the group of outer automorphisms (viz., the quotient of Ant M by the normal subgroup of inner automorphisms). In fact, it is much richer, as can be seen, for instance, from the fact that we could have defined the bimodule 7-i by only requiring B to be a unital endomorphism.
(It is a fact that if M is a factor of type III, then every M-M-bimodule is isomorphic to 7.18, for some endomorphism 0 - see the third paragraph of §4.1.)
It is clear that the assignment 7-l H (dimM_(R),dim_M(71))
(2.3.1)
defines an isomorphism-invariant of the M-M-bimodule 7-l. The bimodules 11e show that the above is not a complete invariant of the bimodule. Motivated by the success of Theorem 2.1.6, we are naturally led to the following question.
QUESTION 2.3.1 What can be said about the set {(dimM_(7-i),dim_M(7I)) :7-l is a separable M-M-bimodul}?
Before we get to this question, pause to notice that if M is a factor and if R is an M-M-bimodule, then, by definition of a bimodule, we see that irj(M) is a subfactor of 7rr(M)'; further, we see that, at least in this example, the subfactor has `trivial relative commutant' in the ambient factor precisely when the initial bimodule is irreducible. We formalise all of this in the next definition.
2.3. SUBFACTORS AND INDEX
29
DEFINITION 2.3.2 A subfactor of a factor M is a subalgebra N C M such that N is also a factor and N contains the identity element of M. The subfactor N is said to be irreducible if it has `trivial relative commutant' - i.e.,
ifN'nM=c1.
EXAMPLE 2.3.3 (a) Suppose ro is a subgroup of r, and suppose that both r and r0 are ICC groups. Notice then that Lro sits naturally as a-subfactor of the IIl factor Lr. Notice, further, that 22 (r) = L2(Lr) and that if r = Li r0si is the partition of r into disjoint cosets of ro, then 22(11) = ®(f2(ro))si is an orthogonal decomposition of f2(r) into (left) Lro- submodules (each of which is isomorphic to 22(ro) as an Lro-module, and consequently, we have dimLro(12(r)) = [r : ro].
(b) Suppose G is a finite group acting on a h i-factor P. It is true - see the first paragraph of §A.4 - that an automorphism 0 of a IIl factor is `free' in the sense of Definition 1.4.2 if and only if it is not an inner automorphism (i.e., not of the form Adu = u in the algebra). It follows that if P, G are as above, then the crossed product algebra P x G is a IIl factor if and only if the action is outer - meaning that no non-identity element of G acts as an inner automorphism. Suppose then that G acts as outer automorphisms of P, so that M = P x G is a IIl factor. It should be clear now that every subgroup H of G would yield a
subfactor N = P x H of M. Notice now that there is a natural identification L2(M) = L2(P) ® £2(G) and that if G = 11Hsi is the partition of G into distinct cosets of H, then (i) each of the subspaces 'Hi = L2(P) ® hE H}] is an N-submodule of L2(M), which is isomorphic, as an N-module, to L2(N), and (ii) L2(M) = ®7I,. It follows that dimN(L2(M)) = [G : H]. Motivated by the preceding examples, we make the following definition.
DEFINITION 2.3.4 If N is a subfactor of a IIl factor M, define the index of N in M by the expression [M : N] = dimN(L2(M)).
The next proposition shows that the index [M : N] can be read off from any M-module of finite M-dimension. PROPOSITION 2.3.5 Let N C M be an inclusion of IIl factors. Let 7I be any separable M-module such that dimM7-l < oo. Then dimN 7-l < oo -# [M : N] < oo;
in fact, we have the identity dimN 7-1 = [M : N] dimM R.
(2.3.2)
CHAPTER 2. SUBFACTORS AND INDEX
30
Proof: Suppose, to start with, that Ki, i = 1, 2, are any two M-modules with dimM Ki < oc. It follows then that there exists n E N and a projection q' E MG(K2 0 c") such that ICI = q'(/C2 (9 c"); thus we may deduce that dimN)C1 < dimN(K2 (9 E") = n x dime, K2. Since the roles of ICI and K2 are interchangeable, we see that dimN KI < oo ( dimN K2 < oo. In particular, we see that dimN h < 00 [M: NJ < oo. To prove the asserted equality, we may assume that, as an M-module, " copies 7l = 7l"q, where 7l" = L2(M)® ®L2(M),q E dimM7-l. Then dimN?-l" < oo so N'(= NL(7-l")) is a III factor, and hence, it follows that dimN 7-l = trN' 7rr (q) dimN 7-l"
= trM'lrT (q)n dimN hI = dimM?-l[M : N].
11
Before proceeding further, we record an immediate consequence of this fact and Proposition 2.2.6(viii).
COROLLARY 2.3.6 (a) If N C M is an inclusion of III factors, and if M C L ('H) and dimM 7-l < oo, then
[N':M']=[M:N]. (b) If N C M C P is a tower of III factors, then
[P: N]=[P:M][M:N]. In particular, if N is an M-M-bimodule which is bifinite in the sense that both dimM_ 7-l < oo and dim-MN < oc, it follows then that dimM_7-l dim_M7-l = [irT(M)' : irj(M)].
Thus, we find that the answer to Question 2.3.1 is tied up with the following related question.
QUESTION 2.3.7 What are the possible values of [M : N], where N C M is an inclusion of III factors ?
The following result - see [Jonl] - completely answers Question 2.3.7, and the answer is quite unexpected in the light of our experience with the classification of modules.
THEOREM 2.3.8 If N C M is any inclusion of III factors, then
[M: N] E {4cos2n : n = 3,4,
}U[4,oc].
n = 3, 4, } U [4, oo]), then there exists a subfactor Further, if .A E ({4 cos' RA of the hyperfinite III factor such that [R : RA] = A.
2.3. SUBFACTORS AND INDEX
31
In this section, we shall content ourselves with describing a construction of subfactors of all possible index values > 4. LEMMA 2.3.9 Let N C_ M be an inclusion of IIl factors, and suppose M C_ L (H) where dimM fl < oo. If p E P(N' n M), then
[pMp : Np] = trN'(p) trM(p) - [M: N]. Proof: It follows from Proposition 2.3.5 that
[pMp : Np] -
dimNp(pl) dimmMp(pH)
= (trN'(p)dimM7-l) dimM,,(p7-l)
= (trN'(p) dimN7i) (trM(p) dimM l), as desired.
PROPOSITION 2.3.10 Suppose M is a IIl factor such that Mp = Ml_p for some projection p E M. Let 0 : Mp -; Ml_p be such an isomorphism, and define N = {x + 0(x) : x E M}. Then N is a subfactor of M with [M : N] _ 1
l
trMp + trM(1-p)
Proof: Note that p E N'nM and that pMp = Np, so that [pMp : Np] = 1. Hence, by Lemma 2.3.9, 1 = trN (p) . trM(p) . [M : N],
and so trM(p)
= trN' (p) - [M : N]
.
Similarly, we also have 1
trM(1 - p)
= trN , (1 -p) - IM:
N]
Add the above equations to obtain the desired conclusion.
13
The existence of subfactors of the hyperfinite II, factor R with index at least 4 is an immediate consequence of proposition 1.4.9 and the preceding proposition (and the trivial fact that the mapping t H (t + l l t) maps (0,1) onto 0; oo) ). The preceding construction used the existence of non-trivial projections in the relative commutant. The following question, which naturally arises, still remains unanswered. QUESTION 2.3.11 Describe the set of index values [R subfactors Ro of the hyperfinite factor R.
:
Ro] of irreducible
CHAPTER 2. SUBFACTORS AND INDEX
32
We conclude this section with some useful consequences of Lemma 2.3.9.
PROPOSITION 2.3.12 Suppose N C M is an inclusion of IIl factors such that [M : N] < oo. If there exist pairwise orthogonal non-zero projections pl, , pn E N' n M, then [M: N] >n 2. In particular, (i) [M : N] < oo = N' n M is finite-dimensional;
(ii)[M N] <4
N'nM=E1.
Proof: Deduce from Lemma 2.3.9 that n
[M : N] > EtrM(pi)[M : N] i_1
n
>
1
E i1 trVi(pi)
> n2
(since rl, , r n E (0, 1), Ei ri = 1 = L i r > m2 The above inequality clearly implies (i) and (ii).
Chapter 3 Some basic facts 3.1
The basic construction
Suppose N C M is an inclusion of finite von Neumann algebras. Fix some faithful normal tracial state tr on M, and consider the M-M-bimodule 7i = L2 (M, tr), with its distinguished cyclic trace vector Q. Since 7-l is the completion of MS2, it follows that the subspace 7-1 = [NS2] of 7-l can be naturally identified with L2(N, tr). Let eN denote the orthogonal projection of 7-l onto the subspace 7-l1. It is a consequence of Theorem 1.2.4(1) that eN(MS2) C NS2, and hence the projection eN induces, by restriction, a map E : M -* N. The
map E is called the (tr-preserving) conditional expectation of M onto N, and is easily seen to satisfy the following properties: (i)
eNxeN = E(x)eN Vx E M,
(3.1.1)
and consequently E defines a (Banach space) projection of M onto N.
(ii) E is N-N-bilinear, meaning that E(nimn2) = n1E(m)n2.
(iii) tr o E = tr. It is clear from equation (3.1.1) that the conditional expectation is a preserving map, or, in other words, that JCN = eNJ,
(3.1.2)
where J denotes the modular conjugation operator on H. DEFINITION 3.1.1 The passage from the initial inclusion N C M to the von Neumann algebra (M, eN) = (M U {en})", and consequently to the tower N C M C (M, eN), is called the basic construction. We list some simple relations between the various objects involved in the basic construction. Also, we adopt the convention that M (and hence, also N) is identified, via 7r1, with a subalgebra of G(7-l); thus, for instance, the right action of M on 7i is given by ir,.(x) = Jx*J.
CHAPTER 3. SOME BASIC FACTS
34
PROPOSITION 3.1.2 With the foregoing notation, we have:
(i)eNEN'. (ii)N=MfI{eN}'. (iii) (M, eN) = JN'J. (iv) Assume both M and N are II, factors. Then: N] < oo; in this case, we
(a) (M, eN) is a II, factor i f and only i f [M have [(M, eN) : M] _ [M : N]. (b) tr(M,eN)(eN) _ [M: N]-1.
(c) (Markov property) EM(eN) = tr(M,eN)(eN) - where EM denotes the conditional expectation of the II, factor (M, eN) onto the subfactor M.
Proof: The first assertion is obvious; as for the second, the fact that the xeN is injective, trace vector SZ is separating for M implies that the map x and consequently, if x E M, it follows from equation (3.1.1) that x commutes with eN if and only if x = Ex. (iii) It follows from (ii) that
JN'J = J(M', {eN}")J = (JM'J, JeNJ) = (M, eN). (iv) (a) The first assertion is a consequence of (iii) above and Proposition 2.2.6(iii). As for the second, note that
[(M, eN) : M] = (dim(M,gN) = (dimJN'J 7-l)-1
= (dimN,
L2(M))-1
7-L)-1
= dimN 7-l
= [M:N]. (b) On the one hand, tr(M,eN)eN = trN,eN, while on the other,
1 = dimN L2 (N) = dimN(eN7I)
= (c) We need to verify that tr(M,eN)(xeN) = TtrM(x) Vx E M,
where T = tr(M,CN)(eN) = [M : N]-1. We first verify this identity whenever
x E N; for this, note that, in view of (i), the map x
tr(xeN) is a trace
3.1. THE BASIC CONSTRUCTION
35
on the 11, factor N which takes the value T at the identity; appeal to the uniqueness of the trace in a finite factor to conclude the proof in the special
case. The case of a general x E M reduces to the above case because of equation (3.1.1), thus: tr(M,eN) (xeN) = tr(M,eN) (xeN)
= tr(M,eN) (eNxeN) tr(M,eN) (EN(x)eN).
11
REMARK 3.1.3 In the sequel, if N C M is an inclusion of finite von Neumann algebras, if tr is a fixed tracial state on M, if (M, eN) is as above, and if 0 denotes an extension of tr to (M, eN), we shall say that eN satisfies the Markov property with respect to the algebra M (and 0) if it is the case that EM(eN) = q(eN), where EM denotes the unique q-preserving conditional expectation of (M, eN) onto M. Before proceeding further, we record two simple consequences of the last proposition.
COROLLARY 3.1.4 Suppose N C M is an inclusion of IIl factors. Then
[M : N] =1
N = M.
Proof: If eN and (M, eN) are as above, then the assumption [M : N] = 1 implies that tr(M,eN)eN = 1, and the faithfulness of the trace now implies that eN = 1; thus, in the notation of the first paragraph of this section, we have 71i = H. An appeal to Proposition 3.1.2 (i) completes the proof. COROLLARY 3.1.5 If N C M is an inclusion of IIl factors, then [M : N] V (1, 2).
Proof- On the one hand, it follows from (iv)(a),(b) of Proposition 3.1.2 that [(M, eN) : N] = [M : N]2. On the other hand, since eN E N' fl (M, 6N), the non-triviality of the relative commutant implies, via Proposition 2.3.12(ii), that we must have [M: N] > 2.
We conclude this section with one way of constructing subfactors of the hyperfinite IIl factor. EXAMPLE 3.1.6 Let us take the model R = R(2) (in the notation of §1.4) of the hyperfinite Ih factor. (Everything we say can be said just as well with any N in place of 2.) Let An have the same meaning as in the above-mentioned construction of R(N). Notice, to start with, that, for any n, there is an obvious identification A® ® A2 = An+2; for any x E A2, let us denote the image of
CHAPTER 3. SOME BASIC FACTS
36
1®x under this identification by xn+i,n+2. (Thus, xn+l,n+2 is just the element
x `sitting in slots n + 1, n + 2'.) Now fix a unitary element u E A2, and notice that the equation O.(x) =
(3.1.3)
(x)
defines a unital normal endomorphism 9,l of R = R(2). Consider the subfactor Ru = 9,,(R) of R. Thus, we get a family of subfactors of R parametrised by the unitary group U(4, C). It must be clear that the subfactor R1, corresponding
to u = 1, is the trivial subfactor Ri = R. On the other hand, if we take u to be the unitary operator implementing the `flip' on C2 0 C2 - or, in other words,
u=
1
0
0
0
0
0
1
0
0
1
0
0
0
0
0
1
- then it is easy to see that Bu defines the `shift', thus: O,(xi ®x2 (9 ...) = 10 X1 ®x2
®...
E M2(C). Thus, we find that in this case, R = M2(C)®R,,, and consequently, [R: R,l] = 4. Since the unitary group U(4, c) is connected, we find that `the index is a discontinuous function of the subfactor'! whenever x1, x2i
3.2
Finite-dimensional inclusions
In this section, we recall various elementary facts concerning finite-dimensional von Neumann algebras. To start with, any finite-dimensional C*-algebra A is semi-simple and hence, by the Wedderburn-Artin theorem, is isomorphic to the direct sum of finitely many matrix algebras over C. To be specific, if A is a finite-dimensional C*-algebra, then A = Mnl (C) ® Mnz (c) ® ... ® Mn, (C)
(3.2.1)
for a uniquely determined integer k(= dim Z(A)) and a uniquely determined nk} of positive integers. (The fact is that A admits exactly k set {n1, equivalence classes of (pairwise inequivalent) irreducible representations, and the dimensions of these representations are precisely the integers n1, , nk.) nk) If equation (3.2.1) is satisfied, we shall say that A is of type (ni, nk) as the dimension vector of A. and we shall refer to the vector n = (ni, Further, since a matrix algebra is a factor, it follows that if A is as above, then there is a bijective correspondence between the set of faithful tracial ,
,
,
3.2. FINITE-DIMENSIONAL INCLUSIONS
37
states on A and the open simplex Ak = {t = (tl, , tk)' E IRk : t, > 0 Vj and YET = 1} given by T " t , where tj = T(pj) is the trace of a minimal (= rank one) projection in the j-th summand of A. (The reason for the superscript i (which denotes `transpose') is that we shall find it convenient to adopt the convention that dimension-vectors are row-vectors while tracevectors are column-vectors.) That's about all there is to say about finite-dimensional C*- (and hence von Neumann) algebras. Suppose now that we are given an inclusion A C B of finite-dimensional C*-algebras. Then, besides the dimension-vectors, say n = (nl, nk) and ,
m = (ml,
ml), of A and B, respectively, there is more data needed to describe how the smaller algebra is included in the larger. The more that is needed is the k x l inclusion matrix A = AA described thus: Azj is the number of times that the i-th irreducible representation of A features, in the restriction, to A, of the j-th irreducible representation of B. Less formally, but more transparently, this is the number of times the i-th summand of A gets repeated in the j-th summand of B. This data can clearly be encoded equally efficiently in a bipartite (multi-) graph with k even and 1 odd vertices, where the i-th even vertex is joined to the j-th odd vertex by A2, bonds. (This graph is sometimes referred to as the Bratteli diagram of the inclusion A C_ B.) It is a fact that the isomorphism-class of the inclusion is uniquely determined by the inclusion matrix and the dimension vectors of A and B. EXAMPLE 3.2.1 The inclusion
A = {([0 0] '[O y],[Y1):XEM2(C),YEC} n
B = M3 (C) ®M2(E) ED Mi (IC) is described by the data
A
n=
n
AA
B
m=
Bratteli diagram
(2,1) 1
[
1
0 2
0 1
(3,2,1)
It must be clear from the definitions that if the inclusion is unital - i.e., if the subalgebra contains the identity of the big algebra, and this is the only kind of inclusion that we shall ever consider here - then the dimension-vectors are related to the inclusion matrix by the equation m = nA.
(3.2.2)
CHAPTER 3. SOME BASIC FACTS
38
Similarly, if a tracial state T on A (resp., of on B) corresponds to the 'trace-vector' t (resp., s), then (3.2.3)
It should be clear that if we had a whole tower
A1CA2C...CA,CA,+1C ... of finite-dimensional C*-algebras, then we could stack up the Bratteli diagrams corresponding to the several inclusions and obtain the Bratteli diagram of the tower. (Of course, for this to be possible, one must consistently label the direct summands of any algebra in the tower.) Or, in terms of the inclusion matrices, one should observe that - with the summands of the Ak's AAn+2 = consistently labelled . AA.+2 AAn+I
For instance, we might have the following tower:
A1C A2C A3C A4C A5C . .
A good feature about a tower {A,,,}' 1, as above, is that it has `finite width' - meaning that sup, dim Z(A,,,) < oo - and the Bratteli diagram is connected and is periodic (of order two). The reason this is `good' is that for such a tower, the algebra U An admits a unique tracial state and yields the hyperfinite IIl factor as its completion in the GNS representation associated with the trace - as in our discussion of R(N) in §1.4. (This is a consequence of the general fact that if {A}1 is an arbitrary tower of C*-algebras and if T is a tracial state on A0,, = U A,,,, and if ir, denotes the GNS representation associated with T, then 7r, (A,,,)" is a factor if and only if T is an extreme point in the set of tracial states of Ate.)
We now consider the basic construction, when applied to an inclusion A C B of finite-dimensional C*-algebras. Notice that (B, eA) is, by definition, an algebra of operators on the finite-dimensional space L2(B, a), and is hence also finite-dimensional.
LEMMA 3.2.2 (a) Let A C B be a unital inclusion of finite-dimensional C*-
algebras. Fix a faithful tracial state ¢ on B, and let J denote the modular conjugation operator on L2(B, 0). Let e denote the orthogonal projection of L2(B, 0) onto the subspace L2(A, OJA); let EA denote the 0-preserving condi-
tional expectation of B onto A; and let B1 = (B, e) denote the result of the
3.2. FINITE-DIMENSIONAL INCLUSIONS
39
basic construction. Then:
(i) ze = Jz*Je, Vz E Z(A); (ii) if b E B, then b c Z(B)
b = Jb*J;
(iii) z H Jz*J is a *-isomorphism of Z(A) onto Z(Bi); (iv) if pl,
, p,,,,,
(resp., q1,
,
q,) is an ordering of the set of minimal cen-
tral projections of A (resp., B), and if we set pi = JpiJ, 1 < i < m, then pl, , p,,,, is an ordering of the minimal central projections of B1; if A is the inclusion matrix for A C B, computed with respect to the pi's and qt's, then the inclusion matrix for B C B1, computed with respect to the qt's and the pi's, is the transpose matrix A. (b) Furthermore,
(i) the map a H ae is a *-isomorphism of A onto eBie;
(ii) if p is a minimal central projection in A, and if po is a minimal projection of A such that po < p, then poe is a minimal projection in B1 which is majorised by the minimal central projection JpJ of B1. Proof: (a)(i) For all z E Z(A), b E B, we have zebOB = zEA(b)OB = EA(b)zQB = Jz*JEA(b)QB = Jz*JebOB. (ii) This is obvious.
(iii) The map a - Ja*J is an anti-isomorphism of A into L(LZ(B)), and hence its restriction to the abelian subalgebra Z(A) is an isomorphism onto J(A n A')J = B1 n B1. (iv) Only the assertion about the inclusion matrices needs proof. If A denotes the inclusion matrix for B C B1, the definitions imply that Aij = [dimc(pig7A'pigj npiggBpiqa)]2,
while Aji = [dimc(gjpiB'g1pi n q.jpiBlg1pi)[ 2.
Notice, by (ii) and (iii) above, that gjpi = piqj = JpiqjJ, so that gjpiB'gjpi n gjpiB1g7pi = JpigjJB'JpigjJn JpigjJB1JpigjJ = J(piqjBpigq n pigjA'pig9)J,
thereby showing that indeed, A,i = Aid. (b) (i) Clearly the assignment a F--> ae defines an injective *-homomorphism
of A into eBie. To see that it is surjective, notice first that - thanks to the fundamental equation ebe = E(b)e Vb E B, where E denotes the 0-preserving
40
CHAPTER 3. SOME BASIC FACTS
conditional expectation of B onto A - the set {bo + E2 1 bieb' : n > 0, bi, bi E B} is a *-subalgebra of B, which contains B U {e} and is consequently equal to all of B1; since ebe = E(b)e, e(beb')e = E(b)E(b')e, it follows that indeed eBle = Ae. (ii) This follows at once from (b)(i), (a)(iii) and (i). We thus find that the isomorphism-type of (B, eA) is independent of the initial state o-. It turns out, however, that there is one `good choice' of trace on the big algebra - which is unique, under mild `irreducibility' assumptions - as shown by the next result. A word about notation before we state the next result (which is necessary because traces on finite-dimensional algebras are far from unique): if A C_ B are as above, and if o- is a tracial state on B, we shall write o- = tr7 if o- and s are related as in equation (3.2.3); further, in this case, we shall write EAT for the unique trs preserving conditional expectation of B onto A. PROPOSITION 3.2.3 Let A = AA denote the inclusion matrix, where A C B is an inclusion of finite-dimensional C*-algebras as above; and let r = trt be a tracial state on B, as described above. The following conditions on the trace r are equivalent:
(i) r extends to a tracial state r1 = trig on (B, CA) such that EB (eA) _ for some scalar A;
1
(ii) A'At = A-lt. Further, when these conditions are satisfied, the scalar A must be the reciprocal of the Perron-Frobenius eigenvalue of the (positive semi-definite and entrywise non-negative) matrix AA, and hence, 1 = IIA'AII = IIAII2.
Proof: Let pi, qj, pi be as in Lemma 3.2.2(a)(iv); we assume that it is these ordered sets of minimal projections in the three algebras A, B and (B, eA) with respect to which inclusion matrices and trace-vectors are described. Thus, the inclusion matrix for B C (B, eA) is just A' (by Lemma 3.2.2(a)(iv)).
Let r1 = trig be any tracial state on (B, eA) which extends r (or equivalently, ti is a trace vector for (B, CA) such that A71 = t). For each i, pick a minimal projection p° in A such that p° < pi, and set p° = p°e. It follows from Lemma 3.2.2(b)(ii) that (At)i = T(p°)
and (t1)i = 'r, (AD) Vi.
(3.2.4)
On the other hand, it follows, by reasoning exactly as in the proof of Proposition 3.1.2(iv)(c), that Ea (eA) = Al
EA (eA) = Al.
(3.2.5)
3.3. THE PROJECTIONS EN AND THE TOWER
41
Hence condition (i) of the proposition is seen to be exactly equivalent to the requirement (i)' There exists a trace-vector tl for (B, eA) such that A'11 = t and.-'tl = At.
If (i)' is satisfied, then A'At = .-'A't, = .\-'I and (ii) is satisfied. Conversely, if (ii) is satisfied, and if we define tl = )Ai, we see that (ii)' is satisfied.
DEFINITION 3.2.4 A trace T which satisfies the equivalent conditions of Proposition 3.2.3 is said to be a Markov trace for the inclusion A C B. COROLLARY 3.2.5 Let A C B be an inclusion of finite-dimensional C*algebras.
(a) If T is a Markov trace for the inclusion A C B, then it extends uniquely
-
to a state trig on (B, eA) which is a Markov trace for the inclusion B C (B, eA) (b) The following conditions are equivalent:
(i) there exists a unique Markov trace for the inclusion A C B; (ii) the Bratteli diagram for the inclusion A C B is connected. Proof: (a) This is clear from (the proof of) Proposition 3.2.3. (b) The content of Proposition 3.2.3 is that trt is a Markov trace for the inclusion A C B precisely when t is a Perron-Frobenius eigenvector of the (entry-wise non-negative) matrix AA'. The point is that the general theory
says - see [Gant], for instance - when such an eigenvector is unique, and that answer, when translated into our context, is that (ii) is precisely what is needed to ensure that uniqueness.
3.3
The projections en and the tower
In this section, we shall be interested in an (initial) inclusion M_1 C_ Mo of finite von Neumann algebras, which falls into one of the following cases:
Case (i) Mo and M_1 are III factors, and [M0 : M-1] < oo; Case (ii) Mo and M-1 are finite-dimensional; in this case, we shall always assume that the inclusion is `connected' (meaning that the Bratteli diagram is connected), and we shall reserve the symbol trM0 for the Markov trace for the inclusion, which is unique by Corollary 3.2.5(b). In either case, write M1 = (Mo, el), where we write el for the projection we denoted earlier by eM_1. The reason for the changed notation is that then the inclusion Mo C M1 falls into the same `case' above, as did the initial
CHAPTER 3. SOME BASIC FACTS
42
inclusion M_1 C_ Mo; hence, we can iterate the above procedure to obtain a tower
M19M29 9 M.9Mn+1C...
(3.3.1)
where Mn+1 = (Mn, en+I) is the result of applying the basic construction to the inclusion .a_1 C_ Mn, and e,,,+I denotes the projection implementing the (trM, -preserving) conditional expectation of Mn onto Mn_1. It must be clear that in case (i), the tower (3.3.1) is a tower of III factors such that [Mn+l : Mn] is independent of n; and that in case (ii), it is a tower of finite-dimensional C*-algebras. In either case, we see that U Mn comes
equipped with a tracial state tr (whose restriction to Mn is trMJ; in fact this is the unique tracial state on U Mn, and consequently we see that M,,, _ nrt,(U Mn)" is a III factor (which is hyperfinite in case (ii), and also in case (i) provided that each of Mo and M_1 is). EXAMPLE 3.3.1 (i) Suppose M_1 = Cl C MN(C) = Mo; then the inclusion
matrix Am', is the 1 x 1 matrix [N]. It follows that Mn_1 - MN. (C) on MN (C) do > 0, and we find that M,),, = R(N). If we identify Mo with the subalgebra MN(C) 0 1 of MN(C) 0 MN(C) = M1, then the projection el is given, in terms of the usual system {eij} j=1 of matrix units of MN(C), by the formula el = N N_I eij ®eij. (ii) (In a sense, this is a `square root' of the last example.) 1] and it follows Suppose M_1 = C1 C_ CN = Mo. Then AM 1 = [1 1 MN-() do > 1. If we think of Mo as the diagonal subalgebra that M2n_I of MN(C) = M1, then the projection el is the N x N matrix with all entries equal to N The sequence {en}°n°_1 of projections plays a central role in the theory of
subfactors. We list below some properties of this sequence.
PROPOSITION 3.3.2 Let {en}' 1 be the sequence of projections in the IIl factor Mme, constructed, as above, from an initial inclusion M_1 C_ Mo which
falls into either case(i) or case (ii). Write tr for the unique tracial state on
M. Then: (i) the number T = tr en is independent of n; further, 1_ T
[Mo : M_1] IAMo I
1
I I2
in case (i), in case (ii);
(ii) tr(xen) = T tr x Vx E Mn_1, n > 1; (iii) en E M;,_2 fl Mn do > 1, and in particular, ene,n = emen
(iv) en+lenen+l = Ten+I do > 1; (v) even+1en = Ten do > 1.
if Im - nj > 1;
3.3. THE PROJECTIONS EN AND THE TOWER
43
Proof: The Markov property and the fact that e,,, has trace equal to T are proved in Proposition 3.1.2 (for case (i)) and Proposition 3.2.3 (for case (ii)); this takes care of (ii) and (i). Assertion (iii) is a consequence of Proposition 3.1.2 (i). (iv) Since tr restricts, on M,,,, to trMM, it follows from equation (3.1.1) that en+Ixen+i = EMn_1(x)e,,,+i Vx E M,,,; in particular, if we choose x = e,,, and use the already proved (ii), we get (iv). (v) It follows from (iv) that u = T-2e,,,en+1 is a partial isometry in Mme, with initial projection given by u*u = en+1 The final projection of u clearly satisfies uu* < e,. On the other hand, we must have
T = tr en > tr(uu*) = tr(u*u) = tr en+i = T; thus we must have tr uu* = tr en; since tr is a faithful trace, this implies that uu* = en, as desired.
Notice the two expressions for T in Proposition 3.3.2(i); this is just an indication of the deeper relationship between index of subfactors and squares of norms of non-negative integer matrices. Parallel to Theorem 2.3.8, there is an old result which is essentially due to Kronecker - see [GHJ] - which says that if A is a finite matrix with integral entries, then 11A11 E {2 cos
n n = 2,3,4,
} U [2, oo].
To better understand this statement, recall that - exactly as the inclusion matrix AA is related to the Bratteli diagram for the inclusion A C_ B of finite-dimensional C*-algebras - there is a bijective correspondence between finite matrices with non-negative integral entries and finite bipartite (multi-) graphs. The matrix G which corresponds to a bipartite graph G is referred to as the `adjacency matrix of 9' and JI( Cl will also be called the norm of the graph 9. Closely tied up with Kronecker's theorem (and the well-known classification of Coxeter graphs or Dynkin diagrams) is the fact that the only (bipartite) graphs with norm less than two are the ones listed below, where the subscript refers to the number of vertices in the graph. An Dn
-0 ... 0- ... a I
I
44
CHAPTER 3. SOME BASIC FACTS
Now return to the case of a general initial inclusion M_1 C_ Mo (which falls into case (i) or case (ii)). Let e,,, ,r be as in Proposition 3.3.2(i). (Thus, according to the foregoing discussion and Theorem 2.3.8, either 7-1 _> 4 or 71 = 4 cost , for some integer m > 3.) Consider the algebras defined by Q /,r_11 n
_
{ C
ifn>0, "
if n E{-1, 0}.
(This notation turns out to be justified, as the following discussion shows.) It is an easy consequence of the properties in Proposition 3.3.2(iii), (iv) and (v) that each Qn(T-1) is finite-dimensional. It turns out - see [Jonl] for details - that for any T < 1, the Bratteli diagram for the tower {Q-(T-1)}° _1 is given by a 'half-Pascal-triangle', and that the Bratteli diagram for the tower {Q,(4 cost M)}- -1 is obtained by starting with the half-Pascal-triangle and slicing it off in a vertical line between the vertices labelled (m-3) and (m-2). (The cases m = 4, 5 have been illustrated below.)
T-1 > 4
T 1 = 4 COS2
4
T 1 = 4 cost
The analysis in [Jonl] goes on to show that if r = 4sec2, where m > 3, the algebra UQn(T-1) admits a unique tracial state, and hence has a copy Ro of the hyperfinite h i factor as a von Neumann algebra completion (meaning weak closure of its image under the associated GNS representation); and if R_1 denotes the von Neumann subalgebra of Ro generated by {en : n > 2}, then R_1 is a subfactor of Ro such that [Ro : R_1] = T-1. Most of what was said in the last paragraph is also true when T < 2 (and
is proved in [Jonl]); the only statement that needs to be modified is that when T < 2, it is no longer true that UQ,, (T-1) admits a unique trace, but it is true nevertheless that the completion of UQn(T-1) with respect to the GNS representation associated with the Markov trace is the hyperfinite factor R.
45
3.3. THE PROJECTIONS EN AND THE TOWER
Hence, in order to exhibit a subfactor of R with index 4 cos' , it suffices to find an inclusion M_1 C Mo whose Bratteli diagram has norm 2 cos and pick an inclusion with this and for this, we may choose the graph then R_1 C Ro meets our requirements. as Bratteli diagram - and Before concluding this section, we wish to point out that if'r, R_1i Ro are as above, we have an instance of simultaneous approximation of the subfactorfactor inclusion R_1 C Ro by finite-dimensional inclusions in the following sense : (el)
C
U C
(e1, e2)
C
...
C
U C
(e2)
(e1,e2i...
en)
C
U
U C
...
C
(e2i ... efl)
Ro
C
R-1
Chapter 4 The principal and dual graphs 4.1
More on bimodules
Suppose M, P are arbitrary von Neumann algebras with separable pre-duals, and suppose 7-l is a separable M-P-bimodule. Pick some faithful normal state co and set 7-ll = L2(M, cp) and 7-l = 7-l® ®Q2. It follows from Theorem 2.2.2 that 7-l may be identified, as a left M-module, with 7-l,,.q for some projection
q E M(M) (which is uniquely determined up to Murray-von Neumann equivalence in MO(M)); further, we have MG(R) = 7rT(Moo(M)q). Since 7i
is an M-P-bimodule, it follows from our identification that there exists a normal unital homomorphism B : P -> such that the right action of P is given by y = 60(y). Conversely, given a normal homomorphism B : P -> M(M), let 7-I, denote the M-P-bimodule with underlying Hilbert space 7-I 9(1), and with
the actions given, via matrix multiplication, by m 6 p = m,B(p). The content of the preceding paragraph is that every separable M-P-bimodule is isomorphic to 7-t for suitable B.
If M is a factor of type III, then so is MO(M), and hence every non-zero projection in MO(M) is Murray-von Neumann equivalent to 1M 0 ell. Consequently, every M-M-bimodule is isomorphic to 7-i for some endomorphism
9:M-*M.
Suppose M and P are II, factors and suppose 7-t is as above. (In this case, we naturally take cp = trM.) Notice then that dimM-f is finite precisely when Tr 0(1) < oo, while dim_p 7-l is finite precisely when the index [M, (M), : B(P)] is finite. This suggests that we define a co-finite morphism of P into M as a normal homomorphism B : P -* M(M) such that (i) 0(1) is a finite projection, say q, in MO(M), and (ii) B(P) has finite index in M,,(M)q. The point is that if B is a co-finite morphism of P into M, then 7-t = 7-I 9(1) is a bifinite M-P-bimodule, and every bifinite M-P-bimodule arises in this fashion. Motivated by the case of automorphisms, we shall say that two co-finite
morphisms Bi, i = 1, 2, of P into M are outer equivalent if there exists a
48
CHAPTER 4. THE PRINCIPAL AND DUAL GRAPHS
partial isometry u c MO(M) such that u*u = 01(1), uu* = 02(1) and 02(x) = u01(x)u* Vx E P; this is because, with this definition, two co-finite morphisms 0; from P into M are outer equivalent if and only if the corresponding bifinite M-P-bimodules 7-la, are isomorphic. We wish, in the rest of this section, to discuss two operations - one unary (contragredient) and one binary (tensor products) - that can be performed with bimodules. (In the latter case, we shall restrict ourselves to the case when both the algebras in question are II1 factors.) Contragredients: Suppose 7-l is an M-P-bimodule. By the contragredient of 7-l, we shall mean any P-M-bimodule 71 for which there exists an anti- unitary p) = p* J m*. It is clear that such operator J : 7-1 -> 77 such that J(m a contragredient exists and is unique up to isomorphism.
Note that if 7-l = 7-lai and if 7-1 = 7-te, then 0 : P -* MO(M) while M -> MA(P), and the relationship between the morphisms 0 and B is somewhat mysterious. However, in the simple case when M = P and 0 is an automorphism of M, it is easy to verify that 8 (which is, after all, only determined up to outer equivalence) may be taken as 0-1. (The reader should have no difficulty in constructing a J which establishes that 7L -i is a 0
contragedient of R O.)
Tensor products: We shall discuss tensor products of bifinite bimodules over II1 factors. First, however, we want to single out a distinguished dense subspace of such a bimodule, namely the one consisting of the so-called bounded vectors.
Suppose, to be specific, that M, P are II1 factors and that 7-l is a bifinite M-P-bimodule. Say that a vector E 7-l is left-bounded (resp., right-bounded) Ktrp(p*p) Vp E P if there exists a constant K > 0 such that KtrM(m*m) Vm E M), or equivalently, if there exists a (resp., bounded operator Le L2(P) -* 7-l (resp., Re : L2(M) -* 7-l) such that :
Vp E P (resp., R (m12) = m Vm E M). It is true that a vector is left-bounded if and only if it is right-bounded. (Reason: assume 7-l = 7-te, for a co-finite morphism 0 : P -> M,,(M); thus a vector in 7-l is E (Mat1,,,,(L2(M))0(1); it follows easily from of the form = Theorem 1.2.4(1) - and the fairly easily proved fact that if Po is a subfactor of P of finite index, then a vector is left-bounded for the right action of P if and only if it is left-bounded for the right action of PO - that the above vector satisfies either of the boundedness conditions above precisely when each co-ordinate has the form i = xiSl for some xi E M.) Thus we may talk simply of bounded vectors. We shall denote the collection of bounded vectors in the bifinite bimodule 7-t by the symbol 7-10. We list some properties of the assignment 7-l F-+ 7-lo in the following prop o-
sition, which is easily proved by considering the case of the model 7-1g. (In any case, complete proofs of all the assertions in this section may be found,
4.1. MORE ON BIMOD ULES
49
for instance, in [Sun3]; actually, only the case M = P is treated there, but the proofs carry over verbatim to the `more general' case.) PROPOSITION 4.1.1 (a) Let M, P be IIl factors and let 7-l, K denote arbitrary bifinite M-P-bimodules. Then Ho is an M-P-linear dense subspace of R, and the assignment T F--/ T0 defines a bijective correspondence between the Banach space MIP(R, K) and the vector space MLP(R0i Ko) of M-Plinear transformations between the vector spaces Ho and 1C0. (b) There exists a unique mapping (i;, 71) F-4 rl)M from 7-lo x 7-lo into M, referred to as the M-valued inner product on the bimodule R, which satisfies the following properties, for all , rl, C E 7-lo, m E M, p E P:
(i)
rttl) =
(ii)
M
(iii)
rl)M) 0.
rl)M = (07, 0 M)*.
(iv) (m . + (, rl)M = (v)
77) M) + (c, 77) M.
-p*)M.
As has been already remarked, if R = R8, then we may identify 7-lo with Matlxn(M)9(1), and in this case, ((xi, ... , xn), (yi, ... , yn))M = E xiy2 i
Further, if K = R0, then the typical element of MLp(R, K) is of the form
is a matrix satisfying 9(p)T = T¢(p) Vp E P. One reason for introducing the M-valued inner product is to facilitate the formulation of the universal property possessed by the tensor product.
" fT (matrix multiplication), where T E
PROPOSITION 4.1.2 Suppose M, P and Q are IIl factors, and suppose 7i (resp., K) is a bifinite M-P-bimodule (resp., P-Q-bimodule). Then there exists a bifinite M-Q-bimodule, denoted by 7-l®pK, which is determined uniquely up to isomorphism, by the following property: There exists a surjective linear map from the algebraic tensor product7L00 KO onto (7-l ®p K)0, the image of ® rl being denoted by ®p rl, satisfying:
(a) 'p®prl (b)
(c) (S ®p 77, S' ®p 71,)M = (S - 0, Op, 0M.
CHAPTER 4. THE PRINCIPAL AND DUAL GRAPHS
50
The useful way to think of these tensor products is in the reformulation in terms of co-finite morphisms. Suppose, to be specific, that 7L = 7-Ho,1C = 7-14,
for some co-finite morphisms 0 : P -* M,, (M), 0 : Q -4 M,, (P). It is not hard to see that the equation (0 ® I)ij,kl(q) = Oik(Ij1(q))
(4.1.1)
defines a normal homomorphism 0 ®0 : Q - M,,,,,(M); it is further true (although co-finiteness requires some work) that 0 ®0 is a co-finite morphism
from Q into M and that 7-le®o = 7-i ®p 'Ho. In particular, in the special case when M = P = Q and 0, 0 E Aut(M), we find the reassuring fact that
B®Qi=9o0. Another immediate consequence of the morphism description of the tensor product is the multiplicativity of dimension under tensor products, meaning that if 7i (resp. K) is an M-N- (resp., N-P-) bimodule, then dimM_ (7-l ON K) = dimM_ 7-l dimM_ K
(4.1.2)
dim_p(7-l ON)C) = dim-NH dim_p)C.
(4.1.3)
and
4.2
The principal graphs
We assume throughout this section that N C_ M is an inclusion of 11, factors
such that [M : N] < oo, and that (4.2.1)
for n > 0. It follows from Proposition 2.3.12 that {Mi n Mj : -1 < i < j} is a grid of finite-dimensional C*-algebras, which is canonically associated with the inclusion N C M, and is consequently an `invariant' of the initial inclusion. It turns out see Proposition 4.3.7 - that there is a periodicity of order two and hence we need to consider only i = -1 and i = 0. and belongs to N' n Let us consider = -1 first. Notice that is the tower of the basic construction, with M,,,+1 = (Mn,
implements the conditional expectation of N' n Mn onto N' n M,,,_1. It follows contains a copy of the basic construc- from Lemma 5.3.1(b) - that C_ (N' n M,,,), and consequently the Bratteli tion for the inclusion (N' n C (N' n M,,+1) contains a `reflection' of diagram for the inclusion (N' n C (N'nM,,). The graph obthe Bratteli diagram for the inclusion
tained by starting with the Bratteli diagram for the tower {N'nM : n > -1} of relative commutants, and removing all those parts which are obtained by reflecting the previous stage, is called the principal graph invariant of the inclusion N C M. A similar reasoning also applies for i = 0, and the resulting graph is called the dual graph invariant of the inclusion N C M.
4.2. THE PRINCIPAL GRAPHS
51
We shall now give an alternative description of these two graphs, using the language of bimodules. (The equivalence of these two descriptions is established in §4.4.)
The principal graph is the bipartite multi-graph 9 defined as follows: the set gi°) of even vertices is indexed by isomorphism classes of irreducible N-N-bimodules which occur as submodules of NL2(M.M)N for some n >
1; the set g(1) of odd vertices is indexed by isomorphism classes of irreducible N-M-bimodules which occur as submodules of NL2(M.M)M for some
n > 1; the even vertex labelled by the irreducible N-N-bimodule X is connected to the odd vertex labelled by the irreducible N-M-bimodule Y
by k bonds, if k is the multiplicity with which X occurs in the NN-bimodule Y. The dual graph is the bipartite multi-graph it defined as follows: the set 'H(o) of even vertices is indexed by isomorphism classes of irreducible M-Mbimodules which occur as submodules of ML2 (M,)M for some n > 1; the set i-l(l) of odd vertices is indexed by isomorphism classes of irreducible M-Nbimodules which occur as submodules of ML2(M.M)N for some n > 1; the even vertex labelled by the irreducible M-M-bimodule X is connected to the odd vertex labelled by the irreducible M-N-bimodule Y by k bonds, if k is the multiplicity with which Y occurs in the M-N-bimodule X.
It is a consequence of Proposition 4.3.7 that the principal (resp., dual) graph for the inclusion M C M1 may be identified with the dual (resp., principal) graph for the inclusion N C M. Hence any result concerning the principal graph has a corresponding statement about the dual graph. So we shall restrict ourselves, in this section, to making some comments concerning the principal graph. The principal graph has a distinguished vertex *G which corresponds to the even vertex indexed by the isomorphism class of the standard bimodule NL2(N)N. Notice that the odd vertices at distance 1 from *G are indexed by isomorphism classes of irreducible N-M-submodules of NL2 (M)M; hence the case of irreducible subfactors corresponds to the case where *G has a unique neighbour. Further, since the tensor product of bifinite bimodules is a direct sum of only finitely many irreducible submodules, it follows from the description of the principal graph that each vertex in 9 has only finitely many edges incident on it; thus the principal graph is a locally finite connected pointed bipartite graph.
Suppose 9 is the principal graph of the inclusion N C M, as above. Let G denote the (non-negative integer-valued) 9i°> x O' matrix with gxy equal to the number of bonds joining the even vertex X to the odd vertex Y in the graph 9. We shall also sometimes use the suggestive notation gxy = (X, Y). Even if the graph 9 is infinite, the local finiteness of g translates into the fact that the matrix G has only finitely many non-zero entries on any row or column.
52
CHAPTER 4. THE PRINCIPAL AND DUAL GRAPHS
We are now ready to prove an important relation between the index of the subfactor and the norm of the matrix G, which will, in particular, reduce the statement in Theorem 2.3.8 concerning the restriction on index values of subfactors to the classification of graphs of norm less than 2.
PROPOSITION 4.2.1 Let N C M be an inclusion of III factors such that [M : N] < oo, and let G, 9 be as above. (i) G defines, via matrix multiplication, a bounded operator from £2(g(')) into £2(g(0)), with IGII2 < [M : N]. (ii) If [M : N] < 4, then G is necessarily finite and is one of the Coxeter diagrams A,, D,, E6i E7 or E8. Proof: (i) In order to prove (i), we shall prove the clearly equivalent statement that GG' defines a bounded self-adjoint operator on 22(c(°)) with norm
at most [M: NJ. It is a consequence of the `Frobenius reciprocity' statement contained in Proposition 4.4.1 that (NXN) ON (NL2(M)M)
® (X, Y) - NYM, VX E G(°), YE9(1)
where we write m 7-1 to denote the direct sum of m copies of the module H. Equating left and right dimensions, we get
[M: N] dimN_ X = E gxY dimN_ Y, VX E g(°),
(4.2.2)
YE9(1)
and
dimN X = E gxY dim_M Y, dX E g(°).
(4.2.3)
YE9(1)
Similarly, we find that
(X, Y) NXN VY E
(NYM) ®M (ML2(M)N) XE9(0)
Equating dimensions, we get
dimN_ Y = i gxY dimN_ X, VY E 9(l),
(4.2.4)
XEc(°)
and
gxY dimN X, VY E
[M : N] dim_M Y =
(4.2.5)
XE9(0)
It is an immediate consequence of equations (4.2.2) and (4.2.4) that if we define vX = dimN X, VX E g(°), then v is a (column-) vector indexed by 90) such that (GG')v = [M: N]v. On the other hand, it is a consequence of the Perron-Frobenius theorem - see [Gant], for instance - that if the adjacency matrix of a connected graph
4.2. THE PRINCIPAL GRAPHS
53
has a positive eigenvector, then that adjacency matrix defines a bounded operator (on the Q2 space with basis indexed by the vertices of the graph) with norm bounded by the eigenvalue afforded by the positive vector. This completes the proof of (i).
(ii) If [M : N] < 4, it follows from (i) that G < 2, and we may appeal to the classification of matrices of norm less than 2 - see the discussion in §3.3.
We now discuss some examples of principal graphs. EXAMPLE 4.2.2 Let N = (1, e2, e3, ) C M = (1, ei, e2, ), as in §3.3. It is a consequence of a result called Skau's lemma - see [GHJ] for details - that = A,,_1 if [M : N] = 4 cost ; thus, in these cases, we find that the Bratteli diagram for the tower {N' fl M,,, : n > -1} is precisely the truncated Pascal triangle of §3.3. (Since N' n M,,, (1, e1, , en), this means, in view of the description of the Bratteli diagram for the tower {Q.(T 1)} discussed in §3.3, that the inclusion above is actually an equality.) When [M : N] > 4, however, things are quite different - see [GHJ] - and the principal graph turns out to be A_........ which is the infinite path extending
to infinity in both directions, so that we have a strict inclusion N' fl Mn D (1, el, , en) in this case, and the Bratteli diagram for the tower {N' fl Mn n > -1} turns out to be the full Pascal triangle. EXAMPLE 4.2.3 Suppose G is a finite group acting as outer automorphisms
of a III factor P. (i) Let N = P C P x G = M. In this case, the principal graph is an n-star (where n = IGI) with all arms of length one; thus, for instance, if IGI = 3, the principal graph is just the Coxeter graph D4.
(ii) Let N = PG C P = M be the subfactor of fixed points under the action. Then the principal graph 9 has one odd vertex and the even vertices are indexed by the inequivalent irreducible representations of G, with the even vertex indexed by it connected to the unique odd vertex by d, bonds, where d denotes the degree of the representation ir.
It is a fact - see §A..4 - that if Ml = (M, eN) is the result of the basic construction, then the inclusion M C Ml is isomorphic to the inclusion M C_
M x G, and hence the discussion in the previous paragraph amounts to a description of the dual graph of the case considered in (i).
(iii) More generally than in (i) and (ii), if H is a subgroup of G, we could consider the case N = P x H C P x G = M. This case is treated in §A.4, where the principal and dual graphs are explicitly computed, using the bimodule approach. EXAMPLE 4.2.4 Suppose {O
, , G } is a set of automorphisms of R, which is closed under the formation of inverses. It has then been shown by Popa -
CHAPTER 4. THE PRINCIPAL AND DUAL GRAPHS
54
see [Pop6] - that if
N=
x
0
..
0
01(x)
...
0
0
0 0
:xER CM,,+1(R)=M
0,,(x) j
denotes the so-called `diagonal subfactor' (given by the O 's), then the principal graph is described by what might be called the Cayley graph of the subgroup of Aut(R)/Int(R) generated by the O 's - where Int(R) denotes the group of inner automorphisms of R.
4.3
Bases
We assume in the rest of this chapter that N C M is a finite-index inclusion of III factors, and that
N=M_1CM=Mo9M1C...CM.CM.+IC...
(4.3.1)
is the tower of the basic construction, with M,, = (M,i_1i en,) for n > 1. Also
we use the notation r = [M : N]-I. Further, we shall identify M with the dense subspace M1 of L2(M). We begin with a very useful fact.
LEMMA 4.3.1 (i) If x1 E MI, there exists a unique element xo E M such that x1e1 = xoeli this element is given by xo = T-IEM(xlel). (ii) The action of M1 on L2(M) is given by xl(yoPM) = T-'EM(x1yoe1)1M
Proof: (i) Since EM(el) = T, the second assertion and the uniqueness in the first assertion follow. As for existence, we need therefore to show that T-IEM(xlel)el = x1e1 for all x1 E MI. Since the two sides vary (strongly) continuously with x1, it suffices to establish this equality for a dense set of x1's. Note that the set D = {ao + Ti 1 bielci ao, bi, ci E M, n E N} is a self-adjoint subalgebra of M1 which contains M U fell and is consequently strongly dense in MI. Finally it is easily verified that if x1 E D, then the desired equality is indeed valid. (ii) Again, we may assume that x1 E D, as above, and the desired equality :
is easily verified.
REMARK 4.3.2 (a) The proof shows that the preceding lemma is also valid when N C_ M is an inclusion of finite-dimensional C*-algebras, provided the trace we work with is a Markov trace.
4.3. BASES
55
(b) It follows from Lemma 4.3.1 (i) that the set of finite sums of elements
of the form aoelbo, where ao, bo E M, is an ideal in M1 and must consequently be equal to all of M1 by Proposition A.3.1. This shows that there is an isomorphism 0: M ON M , M1 such that q(ao (&N bo) = aoelbo PROPOSITION 4.3.3 Fix n > [M : N]. (a) Suppose q E Mn(N) is a projection such that there exist Al, , ) E M such that
qij = EN(A)) Vi, j.
'v
. Then (4.3.2)
A collection {a1i , An} C M will be called a basis for M/N if the matrix q = ((qij)) defined by equation 4.3.2 above is a projection in Mn(N) such that tr q = M:N n (b) Let {A1i , An} C M be basis for M/N. Let x E M be arbitrary. Then,
(i) x = j 1 EN(x)j))j; (xi,
,
(ii) the row-vector (EN(xAf), belongs to Mlx,,,(N)q; and if , x..) E Mi (N)q satisfies x = E 1 xiAi, then xj = Vj; (iii) further, J:' l A eAi = 1.
Proof:
(a) Let q = ((qij)) E Mn(N) be a projection such that trq = M:N n
Consider the projection E = ((Eij)) E MM(M1) defined by Eij = bije; notice that q and E are commuting projections, and so p = qE is also a projection in the II1 factor Mn(M1). Observe next that
trp =
1
n
tr (giie) = Ttr q =
n a=1
1
n
= tr ell,
where ell denotes the projection in M.M(M1) with (1,1) entry equal to the identity 1, and other entries equal to 0. Hence the projections p and ell are Murray-von Neumann equivalent in Mn(M1); thus, there exists a partial isometry v E Mn(M1) such that v*v = ell and vv* = p; the condition v*v = ell clearly implies that v has the form
v=
v1
0
...
0
v2
0
...
0 (4.3.3)
vn
0
.
0
0
..
0
for uniquely determined v1, , vn E M1. By definition of the vi's, we have
v vi = 1 i=1
(4.3.4)
CHAPTER 4. THE PRINCIPAL AND DUAL GRAPHS
56
and viva = gij e Vi, j
(4.3.5)
In particular, note that vivz = qiie < e, and hence, we must have vi = evi. Then, by the preceding Lemma 4.3.1, there exists a unique )i E M such that vi = eAi Vi. Deduce that gije = eAiA*e = EN(AiA )e, thereby establishing (a).
Before proceeding to (b), we wish to point out that every `basis for M/N' arises in the manner indicated in the proof above. (Reason: Suppose 1/\1, - ', fin} C M is basis for M/N. Define vi = eAi, and define v E by equation 4.3.3; it is then seen that vv* = qE, so that v is a partial isometry; also, it follows that the matrix v*v has 0 entries except at the (1,1) place, and that the (1,1) entry must be f, for some projection f E Ml, which satisfies trf = 1; in other words, v*v = ell, as desired.) (b) To start with, note that (iii) is an immediate consequence of equation 4.3.4 (and the fact that vi = eAi). As for (i), if x E M is arbitrary, then
ex =
n
exvi vi i=1 n
ex,\ eAi i=1
n
e(Y EN(x1\i)Ai), i=1
and deduce from Lemma 4.3.1(i) that x = 1 EN(x,2 )A . Note next that if x E M and if 1 < j < n, then, n
e(> EN(x)\i )qij) i=1
ex,\ egij i=1 71
exA eEN(AiA*) i=1 exA e\iA*e i=1
= ex.\ e eEN(xAj),
and it follows (again from Lemma 4.3.1(i)) that (YEN (xAi)gij) = EN(xAj) i=1
4.3. BASES
57
in other words, the row vector (EN(x)i), Mix.(N)q. Conversely, if (x1,
,
that
, EN(x)*)) indeed belongs to
x,,,) E Ml,,,,, (N) q, and if x = E l xiAi, then observe n
EN(xAj) = i=1 n
EN(xiAiA-) xiEN (Ai )*)
i=1
xj,
thereby establishing (ii) and hence the proposition. A collection {A1, , .Xn} C M which satisfies the condition (i) of the above proposition is, strictly speaking, a `basis' for M, viewed as a left Nmodule, and should probably be called a 'left-basis' (as against a right-basis, which is what the set of adjoints of a 'left-basis' would be); but we shall stick to this terminology. The above proposition is a mild extension of the original construction of a basis (in [PP]). (They only discuss the case when the projection q of the proposition has zero entries on the off-diagonal entries.) The reason for our mild extension lies in Lemma 4.3.4(i) and the consequent Remark 4.3.5. We omit the proof of the lemma, which is a routine verification.
LEMMA 4.3.4 (i) If N C M C P is a tower of Ih factors, with [P : N] < oo, and if {)i : 1 < i < n} (resp., {rlj : 1 < j < m}) is a basis for M/N (resp.,
P/M), then {)irlj 1 < i < n, l < j < m} is a basis for P/N. (ii) If {al, , Xn} is a basis for M/N, then {T 2 e) j 1 < j < n} is a basis for M1/M; hence {T-2Aie,Aj : 1 < i, j < n} is a basis for M1/N. :
REMARK 4.3.5 Notice, from Lemma 4.3..4(ii), that any element of M1 is expressible in the form E j=1 aijaieaj, with the aij's coming from N, which is a slightly stronger statement than the fact - see Remark 4.3.2(b) - that elements of the form aelb, with a, b E M, linearly span M1. Also, an easy induction argument shows that if {Ai : i E If is a basis for M/N, and if we define, for i = (i1, , ik) E Ik k > 1,
A1 =T
a
AilelAi2e2elai3.Aik
lek_l...elAik
then {X(k) : i E Ik} is a basis for Mk_1/N.
,.2k) for i, j E Ik, Notice next, that if we write i V j = (i 1, , ik, jl, it follows from the commutation relations satisfied by the en's - see Proposi-
tion 3.3.2 - that AiVj = T 2 .\j (ek ... el)(ek+l ... e2) ... 2
(e2k-1 ... ek)AJk)
CHAPTER 4. THE PRINCIPAL AND DUAL GRAPHS
58
This equation, together with the second statement in Lemma 4.3.4, should suggest that we might expect the validity of the next result. PROPOSITION 4.3.6 If Mi, ei are as above, then, for each m > 0, k > -1, the algebra Mk+2m is isomorphic to the result of the basic construction applied to the inclusion Mk C Mk+m,, with a choice of the projection which implements the conditional expectation of Mk+m, onto Mk being-given by e [k,k+m]
__(M-1) T
2
(ek+m+lek+m
ek+2) (ek+m+2 ... ek+3) ... (ek+2m
ek+m+1)
Proof: This is true basically because of the relations satisfied by the projections e,,,. As for the proof, there is no loss of generality in assuming that
k = -1. Rather than going through the proof of the proposition in its full generality, we shall just present the proof when k = -1, m = 2; all the ingredients of the general proof are already present here, and the reader should not have too much trouble writing out the proof in its full generality. In any case, the proof may be found in [PP2].
Thus we have to show that N C Ml C M3 is an instance of the basic construction, with a choice of the projection implementing the conditional expectation of Ml onto N being given by f = T-1 e2ele3e2First, the fact that el commutes with e3 implies that f * = f ; and f2 = T-2e2e1e3e2e3e1e2 = T-1e2e1e3e1e2 = f,
so f is indeed a projection. Next, for any xl E M1, note that Jx1f
T- 2e2e1e3e2x1e2e3e1e2
T_2e2e1e3EM(x1)e2e3e1e2
T-1e2e1EM(x1)e3e1e2
T_ Ie2elEM(xl)ele3e2 T- Ie2EN(x1)e1e3e2,
and hence, indeed, we have
fx1f = EN(xl)J dx1 E Ml. It follows that there exists a (unique) normal homomorphism it from P = (Ml, eN1) (the result of the basic construction for the inclusion N C_ Ml) onto
Pl = (M1 U If })", such that ir(eN') = f and lrlM, = idM,. (The normality, as well as the fact that image is a von Neumann algebra, may be deduced from the second statement in Lemma 4.3.4(ii).) Since P is a III factor, it follows that it is an isomorphism and that Pl is a III subfactor of M3 such
4.4. RELATIVE COMMUTANTS VS INTERTWINERS
59
that [P1 : M1] = [M1 : N] = [M3 : Ml]. This means that [M3 : P1] = 1, and the proof is complete.
We conclude this section with a proposition, due to Pimsner and Popa, which shows that the basic construction lends itself to a nice `duality' result, which, among other things, yields the `periodicity of order two' in the tower of the basic construction, which was referred to in §4.2. PROPOSITION 4.3.7 ([PP1]) Let d = [M : N]. Then, for each n > -1, there exists an isomorphism of towers:
(Md(N)9Md(M)c...cMd(M,M))-(M1cM29...cMn+2). Proof: We prove the case n = 0; the general case is proved similarly, by using Remark 4.3.5. Fix a basis {A1, , A,,j for M/N. Let q = 9(1), where Bij(x) = EN(Ais) ) Vx E M, and consider the model gM,,,(N)q of Md(N). Define c : Md(N) _ Ml by
= 0((a'ij))
n
E A aijeAj. i,j=1
An easy computation shows that 0 is a unital normal homomorphism, which is necessarily injective. As for surjectivity, if x1 E M1, deduce from Proposition 4.3.3(b)(iii) that
Si = (EAZel.i)xl(EA e,Aj) =
j
i
E Ai (e,AixA*el)Aj; i,j
but by Lemma 4.3.1(i), there exists mij E M such that mije1 = Aix1.\j*el. It is then clear that x1 = 0((EN(mij))), thereby establishing the surjectivity of 0. Now apply the conclusion above, to the basis {-r-2el.i} for M1/M, to find an isomorphism 01 : Md(M) -+ M2 defined by
gi((mij)) =T 1 E Aielmije2ejAj, i,j=1
which restricts on Md(N) to the map 0 defined above, thus proving the proposition.
4.4
Relative commutants vs intertwiners
This section is devoted to establishing the equivalence of the two descriptions of the principal graphs given in §4.2. We shall consistently use the symbols x,,,, y,,, etc., to denote elements of M. M.
CHAPTER 4. THE PRINCIPAL AND DUAL GRAPHS
60
PROPOSITION 4.4.1 (i) For each n > 0, there exists an isomorphism of squares of finite-dimensional C*-algebras, as follows:
N' n M2n c N' n M2n+1
NLM(L2(Mn)) c NLN(L2(Mn))
=
U
U
M' n M2n c M' n M2n+1
U
U
MGM(L2(Mn)) c MGN(L2(M.))
(ii) For each n > 0, there exists an Mn-M-linear unitary operator un :
ON (NL2(M)M)
(M,L2(Mn+1)M)
(iii) The composite maps
N' n M2n+1 c N' n M2n+2
NLM(L2(Mn+1)),
MLN(L2(Mn)) = Mn M2n+1 C M' n M2n+2
=+ MLM(L2(Mn+1))
NLN(L2(Mn))
are given, in either case, by the formula T F--> un(T ON idL2(M))u*n.
Proof: (i) Appeal first to Proposition 4.3.6 to note that N C_ Mn C M2n+1
(resp., M C Mn c M2n) is an instance of the basic construction, and hence M2n+1 = JM N'JMn, so that (N' n M2n+1) = (N' n JMN'JMj = NLN(L2(Mn)). Similarly we can argue that each of the four corners in each square of algebras, displayed in (i) above, is isomorphic to the corresponding corner in the other square. Completing the proof is just a matter of ensuring that the various isomorphisms are compatible. For this, use Lemma 4.3.1(ii) and Proposition 4.3.6 to find that if we define 0, : M2n+1 ---> G(L2(Mn)) by (0n(x2n+1))(xnQMn) = T-n-'EMn(x2n+lxne[-1,n])IMn,
then Wn (M2n+1) = JM N' JMn and cn Mn = idMM. A pleasant exercise involving the commutation relations satisfied by the en's, coupled with a judicious use of a combination of Lemma 4.3.1(i) and Proposition 4.3.6, as well as such identities as e[k,k+m] =
T-(m-1)e[k+l,k+m]ek+2ek+m+3
' '
' ek+m(ek+2m ' ' ' ek+m+1)i
leads to the fact that if x2n E M2n, then (cbn(x2n))(xnQMn) =T-nEMn(x2nxne[0,n])QMn,
(4.4.1)
and consequently, as before, ¢n(M2n) = JMM'JMM, and this ¢n does all that it is supposed to. (ii) Recall that if P is any h i factor, and if P0, Qo are any two subfactors of finite index in P, and if N = L2(P), regarded as a Po-Qo-bimodule, then
4.4. RELATIVE COMMUTANTS VS INTERTWINERS
61
71o = P and the Po-valued inner product on 7-L is given by (z, y)P0 = Epo (xy*). Define un : Mn ® M --+ M,,+, by un(X® ®Xo) = T
xnen+l...e1x0. 2
It is a consequence of Remark 4.3.5 that un is surjective. An easy computation shows that (un(Zn ® xo),un(yn ® YO)) M.
T (n+1) EMn(Xnen+l ...elxoyoel...en+lyn)
= xnEN(xoyo)yn
= (Xn
(zo, YO) N, yn)n n;
it follows from Proposition 4.1.2 that un extends to an Mn-M-linear unitary operator of (MnL2(Mn)N) ON (nnL2(M)M) onto MnL2(Mn+1)M, as desired. (iii) Note, in general, that if 7-L (resp., 1C) is an N-P- (resp., P-Q-) bimod-
ule, where N, P, Q are III factors, and if T E NLP(7-L), S E PGQ(K), then there is a unique element T®pS of NLQ(7-L(&p1C) satisfying
V E7-Lo,yE/Co. Hence, in order to establish the assertion for either of the composite maps, we find, when all the definitions have been unravelled, that it suffices to verify that for arbitrary xj e M;, j E {0, n, 2n + 1}, we have (4.4.2)
0n+1(x2n+1)T2un(xn ON x0) =T 2 Un(4'n(x2n+1)zn ON zo).
The definitions imply that the right side of equation (4.4.2) is equal to T
-n-1
e1X0;
on the other hand, it follows from equation (4.4.1) that the left side of equation (4.4.2) is equal to T-(n+1) EM
+,(x2n+lxnen+l ... elXoe[o n+1])
T -(n+1) EMn+1(Xzn+lXnen+1 ... e1e[0,n+1])X0
Hence it suffices to prove that, for arbitrary yen+1 E Men+1, we have EMn+1(y2n+1en+1...ele[0n+1]) = EMn(y2n+le[-1,n])en+l
el
An appeal to Proposition 4.3.6 and Lemma 4.3.1 shows that this amounts to showing that EMn+1 (Y2n+1en+1 ... eie[o,n+1])e[0,n+1] = EMn (y2n+1e[-1,n])en+1
e1e[0,n+1],
i.e., that T
_n_1
y2n+len+1 .. ele[O,n+1] = EMn (y2n+1e[-1,n])en+1
e1e[o,n+1]
CHAPTER 4. THE PRINCIPAL AND DUAL GRAPHS
62
On the other hand, it follows immediately from the formula given in Proposition 4.3.6 that en+1 ... ele[o,n+1] = e[-1,n]e2n+2 ... en+2
Hence it follows, again from Lemma 4.3.1, that EMjy2n+le[-1,n])en+1
.
ele[0 n+1] =
T-n-1y2n+1e[-l,n]e2n+2
en+2,
and a final appeal to Lemma 4.3.1 completes the proof.
Before proceeding further, notice that if 7-l is a bifinite P-Q-bimodule, where P, Q are arbitrary III factors, then pLQ(7-l) is a finite-dimensional C*algebra. (Reason: Assume 7-l = 7-lh, for some co-finite morphism B : Q ->
Md(P), where d = dimp_71; then pLQ(7-le) = (Md(P) n 0(Q)', which is finite-dimensional in view of the co-finiteness of B.) Suppose, for notational convenience, that A = pLQ(7-l). It must be clear
that there is a bijective correspondence between P(A) and the collection of P-Q-sub-bimodules of 7-l (given by p H ran p). It follows that, under the above correspondence, the (canonical) decomposition of the identity as a sum of minimal central projections in A corresponds to the (canonical) decomposition of 7-l into its isotypical components; and that, the further (non-canonical) decomposition of a minimal central projection as a sum of minimal projections of A corresponds to the (non-canonical) decomposition
of the corresponding isotypical submodule of 7-l as a direct sum of mutually equivalent irreducible submodules. It follows that if 7-l is a bifinite P-Q-bimodule, then 7-l is expressible as the direct sum of finitely many irreducible P-Q-bimodules, and that if IC is an irreducible bifinite P-Qbimodule, then there is a well-defined multiplicity with which `IC occurs in 7-l'.
If we apply the foregoing remarks to the case when 7-l = L2(Mn), P = Q = N, we find from Proposition 4.4.1 that the minimal central projections of (N' n Men+1) are in bijective correspondence with isomorphism classes of irreducible N-N-sub-bimodules of L2(Mn). Similarly, the minimal central projections of (N'nM2n) are in bijective correspondence with isomorphism classes of irreducible N-M-sub-bimodules of L2(Mn). Further, Proposition 4.4.1(i) implies that in the Bratteli diagram for the inclusion (N'nM2n) C (N'nM2n+1), the vertex indexed by an irreducible N-M-sub-bimodule X of L2(Mn), is connected to the irreducible N-N-sub-bimodule Y of L2(Mn), by k bonds, where k is the multiplicity with which X, when viewed as an N-N-bimodule, occurs in Y. Similarly, the assertion (iii) of Proposition 4.4.1 can be re-interpreted as a version of the Frobenius reciprocity theorem, thus: the inclusion matrix for the inclusion (N' n Men+1) c (N' n Men+2) corresponds to `induction', in the same way that the inclusion matrix for the inclusion (N'nM2n) C (N'nM2n+1) corresponds to `restriction'.
4.4. RELATIVE COMMUTANTS VS INTERTWINERS
63
Similar remarks apply also for the relative commutants of M in the members of the tower of the basic construction, and we have completed the justification for the alternative description of the principal and dual graphs, in terms of bimodules, which is given in §4.2.
Chapter 5 Commuting squares 5.1
The Pimsner-Popa inequality
The `inequality' referred to in the title of this section is actually not an inequality, but a `minimax' characterisation of the index of a subfactor which can be taken as an alternative definition of the index. (This definition has the advantage of making sense for any inclusion of von Neumann algebras for which there is a conditional expectation of the bigger algebra onto the smaller.) Before getting to the inequality, we pause to record a lemma - see [Joni] - which shows that the basic construction is `generic'. LEMMA 5.1.1 If Mo C Ml is an inclusion of II, factors with [M1 : M0] < no, then there exists a subfactor M_1 such that M1 = (Mo, eM_1).
Proof: The first step in the proof is to realise L2(Mo) as an M1-module in such a way that the action of MO agrees with the standard action. To do this, start with a projection pl E Ml satisfying trp1 = [Ml Mo]-1, observe that L2(Ml)p1 is an Mo-module with dimMo(L2(M1)p1) = 1, and use an Mo-linear unitary operator u from LZ(Mo) onto L2(Ml)pl (noting that LZ(Ml)pl is actually an Ml-submodule of L2(M1)) to transfer the action of :
M1 to L2(Mo), as desired. So we may assume that M1 C L(L2(Mo)). Now define M_1 = JMIJ, where of course J denotes the modular conjugation operator on L2(Mo). Note then
that
WO :M_1]=[M'1:Mo]=IM 1J:JMMJ]=[M1:M0]. If el denotes the orthogonal projection of L2(Mo) onto L2(M_1), then el E M' 1, and so el = Je1J E M1. It follows that if P = (Mo, el), then P C_ M1 and [M1 : P] = 1; an appeal to Corollary 3.1.4 completes the proof.
We first state a weaker version of the inequality (which we prove), and later state the stronger version (which we do not prove).
CHAPTER 5. COMMUTING SQUARES
66
PROPOSITION 5.1.2 (The Pimsner-Popa inequality) If N C M is an inclusion of III factors with finite index, if EN denotes the unique trace-preserving conditional expectation onto N, and if we write T = [M : N]-', then T = sup{A > 0 : EN(x) > Ax Vx E M+}.
(5.1.1)
Proof: In the course of the proof, we shall need the following simple fact, which is an immediate consequence of equation (3.1.1), for instance: The trace-preserving conditional expectation of a finite von Neumann algebra onto a von Neumann subalgebra is completely positive - meaning that
if P C N is an inclusion of finite von Neumann algebras, and if ((aij)) (M.(N))+, n E N, then ((EP(aij))) E (MM(P))+. To prove the proposition, begin by appealing to Lemma 5.1.1, and assume that M = (N, ep), for some subfactor P of N. Let x E M+; write x = zz* for some z in M. By Remark 4.3.2(b), we may assume that z = E', xiepyi for some xi, yj E N, n E N. An easy computation now shows that n
zz* _ E xiEP(yiyj*)epxt, i,j=1 n
EN (zz*)
=
rE
i,j=1
It follows from the complete positivity of Ep (referred to at the start of this
proof) that the matrix y' = ((Ep(yiyj))) is positive. Since ep E P' n M, it follows that
zz* _ [x1 ... xn]y 2
[x1 ... xn y
= 7 -1EN(zz*).
Thus we see that ENX > rx Vx E M+. On the other hand, we know that EN(ep) = 7-1. The previous two sentences complete the proof of the proposition.
Cl
Now we state, without proof, the stronger version (see [PP1]), which states that the previous proposition is valid without the assumption of finite index.
THEOREM 5.1.3 If N C M is an inclusion of III factors, and if EN denotes the unique trace-preserving conditional expectation onto N, then
[M : N] = (sup{A > 0: EN(x) > Ax Vx E M+})-1 .
(5.1.2)
5. 1. THE PIMSNER-POPA INEQUALITY
67
We single out the amount by which Theorem 5.1.3 is stronger than Proposition 5.1.2, as a separate corollary.
COROLLARY 5.1.4 If N C M is an inclusion of IIi faictors, then [M : N] < co if and only if there exists a positive constant A such that ENX > Ax Vx E
M. The next proposition is an important first step in the computation, by approximation, of the index of a subfactor.
PROPOSITION 5.1.5 Suppose N C M is an inclusion of IIi factors. Suppose that the subfactor and factor can be simultaneously approximated by a grid of von Neumann subalgebras of M in the following sense (where 'convergence' means that the `limit' algebra is the weak closure of the union of the increasing sequence of subalgebras that form the members of the sequence of `approximants'):
C B. C
Bo C Bi C U
U
Ao C Ai C
-M U
U ...
C An C
->
N.
Define
An = \(Bn, An) = sup{.\ > 0:
E B,,+};
then
[M : N] < (limsupAn)-i. n
Proof: Consider the simple fact that if {14} n 1 is an increasing sequence of closed subspaces of a Hilbert space 7-l, whose union is dense in 7-l, and if p, denotes the orthogonal projection onto 7-h, then p,,, -> V E H. This fact has the following consequences in the context of this proposition: (i) EA,,,z -* ENZ weakly, for all z in M; and
(ii) if x E M and x,,, = EB,x, then x7, -> x strongly. Fix x E M+, and let x,,, be as in (ii) above. Let {r.,,} be a sequence in (0, 1) such that rn, -> 1 as m -> oo. Now fix an integer n, and note that since xn E B,,,,+ Vm > n, the definition of .Am ensures that EA_ (xn) > rm.\mxn Vm > n. Now use (i) and (ii) above, and conclude, by first letting m -> oo and then letting n -> oo, that ENX >_ (limsupn An)x; this completes the proof, in view of Theorem 5.1.3.
CHAPTER 5. COMMUTING SQUARES
68 A
EXAMPLE 5.1.6 Let Bo C Bl be a connected inclusion of finite-dimensional C_ Bn C denote the tower of C*-algebras, and let B0 C B1 C_ B2 C the basic construction with respect to the Markov trace. Then, as has already been observed, there is a unique trace on Un Bn and the von Neumann algebra completion of this union is the hyperfinite III factor R. Set B_1 = C, and pick arbitrary unitary elements un E B'_1 n Bn+1; it follows exactly as in Example 3.1.6 that there exists a unique normal endo(This morphism a : R -> R with the property that aIB. = construction is fairly general; for instance, if each Bn is a factor, then this is the form of the most general endomorphism of Un Bn which maps Bn into Bn+1 for all n.) Set An = a(Bn_1), n > 0, M = R, N = a(R), and note that for n > 1, we have
(An C An+1 C Bn+1) = Adu,u2...un (Bn_1 C Bn C Bn+1),
and consequently, (An C An+1 C Bn+1) is an instance of the basic construction; it follows from this and the proof of Proposition 5.1.2 that, in the notation of Proposition 5.1.5, we have, for all k > 2, Ak =
IIAII-2.
Thus, we find, by Proposition 5.1.5, that no matter what the initial sequence {un} of unitary elements is, we always have [M : N] < IIAII2 < oo. It is known - see [Jon6] and [Ake], for instance - from examples that the exact value of the index could be just about any admissible index value in the range [1, IIAI I2]; it would be very interesting to determine the exact dependence of the index on the initial sequence of unitary elements. The possible usefulness of Proposition 5.1.5 becomes enhanced in the light
of a result, due to Popa, to the effect that if N C M is an inclusion of hyperfinite III factors, then it is always possible to find finite-dimensional C*subalgebras An, Bn of M satisfying the conditions of the above proposition. Further, Proposition 5.1.5 would be even more useful, if we could sharpen
the inequality to an equality. It becomes clear very quickly, however, that it is unreasonable to expect any such equality without further conditions on the approximating grid; for instance if {An} is any increasing sequence of finite-dimensional C*-subalgebras of R whose union is weakly dense in R, and if we set Bn = An+k for some arbitrarily fixed k, then in the notation of Proposition 5.1.5, we would have N = M = R, while the numbers An could all be quite large! This leads us to the very important notion of a `commuting square of finite von Neumann algebras', which, as we shall soon see, very satisfactorily plays the role of the `further conditions' that were mentioned above. DEFINITION 5.1.7 Suppose B1 is a finite von Neumann algebra, and tr is a faithful normal tracial state on B1. Suppose Ao, Al and B0 are von Neumann
5.1. THE PIMSNER-POPA INEQUALITY
69
subalgebras of B1 such that AO C Al fl Bo, and suppose the following clearly equivalent conditions are satisfied: (i)
Bo
B1
EA, I
1 EA,
Al
AO
is a commutative diagram of maps; (i)' EA, (Bo) = Ao; (ii) Al
°->
EAO I
AO
B1 I EBo Bo
is a commutative diagram of maps; (ii)' EBo (A,) = AO; (iii) EA, EB0 = EAo;
(iii)' EB0EA, = EAo. When the preceding conditions are satisfied, we shall (often suppress specific reference to the trace tr, and simply) say that
Bo C B1 U
U
Ao C Al is a commuting square of finite von Neumann algebras. We shall discuss several examples of such commuting squares in the next section. Before that, however, we conclude this section by making a general remark about the notion of a commuting square, and then fulfil the assertion made earlier about this notion by showing that in the presence of the commuting square condition, we can sharpen Proposition 5.1.5 to the desired equality.
REMARK 5.1.8 Let us temporarily adopt the convention that if G is a directed graph without multiple bonds, then by a representation of G we shall mean an
assignment of an algebra A to each vertex v in the graph 9 and inclusion whenever e is an edge in G from v1 to v2. It can then maps ie A,,, -+ :
be shown that any tree admits an essentially unique representation, while if G has cycles, there are some 'parameters' or in other words, there is a 'moduli space'. A commuting square may be considered as a point in this moduli space corresponding to the graph given by a square.
CHAPTER 5. COMMUTING SQUARES
70
PROPOSITION 5.1.9 Suppose M, N, A,,,, B,,,, A,,, are as in Proposition 5.1.5,
and suppose further that C Bn+1
B,,
U
U
An C An,+1 is, for each n, a commuting square. Then
[M:NJ=(li A,,,)-1. Proof: The point to observe is that the result of stacking up (finitely or countably many) commuting squares is again a commuting square. The necessary formal argument is simple (and uses essentially only the simple fact about increasing sequences of projections in Hilbert space which was mentioned at the start of the proof of Proposition 5.1.5), and may be safely omitted.
5.2
Examples of commuting squares
In this section, we shall discuss three families of examples of commuting squares. Each of them is of the special form
uAlu* C A2 U
U
Ao
C Al
(5.2.1)
where (i) A0 C Al is a `connected' inclusion of finite-dimensional C*-algebras, (ii) A2 = (A1, e2) is the result of the basic construction applied to A0 C A1;
and (iii) u is a suitable unitary element in Ao f1 A2 such that (5.2.1) is a commuting square, with respect to the Markov trace on A2.
5.2.1
The braid group example
Consider the square (5.2.1), where u = (q +1)e2 - 1, for some scalar q which must necessarily satisfy Iql = 1 (in order for u to be unitary). It is an easy exercise to check that for such a u, the square (5.2.1) satisfies the commuting square condition if and only if 2+q+
q_1
= (tr e2)-1.
On the other hand, since the condition I qt = 1 clearly implies that 12 + q +
q-' < 4, this construction can work only when T-1 = 4 cost ,, for some m
>3.
The reason for calling this the `braid group example' is clarified in §A.5 of the appendix.
5.2. EXAMPLES OF COMMUTING SQUARES
5.2.2
71
Spin models
The reason that these examples are called spin models stems from statistical mechanical considerations - see, for instance [Jon3]. Consider the square (5.2.1), where we now assume that A0 = C and Al = A is the diagonal subalgebra of A2 = MN(C) - see Example 3.3.1(ii). Another
easy computation shows that in this case, the square (5.2.1) satisfies the commuting square condition if and only if Juij I = --IVi, i. V_N A square matrix u, as above - i.e., a unitary matrix, all of whose entries have the same modulus - is called a complex Hadamard matrix. The simplest exp(2ir example of such a matrix is given, for any N, by uij U)ij
where w denotes a primitive N-th root of unity. (This matrix may be called the finite Fourier transform, as it diagonalises the left regular representation of the cyclic group 7ZN.) To see that there are many complex Hadamard matrices, observe the following one-parameter family of 4 x 4 com-
plex Hadamard matrices, indexed by the parameter t ranging over the unit circle T in C: ut
1
1
t -1
t
1
t
t -1
-1
1 t t t -1 t 1 The reason for the adjective `complex' in the previous paragraph is that there is a fair amount of history related to real orthogonal matrices with constant modulus - these were studied by Hadamard and bear his name. We
2
record here a few facts about such real Hadamard matrices: (i) Call a positive integer N an Hadamard integer if there exists an N x N real Hadamard matrix. It is easy to show that if N is an Hadamard integer and if N > 2, then N - 0(mod4). The open question concerning real Hadamard matrices is whether every multiple of 4 is in fact an Hadamard integer. (This has been verified to be true for some fairly large multiples of 4.)
(ii) It is not hard to show that two squares of the form (5.2.1) that are given by real Hadamard matrices are isomorphic (as squares of algebras) if and only if the corresponding Hadamard matrices are equivalent in the sense that it is possible to obtain one by (pre- and post-) multiplying the other by diagonal orthogonal matrices and permutation matrices. The number h of isomorphism classes of real Hadamard matrices of size N, for small N, is given as follows:
5.2.3
N
2
4
8
12
16
h
1
1
1
1
5
Vertex models
These examples also get their names from statistical mechanical considerations - see [Jon3].
CHAPTER 5. COMMUTING SQUARES
72
Consider the square (5.2.1), where we now assume, as in Example 3.3.1(i), that Ao = C, Al = MN(C) ® 1, A2 = MN(E) ® MN(C). If we make the identification Ai = MN (C), and if u = ((ukl))1
x3
uk1 k T
= bk k dl
x,7
x30'
uk1 kd'
6j,9's&,l' .
i,k
The simplest example of a vertex model is provided by the `flip' - which was briefly encountered in Example 3.1.6 - for which ukl = SilSki.
We shall consider the last two classes of examples in greater detail in Chapter 6 (where, among other things, we shall see the reason for the above `biunitarity' condition).
5.3
Basic construction in finite dimensions
Recall that if e is a projection in a von Neumann algebra, then the projection V {ueu* : u E M, a unitary} is also given by Al f E P(Z(M)) : e < f }; this projection, which we shall denote by zM(e), is called the central support of the projection e.
LEMMA 5.3.1 Let A C B be a unital inclusion of finite-dimensional C*algebras. Fix a faithful tracial state 0 on B, and let J denote the modular conjugation operator on L2(B, 0). Let e denote the orthogonal projection of L2(B, 0) onto the subspace L2(A, 01A); let EA denote the 0-preserving condi-
tional expectation of B onto A; and let B1 = (B, e) denote the result of the basic construction. (a) zB1(e) = 1. (b) Suppose C is a finite-dimensional C*-algebra containing B. (We only consider unital inclusions.) Suppose C contains a projection f satisfying:
(i) C = (B, f ); (ii) f b f = EA(b) f, Vb E B; and
(iii) a H a f is an injective map of A into C.
Then B f B = C f C = Czc(f), and there exists a unique isomorphism V) : B1 -4 C f C such that b(e) = f and 0(b) = bzc(f) Vb E B. Proof- (a) Suppose z E P(Z(B1)) and e < z. Then also e = JeJ < JzJ E ae P(Z(JB1J)) = P(Z(A)); but then (1-JzJ)e = 0, and since the map a is an injective map of A, it follows, as desired, that z = 1.
5.3. BASIC CONSTRUCTION IN FINITE DIMENSIONS
(b) The assumptions clearly imply that C = {bo + > 1 bi f bi
73 :
nE
N, bi, bi E B}. It follows - from this and (ii) - that C f C = B f B. On the other hand, every two-sided ideal in the finite-dimensional C*algebra is of the form Cz, for a uniquely determined central projection z c C. It follows from the definition of the central support that C f C = Czc(f).
In order to complete the proof, we need to show that the assignment E 1 biebi F--> > 1 bi f bi yields a well-defined injective mapping from B1 to C f C. (It will immediately follow that such a map would be the desired isomorphism.) That this assignment is indeed an unambiguously defined bijection to C f C from B1 is an immediate consequence of (two applications, once to C, and once to B1, of) the following:
Assertion: Let n E N, bi, bi c B,1 < i < n. Then Ii
n
EA(bbi)EA(b''b') = 0 Vb, b' c B.
bi f bi = 0 i=1
(5.3.1)
i.1
bi f bi = 0. Pre-multiply by f b and postProof of assertion: Suppose multiply by b'f, and appeal to the hypotheses (ii) and (iii), to conclude that indeed, En 1 EA(bbi)EA(bb') = 0 Vb, b' E B. Conversely, if the latter condition is satisfied, pre-multiply by x f and post-multiply by f x', to deduce that x f b(> 1 bi f bi)b' f x' = 0, for arbitrary x, x' E B. Since the finite-dimensional C*-algebra C f C = B f B has a unit, this implies that indeed >? 1 bi f bi = 0, and the proof of the assertion, and consequently of the lemma, is complete.
COROLLARY 5.3.2 Let A, B, B1, C, e, f be as in Lemma 5.3.1(b). Then the following conditions are equivalent:
(i) there exists an isomorphism 0 : B1 -> C such that 01B = idB and
c(e) = f; (ii) zc (f) = 1. Proof: Obvious.
We come now to a very important relation between commuting squares and the basic construction. LEMMA 5.3.3 Suppose
H
Bo C B1 KU
UL
Ao C Al
(5.3.2)
CHAPTER 5. COMMUTING SQUARES
74
is a commuting square of finite-dimensional C*-algebras with respect to a trace
on B1 which is a Markov trace for the inclusion B° C B1, with inclusion matrices as indicated. Let B2 = (B1, e) denote the result of the basic construction for the inclusion 13° C 131, where e denotes the projection in B2 which implements the conditional expectation of B1 onto B°. Define A2 = (A1, e) C B2. Then the following is also a commuting square (with respect to the unique trace on B2 which extends the given trace on B1 and is a Markov trace for the inclusion B1 C B2), with the inclusion matrices as indicated: H'
Bi C B2 Uxl
LU
(5.3.3)
GI
Al C A2, where G1 (resp., K1) is a matrix with block-form [G' r) (resp.,
1), I
A
where
F (resp., A) is the submatrix of G1 (resp., K1) determined by the columns (resp., rows) indexed by minimal central projections of A2 which are orthogonal to e. Proof: Begin by observing that, in view of the assumed commuting square
condition, the tower A° C Al C A2 = (Al, e) satisfies the conditions of Lemma 5.3.1(b); in particular, any element of A2 is of the form x = a + E 1 bieci, where a, bi, ci E Al; and EBIx = a + E 1 Tbici E A1, where T = IIHII-2, and consequently (5.3.3) is also a commuting square. , q<<)) be an ordering of the minimal central Let pll), pl (resp., qh>, i projections of Al (resp., B1) for 1 = 0, 1, with respect to which the inclusion matrices are G, H, K, L as in (5.3.2). If we define q(2) = JBIgkO)JBI,1 < k < no, it follows from Lemma 3.2.2(a)(iv) that q12), , qno) is an ordering of ,
the minimal central projections of B2, and hence the inclusion matrix for and the gk2)'s is H. B1 C B2, computed with respect to the On the other hand, it follows from Lemma 5.3.1(b) that, if we write z = (A1, eAo) -> A2z such that zA2 (e), then there exists an isomorphism O(eA,) = e and d(al) = a1z dal E A1. Define p12) _ cb(JAIpI°)JAI),1 < i < ,p(22 be a listing of the minimal central projections of m°i and let p(2)+1i A2 which are orthogonal to z (or equivalently, to e). It follows, again from :
is a listing of the minimal central projections , of A2 such that the inclusion matrix for Al C A2, computed with respect to the p2*s and the pk2)'s, is [G' FJ, as asserted. Lemma 3.2.2, that p12),
Finally, fix 1 < i < m°i1 < k < no, and fix a minimal projection f E A°pl°). By definition of the inclusion matrix, there exists a decomposition f q(k0) = EK`i r., of f q(°) as a sum of (mutually orthogonal) minimal projections in B°qk°). Notice that 0(f eAo) = 0(f)o(eAo) = f z e = f e. Hence we may
5.3. BASIC CONSTRUCTION IN FINITE DIMENSIONS
75
deduce from Lemma 3.2.2(b)(ii) that fe is a minimal projection in and further,
f
eg(k2)
= f g(k 2)e f q(k0) e
(by Lemma 3.2.2(a)(i))
Kik rse;
s=1
but, again by Lemma 3.2.2(b)(ii), each rse is a minimal projection in B2q 2). This completes the proof that the inclusion matrix for A2 C B2 is indeed as asserted. COROLLARY 5.3.4 Let H
Bo C Bl KU UL G
(5.3.4)
Ao c Al be as in Lemma 5.3.3.
(a) Then G'K < LH' in the entry-wise sense. (b) Assume that each of the four inclusions in (5.3.4) is connected. Then the following conditions are equivalent:
(i) G'K = LH'; (ii) if A2, B2 are as in Lemma 5.3.3, then zA2 (e) = 1; (iii) V{ueu* : u E A1, u unitary} = 1, where the 'supremum' is computed in A2 or equivalently in C(L2(Bl));
(iv) B1 is linearly spanned by Al Bo = {a,bo : a1 E A1, bo E Bo};
(i)' KG = HL'; (ii)' if C1 = (B1, f) is the result of the basic construction for the inclusion Al C B1 (with respect to the Markov trace for this inclusion), and if Co = (Bo, f), then zco (f) = 1;
(iii)' if Co and f are as in (ii)' above, then V{u f u* : u E Bo, u unitary} = 1, where the `supremum' is computed in Co or equivalently in C(L2(Bl));
(ivy B1 is linearly spanned by BOA1 = {boar : a1 E A1, bo E Bo}. (c) Assume that each of the four inclusions in (5.3.4) is connected, and that the equivalent conditions of (b) are satisfied; then: (i) IIGII = IIHII;
(ii) IIKII = IILII;
A2pZ2),
CHAPTER 5. COMMUTING SQUARES
76
(iii) if tr denotes the trace on B1 which is the Markov trace for B0 C B1, then tr is also the Markov trace for Al C B1, and trIA, (resp., trIB0) is the Markov trace for A0 C Al (resp., Ao C Bo.) Proof: (a) By multiplicativity of inclusion matrices, we find from Lemma 5.3.3 that (KH = GL and) LH' = G1K1 = G'K + FA, thus establishing (a). (b) By the above reasoning, if (ii) is satisfied, it follows from Lemma 5.3.3 that r' and A are absent, whence we have (i). On the other hand, suppose (ii) is violated. In the notation of the proof of Lemma 5.3.3, this means there exists i, mo < i < m2i such that p,2) 0. Since the inclusion Al C A2 is unital, there must exist j < m1 such that Fhi : 0. Also, by the definition of an inclusion, there must exist k,1 < k < n2, such that Aik 0; it follows that (FA)jk 0 0, and hence (G'K),k < (LH');k, thus
establishing that (i) '# (ii).
(In the following, we shall write S2 for the cyclic trace vector in L2(B1).)
Notice that the condition (ii) amounts to the requirement that V{ueu* u E A2, n unitary} = 1, which amounts to requiring (since the range of :
ueu* is just uBoS2) that B1S2 is spanned by U{uB0Q : u E A2, U unitary}, which is equivalent to the requirement that B11 is spanned by {xboQ : x E A2, bo E B0}. Since A2 is spanned by Al together with elements of the form aeal, a, a1 E A1, and since the range of e is just B0S2, it follows that (ii) is equivalent to the requirement that B11 is spanned by A1B0S2 (which, in view of S2 being a separating vector for B1, is the same as (iv)) which is again seen to be equivalent (by reversing the earlier reasoning) to (iii). By taking adjoints, it is clear that the conditions (iv) and (iv)' are equivalent, while the equivalence of (i)'-(iv)' follows from the equivalence of (i)-(iv). (c) The assumption that (b)(ii) is satisfied implies - by Proposition 3.2.3 IIHII-2) and that - that trIA, is the Markov trace for A0 C Al (since EB,e = IIGII = IIHII As for (iii), let us write tB' for the trace vector corresponding to the trace
tr. Let us also write tC for the trace vector corresponding to tric, where
C E {A0, A1, B0}. The already established fact that trIA, is the Markov trace for A0 C Al implies that (5.3.5)
G'tA0 = IIGII2tA'-
Hence
H'HL'tA' = H'K'GtA' = H'K'tA0 = L'GtA0 =
IIGII2L'tA'.
Thus, L'tA' is a, and hence the, Perron-Frobenius eigenvector for H'H; i.e., there exists a positive constant p such that L'tA' = ptB'; but then, also LL'tA' = pLtB' = ptA'; and hence p = IILII2, and indeed tr is the Markov 1 trace for Al C B1. REMARK 5.3.5 The proof shows that the conditions (ii), (iii), (iv), (ii)', (iii)', and (iv)' in Corollary 5.3.4(b) are equivalent even without requiring either
5.4. PATH ALGEBRAS
77
that the trace in question is the Markov trace, or that all the inclusions are connected. In fact, these conditions are equivalent under just the assumption that we have a commuting square of finite von Neumann algebras, provided that the expression `linearly spanned' in conditions (iv) and (iv)' is replaced by `contained in the closed subspace of L2(B1) generated by'. Such a general commuting square of finite von Neumann algebras has also been called a nondegenerate commuting square by Popa. DEFINITION 5.3.6 The commuting square (5.3.4) is called a symmetric commuting square if the equivalent conditions in Corollary 5.3.4(b) are satisfied.
5.4 Suppose
Path algebras A0cA,CA29...9AnC...
(5.4.1)
is a tower of finite-dimensional C*-algebras. We know that the `isomorphism class' of this tower is completely determined by the dimension vector of Ao and the Bratteli diagrams of the successive inclusions. The path-algebra formalism gives a model of such a tower (for any prescribed data as above), which is quite useful in some computations. Before we get to discussing this formalism, we set up some notation.
If A is a finite-dimensional C*-algebra, we shall write ir(A) for the set of minimal central projections of A. Thus, if A _C B is a unital inclusion of finite-dimensional C*-algebras, then the inclusion matrix is the ir(A) x ir(B) matrix, with (p, q)-th entry given by [dim,(pgA'pgfl pgBpq)] 2. We shall think of an edge a in the Bratteli diagram for the inclusion A C B, which joins p E 7r(A) and q E ir(B), say, as being oriented so that it starts from p and finishes at q, and we shall write p = s(a), q = f (a). Suppose now that the Ak's are as in (5.4.1), where we assume that all the inclusions are unital. For convenience, we set A_1 = Cl _C A0; write ir(A_1) = {*}. For k > 0, let 1 k denote the set of edges in the Bratteli diagram for the inclusion Ak_1 C_ Ak, oriented as discussed in the last paragraph.
For -1 <1 < k
For -1 < l < k < oo, let l([l,k] denote a Hilbert space with an orthonormal basis indexed by I [1,k]; we shall identify an operator x on l1 [l,k] with its matrix
((x(a,a))) (with respect to this basis).
If -1 < l < l1 < k1 < k < oo, and if a = (a1+1, a1+2,
-
write s(a) = s(a1+i), f (a) = f (ak) and a[11,k11 = (a11+i, a11+2)
.
,
,
ak) E Q[l,k], ,
ak1)
CHAPTER 5. COMMUTING SQUARES
78
We shall use the following obvious simplifying notational conventions: k] _ [-1,k], 1[l = 1 [l,oo],
_ [ li
?k] = 'H[-1,k]) H[1 =H[1,.], 7-t = x[-1;
ak] = a[-1,k], a[l = a[,,.) Finally, for -1 < n < oo, define B,,, = {x E ,C(7-l) :3a E G(7in]) such that x(a, Q)
= b«ln,P[na(an], l3n]), Va, 0 E 1 }.
PROPOSITION 5.4.1 With the foregoing notation, we have: (i) for -1 < n < oo, Bn is a *-subalgebra of G(7-[) and (5.4.2)
(ii) if-1
Bk n Bn = {x E L(R) : 3a E C(7-l[k,n]) such that x(a, Q) = b«k1,Pklb«ln,P[na(a[k,n], 0[k,n]) Va, Q E Q};
(iii) for fixed n > -1 and p E 7r(An), define p E Bn by p(a, Q) = b«,Pbf(«n]),p
Vc , a E 1;
then 7r(Bn) _ {p : p E ir(An)}; (iv) for n > -1, and A,, E Stn] satisfying f (A) = f (µ), define ea,N, E Bn by
eA,,(a, a) =
Va,'3 E S1;
then
{e),,,, : A, µ E Qn], f (A) = f (µ)}
is a `system of matrix units' for Bn; (v) there exists an isomorphism z/) of the tower (5.4.1) onto the tower (5.4.2) such that //'(p) = p Vp E ir(An), do > -1. Proof: The proof of (i)-(iv) is routine computation. Assertion (v) is easily seen, via induction, to amount to the following statement which is indeed true: If Ao C Al and B0 C_ B1 are inclusions of finite-dimensional C*-algebras, if 8 : A0 -> B0 is an isomorphism, and if there exists a bijection ¢ : 7r(A1) ->
7r(B1) such that the two inclusion matrices AA and AB satisfy AA(p, q) _ AB(O(p), o(q)), then there exists an isomorphism B : Al --> B1 which simultaneously extends both 0 and 0.
5.4. PATH ALGEBRAS
79
REMARK 5.4.2 (1) If x E Bn and a E G(7-ln)) are related as in the definition of Bn, the assignment x a defines a faithful representation on of Bn on 'Hn); we shall consequently simply write x(a, 0) for (pn)(x))(a, 0), whenever x E Bn, a, a E Stn) . Further, dimc ?-ln) = EPE,,(A.) [dimc (BfP)] 2 , and pn contains each distinct irreducible representation of Bn exactly once. (2) Suppose o,,b' : An -> Bn are two isomorphisms which both map Ak to Bk and p E 7r(Ak) to P for each p E 7r(Ak), for 0 < k < n. Then 0 = 0-1 o 0' is an automorphism of An with the following two properties: (a) O(Ak) _ Ak, 0 < k < n; and (b) Ba(sk) = idz(Ak), 0 < k < n. On the other hand, any automorphism of MM(c) is inner; hence an antomorphism of a finite-dimensional C*-algebra is inner if and only if it acts trivially on the centre; this implies, by an easy induction argument, that an automorphisr 0 of An satisfies properties (a) and (b) of the preceding paragraph if and only if it has the form 0 = Aduov,,...u,,, where Uk is a unitary element of A'k_1 fl Ak, for 0 < k < n. Suppose now that tr is a faithful tracial state on An, where we temporarily
fix n > 0. For -1 < k < n, let t(k) : lr(Ak) -> [0, 1] be the trace-vector corresponding to trIAk; thus _t (k) = trpo, where po is any minimal projection in Akp.
In the following proposition, whose proof is another straightforward verification, we identify the Ak's with the corresponding Bk's of Proposition 5.4.1.
PROPOSITION 5.4.3 (i) If -1 < k < n, and if x E Bk, then tr x=>«Ec k, t(())
x(a a) (ii) If -1 < k < n, and if x E Bn, then the tr-preserving conditional expectation EBk of Bn onto Bk is given by t(n)
/
(EBk x)(a
f(B)
6 - Ct[k,Q[k
k)
x(ak)
9E(1 [k n
o B Ok) '
B)
3(B)=f(«k])
for all a, 0 E On], where we have used the symbol o to denote concatenation of paths.
(iii) In particular, if -1 < k < n, and if ea,,, is as in Proposition 5.4.1(iv), then t1(A)
EBk (ea,P) - 6a[k,fi[k t (k) f(ak))
eAk],Fik]
11
We conclude this section by discussing the above path-algebra formulation in the important special case when the tower (5.4.1) (equivalently, (5.4.2)) is
the tower of the basic construction applied to the initial connected inclusion A0 C A1, with respect to the Markov trace. In this case, suppose A (resp., S2o) denotes the inclusion matrix (resp., the set of oriented edges in the Bratteli diagram) for A0 C A1. Let us inductively identify p E 7r(An)
CHAPTER 5. COMMUTING SQUARES
80
with JAn+1pJA,+1 E ir(An+2). Further, if a E S20, let us write & for the same edge with the opposite orientation, and let us write S2o = {& : cx E S201. It then follows from Lemma 5.3.3 that if An denotes the inclusion matrix for An c An+1i then (An, Stn) is (A, S2o) or (A', S2o) according as n is even or odd. Let i(n) ir(An) -> [0, 1] denote the trace-vector corresponding to the restriction to A. of tr, the unique consistently defined trace on A,,, = Uk Ak. Then, with our identification of 7r(A2n) (resp., ir(A2n+1)) with ir(Ao) (resp., ir(Al)), it follows that :
i(2n+1)
= .-ni(l), (2n) = T-nt(0), t(0) = AP),
where r = IIA11-2. Again, in the following result, which is easily verified, we identify An above
with the corresponding Bn of Proposition 5.4.1. PROPOSITION 5.4.4 With the foregoing notation, a candidate for the projection en+1 E A; _1 n An+1 is given by en+i(a, a)
Ptf(
=
n1)tf(n[)
(n-1)
(5.4.3)
tf(a, q)
5.5
The biunitarity condition
In this section, we discuss the important re-formulation, due to Ocneanu, of the commuting square condition, as a biunitarity condition. Before we get to that, it would be good to make a slight digression concerning matrix units. Recall that if e;,j is the n x n matrix with 1 in the (i, j) position and 0's elsewhere, then {e2j 1 < i,j < n} is called a (or, sometimes, the) standard system of matrix units for Mn(E); more generally, if A is a In factor, a set of matrix units for A is any set of the form {0r'(eij) : 1 < i,j < n}, where 0 : A -> Mn(c) is any isomorphism. Slightly more generally, if A is a finitedimensional C*-algebra, we shall refer to a union of sets of matrix units for each central summand of A as a system of matrix units for A. (See Proposition 5.4.1(iv).) Finally if we are given a tower of finite-dimensional C*-algebras, say Ao C Al C ... C An as in the last section, we would like to work with a system of matrix units for An which is compatible with the tower in a natural :
fashion.
For this, notice that, in the notation of Proposition 5.4.1, the set {eA,/, A, p E S2n], f (A) = f (p)} is a system of matrix units for An with the following
5.5. THE BIUNITARITY CONDITION
81
property: whenever -1 < k < 1 < n, A, µ E Q[k,1], s(\) = s(µ), f (A) = f (µ), if we define ea.µ =
eaoAo0,aoµo/3,
F_
-Enk],0Ec[,
f(a)=s(A),s(R)=f(A)
then {eA,µ :A,
Q[k,1], s(A) = s(µ), f (A) = f (µ)} is a set of matrix units for
A' nA1.
DEFINITION 5.5.1 If A C A, g ... C A,,, is a tower of finite-dimensional C*-algebras, we shall use the expression a system of matrix units for A,,, which is compatible with the tower above, to denote any set of the form /-1({eA,,, A, µ E Q.], f (A) = f (p)}), where and {eA,µ A, IL E Q,,1, f (A) = f (IL) } are as in Proposition 5./1.1(v) and (iv). :
:
Thus a consequence of Remark 5.4.2(2) is that any system of matrix units for A,,, which is compatible with the tower {Ak : 0 < k < n} can be obtained from any other by an inner automorphism of A,,, of the form Aduou,...u,,, where
Uk is a unitary element of A'_1 n Ak, for 0 < k < n. If {pa, : A, µ E s(A) = s(µ), f (A) = f (µ)} is a system of matrix units for A,,, which is compatible with the tower A0 C C A,,, and if B[k,l] = {pa,µ : a, µ E Rk,l], s(A) = s(µ), f (A) = f (µ)} is the system of matrix units for Bk n B1 as above, we shall say that the system B[k,l] extends to the system L3a1, or that the system B.a1 restricts to 13[k,1].
We are now ready for the biunitarity condition. (In the following proposition, we shall use the following notation: if A0 C Al C C A,,, is a tower of finite-dimensional C*-algebras, we write to denote the set of oriented paths which was denoted by Q [O,,,] in the last section. We shall also use the convention that the sy