HANDBOOK OF QUANTUM LOGIC AND QUANTUM STRUCTURES QUANTUM STRUCTURES
This page intentionally left blank
HANDBOOK OF QUANTUM LOGIC AND QUANTUM STRUCTURES QUANTUM STRUCTURES
Edited by
KURT ENGESSER Universitat Konstanz, Konstanz, Germany
DOV M. GABBAY King's College London, Strand, London, UK
DANIEL LEHMANN The Hebrew University of Jerusalem, Jerusalem, Israel
ELSEVIER Amsterdam • Boston • Heidelberg • London • New York • Oxford Paris • San Diego • San Francisco • Singapore • Sydney • Tokyo
Elsevier Radanveg 29, PO Box 2 11, 1000 AE Amsterdam, The Netherlands Linacre House, Jordan Hill, Oxford OX2 8DP, UK First edition 2007 Copyright 02007 Elsevier B.V. All rights reserved No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means electronic, mechanical, photocopying, recording or otherwise without the prior written permission of the publisher Permissions may be sought directly from Elsevier's Science & Technology Rights Department in Oxford, UK: phone (+44) (0) 1865 843830; fax (+44) (0) 1865 853333; email:
[email protected] you can submit your request online by visiting the Elsevier web site at http://elsevier.com/locate/permissions,and selecting Obtainingpermission to use Elsevier material Notice No responsibility is assumed by the publisher for any injury andlor damage to persons or property as a matter of products liability, negligence or otherwise, or from any use or operation of any methods, products, instructions or ideas contained in the material herein. Because of rapid advances in the medical sciences, in particular, independent verification of diagnoses and drug dosages should be made
Library of Congress Cataloging-in-Publication Data A catalog record for this book is available from the Library of Congress British Library Cataloguing in Publication Data A catalogue record for this book is available from the British Library ISBN:
978-0-444-52870-4
For information on all Elsevier publications visit our website at books.elsevier.com
Printed and bound in The Netherlands
0 7 0 8 0 9 1 0 11 1 0 9 8 7 6 5 4 3 2 1
Working together to grow libraries in developing countries
FOREWORD
More than a century ago Hilbert posed his unsolved (and now famous), 23 problems of mathematics. When browsing through the Internet recently I found that Hilbert termed his Sixth Problem non-mathematical. How could Hilbert call a problem of mathematics non-mathematical? And what does this problem say? In 1900, Hilbert, inspired by Euclid's axiomatic system of geometry, formulated his Sixth Problem as follows: To find a few physical axioms that, similar to the axioms of geometry, can describe a theory for a class of physical events that i s as large as possible. The twenties and thirties of the last century were truly exciting times. On the one hand there emerged the new physics which we call quantum physics today. On the other hand, in 1933, N. A. Kolmogorov presented a new axiomatic system which provided a solid basis for modern probability theory. These milestones marked the entrance into a new epoch in that quantum mechanics and modern probability theory opened new gates, not just for science, but for human thinking in general. Heisenberg's Uncertainty Principle showed, however, that the micro world is governed by a new kind of probability laws which differ from the Kolmogorovian ones. This was a great challenge to mathematicians as well as to physicists and logicians. One of the responses to this situation was the, now famous, 1936 paper by Garret Birkhoff and John von Neumann entitled "The logic of quantum mechanics", in which they suggested a new logical model which was based on the Hilbert space formalism of quantum mechanics and which we, today, call a quantum logic. G. Mackey asked the question whether every state on the lattice of projections of a Hilbert space could be described by a density operator; and his young student A. Gleason gave a positive answer to this question. Although this was not part of Gleason's special field of interest, his theorem, now known as Gleason's theorem, had a profound impact and is rightfully considered one of the most important results about quantum logics and structures. Gleason's proof was non-trivial. When John Bell became familiar with it, he said he would leave this field of research unless there would be a simpler proof of Gleason's theorem. Fortunately, Bell did find a relatively simple proof of the partial result that there exists no two-valued measure on a three-dimensional Hilbert space. An elementary proof of Gleason's theorem was presented by R. Cooke, M. Keane and W. Moran in 1985. In the eighties and nineties it was the American school that greatly enriched the theory of quantum structures. For me personally Varadarajan's paper and subsequently his book were the primary sources of inspiration for my work together with
vi
Foreword
Gleason's theorem. The theory of quantum logics and quantum structures inspired many mathematicians, physicists, logicians, experts on information theory as well as philosophers of science. I am proud that in my small country, Czechoslovakia and now Slovakia, research on quantum structures is a thriving field of scientific activity. The achievements characteristic of the eighties and nineties are the fuzzy a p proaches which provided a new way of looking at quantum structures. A whole hierarchy of quantum structures emerged, and many surprising connections with other branches of mathematics and other sciences were discovered. Today we can relate phenomena first observed in quantum mechanics to other branches of science such as complex computer systems and investigations on the functioning of the human brain, etc. In the early nineties, a new organisation called International Quantum Structures Association (IQSA) was founded. IQSA gathers experts on quantum logic and quantum structures from all over the world under its umbrella. It organises regular biannual meetings: Castiglioncello 1992, Prague 1994, Berlin 1996, Liptovsky Mikulas 1998, Cesenatico 2001, Vienna 2002, Denver 2004, Malta 2006. In spring 2005, Dov Gabbay, Kurt Engesser, Daniel Lehmann and Jane Spurr had an excellent idea -to ask experts on quantum logic and quantum structures to write long chapters for the Handbook of Quantum Logic and Quantum Structures. It was a gigantic task to collect and coordinate these contributions by leading experts from all over the world. We are grateful to all four for preparing this monumental opus and to Elsevier for publishing it. When browsing through this Handbook, in my mind I am wandering back to Hilbert's Sixth Problem. I am happy that this problem is in fact not a genuinely mathematical one which, once it is solved, brings things t o a close. Rather it has led to a new development of scientific thought which deeply enriched mathematics, the understanding of the foundations of quantum mechanics, logic and the philosophy of science. The present Handbook is a testimony to this fact. Those who bear witness to it are Dov, Kurt, Daniel, Jane and the numerous authors. Thanks to everybody who helped bring it into existence. Anatolij DvureEenskij, President of IQSA July 2006
vii
EDITORIAL PREFACE
There is a wide spread slogan saying that Quantum Mechanics is the most successful physical theory ever. And, in fact, there is hardly a physicist who does not agree with this. However, there is also the reverse. Not only is Quantum Mechanics unprecedently successful but it also raises fundamental problems which are equally unprecedented not only in the history of physics but in the history of science in general. The most profound problems that Quantum Mechanics raises are conceptual in nature. What is the proper interpretation of Quantum Mechanics? This is a question touching on most fundamental issues, and it is, at this stage, safe to say that there is no answer to this question yet on which physicists and philosophers of science could agree. It is, moreover, no exaggeration to say that the problem of the conceptual understanding of Quantum Mechanics constitutes one of the great intellectual puzzles of our time. The topic of the present Handbook is, though related to this gigantic issue, more modest in nature. It can, briefly, be described as follows. Quantum Mechanics owes is tremendous success to a mathematical formalism. It is the mathematical and logical investigation of the various aspects of this formalism that constitutes the topic of the present Handbook. This formalism, the core of which is the mathematical structure of a Hilbert space, received its final elegant shape in John von Neumann's classic 1932 book "Mathematische Grundlagen der Quantenmechanik" . In 1936, John von Neumann published, jointly with the Harvard mathematician Garret Birkhoff, a paper entitled "The logic of quantum mechanics". In the Introduction the authors say: "The object of the present paper is to discover what logical structure we may hope to find in physical theories which, like quantum mechanics, do not conform to classical logic". The idea of the paper, which was as ingenious as it was revolutionary, was that the Hiibert space formalism of Quantum Mechanics displayed a logical structure that could prove useful to the understanding of Quantum Mechanics. Birkhoff and von Neumann were the first to put forward the idea that there is a link between logic and (the formalism of) Quantum Mechanics, and their now famous paper marked the birth of a field of research which has become known as Quantum Logic. The Birkhoff-von Neumann paper triggered, after some time of dormancy, a rapid development of quantum logical research. Various schools of thought emerged. Let us, in this preface, highlight just a few of the milestones in this development.
viii
Editorial Preface
In hi famous essay "Is logic empirical?" Putnam put forward the view that the role of logic in Quantum Mechanics is similar to that of geometry in the theory of relativity. On this view, logic is as empirical as geometry. Putnam's revolutionary thesis triggered a discussion which was highly fruitful not only for Quantum Logic but for our views on the nature of logic in general. Another school of thought was initiated by Piron's "Axiomatique Quantique". This school, which has become known as the Geneva school, aimed at reconstructing the formalism of Quantum Mechanics from first principles. Piron's student Diederik Aerts continued this in Brussels. The achievements of the GenevaBrussels school are reflected in various chapters written by Aerts and former students of his. In Italy it was Enrico Beltrametti and Maria Luisa Dalla Chiara, just t o mention two names, who founded another highly influential school which is well represented in this Handbook. Highly sophisticated efforts resulted in linking the logic of Quantum Mechanics to mainstream logic. Just to give a flavour of this, let us mention that Nishimura studied Gentzen type systems in the context of Quantum Logic. Abramsky and Coecke in Oxford and Sernadas in Lisbon as well as others established the connection with Categorial Logic and Linear Logic, and the connection with NonMonotonic Logic was made by the editors. Prior to this, another direction of research had focused on the lattice structures relevant to Quantum Logic. Essentially, this field of research was brought to fruition in the USA by the pioneering work of Foulis and Greechie on orthomodular lattices. Moreover, we have to mention the Czech-Slovak school which was highly influential in establishing the vast field of research dealing with the various abstract Quantum Structures, which constitute the topic of a whole volume of this Handbook. Let us in this context just mention the names of Anatolij DvureEenskij and Sylvia Pulmannovi in Bratislava and Pave1 P t i k in Prague. The editors are happy and grateful to have succeeded in bringing together the most eminent scholars in the field of Quantum Logic and Quantum Structures for the sake of the present Handbook. We cordially thank all the authors for their contributions and their cooperation during the preparation of this work. Most of the authors are members of the Internatonal Quantum Structures Association (IQSA). We would like to express our deep gratitude to IQSA and in particular to its President, Professor Anatolij DvureEenskij, for cooperating closely with us during the preparation of this Handbook. The present Handbook is an impressive document of the intellectual achievements which have been reached in the study of the logical and mathematical structures arising from Quantum Mechanics. We hope that it will turn out to be a milestone on the road that will ultimately lead to the solution of one of the great intellectual puzzles of our time, namely the understanding of Quantum Mechanics.
Editorial Preface
ix
Finally, we would like to thank our Handbook and Publications Administrator Mrs Jane Spurr for her excellent and dedicated work on yet another Handbook of Logic. Thanks too, to our publishers Elsevier and especially to Arjen Sevenster and Andy Deelen, without whose efforts the book would not get onto shelves. The Editors: Kurt Engesser, Dov Gabbay and Daniel Lehmann Konstanz, London, and Jerusalem September 2006
This page intentionally left blank
CONTRIBUTORS Enrico Beltrametti Dipartimento di Fisica, Universita' di Genova, via Dodecaneso 33, 16164 Genova, Italy. beltrameQge.infn.it David Buhagiar Department of Mathematics, Faculty of Science,University of Malta, MsidaMSD.06, Malta. david.buhagiarQum.edu.mt Emmanuel Chetcut i Department of Mathematics, Junior College, University of Malta, Msida MSD.05, Malta. emanuel.chetcutiQum.edu.mt Georges Chevalier UniversitC Claude Bernard, bltiment de mathkmatiques, 43 boulevard du 11novembre 1918, 69622 Villeurbanne cedex, France. chevalie(0math.univ-lyonl.fr Ferdinand Chovanec Department of Natural Sciences, Academy of Armed Forces, P.O. Box 45, SK03101 Liptovsky Mikulas, Slovakia chovanecQaoslm.sk Anatolij DvureEenskij Mathematical Institute, Slovak Academy of Sciences, Stefiinikova 49, SK-81473 Bratislava, Slovakia.
[email protected] Kurt Engesser University of Konstanz, 78457 Konstanz, Germany.
[email protected] David J . Foulis 1 Sutton Court, Amherst, MA 01002, USA. foulis(0math.urnass.edu
xii
Contributors
Dov M. Gabbay Department of Computer Science, King's College London, Strand, London WC2R 2LS, UK. dov.gabbayQkcl.ac.uk Richard J. Greechie Department of Mathematics and Statistics, Louisiana Tech University, Railroad Avenue, Ruston, LA 71272, USA. greechieQcoes.latech.edu
Stan Gudder Department of Mathematics, University of Denver, 2360 S. Gaylord St, Denver, CO 80208, USA.
[email protected] Jan Hamhalter Faculty of Electrical Engineering, Department of Mathematics, Czech Technical University, Technickd 2, 166 27 Prague 6, Czech Republic.
[email protected]
John Harding Department of Mathematical Sciences, New Mexico State University, P O Box 30001, Las Cruces, NM 88003-8001, USA. jhardingQnmsu.edu FrantiSek K6pka Department of Engineering Fundamentals, Faculty of Electrical Engineering, University of Zilina, Workplace Liptovsky Mikulas, SK-031101 Liptovsky Mikulas, Slovakia kopkaQlm.utc.sk Daniel Lehmann School of Computer Science and Engineering, The Hebrew University of Jerusalem, Jerusalem 91904, Israel. 1ehmannQcs.huji.ac.il RenC Mayet 13 Rue Saint Antoine, 69003 Lyon, France. rene.mayetQwanadoo.fr Norman D. Megill Boston Information Group, 19 Locke Lane, Lexington, MA 02420, USA. nmQalum.mit.edu
Contributors
xiii
Mirko Navara Center for Machine Perception, Departtment of Cybernetics, Faculty of Electrical Engineering, Czech Technical University, Technicki 2, 166 27 Praha 6, Czech Republic. navara(0math.feld.cvut.cz Mladen PaviEi6 Faculty of Civil Engineering, University of Zagreb, Kariceva 26, POB 217, HR10001 Zagreb, Croatia. mpavicicQgrad.hr Pave1 P t i k Czech Technical University, Faculty of Electrical Engineering, Department of Mathematics, Technicki 2, 16627-Prague 6, Czech Republik. ptakQnath.fe1d.cvut.c~ Sylvia Pulmannovi Mathematical Institute, Slovak Academy of Sciences, Stefiianikova 49, SK-81473 Bratislava, Slovakia. pulmannhat savba.sk
.
Jaroslaw Pykacz Institute of Mathematics, University of Gdarisk, Wita Stwosca 57, 80-952 Gdarisk, Poland pykaczQnath.univ.gda.pl Isar Stubbe Departement Wiskunde en Informatica, University of Antwerp, Middelheimlaan 1, B-2020 Antwerp, Belgium. isar.stubbeQua.ac.be Bart Van Steirteghem Departamento de Matemitica, Instituto Superior TCcnico, 1049-001 Lisboa, Portugal. bvansQnath.ist.ut1.pt Mingsheng Ying State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, P R China. yingmshQnai1.tsinghua.edu.cn
This page intentionally left blank
CONTENTS Foreword Anatolij DvureEenskij
v
Editorial Preface Kurt Engesser, Dov Gabbay and Daniel Lehmann
vii
List of Authors
xi
New Quantum Structures Anatolij DvureEenskij
1
Quantum Structures and Fuzzy Set Theory Jaroslaw Pykacz
55
Algebraic and Measure-theoretic Properties of Classes of Subspaces of an Inner Product Space David Buhagiar, Emmanuel Chetcuti and Anatolij DvureEenskij
75
Quantum Probability Stan Gudder Quantum Logics as Underlying Structures of Generalized Probability Theory Pave1 PtAk and Sylvia Pulmannov6 Quantum Logic and Partially Ordered Abelian Groups David J. Foulis and Richard J. Greechie Quantum Structures and Operator Algebras Jan Hamhalter Constructions of Quantum Structures Mirko Navara D-Posets Ferdinand Chovanec and FrantiSek K6pka
xvi
Contents
Wigner's Theorem and its Generalizations Georges Chevalier Propositional Systems, Hilbert Lattices and Generalized Hilbert 477 Spaces Isar Stubbe and Bart Van Steirteghem Equations and Hilbert Lattices Renk Mayet The Source of the Orthomodular Law John Harding Starting from the Convex Set of States Enrico Beltrametti Quantum Logic and Automata Theory Mingsheng Ying Quantum Logic and Quantum Computation Mladen PaviEi6 and Norman D. Megill Index
793
HANDBOOK O F QUANTUM LOGIC AND QUANTUM STRUCTURES: QUANTUM STRUCTURES Edited by K. Engesser, D. M. Gabbay and D. Lehmann O 2007 Elsevier B.V. All rights reserved
1
NEW QUANTUM STRUCTURES Anatolij DvureEenskij
1 INTRODUCTION
About a century ago D. Hilbert presented his famous program for 20th century mathematics at the Second International Mathematical Congress in Paris, 1900. There, he formulated his famous 23 open mathematical problems. This program was to be extremely influential in the development of 20th century mathematics and constituted a source of deep and fundamental ideas. Many of the important problems that occupied mathematicians and specialists in other fields in the 20th century can be traced back to Hilbert's problems, and many of the great and fundamental results we have at our disposal today were in fact stimulated by this program. One of Hilbert's most interesting ideas, which lies between mathematics and physics and is thus in the center of our considerations, is his Sixth Problem: To find a few physical axioms that, similar t o the axzoms of geometry, can describe a theory for a class of physical events that i s as large as possible. The year 2000 was acclaimed by UNESCO as the World Year of Mathematics. By that time almost all of Hilbert's problems had been solved. Therefore, the Clay Institute of Mathematics, Cambridge, Massachusetts, USA, was looking for new open problems in mathematics, and on May 24, 2000, Profs M. Atiyah and J. Tate presented, again in Paris, a new challenge for the 21st century: 7 open problems to be considered the greatest in mathematics. The solution of each of these problems will be awarded 1 000 000 USD. In the new list there are also problems in connection with quantum mechanics, Yang-Mills theory and the hypothesis on mass differences. So, again, we see that physics and in particular quantum mechanics provide a motivation for deep mathematical problems as it was with Hilbert's problems. It is safe to say that Hilbert's Sixth Problem will continue motivating research in quantum structures even at the beginning of the third millennium. We try to present some ideas inspired by Hilbert's Sixth Problem and describe some new directions followed today in research on quantum structures. Classical physics in the nineteenth and twentieth century was, from the logical point of view, governed by the paradigm introduced by G. Boole [Boole, 18541. In fact, the basic structure underlying the logic of classical physics was that of a Boolean algebra.
2
Anatolij Dvureenskij
In the thirties, the situation in both physics and mathematics was very inv, teresting. A.N. Kolmogorov published his fundamental work [ ~ o l m o ~ o r o19331 in which he, for the first time, axiomatized modern probability theory using the framework of Boolean algebras. However, although the Kolmogorovian model turned out to be very important for mathematics, it did not correctly describe the situation that arose in those days in connection with what at that time was called the new physics and what we nowadays call quantum mechanics. This is due to the Heisenberg uncertainty principle [Heisenberg, 19301, which asserts that the position x and the momentum p of an elementary particle cannot be measured simultaneously with arbitrarily prescribed accuracy. If Amp and A,x denote the inaccuracies of the measurement of the momentum p and position x respectively in a state m, then
where h = h/27r and h is Planck's constant. A similar relation holds for the energy-life time
It is interesting to note that we encounter relations similar to the uncertainty relations also in other scientific areas, for example in the social sciences, in psychology, in research on the human brain, in the study of automata. Psychologists know that, when we examine a patient through questions, the patient's psychological stress and the accuracy of his answers are, essentially, connected via (1.1). It was J. von Neumann [von Neumann, 19321 who made the first fundamental step towards a rigorous mathematical framework of the new mechanics as well as an interpretational logic for it. The core of this framework is the concept of a complex separable Hilbert space. In 1936, G. Birkhoff and J. von Neumann published their paper [~irkhoffand von Neumann, 19361 where they showed that the set of assertions about a certain quantum mechanical system has a structure different from that of a Boolean algebra, and they suggested that this structure be a projective geometry. Central to the description a physical system in quantum mechanics is the concept of measurement the description of which in turn relies on the concept of a state. A state is mathemtically represented as a probability measure on the physical system. The system L(H) of all closed subspaces of a real, complex, or quaternionic ~ , in his investigaHilbert space is of particular interest. G. Mackey [ ~ a c k e19631 tion on the mathematical foundations of quantum mechanics posed the following problem: Describe the set of all states on the quantum logic L(H) for a separable real or complex Hilbert space. A.M. Gleason [Gleeason, 19571 published the answer to Mackey7sproblem in 1957, and this result led to decisive progress in research on Hilbert space quantum mechanics. In addition, Gleason's theorem also influenced
New Quantum Structures
3
purely mathematical research and the theorem was extended to many cases and 19931. structures, for an overview on Gleason's theorem see [~vure~enskij, A turbulent development started in the sixties. There appeared many important results which can be found in numerous monographs, e.g. [Beltrametti and Cassinelli, 1981; Birkhoff, 1967, DvureEenskij, 1993, DvureEenskij and Pulmannovb, 2000; Gudder, 1979; Kalmbach, 1983; Maeda, 1980, Piron, 1976; Ptbk and PulmannovL, 1991, Varadarajan, 19681. New structures appeared such as orthomodular posets and orthoalgebras. Today all these structures, which were inspired by attempts at clarifying the mathematical foundations of quantum mechanics, are called quantum structures. In the early nineties an international association called International Quantum Structure Association (IQSA) was founded. It organizes Biennial Congresses where mathematicians, physicists, logicians, experts on quantum information, and philosophers interested in quantum structures can meet. It was in the nineties when the Slovak and Italian schools contributed an important new concept, namely that of a D-poset (difference poset), or equivalently, a weak orthoalgebra. Later the American school came up with the concept of an effect algebra. All these equivalent partial algebraic structures combine algebraic ideas with fuzzy set ideas. It turned out that this framework is suited for treating the space of effect operators of a Hilbert space as well as the important structures called MV-algebras. The concept of an MV-algebra was introduced by C.C. Chang [Chang, 19581 in 1958. These structures generalize two-valued logic, i.e. the logic having the truth values 0 and 1only, to an infinite-valued logic taking values from the whole , showed that there real interval [O,l]. Later in 1986, D. Mundici [ ~ u n d i c i19861 is a natural equivalence between MV-algebras and Abelian unital lattice-ordered groups with a strong unit u in the sense that any MV-algebra is isomorphic to an interval [O,u] of some Abelian unital lattice-ordered group with strong unit u. Today, MV-algebras constitute an important class of substructures of other quantum structures. For example, the compatible part (i.e. "classical one") of a lattice-ordered effect algebra forms an MV-subalgebra. For a nice survey of MV-algebras see [Cignoli et al., 20001. Recently, G. Georgescu and A. Iorgulescu [ ~ e o r ~ e s cand u Iogulescu, 20011 introduced the concept of a pseudo MV-algebra, which is a non-commutative generalization of the concept of an MV-algebra (now also called GMV-algebra). It is interesting that certain psychological processes may be viewed as illustrating such a non-commutative generalization of twevalued reasoning. The following experiment was performed in clinical medicine in connection with the transplantation of human organs. Two groups of people were asked the same two questions: (1) Do you agree to dedicate your organs for medical transplantation after your death? (2) Do you agree to accept organs of a donor, if neccesary? When the order of questions was changed in the second group, the number of positive answers to the first question was higher in the second group than in the first group. Today, there even exists a programming language [Baudot, 20001 based on a non-commutative logic.
Anatolij Dvurdenskij
4
Clearly, quantum mechanics provides an example. Quantum mechanical measurements are in general non-commutative; the result of an experiment may d e pend on the order of the measurements. Consider, for example, a beam of particles which are prepared in a certain state, and which are sent through a sequence of three polarizing filters Fl,Fz,F3. It is well-known that the order of the filters makes in general a difference. For example, let the filter be polarizing in planes perpendicular to the particle beam, such that FI polarizes vertically, Fz horizontally and F3 at a 45' angle. If we place the filters in the order Fl, Fz,F3,then no particles are detected, but in the order Fl,F3,F2,particles are detected; the difference is due to quantum interference. 20021 presented a represenFor pseudo MV-algebras, the author [~vure~enskij, tation via intervals [0,u], where u is a strong unit in an t-group not necessarily Abelian, thus generalizing a famous result of Mundici [Mundici, 19861 for MValgebras. In 2001, A. DvureEenskij and T. Vetterlein introduced the concept of a pseudo effect algebra and proved an analogue of the interval representation for these structures on the assumption of a special version of the Riesz decomposition property. In the present paper we concentrate on these non-commutative quantum struct ures. From the measure-theoretical point of view, the quantum structures mentioned above are important in the sense that on these structures a measure theory as well as a probability theory can be built up. This will be done below. We will see that, in the endeavour of establishing connections between different areas of mathematics we were led to beautiful mathematical constructions serving a useful unifying function. They serve as unifying tools in the study of diverse structures, such as algebraic structures, lattice ordered and partially ordered groups, probability theory, many-valued logic etc. and can be of use in the broader context of quantum mechanics, quantum computation and non-Kolmogorovian probability theory.
2 QUANTUM LOGICS, EFFECT ALGEBRAS AND D-POSETS
2.1
Orthomodular lattices and orthomodular posets
After the publication of the famous paper by Birkhoff and von Neumann [Birkhoff and von Neumann, 19361 there appeared a whole hierarchy of quantum structures. At the beginning there were orthomodular posets. We recall that an orthomodular poset (OMP, for short) is a poset L with two distinguished elements 0 5 1 and a unary operation ', called an orthocomplementation such that, for all a, b E L, we have (i) a" = a; (ii) b' 5 a' whenever a 5 b; (iii) a V a' = 1;
New Quantum Structures
(iv) a V b E L whenever a 5 b'; (v) b = a V (b A a') whenever a 5 b (orthomodular law). We write a I b whenever a 5 b', and we say that a and b are orthogonal or mutually exclusive. If an OMP is a lattice, we call it an orthomodular lattice (OML for short); if it is a a-complete lattice, we called it a quantum logic; if ai exists in L for any sequence of mutually orthogonal elements {G)of L, L is said to be an orthea-complete logic. See [~eltramettiand Cassinelli, 1981; Birkhoff, 1967; DvureEenskij, 1993; DvureEenskij and Pulmannovii, 2000; Gudder, 1979; Kalmbach, 1983; Maeda, 1980; Piron, 1976; Ptiik and Pulmannovii, 1991; Varadarajan, 19681. The most important example of a quantum logic is the quantum logic L ( H ) of a real, complex or quaternionic Hilbert space H , where L(H) consists of all closed subspaces M of H , and M I denotes its orthogonal complement; the partial order is set-theoretical inclusion. This example is of basic importance for so-called Hilbert space quantum mechanics. An equivalent structure is the system P ( H ) of all projectors on H. We say that two elements a and b of an OMP L are compatible if there exist three mutually orthogonal elements a l l bl, c in L such that a = a1Vc and b = bl Vc. We recall that an OMP L is a Boolean algebra iff all elements of L are compatible. This property shows that a system of mutually compatible elements generates a Boolean subalgebra of L. Compatibility is a very important property because the maximal sets of mutually compatible elements, called blocks, form Boolean subalgebras, and every OMP can be covered by blocks. So blocks constitute a locally classical part of an OMP, where the classical Kolmogorovian theory holds. States are, mathematically, represented as probability measures. Recall that a state on an OMP L is a mapping m : L + [0, 11such that m(1) = 1,and m(aVb) = m(a) m(b) whenever a Ib. If m is a-additive on L, i.e., m(Vi aj) = m(ai) for any sequence of mutually orthogonal elements {aj) for which Vi ai is defined in L, we call it a a-additive state. Similarly we define a completely additive state. It is well-known that every Boolean algebra admits a state, in fact plenty of states. For an OML this neesdn't be true. We have examples of stateless OMLs, [~reechie, 19711. An important construction of OMLs is due to Greechie [Greechie, 19681 using the technique pasting blocks. An overview on the latest development , on this topic see [ ~ a v a r a19761. D.J. Foulis and C.H. Randall [Foulii and Randall, 19721 introduced orthoalgebras which are more general than OMPs. We recall that an orthoalgebra is a set L with two distinguished elements O , 1 , and with a partial binary operation + : L x L t Lsuch that f o r a l l a , b , c ~ L w e h a v e
VEl
xi
+
+ + +
+
(OAi) if a b E L, then b + a E L and a b = b + a (commutativity); (OAii) i f b + c E L a n d a + ( b + c ) E L, t h e n a + b ~ L a n d( a + b ) + c ~L, and a (b c) = (a b) + c (associativity); (OAii) for any a E L there is a unique b E L such that a b is defined, and a + b = 1 (orthocomplement ation);
+
+
Anatolij DvureEenskij
6
(OAiv) if a + a is defined, then a = 0 (consistency). If the assumptions of (OAii) are satisfied, we write a + b + c for the element (a b) c = a (b c) in L. We introduce a partial order 5 on L via a 5 b iff a + c = b for some c E L, and we write a Ib 8 a + b exists in L. A state is a mapping m : L + [O,1] such that m(1) = 1 and m(a + b) = m(a) + m(b). For example, if we put a b := a V b whenever a Ib in an OMP, then we see that any OMP is an orthoalgebra.
+ +
+ +
+
2.2 Eflect algebras and D-posets In the early nineties, two former students of mine, F. KGpka and F. Chovanec [KGpka and Chovanec, 19941 introduced a new structure called a diflerence poset, D-poset for short. In these structures difference of comparable elements is a primary notion. A D-poset or a poset with difference is a system (P; I , @ ,0 , l ) consisting of a partially ordered set P with a partially defined binary operation 8 satisfying the following conditions for all a, b, c E P. (Dl) b 8 a is defined if and only if a 5 b; (D2) If a 5 b, then b 8 a 5 band b e ( b 8 a ) = a ; (D3) I f a < b < c , t h e n c 8 b 5 ~ 8 a a n d ( c 8 a ) ~ ( c 8 b ) = b 8 a .
+
+,
If P is a D-poset, then we can define a partial operation, such that a b = c iff c 8 b = a, and (P,+,0 , l ) is an effect algebra. Effect algebras as introduced by D. Foulis and M.K. Bennett [~oulisand Bennett, 19941, see also [Giuntini and Greuling, 19891, with addition as a primary notion, are structures equivalent to D-posets. We recall that an effect algebra is a non-empty set E with two distinguished elements 0, 1, and with a partial binary operation + : E x E + E such that, for all a, b, c E E, we have
+
+
+
+
(EAi) if a b E E, then b a E E and a b = b a (commutativity); (EAii) i f b + c € E and a + ( b + c ) E E , t h e n a + b ~E and ( a + b ) + c ~ E and , a (b c) = (a b) c (associativity); (EAiii) for any a E E there is a unique b E E such that a b is defined, and a b = 1 (orthocomplementation);
+ +
+ +
+
+
+
(EAiv) if 1 a is defined, then a = 0 (zereone law). Let a and b be two elements of an effect algebra E. We say that (i) a is orthogonal to b and write a I b iff a + b is defined in E; (ii) a is less than or equal to b and write a 5 b 8 there exists an element c E E such that a Ic and a c = b (in this case we also write b 2 a and c = b 8 a); (iii) b is the orthocomplement of a iff b is a (unique) element of E such that b I a and a + b = 1 and it is written as a'. It is clear that if E is an effect algebra, then (E, 5,8 , 0 , 1 ) is a D-poset. We recall that every orthoalgebra is an effect algebra, and an effect algebra is an orthoalgebra iff a I a implies a = 0.
+
New Quantum Structures
7
A basic example of effect algebras is the system E(H) of all Hermitian operators on a Hilbert space H between the zero operator and the identity. E(H) contains the system of all projectors, and E(H) is not a lattice. We recall that E(H) is a basic tool in secalled Hilbert space quantum mechanics. All algebraic structures defined above are, nowadays, called quantum structures. Another prototypical example of effect algebras is the following. Let (G, u) be an Abelian unital po-group with a strong unit u, and if
+,
+,
is endowed with the restriction of the group addition then (I'(G, u); 0, u) is an effect algebra. We say that an effect algebra E satisfies (i) the Riesz interpolation property, (RIP) for short, if, for all XI, xz, yl, yz in E, xi 5 yj for all i,j implies there exists an element z E E such that xi 5 z 5 yj for all i, j ; (ii) the Riesz decomposition property, (RDP) for short, if x 5 yl yz implies that there exist two elements X I , xz E E with XI 5 yl and xz 5 yz such that x = XI xz. We recall that (1) if E is a lattice, then E trivially satisfies (RIP); the converse is not true as we see below. (2) E has (RDP) iff, x l +xz = yl y2 implies that there 2 E such that XI = ~ 1 1 ~ 1 25, 2 = C Z ~ CZZ, exist four elements ell, cl2, C Z ~~, 2 E y1 = ell czl, and yz = clz czz, [ ~ v u r e ~ e n s kand i j Pulmannovi, 2000, Lemma 1.7.51. (3) (RDP) implies (RIP), but the converse is not true (e.g. if E = L(H), the system of all closed subspaces of a Hilbert space H , then E is a complete lattice but without (RDP)). On the other hand, every finite poset with (RIP) is a lattice. A partially ordered Abelian group (G; +, 0) is said to satisfy the Riesz decomposition property provided, given x, yl, y2 in GS such that x 5 yl yz, there exist X I , x2 in G+ such that x = x l xz and x j 5 yj for each j = 1,2. This condition is by [Goodearl, 1986, Prop 2.11 equivalent to the following two equivalent conditions:
+
+
+
+ +
+
+
+
+
(a) Given XI, 2 2 , yl, y2 in G such that xi 5 yj for all i,j , there exists z in G such that xi 5 z 5 yj for all i,j . (b) Given xl,x2, yl, y2 in G+such thatx1+x2 = yl+yz, thereexist zll,z12, z21, z22 in G+ such that xi = zil zi2 for each i and yj = z~ z2j for each j .
+
+
According to [Goo], a group G with the %esz decomposition property is said to be an interpo2ation group. It is clear that if (G,u) is a unital interpolation group, then E = I'(G,u) has (RDP) . We recall that by a universal group for an effect algebra E we mean a pair (G, 7) consisting of an additive Abelian group G and a G-valued measure 7 : E -+ G (i.e., ~ ( ab) = ~ ( a ) ~ ( b whenever ) a b is defined in E ) such that the following
+
+
+
lAn element u E G+ is said to be a strong unit for a po-group G , if given an element g E G , there is an integer n 2 1 such that -nu 5 g 5 nu.
8
Anatolij DvureEenskij
conditions hold: (i) 7(E) generates G. (ii) If H is an additive Abelian group and 4 : E -+ H is an H-valued measure, then there is a group homomorphism qS : G + H such that 4 = qS o 7. According to [~oulisand Bennett, 19941, every effect algebra possesses a universal group. Ravindran [Ravindran, 19961 ([Dvure~enskijand PulmannovB, 2000, Theorem 1.17.171) proved the following important result. THEOREM 1. Let E be an effect algebra with the Riesz decomposition property. Then there exists a unital interpolation group (G, u) with a strong unit u such that r ( G , u) i s isomorphic to El and there i s a G-valued injective measure 7 such that (G, 7) i s a universal group for E. One can even prove categorical equivalence. Let REA be the category of effect algebras with the Riesz decomposition property, i.e. whose objects are effect algebras satisfying the %esz decomposition property whose morphisms are the homomorphisms of effect algebras, and let UCGZ be the category of unital Abelian Ggroups with interpolation with the morphisms taken to be the Lhomomorphisms preserving the distinguished strong unit. The mapping r : ULGZ -+ REA defined by (G, u) cr r(G, u), and r(h) = hlr(G, u ) , is a functor. THEOREM 2. The functor r defines a categorical equivalence between the category ULGZ of unital Abelian t-groups with interpolation and the category REA. Moreover, if h i s a morphism of unital l-groups with interpolation, then h is injective if and only if r(h) i s injective, and h i s surjective if and only if r ( h ) is surjective. As a corollary we have that every effect algebra with (RDP) has at least one state (the definition of a state is the same as that for orthoalgebras), moreover, every state on r(G, u) is the restriction of a unique.state on (G, u). We recall that a state on (G, u) is any mapping s : G --+ W such that (i)s(g h) = s(g) s(h), g, h E G, (ii) s(g) 2 0 whenever g 2 0, and (iii) s(u) = 1. We recall that a poset (E; 5 ) is an antilattice if only comparable elements of E have an infimum or a supremum. It is clear that any linearly ordered poset is an antilattice and every finite effect algebra with (RIP) is a lattice. The Ravindran result can also be reformulated in the following form:
+
+
THEOREM 3. Every effect algebra E with ( R D P ) i s a subdirect product of antilattice effect algebras with (RDP), and all existing meets and joins in E are preserved in the subdirect product.
2.3 Perfect efect algebras In this subsection, we define a class of perfect effect algebras and we show that they are categorically equivalent to Abelian po-groups. Let G be a directed Abelian po-group and define the lexicographical product
New Quantum Structures
9
where Z is the group of all integers. Then the element (1,O) is a strong unit in the po-group G(Z) and E(G) := F(G(Z), (1, 011, (2.1) is an effect algebra. Every element a E E(G) is of the form either a = (1, -g) or a = (0, g), where g E G+. In addition, if G is a directed interpolation group, then G(Z) is an interpolation group, [~oodearl,1986, Cor 2.121, and E(G) satisfies the %esz interpolation property. Let a be any element of an effect algebra E and n an integer (n 2 0). We define recursively Oa:=O, l a = a , ( n + l ) a = n a + a , n L 1 ,
+
supposing that n a and n a a are defined in E . An ideal of an effect algebra E is a non-empty subset I of E such that (i) x t: E, y E I, x < y imply x E I, and (ii) ifx,y E I and x + y is defined in E, then x + y E I. An ideal I is said to be a Riesz ideal if, for x E I, a, b E E and x < a b, there exist al, bl E I such that x < a1 bl and a1 5 a and bl 5 b. For example, if E has (RDP), then any ideal of E is Riesz. Let A be a subset of an effect algebra E satisfying (RDP). Then the ideal Io(A) of E generated by A is the set
+
+
We denote by Z(E) the set of all ideals of E; then {0), E E Z(E). We recall that if E is linearly ordered, then Z(E) is linearly ordered with respect to setIzbe two ideals of E and assume a € Il \ I2 theoretical inclusion. Indeed, let 11, and b E I2\ Il. We can assume that, e.g., a b which gives a E 12, a contradiction. An element a is said to be infinitesimal if na is defined in E for any integer n 2 1, and denote by Infinit(E) the set of all infinitesimals of E. Then (i) 0 E Infinit(E), (ii) if b E E, a E Infinit(E) and b 5 a, then b E Infinit(E), and (iii) 1 $ Infinit(E). A proper ideal I of an effect algebra E is said to be mmzmal if is not a proper subset of some proper ideal of E (or equivalently, I is a value of 1). By Zorn's lemma E possesses at least one maximal ideal, and let M ( E ) be the set of all maximal ideals of E . We define the radical of E, Rad(E), by
<
It can be proved that if a A b is defined in an effect algebra E, then (a - (a A b)) A (b - (a A b)) = 0. PROPOSITION 4. Let E be an effect algebra satisfying (RDP). Then Infinit (E)
Rad(E).
Anatolij DvureEenskij
10
Proof. Suppose that a 4 R a d ( E ) . T h e n there exists a maximal ideal I o f E such that a 4 I . Hence, t h e ideal I o ( I , a ) generated b y I and a must coincide with E. Therefore, there exist elements z E I , a:, .. . ,a: E E with a: 5 a (i = 1 , . . . , k ) such that 1 = z + a: + . . . + a:. I f a E Infinit(E), t h e n k a 5 a' and one would have z + a: + . . . + a: = a + a', so that z = a (a' - (a: . . . a:)) 2 a, whence a E I , a contradiction. Hence, a 4 Infinit(E) and Infinit(E) C R a d ( E ) . rn
+
+ +
It is useful t o recall that it is possible t o have inequality i n (2.2). Inspired b y this, we say that an effect algebra E has t h e Rad-property if Infinit ( E ) = R a d ( E ) . T H E O R E M 5. Assume that E is an effect algebra with ( R D P ) of one of the following kinds: ( 1 ) E i s a lattice. ( 2 ) E i s a simple effect algebra. (3) E = E ( G ) := I'(G(Z), (1,0 ) ) , where G ( Z ) i s the lexicographical product of Z with a directed Abelian po-group G with interpolation. ( 4 ) For any x E El x 5 1 - x or 1 - x 5 x. Then E has the Rad-property. I n addition, in (3), Infinit(E) i s the unique maximal ideal of E. PROPOSITION 6. Let E be an effect algebra with ( R D P ) satisfying the Radproperty. Then R a d ( E ) i s a commutative semigroup with respect to such that
+
( i ) 0 i s a neutral element, (ii) the cancellation law holds in R a d ( E ) , (iii) if a b = 0 for a , b E R a d ( E ) , then a = b = 0 . ( i v ) R a d ( E ) n R a d l ( E ) = 012 ( v ) if a, b E R a d ' ( ~ ) then , a + b i s not defined in El ( v i ) if a E R a d ( E ) and b E ad'(^), then a 5 b.
+
+
+
Proof. Assume a, b E R a d ( E ). T h e n a = a1 c and b = bl c, where a l l bl, c E E and a1 bl c E E . T h e n a l l bl, c E R a d ( E ) . B y t h e Rad-property, we have a1 bl c E Infinit(E) = R a d ( E ) , therefore, (a1 bl c) (a1 bl c) E E which gives a b is defined in E, consequently, a b E R a d ( E ) . T h e conditions (i)-(iii) are now evident. (iv) Assume a E R a d ( E ) n R a d t ( E ) . T h e n a E R a d l ( E ) , so that a' E R a d ( E ) which gives 1 = a + a' E R a d ( E ) , a contradiction. ( v ) Assume a b E E. T h e n a 5 b' E R a d ( E ) , which implies a E R a d ( E ) , a contradiction. ( v i ) I f b E R a d 1 ( E ) ,t h e n b' E R a d ( E ) , which implies a+ b' is defined in R a d ( E ) . Hence a 5 (b')' = b.
+ + + + +
+ + + +
+
2~A f
E, then A' := {a' : a E A).
+ +
New Quantum Structures
11
We say that an effect algebra E with (RDP) and the Rad-property is perfect if, for any element a E E either a E Rad(E) or a' E Rad(E). For example, E(G), where E(G) is defined by (2.1) for a directed po-group G with interpolation is a perfect algebra. In the sequel we show that every perfect effect algebra is of this nature. Let PEA be the category of all perfect effect algebras where the objects are perfect effect algebras and the morphisms are the homomorphisms of effect algebras. Let GZ be the category of Abelian po-groups, where the objects are directed Abelian po-groups with interpolation and the morphisms are the homomorphisms of po-groups, i.e. positive homomorphisms of po-groups. We define a mapping E : GZ -+ PEA by
and if h is a morphism of Abelian po-groups, we set
where g E G+ . Then E is a functor and, moreover, it is a faithful and full functor. PROPOSITION 7. Let E be a perfect effect algebra. T h e n there i s a unique (up t o isomorphism) directed Abelian po-group G with inte~polationsuch that E E(G).
Proof. Let E be a perfect effect algebra. By Proposition 6, Rad(E) is a cancellative semigroup satisfying the conditions of Birkhoff [Fuchs, 1963, Thm 11.41 which guarantee that Rad(E) is a positive cone of a unique (up to isomorphism) po-group G. Since E has (RDP), G is a directed Abelian po-group with interpolation. Without loss of generality, we can assume that any element g E G can be written in the form g = gl - gz with gl,gz E Rad(E). The mapping y : Rad(E) -t G given by y(a) := a, a E Rad(E),
+
is injective and preserves in Rad(E). Define E(G) by (2.1). By Theorem 5, E(G) is a perfect effect algebra, and define a mapping f : E -+ E(G) by f (a) = (0, a) and f (a') = (1, -a) if a E Rad(E). Then f is an isomorphism of the effect algebras E and E(G). rn We now present the main result on categorical equivalence of the category of perfect effect algebras and the category of directed Abelian po-groups with interpolation. 2006al). E i s a categorical equivalence of the cateTHEOREM 8 ([~vure~enskij, gory GZ of directed Abelian po-groups with interpolation and the category PEA of perfect effect algebras. THEOREM 9. Let E = r ( G , u), where (G, u) i s a n Abelian unital po-group with (RDP). T h e n E is a n antilattice if and only if G is a n antilattice.
Anatolij DvureEenskij
12
As a corollary, we have the following result. 2006al). Every perfect effect algebra E is a subdiTHEOREM 10 ([~vure~enskij, rect product of antilattice perfect effect algebras.
2.4
MV-algebras and compatibility in eflect algebras
MV-algebras entered mathematics by Chang [Chang, 19581 in 1958. In the sequel we show that a subsytem of an effect algebra which corresponds t o a Boolean subsystem of an OMP, i.e. a compatible block, is just an MV-subalgebra. We recall that an MV-algebra is an algebra M := (M; @, @,* ,O,l) of type (2,2,1,0,0) such that, for all a, b,c E M, we have (MI) (M2) (M3) (M4) (M5) (M6) (M7) (M8)
a@b=b@a; (a @ b) @ c = a @ (b @ c); a@O=a; a@l=l; (a*)* = a; a @ a* = 1; O* = 1; (a* @ b)* @ b = (a @ b*)* @ a.
+
If we define a partial operation + on M in such a way that a b is defined in E iff a 5 b*, then a b := a @ b, then (M; 0 , l ) is an effect algebra with the Riesz decomposition property. MV-algebras appeared in connection with effect algebras in many natural ways: , showed that starting from an AF C*-algebra we can Mundici [ ~ u n d i c i 19861 obtain an countable MV-algebra and, conversely, any countable MV-algebra can be derived in such a way. Bennett and Foulis [Bennett and Foulis, 19951 introduced @-symmetric effect algebras which are exactly the MV-algebras, and the Boolean D-posets of Chovanec and KGpka [Chovanec and KGpka, 19921 are MV-algebras too. Suppose that (G, u) is an Abelian unital l-group, and on r ( G , u) we define
+
+,
Then (I'(G, u),.@,@,* ,0, u) is an MV-algebra. , gives that r ( G , u) is a protoThe famous theorem of Mundici [ ~ u n d i c i19861 typical example of MV-algebras. Let MY be the category of MV-algebras, whose objects are MV-algebras and morphisms are homomorphisms of MV-algebras, and let ULB be the category of Abelian unital l-groups whose objects are Abelian unital l-groups and morphisms are l-homomorphism of unital l-groups preserving distinguished strong units. THEOREM 11 ([Mundici, 19861). Every MV-algebra M is isomorphic to r ( G , u) for some Abelian unital l-group (G, u) .
New Quantum Structures
13
Moreover, r defines a categorical equivalence between the category of MV-algebras,
M V , and the category UCB. MV-algebras play a similar role with respect to effect algebras as Boolean algebras do with respect to orthomodular posets - they describe maximal sets of v~, mutually (strongly) compatible elements. Moreover, RieEanovB [ ~ i e ~ a n o20001 recently proved an important result to the effect that every lattice ordered effect algebra can be covered by MV-subalgebras. Two elements a and b of an effect algebra E are said to be (i) compatible and write a ct b if there exist three elements a l , bl, c E E such that a = al+c, b = bl +c and a1 + bl + c E E, and (ii) strongly compaible and we write a A b if there are three elements a l , bl, c E E such that a = a1 c, b = bl c, a1 A bl = 0 and a1 bl + c E E. We recall that (i) if a t% b, then a tt b, (ii) a tt b (a A b) implies b * a C a); (iii) 0 A a 1; (iv) if a 5 b, then a b, (b = (b - a) a, (b a=O+a).
+
+
+
-
+
We show that if a A b, then the corresponding elements a l , bl, c are uniquely determined in E with (RIP). If a and b are only compatible, there is possible to find more triples of a l , bl, c satisfying a = a1 c, b = bl c and a1 bl c E E.
+
+
+ +
PROPOSITION 12. Let an effectalgebra E satisfy (RIP). If a = a1 +c, b = bl +c withal Abl = O andal + b l + c E E, t h e n a A b = c , a V b = a l +bl +c.
<
<
< <
Proof. We have c a, b. If d a, b, there exists E E such that c, d do a, b. Hence 4 - c 5 a - c = al, - c 5 b - c = bl, so that 4 - c 5 a1 A bl = 0. Put u = a1 bl c. Then u 2 a, b. Assume e 2 a, b. There exists eo E E such that u , c eo a, b. Then u - eo u - a = bl and u - eo u - b = a1 so that u - eo = 0 and u = eo e. rn
+ +
> >
<
<
Let E = (0, a, b, c, d, I ) , where the addition
a b c d l '
a b c d l O 1
d c l x x a c
c l x x d x l x x x x x l x x x x x x x b c d l d a b O
<
+ is defined in the table.
Anatolij DvureEenskij
14
Then E is an effect algebra which is not a lattice and without (RIP), but all elements of E are strongly compatible and e.g. c d and cVd E E but cAd 6E aswellasa&b,aAb~EbutaVb$E. THEOREM 13. Let an effect algebra E satisfy (RIP). The following statements are equivalent. (i) a ~ b a n d a A b ~ E . (ii) a o b a n d a v b E. ~
C
(iii) a b. (v) a V b , a A b E E a n d ( a V b ) - b = a - ( a ~ b ) . (iv) a V b , a A b ~ E and ( a V b ) - a = b-(aAb). PROPOSITION 14. In an antilattice effect algebra E with (RIP) a only if a A b E E.
b if and
We say that an effect-algebra E satisfies the difference-meet property, (DMP) for short, if x 5 y, x A z E E and y Az E E imply (y -x) A z E E. For example every latticeordered effect algebra satisfies the difference-meet property. On the other hand, Example 15 gives an example of an antilattice effect algebra with (RIP) and (RDP) where the difference-meet property fails. In addition, it can be shown that there exist two elements a, b E E such that a A b, a tt b' but a #+b', and b & b'. EXAMPLE 15. Let G be the additive group W2 with the positive cone of all (x, y) such that either x = y = 0 or x > 0 and y > 0. Then u = (1,l) is a strong unit for G. The effect algebra E = r(G, u) is an antilattice having (RIP) and (RDP) but E is not a lattice. THEOREM 16 ([DvureEenskij, 2002al). Every block of an effect algebra E with (RIP) and (DMP) is an effect subalgebra of E which is an MV-algebra. Moreover, any such effect algebra is the set-theoretical union of its blocb. THEOREM 17 ([Dvure~enskij,2002al). Every effect algebra E satisfying (RIP) and (DMP) is a set-theoretical union of MV-algebras. THEOREM 18 ([~vure~enskij, 2002al). Every effect algebra E satisfying (RIP) is the set-theoretical union of blocks which are distributive sublattices of E.
2.5 Visualixation o j eflect algebras with (RDP) In the present subsection, we show that effect algebras with (RDP) and MValgebras can be represented and visualized by a set of automorphisms of an antilattice or a linearly ordered set. Let (R, 5 ) be a non-empty antilattice, and let A(R) be the set of all automorphisms a : R + R preserving the partial order 5. Then A(R) can be converted into a pegroup such that the groupaddition is the composition of automorphisms,
15
New Quantum Structures
the order on A(R) is defined via a 5 P iff (w)a 5 (w)P for all w E R, and the neutral element is the identity function on R. Holland [Holland, 19631 proved the basic result that every &group can be embedded into the &group A(R) for some linearly ordered set 51, and Glass [Glass, 1972, Thm 541 generalized this result to directed po-groups satisfying (RIP) showing that every such a pegroup can be embedded into the po-group A(R) for some antilattice $2. We show that a similar result can also be proved for effect algebras. Namely, we prove that every pseudo effect algebra E satisfying (RDP) can be represented as a set of automorphisms of an antilattice R. Such a representation allows us to present effect algebras in a visualized form which can be useful for a more precise investigation of effect algebras. THEOREM 19 ([Dvure~enskij,2002~1). Every effect algebra E with (RDP) can be represented as a n effect algebra of automorphisms of A(R) for some antilattice set R such that all finite infima and suprema existing in E are preserved. If M is an MV-algebra, then M is an effect algebra with (RDP) and then its visualization has the following form. COROLLARY 20. Every MV-algebra M can be represented as a n MV-algebra of automorphisms of A(R) for some linearly ordered set R. The case of the visualization of pseudo effect algebras will be studied below, Subsection 4.6.
2.6 Loomis-Sikorski theorem for eflect algebras The Loomis-Sikorski theorem plays an important role in the study of Boolean a-algebras, see [Sikorski, 19641. Its generalization to a-complete MV-algebras (i.e. MV-algebras which are a a-complete lattice) was proved independently by 20001 and by Mundici [ ~ u n d i c i19991. , It was shown the author [~vure~enskij, that a-complete MV-algebras are always a-homomorphic images of tribes, i.e., of a-complete MV-algebras of fuzzy sets. In [~uhagiaret aL, 20061, we generalized the Loomis-Sikorski theorem to monotone a-complete effect algebras proving that the latter are a-homomorphic images of effect-tribes which are monotone a-complete effect algebras of [0, 11-valued functions with (RDP). Of crucial help was a delicate result of Choquet [Alf, p. 491 which says that the set of extremal states is always a Baire space (not necessarily compact as in the case of MV-algebras). An effect algebra E is monotone a-complete provided that for every ascending (descending) sequence XI 5 xz 5 . . (xl 2 x2 2 . ) in E which is bounded above (below) in E has a supremum (infimum) in E.
.
.
THEOREM 21. Let (G, u ) be a n interpolation group with strong unit. (1) (G, u) is monotone a-complete if and only if E = r ( G , u) is monotone acomplete.
16
Anatolij DvureEenskij
(2) If E = r(G, u) is monotone a-complete, then G is Archimedean. LEMMA 22. Let E be a monotone a-complete effect algebra with (RDP). Let a, b E E. The following two statements are equivalent. (i) s(a) = 0 for each s E Exts(E) implies a = 0. (ii) s(a) = s(b) for each s E Exts(E) implies a = b. Given a compact convex subset K of a topological vector space, we denote by Aff(K) the collection of all affine continuous functions on K . Of course, Aff(K) is an Archimedean partially ordered group and 1 is its strong unit, which is a subgroup of C(K), the system of all continuous real-valued functions on K . Unlike C(K), the space Aff(K) need not to be a lattice. The following lemma ( [ ~ u n c eet al., 1999, Lem 71, [Wright, 1973, Cor 31) will play a crucial role in our investigation. LEMMA 23. Let {a,} be a monotone descending sequence of nonnegative finctions in Aff(K), and let a(x) = limn a,(x) for any x E K . Then A, a, = 0 in Aff(K) if and only if {x E d K : a(%) > 0) is a meager subset in dK, where d K is the set of extreme points of K. The following representation theorem for monotone a-complete interpolation 16.151. groups with strong unit is from [~oodearl,19861
or
THEOREM 24. Let (G, u) be a nonzero monotone a-complete intelpolation group with strong unit and set A = {f E Aff(S(G, u)) : f (s) E s(G) for all discrete s E Exts(G, u)}. Then the natural mapping 4 : G --+ Aff(S(G,u)) provides an isomorphism of (G, u) onto (A, 1) (as ordered groups with strong unit). REMARK 25. In Theorem 24 we have that A is monotone u-complete and, moreover, if f € Aff(S(G, u)), f 5 4(gi), gj € G, for any integer i 2 l, then there is a g E G such that f 5 4(g) 5 4(gi) for any i, see [Goodearl, 1986, Lem 16.171. Therefore, suprema and infima existing in A are the same as those taken in Aff (S(G, 21)). An effect-tribe on a set a # 0 is any system 7 C [O,l]" such that (i) 1 E 7, (ii) i f f E 7, then 1- f E 7, (iii) if f , g E 7 , f 5 1-g, then f + g € 7, and (iv) for any sequences {f,} of elements of 7 such that f, /' f (pointwisely), then f E 7. It is evident that any effect-tribe is a monotone a-complete effect algebra. We recall that given a family B of [O, 11-valued functions on R there is a minimal effect-tribe, '&(B), on 0 generated by B. The following result is a Loomis-Sikorski theorem for monotone a-complete effect algebras with (RDP). Its proof uses the previous theorems.
17
New Quantum Structures
THEOREM 26 ( [ ~ u h a ~ iet a ral., 20061). Let E be a monotone a-complete effect algebra with (RDP). Then there are a convex space 51, an effect-tribe 7 of [O,l]valued functions on 51 with (RDP) and a a-homomorphism h from 7 onto E. An analogous result for a-complete MV-algebras needs the following notion. We recall that a tribe on 51 # 0 is a collection 7 of fuzzy sets from [O,l]" such that (i) 1 E 7, (ii) i f f E 7,then 1- f E 7,and (iii) if {f,}, is sequence from 7,then min{Cz==lf,, 1) E 7 . The Loomis-Sikorski theorem for a-complete MV-algebras is as follows. 2000; Mundici, 19991). Every a-complete MVTHEOREM 27 ([~vure~enskij, algebra M is a a-homomorphic image of a tribe of fuzzy sets.
2.7 Product egect algebras We now introduce product effect algebras. Using the representation theorem for effect algebras with the Riesz decomposition property we show that they are categorically equivalent to unital perings with interpolation. A product on an effect algebra E = (E; 0,1) is any total binary operation . on E such that, for all a, b, c E E, the following holds: If a b is defined in E, thena.c+b-candc.a+c.bexistin E and
+,
+
and we say that E with a product . is a product eflect algebra, and we write E = (E; +, .,0 , l ) . An element u of a product effect algebra E is said to be a unity, ifa.u=u.a=aforany a E E . A product . on E is (i) associative if (a . b) - c = a . (b . c), a, b, c E E ; (ii) commutative if a . b = b - a, a, b E E . It is worth saying that i f . is a product on E, then (iii) a . 0 = 0 = 0 . a; (iv) i f a s b , thenfor any C E E a, . c s b . c a n d c . a I c . b .
-
+
+
Property (iii) follows easily from the following: a 0 = a . (0 0) = a . 0 a - 0 , and the cancellation property gives a . 0 = 0. Similarly, 0 . a = 0. We recall that every effect algebra E possesses at least one commutative and associative product, namely the zero product, i.e. a . b = 0 for all a, b E E . We recall that a po-ring is a ring (R; .,0) such that (i) (R; 0) is an additive 0 and a . a 0 for any c, a 0. If u is a strong Abelian po-group, and c a unit for R, i.e., for any a E R there is an integer n 1 such that a I nu, and if u - u 5 u, then the effect algebra
>
+,
>
>
>
+,
18
Anatolij DvureEenskij
is a product effect algebra with the product . which is the restriction of the ring product . to E x E; the product . is commutative or associative on r ( R , u) whenever so is . on R. For example, if (W; +, .,0) is the ring of the real numbers, then the standard interval [O,1] := r(W, 1) is a product effect algebra. We now present the two main results of this subsection the proof of which uses the basic representation theorem 2.
+,
THEOREM 28 ([DvureEenskij, 2002dl). Let (E; .,0 , l ) be a product effect algebra with the Riesz decomposition property. T h e n there exists a unique (up t o isomorphism) unital po-ring (R, u) satisfying the Riesz decomposition property with the product - and with u u 5 u such that E r ( R , u) and q5(a . b) = q5(a) . q5(b), where q5 i s a n isomorphism of E onto r ( R , u ) preserving the product .. I f . is commutative or associative, so i s . o n R. Denote by PRUDE^ the category of product effect algebras, i.e. its objects are product effect algebras and its morphisms are homomorphisms of effect algebras also preserving .. We denote by R the category of associative unital interpolation po-rings (R, u) with a distinguished strong unit u such that u . u u, and its morphisms are homomorphisms of po-groups which preserve . and the distindefined guished strong units. We denote by rRthe map from R into by ~ R ( ( R+, ; . , 0 , 5 , u ) ) := (r(R,u); -,O,u), and r ~ ( f := ) f lr(R, u ) . THEOREM 29 ([~vure~enskij, 2002dl). T h e functor defines a categorical equivalence of the category R of unital associative interpolation po-rings with a strong unit u such that u . u 5 u and the category PRODEA of product effect algebras.
<
+,
+,
PROPOSITION 30. Let P be a proper ideal of a product effect algebra (E; ., 0 , l ) with the (RDP). If al ~p a2 and bl N p b2, then a1 .bl ~p a2.b2. I n addition, E/P is a product effect algebra with the induced product . defined wia
[ a ] p - [ b ] p : = [ a . b ] ~(,a , b E E ) , and the canonical mapping f : E + EIP given by f ( a ) = [ a l p , a E E , i s a surjective homomorphism preserving all existing joins, meets and the product in E. THEOREM 31 ([~vure~enskij, 2002dl). Every product effect algebra (E; +, .,0 , l ) with the (RDP) hawing 1 as a product unity i s a subdirect product of antilattice product effect algebras with the (RDP). Moreover, we can find a n injective homomorphism into the subdirect product that preserves all existing meets, joins and the product in E. We now present some effect algebras that admit products. PROPOSITION 32. If e is unity of a product effect algebra E , then e = 1. Moreover, l i s u n i t y f o r . i f a n d o n l y i i f o r a n y a E E, a . 1 2 a a n d 1 . a L a . PROPOSITION 33. A finite effect algebra E which i s a lattice and has (RDP) admits a product . such that a . 1 = a = 1 . a for a n y a E E if and only if E
New Quantum Structures
19
i s a Boolean algebra, i.e., a V a' = 1 for any a E E . If this i s the case, then a . b = a A b E E. We recall that G+ of a po-group G is Archimedean if, for some a, b E G+ with n a 5 b for any n 2 1, a = 0. PROPOSITION 34. Let E be a perfect effect algebra and define a binary operation as follows. For a , b E Rad(E), let
-
Then . i s a commutative product o n E such that a 1= a = 1. a for any a E E . Let E = I'(Z x,l G, (1,O)) and let G+ be Archimedean. Then o n E there is a unique product . such that a - 1 = a = 1. a for any a E E; this product i s defined by (2.3). 3 PSEUDO MV-ALGEBRAS Recently, G. Georgescu and A. Iorgulescu [Georgescu and Iogulescu, 20011 introduced pseudo MV-algebras (sometimes also called GMV-algebras) which are a non-commutative generalizations of MV-algebras introduced by C.C. Chang [Chang, 19581 and which may be viewed as constituting an extension of twovalued logic. Such a non-commutative generalization of two-valued reasoning can be found e.g. in psychological processes. J. Rachiinek [~achiiek,20021 introduced non-commutative MV-algebras, which in fact are equivalent to pseudo MValgebras. Today we can observe an interest in noncommutative reasoning. On the other hand, the author's representation theorem [Dvure~enskij,20021 allows for a bridge between different areas of mathematics: the generalized Mundici functor, I?, allows us to study unital t-groups via pseudo MV-algebras, in particular finer varieties, or more precisely, their analogues. For some open problems on pseudo i j Holland, to appear]. MV-algebras, see [ ~ v u r e ~ e n s kand
3.1 Elements of pseudo MV-algebras In this subsection we present the basic notions of the theory of pseudo MValgebras. DEFINITION 35. A pseudo MV-algebra is an algebra ( M ; @ , - ," ,O,1) of type (2,1,1, 0,O) such that the following axioms hold for all x, y, z E M with an additional binary operation @ defined via
(Al) x @ ( y @ z) = (x @ y ) @ z ;
Anatolij DvureEenskij
(A2) (A3) (A4) (A5) (A6) (A7) (A8)
x@O=O@x=x; x@l=l@x=l; 1" = 0; 1- = 0; (x- €3 y-)" = (x" @ yN)- ; x @ ( x " O y ) = y @ ( y N O ~ ) = ( ~ O ~ - ) @ ~ = ( ~ ~ ~ - ) @ ~ ~ X O ( X - @ ~=) ( x @ y N ) O y ; (x-)" = x.
If we define x 5 y iff x- @ y = 1, then 5 is a partial order such that M is a distributive lattice with x V y = x @ (x" y) and x A y = x @ (x- @ y). For basic properties of pseudo MV-algebras see [Georgescu and Iogulescu, 20011. A pseudo MV-algebra M is an MV-algebra iff x @ y = y @ x for all x, y E M. For example, if u is a strong unit of a (not necessarily Abelian) 1-group G,
and
then (I'(G, u); @,- ," ,0, u) is a pseudo MV-algebra [Georgescu and Iogulescu, 20011. Let (M; @,- ," ,0,1) be a pseudo MV-algebra. Define a partial binary operation on M via: x y is defined iff x 5 y-, and in this case
+
+
+ +
It is clear that x y is defined iff y 5 xN. In addition a 5 b iff there exists c E M such that a c = b iff there exists d E M such that d a = b. Moreover, for a 5 b, we define two partial subtractions, \ and / by a / b := a"Obandb\
[email protected]+a/b=b=b\a+a. We recall that the pseudo MV-algebra (I'(G, u); @,- ," ,O, u) is an archetype of pseudo MV-algebras by the following basic representation theorem for pseudo MV-algebras which was proved in [Dvure~enskij,1993, Thm 3.9, Thm 6.41 and which generalizes a famous result of Mundici [Mundici, 19861 for MV-algebras, see Theorem 11:
+
THEOREM 36 ([~vure~enskij, 20021). For any pseudo MV-algebra M, there exists a unique (up to isomorphism) unital 1-group G with a strong unit u such that M I'(G,u). The functor I' defines a categorical equivalence of the category of pseudo MV-algebras with the category of unital 1-groups. Moreover, zf h is a given
New Quantum Structures
21
isomorphism of M with r ( G , u), ( G ,h ) is the universal group for M : that is, for any partially ordered group ( K ; <,0) and any order and preserving mapping g : M 4 K there is a homomorphism of partially ordered groups g' : G -+ K such that g = g'o h.
+
+,
W e present two independent proofs of this basic statement: ( 1 ) using the above derived partial addition + and the Bosbach representation o f semiclans, and ( 2 ) using the word technique for pseudo effect algebras with (RDP2),see subsection 4.2. be derived partial addition. The following properties PROPOSITION 37. Let hold in any pseudo MV-algebra M .
+
(i) x + O = x = O + x f o r a n y x E M . (ii) x + x W = 1 = x - + x f o r a n y x ~ M . (iii) If x- y = 1, then y = x . (iv) If x y = 1, then y = x" and x = y-. ( v ) Let x y and ( x y) z be defined i n M . Then y defined i n M , and ( x + y ) z = x + ( y + z).
+ + +
+ +
+z
and x
+ ( y + z ) are
+
Similarly, if y+z and x+(y+z) are defined in M , so arex+y and (x+y)+z. (vi) y x + b = y, then b = x " O y. (vii) If x + yl = x y2, then yl = y2. (viii) If xl y = 2 2 y, then X I = xz. (ix) I f y = a + x , t h e n a = y @ x - . (x) I f x A y = 0 , thenx+y and y+x are defined i n M , a n d x + y = x V y = y+x.
+
+ +
PROPOSITION 38. (i) If a+ bl and a+b2 exist in M , then a+ (bl V bz) is defined in M , and a
+ (bl V b2) = ( a + bl) V ( a + b2).
+ a and b2 + a exist in M , then (bl V b2)+ a is defined in M , and (bl V bz) + a = (bl + a ) V (b2+ a). (iii) If a + bl and a + b2 exist i n M , then a + (bl A b2) is defined i n M , and a + (bl A b2) = ( a + bl) A ( a + b2). (iv) If bl + a and b2 + a exist i n M , then (bl A bz) + a is defined i n M , and
(ii) If bl
(bi Abz) + a = (bi + a ) A (bz + a). PROPOSITION 39. For all x , y of a pseudo MV-algebra M we have:
Anatolij DvureEenskij
22
(a) x O ( x A y ) - = x O y - . (b) X O ( X A Y ) - + Y = X O Y - + ~ = X V Y . ( c ) ( x A y)"O y = x" O y, X V y = x + ( x A y)"O y. (d) ( X V Y ) O ~ = - XO(ZAY)-=xo~-. (e) y" O ( x V y) = y" O x = ( x A y)" O x. PROPOSITION 40. In any pseudo MV-algebra M we have the following cancellation laws. ( i ) If a
+ bl I a + b
2,
then bl 5 b2.
+ b 5 a2 + b, then a1 5 az. (iii) If a + b is defined i n M , and if a1 5 a and bl 5 b, then a1 + bl is defined in (ii) If a1
M , andal+bl I a + b . In our subsequent reasoning the notion o f a semiclan introduced b y Bosbach will be crucial. W e say that ( C ;A, +) is a semiclan i f it is a A-semilattice and a partial groupoid with respect t o such that the following axioms are satisfied:
+
( C l ) I f a 5 b, then there exist x , y E C such that b = a
+ x and b = y + a.
(C3) I f a + x , a + y E C , t h e n ( a + x ) ~ ( a + y )= a + ( x ~ y ) a, n d i f x + a , y+aE C , then ( x a ) A ( y a ) = ( x A y) a.
+ + + (C4) a + b, ( a + b) + c E C i f fb + c, a + (b + c) E C , and i n this case we have ( a + b ) + c = a+ (b+c).
I t is clear that if G is an e-group, then (G+;A, +) is a semiclan, and b y Bosbach [Bosbach, 1981, p. 3211, for any semiclan ( C ;A, +) there exists an e-group G with t h e positive cone G+ such that C can be embedded into some semiclan ( G S ;A, +) preserving +, A, and all existing V in C . PROPOSITION 41. Let ( M ;@,- ," ,0,1) be a pseudo MV-algebra and let + be defined as above. Then ( M ;A, +) is a semiclan, and, moreover, there exist an f-group Go with the positive cone G$ and an injective mapping f : M -+ G$ such A, and V . that f preserves
+,
Proof. Using Propositions 3 7 4 0 , we see that ( M ;A, +) is a semiclan. Using the crucial result o f Bosbach [Bosbach, 1981, p. 3211 mentioned above, we have the ¤ assertion i n question.
New Quantum Structures
Denote by Xo := f (M) and
Then Xo is a lattice which is a sublattice of G.: What we claim below is that X is also a sublattice of G;: for x, y E X , the expression x A y E X means that x A y taken in the l-group Go is an element of X . It can be proved that (i) X is an l-semigroup of G$, and is left and right cancellative, (ii) 0 = f (0) is the neutral element, (iii) if x y = 0 for x, y E X then x = 0 = y, and (iv) x X = X x for x E X . Applying now the Birkhoff theorem, [~uchs,1963, Thm 11.41, we see that X is a positive cone of an l-group G. By the construction of X , u := f (1) is a strong unit for G, and r ( G , u ) = f (M) which gives a sketch of the proof of the following theorem, that is the first part of Theorem 36. For an alternative proof using the word technique, see Subsection 4.2.
+
+
+
THEOREM 42. Let (M; @,- ," ,0,1) be a pseudo MV-algebra. Then there exists an I-group G with strong unit u such that M and r(G, u) are isomorphic pseudo MV-algebras. Using this result, we can prove the basic representation theorem for pseudo MV-algebras which generalizes the famous theorem of Mundici, Theorem 11. As a consequence of the representation theorem, we have the following import ant results. We say that a pseudo MV-algebra M is Archimedean if the existence of nu := a1 . . . a,, where a1 = . . = a, = a for any integer n 2 1, entails that a = 0. It is known that if M is a a-complete lattice, then M is Archimedean
+ +
PROPOSITION 43. Let M = I'(G,u) be a pseudo MV-algebra. Archimedean if and only if G is an Archimedean l-group.
Then M is
THEOREM 44. Any Archimedean pseudo MV-algebra is commutative, i.e. an MV-algebra. In particular, every finite pseudo MV-algebra is commutative. We denote by Z(M), P(M), and N ( M ) the sets of all ideals, prime ideals and normal ideals of a pseudo MV-algebra M respectively. Similarly, let C(G), P(G) and L(G) be the sets of all convex l-subgroups, prime subgroups (i.e., prime convex l-subgroups) and l-ideals of an l-group G. We say that an ideal of a pseudo MV-algebra M is a subset I of M such that (i) 0 E I, (ii) if x, y E I, then x @ y E I and y @ x €1, and (iii) if x E I, y E M, and y 5 x, then Y E I . An ideal I of M is said to be (i) normal if x @ I = I @ x for any x E M,3 (ii) prime if x A y E I entails x E I or y E I , (iii) mmimal if I is a proper ideal of M and is not included in any proper ideal of M different from I. 3
~ define e x $ I := {x $ y : y E I); similarly we define I $ x.
Anatolij DvureEenskij
24
Let ( G ,u) b e a unital l-group and let M = r ( G ,u). Using the basic representation o f pseudo MV-algebras b y unital l-groups, Theorem 36, we get the following result. THEOREM 45 ( [ ~ v u r e ~ e n s k20011). ij, Let ( G ,u) be a unital l-group and let M = r ( G , u). For any ideal I of M , we assign 4 ( I ) := {x E G : 1x1 A u E I ) . ( 1 ) 4 ( I ) is a convex l-subgroup of G generated by I . The mapping 4 : I H 4 ( I ) from Z ( M ) to C ( G ) defines a one-to-one mapping preserving set-theoretical inclusion. The inverse mapping $ is given by
(3) The restriction of 4 to P ( M ) or N ( M ) gives a bijection between P ( M ) and C ( G ) , and N ( M ) and C(G),respectively, which preserves set-theoretical inclusion.
3.2 States on pseudo MV-algebras In this subsection, we introduce states and state-morphisms on pseudo MV-algebras, and we exhibit their close connections with normal and normal maximal ideals o f pseudo MV-algebras, A state o n a pseudo MV-algebra M is a mapping m : M + [O, 11 such that ( i ) m ( 1 ) = 1, and (ii) m ( a b) = m ( a ) m ( b ) whenever a b is defined in M . I f M is a commutative pseudo MV-algebra (i.e. an MV-algebra), then M possesses at least one state. For pseudo MV-algebras this is not the case. T h e basic properties o f states are the following. PROPOSITION 46. Let m be a state o n a pseudo MV-algebra M . Then, for all a , b E M , we have
+
+
+
(i) m ( 0 ) = 0. (ii) If a 5 b, then m ( a ) 5 m ( b ) and m ( b @ a-) = m ( b ) - m ( a ) = m ( a W @ b). (iii) m ( a - ) = 1 - m ( a ) = m ( a N ) . (iv) m ( a = ) = m ( a ) = m ( a c ) . ( v ) m ( a V b) m ( a A b) = m ( a ) m(b). (vi) m ( a @b) + m ( b @ a ) = m ( a ) + m ( b ) . (vii) The set Ker(m) := { a E M : m ( a ) = 0 )
+
is a normal ideal of M .
+
New Quantum Structures
25
(viii) a / K e r ( m ) = b/Ker(m) i f and only if m ( a ) = m ( a A b) = m ( b ) . (ix) There i s a unique state 6i o n M / K e r ( m ) such that %([a])= m ( a ) , [a] E M / K e r ( m ) , where [a]is the coset in M / K e r ( m ) determined by a E M . ( x ) m ( a @b) = m ( b @a). A mapping m from a pseudo MV-algebra M into the standard MV-algebra [O, 11 such that, for all a, b E M , m ( a @ b) = m ( a ) @w m ( b ) , (ii) m ( a - ) = m ( a W )= 1 - m ( a ) , and (iii)m ( 1 ) = 1 is said t o be a state-morphism. THEOREM 47. Let m be a state on a pseudo MV-algebra M . Then m is a statemorphism i f and only if Ker(m) is a maximal ideal of M . Let ml and m2 be two measure-morphisms on a pseudo MV-algebra M such that K e r ( m l ) = Ker(m2). Then ml = ma. Conversely, let I be a normal and maximal ideal of a pseudo MV-algebra M . Then there is a unique state-morphism m on M such that Ker(m) = I . PROPOSITION 48. Let m be a state on a pseudo MV-algebra M . Then the following statements are equivalent:
(i) m is an extremal state on M . (ii) m is a state-morphism o n M . (iii) m ( x A y) = m i n { m ( x ) ,m ( y ) ) , x , y E M . Denote b y S ( M ) the set o f all states o n a pseudo MV-algebra M . T h e n S ( M ) is a convex set, and let E x t s ( M ) b e the set o f all its extremal states. A net { m a ) o f states o n M converges weakly t o a state m ifF m,(a) + m ( a ) for every a E M . I f S ( M ) # 0,then S ( M ) is a compact convex Hausdorff space with respect t o the weak topology, and the space o f all state-morphisms on M is a non-empty compact Hausdorff space. In view o f the Krein-Mil'man theorem, [Goodearl, 1986], any state is a weak limit o f convex linear combinations o f the set o f extremal points o f S(M). W e recall that b y categorical equivalence there exists a one-bone correspondence between the states o n r(G,u) and the states on (G,u). As we have seen, every MV-algebra admits a state. THEOREM 49. A pseudo MV-algebra M admits a state i f and only zf M admits a maximal ideal which is normal. In particular, every linearly ordered pseudo MV-algebra M possesses a unique state, and every normal-valued pseudo MV-algebra M admits a state. T h e following example is an oral communication from Prof. A. Glass. W e recall that a pseudo MV-algebra is said t o b e symmetric i f x- = x" for any x E M . E X A M P L E 50. There is a symmetric stateless pseudo MV-algebra M . Proof. Let A u t ( R ) denote the group o f automorphisms g : W + W, and set
26
Anatolij DvureEenskij
+
Then G is an &group with strong unit u : t cr t 1 (t E R) that is central. Indeed, if g E G, and Og = s > 0, let n E Z+ be an integer such that n > s. Then for all t E B,let m E Z with m < t < m 1. Then t ~ - ( ~ + '<) 0 and Oum < t. So < Og = s < n = Oun wpch gives tg = tu-("+')gu(m+l) < oUn+m+' < tun+' while u is central. Thus tg < tun+' for all t E R so g < un+'. Similarly, if Og 5 0, then u-(~'+') < g (since g-l < un'+l for some n' E Z+), which proves u is a strong unit for G. Let to E R and Gt, = {g E G : tog = to) be the stabilizer of to. Then u 4 Gto and if H is any subgroup of G strictly containing Gto,there is h E H with toh # to. By replacing h by h-l, we may assume toh > to. Now if toh > to 1, then h L u, and if toh < to 1, there is g E Gto c H with to 112 < tohg < to 1 and tohg > (to 1)h-l. This follows from the fact that Gt, = Gt,+l and h 4 Gt,, and there is an open unit interval I R with to E I and I C supp(h) = {t E R : th # h). Since h E G, we have ( I 1) := {t 1 : t E I) supp(h). So tohgh > to 1. Hence t ~ ( h g h )>~to 2 so u < (hgh)2 E H. Thus if H is a convex subgroup, then u E H. Consequently, Gt, is a maximal convex 4-subgroup of G not containing u. If f E G with tof = to 114, then fP1Gtof = Gto+l/4 # Gto SO Gto is not normal in G. On the other hand, (G, R) is a transitive and primitive periodic e-group [Glass, 1981, Ex.1.9.2, p. 931. By [Glass, 1999, Thm 6C], G has only trivial normal convex 4-subgroup, i.e., no maximal convex ideal of G is normal. Consequently, M = r(G, u) is a symmetric stateless pseudo MV-algebra. Since every stabilizer Gt is a convex maximal &subgroup of G, Gt n M is a maximal ideal of M , and Ker(M) = (0).
+
+
+
+
+
+
+
+
+
+
+
3.3 Perfect pseudo MV-algebras Pseudo MV-algebras are intervals in unital Lgroups and are categorically equivalent to unital l-groups. We now describe a subclass of pseudo MV-algebras, the subclass of perfect pseudo MV-algebras, which is categorically equivalent to the class of all l-groups. Such pseudo MV-algebras can be "split" into two two "slices". If G is an arbitrary (noncommutative) e-group, then
gives a (noncommutative) symmetric pseudo MV-algebra. Moreover, (i) M = {(O,g) : g E G+) U {(I, -g) : g E G+), (ii) {(O,g) : g E G+) rl{(l, -9) : g E G+) = 0, (iii) {(O,g) : g E G+)* = {(I, -g) : g E G f ) and {(I, -g) : g E Gf)* = {(O,g) : g E G + l , (iv) Infinit(M) = ((0, g) : g E G+) = Rad(M), (v) if g, h E G+, (1, -g) (1, -h) is not defined in M,
+
New Quantum Structures
27
(vi) (0, g) 5 (1,-h) for all g, h EG+ (vii) M admits a unique state, namely s(0, g) = 0 and s(1, -g) = 1for all g E G+. PROPOSITION 51. Let M be a symmetric pseudo MV-algebra with Rad(M) = Infinit(M). Then Rad(M) is an associative semigroup with respect to such that
+
(i) (ii) (iii) (iv) (v) (vi)
0 is the neutral element, the cancelation law holds in Rad(M), if a + b = 0 for a , b E Rad(M), then a = b = 0, Rad(M) n Rad(M)* = 0, i f a, b E Rad(M)*, then a b is not defined in M, i f a E Rad(M) and bE Rad(M)*, then a < b.
+
PROPOSITION 52. Let M be a symmetric pseudo MV-algebra. The following statements are equivalent: (i) (ii) (iii) (iv)
Rad(M) U Rad(M)* = M. Infinit(M) is a n ideal of M and Infinit(M) U Infinit(M)* = M. M admits a state and Infinit(M) U Infinit(M)* = M. There i s a proper ideal A of M, such that A U A* = M, A n A* = 0, and a 5 b whenever a E A and b E A*. In such a case, A is a unique maximal ideal of M. (v) Infinit(M) U Infinit(M)* = M and a 5 b whenever a E Infinit(M) and b E Infinit (M) * .
If one of (i)-(v) is satisfied, then Rad(M) = Infinit(M), Infinit(M) is a unique maximal ideal of M , and M admits a unique state, s, s ( a ) = 0 zf a E Infinit(M) and s ( a ) = 1 i f a E Infinit(M)*. I n addition, (vi)-(viii) are mutually equivalent, and each of (i)-(v) implies (vi). (vi) Rad, (M) # M and Rad,(M) U Rad, (M)* = M. (vii) M admits only a two-valued state. (viii) If I is a maxzmal and normal ideal of M, then M / I = r ( Z , 1). We say a (non-degenerate)symmetric pseudo MV-algebra M is perfect if Rad(M)U Rad(M)* = M. Let PBMV be the category of perfect pseudo MV-algebras, where the objects are perfect pseudo MV-algebras and the morphisms are homomorphisms of pseudo MV-algebras. Let B be the category of 1-groups, where the objects are &groups and the morphisms are homomorphisms of &groups. We define a mapping I : B t PBMV by
Anatolij DvureEenskij
28
and if h is a morphism of [-groups, we set
where g E G+. Then & is a functor. THEOREM 53. & is a categorical equivalence of the category 6 of [-groups and the category PBMV of perfect pseudo MV-algebras. In addition, suppose that h : E(G) + &(H) is a homomorphism of pseudo MV-algebras, then there is a unique homomorphism f : G -+ H of unital [-groups such that h = &( f), and (i) if h is surjective, so is f ; (ii) if h is an isomorphism, so is f . In the sequel we show that the variety V(PBMV) of pseudo MV-algebras generated by PGMV has a single perfect pseudo MV-algebra generator. THEOREM 54. Let G be a doubly transitive 1-group. Then V(PBMV) = V(&(G)). In particular, an identity holds in every perfect pseudo MV-algebra if and only if it holds in &(G). An example of a doubly transitive permutation [-group is the system of all automorphisrns, Aut(R), of the real line R, or the next example: Let u E Aut(R) be the translation tu = t 1, t E R, and
+
Then (BAut(R), u) is a doubly transitive unital [-permutation group, and according to l lass, 1999, Lem 10.3.11, the variety of pseudo MV-algebras generated by I'(BAut (B), u) is the variety of all pseudo MV-algebras. Finally, we note that the variety V(PQMV) is defined by the equation:
3.4 n-perfect pseudo MV-algebras Inspired by perfect pseudo MV-algebras, we extend this notion to the notion of a n-perfect pseudo MV-algebra. These structures are roughly speaking pseudo MV-algebras that can be "split" into n 1 "slices". Let n 2 1 be a fixed integer. A non-degenerate pseudo MV-algebra M is said to be n-perfect if there are nonempty subsets Mo, MI,. . . ,Mn of M such that
+
(a) Mi n Mj = 0 and Mi 5 Mj for all i < j , that is, if x E Mi and y E Mj, then x 5 Yl (b) M = MoU M I U . . . U M,,
New Quantum Structures
(c) M i = Mn-i = M y for any i = 0,1,. . . ,n, ( d ) i f x E Mi and y E M j , then x @ y E Miej. W e shall write M = (Mo,M I , . . . ,M,) for the perfect pseudo MV-algebra M . Let G be an l-group, and set
Then &,(G) is a symmetric n-perfect pseudo MV-algebra such that &,(G) := (GO,G I , .. . ,G,), where
submitted(a)]. The following results were proved in [Dvure~enskij, THEOREM 55. Let M = (Mo,M I , . . . ,M,) be an n-perfect pseudo MV-algebra.
+
+
( i ) Let a E Mi, b E M j . If i j < n, then a + b is defined in M ; i f a b is defined i n M , then i j 5 n. (ii) Mi M j = Mi+j whenever i + j < n. (iii) If a E Mi and b E M j , and i j > n, then a b is not defined in M . (iv) Given a E M I , there is a' E M I such that a' 5 a and nu' is defined in M . ( v ) Mo is a normal and mmimal ideal of M such that Mo + Mo = Mo, Mo = Rad(M) = Infinit(M). (vi) Mo is the unique maximal ideal of M , and M E M . (vii) M admits a unique state, namely s(Mi) = iln for each i = 0,1,. . . ,n. Then Mi = s-'({iln)) for any i = 0,1,. . . ,n. (viii) Let M = (Mh,M i , . . . ,MA) be another representation of M satisfying (a)( d ) , then Mi = Mi for each i = 0,1,. .. ,n.
+
+
+
+
By M we denote the system o f pseudo pseudo MV-algebras M such that every maximal ideal o f M is normal. W e note that the converse statement t o Theorem 55, that is, i f M is a (symmetric) pseudo MV-algebra, M E M , and M admits only one extremal state and this state is (n+ 1)-valued, then M is n-perfect, can be proved. Let us define PBMV,, the system of n-perfect pseudo MV-algebras (PBMV: symmetric n-perfect pseudo MV-algebras), V(PBMV,), the variety generated by all n-perfect pseudo MV-algebras. I t is clear that PBMV = P G M V ~ . Let Vpn and be the variety o f pseudo MV-algebras and the variety o f symmetric pseudo MV-algebras, respectively, satisfying the following two equations
v;~
+
( ( n 1) o x " ) ~= 2 O xn+l,
Anatolij DvureEenskij
30
for every integer p, 1 < p
< n, such that p is not
a divisor of n.
THEOREM 56. V(PQMV,) = Vpn = 7(Vpn), and V(PGMV:)
=
v:~.
An n-perfect pseudo MV-algebra M = (Mo, MI,. . . ,M,) = r(G, u) is said to be strong if there is a E Ml such that (i) a belongs to the commutative center of G, and (ii) nu = 1;such an element a is said to be a strong cyclic element of order n. Moreover, M enjoys unique extraction of roots of 1. Indeed, if there is b E M such that nb = 1, then a b = b a in the corresponding group G, which gives n(a-b)=na-nb=O that i s a = b . For example, En(G) is strong; the element a = (1,O) is that in question. On the other hand, every symmetric 1-perfect pseudo MV-algebra is strong, we take a = 1.
+
+
THEOREM 57. An n-perfect pseudo MV-algebra M is isomorphic to some E,(G) if and only if M is strong. In such a case, G is unique up to isomorphism of l-groups. Let SPQMV, denote the category of strong n-perfect pseudo MV-algebras, where objects are pairs (M, a) with a strong n-perfect pseudo MV-algebra M and a fixed strong cyclic element a E M of order n, and morphisms are pseudo MVhomomorphisms of pseudo MV-algebras preserving fixed strong cyclic elements. SPQMV, is a functor such that (E,(G), (1,O)) is an The mapping En : Q object of the category SPQMP,, and if h is a morphism of l-groups, then En (h) (4 9)
=
(0, h(g)) (i, h(g)) (n, -h(g))
if i = 0, g E G+, if 0 < i < n, g E G, if i = n, g E G+,
is a morphism of strong n-perfect pseudo MV-algebras. THEOREM 58. En is a categorical equivalence of the category Q of l-groups and the category SPQMV, of strong n-perfect pseudo MV-algebras. In addition, suppose that h : (En(G), (1,O)) 4 (E,(H), (1,O)) is a morphism of strong n-perfect pseudo MV-algebras, then there is a unique homomorphism f : G 4 H of l-groups such that h = E,(f), and (i) if h is surjective, so is f ; (ii) if h is an isomorphism, so is f THEOREM 59. Let G be a doubly transitive &-group. Then for the variety V(SPBMVn) generated by SPQMV,, we have V(SPQMV,) = V(En(G)). In particular, an identity holds in every strong n-perfect pseudo MV-algebra if and only if it holds in E,(G).
3.5 Pseudo Lukasiewicx BCK-algebras Lukasiewicz BCK-algebras are studied in [Dvure~enskijand PulmannovL, 20001. They are parts of the positive cones of Ggroups. If they admit a greatest element
New Quantum Structures
31
1, they are equivalent to MV-algebras. In the present subsection, we give a noncommutative generalization of the concept of a Lukasiewicz BCK-algebra called a pseudo Lukasiewicz BCK-algebra. A structure (E; 5, O , O ,O), where (E; <) is a poset with the smallest element 0, and 0 , Q are binary operations, is called a pseudo-LBCK algebra if, for all a, b, c E El the following holds.
(PLB1) (PLB2) (PLB3) (PLB4)
<
a b if and only if a @ b = 0 if and only if a Q b = 0. a @ ( a Q b) = bO (bQ a) and a Q ( a O b) = b Q (b@ a). (a@ b) Q c = (a O c) @ b. If c I a , b , then from a @ c = b@ c o r a @ c = b O c i t follows a = b.
If O = , we obtain Lukasiewicz BCK-algebras. The prototypical example for pseudo-LBCK algebras is the following. Let G be a lattice-ordered group, and let Go be a convex subset of G+ containing 0. Define for a, b E G+
Then (Go; 2, @ , O ,O), where 5 is the group order and 0 the group zero, is a pseudeLBCK algebra.
LEMMA 60. Let (E; 5, @ , Q ,0) be a pseudo-LBCK algebra. Then for a, b, c E E the following holds. (i) a O O = a O O = a a n d a O a = a O a = O . (ii) E is a lower semi-lattice; we have a A b = a @ (a O b) = a Q (a @ b). Furthermore, a O b = a @ (aAb) a n d a Q b = a Q (aAb). (iii) I f a I b , t h e n a @ c I b @ c a n d a O c I b O c . SupposecIa,b. If t h e n a O c I bO c o r a Q c I bO c, it followsa5 b. (iv) If a 5 b, then c @ b I c O a a n d c Q b I c Q a. (v) (vi) (vii) (viii)
In particular, a @ b, a b I a. a @ b s c i f and onlyzfaO c I b . (a@ c ) O (bO c) = ( a 0 b) A (a@ c) and ( a O c ) O (bQ c) = ( a @ b) A ( a 0 c). (cO a ) O (cO b) 5 bO a and (cQ a)@ ( c O b) b O a. (aA b)O c = (a@ c) A (bO c) and (aA b) Q c = ( a m c) A (bO c).
<
In [Bosbach, 19821, Bosbach introduced cone algebras as follows. A cone algebra is a structure (E; @ , Q ), where @ and Q are binary operations such that, for all a, b, c E E , 4 ~ use e here a notation slightly different from that in [Bosbach, 19821;our operations translate into Bosbach's by: a * b = b Q a and a :b = aO b for any elements a, b of a cone algebra.
Anatolij DvureEenskij
32
(cl) ( c O a ) O ( b O a ) = ( c O b ) O ( a O b ) , ( c O a ) O ( b O a ) = ( c O b ) O (aOb); (c2) b O ( a O a) = b O ( a m a) = b ; (c3) ( a 0 b) O c = (a O c) O b; ( ~ 4 )a O ( a O b) = bO (bO a). Moreover, for a, b E E, we let a 5 b iff a @ b = 0. and Vetterlein, 20021). THEOREM 61 ([~vure~enskij , 0) be a pseudo-LBCK algebra. Then E can be isomorphically Let (E; 5 , , embedded into the positive cone of an f-group G, such that infima are preserved. Assuming E G, the order 5 of E is the restriction of the group order to E , 0 is the group zero, and 0 , are given by (3.1).
4 PSEUDO EFFECT ALGEBRAS In this section, we generalize the notion of an effect algebra by dropping the assumption of commutativity: a b = b a. This notion was introduced by the author and Vetterlein [Dvure~enskijand Vetterlein, 2001; DvureEenskij and Vetterlein, 2001aI.
+
+
Pseudo eflect algebras and their basic properties
1
+
A partial algebra (E;+, 0, I), where is a partial binary operation and 0 and 1 are constants, is called a pseudo effect algebra ([DvureEenskij and Vetterlein, 2001; DvureEenskij and Vetterlein, 2001a]) if, for all a, b, c E E, the following holds
+
+ + +
+
+ +
(i) a b and (a b) c exist if and only if b c and a (b c) exist, and in this case ( a + b) c = a + (b+c). (ii) for any a E E, there is exactly one d E E and exactly one e E E such that a+d=e+a=l; (iii) if a b exists, there are elements d, e E E such that a b = d a = b e; (iv) if 1 a or a 1 exists, then a = 0.
+ +
+
+
+
+
If we define a 5 b iff there exists an element c E E such that a + c = b, then 5 is a partial ordering on E such that 0 5 a 5 1 for any a E E. If E is a lattice under 5, we say that E is a lattice pseudo effect algebra. If + is commutative, i.e.
+
+
+
if a b = b a, for all a, b E E such that b a E E, E is our well-known effect algebra. Let E be a pseudo effect algebra. Let / , \ be two partial binary operations on E such that, for a, b E E, a / b is defined iff b \ a is defined ifF a 5 b, and such that in this case we have
New Quantum Structures
Then a = ( b \ a ) / b = b \ (alb). If a 5 b 5 c, then
Let E = (E; +,O, 1) be a pseudo effect algebra. We define a- := 1 \ a and a" := a / 1 for any a E E. For example, if (G, u) is a unital (not necessary Abelian) po-group with a strong unit u (sometimes it is sufficient to assume just u > O), and
+
then (r(G, u); +,0, u) is a pseudo effect algebra if we restrict the group addition to r ( G , u). A pseudo effect algebra (E; +,0 , l ) is said to be an interval pseudo eflect algebra if there exists a unital po-group (G, u) such that (E; 0 , l ) is isomorphic to (r(G, u); +,0, u). For example, E(H) = F(B(H), I) is an interval effect algebra, where B(H) is the system of all Hermitian operators of a Hilbert space H, which is a po-group under addition and the usual order of operators A 5 B iff (Ax, x) 5 (Bx, x) for any x E H, and I is the identity operator. The conditions under which a pseudo effect algebra is an interval were studied in [ ~ v u r e ~ e n s kand i j Vetterlein, 2001; DvureEenskij and Vetterlein, 2001a]. For this purpose we need the following generalizations of the Riesz decomposition property:
+,
(a) For a, b E E, we write a corn b to mean that for all a1 5 a and bl and bl commute.
5 b, a1
(b) We say that E satisfies the Riesz interpolation property, (RIP) for short, if for any al, a2, bl, b2 E E such that al, a2 5 bl, b2 there is a c E E such that a1,az 5 c 5 b1,bz. (c) We say that E satisfies the weak Riesz decomposition property, (RDPo) for short, if for any a, b l , b2 E E such that a 5 bl b2 there are dl, d2 E E such that dl 5 bl, dz 5 bz and a = dl dz.
+
+
(d) We say that E satisfies the Riesz decomposition property, (RDP) for short, if for any al,a2,bl,b2 E Esuch thatal+a2 = bl+bz therearedl,d~,dg,dqE E such that dl d2 = a l , dg d4 = a2, dl d3 = bl, d2 d4 = b2.
+
+
+
+
34
Anatolij DvureEenskij
(e) We say that E satisfies the commutational Riesz decomposition property, (RDP1) for short, if for any a l , a2, bl, b2 E E such that a1 +az = bl b2 there are dl, d2,d3, d4 E E such that (i) dl d2 = a l , d3 d4 = a2, dl d3 = bl, d2 d4 = b2, and (ii) d2 corn d3.
+
+
+ +
+
(f) We say that E satisfies the strong Riesz decomposition property, (RDP2) for short, if for any al, a2, bl, b2 E E such that a1 a2 = bl b2 there are dl,dz,d3,d4 E E such that (i) dl d2 = a l , d3 dq = a2, dl d3 = bl, d2 d4 = b2, and (ii) d2 A d3 = 0.
+
+
+ +
+
+
Note that Riesz-type decomposition properties are, roughly speaking, another kind of distributivity properties; they are closely connected to the refinements of decompositions of unity. We have the implications (i) (RDP2) + (RDP1) + (RDP) + (RDPo) + (RIP), reverse ones can fail. The converse of any of these implications does not hold. (ii) E satisfies (RDP2) if and only if E is latticeordered and fulfils (RDPo). (iii) Let E be commutative. Then we have the implications (RDP2) +- (RDP1) (RDP) *(RDPo) +- (RIP). Any implication not shown here does not hold. If the positive cone G+ of a po-group G satisfies the analogous conditions, we say that G satisfies the corresponding type of the Riesz decomposition property. The following important representation theorem for pseudo effect algebras says that every pseudo effect algebra with (RDPl) is an interval.
*
LEMMA 62. Let (E; +,0 , l ) be a pseudo effect algebra satisfying (RDPo). (i) Let a, b, c E E and a + b exist. Then from a a n n c and b a n n c it follows a + b ann c. (ii) If a A b = 0, then a + b, b + a and a V b exist and are all equal. A further property of Riesz type involves any finite number of elements rather than a maximum of four. To make the collections of formulas that will appear in the sequel more easily readable, we use the following abbreviation. Let dij, ai, bj E E, 1 5 i 5 m, l s j s n . By dll . . . dl, -t a1
we mean d i l + j = 1,...,n.
.
.
a
+
din = ai for i = 1,...,m and d l j + . . . + & . 3 = bj for
New Quantum Structures
LEMMA 63. Let ( E ; 0 , l ) be a pseudo efect algebra satisfying (RDP~). Let
+,
where m, n 2 1. Then there are elements dll,. . . ,dm, E E such that
and such that for 1 5 i < m, 12 j
we have
4.2 Representation of pseudo eflect algebras In order to prove an analogue of the Mundici representation theorem for pseudo effect algebras, we will use the so-called word technique introduced by Baer [ ~ a e r , 19491 and Wyler [Wyler, 19661. This technique was also successfully applied to effect algebras satisfying the Riesz Interpolation Property [Ravindran, 19961. In the first step, we embed a given pseudo effect algebra into a semigroup. The semigroup will then, in a second step, be extended to a po-group. The word technique means the following. Let (E; 0 , l ) be a pseudo effect algebra.
+,
(i) A sequence A = (al, . . ., a,) of finite, but non-zero, length with entries from E is called a word in E. We denote by W(E) the set of all words; that is def
W(E) = {(al, .. .,an): al, ...,a, E E , n 2 1). We define an addition in W(E) as concatenation; that is
-
(ii) We call two words A and B of E directly similar, in symbols A B, if one of them has the form (al, ...,a,), n 2 2, and the other one has the form (a1, ...,ap ap+l, ...,an), 1i P < n. We call two words A and B similar, in symbols A 1: B , if there are words Ao, ..., Ak, k 2Osuch that A = A o -A1 - . . . - A k = B. In such acase we say that A and B are connected by a chain of length k.
+
We set for a l , ...,a, E E, n 2 1,
Anatolij DvureEenskij
and we put def
C(E) = {[al, ...,a,]: a l , ...,a, E E , n 2 1). It is can be proved that (i) Similarity in W(E) is an equivalence relation compatible with
+.
+ being the induced relation, (C(E); +) is a semigroup with the neutral element [0]. (ii) For a l , ..., a,, b E E, n >_ 1, (al,. . . , a,) (b) if and only if a1 . .. a, exists and equals b.
--
+ +
The crucial lemma needed for the representation theorem is the following. LEMMA 64. Let (E; +, 0 , l ) be a pseudo effect algebra satisfying (RDP1). Let where m, n 2 1. Then there are elements dll,. . . ,dm, E E such that
and such that, for 1 5 i
< m,
1 5 j < n we have
LEMMA 65. Let (E; +,0,1) be a pseudo effect algebra satisfying (RDP1). Then C(E) is a semigroup such that the following holds. (i) [O] is a neutral element. (ii) Let a, b E C(E). From a + b = [0] it follows a = b = [O]. (iii) Let a, b, c E C(E). From a b = a c it follows b = c;
+
+
+
from b + a = c a it follows b = c. (iv) For any pair a, b E C(E) there is a c E C(E) such that a and there is a b E C(E) such that a
+ b = b +b.
+ b = c + a,
Combining the above properties and the word technique, we obtain the basic representation theorem for pseudo effect algebras with (RDP1). THEOREM 66 ([Dvure~enskijand Vetterlein, 2001; DvureEenskij and Vetterlein, 2001al). Let (E;+,O, 1) be a pseudo effect algebra fulJilling (RDP1). Then L E :
New Quantum Structures
37
E + B(E), a I+ ([a],[O]) determines a n isomorphism between ( E ;+,0,1) and (r(B(E), (['I, ['I)); + 1 (['I, ['I), ([I], ['I)), where ([I],['I) is a strong unit B(E). In particular, E i s a n interval pseudo effect algebra. It can be shown that if (E; +,0,1) is a pseudo effect algebra fulfilling (RDPl), then (i) B(E) satisfies (RDPl), (ii) the embedding L E : E + g(E), a I+ ( [ a ][O]) , preserves infima and suprema existing in E , (iii) E is an effect algebra iff B(E) is commutative, (iv) E is linearly ordered iff B(E) is linearly ordered. In the sequel we show that r defines again a categorical equivalence, which generalizes Theorem 2. Let RPEA denote the category whose objects are the pseudo effect algebras fulfilling (RDP1) and whose morphisms are the homomorphisms of these structures. Let RPUB denote the category whose objects are the unital pegroups fulfilling (RDP1) and whose morphisms are the homomorphisms of these structures. Then the mapping r : RPUB + RPEA is a functor. THEOREM 67 ([Dvure~enskijand Vetterlein, 2001; DvureEenskij and Vetterlein, 2001al). The functor I' defines a categorical equivalence between the category R P U B of unital po-groups satisfying (RDP1) and the category RPEA of pseudo effect algebras satisfying (RDP1). Now we show that as a corollary of these results we get an independent proof of the fact that every pseudo MV-algebra is an interval in a unital &group, compare with Theorem 36 and Theorem 42. PROPOSITION 68. Let E be a pseudo effect algebra fulfilling (RDPl). T h e n the following statements are equivalent. (i) (ii) (iii) (iv) (v)
E satisfies (RDP2). E i s lattice-ordered. E i s a pseudo MV-algebra. B(E) satisfies (RDP2). g ( E ) i s a n l-group.
PROPOSITION 69. A lattice effect algebra E i s can be converted into a pseudo MV-algebra if and only if a \ (aAb) = ( a V b ) \ b if and only if (aAb) / a = b / ( a V b ) for all a , b E E.
4.3 Pseudo MV-algebms and compatibility in pseudo eflect algebms As in the case of effect algebras, subsection 2.4, we now study compatibilities in pseudo effect algebras and their relation to MV-subalgebras playing the role of blocks. We introduce five kinds of compatibility of elements of a pseudo effect algebra. In the case of a lattice pseudo effect algebra four of them coincide.
Anatolij DvureEenskij
38
W e say that t w o elements a and b o f a pseudo effectalgebra E are (i) compatible (and we write a tt b) i f there are three elements a l , bl, c E E such that a = a1 c, b = bl c, and a1 bl c = bl + a1 + c E E; (ii) strongly compatible (and we write a b) if there are three elements a l l bl, c E E such that a = a1 c, b = bl c, a1 bl c = bl a1 c E E, and a1 A bl = 0 , (iii) weakly compatible, (and we write a A b) if there exist three elements a l , bl, c E E such that a = a1 c, b = bl + c, and a1 + bl + c E E and bl + a1 c E E, (iv) ultra weakly compatible (and we write a % b) if there exist three elements a l , bl, c E E such that either a = a1 bl c E El or bl + a1 + c E E, and ( v ) ultra strongly compatible (and we write a +% b) if there are three elements a l , bl, c E E such that a = al c, b = bl c, a1 A bl = 0 , a1 corn bl, and a1 bl c E E. It is evident that ( v )implies (ii),(ii)implies (i),(i)implies (iii), and (iii) implies (iv).I f E is an effect algebra, t h e n (ii)and ( v )are equivalent, and so are (i),(iii) and (iv). I f E is a lattice effect b, algebra, t h e n ( i ) and (ii) are equivalent [ ~ i e ~ a n o v20001. W e note that if E is an effect algebra with ( R I P ) , t h e n a A b i f fa tt b and ij, a A b E E , [ ~ v u r e ~ e n s k2002al.
+ + +
+ +
+ + +
+
+ +
+
+ +
+
+ +
+
PROPOSITION 70. Let a and b be two elements of a lattice pseudo effect algebra E such there are three elements a l , bl,c E E such that a = a1 c, b = bl c, a1 bl c E E , a1 bl = bl a l , and a1 A bl = 0 . Then a V b = a1 bl c, a A b = c, a1 = a \ ( a A b), and bl = b \ ( a A b). Moreover, if a = a1 + c, b = bl + c, a1 A bl = 0 , and a1 bl c E E or bl a1 c E E, then a A b = c. T H E O R E M 71. Let E be a pseudo effect algebra with ( R I P ) and a , b E E. The following statements are equivalent:
+ +
+
+
+
+ + +
+ +
+ +
(i) a + % b a n d a ~ b € ~ .
-
(ii) a - b a n d a A b E E.
(iii) a
C
b.
(iv) a + % b a n d a v b € ~ . ( v ) a t t b a n d a v b E. ~ PROPOSITION 72. Let E be a lattice pseudo effect algebra. T h e n a cr b if and onlyifa\(aAb)*b\(aAb). Inaddition, a E b i f a n d o n l y i f a \ ( a ~ b ) + % b \ ( a A b). PROPOSITION 73. Let E be a lattice pseudo effect algebra, let ai i E I , and a := V i E I a i E E. Then b tt a and
tt
b for any
New Quantum Structures
Proof. The theorem will follow from the following Claims.
Claim I . a 5 (b \ ( a A b)) /1, b \ ( a A b) + a
\
( a A b) + a A b E E.
( a V b) \ a 5 b \ ( a A b). We have ai 5 (b \ (adA b)) / 15 (b \ ( a A b)) / 1, so that a 5 (b \ ( a A b)) / 1, so that b \ ( a A b) a E E. Therefore, a V b 5 b \ ( a A b) + a \ ( a A b) + a A b and ( a V b) \ a 5 b \ ( a A b).
+
Claim 2. A,(b
\
(ai A b)) = b \ ( a A b).
b \ ( a A b) 5 b \ (ai A b) for any ai. Let d 5 b \ (ai A b) = (ai V b) \ a+ 5 ( a v b) \ ai. Then ai = ( ( a V b) \ ai) / ( a V b) 5 d / ( a V b) and a 5 d / ( a V b), so that d = (aV b) \ (d / (aV b)) 5 (aV b) \ a 5 b \ ( a A b) using Claim 1. This implies Claim 2.
By Claim 2, b \ (aAb) = Ai(b \ (&Ab)).Hence, Ai(b \ ( a i ~ b )=) Ai((aivb) \ ai). Let now x 5 (ai V b) \ ai for any i E I. Then x 5 ( a V b) \ ad, so that ai = ( ( a v b) \ ai) / ( a V b) 5 x / ( a V b). Consequently, a 5 x / ( a V b). Therefore, x = ( a V b) \ ( x / ( a V b)) 5 ( a V b) \ a, which proves Claim 3. Claim 4. a A b = V i ( a i A b). LetaiAbseforanyiEI. T h e n a i ~ b < b ~ e s o t h a t b \ ( b ~ e ) 5 b \ ( a + ~ b ) for any i E I. By Claim 2, b \ (b A e) 5 Ai(b \ (ai A b)) = b \ ( a A b). Hence ar\ b = ( b \ ( a A b)) / b 5 (b \ ( b A e ) ) / b = b A e 5 e, so that a A b = V i ( a i A b). Claim 5. a
\
( a A b) = A i ( a \ (ai A b)).
We have a \ ( a A b) 5 a \ (ai A b) for any i E I. Assume w 5 a \ (ai A b) for every i. Then ai A b = ( a \ (ai A b)) / a 5 w / a, and by Claim 4, a A b 5 w / a . Therefore, w = a \ ( w / a ) 5 a \ ( a A b) which yields Claim 5. Claim 6. a \ ( a A b) + b E E.
Claim 7. a
\
( a A b)
+ b = a V b.
It is clear hat a \ ( a ~ b ) + b2 a, b, so that a \ (aAb)+b 2 avb. Let a \ ( a ~ b ) + b2
Anatolij DvureEenskij
40
x 2 a,b. Thenx 2 ~ , b f o any r i, so that x 2 a a i V b = a i \ ( a i A b ) + b a n d
Claim 8. a e, b.
It follows from Claim 3 and Claim 7.
-
PROPOSITION 74. Let E be a pseudo effect algebra with ( R I P ) , and let ai C for i = 1 , . .. ,n,and let a := Vr=l ai E E. Then a b and
Ab
We say that a pseudo effect algebra E satisfies the countable Riesz interpolation property, ( a - R I P ) for short, if for any two sequences { x i ) and { y j ) of elements of E such that xi 5 yj for all i, j, there exists an element z E E such that xi 5 z 5 yj for all i ,j .
-
PROPOSITION 75. Let E be a pseudo effect algebra with (a-RIP), and let ai C b for i 2 1, and let a := V z l ai E E. Then a b and
-
uw b, then either PROPOSITION 76. If E i s a pseudo effect algebra. If a uw uw uw UW a-l\borb-1\a. Ifa-b, thena-l\bandb-a/l. We can ask whether ultra weak compatibility is equivalent to weak compatibility in lattice pseudo effect algebras.
A partial answer can be given by using the following notions. We say that a pseudo effect algebra E has the weak compatibility property, ( W C P ) for short, if, for a, b E El a % b implies a +% b.
New Quantum Structures
41
For example, (i) every pseudo MV-algebra, or (ii) every horizontal sum of pseudo MV-algebras, or (iii) every effect algebra, or (iv) every horizontal sum of the previous algebras has (WCP). PROPOSITION 77. Let E be a lattice pseudo effect algebra such that 1\ a = a / 1 for every a E E. Then E has (WCP). We say that a pseudo effect algebra E satisfies the difference compatibility property, (DCP) for short, if a * b, a tt c and b 5 c imply c * c \ b. Every pseudo MV-algebra, or every horizontal sum of pseudo MV-algebras, or every effect algebra, or any horizontal sum of the previous algebras has (DCP). On the other hand, there is a pseudo effect algebra having (WCP), but not (DCP). Finally, we say that a pseudo effect algebra E satisfies the compatibility complement property, (CCP) for short, if a * b implies a * 1\ b; then also a tt b / 1. We prove that in lattice pseudo effect algebras the three properties (WCP), (DCP) and (CCP) are equivalent. PROPOSITION 78. Let E be a lattice pseudo effect algebra. The following three properties are equivalent. (i) (WCP). (ii) (DCP). (iii) (CCP). We now present the main results of this subsection. THEOREM 79. Let E be a lattice pseudo effect algebra with (DCP). Then every block of E is a pseudo effect subalgebra of E which is a pseudo MV-algebra. Moreover, any such pseudo effect algebra E i s the set-theoretical union of its blocks. THEOREM 80. Let a pseudo effect algebra with (DCP) be a a-lattice. Then every block of E i s an MV-algebra, and E can be covered by commutative blocks, and in moreover, E i s a (commutative) effect algebra. The last theorem can be extended as follows. We say that a pseudo effect algebra E is Archimedean if, for an element a E E such n u := a . . . a E E for any n 2 1, we have a = 0 .
+ +
THEOREM 81. Let E be a lattice pseudo effect algebra such that every block is a pseudo effect subalgebra of E. If E is Archimedean, then E is a (commutative) effect algebra.
4 . Central elements and general comparability We introduce the concept of the center of a pseudo BGalgebra. We show that the general comparability condition entails that a pseudo effect algebra is in fact a pseudo MV-algebra having a state. Moreover, every extremal state on the center can be uniquely extended to an extremal state on the whole algebra. In particular, every maximal ideal of a pseudo MV-algebra with general comparability is normal.
42
Anatolij DvureEenskij
DEFINITION 82. A n element e of a pseudo effect algebra E is said t o b e central (or Boolean) if there exists an isomorphism
such that fe(e) = ( e ,0 ) and i f f e ( x ) = ( X I , x 2 ) , t h e n x = X I
+ 2 2 for any x E E.
W e denote b y C ( E ) t h e set of all central elements o f E, and C ( E ) is said t o b e t h e center o f E. Recall that O,1 E C ( E ) . PROPOSITION 83. Let e be a central element of a pseudo effect algebra E , and fe the corresponding mapping of Definition 82. Then
(i) f e ( e N ) = (0, e N ) . (ii) If x 5 e, then f e ( x ) = (x,O). (iii) e A e N = O . (iv) If Y I eN then f e ( y ) = ( 0 , ~ ) ( v ) eN = e-. (vi) F o r a n y x E E , x A e ~ Ea n d x A e N ~ Eand ,
+
(vii) If f e ( x ) = (x1,x2),then x = X I V x2, x1 A x2 = 0 , and xz X I = x . Moreover, i f e , f E C ( E ) , then e A f E C ( E ) , and C ( E ) is a Boolean algebra, and for the mapping pe : E + [0,el defined by pe(x) = x A e , x E E i s a homomorphism of pseudo effect algebras. T H E O R E M 84. Let a pseudo effect algebra E be monotone a-complete. Let e = V z l ei E E , where ei E C ( E ) ,i 2 1. Then e E C ( E ) , and
T H E O R E M 85. Let a pseudo effect algebra E satisfy ( R D P ) . Then e E E is central if and only zf e A eN = 0 if and only if e A e- = 0. W e say that a pseudo effect algebra E satisfies general comparability i f , given x, y E E, there is a central element e E E such that P,(x) 5 pe(y) and p e / ( x ) pet(y). T h i s means that the coordinates o f t h e elements x = ( p e ( x ) , p e / ( x ) )and y = (pe(y),pet(y))can b e compared in [0,e] and [O, e'], respectively. For example, ( i ) every linearly ordered pseudo effect algebra trivially satisfies general comparability; (ii) so does any Cartesian product o f linearly ordered pseudo effect algebras. For an "MV-analogue" o f general comparability, see t h e next result.
>
New
Quantum Structures
43
PROPOSITION 86. Let M be a a-complete MV-algebra and x E M . Then the element e := V ~ = = l ( x@l - . . @ x,), where xn = x for every n, i s a central element of M such that p e ( x ) = x . I f f i s any central element of M such that p f ( x ) = x , then e 5 f . Moreover, M satisfies general comparability. THEOREM 87 ([~vure~enskij, 2003al). Let E be a pseudo effect algebra satisfying general comparability. Then E is a lattice, and E can be converted into a pseudo MV-algebra such that the partial addition derived from E as the pseudo MV-algebra coincides with the original + taken in the pseudo effect algebra. Proof. Let x, y E E and let e E C ( E ) such that pe(x) 5 pe(Y) and P e f ( x ) 2 pef(Y). Then x = pe(x) + p e f ( x ) 2 p e ( x ) p e f ( y ) =: v E E. Claim 1. v = x A y. We have y = pe ( y ) pel ( y ) 2 pe(x) Pet ( Y ) = v , that is, v 5 x, y. Let t 5 x , y. Then p e ( t ) 5 p e ( x ) and pet(2) 5 pef(Y), that is, 2 =pe(z) pel ( t )i p e ( x ) pet ( y ) = v , that is, v = x A Y.
+
+
+
+
+
Claim 2. w :=pe(y) +pel ( x ) E E and w = x V y. Since pe(y) A p e f ( x ) = 0, then w :=p e ( y ) +pet(x) E E. We conclude now xV y = w. We have x = P,(x) +P,I(x) 5 pe ( y ) pel ( x ) = w and Y = pe ( Y ) pet ( Y ) Ipe ( Y ) pef ( x ) = W .If now L X , Y then pe ( 2 ) 2 pe ( y ) and pel ( 2 ) L pel ( x ) that is, z = pe ( 2 ) pel ( 2 ) L w.
+
+
+
Claim 3. x a: ( x A y ) = ( x V y ) \ y and y
\
+
( xA Y )= (X V Y ) \
2.
Calculate
which proves Claim 3. Finally, according to Proposition 69, Claim 3 is a necessary and sufficient condition in order to convert E into a pseudo MV-algebra ( E ;@,- ," ,0,1); we define a @ b : = (a" In such a case, the original
\
(aNAb))-,
a , b € E.
+ and the one derived from @ coincide.
It is known that every extremal state on a Boolean algebra is two-valued. In the sequel we show that every two-valued state on C ( E ) can be uniquely extended to an extremal state on a pseudo effect algebra E provided E satisfies general comparability. In particular, every pseudo effect algebra satisfying general comparability
44
Anatolij DvurGenskij
has at least one state. W e recall that there are examples o f pseudo MV-algebras ij, admitting no state [ ~ v u r e ~ e n s k20011. PROPOSITION 88. Let e be a central element of a pseudo effect algebra E and let s be a state on E. ( a ) If s ( e ) = 0 , then s o p , = 0 and s = s o p , ~ . (b) If s ( e ) = 1, then s = s o p, and s o p e , = 0 . ( c ) If s ( e ) = a, where 0 < a < 1, then the functions sl = a-ls o p e and sz = ( 1 - a ) - I s ope! are distinct states o n E such that s = as1 + ( 1 - a ) s 2 . ( d ) If s i s extremal, then s ( e ) E {O,l). Proof. ( a ) Since p,(x) = x A e , and P , ~ ( X ) = x A e', x E E, we have s ( x ) = S ( X A e ) + s ( x A e') = s ( x Ae') = s o p , ~ ( x )and s o p , ( x ) = 0 . (b)It is similar as (a). ( c ) sl and sz are states while p, and pel are homomorphisms of E onto [0,el and [O, e'], respectively. T h e n s = as1 + ( 1 - a ) s 2 , and since s l ( e ) = a - l s ( e ) = 1 and s 2 ( e ) = 0 , we have that s l # sz. rn ( d ) T h i s follows immediately from ( c ) . PROPOSITION 89. Let s be a state o n a pseudo effect algebra E and let K = C ( E ) n Ker ( s ).
(i) If s i s an extremal state, then K i s a maximal ideal of C ( E ) . (ii) If s has the property whenever t E S ( E ) such that Ker(t) K implies t = s , then s i s extremal.
>
T H E O R E M 90. Let E be a pseudo effect algebra satisfying general comparability, and let K be a maximal ideal of C ( E ) . Then there i s a unique state s o n E such that C ( E )n Ker(s) = K. This state i s extremal. I n other words, every two-valued state so on C ( E ) can be extended to a unique extremal state s o n E such that s l C ( E ) = so. C O R O L L A R Y 91. If E is a pseudo effect algebra satisfying general comparability, then E x t s ( E ) is a nonempty, compact and totally disconnected set. T H E O R E M 92. Every maximal ideal of a pseudo MV-algebra satisfying general comparability i s normal. T H E O R E M 93 ([Dvure~enskij, 2004al). Every pseudo MV-algebra M satisfying general comparability i s representable.
4.5 Ideals of pseudo eflect algebras W e consider ideals o f pseudo effectalgebras and their connection with congruences and subgroups o f t h e representing pegroups.
45
New Quantum Structures
A non-empty subset I of a pseudo effect algebra E is said to be an ideal of E if (i) x y E I whenever x, y E I and if x y is defined in E, and (ii) if x 5 y for x E E and y E I, then x E I. Then E as well as (0) are ideals of E. We denote by Z(E) the set of all ideals of E.
+
+
Let a E E, then by Io(a) we denote an ideal of E generated by a. If E satisfies (RDPo), then
~ ,m m i m a l if I is a proper subset An ideal I of E is (i) normal if a+I = ~ + a , (ii) of E and it is not included in any proper ideal of E as a proper subset, and (iii) prime if Io(a) n Io(b) c I implies a E I or b E I. We denote by N ( E ) , M ( E ) , and P ( E ) the set of all normal ideals, maximal ideals, and prime ideals, respectively, of E. Using Zorn's lemma, we see that M ( E ) is non-empty. Under certain conditions 2003b], it can be proved that M ( E ) C_ P ( E ) . on E, [~vure~enskij, We recall that {0), E E N ( E ) and if f is a homomorphism from a pseudo effect E into another one F , then
is a normal ideal of E. The following result was proved in [~vure~enskij, 2003b, Prop 3.51. PROPOSITION 94. (1) A n ideal P of a pseudo effect algebra E i s prime if and only if, for all I,J E Z(E) with I n J P, we have I C P or J C P. (2) If P is prime, then I n J = P implies I = P or J = P. If E satisfies (RDP), then an ideal P i s prime if and only ih for all I,J E Z(E) with I n J = P , we have I = P or J = P. Let P be an ideal of a pseudo effect algebra E. For a , b E E, we write a-pb iff there are two elements e, f E P such that a \ e = b \ f. We note we can define another relation, symmetric with the later, which coincides with the first in the case of the normal ideal P. PROPOSITION 95. Let E be a pseudo effect algebra with (RDP). If P i s a n ideal i s a n equivalence on E, and on EIP = { a l p : a E P } , where of E, then a / P := { b E E : b - p a } , we can define a partial ordering a / P 5 b / P if and only if there is a n element e E P such that a \ e 5 b. If a A b i s defined in E , then ( a A b ) / P = a / P A b/P. Moreover, if P is a normal ideal, then EIP can be converted into a pseudo effect algebra ( E I P ; OIP, 1 / P ) , where the partial addition is defined by a / P + b / P = c / P if and only if there are a1 E a l p , bl E b / P and cl E c / P such that al+bl = cl.
+
+,
5 ~A f is a non-empty subset of E, then a In a similar way we define A a.
+
+ A := {a + x : x E A and a + x is defined in E}.
Anatolij DvureEenskij
46
Moreover, if P is a normal ideal of E satisfying (RDP), or (RDPl), or (RDP2), then so satisfies EIP. Recall that a poset (E; 5 ) is a A-antilattice if only comparable elements of E have an infimum. Let E be a pseudo effect algebra. Then E is an antilattice iff a A b = 0 implies a = 0 or b = 0, while (a \ (a A b)) A (b \ (a A b)) = 0. PROPOSITION 96. Let P be an ideal of a pseudo effect algebra E with (RDP) and let a 5 b, a, b E E. Then a / P = b / P if and only if a = b \ s for some s E P. THEOREM 97. An ideal P of a pseudo effect algebra E with (RDP) is prime zf and only if E/P is a A-antilattice. Let G be a directed pegroup written additively, and let C(G) denote the set of all convex directed subgroups of G. In analogy with pseudo effect algebras, we say that a directed convex subgroup P of a pegroup G is a prime subgroup of G if, for all directed convex subgroups I and J of G, I n J P implies I C P or J 5 P. We denote by P(G) the set of all prime subgroups of a unital pegroup G. An equivalent definition is: C E C(G) is prime iff, for a, b E G, Go(a) n Go(b) C C implies a E P or b E P. Let C E C(G) and define x/C := {y E G : x - y E C}, and G I C := {x/C : x E G}. We order the set G/C by the usual order of left cosets of G I C via x/C y/C iff x y + c f o r some C E C. If a pseudo effect algebra E = r(G,u) satisfies (RDPl), then there exists a one-teone correspondence between the sets Z(E) of all ideals or P ( E ) of all prime ideals of E and the sets C(G) and P(G), respectively, which was established in Theorem 67.
c
<
<
THEOREM 98 ([~vure~enskij, 2003bl). Let E = r ( G , u), where (G, u) is a unital po-group satisfying (RDP1). Let I be an ideal of E. Set
Then $(I) is an o-ideal of (G, u) if and only if I is a normal ideal of E. In such the case @/I,u/I) = r'(GI#(I), u/$(I)). Moreover, if K is an o-ideal of (G,u), then its restriction to El denoted by $(K), gives a normal ideal of E, i.e., Moreover, both mappings, 4 and $, are mutually bijective and preserve set-theoretical inclusion. THEOREM 99. Let E = r(G, u), where (G,u) is a unital po-group satisfying (RDP1). Let I be an ideal of E. Set
New Quantum Structures
47
T h e n S ( I ) and & ( I ) i s the subgroup and the convex subgroup, respectively, of G generated by I , and h0(1) i s the largest directed convex subgroup of G that i s contained in & ( I ) . Let I and J be two ideals of E. Then I C J if and only if 6 ( 1 ) C_ 6 ( J ) if and only if & ( I ) 5 6,(J) i f and only i f 60(1) 5 60(J). Let K be a convex subgroup of ( G , u ) . Then
i s an ideal of E , and 6 , ( y ( K ) ) K . If K i s directed, then 6 0 ( 7 ( K ) ) = K , and ~ ( 6 ~ ( 1=) I) for any ideal I of E. I n addition, i f K1 and K Z are two directed convex subgroups of ( G , u ) , then y ( K l ) C y ( K z ) i f and only i f Kl C K 2 . If K i s a prime subgroup of ( G ,u), then 7 ( K ) := K n E i s a prime ideal of E , and if P i s a prime ideal of E , then So(P) i s a prime subgroup of ( G ,u ) . Moreover, both mappings, y and 60 are mutually bi3ective and preserving set-theoretical inclusion. Moreover, the mappings y and 60 restricted to normal prime ideals and prime o-ideals are mutually bijective.
4.6 Visualixation of pseudo MV-algebras In this subsection, we generalize results of Subsection 2.5 from effect algebras to pseudo effect algebras. The following result has been proved in [Gla, Lemma 221. THEOREM 100. A convex directed subgroup C of a directed po-group G with ( R I P ) i s prime if and only if G / C i s a A-antilattice. THEOREM 101. Every pseudo effect algebra E with ( R D P 1 ) can be represented as a pseudo effect algebra of automorphisms from A(S2)for some A-antilattice set S2 such that all finite infima and suprema existing in E are preserved. Proof. Without loss of generality, by Theorem 67, we can assume that E = I'(G,u), where ( G , u ) is a unital po-group satisfying ( R D P 1 ) . The proof will follow the following steps.
Step 1. Let P be a prime ideal of E . According to Theorem 99, h O ( P )is a prime subgroup of G , and consider the mapping q5p : E + A(S2p),where S2p = G/Go(P), defined by ( X / G ~ ( P ) ) := ~ ~( (x + ~ )a)/Go(P), a E E ( x E G ) . Then, for a , b E E, (i) a 5 b, implies 4 p ( a ) I4 p (b), (ii) 4 p ( a b) = 4 p ( a ) 0 4 p ( b ) , (iii) 4 p ( a A b) = q5p ( a ) A q5p (b) if a A b is defined in E, (iv) q5p ( a V b) = 4 p ( a ) V 4 p ( b ) if a V b is defined in E, and (v) { a E E : q5p(a) = 0 ) = n{-x+GO(P)+x : x E G } n E = P. Moreover, we have E ( P ) := 4 p ( E ) I'(A(np),q5p ( u ) ) .
+
Step 2. Let g E G and let g $ 0 and set U ( g ) := {h E G : h 2 g ) , where E = r ( G ,u). We denote by A ( g ) an ideal of E which is maximal with respect to the property U ( g ) n A ( g ) = 0. Since 0 6 U ( g ) , A ( g ) exists by Zorn's lemma. We assert A ( g ) is a prime ideal of E. Let I n J = A ( g ) , where I and J are ideals of E.
Anatolij DvureEenskij
48
Assume (as an absurdum hypothesis) that A(g) is a proper subset of I as well as of J. Take a E I r l U(g) and b E J n U (g). We have 0, g 5 a, b. By (RIP) holding in (G, u), there is an element c E G such that 0, g 5 c 5 a, b, Since 0 5 c 5 a, we have c E E, and g 5 c E I n J = A(g) which gives c E U(g)nA(g), a contradiction. Step 3. We define the Cartesian product Eo = n{A(Rg) : g E G, g $ 0 ) of the system of A-antilattices {A(Rg)}g, where R, = G/Go(A(g)), and we order Eo by coordinates. Define a mapping f : E --t Eo by f (a) = {4g(a)), (a E E), where 4, := 4,qg),and let us set Cg = GO(A(g)). We claim that f is injective. Assume f (a) = f (b). Then (x+a)/Cg = (x+b)/Cg for all x E G and g $ 0. In particular, for x = 0 which gives a/Cg = b/Cg. Hence, a - b = cg for some cg E A(g) (a - b is taken in the group G), consequently, Cg = {O}. This proves that f is an injective homomorphism of E a -b E onto f (E) Eo. Assume f (a) f (b). If g = -b + a $ 0. Then (z a)/Cg 5 (x b)/Cg for all x t: G and g $0. Consequently, this holds also for x = 0, i.e., a/Cg 5 b/C, which c$, and c$ E A(g) nU(g), means a 5 b+c$ for some c$ E A(g). Therefore, -b+a a contradiction according to Step 2. The set f (E) can be converted into a pseudo effect algebra, i.e., (f (E);o, f (0), f (1)) is a pseudo effect algebra isomorphic to E, where o is the composition of automorphisms defined by coordinates. According to Step 1, f preserves all finite infima and suprema existing in E .
nggo
<
+
+
<
Step 4. Totally order the nonnegative elements of G, say {gt : t E T), where T is a linearly ordered set. Set Rt := G/Cg,, and without loss of generality we can assume R, n Rt = 0 for all s, t E T such that s # t. Let 52 = UtETRt, and define a partial order t: on R by wl 4 w2 iff wl E R, and w2 E at and s < t or s = t and wl 5 w2 in R,. Then R is a A-antilattice with respect to 4. Define a mapping fo : E + A(R) via: let w E R, and w E Rt for a unique ) where 4g, is defined in Step 1 and Step t E T. Let (w)fo(a) = ( ~ ) ( 4 ~ , ) (Ea Rt, 3. Hence, if a E E, then fo(a)lRt maps Rt onto Rt for all t E T. Similarly as in Step 3, fo is injective from E onto fo(E), and fo(E) is a pseudo effect algebra of automorphisms of R (indeed, fo practically coincides with the function f defined in Step 3), which finishes the proof. W
As a direct consequence of Theorem 101, we show that every pseudo MV-algebra is isomorphic to a pseudo MV-algebra of automorphisms of a linearly ordered set n. COROLLARY 102. Every pseudo MV-algebra M can be represented as a pseudo MV-algebra of automorphisms from A(R) for some linearly ordered set R. For further results of the theory of pseudo effect algebras, respectively pseudo MV-algebras, see [Dvure~enskij,2001c]-[Dvure~enskijand Vetterlein, 2004b], and [Dvure~enskij,19931-[Dvure~enskij,submitted(b)].
New Quantum Structures
5 CONCLUSION In this Chapter we presented the elements of certain new algebraic quantum structures for which commutativity of (the partial) addition is not assumed. We focused mainly on pseudo effect algebras and on pseudo MV-algebras. We showed how the algebraic structure of a pseudo effect algebra can determine the whole unital pogroup. This is possible for example if E satisfies a kind of the Riesz decomposition property. This Riesz-type decomposition property is roughly speaking a sort of distributivity property connected to the refinements of decompositions of unity. Every pseudo MV-algebra is of this kind, and it is an interval in a unital E-group. The partial operation is connected with a state structure of propositions, and it corresponds to the original ideas of G. Boole [Boole, 18541, who said that for statistical information of a propositional system we only need a rule telling us how to add probabilities of events. Let us mention that in the literature we find generalizations of the above structures to more general ones, where a partial addition is not easy to define. Such i algebras are known as BL-algebras [H~jek,19981 or pseudo BL-algebras [ ~Nola et al., 2002a; Di Nola et al., 2002bl. If we have a fixed pseudo effect algebra E, we showed under what conditions it is possible to cover it by blocks. In such a case, a block is a maximal set of mutually compatible elements of E which correspond to the "classical" part of the propositional system. In contrast to orthodox quantum structures, such a block is a pseudo MV-algebra, and pseudo MV-algebras are analogues of Boolean algebras. The existence of states on pseudo effect algebras gives rise to considering an (abstract) measuring process. An important consequence is then the fact that we can substitute the whole statistical information 'contained' in pseudo effect algebras by the statistical information 'contained' in (commutative) effect algebras. This enables us to find an ideal serving as a filter which 'kills' non-commutativity and preserves that statistical information of the original statistical information which can be influenced by a noise causing non-commutativity of the propositional system. At present, no pure quantum physical experiment which can be described by non-commutative pseudo effect algebras is known yet, and it would be interesting to have such an experiment. In any case we suggested an algebraic system which describes a special kind of non-commutativity and which was inspired by our experience with quantum structures. As we saw, Hilbert's Sixth Problem inspired experts to develop a very nice theory of quantum structures which is viable independently of its original quantum mechanical motivation. Nowadays we can find situations very far from quantum mechanics where the measured data do no satisfy the axioms of the Kolmogorovian axiomatic model of probability theory. Finally, we can say that in view of the particular nature of quantum measurements the relationship between quantum mechanics and the mathematics of quantum structures is similar to that between statistical physics and classical
+
+
50
Anatolij DvureEenskij
probability theory. It is a fact that the efforts of mathematicians and physicists in building up probability theory and mathematical statistics were a successful enterprise for the sake of classical physics. Therefore, there is real hope that the investigation of quantum structures can bring about new and useful results for both mathematics and quantum mechanics as well as for their applications. ACKNOWLEDGEMENTS The paper has been supported by the Center of Excellence SAS - Physics of Information - 1/2/2005, the grant VEGA No. 2/6088/26 SAV and by Science and Technology Assistance Agency under the contract No. APVT-51-032002, Bratislava, Slovakia. BIBLIOGRAPHY [Alfsen, 19711 E.M. Alfsen, "Compact Convex Sets and Boundary Integrals", Springer-Verlag, Berlin 1971. [Baudot, 20001 R. Baudot, Non-commutative logic programming language NoClog, in: Symposium LICS, (Santa Barbara, 2000, Short Presentation), pp. 3-9. [Baer, 19491 R. Baer, fie sums of groups and their generalizations. A n analysis of the associative law, Amer. J . Math. 71 (1949), 706-742. [ ~ e l t r a m e t tand i Cassinelli, 19811 E.G. Beltrametti, G. Caasinelli, "The Logic of Quantum Mechanics", Addison-Wesley, Reading, 1981. [Bennett and Foulis, 19951 M.K. Bennett, D.J. Foulis, Phi-symmetric effect algebras, Found. Phys. 25 (1995), 1699-1722. [Birkhoff, 19671 G. Birkhoff, "Lattice Theory", Amer. Math. Soc. Coll. Publ., Vol. 25, Providence, Rhode Island, 1967. [~irkhoffand von Neumann, 19361 G. Birkhoff, J. von Neumann, The logic of quantum mechanics, Ann. Math. 37 (1936), 823434. [ ~ o s b a c h19811 , B. Bosbach, Concerning semiclans, Arch. Math. 37 (1981), 316-324. [Bosbach, 19821 B. Bosbach, Concerning cone algebras, Alg. Univ. 15 (1982), 58-66. [Boole, 18541 G. Boole, "An Investigation of the Laws of Thought", Macmillan, 1854, reprinted by Dover Press, New York, 1967. [Buhagiar et al., 20061 D. Buhagiar, E. Chetcuti, A. DvureEenskij, Loomis-Sikorski representation of monotone u-conzplete effect algebrm, FUZZYSets and Systems 157 (2006), 683490. [Bunce et al., 1999] L.J. Bunce, K. SaitB, and J.D.M. Wright, A Dirmier-Schaefer-Zhang theo m m for operator algebras, Proc. Amer. Math. Soc. 127 (1999), 2975-2979. [Chang, 19581 C.C. Chang, Algebraic analysis of many-valued logics. Trans. Amer. Math. Soc. 88 (1958), 467-490. [Chovanec and KBpka, 19921 F. Chovanec, F. KBpka, O n a representation of observables i n Dposets of fizzy sets, Tatra Mt. Math. Publ. l (1992), 19-23. [Cignoli et al., 20001 R. Cignoli, I.M.L. DIOttaviano, D. Mundici, "Algebraic Foundations of Many-valued Reasoning", Kluwer Academic Publ., Dordrecht, 2000. [Di Nola, 20041 A. Di Nola, A. Dvureknskij, J. Jakubfk, Good and bad infinitesimals, and states o n pseudo MV-algebras, Order 21 (2004), 293-314. [Di Nola et al., 2002al A. Di Nola, G. Georgescu, and A. Iorgulescu, Pseudo-BL algebras I, Multiple Val. Logic 8 (2002), 673-714. [Di Nola et al., 2002b] A. Di Nola, G. Georgescu, and A. Iorgulescu, Pseudo-BL algebras II, Multiple Val. Logic 8 (2002), 71S750. [Dvureknskij, 19931 A. DvureEenskij, llGleason's Theorem and Its Applications", Kluwer Academic Publ., Dordrecht, and Ister Science Press, Bratislava, 1993. [Dvureknskij, 2000] A. DvureEenskij, Loomis-Sikorski theorem for o-complete MV-algebras and e-groups, J . Austral. Math. Soc. Ser. A 68 (2000), 261-277.
New Quantum Structures
51
[Dvure~enskij,20021 A. DvureEenskij, Pseudo MV-algebras are intervals in e-groups, J . Austral. Math. Soc. Ser. 72 (2002), 427-445. [Dvure~enskij,20011 A. Dvureenskij, States o n pseudo MV-algebras, Studia Logica, 68 (2001), 301-327. [Dvure~enskij,2001aI A. Dvurdenskij, States and idempotents of pseudo MV-algebras, Tatra Mt. Math. Publ. 22 (2001), 79-89. [Dvureknskij, 20021 A. DvureEenskij, Measures o n quantum stmctures, In: Handbook of Measure Theory, E. Pap (Editor), Elsevier Science, Amsterdam, 2002, Vol. I1 pp. 827-868. [Dvureknskij, 2002al A. Dvurdenskij, O n effect algebras which can be covered by MV-algebras, Inter. J. Theor. Phys. 4 1 (2002), 221-229. [DvureEenskij, 2002b] A. DvureEenskij, Test spaces, pseudo-effect algebras, and tensor product of pseudo-effect algebras, Demonstr. Math. 35 (2002), 689-715. [Dvure~enskij,2002c] A. DvureEenskij, Visualization of effect algebras by autonaorphisms, Inter. J. Theor. Phys. 4 1 (2002), 2311-2318. [Dvure~enskij,2002dl A. Dvureknskij, Product effect algebras, Inter. J. Theor. Phys. 4 1 (2002), 1827-1839. [Dvure~enskij, 20031 A. DvureEenskij, Blocks of pseudo-effect algebras with the Riesz interpolation property, Soft Computing 7 (2003), 441-445. [Dvureknskij, 2003al A. Dvurdenskij, Central elenaents and Cantor-Bernstein's theorena for pseudo-effect alegbras, J. Austral. Math. Soc. 7 4 (2003), 121-143. [Dvureknskij, 2003bl A. DvureEenskij, Ideals of pseudo-effect algebras and their applications, Tatra Mt. Math. Publ. 27 (2003), 45-65. [Dvure~enskij,20041 A. DvureEenskij, Lorenzen's theorem for pseudo-effect algebras, Math. Slovaca 5 4 (2004), 23-42. [ ~ v u r e k n s k i j2004aI , A. DvureEenskij, States o n pseudo-effect algebras with general comparability, Kybernetika 4 0 (2004), 397-420. [Dvureknskij, 20051 A. Dvureenskij, Loomis-Sikorski theorem for nzonotone o - w m p l e t e effect algebras, J. Austral. Math. Soc. 79 (2005), 305-318. [Dvure~enskij,20061 A. DvureEenskij, Holland's theorem for pseudo-effect algebras, Czechoslovak Math. J. 56 (2006), 47-59. [ ~ v u r e ~ e n s k i2006al j, A. DvureEenskij, Perfect effect algebras are categorically equivalent with Abelian interpolation po-groups, J. Austral. Math. Soc. (2006) [Dvure~enskij, submitted(a)] A. DvureEenskij, O n n-perfect GMV-algebras, submitted. [Dvure~enskij, submitted(b)] A. DvureEenskij, O n Konaori's characterization of varieties of GMV-algebras, submitted. [ ~ v u r e ~ e n s kand i j Holland, to appear] A. DvureEenskij, W.C. Holland, Top varieties of generalized MV-algebras and unital lattice-ordered groups, t o appear. [DvureEenskij and Kalmbach, 2002] A. DvureEenskij, G. Kalmbach, States o n pseudo M V algebras and the hull-kernel topology, Atti Sem. Mat. Fis. Univ. Modena 50 (2002), 131-146. [Dvure~enskijand Pulmannovi, 20001 A. DvureEenskij, S. Pulmannovi, "New Trends in Quant u m Structures, Kluwer Acad. Publ., Dordrecht, and Ister Science, Bratislava, 2000. [Dvure~enskijand Vetterlein, 20011 A. DvureEenskij, T. Vetterlein, Pseudo-effect alegbars. I. Basic properties, Inter. J. Theor. Phys. 40 (2001), 685701. [~vuretenskijand Vetterlein, 2001a] A. DvureEenskij, T . Vetterlein, Pseudo-effect algebras. II. Group representation, 40 (2001), 703-726. [DvureEenskij, 2001c] A. Dvureenskij, T . Vetterlein, Congmences and states o n pseudo-effect algebras, Found. Phys. Letters 1 4 (2001), 425446. [DvureEenskij and Vetterlein, 2001b] A. DvureEenskij, T . Vetterlein, Generalized pseudo-effect algebras. In: Lectures o n Soft Conaputing and Fuzzy Logic, Di Nola, A., Gerla, G., (Eds.), Physica-Verlag, Springer-Verlag Co., Berlin, 2001, pp. 89-111. [DvureEenskij and Vetterlein, 20021 A. DvureEenskij, T. Vetterlein, Algebras i n the positive cone of po-groups, Order 19 (2002), 127-146. [Dvureknskij and Vetterlein, 2003a] A. DvureEenskij, T . Vetterlein, O n pseudo-effect algebras which can be covered by pseudo MV-algebras, Demonstr. Math. 36 (2003), 261-282. [Dvure~enskijand Vetterlein, 2004al A. DvureEenskij, T. Vetterlein, Archimedeanicity and the MacNeill wnapletion of pseudoeffect algebras and po-groups, Algebra Universalis 50 (2004), [Dvureknskij and Vetterlein, 2003bl A. Dvurdenskij, T . Vetterlein, Infinitary and Riesz properties for pseudoeffect algebras and po-groups, 3. Austral. Math. Soc. 75 (2003), 295-311.
52
Anatolij DvureEenskij
[Dvurehnskij and Vetterlein, 2004bl A. DvureEenskij, T . Vetterlein, Non-commutative algebras and quantum structures, Inter. J . Theor. Phys. 43 (2004), 1599-1612. [Foulis and Bennett, 19941 D.J. Foulis, M.K. Bennett, Effect algebras and unsharp quantum logics, Found. Phys. 24 (1994), 1325-1346. [Foulis and Randall, 19721 D.J. Foulis, C.H. Randall, Operational statistics. I. Basic concepts, J. Math. Phys. 13 (1972), 1667-1675. [Fuchs, 19631 L. Fuchs, "Partially Ordered Algebraic Systems", Pergamon Press, OxfordLondon-New York-Paris, 1963. [Georgescu and Iogulescu, 20011 G . Georgescu, A . Iorgulescu, Pseudo-MV algebras, Multiple Val. Logic 6 (2001), 95-135. [Giuntini and Greuling, 19891 R. Giuntini, H. Greuling, Toward a formal language for unsharp properties, Found. Phys. 19 (1989), 931-945. [Glass, 19721 A.M.W. Glass, Polars and their applications i n directed interpolation groups, 'llans. Amer. Math. Soc. 166 (1972), 1-25. [Glass, 19811 A.M.W. Glass, "Ordered Pernautation Groups", London Math. Soc. Lecture Note Series, vol. 55 Cambridge Univ. Press, Cambridge, 1981. [Glass, 19991 A.M.W. Glass "Partially Ordered Groups", World Scientific, Singapore, 1999. [Gleeason, 19571 A.M. Gleason, Measures o n the closed subspaces of a Hilbert space, J . Math. Mech. 6 (1957), 885-893. [Goodearl, 19861 K.R. Goodearl "Partially Ordered Abelian Groups with Interpolation", Math. Surveys and Monographs No. 20, Amer. Math. Soc., Providence, Rhode Island, 1986. [Greechie, 19681 R. Greechie, O n the structure of orthonaodular lattice satisfying the chain condition, J . Comb. Theor. 4 (1968), 210-218. [Greechie, 19711 R. Greechie, Orthonaodular lattices admitting no states, J . Comb. Theor. 10 (1971), 119-132. [Gudder, 19791 S. Gudder, "Stochastic Methods i n Quantum Mechanics", Elsevier, North Holland, 1979. [HAjek, 19981 P. HAjek, Basic fuzzy logic and BL-algebras, Soft Computing 2 (1998), 124-128. [Heisenberg, 19301 W . Heisenberg, ' T h e Physical Principles of Quantum Theory", Dover, New Y o r k , 1930. [ ~ o l l a n d19631 , C . Holland, The lattice-ordered group of automorphism of a n ordered set, Michigan Math. J . 10 (1963), 399-408. [Kalmbach, 19831 G . Kalmbach, "Orthomodular Lattices", Academic Press, London, New Y o r k , 1983. [Kolmogorov, 19331 A.N. Kolmogorov, "Grundbeghffe der Wahrscheinlichkeitsrechnung", Berlin, 1933. [KGpka and Chovanec, 19941 F. KGpka, F. Chovanec, D-posets, Math. Slovaca 44 (1994), 21-34. [Mackey, 19631 G.W. Mackey, aMathenaatical Foundations of Quantum Mechanics", Benjamin, New Y o r k , 1963. [Maeda, 19801 S. Maeda, "Lattice T h w r y and Quantum Logic", Maki-Shoten, Tokyo, 1980 (in Japanese). [Mundici, 19861 D. Mundici, Interpretation of A F C*-algebras i n Lukasievicz sentential calculus, J . Funct. Anal. 65 (1986), 1 5 6 3 . [Mundici, 19951 D. Mundici, Averaging the truth-value i n Lukasiewiu logic, Studia Logica 55 (1995), 113-127. [Mundici, 1999) D. Mundici, Tensor products and the Loonais-Sikorski theorem for MValgebras, Advan. Appl. Math. 22 (1999), 227-248. [Navara, 19761 M. Navara, Construction of quantuna structures, this Handbook. [Piron, 19761 C. Piron, "Foundations of Quantuna Physics", Addison-Wesley, Reading, Mass., 1976. [Pt& and PulmannovA, 19911 P. PtAk, S. PulmannovA, "Orthomodular Structures as Quantum Logics", V E D A and Kluwer Acad. Publ., Bratislava and Dordrecht, 1991. [Rachiiek, 20021 J . Rachiiek, A non-cornmutative generalization of MV-algebras, Czechoslovak Math. J . 52 (2002), 255-273. [Ravindran, 19961 K. Ravindran, O n a structure theory of effect algebras, PhD thesis, Kansas State Univ., Manhattan, Kansas, 1996. [ R i e k n and Mundici, 20021 B. %&an, D. Mundici, Probability o n MV-algebras. In: Handbook o f Measure Theory, E. Pap (Editor), Elsevier Science, Amsterdam, 2002, Vol. 11, pp. 869-909.
New Quantum Structures
53
[RieEanovd, 20001 2. Ri&anovd, A generalization of blocks for lattice effect algebras, Inter. J. Theoret. Phys. 39 (2000), 231-237. [~ikorski,19641 R. Sikorski, "Boolean Algebras", Springer-Verlag, Berlin, Heidelberg, New York, 1964. [Varadarajan, 19681 V.S. Varadarajan, "Geometry of Quantum Theory", Vol. 1, van Nostrand, Princeton, New Jersey, 1968. [von Neumann, 19321 J. von Neumann, "Mathematische Grzlndlagen der Quantenmechanik", Springer-Verlag, Berlin, 1932. [Wright, 19731 J.D.M. Wright, On approximating concave functions by convex functions, Bull. London Math. Soc. 5 (1973), 221-222. [Wyler, 19661 0. Wyler, Clans, Compos. Math. 17 (1966), 172-189.
This page intentionally left blank
HANDBOOK O F QUANTUM LOGIC AND QUANTUM STRUCTURES: QUANTUM STRUCTURES Edited by K. Engesser, D. M. Gabbay and D. Lehmann O 2007 Elsevier B.V. All rights reserved
55
QUANTUM STRUCTURES AND FUZZY SET THEORY
Jaroslaw Pykacz
1 INTRODUCTION
At first glance, quantum structures, which are abstract algebraic objects, do not seem to have very much in common with fuzzy sets. However, already more than 30 years ago Maciej Mqczyliski proved a functional representation theorem [1973a; 19741 which allows to represent any a-orthomodular poset with an ordering set of states ('quantum logic') in the form of a family of [O, 11-valued functionals, which in turn can be treated as membership functions of fuzzy sets. Of course, the mere representation of elements of a quantum structure by fuzzy sets is not very interesting for its own sake. However, further investigations showed that not only can elements of a structure turn out to be expressible in terms of standard relations and operations on fuzzy sets but also physically interesting relations and operations on them. It turned out that the general relationship between various quantum structures and fuzzy sets is as close as the general relationship between Boolean algebras (which are specific examples of quantum structures) and traditional 'crisp' sets (which are specific examples of fuzzy sets) so that the 'representation theorems' of this Chapter can be viewed as generalizations of the Loomis-Sikorski theorem. The representation of quantum structures by families of fuzzy sets allows us to place the quantum probability calculus on an equal footing with the classical (Kolmogorovian) probability calculus. The only difference between them boils down to the fact that in the latter probability measures are defined on a-Boolean algebras of crisp sets while in the former they are defined on specific families of fuzzy sets which are quantum structures. Finally, since fuzzy sets bear the same relation to infinite-valued logic as do traditional crisp sets to classical two-valued logic, the representation of abstract quantum structures by families of fuzzy sets allows us to identify quantum structures, in particular 'quantum logics', with a specific kind of infinitevalued Lukasiewicz logics endowed with partially defined operations. This problem, however, will be discussed in the present Chapter only very briefly.
2 BASIC NOTIONS AND DEFINITIONS
2.1 The archetypal quantum structure: Birkhofl-von Neumann's quantum logic We begin with the most basic 'quantum structure', i.e. the quantum logic in Birkhoff-von Neumann's [1936] sense. Since the term 'quantum logic' has slightly different meanings in various books and papers, let us agree that throughout this Chapter it denotes an orthocomplemented a-orthocomplete orthomodular poset with an ordering set of states, i.e., a partially ordered set L which contains the smallest element 0 and the greatest element I, in which the orthocomplementation map I:L + L satisfying the conditions (a)-(c) exists: (a) ( a l l L = a. (b) If a 5 b, then bL 5 aL. (c) The greatest lower bound (meet) a A aL and the least upper bound (join) a V aL with respect to the given partial order exist in L and a A aL = 0, avaL=I. Moreover, the a-orthocompleteness condition holds: (d) If ai 5 a t for i # j (such elements are called orthogonal usually denoted by ai Iaj), then the join Viai exists in L, and so does the orthomodular identity: (e) I f a s b, then b = a v ( a L ~ b ) = a v ( a v b L ) l . Two elements a, b E L are called compatible iff there exist in L pairwise orthogonal elements al, bl,c such that a = a1 V c and b = bl V c. Probability measure on a quantum logic L is a mapping s : L + [0, 11 such that (i) s(I) = 1, (ii) ~ ( ~ i a=i Cis(ai) ) for any sequence of pairwise orthogonal elements of L. If the elements of a quantum logic L represent experimentally verifiable propositions about a physical system, then the probability measures defined on L represent states of a physical system and, therefore, are often themselves called states on L. Compatible elements of a quantum logic represent propositions that are simultaneously verifiable. In the case of the standard 'Hilbertian quantum logic' consisting of the projection operators on a Hilbert space associated to a physical system compatible elements are projection operators that commute and states on this logic are, by a famous theorem, namely Gleason's theorem, represented by density operators.
Quantum Structures and Fuzzy Set Theory
57
A set of probability measures (states) S on a quantum logic L is called ordering (full, order determining) 8 s(a) 5 s(b) for all s E S implies a 5 b. Let us note that the only way in which one can experimentally establish the partial order relation between various propositions about a physical system is to conduct experiments on a system prepared in various states, which means that only families of propositions allowing for ordering sets of states can be given a physical interpretation. This is the reason why we decided, contrary to certain other authors, to require that a 'quantum logic' is not merely a a-orthocomplete orthomodular poset but such a poset together with an ordering set of states.
2.2
The hierarchy of quantum structures: from efect algebras t o Boolean algebras
The most general algebraic structure encountered in investigations into the logicoalgebraic foundations of quantum mechanics has as its generic example the family of self-adjoint operators on a Hilbert space that belong to the interval [d,i], the so called 'effects'. Therefore, it bears the name 'effect algebra'. Nowadays, the most popular definition of an effect algebra is probably the following [~oulisand Bennett, 19941: An effect algebra is a system (El @, z,u) consisting of a set E with two distinguished elements z, u called the zero and the unit and equipped with a partially defined binary operation @ satisfying the following conditions for all a, b, c E E : (i) Commutative Law: If a @ b is defined, then b @ a is defined and a @ b = b @ a. (ii) Associative Law: If b @ c is defined and a @ (b @ c) is defined, then a @ b is defined, (a @ b) @ c is defined, and a @ (b @ c) = (a @ b) @ c.
(iii)Orthosupplementation Law: For every a E E there exists a unique a' E E such that a @ a' is defined and a @ a' = u. (iv) Zero-Unit Law: If u @ a is defined, then a = z. This way of defining the concept of an effect algebra is very convenient since it permits us to see easily that effect algebras are proper generalizations of other less general quantum structures. Foulis and Bennett [1994] (see also [~ulmannovi, 19941 where, however, another terminology is used) showed that if condition (iv) is replaced by the stronger: (iv') Consistency Law: If a @ a is defined, then a = z, then we obtain an orthoalgebra. If to the conditions (i)-(iv') we add the following: (v) Coherence Law: If a defined,
@
b, b @ c, and a @ c are defined, then (a @ b) @ c is
then we obtain an orthomodular poset, and finally, if we add:
58
Jarodaw Pykacz
(vi) Law of Compatibility: For all a, b E El there exist a l , bl, c E E such that b l @ c and a1 (bl c) are defined, a = a1 @ c and b = bl a c, then E can be turned into a Boolean algebra in a unique way. It should be noticed that in all structures mentioned above the operation @ allows us to define a partial order relation as follows: a 5 b iff there is c E E such that a c is defined and a c = b. On the contrary, in the case of orthomodular posets and less general quantum structures (orthomodular lattices and Boolean algebras) the operation CB coincides with the join of orthogonal elements.
2.3 Fuzzy sets According to the original idea of Lotfi A. Zadeh [1965],who is generally recognized as the founding father of fuzzy set theory, membership of an element x to a fuzzy set A, denoted pA(x) or simply A(x), can vary from 0 (full non-membership) to 1 (full membership) i.e. it can assume all values in the interval [0, 11. Therefore, a membership function PA : x H pA(x) E [ O , l ] completely characterizes the fuzzy set A and it is an obvious generalization of the characteristic function xA(x) of a traditional set: 0 for x !$ A 1 for x E A As soon as membership functions of fuzzy sets are established we can define all relations and operations known from traditional set theory on them. The definitions of the basic relations and operations on fuzzy sets were put forward early on by Zadeh in his historic paper [1965], and these are still the most frequently used in all contributions to fuzzy set theory as well as its applications. Zadeh's basic relations and operations are defined with the aid of membership functions as follows (we assume, as is usually done in fuzzy set theory, that all fuzzy sets considerd are in fact fuzzy subsets of a fixed universe of discourse U): Equality of fuzzy sets: A = B iff for all elements x in the universe U
Inclusion of fuzzy sets: A C B iff for all elements x in the universe U
Complement (negation) of a fuzzy set: A' is a complement of A iff for all elements x in the universe U
Union (sum) of fuzzy sets: A U B is a union of A and B iff for all elements x in the universe U
Quantum Structures and Fuzzy Set Theory
59
Intersection (product) of fuzzy sets: A n B is an intersection of A and B iff for all elements x of the universe U (6)
HAnB{x) = m\n[nA(x),fJ,B(x)}.
However, although Zadeh's original union and intersection of fuzzy sets are still the most frequently used, there are many other operations on fuzzy sets (even infinite families of them parametrized by real numbers) which constitute proper generalizations of traditional set-theoretic union and intersection of crisp sets. For the sake of building fuzzy set models of quantum structures the following operations, called bold union and intersection by Giles [1976], who was the first to study them within fuzzy set theory (other names: Giles, truncated, bounded, arithmetic, Lukasiewicz operations)1 proved to be the most useful: Lukasiewicz union (sum) of fuzzy sets: A LJ B is a Lukasiewicz union of A and B iff for all elements x of the universe U (7)
VAUB(X) = min[^(z) + HB{X), 1].
Lukasiewicz intersection (product) of fuzzy sets: A n B is a Lukasiewicz intersection of A and B iff for all elements x of the universe U (8) 3
/Mns (x) = max \fiA (x) + fj.B (x) - 1,0]. MACZYNSKI'S FUNCTIONAL MODEL OF B-VN QUANTUM LOGIC
In 1973, thirty seven years after the introduction of the very notion of quantum logic by Birkhoff and von Neumann [1936], Maciej Maczyriski published [1973a] a theorem which twenty years later turned out to be a milestone in building fuzzy set models of Birkhoff-von Neumann quantum logics. This theorem, expressed by Maczyriski in [1974] in an equivalent form better suited for our purposes, reads as follows: THEOREM 1. Let S be a non-empty set and let L be a set of mappings from S into [0,1] having the following three properties: (i) (ii) (in)
0 (the null function) belongs to L a £ L implies 1 — a € L for any (finite or countable) sequence ai,
1 It seems that these operations were rediscovered many times by various authors, which explains the multiplicity of their names. Although these operations did not appear explicitly in any Lukasiewicz paper, the name Lukasiewicz operations seems to be the most popular nowadays and will be used throughout this Chapter.
Jarodaw Pykacz
60
Then L i s a quantum logic with respect to the natural partial order of real functions, with orthocomplementation aL = 1 - a. Every point u E S induces a where mu(a) = a(u) for all a E L, and the probability measure mu o n (L, <,I), family of measures {mu : u E S) is ordering. Conversely, if (L, < , I ) is a quantum logic with an ordering set S of probability measures, then each a E L induces a function E : S -+ [ O , l ] where E(m) = m(a) for all m E S. The set of all such functions Z = {E : a E L) has properties (2)-(iii) and 5,'- ) is isomorphic to (L, <,I).
(r,
Mgczyriski's functional representation theorem provides a very useful tool for studying quantum logics since it allows abstract algebraic and order-theoretic notions that appear in the original definition of a quantum logic t o be expressed in the more convenient language of real functions. Moreover, since any [O, 11-valued function may be viewd as a memebership function of a fuzzy set, Mqczyriski's theorem allows any quantum logic to be represented in the form of a family of fuzzy sets. Indeed, if we think of the Mqczyliski functionals as membership functions of fuzzy sets, then condition (i) means that the empty set belongs to L, while condition (ii) means that if a fuzzy set belongs to L, then its standard fuzzy complement (4) also belongs to L. Only the third of Mgczyriski's conditions cannot be directly expressed in terms of fuzzy set notions. However, we shall show in the next section that this obstacle can be overcome at the expense of adding one more, very natural, condition. 4 THE GENERAL FUZZY SET MODEL OF B-VN QUANTUM LOGIC In the late eighties of the twentieth century, the formal similarity of some operations on fuzzy sets to order-theoretic operations on quantum logics gave rise to the idea of constructing fuzzy set models of quantum logics [pykacz, 19871. It was obvious from the very beginning that orthocomplementation should be modelled by the standard fuzzy set complementation (4) which, however, excludes the possibility of representing meets and joins by Zadeh's unions (5) and intersections (6) [P~kacz,19921. Indeed, the formal fuzzy set counterparts of the law of excluded middle and the law of contradiction which are assumed in point (c) of the definition of the Birkhoff-von Neumann quantum logic:
are not satisfied by any genuine fuzzy (i.e., non-crisp) set, but they are satisfied if we replace Zadeh's operations (5), (6) by Lukasiewicz's operations (7), (8). Moreover, the fact that Zadeh's operations are distributive means that they cannot be used in building fuzzy set models of generally non-distributive quantum logics. The attempts at building fuzzy set models of quantum logics made by the author since 1987 were, initially, flawed by the necessity of using, together with genuine
Quantum Structures and Fuzzy Set Theory
61
fuzzy set operations (4),(7), and ( a), pointwise algebraic sums of membership functions, which are alien to fuzzy set theory because they may yield outcomes z , at the expense bigger than 1. This drawback was overcome in 1994 [ ~ ~ k a c19941 of a slight modification of the third of the original Mgczyliski [1973a; 19741 conditions described in the previous section, and the addition of the natural requirement that an empty set is the only fuzzy set that is (weakly) disjoint with itself. Mgczyliski's functional representation theorem quoted in the previous section, expressed in the language of fuzzy sets, and combined with the author's modification yields the following theorem proved in [Pykacz, 19941: THEOREM 2. Any quantum logic L with an ordering set of probability measures S can be isomorphically represented in the form of a family L(S) of fuzzy subsets of S satisfying the following conditions:
(a) L(S) contains the empty set 0 , i.e. such set that ~ ~ (=s0)for all s E S. (b) L(S) is closed with respect to the standard fuzzy set complementation (4), i.e., if A E L(S), then A' E L(S). (c) L(S) i s closed with respect to the countable Lukasiewicz unions (7) of pairwise weakly disjoint [ ~ i l e s ,19761 sets, i.e., such sets that their Lukasiewicz's intersection is the empty set. I n symbols: i f AAin Aj = 0 for i # j , then UiAi E L(S). (d) The empty set 0 is the only set in L(S) that is weakly disjoint with itself, i.e., for any A E L(S), if A n A = 0, then A = 0. Conversely, any family of fuzzy subsets of an arbitrary universe U satisfying conditions (a)-(d) i s a quantum logic partially ordered by the inclusion of fuzzy sets (3), with the fuzzy set complementation (4) as orthocomplementation, the orthogonality of the elements coinciding with their weak disjointness, and an ordering set of probability measures generated by points of the universe U according t o the formula (11) s,(A) = p ~ ( x )for all x E U. Because of the second part of Theorem 2, any family L(U) of fuzzy subsets of an arbitrary universe U satisfying conditions (a) - (d) of Theorem 2, i.e., such that (a) 0 E C(U), (b) if A E L(U), then A' E L(U), (c) if Ai n Aj = 0 for i
# j, then UiAi E L(U),
(d) if A n A = 0, then A = 0, will be called a quantum logic of fuzzy sets or simply a fuzzy quantum logic. Of course the second part of Theorem 2 implies that any quantum logic of fuzzy sets L(U) has an ordering set of probability measures generated by points of the universe U according to the formula (11).
5 TWO PAIRS OF BINARY OPERATIONS Since any fuzzy quantum logic is a a-orthomodular poset with respect to the standard fuzzy set inclusion as a partial order, it is endowed with two pairs of binary operations: the Lukasiewicz union U and intersection n, with the help of which it is defined, and the ordinary join V and meet A with respect to the partial Of course, since by Theorem 2 any quantum logic with an ordering set of order probability measures can be isomorphically represented as a fuzzy quantum logic, one can also think of it as being equipped with these two pairs of binary operations. Therefore, it is of the utmost importance to study the relations between these operations and also to investigate their logical interpretation. The theorems of this section were announced without proofs in the author's talk given at the 10th International Congress of Logic, Methodology, and Philosophy z, However, due to an unexpected of Science (Firenze, August 1995) [ ~ ~ k a c19991. delay, the proofs were published only five years later in [pykacz, 20001.
s.
THEOREM 3. Let L(U) be a quantum logic of fuzzy subsets of a universe U and let A, B E L(U). Then A fl B E L(U) ifl A A B E L(U), and in this case A and B are compatible, A fl B = A A B, and A U B = A V B. Theorem 3 cannot be 'reversed' in the sense that for arbitrary A, B E L(U) neither the existence of A A B, A V B in L(U), nor the compatibility of A and B implies the existence of A fl B, A U B in L(U). To justify the first part of this statement let us note that, since by Theorem 3 the existence of a Lukasiewicz union or intersection of any two elements of L(U) implies their compatibility and since Boolean algebras are quantum logics in which all elements are compatible k PulmannovB, 1991]),Theorem 3 yields the following corollary: (see, e.g., [ ~ t B and COROLLARY 4. If A fl B or A U B erists in a fuzzy quantum logic for all A, B E L(U), A # B, then L(U) is a Boolean algebra. Therefore, if the existence of the meet or join of two elements A, B E L(U) were sufficient for the existence in L(U) of their Lukasiewicz union and intersection, every orthomodular lattice would be a Boolean algebra, which is obviously not true. The fact that compatibility of two elements of a fuzzy quantum logic is not sufficient for the existence of their Lukasiewicz union and intersection is shown in the following example given already in [Pykacz, 19991. This example actually shows too that Corollary 5 cannot be 'reversed', i.e., that even if L(U) is a Boolean algebra, A fl B and A A B do not necessarily belong to L(U) for all possible pairs A , B E L(U), A # B. EXAMPLE 5. Let X be a triangle with vertices a, b, c, and let L(X) consist of all fuzzy subsets of X whose membership functions are affie functions assuming on all vertices of X the values 0 or 1only. It was proved in [pykacz, 19831 that L(X) is a Boolean algebra and, therefore, all its elements are compatible. Let A, B be elements of L(X) such that A(a) = 1, A(b) = A(c) = 0, B(b) = 0, B(a) = B(c) = 1,and let us construct their Lukasiewicz union and intersection. Since (AuB)(a) = min(1 1 , l ) = 1, (A U B)(b) = min(0 0 , l ) = 0, (A U B)(c) = min(0 1 , l ) = 1,
+
+
+
Quantum Structures and fizzy Set Theory
+
63
+
and (A n B)(a) = max(1 1- 1,O) = 1, ( A n B)(b) = max(0 0 - 1,O) = 0, (An B) (c) = max(0 1- 1,O) = 0, AU B and A n B would belong to L(X) iff their membership functions are affine. But this is impossible: Let d be the midpoint of the edge ab. Since the values taken by affine functions at the point d should be the arithmetic means of their values taken at the vertices a and b , it might be expected that (A U B)(d) = ( A n B)(d) = However, from A(d) = B(d) = we have that (AUB)(d) = min(4+4, 1)= 1,and (AnB)(d) = m a x ( + + i -1,O) = 0. Therefore, the membership functions of the sets A U B and A n B are not affine functions and the sets A U B and A n B do not belong to C ( X ) .
+
4.
i,
Another difference between Lukasiewicz's and order-theoretic operations on the quantum logics of fuzzy sets concerns idempotency: Order-theoretic operations of meet and join are idempotent, i.e. A A A = A V A = A for any A E L(U). The following theorem, being straightforward consequence of Theorem 3 and general non-idempotency of Lukasiewicz's operations, shows that neither A MA, nor A n A belongs to L(U) for any 'genuine fuzzy', i.e., non-crisp element of L(U): THEOREM 6. Let L(U) be a quantum logic offuzzy subsets of a universe U and let A E L(U). Then A U A and A n A belong to L(U) iff A is a crisp subset of U, i.e., ifj A(x) E {O,1) for all x E U. In this and only in this case Lukasiewicz's operations coincide with ordinary set-theoretic union and intersection, and they are idempotent. The results of this section may provide new arguments for solving the longstanding problem of whether meet and join are proper models of conjunction and disjunction in quantum logics. Birkhoff and von Neumann already noticed in their historic paper [1936] that modelling conjunction and disjunction by meet and join is, in the case of noncompatible (i.e., not simultaneously verifiable) propositions, problematic. Therefore, the unrestricted existence of meets and joins in quantum logics that are orthomodular lattices (e.g., in Hilbertian quantum logics) is a serious drawback. The fuzzy set representation of quantum logics in which the Lukasiewicz's operations, which are only partially defined, play a crucial role suggests that the Lukasiewicz's operations may be better suited for this purpose. If this hypothesis is true, Theorem 3 explains why meet and join could also, in some cases, be good: they simply coincide with Lukasiewicz's operations if only the latter are defined. However, the fact that Lukasiewicz's operations are not idempotent and that they are not necessarily defined on compatible elements of a logic still raises problem, so this issue deserves further investigation. Before closing this section let us consider the frequently studied case of a so called concrete logic (see, e.g., [Ptbk and Pulmannovb, 19911) which is a family A of crisp subsets of a fixed set R such that (a)
0EA
(c) if {Ai : i E M) is a countable family of mutually disjoint sets, then UiAi E A.
Jarodaw Pykacz
64
Since the traditional set-theoretic operations can also be viewed as Lukasiewicz's operations applied to this 'degenerate' (from the point of view of fuzzy set theory) case, we see that all three conditions appearing in the definition of a concrete logic are actually identical with the first three conditions of the definition of a quantum logic of fuzzy sets. Since the remaining condition (d) of the definition of a fuzzy quantum logic (if A n A = 0 then A = 0) is always satisfied by any crisp set A, we see that our definition of a quantum logic of fuzzy sets is a straightforward generalization of the definition of a concrete logic or, the other way round, that every quantum logic of fuzzy sets automatically becomes a concrete logic if all its elements are crisp. Let us, however, note that concrete logics, although providing nice mathematical examples of the general notion of a quantum logic, are not very interesting from the physical point of view, since they admit ordering families of twevalued (i.e., dispersion-free) states while, by Gleason's theorem, Hilbertian quantum logics do not possess any twevalued state if the dimension of the Hilbert space is strictly greater than two (see, e.g., [Ptiik and Pulmannovb, 19911). Therefore, abandoning crisp models and working with genuine fuzzy sets is an indispensable step if one wants to produce set-theoretic models of quantum logics which are of any value to quantum physics. 6 GENERAL QUANTUM STRUCTURES AND FUZZY SETS Recent trends in the study of the logicealgebraic foundations of quantum mechanics have led to the exploration of more general structures such as orthoalgebras or effect algebras rather than orthomodular posets or lattices, and it is natural to study the possibility of representing these structures also by families of fuzzy sets or many-valued propositional functions equipped with suitably chosen operations. This was partially done by DvureEenskij in [1996] and [1997], where algebraic sums of membership functions, easily expressible in terms of Lukasiewicz's operations, were used.' The aim of the present chapter is to generalize these results to families of fuzzy sets endowed with operations that are pointwisely defined by dual pairs of triangular norms and conorms, and to consider the role of Lukasiewicz's operations within these models. In a preprint [1996] DvureEenskij noticed3 that a system of fuzzy sets L [0, 1IX,X # 0 satisfying the following conditions (in what follows we identify fuzzy sets with their membership functions, in particular the universum X with its characteristic function lx): (Dl) X E L
(D2) A' = lx - A E L whenever A E L 2~urmeisterand Mwzyriski [1994], and Pulmannovi 119941 obtained a large number of his results two years earlier working, however, within the framework of [O, 11-valued functions, not fuzzy sets. 3see, however, footnote 2, esp. [Pulmannovi, 19941
Quantum Structures and Fuzzy Set Theory
(D3) A
+ B E L whenever A + B I lx
can be organized into an effect algebra (L, a , 0, X ) if we assume that A @ B is defined iff A + B 5 lx and in this case we put A @ B = A + B. It is easily seen that condition (D3) can be expressed in terms of Lukasiewicz operations (7) and (8) as follows: (D3') A U B E L whenever A n B
= 0,
+
+
since A B 5 lx iff A n B = 0 and in this case A B = A U B. Since condition (D2) actually states that L is closed under the standard fuzzy set negation (4), the effect algebra of fuzzy sets defined by DvureEenskij is a family of fuzzy sets L containing the universe X (Dl), closed under the standard fuzzy negation (D2), and containing Lukasiewicz's unions of pairs of weakly disjoint sets, in which case an effect-algebraic operation coincides with Lukasiewicz's union. In the preprint [I9961 DvureEenskij also noticed that if we add to the conditions (Dl)-(D3) the following condition (D4) A
+ A 5 lx for A E L implies A = 0,
then L becomes an orthoalgebra. Again this condition can be expressed in terms of Lukasiewicz's intersection: (D4') A n A = 0 for A E L implies A = 0, and it means that the empty set is the only set in L that is weakly disjoint with itself (which, actually, coincides with our condition (d) of the definition of a fuzzy quantum logic). Therefore, (D4) actually expresses the Consistency Law (iv') which turns an abstract effect algebra into an orthoalgebra. The least general quantum structure of fuzzy sets studied by DvureEenskij in [1996] is an orthomodular poset which has to satisfy (Dl), (D2), and
Actually, this fact was formulated (in the language of [O, 11-valued functions, not fuzzy sets) and proved by Mgczyliski and Traczyk in [1973] (see also [Burmeister and M3czyliski, 1994]), and the proof given by DvureEenskij is essentially the same as in [ ~ ~ c z ~ l and i s k Traczyk, i 19731. Today, making use of the previously quoted results, we can give another proof since (D5) yields (D3) if we put C = 0, and if we assume that A A 5 lx,then (D5) applied to the triple A, A, lx - A yields (D4). Therefore, condition (D5), which is essentially the Coherence Law (v) of [Foulis and Bennett, 19941, combined with the fact that L C [0, 1IXthat fuifills (Dl)-(D4) is an orthoalgebra, turns it into an orthomodular poset. Let us notice that condition (D5) cannot be expressed in terms of Lukasiewicz's operations by a simple replacement of the algebraic sum by Lukasiewicz's union U in the triple sum A + B + C since it may happen that for some A, B, C E L and x E X , A(x) B(x), B(x) C(x), A(x) C(x) I 1 but A(x) B(x) C(x) > 1. This difficulty can be solved as in Section 4 by assuming
+
+
+
+
+
+
+
and, independently, (D4'), since (D4') is not implied by (D5'), contrary to (D4) which is implied by (D5). When such a modification is made, all the conditions defining an orthomodular poset of fuzzy sets are expressed entirely in terms of Lukasiewicz's operations and the standard fuzzy set negation. It should be noticed that in this way we have actually obtained a 'converse' part of Theorem 2. However, the form obtained is weaker than that presented in Section 4 since the condition (D5') concerns only triples of pairwise weakly disjoint sets, while in the condition (c) of Theorem 2 countable sequences of such sets are allowed. Therefore, a family of fuzzy sets obtained from conditions (a)-(d) of Theorem 2 is a a-complete orthomodular poset with an ordering set of probability measures (i.e. a quantum logic), while conditions (Dl), (D2), (D4'), and (D5') do not guarantee that the obtained poset is a-complete. Finally, let us study the problem when a family of fuzzy sets L c [0, 1IX,which is an orthomodular poset, i.e. it satisfies conditions (Dl), (D2), and (D5), or (Dl), (D2), (D4'), and (D5'), becomes a Boolean algebra. We know from the results of Foulis and Bennett that in this case it is enough to guarantee that a suitable form of the Law of Compatibility (vi) holds in L. If we are satisfied to work with algebraic sums of membership functions, then (vi) can be written as follows4. (D6) for all A, B E L, there exist A1, B1, C E L such that A1 A1+C
+ B1, B1 + C,
Actually, the fact that L C [0, 1IXsatisfying (Dl), (D2), (D5), and (D6) can be turned into a Boolean algebra was noticed and proved (in the language of [O,l]-valued functions) by Mgczyriski [1973b] as early as 1973. The Lukasiewic~operationsversion of condition (D6) looks as follows: (D6') for all A, B E L, there exist Al, B1, C E L such that Al n B1 = Bl l l C = A1nC=0,A=AlUC,andB=Bl~C. It should be noticed that conditions (D6) or (D6') actually mean that all elements of an orthomodular poset L 5 [0, 1IXare mutually compatible - a fact also noticed by Mqczyriski in [1973b]. Before this section closes, it can be shown why the most popular union of fuzzy sets - Zadeh's (A U B)(x) = max[A(x), B(x)], although commutative and associative, cannot be combined with any pointwisely defined negation as orthosupplementation in order to construct an effect algebra L [O, 1IXcontaining genuine fuzzy (i.e. non-crisp) sets and lx as the unit. Indeed, replacing @ by U in the Orthosupplementation Law would imply that for every A E L there exists a unique A' E L such that A U A' = lx. This would mean that A'(x) = 1 at least for all x E X such that A(x) # 1. Let us take x E X such that A(x) # 0 , l . Then 4 ~ denote e this condition (D6) for the sake of the uniformity of notation, although DvureEenskij did not study Boolean algebras of fuzzy sets in [1996].
Quantum Structures and Fuzzy Set Theory
67
in order to recover A(x) = AN(x),the orthosupplementation operation should distinguish between 1' = (At(x))' = AN(x)= A(x) # 0 and 1' = (lx(x))' = 0, i.e. it should depend not only on the value A(%) of a membership function A at a point x but also on the whole membership function A, i.e. it could not be pointwisely defined. At the end of the next section we shall give an example of an effect algebra containing a genuine fuzzy set with the Zadeh union as an effect-algebraic operation @ and non-pointwisely defined orthosupplementation, although in fact we do not expect such 'exotic' structures to be useful in physics. 7 EFFECT ALGEBRAS OF FUZZY SETS GENERATED BY NILPOTENT TRIANGULAR NORMS In 1994, Radko Mesiar [1994] generalized the notion of a quantum logic of fuzzy sets based on Lukasiewicz's operations and the standard fuzzy set negation to the case when operations are pointwisely defined by nilpotent triangular norms generated, together with the negation, by a common generator. The aim of the present section is to generalize the results of both Mesiar [I9941 and DvureEenskij [1996] by showing that the same can be done in the case of effect algebras. It should be recalled that a triangular norm (shortly: t-norm ), already introduced by Menger [1942] in 1942 and since then intensively studied (not only in fuzzy set theory: see, e.g. [Schweizer and Sklar, 1958; Frank, 1979; Schweizer, 1991]), is a function T : [O, 11 x [O, 11 + [O, 11 that is commutative, associative, non-decreasing in each argument, and such that T(x, 1) = x for all x E [0, 11. In the case of a triangular conorm (shortly: t-conorm) S : [O,1] x [O,l] -t [0, 11 the last condition is replaced by S(x, 0) = x for all x E [0, 11. Triangular norms and conorms define, pointwisely, intersections and unions of fuzzy sets:
We will in the sequel be interested in Archimedean t-norms ( t-conorms) which are continuous5 and such that T(x, x) < x for all x E (0,l) (resp. S(x, x) > x for all x E (0,l)). According to Ling [1964] any Archimedean t-norm T (t-conorm S) is generated by a continuous function f (resp. g), termed the additive generator of T (resp. S ) such that:
where f : [O, 11 -t [0, m ] is strictly decreasing with f (1) = 0 and f(-')(z) f (min[f (O), z]), respectively:
Saccordingto the convention used in [ ~ e b e r19841 ,
=
68
Jaroslaw Pykacz
where g : [O, 11 --t [0,KI] is strictly increasing with g(0) = 0 and g(-')(z) = g-l(min[s(l>, 4 ) . An Archimedean t-norm T (t-conorm S) is termed strict iff it is strictly increasing on (0,l) x (0,l) and nilpotent otherwise, and this difference is significant also for their additive generators since T is strict iff f (0) = KI (S is strict iff g(1) = co). Since additive generators are unique up to multiplication by positive numbers we can assume without any loss of generality that additive generators of nilpotent t-norms (t-conorms) are normed, i.e. that f (0) = 1 and g(1) = 1. The standard fuzzy set complementation A' = 1-A is the simplest example of a vast family of fuzzy complementations AC(x) = c(A(x)) pointwisely defined by strictly decreasing continuous mappings c : [O, 1 --t [O, 11, c(0) = 1, c(1) = 0 and such that c(c(x)) = x for all x E [0, 11. Trillas [1979] proved that any such mapping is generated by a continuous and strictly increasing function g : [O, 11 --+ [O, 11, g(0) = 0, g(1) = 1 such that c(x) = g-l(l - g(x)) for all x E [O,l]. If the same function is chosen simultaneously to be a normed generator of a nilpotent t-conorm S and a t-norm T is defined by T(x, y) = c(S(c(x), c(y))), then the pair (S, T) is called a c-dual pair and it generates, together with c, a de Morgan triplet of fuzzy operations (Us, nT,C ). Mesiar [1994] generalized the notion of a quantum logic of fuzzy sets by replacing the Lukasiewicz operations by arbitrary operations pointwisely defined by a c-dual pair of nilpotent t-(co)norms. In [Pykacz, 19971, the same procedure was applied t o effect algebras of fuzzy sets: THEOREM 7. Let (Us, nT,') be a de Morgan triplet of fuzzy operations defined pointwisely by a c-dual pair (S, T) of nilpotent t-(co)nonns, where S and c are generated by the same normed generator, and let L C [0, 1IX,X # 0, satisfy the following conditions: (i) lx E L (ii) ACE L whenever A E L (iii) A US B E L whenever A nT B = Ox.
Then (L, @, Ox, lx), where A @ B is defined ifl A A @ B = A Us B, is an effect algebra.
B = Ox and then we put
Let us notice that nilpotent (i.e. Archimedean but non-strict) t-(co)norms that appear in this theorem cannot be replaced by strict t-(co)norms. Indeed, the formula c(x) = g-l(l - g(x)) is a special case of a more general formula c(x) = g-l(g(l)-g(x)), valid for an additive generator of a nilpotent t-conorm which is not necesarily a normed generator [Weber, 19841. However, any attempt at using this formula for an additive generator g of a strict t-conorm would be unable to yield desirable results since in this case g(1) = KI so one would obtain Ac(x) = g-l(m g(A(x))) = g - l ( ~ )= 1 for all points x E X in which A(%) # 1 but in all points x E X such that A(x) = 1,Ac(x) would not be defined at all. Even if one excluded the case A(x) = 1 and in this case defined AC(x) = 0,such 'complementation'
Quantum Structures and Fuzzy Set Theory
69
would not be involutive, so it could not be the orthosupplementation in an effect algebra. The considerations given above do not imply that it is impassible to construct effect algebras of fuzzy sets in which effect-algebraic sums are generated by strict t-conorms, provided that we impose some special constraints on the definition of effect-algebraic sums: EXAMPLE 8. Let X = {xl,x2}, x l # x2, and let L = {Ox,lx, F,G} where F(xl) = 0, F(x2) = G(xl) = 1, and G(x2) = 112. It can be easily tested that L equipped with a probabilistic union (16) (AH B)(x) = A(x)
+ (B(x) - A(x)B(x)
as an effect-algebraic operation @, with the constraint that A @ B = A H B is defined whenever A B 5 (1/2)x, where (17) (A
B) (x) = A(x) B(x)
is a probabilistic intersection, is an effect algebra with Ox and lx as the zero and the unit. However, although the probabilistic operations H and El are generated by a strict t-conorm S(x, y) = x y - xy and a strict t-norm T(x, y) = xy respectively, which form a de Morgan triplet together with the standard fuzzy set negation, the orthosupplementation operation in L generated by @ does not coincide with the standard fuzzy set complementation. In fact, it can be versed that the orthosupplement of F is G and the orthosupplement of Ox is lx (and vice versa, of course), so the orthosupplementation operation is not defined pointwisely by a single formula valid for all elements of L.
+
Similar objections can also be raised against using fuzzy set unions generated by non-Archimedean t-conorms in attempts to build effect algebras consisting of fuzzy sets. We have already seen that if one tries to use the Zadeh union as an effect-algebraic operation @, then the orthosupplementation operation cannot be defined pointwisely. Similar arguments can be applied to other fuzzy set unions generated by non-Archimedean t-conorms. Again this does not mean that it is impossible to construct effect algebras of fuzzy sets using such unions as effect-algebraic operations, provided that a family L [0,1IXis suitably chosen, A @ B = A Us B is defined only for carefully selected pairs of fuzzy sets, and the orthosupplementation operation is not defined pointwisely. For example, the Celement effect algebra L = {Ox,lx, F, G, } described in the previous example is equally well defined when probabilistic operations are replaced by Zadeh operations with the same constraint in defining the effect-algebraic partial sum @. We should remember, however, that the prototype of all effect algebras: the family E(7-l) of all self-adjoint operators between 6 and i acting on a Hilbert space 'FI and its subalgebra P(7-i)consisting of all projection operators, which is the prototype of all quantum logics, when these structures are represented as families of fuzzy subsets of the set of density operators, are endowed with pointwisely defined Lukasiewicz's operations and the standard fuzzy complementation which form a
de Morgan triplet generated by the identity function. According to the results of Mesiar [1994; 19951, any quantum logic of fuzzy sets based on a de Morgan triplet of fuzzy operations generated by a common generator g is actually isomorphic to a logic based on Lukasiewicz's operations and the standard fuzzy complementation, and this result can in a straightforward way be generalized to effect algebras of fuzzy sets as defined by Theorem 17. Therefore, if one wants to obtain fuzzy set or many-valued models of quantum structures endowed with pointwisely defined o p erations, then the Lukasiewicz operations are unique up to an isomorphism given by a generator g. This implies that 'exotic' examples of effect algebras of fuzzy sets based on strict or non-Archimedean triangular norms, such as those described above, though mathematically interesting and even desirable, cannot be used to describe actually existing physical systems. 8 FUZZY SET MODELS OF QUANTUM PROBABILITY In certain experiments on quantum systems the relative frequencies of obtaining certain results, interpreted as probabilities, do not satisfy the numerical constraints imposed by classical (Kolmogorovian) probability theory. Such instances, usually connected with the violation of Bell's inequalities, strongly indicate the necessity of modifying the probability calculus used in quantum mechanics. There are several approaches to the subject that can generally be termed "quantum probability", and even a brief review of all of these would lead us far beyond the scope of this section. Therefore, we shall concentrate on the quantum-logical treatment of this subject. In the quantum logic approach to the foundations of quantum mechanics the Kolmogorovian triple (R,T, P ) consisting of a space of elementary events R, a Boolean a-algebra .F of selected subsets of R (random events), and a probability measure P, is replaced by a pair (L,p) consisting of a a-orthocomplete orthomodular poset (i.e. quantum logic) L and a probability measure (state) p defined on L. It follows from the very definition (see Section 2.1) that probability measures on quantum logics satisfy all numerical constraints imposed on Kolmogorovian probability measures: they are nonnegative, normalized, and a-additive on families of pairwisely disjoint (in the language of the 'orthodox' quantum logic: pairwisely orthogonal) elements. However, this clearly does not mean that Kolmogorovian probability calculus, which is based on Boolean a-algebras, is an adequate tool for quantum mechanics6. This is particularly evident in the quantum logic approach where several theorems were proved showing that various versions of Bell-type inequalities are satisfied by probability measures defined on a quantum logic if this logic is a Boolean algebra (see, e.g. papers by Santos [1986], PulmannovL and Majernik [1992], or Beltrametti and Mgczyliski [1993a; 1993bl).
allen en tine's [1986]conviction that he has "refuted any and all claims that 'classical' probability theory is not valid in quantum mechanics" seems to be based on a superficial analysis in which he took into account neither Bell-type inequalities, nor the differences in algebraic structures on which classical and quantum probability measures are defined.
Quantum Structures and Fuzzy Set Theory
71
Besides these numerical and 'structural' differences between classical and quantum probabilities there is another important difference: quantum random events are not subsets of the space of elementary events but mathematical objects of another kind. In the Hilbert space model they are represented by closed subspaces of a Hilbert space (or orthogonal projections onto such subspaces), while in an abstract model they are simply elements of an orthomodular poset. This does not allow quantum random events to be treated as subsets of a phase space of a physical system. In the quantum logic approach the states of any physical system are represented by probability measures on the logic of this system, and they form a convex set whose extreme points represent the pure states of the system. In the particular case of the phase space description of a classical statistical system its logic is identifled with a Boolean a-algebra of Borel subsets of a phase space and pure states are Dirac measures concentrated on one-point subsets of a phase space so they may be identified with points of a phase space of a system. On the other hand the elements of a logic, i.e. Borel subsets of a phase space may be identified with random events since each random event is in an obvious way defined by a property of the physical system: it consists of those pure states for which the given property holds. Therefore, traditional set-theoretic unions and intersections of random events are generated by disjunctions and conjunctions of propositions about the physical system under study in full accordance with the spirit of Kolmogorovian probability theory. This is no longer true for a quantum system. Properties of a quantum system, represented by the elements of a logic, can no longer be represented by crisp subsets of the set of pure states. However, there is still a possibility of representing the elements of a logic, even of a 'genuine' quantum system, by fuzzy subsets of the set of its pure states. It should be noted that the conditions (a)-(d) that define a quantum logic of fuzzy sets show remarkable similarity to the conditions that define Boolean a-algebras of random events in Kolmogorovian probability theory. The difference between condition (c) and the Kolmogorovian requirement that a a-algebra of random events be closed under countable unions of arbitrary, not only pairwise disjoint, sets seems to be unimportant since this requirement of Kolmogorov is superfluous: probability measures are assumed to be a-additive on pairwise disjoint, not arbitrary sequences of sets and it is possible to construct a reasonable 'classical' probability theory with this requirement being suitably modifled (for a detailed discussion of this problem see the book of T. L. Fine [1973]). Since condition (d) in the domain of crisp sets is trivially satisfied, we conclude that the notion of a quantum logic of fuzzy sets is in a sense a 'minimal' generalization of the notion of a a-algebra of random events to a family of fuzzy sets endowed with Lukasiewicz's operations, which permits to construct a reasonable probability calculus. Replacing the abstract quantum logics that appear in the foundations of quantum probability calculus by families of fuzzy subsets of sets of pure states of quantum systems one obtains, at the price of allowing fuzzy sets to come into
72
Jaroslaw Pykacz
play, a perfect parallelism between Kolmogorovian probability calculus applied to classical statistical systems and quantum probability calculus applied to quantum systems: in both cases random events are represented by subsets of sets of pure states of physical systems and they are defined by the properties of these systems. Conjunctions and disjunctions of properties of physical systems define intersections and unions of respective subsets. However, in quantum physics, in contrast t o the situation encountered in classical statistical physics, the results of these operations do not always belong to a quantum logic of fuzzy sets, even if this logic is a lattice. Therefore, making use of joins and meets in order to construct 'compound' quantum random events - a common practice in quantum probability - instead of Lukasiewicz's unions and intersections, can be a source of serious difficulty. Finally, it should be mentioned that it is possible to build a fuzzy probability theory using, instead of Lukasiewicz's operations, other operations chosen from the vast family of fuzzy unions and intersections. This has in fact been done in a number of papers (see, e.g. [Zadeh, 1968; Klement et al., 1981; Piasecki, 1985; Mesiar, 1992; Mesiar and Navara, 19961 to mention a few) in which a fullfledged fuzzy probability theory was developed. However, in the majority of these papers the authors use the original Zadeh operations which cannot be used to build fuzzy set models of quantum logics since, as was earlier noticed (in the realm of a many-valued logic) by Gonseth [1938], when combined with the standard fuzzy set complementation, they do not satisfy the excluded middle law and the law of contradiction for any genuine fuzzy set. At the end of Section 7 we also gave arguments why only Lukasiewicz's operations (or other isomorphic to them pointwisely defined by nilpotent triangular norms and conorms operations on fuzzy sets) can reasonably be used to build fuzzy set models of quantum logics and, therefore, to construct fuzzy set models of quantum probability spaces. Of course, because of the results presented in Sections 6 and 7, probability measures can be defined on suitable families of fuzzy sets that represent quantum random events also in more general approaches to quantum probability e.g. in those based on effect algebras instead of quantum logics. 9 SUMMARY
In this Chapter we described relations between abstract quantum logics and other more general abstract quantum structures and some special families of fuzzy sets endowed with partially defined Lukasiewicz's union and intersection. These relations are generally the same as the relations between abstract Boolean algebras and Boolean algebras of traditional ('crisp') sets endowed with the traditional settheoretic operations. In particular, this approach allows us to see the full parallelism between the classical Kolmogorovian probability calculus, where probability measures are defined on Boolean algebras consisting of crisp sets of random events, and the quantum probability calculus, in which probability measures are defined, depending on the level of generality, on various quantum structures consisting of fuzzy sets of quantum random events.
73
Quantum Structures and Fuzzy Set Theory
It was argued that Lukasiewicz's union and intersection of fuzzy sets (or 'is* morphic' to them operations on fuzzy sets pointwisely generated by by nilp* tent t-(co)norms) are, within the uncountable family of possible union-like and intersection-like operations on fuzzy sets, the only operations that may be used to construct quantum structures of fuzzy sets that might be of interst to physicists. Since fuzzy set models of quantum logics are endowed with two pairs of binary operations, namely by Lukasiewicz's union and intersection and order-theoretic meet and join, it was necessary to consider relations between them and decide which pair is better suited to serve as an algebraic model of logical conjunction and disjunction. Some arguments were given that, contrary to the 60-year old tradition, not the order-theoretic operations of meet and join, but Lukasiewicz's operations should be used for this purpose, but this problem still deserves further investigation. ACKNOWLEDGMENTS This work was carried out within the project G.0335.02 of the Flemish Fund for Scientific Research. BIBLIOGRAPHY [Ballentine, 19861 L. A. Ballentine. Probability theory in quantum mechanics American Journal of Physics, 54 (1986) 883-889. [Beltrametti and Mgczyfiski, 1993al E. G. Beltrametti and M. J. Mzjczyfski. On the characterization of probabilities: A generalization of Bell's inequalities, Journal of Mathematical Physics, 34 (1993) 4919-4929. [Beltrametti and Mgczyfiski, 1993bl E. G. Beltrametti and M. J. Mqczyfiski. On some probabilistic inequalities related t o the Bell inequality, Reports on Mathematical Physics, 33 (1993) 123-129. [Birkhoff and von Neumann, 19361 G. Birkhoff and J. von Neumann. The logic of quantum mechanics, Annals of Mathematics, 37 (1936) 823-843. [Burmeister and Mpczyriski, 19941 P. Burmeister and M. Mpczyliski. Orthomodular (partial) algebras and their representations, Demonstratio Mathenzatica, 27 (1994) 701-722. [Dvure~enskij,19961 A. Dvureknskij. Fuzzy set representations of some quantum structures, Preprint Series of the Mathematical Institute of the Slovak Academy of Sciences, 2/1996. [Dvureknskij, 19971 A. DvureEenskij. Fuzzy representation of effect algebras and the moment problem, in: [IFSA, 19971, Vol. IV,pp. 146-151. [Fine, 19731 T. L. Fine. Theories of Probability (Academic Press, New York, 1973). [Foulis and Bennett, 19941 D. J. Foulis and M. K. Bennett. Effect algebras and unsharp quantum logics, Foundations of Physics, 24 (1994) 1331-1352. [Frank, 19791 M. J. Frank. On the simultaneous associativity of F ( z , y) and x y - F ( x , y), Aequationes Mathematicae, 19 (1979) 194-226. [Giles, 19761 R. Giles. Lukasiewicz logic and fuzzy set theory, International Journal of ManMachine Studies, 67 (1976) 313-327. [Gonseth, 19381 F. Gonseth. Les entretiens de Zurich sur les fondenzents et la mDhode des sciences mathematiques 6-9 de'cembre 1938 (Ziirich, 1941). [Klement et al., 19811 E. P. Klement, R. Lowen, and W. Schwychla. Fuzzy probability measures, h z y Sets and Systems, 5 (1981) 21-30. [Ling, 19641 C. H. Ling. Representation of associative functions, Publicationes Mathematicae Debrecen, 12 (1965) 189-212.
+
74
Jaroslaw Pykacz
[Mpczyfiski, 1973al M. J. Mpczyfiski. The orthogonality postulate in axiomatic quantum mechanics, International Journal of Theoretical Physics, 8 (1973) 353-360. [Mpczyhki, 1973bl M. J. Mpczyxkki. On some numerical characterization of Boolean algebras, Colloquiuna Mathematicum, 27 (1973) 207-210. [Mpczyfiski, 19741 M. J. Mpzyriski. Functional properties of quantum logics, International Journal of Thwretical Physics, 11 (1974) 149-156. [Mpczyfiski and Traczyk, 19731 M. J. Mpzyfiski and T . Traczyk. A characterization of orthomodular partially ordered sets admitting a full set of states, Bull. Acad. Polon. Sci. Str. Sci. Math. A s k . Phys . 21 (1973) 3-8. [Menger, 19421 K. Menger. Statistical metrics, Proceedings of the National Academy of Sciences of the USA, 28 (1942) 535-537. [Mesiar, 19921 R. Mesiar. Fuzzy sets and probability theory, Tatra Mountains Mathenaatical Publications, 1 (1992) 105-123. [Mesiar, 19941 R. Mesiar. h-fuzzy quantum logics, International Journal of Theoretical Physics, 33 (1994) 1417-1425. [Mesiar, 19951 R. Mesiar. Do fuzzy quantum structures exist?, International Journal of Theoretical Physics, 34 (1995) 1609-1614. [Mesiar and Navara, 19961 R. Mesiar and M. Navara. T,-tribes and T,-measures, Journal of Mathematical Analysis and Applications, 201 (1996) 91-102. [Piasecki, 19851 K. Piasecki. Probability of fuzzy events as denumerable additivity measure, Fuzzy Sets and Systems, 17 (1985) 271-284. [IFSA, 19971 Proceedings of the Seventh International fizzy Systems Association World Congress, Prague, June 25-29, 1997 (Academia, Prague, 1997). [Ptik and Pulmannovi, 19911 P. P t i k and S. Pulmannovi. Orthomodular Structures as Quant u m Logics (Kluwer Academic Publishers, Dordrecht, 1991). [Pulmannovii, 19941 S. Pulmannovi. A remark on orthomodular partial algebras, Demonstratio Mathenzatica, 27 (1994) 667-699. [Pulmannovi and Majernik, 19921 S. Pulmannovi and V. Majernik. Bell inequalities on quantum logics, Journal of Mathematical Physics, 33 (1992) 2173-2178. [Pykacz, 19831 J. Pykacz. Affine Mpzyriski logics on compact convex sets of states, International Journal of Theoretical Physics, 22 (1983) 97-106. [Pykacz, 19871 J. Pykacz. Quantum logics as families of fuzzy subsets of the set of physical states, Preprints of the Second International Fuzzy Systems Association Congress, Tokyo, July 20-25, 1987, vol 2 , pp. 437-440. [Pykacz, 19921 J. Pykacz. Fuzzy set ideas in quantum logics, International Journal of Theoretical Physics, 31 (1992) 1767-1783. [Pykacz, 19941 J. Pykacz. Fuzzy quantum logics and infinite-valued Lukasiewicz logic, International Journal of Theoretical Physics, 33 (1994) 1403-1416. [Pykacz, 19973 J. Pykacz. Triangular norms - based quantum structures of fuzzy sets, in: [IFSA, 19971, Vol. IV, pp. 159-164. [ ~ ~ k a c19981 z, J. Pykacz. Fuzzy quantum logics a s a basis for quantum probability theory, International Journal of Thwretical Physics, 37 (1998) 281-290. [Pykacz, 1999] J. Pykacz. Attempts a t the logical explanation of the wave-particle duality, in: M. L. Dalla Chiara et al. (eds) Language, Quantum, M w i c (Kluwer, Dordrecht, 1999) 269-282. [ ~ y k a c z20001 , J. Pykacz. Lukasiewicz operations in fuzzy set and many-valued representations of quantum logics, Foundations of Physics, 30 (2000) 1503-1524. [Santos, 19861 E. Santos. The Bell inequalities as tests of classical logics, Physics letters A , 115 (1986) 363-365. [Schweizer and Sklar, 19581 B. Schweizer and A. Sklar. Espaces m&riques albatoires, Conaptes Rendus Acad. Sci. Paris, 247 (1958) 2092-2094. [~chweizer,19911 B. Schweizer. Thirty years of copulas, in: G. Dall'Aglio et al. (eds) Advances in Probability Distributions with Given Marginals (Kluwer, Dordrecht, 1991) 13-50. [Trillas, 19791 E. Trillas. Sobre functiones de negacion en la teoria de conjuntos difusos, Stochastica, 3 (1979) 47-59. [Weber, 1984) S. Weber. I-decomposable measures and integrals for Archimedean t-conorms I, Journal of Mathematical Analysis and Applications 101 (1984) 114-138. [Zadeh, 19651 L. A. Zadeh. Fuzzy sets, Infornzation and Control, 8 (1965) 338-353. [Zadeh, 19681 L. A. Zadeh. Probability measures on fuzzy events, Journal of Mathenaatical Analysis and Applications, 23 (1968) 421427.
HANDBOOK O F QUANTUM LOGIC AND QUANTUM STRUCTURES: QUANTUM STRUCTURES Edited by K. Engesser, D. M. Gabbay and D. Lehmann O 2007 Elsevier B.V. All rights reserved
75
ALGEBRAIC AND MEASURE-THEORETIC PROPERTIES OF CLASSES OF SUBSPACES OF AN INNER PRODUCT SPACE David Buhagiar, Emmanuel Chetcuti and Anatolij DvureEenskij
1 INTRODUCTION In the classical (Kolmogorov) probability theory [Kolmogorov,19331, the set of experimentally verifiable events assigned to a physical systems (i.e. the event space) can be identified with a measurable space (X, C). The order relation 5 induced by the lattice operations V and A is logically interpreted as the implication relation, whereas the complement operation ' is understood as the negation operation of events. A probability measure is a countably additive, normalized and nonnegative function p on C. Random variables are the C-measurable real-valued functions on X. Ever since the celebrated paper The logic of quantum mechanics by G . Birkhoff and J. von Neumann [Birkhoff and von Neumann, 19361, there has been an intense research in the mathematical foundations of quantum mechanics. The algebraic study of quantum logics that generalize Boolean a-algebras has given rise to the theory of orthomodular posets, and the study of states to non-commutative measure theory. One of the most important quantum logic is the projection lattice of a Hilbert space H. The basic axiom of the so called Hilbert space model is that the events of a quantum system can be represented by projections on a Hilbert space or, equivalently, the collection L(H) of closed subspaces of a Hilbert space H. When endowed with the inclusion relation C and orthocomplementation I,L(H) is a complete orthomodular lattice. The transition from the Boolean a-algebra C to the projection lattice L(H) consists in replacing the disjointedness of sets by a geometric concept of the orthogonality of subspaces. The notion of a random variable generalizes to that of an observable. Let B(W) denote the Borel a-algebra of B. An observable is a map a : B(R) + L(H) such that: (i) a(W) = H , (ii) a(A)Ia(B) for any disjoint pair of Borel sets and (iii) a(UiEnAi) = ViCNa(Ai) for any pairwise disjoint sequence {Ai I i E M) of Borel sets. An observable is bounded if there exists a compact subset C of B such that a(C) = H. In view of the spectral theorem, the set of bounded observables can be identified with the self-adjoint part of B(H), the algebra of bounded operators on H. A probability measure on L(H) is a map s : L(H) + [O, 11 such that
76
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
s(H) = 1 and s(ViENMi) = CiENs(Mi) for every sequence (Mi 1 i E N) of pairwise orthogonal elements of L(H). Every positive trace-class operator T with unit trace (density matrix) on H defines a probability measure on L(H) as follows: M E L(H) H trTPM, where PMdenotes the projection of H onto M. It turns out that if 3 5 dim H 5 No, then every probability measure has this form. Thus every probability measure on L(H) extends to a linear functional on B(H). This characterization is due to A. Gleason leason on, 19571. Instead of restricting ourselves to Hilbert spaces, we can consider general inner product spaces (= pre-Hilbert spaces). A natural question can be raised about the role of the purely mathematical concept of (metric) completeness of H in the Hilbert space model with respect to the physical interpretation the model bears. Can we retrieve a similar model if we drop the assumption of completeness? A considerable amount of work has been done in this line, for example [Amerniya and Araki, 1966-67; Gross and Keller, 1977; Hamhalter and PtLk, 1987; Holland, 19691 (and many others). In this connection we also mention the very important results of H. A. Keller and M. P. Solkr. In [Keller, 1980],H. A. Keller exhibited an example of a nonarchimidean orthomodular quadratic space such that the corresponding projection logic resembles the projection logic L(H) for a Hilbert space H and M. P. Solkr showed that if an orthomodular quadratic space admits at least one infinite orthonormal sequence, then this space has to be a Hilbert space [Solkr, 19951. We also remark that as it was the case with Boolean algebras, the algebraic structure of the projection lattices of Hilbert spaces and the set of positive o p erators lying under the identity (effects) were thoroughly generalized and today there is a whole hierarchy of quantum structures, for example: orthomodular posets and lattices as quantum logics [Varadarajan, 1985; Kalmbach, 1983; PtLk and PulmannovL, 19911, effect algebras [Giuntini and Greuling, 1989; Bennett and Foulis, 19971, D-posets [Kbpka and Chovanec, 19941 and many others (refer to the monograph New Trends in Quantum Structures by A. DvureEenskij and S. PulmannovL [ ~ v u r e ~ e n s kand i j PulmannovB, 20001 for a complete survey).
2 FAMILIES OF CLOSED SUBSPACES OF AN INNER PRODUCT SPACE S In this section we define six different families of closed subspaces of an inner product space S and investigate their interrelations. Let S be an inner product space over D (where D is the real field R or the complex field C1)and let (. , .) be the inner product on S. For each subset A S we denote the (metric) closure of A in the completion 3 of S by 2 and therefore, is the (metric) completion of A. We write A'-s to denote the orthogonal complement of lhlany results can be generalised to the quaternion case but our aim here is maximal clarity and simplicity rather than maximal generality.
Algebraic and Measuretheoretic properties
A in S so that
. ..
A~= " {b E S I (a, b) = 0 for all a E A ) .
We will consider the following families of closed subspaces of S. W(S) = { M is a subspace of S I M is closed in S) ; F ( S ) = { M is a subspace of S I MI"'" = M) ; Eq(S) = { M is a closed subspace of S I M @ M I S is dense in S) ; E(S) = { M is a subspace of S I M @ M I " = S) ; C(S) = { M is a subspace of S I M is complete or cocomplete ) ; P ( S ) = { M is a subspace of S I M is finite or cofinite dimensional) .
M is cocomplete (cofinite dimensional) means that M = ALs for some complete (finite dimensional) subspace A of S . A subspace M C S is said to be orthogonally closed if M E F(S); splitting if M E E(S); quasi-splitting if M E Eq(S). Let us begin by showing that
Proof. F ( S ) C W(S). This follows immediately from continuity of inner product.
Eq(S) C F(S) . Let M E Eq(S); then
where the third equality follows from Proposition 37. Consequently, M E F(S).
E(S) G Eq(S).This follows directly from definition. C(S) g E(S). Suppose that M E C(S) and let N E { M ,M I " ) be complete. Then N is splitting in 3,that is 'S = N @ N l 3 . Let s E S be arbitrary. We have s = n n' for some n E N and n' E N I T . Moreover, n' = s - n E SnN ~ = T N l s . Hence S = N N's and therefore M E E(S) .
+
P ( S ) C(S). This follows from the fact that every finite dimensional space is complete.
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvuretenskij
78
It is not difficult to see that:
.
Each of the above families is closed under orthocomplementation. {0), S E P(S).
When S is complete, C(S) = E(S) = Eq(S) = F ( S ) = W(S). By taking various subspaces of the Hilbert space 12,we now show that in general the six families are distinct. In all the following examples we let ei = {bij I j E N), i E N, be an orthonormal basis of 12.For a vector u E S, where S is an inner product space, we let [u] be the one-dimensional subspace span{u). EXAMPLE 1. This is to show that in general W(S) # F(S). Let f = CiEN i e i and let S = span{f, e2, e3, . . . ). It is not difficult to see that M = span{ez, e3, . . .) is a closed subspace of S. On the other hand, M I s = (0) and therefore, M I S I S= S. Consequently, M $! F(S). EXAMPLE 2. This is to show that in general F(S) # Eq(S). 1 03 1 Let f = el 4ez Cz2&ezi and g = el - ;ie2 Ci=l -ezi+l. Define S = span{ei I i = 3,4,5,. . . ) [f] [g], and let M = span{ei I i = 4,6,. . . ) and N = span{ei I i = 3,5,. . .). It is not difficult to verify that M I S = N [g] s N. Observe that and N L s = M + [f]. Therefore MIS-'-" = M and N ~ s - ' -= el E ii?I7, but el 4 [g] = That M $! Eq(S) now follows from Proposition 37.
+
+
+
+ + +
+
n.
EXAMPLE 3. This is to show that in general Eq(S) # E(S). Let f = CiEN iei. Define S = span{ei I i E M) [f],M = span{ej I i = 2,4,. . . ) and N = span{ei I i = 1,3,. . . ). It is not difficult to verify that M I S = N and M E Eq(S); but it is clear that M @ E(S).
+
EXAMPLE 4. This is to show that in general E(S) # C(S). Let S = Cf = span{el, e2,. . . ) C 12. If M = span{ei I i = 2,4,. . . ) then M I S = span{ei I i = 1,3,. . . ). Clearly S = M @ M I Sand therefore M E E(S). M E C(S) implies either M or M I S is complete, i.e. a Hilbert space. But any Hilbert space is either finite dimensional or else its linear dimension is uncountable; therefore neither M nor M I S can be complete. This means that M $! C(S). Finally, the last example which is trivial. Note that in this example, S is a complete inner product space. EXAMPLE 5. This is to show that in general C(S) # P(S). Let S = l2and M = span{ei I i = 2,4,. . . ). Then M E C(S) but evidently, M $ P(S). Before we analyze the algebraic structure of the above families we give a result that we would need in later sections. PROPOSITION 6. Let u E S be arbitrary.
(1) If M E P(S), then M
+ [u] E P(S).
Algebraic and Measure-theoretic properties
...
+ [u] E C(S). (3) If M E E(S), then M + [u] E E (S). (4) If M E Eq(S), then M + [u] E Eq(S). (5) If M E F(S), then M + [u] E F(S). ( 6 ) If M E W(S), then M + [u] E W(S). (2) If M E C(S), then M
Proof. We give the proof for the case of F(S). If u E M, then result is trivial. Assume that u 4 M such that llull = 1. Since M E F(S) we have u 4 MISIS. Therefore there exists b E MIS such that (b, u) = 1. Now, for all y E MIS, we have
because y - (y,u)b E Take any x E ( M
+[
MI" and
(y - (y,u)b,u) = (y,u) - (y,u)(b,u) = 0.
u ] ) ~For ~ any ~ ~ y. E M I S , we have
Therefore x - (x, b)u E M'-S-'-S = M. This implies that x E M
+ [u].
rn
We end this section by giving some definitions. DEFINITION 7. An orthocomplemented poset is a bounded poset (L, 5 , 0 , I), where 0 is the smallest element, 1 is the largest element and 0 # 1, with orthocomplementation I: L -t L satisfying
(OCP3) a V a l exists ~ and is equal to 1.
As a consequence to the above axioms we have a A a l exists ~ and is equal to 0. Here by V (respectively, A) we mean supremum (respectively, infimum) with respect to the partial order 5. An orthomodular poset is a bounded poset (L, <,0, I), where 0 is the smallest element, 1is the largest element and 0 # 1,with orthocomplementation I: L + L satisfying
David Buhagiar, Emmanuel Chetcuti and Anatolij DvureEenskij
80
(OMP3) a
< bLL & a v b exists in L.
Any ort homodular poset is an orthocomplemented poset . An orthocomplemented poset which is at the same time a lattice is called an ortholattice while an 01-thomodular lattice is an orthomodular poset which is at the same time a lattice. DEFINITION 8. A quantum logic is a a-(ortho)complete orthomodular poset. That is, an orthomodular poset (L, <, 0,1, I)with the following property: for any family {a,I n E M) in L satisfying a, a* for every n , m E M,n # m, the supremum VnENa, exists in L.
<
c
Let us endow the above families with the partial ordering of set-inclusion and orthocomplementation I. Our next step is to analyze the algebraic structure of the said families. 3 ALGEBRAIC STRUCTURE OF P(S), C(S), E(S), E,(S), F(S) AND W(S) It is a well known fact that (P(S), c , {0), S, V, A) is a (bounded) modular lattice, where a (bounded) lattice (L, <,0,1, V, A) is said to be modular if for every a, 6, c E L we have (ML) a < b = + a V ( b ~ c ) = ( a v b ) ~ c . Let us now show that (C(S), C, {0), S,I)and (E(S), C, {0), S,I)are orthomodular posets. We will see later that in general both families need not be lattices. PROPOSITION 9. (1) If A, B E E(S) such that A
c B'-S, then A@B E E(S) and A @ B = AVE B.
(2) I ~ A , B E C(S) such thatA 2 BIS, t h e n A @ B C(S) ~ andA@B=AVcB. Proof.
(1) We show that for all d E S, we have:
Since A and B are splitting subspaces of S we have:
Algebraic and Measure-theoretic properties
...
Then
= (a
+ b) + (6 - b) = (a + b) + ( i - a);
and therefore
Hence A @ B E E (S) .
(2) We note that since A BIS, then A is complete when B is cocomplete. (Conversely, B is complete when A is cocomplete.) So we need only consider two cases. A and B are both complete; it then evidently follows that A @ B is complete. A is complete and B is cocomplete. (The case when A is cocomplete and B is complete is identical). By part (1) we know that A @ B E E(S) F(S) and therefore we have
Since ALs n BIS is complete, (AL" n BLs)'-s is cocomplete.
As already mentioned above, for a general inner product space S, E(S) and C(S) need not be lattices (see Section 3.2). In Proposition 9 we have shown that if A and B are two orthogonal elements in E(S) (respectively, in C(S)), then A V E B (respectively, A V c B) exists in E(S) (respectively, in C(S)) and is equal to A @ B. Moreover, since (A @ B ) I s = ALs f l BLs, we have ALs AE BLs (respectively, ALs A c B ~ S exists ) in E(S) (respectively, in C(S)) and is equal to A l s nB ~ S . We can now show that the two families are orthomodular posets. PROPOSITION 10. E(S) and C(S) are orthomodular posets.
Proof. We must verify the axioms (OMP1) - (OMP4) of Definition 7. S and (0) are in C(S) and E(S). If A & B are subspaces of S, then A1s BLs. Since C(S) & E(S) & F(S), A'-"Is = A for any subspace A in E(S) or C(S). Axiom (OMP3) follows immediately from Proposition 9. It remains to show that C(S) and E(S) satisfy (OMP4). Starting with E(S), let A G B be two splitting subspaces in S. We must prove that the infimum B AE ALs and the supremum A V E ( B AE A1s) exist and, moreover, we have the equality B = A V E ( B AE ALs). Since A 5 B , by Proposition 9 we have A @ BLs E E(S) and therefore,
>
David Buhagiar, Emmanuel Chetcuti and Anatolij DvureEenskij
82
(A @ B ~ = ALs ~ nB )E E(S). ~ Thus ~ B AE ALs exists. Since B AE ALs G ALs , we have A@( B AE ALs) E E(S) and therefore, AVE ( B AE ALs) exists. Si~llilarly one can show that if A c B are in C(S), then AVc ( B Ac A'-") exists and is equal to A @ ( B n ALs). Finally we verify that B = A @ ( B n ALs). Since A B, we have B = B n (A@A1s) G ( ~ A)n@ (B n ALs) = A @ ( ~ rALs). l The converse inclusion is trivial. H Let us now show that (Eq(S),C, {0), S,I)need not be an orthomodular poset, in fact we have the following result. THEOREM 11. Eq(S) is orthomodular iJ and only if, E(S) = Eq(S). Proof. Let S be an inner product space. If E(S) = Eq(S) then Eq(S) is orthomodular since E(S) is always orthomodular by Proposition 10. Now suppose that Eq(S) is orthomodular and let M E Eq(S) \ E(S) for a contradiction. Then there exists a vector x E S which is not in M @ MIS. By Proposition 6, M [XI E Eq(S) and by hypothesis we have
+
+ [XI = M V ((M + [x]) A M I S ) . Since M + [XI # M , we cannot have ((M + [XI)r\ M I S ) = (0) and hence, there exists 0 # y E ( M + [XI)n MLs. Therefore, y = a x + m E MLs for some m E M . M
This implies that x E M @ MIS unless a = 0. The two implications lead to a contradiction and thus E(S) = Eq(S). H
c,
c,
We next show that (F(S), {0), S,V, A) and (W(S), {0), S,V, A) are complete lattices with smallest element (0) and largest element S. F(S) is also an ortholattice with respect to Ibut in general W(S) is not orthocomplemented. We will also see later that in general both families need not be orthomodular. PROPOSITION 12. W(S) and F(S) are complete lattices, where for the meet we = AF and i s given by have A =
Aw
while for the join we have
V M, = span (U M,) iEI
v
iEI
in w(S),
iEI
Mi = (span
(2
Mi))
lsls
in F(s).
Algebraic and Measure-theoretic properties
...
83
Proof. It is not difficult to show that W(S) is a lattice with the meet and join defined above. Now let {Mi I i E I) F(S). First we show that (niEI M i ) l s l s = Mi. For any j E I, (niEI Mi)ls MjLs, and therefore
c
niEI
>
Mj ,
for all j E I
iEI
Consequently
and hence
niEI
niEI
Mi E F(S) and therefore AiEI Mi = Mi. Thus Now (span(UiEI M i ) ) l s l s E F(S) and surely it is an upperbound of the collection {Mi I i E I). Let A E F ( S ) be such that A _> Mi for all i E I . Then
so that A=
2 span (U Mi)
lsls
.
iEI
Hence
Vie, Mi = (span(UiEIMi))lSLS.
rn
Although as already mentioned above, the structure on E(S) and C(S) need not be a (complete) lattice, the following propositions show that the infima and suprema in E(S) (respectively, in C(S)) are the same as in F ( S ) provided that these exist in E(S) (respectively, in C(S)). PROPOSITION 13. Let {Ai I i E I) C E(S). The following statements hold:
AiEIAi If ViEI Ai
(1) If
(2)
AiEI Ai = niEIAi. exists i n E(S), then ViEI Ai = (span(UiEI Ai))lSLS. exists i n E(S), then
Proof.
niEI
(1) Let C = AiEI Ai. Then C C_ Ai. If there is a vector v E S which belongs to (niEI Ai) \ C, then C + [v] E E(S) by Proposition 6. Since C [v] Ai for all i E I , we have that C # AiEI Ai which is a contradiction.
+ c
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
84
Then by De Morgan's laws, (2) Suppose that ViEIAi exists in E(S). AiEI A": exists in E(S) and moreover we have
=
niEIA":
and therefore
where for the last equality merely note that
njEIA":
=
By the first part, we have that
AiEIA":
(span(UiEI Ai))ls
PROPOSITION 14. Let {Ai I i E I) 5 C(S). The following statements hold:
AiEI Ai exists i n C(S), then AiEI Ai = niEIAi. ~f Vier Ai exists i n C(S), then Vier Ai = (span(UiErA ~ ) ) ~ s ~ s .
(1) If (2)
rn
Proof. The proof is analogous to the proof of Proposition 13.
How much does the algebraic structure of the above classes tell us about the inner product space S itself? Despite the fact that not every inner product space possesses an orthonormal basis (see [Gudder, 1975]), it is still possible (and useful) to define the orthogonal dimension of an inner product space as the cardinality of any maximal orthonormal system in S. However, in contrast to Hilbert spaces, this orthogonal dimension reveals very little information about the properties of the space itself. We recall the well-known fact that two Hilbert spaces are isomorphic if, and only if, they have the same orthogonal dimension. This is not the case with incomplete inner product spaces. Unless we assume completeness, isomorphism between two inner product spaces can only be proved by exhibiting a bijective unitary transformation between the two spaces. Let us recall that P(S1) is said to be isomorphic to P(S2) when there exists a bijective mapping : P(S1) t P(S2) such that:
+
(11) $(AL%) = (~,b(A))-'-~z, for all A E P(S1); (111) +(A v B) = +(A) v +(B), whenever A, B E P(S1) and A 5 ~ (IV)
+-l
satisfies (I), (11) and (111).
~
~
1
;
Algebraic and Measure-thwretic properties
.. .
85
In [ ~ u h a ~ iand a r Chetcuti, 20041 the following question was analyzed: Suppose that we are given two separable inner product spaces S1 and S2over W, such that P(S1) is algebraically equivalent to P(S2) as modular lattices. What can be said about S1 and S2? Using Gleason theorem, it was proved that in this case, S1 and S2are unitarily equivalent. This result was then extended by S. Pulmannovii [~ulmannovii,to appear] to non-separable inner product spaces over the complex field C or the division ring of quaternions W. The proof is based on results in projective geometry. One can look at this as a generalization of the classical Wigner's theorem [Wigner, 19591. THEOREM 15. Let S1 and S2be two inner product spaces over K,where K = W, cC or W. Then the following statements are equivalent: (1) S1 is isomorphic to S2 (as inner product spaces); (2) P(S1) is isomorphic to P(S2) (as modular lattices); (3) C(S1) is isomorphic to C(S2) (as orthomodular posets); (4) E(S1) is isomorphic to E(S2) (as orthomodular posets);
(5) Eq(S1) is isomorphic to Eq(S2) (as orthocomplemented posets); (6) F(Sl) is isomorphic to F(S2) (as complete lattices).
4 ALGEBRAIC COMPLETENESS CRITERIA OF INNER PRODUCT SPACES In this section we characterize complete inner product spaces by the algebraic structures of C(S), E(S), Eq(S), F(S) and W (S). In Subsection 4.1 we develop a completeness criterion which is a modification, given by Ptiik and Weber [Ptiik and Weber, 19771 of the original Amerniya-Araki theorem [Amemiya and Araki, 1966671. In Subsection 4.2, we consider the subsequent and successive strengthening of H. Gross and H. Keller's result that S is complete if, and only if, E(S) is a s Keller, 19771. The lattice properties of E(S) and complete lattice [ ~ r o s and C(S) are also investigated in Subsection 4.2 with respect to the completeness of S [Ptiik and Weber, 20011. In Subsection 4.3 we investigate the lattice properties of Eq(S) and also prove that for an inner product space S with d i m y / ~< CCJ we have Eq(S) = E(S) if, and only if, S is complete [Buhagiar and Chetcuti, to appear]. In Subsection 4.4, we define a modular/dual-modular pair in a lattice L and show that an inner product space S is complete if, and only if, in the lattice W(S) of closed subspaces of S, modularity and dual-modularity are equivalent [Holland, 19691.
86
1
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
The Amemiya-Aralci Theorem.
Inspired by a paper of Piron iron, 19641, Amemiya and Araki proved that if F(S) is orthomodular, then S is complete [Amemiya and Araki, 1966-671. This result initiated further research on the interplay between the algebraic and metric structure of inner product spaces. By introducing the notion of a weakly atomic orthomodular lattice, Ptkk and Weber arrived to the same conclusion of and Wethe Amemiya-Araki Theorem with a somewhat milder assumption [ ~ t & ber, 19771. DEFINITION 16. Let L be a poset. An element a E L is said to be an atom if the inequality b 5 a for b E L implies either b = 0 or b = a. A lattice L is called atomic if for every c E L, c # 0, there exists an atom a E L such that a 5 c. DEFINITION 17. Let L = (L, V, A, I,0 , l ) be an atomic orthocomplemented lattice. L is said to be weakly atomic orthomodular if the following condition is satisfied: If a , b L~a n d a i s a n atom, t h e n a V b = ( ( a ~~ ) A ~ - ! - Lb. ) v Obviously, any orthomodular lattice is weakly atomic orthomodular. However the notion of being weakly atomic orthomodular is in general strictly weaker than the notion of being orthomodular even for finite atomic orthocomplemented lattices. It is proved in [ ~ t b kand Weber, 19771 that an inner product space is complete if, and only if, F(S) is weakly atomic orthomodular. Let us prove this result. PROPOSITION 18. A n inner product space S i s complete if, and only iJ for every x, y E 3 satisfying s l y there exists A E E(S) such that x E 2 and y E -. Proof. We show that the condition is sufficient for the completeness of S. Let x E S\ S be a unit vector. There exists h E S such that (h, a) = 1. Put y = x - h. Then y l x and therefore by hypothesis, there exists a subspace A E E(S) such that x E 2 and y E G.Thus
h = hl + h 2 , where hl E A and h2 E ALs; and
which implies that hl completes the proof.
=x
and h2 = -y, and therefore x E S. The contradiction
PROPOSITION 19. Let M be a complete subspace o f 3 such that dim M T h e n M n S i s dense in M .
<
~ F 00.
Proof. We first prove the result for dim M 1 = ~ 1; that is MI^ = [el, where llell = 1. We can find h E S such that llhll = 1 and I(h,e)l > 112. Let x be any element of M . For any E > 0 there exists y E S such that ))x- yll < €13. Since x E M, we have I(Y,~)I = I(Y-x,e)l < €13.
Algebraic and Measure-theoretic properties
...
Let u = y - u h . Since (u, e) = 0, we have u E S n M. Now (be)
To prove the result for the general finite dimensional case, we apply the process . that M n S is dense in M when of induction on the dimension of M ~ YSuppose dim MLy 5 n - 1. Consider the case when M'-T = span{el, e2, . . .,en). We have
Let N = M @ [el]. Then 3 = N @ span{e2, e3,. . . ,en) and by the induction hypothesis, N r l S = N. Since M is a complete subspace of N and codimension of M in N is one, we have (NnS)nM=M. Consequently, S n M
= M,
that is S n M is dense in M .
rn
20. Let {vl, v2, . . . ,v,) be a finite set of orthonormal vectors in S. Then there exist sequences {upi I i E N), p = l , 2 , . . . ,n, in S such that
PROPOSITION -
lim upi = up ; 2
(upi, vq) = 0 , for each i E N when p # q ; (upi, uqj) = 0 , for each i,j E N when p # q
Proof. Let Hll = span{v2, 213,. .. ,vn)lg. By Proposition 19, there exists a unit vector ull E HllnSsuch that IIv1-u1111 < 112. Set Hzl = span{u11, VI, v3,. . . , v n ) l r and hence, again by Proposition 19, we can find unit vector u21 E H21n S such that llv2 - 2121 11 < 112. Put H31 = span{ull, 211,1121,212, v4, . . . ,v , ) l ~ and let u3l E H31n S be a unit vector such that llv3 - ~ ~ < 112. ~ 1 After ) repeating this step for n times we obtain an orthonormal family {upl 1 1 5 p 5 n) such that llvp - up1II < 112 and ( ~ p lup) , = ( ~ p luql) , = 0 for P # 9 . We proceed by induction. Suppose that the finite sequences of unit vectors {up!, up2, . . . ,upk), 1 I pI n, have been constructed in S such that llvp - 'llpjll < 1/23 and (upi, uqj) = (upi,vq) = 0 for all 1 5 i, j 5 k when p # q. Let
and let u1 k + l be a unit vector chosen from HI k + l 19, such that llvl - u1 k+lll < 1 / 2 ~ + l .Next, put
n S, in virtue of Proposition
Since v2 E Hz k + l , there exists a unit vector u2 k + l E H2 k + l r l S such that 1 1 ~ 2u2 k+lll < 112"'. After repeating this for n times, we obtain the orthonormal
88
David Buhagiar,
Emmanuel Chetcuti and Anatolij Dvurehnskij
family {up k + l l 1 5 p 5 n ) in S such that (up k + l , tiqj) = (up k + l , vq) = 0 for all 1 5 j 5 k + 1 when p # q and llvp - zip k + l l l < 1/2~+'. Thus, the required sequences can be constructed by induction. PROPOSITION 21. Let {x, y} be an orthogonal pair in M E F(S) such that x E 3 and y E
m.
S.
Then there exists
Proof. By Proposition 20, there exist sequences {xi I i E N} and {yi I i E N} in S such that limi xi = X, limi yi = y and satisfy x i l y j , s l y i and y l x i for all i,j E N. Then M = {yi I i E M}" E F(S) satisfies
With these results in hand, it becomes trivial to show that: THEOREM 22. An inner product space S is complete if, and only if, F(S) = E(S). THEOREM 23. If F(S) is weakly atomic orthomodular, then F(S) = E(S). Proof. Supposing it is not the case, let M E F ( S ) \ E(S). Then there exists x E S \ (M @ M I S ) ; [XI is an atom in F(S). Since x 6 M , we have [XI A M = (0) in F(S). By hypothesis we have
(([x] V M) A MI") V M = [x] V M = [XI
+ M,
where for the last equality we simply refer to Proposition 6. Since [x]+M # M , we cannot have (([x]vM)AM'~) = {O}, and therefore there exists y E ( [ X ] V M ) A M ~ ~ and y # 0. We then have
and hence y = a x + m E M I " for some m E M. This implies x M @ M I s unless a = 0. The two conclusions lead to a contradiction and thus E(S) = F(S).
rn We end this subsection with the following corollary which will be used in the sequel. COROLLARY 24. An inner product space S is complete if, and only if, for any orthogonally closed subspace M of S and any maximal orthonormal system {xi I i E I} of M we have M = span{xi I i E I}'-sLs. Proof. We only need to show sufficiency. Let A C B be elements of F(S) and suppose that {ai I i E I} and {cj I j E J} are maximal orthonormal systems in and ALs n B = A and ALs n B, respectively. Then A = span{ai I i E I}'-"~"
Algebraic and Measuretheoretic properties
.. .
89
span{cj I j E J ) ~ " ~One " . can easily verify that {ai, cj I i E I, j E J) is a maximal orthonormal system in B and therefore,
=AV (ALs n B). This implies that F(S) is orthomodular and therefore S is complete by Theorem rn 23.
4.2 Splitting Subspaces Criterion and the Lattice Properties of C(S) and E (S) . Unless S is a Hilbert space, neither C(S) nor E(S) can be a complete lattice. Indeed, H. Gross and H. Keller [Gross and Keller, 19771 proved that S is complete if, and only if, E(S) is a complete lattice. This was subsequently and successively strengthened as follows: S is complete if, and only if, (A) E(S) is a a-lattice [Cattaneo and Marino, 19861; (B) E(S) is a a-orthomodular poset [Dvure~enskij,19881;
(C) E(S) is atomic weakly a-complete [ ~ t &and k Weber, 19771. Recall that a poset L is said to be atomic weakly a-complete if for any sequence {a,I n E N) of atoms in L there is an infinite subsequence {hi I i E N) of {a,( n E N) such that the supremum ViENa,, exists in L. Since the atoms of E(S) are the one dimensional subspaces of S, it follows that S is complete if, and only if, C(S) is atomic weakly a-complete. 20011 that S is complete In addition to the above, it was shown in [~vure~enskij, if, and only if, E(S) satisfies the a-Riesz interpolation property. Let us elaborate on this and give a proof to the said result. A poset (P, 5 ) is said to satisfy (i) the Riesz interpolation property (RIP) if, for every al, az, bl, b2 E P with % 5 b j for i, j = 1,2, there exists an element a E P such that % 5 a 5 bj for i,j = 1,2; (ii) the a-Riesz interpolation property (a-RIP) if, for all sequences {R I i E N), {bj I j E N) in P satisfying a.j 5 bj for all i,j E N, there exists an element a E P such that a+ 5 a 5 bj for all i,j E N. It is clear that if P is a lattice (a-lattice), then P satisfies (RIP) ((a-RIP)) . THEOREM 25. An inner product space S is complete if, and only if, E(S) satisfies (a-RIP). Proof. With the aim of using Proposition 18, let x, y E 3 satisfy x l y . By Proposition 20 there exist sequences {xi I i E N) and iyiI i E N) in S such that limi xi = x, liw yi = y and satisfy x i l y j , x l y i and y l x i for all i, j E N. for all i,j E N Let Xi = [xi] and % = [yj]Lsfor all i, j E M. Then Xi for all and therefore, by (a-RIP), there exists A E E(S) such that Xi C A
s
s
90
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureeenskij
i, j E N. Thus xi E A and yj E ALs and hence, x E then follows from Proposition 18.
3 and y E ALs. The result rn
It is further noted in [~vure~enskij, 20011 that the proof of Theorem 25 can be used to prove the following criterion. THEOREM 26. An inner product space S is complete i;f, and only .I;f, for every two sequences {x, I n E N) and {y, I n E N) of vectors in S such that [x,] [ym]Ls for all n , m E N, there exists M E E(S) satisfying [x,] C M C [ym]Ls for all n , m E N. This result was further strengthened in [ ~ t and ~ kWeber, 20041 by proving that an inner product space S is complete if, and only if, E(S) satisfies the atomistic subsequential interpolation property. One can recall that an orthomodular poset P has the atomistic subsequential interpolation property if for any two sequences of atoms in P, {a,I n E N) and {b, I n E N), such that a, 5 bkp for all m, n E N, there exist infinite subsequences {a,, ( k E N) and {b,, I k E N) such that one can find an element a E P satisfying a,, 5 a 5 b k for each k E N. A natural question arising from the above results is whether E(S) can be a k Weber, 20011, lattice for S incomplete. This question was answered in [ ~ t h and by a careful analysis of the lattice properties of E(S) and C(S). An inner product space S was constructed such that S is a hyperplane of and E(S) = P(S), and thus E(S) (= C(S)) is a modular lattice. However, in [Gross and Keller, 19771, it was shown that for any inner product space having a countable (infinite) linear dimension, E(S) is not a lattice. Thus, the lattice properties of E(S) do not seem to have an explicit bearing on the metric completeness of S. Let us elaborate on this. We begin by showing that for any inner product space S possessing a countable linear basis, the orthomodular poset E(S) is not a lattice. Moreover, for such an inner product space, C(S) consists of all finite and cofinite dimensional subspaces of S and therefore C(S) is a modular lattice.
+
PROPOSITION 27. Let S = [f] lf C 12,where f = CiEN (see examples in Section 2). Then E(S) is not a lattice whereas C(S) consists of all finite and cofinite dimensional subspaces of S and therefore C(S) is a modular lattice.
Proof. Let Fl = span{e2, es, es, . . . ) and Fz = span{el, es, es, . . . ). It can be easily seen that Fl @ F2= lf and that F ": = F2and F$" = Fl. The rest can be established in a series of statements. CLAIM 28.
F2
+ [f]$ E(S).
CLAIM 29. Let
+ 2)e2,+2 1 n E N, n is odd) + 2)ezn + (2n)e2,+2 I n E N, n is odd).
A =span{(2n)ezn - (2n
B =span{(2n Then
Algebraic and Measure-theoretic properties
...
(i) f E ALs , (ii) A C BLs and moreover, A 63 B = Fl, (iii) A 63 ([f]
+ B + Fz) = S.
CLAIM 30. Let
C = span((2n + 2)e2,+2 - (2n + 4)e2,+4 I n E N,n is odd) D =[ez]
+ span((2n + 4)e2,+2 + (2n + 2)e2,+4
I n E N,n is odd).
Then again (i) f E CIS, (ii) C C DI" and moreover C 63 D = Fl, (iii) C63 ( [ f
+ D + Fz) = S.
CLAIM 31. B n D
=
(0).
CLAIM 32. Let K KnL=F2+[f].
=
[f] D
+ + F 2 and L = [f]+ B + Fz. Then K , L E E(S) and
Let us give a proof to this statement. Suppose that z E K n L. Then z = d x = b y, where x, y E F2 [f]. Then d - b = y - x E F2 [f]. From the definition of B, D and F2we immediately see that d - b = 0 and therefore b = d. Since B n D = (0) we have d = b = 0 and hence z E F2 [f]. Surely we have that F2 [f] K n L and therefore K n L = F2 [f]. In the light of Claim 1 above and Proposition 13 we conclude that K A L does not exist in E(S) and therefore E(S) is not a lattice. And finally,
+
+
+
+
+
+
+
CLAIM 33. C(S) consists of all finite and cofinite dimensional subspaces of S . In view of the fact that the linear dimension of a Hilbert space is either finite or uncountably infinite, the complete subspaces of S must be finite dimensional and hence C(S) consists of all the finite and cofinite dimensional subspaces of S . H Since any two inner product spaces Sl and S2with a countable linear dimension are isomorphic (as inner product spaces), and therefore E(S1) and E(S2) are isomorphic as orthomodular posets, it follows that E(S) is not a lattice for any inner product space S with a countable linear dimension. Moreover, C(S) consists of all finite dimensional and cofinite dimensional subspaces of S and therefore C(S) is a modular lattice. We next show that E(S) = C(S) for any linear hyperplane S in 3. PROPOSITION 34. If S is an inner product space which is a linear hyperplane in 3,then E (S) = C(S).
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvurehnskij
92
Proof. Let A E E(S) \ C(S). We show that if such a subspace exists, then d i m ( z / ~ )2 2. We haveS = A @ ALs, where neither A nor ALs is complete. Let a E 2 \ A and a' E ALs \ ALs. We show that {a + S,a' + S) is a linearly independent set in 3 1 s . Indeed, if cr(a+S)+p(af+S) = S, then aa+pa1 = s E S. This implies that a a + pa' = sl + s2 where 31 E A and s 2 E ALs, and therefore rn we have a a = sl and pa' = s z which is a contradiction unless a = P = 0. It is shown in [ ~ t i and k Weber, 20011 that for an infinite dimensional Hilbert space there is a dense hyperplane S in H such that E(S) (= C(S)) is not a lattice. On the other hand, in the same paper the authors show that in any separable Hilbert space H there is a dense linear hyperplane S such that E(S) is a modular lattice. We shall need the following lemma. LEMMA 35. Let H be a separable Hilbert space. Then (1) Card(H) = 2"0 . (2) Card{{vi)
I sequence in H ) = 2"o .
(3) Card{A
HI A is a complete infinite dimensional subspace of H )
= 2"o
.
THEOREM 36. Let H be a separable Hilbert space. Then H possesses a dense hyperplane S such that E(S) consists of finite or cofinite dimensional subspaces of S. Thus, E(S) is a modular lattice.
Proof. By Lemma 35 we know that the collection
IU = {A
H I A is a complete infinite dimensional subspace of H),
has cardinality 2"o. By the well-ordering principle, we can well-order the family IU. Let w be the initial ordinal number of cardinality 2"o. Then IU = { A , I a < w). We will construct a linearly independent family of vectors in H, {v, I a < w), such that for each a < w we have v, E A,. We proceed by transfinite induction. Let vl E A1 be an arbitrary non-zero vector. Suppose that the collection {up I P < a) has been constructed. Since the linear dimension of A, is 2"0 and since Card{@I P < a) < 2"0, there must be a vector v, E A, such that the family {up I P 5 a) is linearly independent. Thus we can construct the family V = {up I P < w) of linearly independent vectors of H with up E Ap. Extend this to a Hamel basis U for H. We can well-order the unbounded interval [I,co) in R to get {pa I a < w). Then define the linear map f on H into R by f (v,) = p, for all v, E V and f (u) = 0 for all u E U \ V. Then f is an unbounded linear functional on H and S = N(f) is a dense hyperplane in H. By construction, S does not contain a complete subspace of infinite dimension. rn
4.3 Quasi-Splitting Subspaces Criterion and the Lattice Properties of E4 (S)' The family Eq(S) was introduced and investigated in [Buhagiar and Chetcuti, to appear] as an intermediate between E(S) and F(S). We recall that whereas F(S)
Algebraic and Measure-theoretic properties ...
93
is always amply endowed with Boolean a-subalgebras, E(S) need not contain any Boolean a-subalgebra at all. The members of Eq(S) should behave somewhat similar to the splitting subspaces, however Eq(S) (at least when S is assumed to be separable) is always furnished with a "good supply" of Boolean a-subalgebras. Indeed, by the Gram-Schmidt orthonormalization procedure, we can convert any countable dense subset of S into an orthonormal basis {xi I i E N). Clearly, the image of the map
I' : ( I E 2")
t ,
( S n span{xi I i E I) E Eq(S))
is a Boolean a-subalgebra of Eq(S). Let us begin by giving a characterization of Eq(S) for an inner product space S.
37. Let Ml and Nl be orthogonal subspaces of 3 satisfying M1 @ PROPOSITION Nl = S. If Mo and No are subspaces of S such that Mo G MI and No 2 Nl, then Mo @ N o i s dense in S .if, and only if, Mo and No are dense in Ml and Nl, respectively. Consequently, for any closed subspace M of S , M E Eq(S) if, and only if, -Ig M I S = M (= ~ ~ 3 ) . Proof. Suppose that Mo @Nois dense in S and let us assume (for contradiction) that Mo is not dense in MI. Then we can find a nonzero vector z E M1 such that (z, x) = 0 for all x E Mo. Since z E MI, and M I I N l , we have that z is orthogonal with any vector in Mo @No,which implies that z E SIT= (0). The case when No is not dense in Nl is exactly the same and the converse is trivial. is dense in S if and only if MI" is So, for any subspace M of S, M @ MI" -IF and thus a closed subspace M of S is a quasi-splitting subspace if dense in M - -17 and only if MLs = M . rn Observe that the two inner product spaces considered in Examples 2 and 3 both have a countable linear dimension. Since, as already mentioned above, any two such inner product spaces are isomorphic (as inner product spaces), we have that E(So) g Eq(So) F(So) for any inner product space So with a countable linear dimension. We have already shown in Theorem 11that Eq(S) is orthomodular if, and only if, it is equal to E(S). Let us now investigate the lattice properties of Eq(S). It turns out that the lattice structure of Eq(S)is strongly dependent on the particular choice of the inner product space itself; Eq(S) can sometimes be a complete lattice (without S being complete) and yet, in other examples Eq(S) is not a lattice. This is in contrast with both E(S) and F(S). THEOREM 38. If S be a dense hyperplane of a Hilbert space H , then Eq(S) = F ( S ) and hence, Eq(S) i s a complete lattice.
Proof. Suppose that Eq(S) F(S) and let M E F ( S ) be an orthogonally closed subspace which is not quasi-splitting in S. Thus, there exists 0 # x E H such
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
94
that x l M and XIMI". Since M is not in Eq(S) then both M and MI"are \ M . Observe that (x, y) = 0. Since S is a hyperplane of incomplete. Let y E H, there exist nonzero scalars a and ,B such that a x ,By E S. Then a x ,By E MI"'-" = M and therefore a x = (ax + py) - ,By E M.This contradicts the fact that x l M . Hence, Eq(S) = F(S).
+
+
In Proposition 34 it is shown that if S is an inner product space which is a linear hyperplane in 3,then E(S) = C(S). Thus, in this case Eq(S) is much larger than E(S). However, as shown in [~uhagiarand Chetcuti, to appear], Eq(S) need not be a lattice. In fact we have the following result. THEOREM 39. I f S has a countable linear dimension, then Eq(S) i s n o t a lattice. So the size of Eq(S) fluctuates drastically; can Eq(S) ever coincide with E(S) for an incomplete inner product space? The authors of [Buhagiar and Chetcuti, to appear] cite the following problem. PROBLEM 40. If Eq(S) = E(S), does it follows that S is complete? We end this subsection with a partial result to this problem. THEOREM 41. Let S be a n inner product space such that d i m s / ~< co. T h e n Eq(S) = E(S) if, and only if, S i s complete. Proof. Let {yo, yl, . . . ,ynPl) be orthonormal vectors in 3\ S such that
Let K = span{yl, yz, . . . ,Y,-~}. Since K I T n S is dense in KIT (by Proposition , exists h E K L n~S such that (h, yo) # 0. Let x = yo 19) and yo E K ~ Fthere h Then x E span{yo, yl, . . . ,y , - ~ ) ~ aand yo - x = h,vo By Proposition 20 we can construct sequences {xi I i E N) and {yki I i E N) (where k = 0,1, . . . ,n- 1) in S such that limi xi = x, limi yki = yk for each k = 0,1, . . . ,n - 1 and (xi,ykj) = ( ~ k i~, k ' j )= 0 for each i,j E N and k # kt. Let us show that M = {xi I i E N ) I "is ~aSquasi-splitting subspace of S. Suppose that this is not the case, i.e. M $ Eq(S). Now yk E MLs and yki E MIS for each k = 0,1,. . . ,n - 1 and i E N. There exists a unit vector z E 3 such that and z E =lS. Since d i m S / ~= n we can find scalars a,h,. . . ,,Bn-1 such that a # 0 and w = a z + ,Boyo+ . + ,Bn-lyn-l is in S. Then w E MI" and since yk E MLs for each k, we get z E MLs which contradicts the fact that z E *l". Now suppose that M is a splitting subspace of S. Then h = hl + hz where and yo E hl E M and hz E M I s . But h = (h, yo)yo- (h, yo)x where x E which implies that hl = -(h, yo)%and hz = (h, yo)yo which is a contradiction rn since x, yo $ S .
h.
m.
-
m,
COROLLARY 42. Let S be a n inner product space such that dirn;T/S = n < co. T h e n Eq(S) is orthomodular if, and only if, S i s complete.
Algebraic and Measure-theoretic properties . ..
95
4.4 Closed Subspaces Criterion. It has already been shown that for an inner product space S, the family W(S) of closed subspaces of S, forms a complete lattice when ordered by set inclusion. Moreover, we have already seen that
V Mi
=span(u
Mi)
and
/\ Mi = nMi
for any family {Mi I i E I}C W(S). The completeness criterion of S determined by W(S) is dictated by the modularity property of the lattice [Holland, 19691. Let us start by showing that unlike the other families, W(S) is not complemented in general. PROPOSITION 43. An inner product space S is complete if, and only if, W(S) is complemented. Proof. If S is a Hilbert space, then every M E W(S) satisfies M @ M I s = S and thus I is a complementation on W(S). For the converse, suppose that S is not complete. Let x E 3 \ S and M = [ x ] l n~ S E W(S). By Proposition 19 we have M = [xlL3. Thus M I S = (0) and M V M'-s = M # S. Following the work of S. Holland [1969], we inquire modular and dual-modular pairs in W(S). We recall that the pair (a, 6) where a and b are elements of some lattice L is a modular pair (expressed as (a, b)M in L) when (cVa) A b = c V (aA 6) for all c 5 6. We say that (a, b) is a dual-modular pair (and write (a, b)M* in L) when
(c A a) V b = c A (a V 6) for all c 2 6. The dual-modular pairs of W(S) can be characterized as follows. The proof of Proposition 44 relies on the fact that for any closed subspace M of S and any vector x of S, M [XI is also closed in S (Proposition 6).
+
PROPOSITION 44. Let M and N be two closed subspaces of an inner product space S. Then (M, N)M* in W(S) if, and only if, M N is closed in S.
+
To characterize the modular pairs of W(S) we need to introduce the notion of completely disjoint subspaces. Two subspaces M and N of W(S) are said to be completely disjoint if there exists a > 0 such that for all x E M , IIxII = 1 and y E N we have Ilx - yll 2 a. LEMMA 45. Let S be an inner product space and let M, N be closed subspaces of S. The following conditions are equivalent:
(1) M and N are completely disjoint;
96
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
(2) There exists a
> 0 such that Ilxll + llyll 5 a11x + yll for
all x E M, y E N;
(3) M n N = (0) and the (well-defined) linear operators P(X+Y) = x, T(x+y) = y are both bounded o n the subspace M N .
+
PROPOSITION 46. If the closed subspaces M , N of a Hilbert space H satisfy M n N = (0) then M and N are completely disjoint if, and only .if, M N is closed.
+
Proof. Suppose that M and N are completely disjoint. Then there exists a such that for all x E M, y E N , we have
Let (xi
>0
+ yi) be a Cauchy sequence in M + N. Then
which implies that {xi) and {yi) are Cauchy sequences in M and N respectively. Therefore, there exist x E M and y E N such that limi xi = x and l i w yi = y. For the converse, suppose that M N is complete. Then the operators P and T defined by P ( x + y ) = x and T(x + y) = y are closed operators and therefore, by the Closed Graph Theorem, are bounded.
+
Note that the proof of Proposition 46 relies very strongly on the assumption that H is a Hilbert space. In fact, as we will see later on, the statement proved above holds only for complete inner product spaces. In the following proposition modularity is characterized in terms of complete disjointness. PROPOSITION 47. Let M and N be closed subspaces of a n inner product space S such that M n N = (0). Then (M, N ) M in W(S) if) and only if, M and N are completely disjoint subspaces of S. As a consequence of Propositions 44, 46 and 47 we have that when M , N are closed subspaces of a Hilbert space such that M n N = (0) then the pair (M, N ) is modular if, and only if, it is dual-modular. Using the orthomodular property of the projection logic of a Hilbert space it is possible to do without the assumption that M n N = (0) and hence deduce the following result. COROLLARY 48. Let M and N be closed subspaces of a Hilbert space H . T h e n (M, N ) M if, and only if, (M, N)Mf in the lattice of closed subspaces of H . In general, modularity and dual-modularity in the lattice W(S) are not equivalent. In fact, the main result of this subsection states that modularity is equivalent to dual-modularity in W(S) if, and only if, S is a Hilbert space. We shall prove the following lemma before stating the main result. LEMMA 49. An inner product space S is complete zf, and only if, M @ N is a closed subspace of S for any M, N E W ( S )such that M C N'-".
Algebraic and Measure-theoretic properties
...
97
Proof. We only need to show that the condition is sufficient for the completeness of S. Let x be a unit vector in S\ S. There exists h E S such that ( h , x ) = 1. Put y = x - h. Note that y E 3 \ S and (y,x ) = 0. By Proposition 20 there exist sequences {xi I i E N) and {yi I i E N) in S such that limi xi = x, limi yi = y and satisfy x i I y j , x i l y and y i l x for all i,j E M. Let M = s p a n s i n and N = M I s . Each of the vectors zi = xi - yi is in M @ N and limi zi = x - y = h E S. By hypothesis M @ N is closed in W ( S ) and therefore h E M @ N , i.e. h = m n where m E M and n E N. But h = x y, where x E M and y E Then x - m = - ( y - n ) , which implies that x = m and y = n and therefore x E S which is the required contradiction.
+
x.
+
THEOREM 50. An inner product space S is complete if, and only if, every modular pair is dual modular in W ( S ) .
Proof. Let M and N be any two orthogonal subspaces of W ( S ) . It is easy to check that M and N are completely disjoint. By Proposition 47 it follows that ( M ,N)M in W ( S )and hence (by hypothesis) ( M ,N)M* in W ( S ) .By Proposition 44 it follows that M @ N E W ( S ) .Result then follows from Lemma 49. 5 MEASURES ON P ( S ) , C ( S ) ,E ( S ) ,E,(S), F ( S ) AND W ( S ) If S is an incomplete inner product space, then the structure of closed subspaces resolves itself into different substructures. The aim of the rest of this survey is to study the measure-theoretic properties of these structures. A charge on any of the respective families introduced in Section 1is an additive real-valued function. Formally, if we let L be any of P ( S ) ,C ( S ) ,E ( S ) ,Eq(S)or F ( S ) ,a charge m on C is a map m : L + R, such that
m(AV B ) = m ( A )+ m ( B ) , whenever A, B E C and A I B .
(1)
We denote by Q(L)the topological linear space of all charges on C endowed with the topology of pointwise convergence on the elements of L. A charge m is said to be:
completely-additive, if equation (1) holds for any collection {Ai I i E I ) of pairwise orthogonal subspaces in C such that the supremum VierAi exists in L. Let R,,(C) be the subspace of all completely-additive charges on L. a-additive, if equation (1) holds for any sequence {Ai I i E N) of pairwise orthogonal subspaces in C such that the supremum Vie, Ai exists in C. Let Q,(C) be the subspace of all o-additive charges on C.
> 0 such that Im(A)I 5 k for each A in C; regular, if for every A in C and every E > 0 there exists a finite dimensional subspace M , contained in A, such that Im(A) - m(M)I 5 E . Let Q,(L) be bounded, if there exists k
the subspace of all regular charges on L.
David Buhagiar, Emmanuel Chetcuti and Anatolij DvureEenskij
free or singular, if m(A) is zero for every finite dimensional subspace A in L. Let !2,(C) be the subspace of all free charges on L. A measure is a positive charge on C and a state s on L is a normalized (i.e. s(S) = 1) positive charge. The set of all states on C, denoted by S(C), is a convex subset of the cube [O,1IL. When endowed with the product topology, [O, 11' is a compact space, and since S(L) is closed in [O, I]', it follows that the state space of any of the respective families described above is a compact, convex topological space. 6 GLEASON AND DOROFEEV-SHERSTNEV THEOREMS The entire theory discussed in this section depends heavily on the classical result of A. M. Gleason leason on, 19571. By solving the problem that was originally posed ~ , A. M. Gleason did not only succeed in describing by G. Mackey [ ~ a c k e19631, all the a-additive states on L(H), where H is a separable Hilbert space - he has also revealed the very delicate interplay that exists between the measuretheoretic properties of L(H) and the geometric structure of H. Gleason Theorem for bounded a-additive charges was independently proved by A. N. Sherstnev [~herstnev,19741 and A. DvureEenskij [A. DvureEenskij, 19781, and extended for bounded completely-additive charges on non-separable Hilbert spaces by M. Eilers and E. Horst [1975], T. Drisch (19791 and S. Maeda [1980] (see also [~vure~enskij, 19921). THEOREM 51 (Gleason Theorem). Let H be a Hilbert space of dimension greater than 2. For any bounded completely-additive charge m on L(H) there exists a unique bounded self-adjoint operator T on H of trace class such that
REMARK 52. Observe that in the formulation of Gleason Theorem, we can r e place 'completely-additive' with 'a-additive' if, and only if, the dimension of H is 19861). a non-measurable2 cardinal (see [~vure~enskij, Observe that Gleason Theorem shows that every bounded completely-additive charge on L(H) can be extended to a (normal) linear functional on the algebra of bounded operators on H, here denoted by B(H). We recall that B(H) is the dual space of the Banach algebra consisting of all the trace class operators endowed with the trace-norm. This duality is determined by (T, A) = tr TA, where T is a trace class operator and A E B(H). That is to say, Gleason Theorem is in fact a theorem of non-commutative integration. It can be said that Gleason 2We recall that a cardinal a is said to be non-measurable if for any set X with cardinality a, there is no 0-additive probability measure on 2 X which vanishes identically on each singleton of X. For example, No and 2 N are ~ non-measurable cardinals.
Algebraic and Measuretheoretic properties
...
99
Theorem is one of the most far-reaching mathematical results of the 20th Century. Apart from the extensive impact on the mathematical foundations of quantum mechanics, Gleason Theorem provides a solid ground for non-commutative integration theory. The basis of the proof of Gleason Theorem lies in the treatment of the real three-dimensional Hilbert space. The original proof is rather complex. Many mathematicians and physicists tried to simplify the original proof of Gleason Theorem and to extend it to more general lattices and measures (for example, measures taking values in a Banach space). For a complete documentation and citation we refer the reader to the monographs [Dvure~enskij,19921 and [Hamhalter, 20031 that treat Gleason Theorem in full detail. The most elementary proof of this Theorem is due to R. Cooke, M. Keane and W. Moran [Cooke et al., 19851, which was first presented in 1984 at a conference in Cologne, Germany. It is worth noting that if we eliminate the assumption of completeadditivity (or a-additivity when H is separable), the technique developed by A. M. Gleason cannot be used. That is why Gleason Theorem for charges on the projection lattice of a Hilbert space has been established much later by E. Christensen [christensen, 19821 for positive charges and by L. J. Bunce and J. D. M. Wright [Bunce and Wright, 19941 for the general case. (For basic definitions and terminology regarding von Neumann algebras we refer to [ ~ a d i i o nand Ringrose, 1983; Sokr, 19791 whereas for a complete treatment of the Generalized Gleason Theorem we refer to [Hamhalter, 20031.) THEOREM 53 (Generalized Gleason Theorem). Let M be a von Neumann algebra with no direct summand of Type 12. Then each bounded charge on P ( M ) extends to a bounded linear functional on M. One of the main and widely used consequences of Gleason Theorem can be easily exhibited here. DEFINITION 54. Let S(H) be the unit sphere of a Hilbert space H . A function f : S(H) + [O, 11 is called a frame-function on H if (1) f(Xx) = f (x) for all x E S ( H ) and X E D,(2) there is a constant W(f) such that
for any orthonormal basis {xi I i E I) of H. It is clear that the completely-additive charges on L(H) are in one-to-one correspondence with the frame-functions on H and therefore, in view of Gleason Theorem, for every frame function f on S(H), there exists a unique bounded trace class operator T on H, such that f (u) = (Tu, u), for all u E S(H). This means that
100
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvuretenskij
which implies that f is uniformly continuous on S(H). As an immediate conse quence, observe that L(H) (dim H 3) does not admit any two-valued states. (This is related to the dispute on hidden variables in quantum theory [ ~ o c h e n and Specker, 19671.) We remark that Gleason Theorem does not hold for the case when H is two-dimensional - it is straightforward to check that L(R2) admits plenty of two-valued states. The Hahn-Jordon Decomposition Theorem is mathematical folklore in classical measure theory [Halmos, 1988, Section 291. Consequently, every completelyadditive (finite) measure on a sigma-field C is bounded. This is not the case if we replace C by the lattice of projections of a finite dimensional Hilbert space H. (See [Dvure~enskij,1992, Proposition 3.2.41.) However, S.V. Dorofeev and A. N. Sherstnev proved the deep and surprising result that if the Hilbert space is infinite dimensional then every completely-additive charge on L(H) is bounded [~orofeevand Sherstnev, 19901. We shall need the following notion.
>
+
DEFINITION 55. Let S be an inner product space. A mapping f : S(S) -+ R is said to be a frame-type function on S if: (1) for any orthonormal system {xi I i E I}in S, the series CiEI f (xi) converges; (2) for any finite dimensional subspace K of S, f 1 B(K) is a frame function on K. A frame-type function f on S is bounded if 1f (u)I 5 k for some k > 0 for all u E B(S). We can now present the remarkable result of S. V. Dorofeev and A. N. Sherstnev. THEOREM 56 (Dorofeef-Sherstnev). Any frame-type function on an infinite dimensional inner product space S is bounded. Clearly a frame function on a Hilbert space H is a frametype function. From Theorem 56 it follows that any completely additive charge m on L(H) (where dim H = co)is bounded on the atoms. By restricting m to L(N), where N is a three-dimensional subspace of H, we get a bounded charge m 1 L(N) on L(N). By Gleason Theorem, there exists a bounded symmetric bilinear form t~ on N x N such that m([x]) = tN(x, x) holds for all x E B(N) . Since every symmetric bilinear form is uniquely determined by its quadratic form, we can define a bilinear form t on H x H as follows: for any x, y E H , let N be any threedimensional subspace containing x and y, then put t(x, y) = tN(x,y). It is clear that t(x,x) = m([x]) for all x E S(H). Since m is bounded on the atoms, t is also bounded and therefore there exists a unique bounded self-adjoint operator T on H such that m([x]) = (Tx, x) for all x E B(H). The complete additivity of m entails that T is a trace class operator and m(M) = tr TPM for any M E L(H). Since T can be decomposed as the difference of two positive trace class operators, it follows that m can be expressed as the difference of two positive charges and thereby m is bounded.
Algebraic and Measure-theoretic properties ...
101
COROLLARY 57. Let H be a n infinite dimensional Hilbert space. Every completelyadditive charge o n L(H) i s bounded. In view of Corollary 57, the requirement of boundedness in the formulation of Gleason Theorem becomes superfluous for infinite dimensional Hilbert spaces. THEOREM 58. (Gleason-Dorofeev-Sherstnev) Let H be a n infinite dimensional Hilbert space and let m be a completely-additive charge o n L(H). T h e n there exists a unique bounded self-adjoint operator T o n H of trace class such that
7 IS EVERY REGULAR CHARGE ON L(H) COMPLETELY-ADDITIVE? We now investigate the relation between R,,(L(H)) and n,(L(H)). Of course, n,,(L(H)) S2,(L(H)) and if H is finite dimensional, then S2(L(H)) = O,,(L(H)) = S2,(L(H)). This is not the case when dim H is infinite. To exhibit a regular charge on L(H) which is not completely-additive we make use of the following theorem. (For the proof the reader can refer to [Chetcuti and DvureEenskij, 2003a, Theorem 3.81 and [ ~ h e t c u tand i DvureEenskij, 2004b, Theorem 3.11.) THEOREM 59. Let H be a n infinite dimensional Hilbert space. ( 1 ) Let m be a bounded charge o n L(H). Denote by X and p the infimum, and supremum of {m(A) I A E L(H)}, respectively. Then, Range(m) i s a convex set containing (A, p) .
(2) L e t s be a regular state o n L(H). For every infinite dimensional closed subspace A of H , w e have [O, 4 4 ) ) C {s(M) I M C A, dim M
< m ) C [O, s(A)].
REMARK 60. (1) Observe that in particular, if s is a state on L(H) and dimH = m , then Range(s) = [O, 11 (see [Dvure~enskijand Pt&k, 20021). If H is finite dimensional, the range of a state s on L(H) is not necessarily convex. Indeed, if H is a Hiibert space with dimension n < m , the state s(M) = dim(M)/n, M E L(H), is a state on L(H) with a discrete range. This is the only such state. (2) It is worth recalling that the range of an unbounded charge on L(H) need not be necessarily convex (see the charge constructed in Theorem 61). (3) Whereas part (1) of Theorem 59 remains valid if we replace L(H) with F(S), it fails in the case of E(S). Indeed, let S be an inner product space such that 0 < d i m s / ~= n < m. Then, the mapping s on E(S) defined by
David
Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
d i m p / ~ s ( M )= 7 , is a state taking at most n+ 1 values and vanishing on each complete subspace of S . (We note that it would be interesting to describe all states on E ( S ) when 0 < d i i s / ~< oo in a Gleason's type formula, see [ ~ h e t c u tand i DvureEenskij, 2004b, Exer. 8.51.)
THEOREM 61. Let H be a n infinite dimensional Hilbert space. Then, nc,(L(H)) i s a proper subset of n , ( L ( H ) ) . Proof. Let 93 = { x , I s E C) be a Hamel basis in R over the field of rational numbers. We can assume that x , > 0 for each s E C. Fix an element x,, E 93. Then every real number x E W can be uniquely expressed in the form
where a is a finite subset of C \ { s o ) and all p's are rational numbers. We define a ,!3,xs) = Pso discontinuous function 4 : W -+ Q by letting 4 ( x ) = ~ ( ~ , , x , , CsEa whenever x E W is expressed in the form of equation ( 2 ) . Let s be any regular state on L ( H ) . We show that 4 o s is a regular charge. Let E > 0 and A E L ( H ) be given. If 4 ( s ( A ) ) = 0, we take M = {0), which CsEu PSx,, where yields 14(s(A))- 4(s(M))I < E. So let 0 # s ( A ) = P,,xs0 p,, # 0. There is an integer n 2 1 such that l / n < E and x,,/n < s ( A ) . Then 0 < (p,, - l/n)x,, CsEa Psxs < s ( A ) . By (1) we can find a finite dimensional subspace M of A such that s ( M ) = (p,, -l/n)x,, +CsEu ,B8x,. Hence, \ @ ( s ( A )) 4(s(M))I= l / n < E which proves that 4 0 s is a regular charge on L ( H ) . However the charge 4 0 s is not bounded since by Theorem 59 the range of a bounded charge on L ( H ) is a convex subset of W and Range(4 o s) Q. Therefore, by Corollary 57, q5 o s is not completely-additive.
+
+
+
We conclude by giving a sufficient condition for a regular charge on L ( H ) to be completely-additive. First we prove the following elementary lemma. We prove it for E ( S ) as we will need to refer to it later on. LEMMA 62.
(1) Let m be a bounded charge o n E ( S ) . For any M E E ( S ) and 6 > 0 there exists a finite dimensional subspace Mo of M such that Im(N)I < E for every finite dimensional subspace N C M ~ M . (2) Let ml and mz be bounded regular charges o n E ( S ) such that m l ( A ) = m z ( A ) for every finite dimensional subspace A of S . T h e n ml = ma. Proof. (1) If the statement is false, then a sequence {Ni I i E N) of pairwise orthogonal finite dimensional subspaces of M can be found with the property Im(Ni)1 2 E (for each i ). This would lead to a contradiction in view of the fact that m is bounded and that one of the sets { i E N I m ( N i ) 2 E) and { i E N I m ( N i ) 5 - E ) is infinite.
Algebraic and Measure-theoretic properties
. ..
103
(2) Fix an arbitrary M E E ( S ) . By part (1) we can find finite dimensional subspaces Ml and M2 of M such that for any finite dimensional subspace A of M
A G M,IM =+- m l ( A ) < 614, and ACM ~ M m z ( A ) < 1214.
*
+
Let B = M1 M2. Since ml and m2 are regular it follows that Iml(MkM)l5 €14, lm2(MkM)15 ~ / 4 ,I ~ ~ ( M ; B5)€14 I and ~ m z ( M k5~ €14. ) ~ Then
Iml(M) - mz(M)I I Iml(M) - ml(B)I
+ Iml(B) - m2(B)I + Im2(B) - m2(M)I
+ Imz(M) - mz(M2) - m2(MkB)I
= I m l ( M ) - m l ( M 1 )- m l ( M f B ) I
5 l m l ( M k M ) l +I m l ( ~ f ~+)I Im 2 ( ~ ; " ) l +
Im2(~,'~>l
5 6
rn THEOREM 63. Let H be a n infinite dimensional Hilbert space and let m be a regular charge o n L ( H ) bounded o n the atoms (i-e. there exists K > 0 such that m([u]) < K for all u E B(H)). Then there exists a unique self-adjoint trace class operator T o n H such that m ( M ) = trTPM for all M E L ( H ) . Hence m i s completely-additive.
Proof. We can restrict m to finite dimensional subspaces of H and since m is bounded on the atoms we can use Gleason Theorem to obtain a bounded selfadjoint operator T on H satisfying that m ( [ x ] = ) ( T x ,x ) for all x E S ( H ) . We show that T is a trace class operator. We recall that T can be expressed as the difference of two positive operators T I and T2, and H can be split into two orthogonal subspaces H1 and Hz such that T1H2 = T2H1 = (0). Since T I is positive, to show that it is a trace class operator, it is sufficient to verify that C i E I ( T 1 x ixi) , is summable for just one orthonormal basis {xi 1 i E I ) in H . Let {xi I i E I o ) and { y j I j E Jo) be orthonormal bases of HI and H2 respectively. Then
Since m is regular, and because m is positive on all the finite dimensional subspaces of H I , it follows that m is positive (and therefore monotone) on L ( H l ) . Hence, for any finite subset I; of lo,we have 0 5 m ( [ x i ] )5 m ( H l ) . This m([xi]< ) w, and therefore T I is a trace class operator. The implies that 0 I CiEIo same can be shown for T2, and therefore it follows that T is a trace class operator. We can now apply part (2) of Lemma 62 to deduce that m ( M ) = tr T P M . H THEOREM 64 (Aarnes). L e t s be a state o n L ( H ) , where H has dimension greater than 2. Then s i s a convex combination of a completely-additive state sl and a free state s2, i.e. s = As1 (1 -X)s2.
+
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
8 MEASURETHEORETIC COMPLETENESS CRITERIA OF INNER PRODUCT SPACES The main objective of this section is the study of the interplay that exists between the linear topology of inner product spaces, ordered properties of specifk subspace structures and continuity of measures on them. It will be shown, for example, that for incomplete inner product spaces there is no hope of finding completely-additive charges on any of these subspace structures. This direction of research owes its beginning to J. Hamhalter and P. P t i k ha am halter and P t a , 19871 who proved that a separable inner product space S is complete if, and only if, S(F(S)) contains a c~-additivestate. This surprising result was after generalized for non-separable inner product spaces and completely-additive charges - see [~vure~enskij, 1992; Hamhalter, 20031 for a complete survey. Here we obtain these results as corollaries of Theorem 66. We remark that in the proof of this theorem [~uhagiarand Chetcuti, submitted], in contrast with the original proofs in [Hamhalter and Ptik, 1987; DvureEenskij, 1992; Chetcuti and DvureEenskij, 2003b], no use is made of Gleason Theorem. PROPOSITION 65. Let m be a charge on F(S). For any A, B E F(S), A C B, we have m(B) = m(A) + m(AL n B).
Proof. This follows directly from the following equalities:
As a consequence of the previous proposition observe that whenever A and B are elements of F(S) such that A C_ B and A I B = (0) then m(A) = m(B) for every charge m on F(S). THEOREM 66. Let S be an incomplete inner product space. Then, every charge o n F(S) i s free.
Proof. By Corollary 24, if S is incomplete, there exists a subspace M in F(S) and a maximal orthonormal system {xi I i E I}in M such that span{xi I i E I } ~ " ~ - " M . Let X = span{xi I i E I}lsLs. Then MIS 2 XIS. Let u be a unit vector in X I S \ M I S . Observe that u $! M @I M I s and that
s
Suppose that m is a charge on F(S) such that m([v]) # 0 for some unit vector v of S. Let U be a unitary operator on S such that U(u) = v and let ii.l be the charge on F(S) defined by k ( M ) = m(UM). Then ii.l([u]) = m([v]) # 0. By Proposition 65 we obtain ii.l(M) + fi([u]) = %(X) + ii.l([u]) = k ( X @I [u]) = k ( M which is a contradiction.
+ [u]) = fi(M), rn
Algebraic and Measure-theoretic properties . . .
105
COROLLARY 67. Let S be an inner product space. The following statements are equivalent: (1) S is complete; (2) F(S) admits a non-singular charge; (3) F(S) admits a regular non-zero charge; (4) F(S) admits a completely-additive non-zero charge.
When the Hamhalter-Ptbk Theorem was published in 1987 the problem of whether F(S) can admit a charge for an incomplete inner product space S, became eminent (see [Ptbk, 19881 and [Dvure~enskij,1992, Problem 4.3.121). Recall that if H is a Hilbert space, then 'S(L(H)) is the closure (in the topology of O(L(H))) of the convex hull of the vector states. However, the restriction of every vector state on F(S) is regular and therefore, for incomplete inner product spaces F(S) does not admit any vector state. This would somehow suggest that F(S) has no state restricting from L(H) and that F(S) could be a naturally-born example of a stateless complete lattice. Only recently it has been shown that contrary to one's intuition, the existence of a state on F(S) is not sufficient for S to be complete [Chetcuti and DvureEenskij, 2004a; Chetcuti and DvureEenskij, 2005a]. A wide class of incomplete inner product spaces for which the lattice of orthogonally closed subspaces admit a charge restricting from the projection logic of the completion was exhibited. DEFINITION 68. An inner product space S is said to be strongly dense (in its completion) if for every infinite dimensional closed subspace M of 3, we have M n s # (0). Every inner product space S satisfying d i r n s / ~< 2"0 is strongly dense (see [Chetcuti and DvureEenskij, 2005a, Proposition 21). In particular, every dense hyperplane of a Hilbert space is strongly dense. on the For every inner product space S we can define a binary relation B if there exist finite dimensional subspaces elements of F(S) as follows: A Nl, N2 of S such that A Nl = B N2. It is not difficult to check that is reflexive, symmetric and transitive, i.e. defines an equivalence relation on F(S). Let 5(S) denote the partition F(S)/-. For any A E F(S), let (A) denote the equivalence class containing A. Then ((0)) and (S) represent the classes of finite and cofinite dimensional subspaces of S, respectively. For any (A), (B) E 5(S), we say that (A) is less than (B) and write (A) 5 (B), if for every C E (A) there exists D E (B) such that C C D. Observe that (A) 5 (B) if, and only if, there exists C E (A) and D E (B) such that C C_ D. It is easily verifiable that 5 is reflexive and transitive. Moreover, if (A) 5 (B) and (B) 5 (A), then we can find subspaces C E (A) and D E (B), such that A D 5 C . Since dim CIA < oo, it follows that A D, and therefore D E (A). This implies that (A) = (B), i.e. 5 defines a partial order on 5(S). Indeed, it can be shown that 5 induces on 5(S)
+
-
-
-
+
-
-
106
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
a lattice structure homomorphic to the lattice structure of F ( S ) . Moreover, for strongly dense inner product spaces we have the following theorem [Chetcuti and DvureEenskij, 2005a, Theorem 11. THEOREM 69. Let S be an inner product space such that it is strongly dense in its completion. Then 5 ( S ) is an orthomodular lattice. Furthermore, 5 ( S ) is isomorphic to (as orthomodular lattices).
5(s)
Since when S is incomplete, every charge on F ( S ) must vanish on the finite dimensional subspaces, the charges on F ( S ) are in one-to-one correspondence with the charges on Z ( S ) and hence we have the following theorem [ ~ h e t c u t i and DvureEenskij, 2005a, Theorem 21. THEOREM 70. Let S be an incomplete, strongly dense inner product space. There is a linear homeomorphism q5 : m o m @between R ( F ( S ) )and R f ( L ( H ) )(where H = 3). Each charge m on F ( S ) is the restriction of m@ in the sense that m ( M ) = m+(%), for all M E F ( S ) . The original problem (see [ ~ t & k19881 , and [~vure~enskij, 1992, problem 4.3.121) is now reduced as follows: PROBLEM 71. Does there exist an incomplete inner product space S for which F ( S ) is stateless ? Although F ( S ) does not admit any regular charge for incomplete S , E ( S ) always allows for a separating set of regular bounded charges. For any self-adjoint traceconsider the map class operator T on
s,
r n :~E ( S ) + [O, 11,
where
M
ct
tr T%.
(1)
It is clear that equation (1)defines a bounded charge on E ( S ) . We prove regularity. There exists a Let M be in E ( S ) and {yi I i E I ) be an orthonormal basis of finite subset I0 of I such that
z.
Let K E N be the cardinality of lo.By Proposition 20 there exists a finite orthonormal system {xi I i E I o ) in M such that llxi - yill < E/(~KIITII) for each
Algebraic and Measure-theoretic properties
.
i € I o Then
i.e. mT is regular. In the following theorem we show that every regular bounded charge on E(S) arises in this way. THEOREM 72. Let S be an inner product of dimension at least 3 and let m be a regular bounded charge on E(S). There exists a unique self-adjoint trace class operator T on 3 such that m(M) = trT* for all M E E(S). Proof. Restrict m to E(N), where N is any subspace of S with a finite dimension greater than 2. By Gleason Theorem, there exists a bounded Hermitian conjugatebilinear form t N on N x N such that m([x]) = tlv(x,x) for every unit vector x of N . Define a conjugatebilinear form t on S x S as follows: t(x, y) = tN(x, y), where N is any subspace of S with a finite dimension greater than 2 that contains x and y. In view of the polarization identity of Hermitian conjugatebilinear forms, it is clear that the definition of t depends only on x and y, i.e. t is well defined. Since m is bounded, t is also bounded and therefore t extends continuously to a unique Hermitian conjugate-bilinear form, again denoted by t, on 'S x 'S. Let T denote the unique self-adjoint operator on 'S such that t(x, y) = (Tx, y) for all x, y E 'S. We claim that T is a trace class operator. Let {yi I i E I ) be any orthonormal basis of 3.Let I. be a finite subset of I . By Proposition 20, for any preassigned positive number 6 we can find a finite orthonormal system {xi I i E 10) in S such that
This implies that
.
Since m is bounded, it follows that CiEI(Tyi, yi) is summable, i.e. T is a trace class operator. From part (2) of Lemma 62 it follows that m(M) = tr T*.
108
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
We remark that Theorem 70 can be viewed as the generalization of Gleason Theorem for incomplete inner product spaces. It is straightforward to check that the E ~ ( 3defines ) ) an embedding (as orthomodular mapping I? : (M E E(S)) I+ posets) of E(S) into ~ ( 3 )Theorem . 70 implies that every regular bounded charge on E(S)can be lifted to a normal functional on the algebra B@) of bounded o p erators on 3 . However, it is still not known whether this holds for every bounded charge on E(S) .
(z
PROBLEM 73. Is it possible to extend every bounded charge on E(S) to a linear functional on ~ ( s ) ? In Theorem 63 we have seen that if S is a Hilbert space then, the bounded regular charges on E(S) are precisely those that are completely-additive. This is not the case when S is incomplete. Although E(S) has always an ample supply of bounded regular charges, no completely-additive charge can exist on it unless S is complete. THEOREM 74 (DvureEenskik, 1995, Theorem 3.3). A n inner product space i s complete if, and only if, there exist a frame-type function f : B(S) -+ W and a constant k > 0 such that C l f ( ~ i )Ll k iEI
for every maximal orthonormal system {xi I i E I ) in S. COROLLARY 75. A n inner product space S i s complete i f , and only if, there i s a unit vector x E S and k > 0 such that, for any maximal orthonormal system {xi I i E I ) in S, 0 < k
holds. I n particular, S i s incomplete if, and only if, for any unit vector x,
where the infimum i s taken over all m a i m a l orthonormal systems {xi I i E I ) of S. COROLLARY 76. Let S be a inner product space. The following statements are equivalent: (1) S i s complete;
(2) Eq(S)admits a completely-additive non-zero charge; (3) E(S) admits a completely-additive non-zero charge; (4) C(S) admits a completely-additive non-zero charge;
Algebraic and Measure-theoretic properties
. ..
(5) P(S) admits a completely-additive non-zero charge. Proof. It is straightforward to verify that (1) (2), (2) & (3), (3) =+ (4) and (4) =+ (5). Suppose that m is a completely-additive charge on P(S). First we assume that m(S) # 0. Define f : S(S) + W by f (x) = m([x]). Then f is a frame-type function on S and for every maximal orthonormal system {xi I i E I ) in S we have
and therefore, by Theorem 74, S is complete. If m(S) = 0, find a unit vector u in S such that m([u]) # 0 and let So= [ u ] l s .Then m(S0) # 0 and by the previous argument, Soand therefore S, is complete. 9 CONVERGENCE OF CHARGES The aim of this section is to study some of the basic principles of measure theory in the set-up of the projection logic E(S). Namely, we will investigate possible generalizations of the Nikodfm Boundedness and Convergence Theorems and of the Vitali-Hahn-Saks Theorem. THEOREM 77. (Nikodfm Boundedness Theorem) Let H be a n infinite dimensional Hilbert space. Let {mi I i E I ) be a collection of completely-additive charges o n L(H) such that SUP Imi(M)I < iEI
for each M E L(H). T h e n {mi I i E I } i s uniformly bounded o n L ( H ) . Proof. For every i E I there exists a trace class operator Ti on B ( H ) such that mi = t r T j P ~for every M E L(H). Let fi denote the normal functional A H trT,A on B(H). Clearly, result would follow immediately from the BanachSteinhaus Theorem if we show that {fiI i E I ) is pointwise bounded on B(H). Let 0 5 A 5 I . By the Spectral Theorem A = CnEN +pn for a sequence of commuting projections in L(H). By the classical Nikodjrm Boundedness Theorem there exists k > 0 such that
and hence supiEI I fi(A)I < k. Since every operator can be decomposed as a linear combination of four positive elements, it follows that {fi 1 i E I ) is pointwise bounded on B(H) . The situation in the case that S is incomplete is still not clear - indeed the following problem is still open. Of course, when S is incomplete we replace the
110
David Buhagiar, Emmanuel Chetcuti and Anatolij DvureEenskij
completely-additive charges with the bounded regular ones. Observe that in view of Theorem 72 every such charge is determined by a trace class operator. PROBLEM 78. Let S be an incomplete inner product space. Suppose that a sequence {mi I i E N) of regular bounded charges on E ( S ) converges to some charge m. Is m bounded? We recall that Nikodfm Convergence Theorem asserts that the pointwise limit of a sequence of a-additive measures {pi I i E N) on a a-field C is a a-additive measure and the set {pi I i E N) is uniformly countably additive (i.e. for any disjoint sequence { X k : k E N) in C, and for any E > 0, there exists K E N such that 1 C k > Kpi(Xk)l < E for each pi). We further remark that convergence theorems of completely-additive charges on L ( H ) , were first studied by R. Jajte [Jajte, 19721. THEOREM 79 (Nikodfm Convergece Theorem). Let H be a n infinite dimensional Hilbert space. Let {mi I i E N) be a sequence of completely-additive charges o n L ( H ) converging pointwise to some charge m E S1(L(H)). T h e n m i s completelyadditive. Moreover, the sequence {mi I i E N) i s uniformly completely-additive. Proof. Let {Mk I k E I ) be a collection of mutually orthogonal closed subspaces
of H. We can find a countable subset fi of I such that m i ( M k ) = 0 for every k E I \ Il and i E N. Each mi induces a a-additive measure on 2'1 as follows: pi : (J C I l ) mi(VkEJ Mk). Clearly, {pi 1 i E N) converges pointwise on 2'1 and hence, by the classical Nikodfm Convergence Theorem, for every E > 0 we can find a finite subset I. f Il such that
for every mi, i.e. the set { m i ( i E N) is uniformly completely-additive and therefore, the limit charge m is completely-additive. We shall now investigate the same problem for the case when S is incomplete. As we shall see, this case does not allow for such a clear answer. We say that a sequence {mi I i E N) of regular bounded charges on E ( S ) is uniformly regular if for any M E E ( S ) and for any E > 0, there exists a finite dimensional subspace Mo of M such that Imi(M) - mi(Mo)l < E for each mi. As a consequence of Theorem 63 and Theorem 79 we have the following version of the Nikodfm Convergence Theorem. COROLLARY 80. Let H be a n infinite dimensional Hilbert space. Let { m i I i E N) be a sequence of regular bounded charges o n L ( H ) converging pointwise t o some charge m E S1(L(H)). T h e n m i s bounded and regular. Moreover, the sequence {mi / i E N) i s uniformly regular. In the following theorem it is shown that the set of regular bounded charges on E ( S ) need not be sequentially closed in S1(E(S))for an incomplete S - not
Algebraic and Measure-theoretic properties
...
111
even if we restrict ourselves to states. For incomplete inner product spaces, the projection logic can be extremely poor and consequently the pointwise topology on n(E(S)) can be very coarse. This provides a negative answer to the problem posed by A. DvureEenskij (see [Dvure~enskij,1992, Problem 4.3.151). THEOREM 81. Let H be a n infinite dimensional, separable Hilbert space. There exists a dense hyperplane S of H such that the set of regular states on E(S) i s not sequentially closed in S(E(S)). Proof. In Theorem 36 a dense hyperplane S of H was constructed such that E(S) = P(S). Let {ei I i E N} be an orthonormal basis of S and let si : E(S) + [O, 11, M H l + i 1 12 (i E N) be the associated vector states on E(S). We claim that {si I i E N} converges (pointwise) to the unique twevalued state s in S(E(S)) assigning 0 to each complete subspace and 1 to every cocomplete subspace of S . Let u be a unit vector of S. Then limi si([u]) = liw I(u, ei)I2 = 0. This implies that limi si(M) = 0 for every finite dimensional subspace M of S, i.e. s is the unique free state in S(E(S)).
We now give a sufficient condition under which the limit of a convergent sequence of regular bounded charges on E(S) is regular and bounded. First of all, observe that the limit of a convergent, uniformly regular sequence of regular charges on E(S), is necessarily regular. The following proposition will be used in the proof of Theorem 83. It was first proved by R. Jajte [Jajte, 19721. Here we give a simpler proof without using Schur's Theorem. PROPOSITION 82 (Jajte). Let H be an infinite dimensional Hilbert space. The sequence {mi I i E N} of regular bounded charges o n L(H) converges pointwise if, and only zf, the following two conditions hold: (1) {mi([x]) I i E N} converges for each unit vector x of H; ( 2 ) for any orthonormal sequence {xk I k 6 N} in H , the series CkEnmi([xk]) converges uniformly with respect to i.
I n such case, the limit charge m i s regular and bounded, and the sequence {mi I i E N} i s uniformly regular. Proof. The necessity follows directly from Nikodfm Convergence Theorem (Theorem 79). Suppose that (1) and (2) are true. Fix Y in L(H) and let {yk I k E I} be an orthonormal basis of Y. We can find a countable subset Il of I such that for each mi, mi([yk])= 0 for all k E I \ Il. In view of condition (2), for any given positive E , there exists a finite subset loof 4, such that for all i E N, we have
In view of condition (I), let Q E N satisfy
112
for any p
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
> q 2 Q.
Then, for any p
> q 2 Q, we have
This implies that {mi I i E N) is pointwise convergent on L ( H ) . Given a positive regular charge mo on E(S), we say that the bounded regular charge m is absolutely continuous with respect to mo if, for every E > 0 there exists 6 > 0 such that Im(M)I < E, whenever M E E(S) and mo(M) < 6. Furthermore, we say that m is atomic absolutely continuous with respect mo if, for every E > 0 there exists 6 > 0 such that Im([x])l < E, whenever x E S(S) and mo([x]) < 6. A sequence {mi I i E N) of bounded regular charges on E(S) is uniformly absolutely continuous with respect to mo if, for every E > 0 there exists 6 > 0 such that Imi(M)I < E for every mi, whenever M E E ( S ) and mo(M) < 6.
THEOREM 83. Let S be a n inner product space and let {mi I i E N) be a sequence of bounded regular charges o n E(S) converging pointwise t o m. Suppose that there exists a positive regular charge mo o n E(S) such that every mi i s atomic absolutely continuous with respect to mo. T h e n m i s bounded and regular and the sequence {mi ( i E N) i s uniformly regular. Proof. Denote by Ti (i = 0,1, . . . ) the corresponding bounded self-adjoint trace for all M E E(S). class operator on 3 associated with mi, i.e. mi(M) = trTj* First we prove that the sequence {('I'z, z) I i E N) converges for each unit vector z of 3. From the following inequalities
it follows that llTill 5 (lTollfor all i = 1,2,. . . . Fix a unit vector z in 3 and let 6 > 0 be arbitrary. There exists a unit vector x of S such that 11% -211 < (llTo11c)/6. In addition, we are guaranteed that for some I E N, I((Tp- Tq)x,x)I < €13 for all p > q 2 I. Thus, for p > q 2 I, we have
and therefore {(Tiz, z) I i E N) is convergent.
Algebraic and Measure-theoretic properties .. .
Let {zk I k E N) be an arbitrary orthonormal system in (TOzk,zk)l < 00,there exists a positive integer K such that
113
S.
Since
CkEN 1
for any 6 > 0 and i E N. If we denote by riii the the charge on E(S)defined by fii(N) = tr TipN,for N E E(S),then it is clear that the sequence {riii I i E N) satisfies conditions (i) and (ii) of Proposition 82. This implies that {riii I i E N) converges pointwise on E(S) to some bounded regular charge r72 on ~ ( 3 ) It . is clear that m is the restriction of f i , i.e. m(M) = r72(M) for all M E E(S). The uniform regularity of {mi I i E N) follows from that of {riii I i E N). Indeed, for any M E E(S) and E > 0 there exists a finite dimensional subspace Mo of % such that Iriii(M) - riii(Mo)l < E for each i. Using Proposition 20 a finite dimensional subspace N of M can be found with the property that Imi(M) - mi(N)( 5 6 for rn each i. Let C be a a-algebra of subsets of a set X and denote by ca(C) the linear space of all a-additive measures on C endowed with the topology of pointwise convergence. Suppose that p is a positive a-additive measure on C. Then, the Vitali-Hahn-Saks Theorem asserts that if K ca(C) is a relatively compact set such that each element of K is absolutely continuous with respect to p on C, then K is uniformly absolutely continuous with respect to p (see [ ~ u n f o r dand Schwartz, 19581). In [chetcuti and Hamhalter, to appear, Example 4.51 it was shown that this cannot be carried over directly to the non-commutative case. In fact, the Vitali-Hahn-Saks Theorem fails for L(H) when dim H is infinite. This demonstrates a different character of non-commutative measure theory as far as charges are concerned. However, in [Chetcuti and Hamhalter, to appear, Theorem 4.61 it is proved that if we restrict to positive charges then the Vitali-Hahn-Saks Theorem holds for L(H). We thus have the following theorem. THEOREM 84 (Vitali-Hahn-Saks Theorem). Let H be a n infinite dimensional Hilbert space and let {mi I i E N) be a pointwise convergent sequence of positive regular charges o n L(H) such that such that each mi i s absolutely continuous with respect to some regular state so. Then, {mi I i E N) is uniformly absolutely continuous with respect to so. We conclude this section by exposing another contrast between L(H) and E(S) when S is incomplete. The Vitali-Hahn-Saks Theorem can fail in the E(S) setup even when we restrict to states. The inner product space that works out to be a counter-example for this is the same one considered in Theorem 36, i.e. E(S) = P(S). Let {siI i E N) be the sequence of vector states corresponding to the orthonormal basis {ei I i E N) of S . Put s = $si. Observe that each si is absolutely continuous with respect to so and {si ( i E N) converges pointwise to the state assigning 0 to finite dimensional subspaces and 1 to the co-finite dimensional ones. However, it is not difficult to check that {siI i E N) is not uniformly absolutely continuous with respect to so.
xiEN
David Buhagiar, Emmanuel Chetcuti and Anatolij DvureEenskij
10 INFINITEVALUED MEASURES Here we present an overview of some of the results concerning measures on the projection lattice of a Hilbert space that can take also infinite values. An example of such a measure would be the dimension function. A mapping p : L(H) + [0,m] is said to be a measure if p(M @ N) = p(M) p(N) for all M, N E L(H) such that M I N . As we did with charges in Section 5, we can distinguish between the notions of (1) completely-additive, (2) a-additive and (3) regular measures. Observe that here by a regular measure we mean that given E > 0 and M E L(H), there is a finite dimensional subspace N of M such that p ( ~ Nn ~ H<) E . A measure p is afinite if there is a countable system of mutually orthogonal subspaces {Mi I i E N), Mi and p(Mi) < m for every i E N. such that H = VdEN For measures we can find a special formula, resembling the standard Gleason formula such that, when we restrict this formula to finite a-additive measures, we obtain the classical Gleason formula. A crucial notion, which substitutes trace class operators, is the notion of densely defined bilinear forms. In contrast to aadditive charges, there is no oneteone correspondence between the a-finite and a-additive measures and bilinear forms - not every bilinear form induces a a-finite and a-additive measure. A mapping f : B(H) + [0,m ] is a generalized frame function o n H if: (1) f (Ax) = f (x) for all x E B(H) and X E D; (2) there exists w E [0,m ] such that CiEr f (xi) = w for every orthonormal basis {xi I i E I ) of H; (3) for any closed subspace K of H , the restriction of f to B(K) is again a generalized frame function on K . It is straightforward to verify that the set of completely-additive measures on L(H) is in one-bone correspondence with the set of generalized frame functions on H. (We can view this as an extension of the one-teone correspondence that exists between the set of charges on L(H) and the set of frame functions on H.) Given a measure p on L(H) we define S, to be the subset of H consisting of vectors x such that p([x]) < m . In [Lugovaja and Sherstnev, 19801 G. D. Lugovaja and A. N. Sherstnev proved that if p is a a-finite measure on L(H), then S, is a dense subspace of H, see also [~vure~enskij, 1992, Section 3.41. The following lemma for infinite measures is of similar importance as that for finite states in the j a Sherstnev, 19801 (for an case of It3, and it was proved originally in [ ~ u ~ o v aand alternative prove see also [Chevalier et al., 20001).
+
>
LEMMA 85. Let Hn be an n-dimensional Hilbert space, where n 3. Let p be a measure o n L(Hn) such that p(Hn) = m and suppose that P i s a n ( n - 1)dimensional subspace such that p(P) < m. If q is a unit vector such that p([q]) < m , then q E P.
Proof. First assume that Hn = It3. Suppose that q is a unit vector making an acute angle 0 < a with the plane P such that p([q]) < m . We can choose a coordinate system as follows. Let XI be the unit vector bisecting the angle a. Let x2 be a unit vector orthogonal to X I and q. Observe that x2 E P . Let x3 be a
Algebraic and Measure-theoretic properties
. ..
115
unit vector orthogonal to xl and x2. Since 2 2 is orthogonal to q, it follows that the plane containing x2 and q has a finite measure. Denote this plane by Q. Put
F = {x E t5(iR3) 1 3
q') E P x Q such that pllq' and x E span{pl, q')).
Using the geometry of the sphere, one can show that F contains all the unit vectors with the absolute value of the latitude (with respect to the xlxz-plane) less than or equal to a. Hence we can find a unit vector ql and a plane PI such that p([ql]) < co, PI) < oo and the angle between ql and PI is 2a. One can repeat the same argument and deduce the p([x]) < oo for all x in B(W3) having absolute value of latitude equal to 2a. Therefore, we can repeat the above inductively and conclude that 4W3) < co, which is a contradiction. Now, we consider the case when H, = (C3. Let yo be a unit vector perpendicular to P and yl, y2 be two orthogonal vectors in P such that (q, yi) is real for i = 0,1,2. Let M be the threedimensional completely-real subspace generated by {yo,y1, y2}. Then q E M. The measure p induces a measure fi on L ( M ) by letting P([x]) = p([x]) for every x E B(M). Observe that fi([yo]) fi([y~]) fi([y2]) = oo and therefore, from the above arguments, it follows that q = Xlyl X2y2, where Xi E W, i.e. q E P . To prove it for every n > 3, one can apply induction. Suppose result is true for n < k and let P be a (k - 1)-dimensional subspace of Hk such that p(P) < oo. Let q be a unit vector with p([q]) < oo, and u a unit vector in P orthogonal to q. Put Hk-1 = [uILHkand P' = [u]IHkn P. Observe that q E Hk-1 and dim P' = k - 2. By induction hypothesis it follows that q E P'.
+
+
+
If t is a symmetric (not necessarily bounded) bilinear form and P is a projection on H such that P H D(t) then, we can define the symmetric bilinear form t o P on H x D(t) as follows: t 0 P(x, y) = t(Px, y). We write t o P E Tr(H) if t o P is bounded, and the associated bounded self-adjoint operator is a trace class operator. Moreover, we denote by tr t o P the trace of this operator, i.e.
where {xi I i E I}is any orthonormal basis of H . Using Lemma 85, it is possible to prove the following theorem. THEOREM 86 (Lugovaja and Sherstnev, 1980). Let H be a Hilbert space of dimension greater than 2. Let p be a n-finite, n-additive measure. The following assertions are equivalent: (1) There exists a (unique) positive, symmetric bilinear form t with the domain D(t) dense in H such that trtoPM iftoPMETr(H), otherwise.
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvurehnskij
(2) p has a support, i.e. a closed subspace M, of H such that p(N) = 0 if, and only if, N IM,. (3) p is a completely-additive measure. EXAMPLE 87. Any positive self-adjoint operator T defines by equation (1)a afinite and completely-additivemeasure, where t is defined by t(x, y) = (T'/'x, ~ ' 1 ' ~ ) with D(t) = D(T'/~). We now exhibit a difficulty that arises when we use bilinear forms that are not determined by positive self-adjoint operators. EXAMPLE 88. Let H be an infinite dimensional separable Hilbert space. Let {en I n E N) be an orthonormal basis, which is a part of a Hamel basis {ei I i E I)of H . Fix an element ei, which does not belong to the orthonormal basis {en I n E M) and define a linear operator T : H 4 H and a linear functional f : H 4 cC via
and
where cri, is the scalar corresponding to eb in the decomposition x = CiEI ai ei, x E H, with respect to the given Hamel basis. If we set t(x, y) = (Tx, Ty), then t defines via equation (1) a a-finite measure that is not a-additive.
G.D. Lugovaja [1983] showed that on a separable Hilbert space, a singular positive symmetric bilinear form does not define a a-finite, a-additive measure by equation (1). For that reason the following important result was proved by B. Simon [1978]: THEOREM 89. Let t be a densely defined positive symmetric bilinear form on a Hilbert space H. Then there exist two positive symmetric bilinear forms t, and t, with D(t,) = D(t) = D(t,) such that
where t, is the largest closable bilinear form less than t. THEOREM 90 (Lugovaja, 1983). Let H be an infinite dimensional Hilbert space and let t be a singular, positive symmetric bilinear form with dense domain D(t). Then, the mapping p : L(H) 4 [0,ca]defined by equation (1) is not a a-additive measure on L(H). The affirmative answer is also due to G. D. Lugovaja:
Algebraic and Measure-theoretic properties
...
117
THEOREM 91 (Lugovaja, 1983). Let H be an infinite dimensional Hilbert space. A positive symmetric bilinear form t with a dense domain D ( t ) defines through equation (1) a a-additive measure o n L(H) if, and only if,
(m), E Tr(H)
implies t o PM€ Tr(H),
for any M E L(H), where ( t o P M ) i~s the regular part of the closure t o PM. THEOREM 92. Let H be a separable Hilbert space of dimension greater than 2. Let p be a a-finite, regular measure o n L(H). Then, there exists a unique positive bilinear form t with a dense domain such that equation ( 1 ) holds. Conversely, for any positive bilinear form t o n H such that D ( t ) is dense in H, the mapping pt : L(H) + [0, m ] given by trtoP~
iftoPM€Tr(H), otherwise
i s a a-finite, regular measure. We end the survey by quoting another problem. PROBLEM 93. Characterize the a-finite, a-additive signed-measures taking infinite values on L(H) for a separable infinite dimensional Hilbert space H, where by a signed measure we mean a mapping p : L(H) [-m, m] preserving additivity on orthogonal subspaces. (It is possible to show that every signed measure attains at most one of the values k m . ) ACKNOWLEDGEMENTS The third author was supported by the Center of Excellence SAS - Physics of Information - 1/2/2005, the grant VEGA No. 216088126 SAV and by Science and Technology Assistance Agency under the contract No. APVT-51-032002. Bratislava, Slovakia. BIBLIOGRAPHY [Aarnes, 19701 J. Aarnes, Quasi-states on C*-algebras, Tl-ans. Amer. Math. Soc. 1 4 9 (1970), 601-625. [Amemip and Araki, 1966471 I. Amemiya and H. Araki, A remark on Piron's paper, Publ. Res. Inst. Math. Sci., Kyoto Univ. Ser. A 2 (1966-67), 423-427. [Bennett and Foulis, 19971 M. K. Bennett and D. J. Foulis, Interval and scale effect algebras, Adv. Appl. Math. 9 1 (1997), 823-834. [Birkhoff and von Neumann, 19361 G. Birkhoff and J. von Neumann, The logic of quantum mechanics, Ann. Math. 37 (1936), 823-843. [Bunce and Wright, 19941 L. J. Bunce and J. D. M. Wright, The Mackey-Gleason problem for vector measures on projections in von Neumann algebras, J . London Math. Soc. (2) 4 9 (1994), 133-149. [Buhagiar and Chetcuti, 20041 D. Buhagiar and E. Chetcuti, On isomorphism of inner product spaces, Math. Slovaca 5 4 (2004), 109-117.
118
David Buhagiar, Emmanuel Chetcuti and Anatolij Dvureknskij
[Buhagiar and Chetcuti, t o appear] D. Buhagiar and E. Chetcuti, Quasi-splitting subspaces i n a prehilbert space, Math. Nach. ( t o appear). [Buhagiar and Chetcuti, submitted] D. Buhagiar and E. Chetcuti, Only 'freeJmeasures are admissible o n F ( S ) when S is incomplete, submitted. [Cattaneoand Marino, 19861 G. Cattaneo and G. Marino, Completeness ofinner product spaces with respect to splitting subspaces, Letters Math. Phys. 11 (1986), 1Ft20. [Chetcuit, 20021 E. Chetcuti, Completeness Criteria for Inner Product Spaces, MSc thesis, Univ. o f Malta, 2002. [Chetcuti and DvureEenskij, 2003al E. Chetcuti and A . Dvureknskij, Range of charges on orthogonally closed subspaces of an inner product space, Inter. J . Theor. Phys. 42 (2003), 19271942. [Chetcuti and DvureEenskij, 2003bl E. Chetcuti and A. DvureEenskij, A finitely additive state criterion for the completeness of inner product spaces, Letters Math. Phys. 64 (2003), 221227. [Chetcuti and DvureEenskij, 2004al E. Chetcuti and A . DvureEenskij, The aistence of finitely additive states o n orthogonally closed subspaces of incomplete inner product spaces, Letters Math. Phys. 67 (2004), 75-80. [Chetcuti and DvureEenskij, 2004bl E. Chetcuti and A. DvureEenskij, Measures on the splitting subspaces of an inner product space, Inter. J. Theor. Phys. 43 (2004), 364-384. [Chetcuti and DvureEenskij, 2005al E. Chetcuti and A. DvureEenskij, The state-space of the lattice of orthogonally closed subspaces, Glasgow Math. J . 47 (2005), 213-220. [Chetcuti and DvureEenskij, 2005bl E. Chetcuti and A. Dvureknskij, Recent progress o n preHilbert-space logics and their nzeasure spaces, Inter. J . Theor. Phys. 44 (2005), 2139-2151. [Chetcuti et al., 20061 E. Chetcuti, P. de Lucia and A. Dvureknskij, Sequential convergence of regular measures o n pre-Hilbert space logics, J . Math. Anal. Appl. 318 (2006), 194-210. [Chetcuti and Hamhalter, t o appear] E. Chetcuti and J . Hamhalter, Vitali-Hahn-Saks Theorem for vector nzeasures o n operator algebras, Oxford Quarterly J . Math. ( t o appear). [Chevalier et al., 20001 G. Chevalier, A. DvureEenskij and K . Svcrtil, Piron's and Bell's geometric lemmas and Gleason's theorem, Found. Phys. 30 (2000), 1737-1755. [Cooke, 19781 T . A. Cooke, The Nikodym-Hahn-Vitali-Sakstheorem for states o n a quantum logic, "Mathematical Foundations o f Quantum Theory" A. R . Marlow ed., Acad. Press, London (1978), 275-285. [Christensen, 19821 E. Christensen, Measures o n projections and physical states, Comm. Math. Phys. 86 (1982), 529-538. [Cooke et al., 19851 R . Cooke, M. Keane and W. Moran, A n elementary proof of Gleason's theorem, Proc. Cambr. Phil. Soc. 98 (1985), 117-128. [de Lucia and Pap, 20021 P. d e Lucia and E. Pap, Convergence theorems for set functions. In: Pap, E. (ed.), Handbook o f Measure Theory. Vol. I Amsterdam, North-Holland, 2002 pp. 125-178 . [Dorofeevand Sherstnev, 19901 S.V. Dorofeev and A.N. Sherstnev, Frame-type functions and their applications, Izv. vuzov matem. no. 4 (1990), 23-29 ( i n Russian). [Drish, 19791 T . Drisch, Generalization of Gleason's theorem, Inter. J . Theor. Phys. 18 (1979), 239-243. [Dunford and Schwartz, 19581 N. Dunford and J. T . Schwartz, Linear Operators, Vol. 1, Interscience, New York, 1958. [ A . DvureEenskij, 19781 A. Dvureknskij, Signed states on a logic, Math. Slovaca 28 (1978), 33-40. [Dvureknskij, 19861 A. Dvureknskij, Generalizations of Maeda's thwrem, Inter. J . Theor. Phys. 25 (1986), 1117-1124. [ ~ v u r e k n s k i j19881 , A. DvureEenskij, Completeness of inner product spaces and quantum logic of splitting subspaces, Letters Math. Phys. 15 (1988), 231-235. [Dvureknskij, 19921 A. DvureEenskij, Gleason's Theorem and Its Applications, Kluwer Acad. Publ., Dordrecht, Ister Science Press, Bratislava, 1992. [Dvureknskij, 19931 A. DvureEenskij, Gleason's t h w r e m and completeness criteria, Inter. J . Theor. Phys. 32 (1993), 2377-2388. [Dvureknskij, 19951 A. DvureEenskij, Frame functions and conzpleteness of inner product spaces, Ann. Inst. Henri PoincarB, 62 (1995), 429-438. [ ~ v u r e k n s k i j20011 , A. Dvureknskij, A new algebraic criterion for completeness of inner product space, Letters Math. Phys. 58 (2001), 205-208.
Algebraic and Measure-theoretic properties
...
119
[Dvureknskij, 20031 A. Dvureknskij, States on subspaces of inner product spaces with the Gleason property, Inter. J. Theor. Phys. 42 (2003), 1393-1401. [ D v u r e n s k i j and Pulmannovi, 19891 A. DvureEenskij and S. Pulmannovi, A signed measure completeness criterion, Letters Math. Phys. 17 (1989),253-261. [Dvureknskij and Pulmannovi, 20001 A. DvureEenskij and S. Pulmannovi, New 'Ii-ends i n Quantum Structures, Kluwer Acad. Publ., Dordrecht, 2000. [Dvureknskij et al., 19901 A. DvureEenskij, T. Neubrunn and S. Pulmannovi, Finitely additive states and completeness of inner product spaces, Found. Phys. 20 (1990), 1091-1102. [Dvureknskij and P t i k , 20021 A. DvureEenskij and P. P t i k , O n states on orthogonally closed subspaces of an inner product space, Lett. Math. Phys. 62 (2002),63-70. [Eilers and Horst, 19751 M. Eiers and E. Horst, The theorem of Gleason for nonseparable Hilbert space, Inter. J. Theor. Phys. 13 (1975),419-424. [Giuntini and Greuling, 19891 R. Giuntini and H. Greuling, Toward a formal language for unsharp properties, Found. Phys. 19 (1989), 931-945. [Gleason, 19571 A. M. Gleason, Measures on the closed subspaces of a Hilbert space, J. Math. Mech. 6 (1957), 885-893. [Gudder, 19751 S. P. Gudder, Inner product spaces, Amer. Math. Monthly 82 (1975), 251-252. [Gudderbook, 19881 S. P. Gudder, Quantuna Probability, Academic Press Inc., Boston, San Diego, New York, Berkely, Tokyo, Toronto, 1988. [Gross and Keller, 19771 H. Gross and H. A. Keller, O n the definition of Hilbert space, Manuscr. Math. 23 (1977), 67-90. [Halmos, 19881 P. R. Halmos, Measure Theory, Springer-Verlag, New York, Heidelberg, Berlin, 1988. [Hamel, 19051 G. Hamel, Eine Basis allen Zahlen und die unstetigen Losungen der Funktionalgleichung: f (x Y ) = f (x) f(Y), Math. Ann. 60 (1905),459-462. [Hamhalter, 20031 J. Hamhalter, Quantum Measure Theory, Kluwer Acad. Publ., Dordrecht, 2003. [Hamhalter and Pt&, 19871 J. Hamhalter and P. P t i k , A completeness criterion for inner product spaces, Bull. London Math. Soc. 19 (1987), 259-263. [Harding, 19911 J. Harding, Orthonaodular lattices whose MacNeille conapletions are not orthomodular, Order 8 (1991), 93-103. [Harding, 19961 J. Harding, Decompositions i n quantum logic, mans. Amer. Math. Soc. 348 (1996), 1839-1862. [Holland, 19691 S. Holland, Jr., Partial solution to Mackey's problem about modular pairs and completeness, Canad. J. Math. 21 (1969), 1518-1525. [Holland, 19951 S. Holland, Jr., Orthomodularity in infinite dimensions; a theorem of M. SolCr, Bull. Amer. Math. Soc. 32 (1995),20S234. [Husimi, 19371 K. Husimi, Studies on the foundations of quantum mechanics 1, Proc. Phys.math. Soc. Japan 19 (1937), 766-789. [Jajte, 19721 R. Jajte, O n convergence of Gleason measures, Bull. Acad. Polon. Sci., ser. Math. Astr. Phys. 20 (1972), 211-214. [Kadison and Ringrose, 19831 R. V. Kadison and J. R. Ringrose, Fundamentals of the Theory of Operator Algebras, Vols I and 11, Academic Press, London, 1983 and 1986. [Kalmbach, 19831 G. Kalmbach, Orthonaodular Lattices, Acad. Press, London, New York, 1983. [Kalmbach, 1986) G. Kalmbach, Measures and Hilbert Lattices, World Sci. Publ. Co., Singapore, 1986. [Keller, 19801 H. A. Keller, Ein nicht-klassischer Hilbertischen Raum, Math. 2. 172 (1980), 41-49. [ ~ o c h e and n Specker, 19671 S. Kochen and E. R. Specker, The problem of hidden variables i n quantum mechanics, J . Math. Mech. 17 (1967), 59-67. [Kolmogorov, 19331 A. N. Kolmogorov, Grundbegriffe der Wahrscheinlichkeitsrechnung,Berlin, 1933. [KBpka and Chovanec, 19941 F. KBpka and F. Chovanec, D-posets, Math. Slovaca 4 4 (1994), 2134. [Lugovaja, 19831 G. D. Lugovaja, Bilinear forms defining measures on projectors, Im. vuwv rnatem. No. 2 (1983),88-88 (in Russian). [Lugovaja and Sherstnev, 19801 G. D. Lugovaja and A. N. Sherstnev, O n the Gleason theorem for unbounded measures, h v . vuzov matem. No. 2 (1980), 3&32 (in Russian).
+
+
120
David Buhagiar, Emmanuel Chetcuti and Anatolij DvureEenskij
[Mackey, 19631 G. W . Mackey, Mathematical Foundations of Quantuna Mechanics, Benjamin, New Y o r k , 1963. [Maeda, 19801 S. Maeda, Lattice Theory and Quantuna Logic, Maki-Shoten, Tokyo, 1980 (in Japanese). [Maeda and Maeda, 19701 F. Maeda and S. Maeda, Theory of Symmetric Lattices, SpringerVerlag, Berlin, 1970. [Mayet, 19981 R. Mayet, Some characterizations of the underlying division ring of a Hilbert lattice by automorphisms, Inter. J . Theor. Phys. 37 (1998), 109-114. [Murray and von Neumann, 19361 F. J . Murray and J. von Neumann, O n rings of operators, Ann. Math. 37 (1936), 116-229. [Murray and von Neumann, 19371 F. J . Murray and J . v o n Neumann, O n rings of opemtors ZZ, 'Ikans. Amer. Math. Soc. 4 1 (1937), 208-248. [Murray and v o n Neumann, 19431 F. J . Murray and J . v o n Neumann, O n rings of opemtors ZV, Ann. Math. 44 (1943), 7164308. iron, 19641 C. Piron, Asionaatique quantique, Helv. Phys. Acta 37 (1964), 439468. [Piron, 19761 PirIPir C . Piron, Foundations of Quantum Physics, Addison-Wesley, Reading, Mass., 1976. [Piziak, 19901 R. Piziak, Lattice theory, quadratic spaces, and quantuna proposition systems, Found. Phys. 20 (1990), 651-665. [PtAk, 19881 P. P t i k , FAT - C A T ( i n the state space of quantum logics), Proceedings o f "Winter School o f Measure Theory", Liptovski J i n 1988, (Czechoslovakia) pp. 113-118. [ ~ t and & Pulmannovi, 199l] P. PtAk and S. Pulmannovi, Orthonaodular Structures as Quant u m Logics, Kluwer Acad. Publ., Dordrecht, 1991. [ P t i k and Weber, 19771 P. Ptdk and H. Weber, Two remarks on the subspace poset of an inner product space, Contrib. Gen. Alg. 10, Proceedings o f t h e Klagenfurt Conference, May 19-June 1, 1997, Verlag Johannes Heyn, Klagenfurt, 1998, pp. 263-267. [PtAk and Weber, 20011 P. P t i k and H. Weber, Lattice properties of subspace fanailies of inner product spaces, Proc. Amer. Math. Soc. 129 (2001), 2111-2117. [ ~ t and & Weber, 20041 P. PtAk and H. Weber, Order properties of splitting subspaces i n an inner product space, Math. Slovaca 54 (2004), No. 2, pp. 119-126. [PulmannovB, t o appear] S. Pulmannovi, A note on honaomorphisms of inner product spaces, Demonstratio Math., t o appear. [Sherstnev, 19741 A. N. Sherstnev, O n a notion of a charge i n nonconanautative scheme of measure theory, Veroj. metod i kibern. Kazan, no. 10-11 (1974), 68-72. (in Russian). [ ~ i m o n19781 , B. Simon, A canonical decomposition for quandmtic fornls with application t o monotone convergence theorems, J . Funct. Anal. 28 (1978) 377485. [Solkr, 19951 M. P. Sol&r, Characterization of Hilbert spaces by orhtomodular spaces, Comm. Algebra 23 (1995), 219-243. [Solbr, 19791 M. P. Solkr. Theory of Operator Algebras I, Springer, Berlin-Heidelberg-New Y o r k , 1979. [Varadarajan, 19851 V . S. Varadarajan, Geometry of Quantuna Theory, Springer-Verlag, New York Inc., 1985. [von Neumann, 19291 J . v o n Neumann, Zur Algebra dur Funktionaloperationen und T h w r i e der norn~alenOperatoren, Math. Ann. 102 (1929), 370-427. [von Neumann, 19401 J . von Neumann, O n rings of operators ZZZ, Ann. Math. 4 1 (1940), 94161. [von Neumann, 19491 J. von Neumann, O n rings of operators. Reduction theory, Ann. Math. 50 (1949), 401485. [Wigner, 19591 E. P. Wigner, Group Theory and its Applications t o Quantum Mechanics of Atomic Spectra, Acad. Press. Inc. New Y o r k , 1959.
HANDBOOK O F QUANTUM LOGIC AND QUANTUM STRUCTURES: QUANTUM STRUCTURES Edited by K. Engesser, D. M. Gabbay and D. Lehmann O 2007 Elsevier B.V. All rights reserved
121
QUANTUM PROBABILITY Stan Gudder
1 INTRODUCTION
This chapter begins with the more concrete and familiar and then gradually progresses to the more general and abstract. To save space and spare the reader from too many technical details, we have decided to omit some of the longer proofs. However, we provide references for the proofs of all stated results and encourage the reader to further pursue topics of interest. Some proofs are provided for recent results to give the reader a flavor of the techniques that are now employed. It is widely believed that quantum theory is intrinsically statistical. That is, the study of elementary particles and their interactions is irreducibly probabilistic and cannot be derived from an underlying deterministic theory. Even those who advocate that such underlying hidden variable theories may be possible admit that they do not seem to be practical and do not appear to offer anything new or useful. In any case, just making the assumption that quantum theory is probabilistic goes a long way toward establishing the structure of quantum mechanics and understanding its interpretations. An important component of any physical theory is the concept of measurement. When a measurement is performed, the physical system interacts with a measuring apparatus and in general the environment cannot be neglected. The environment produces noise, any real apparatus has limited resolution and efficiency and the experimental control of initial conditions is never exact. It follows that no real measurement is absolutely precise and results of measurements must be described statistically. Hence we have a second reason for the importance of probability in quantum theory. Quantum probability generalizes classical probability theory in two ways. First, a traditional random variable f describes a measurement that is absolutely precise. After all, the values f (w) are sharply defined with no fuzziness involved. The uncertainty of classical probability comes from our lack of knowledge of the situation. We can only make statistical predictions about which sample point w occurs. However, as we have previously mentioned, real measurements are never completely precise. There are always errors involved and these should be taken into account in a realistic theory. Second, in a quantum mechanical world, two different measurements A and B frequently interfere with each other. One way this is manifested is that they
Stan Gudder
122
cannot be performed simultaneously. We must specify which measurement is performed first and which is performed next. This results in a sequential or temporal product A o B of the measurements. Due to interference, in general, we have A o B # B o A so the theory becomes noncommutative. For this reason, quantum probability is sometimes called noncommutative probability theory. Classical probability theory contains no mechanism for describing such situations. Until recently the main framework for such descriptions has been operators on a Hilbert space which provides an obvious noncommutativity. In this case, fuzzy quantum events are represented by operators satisfying 0 5 A 5 I and observables or measurements are represented by positive operator-valued measures. These will be considered in Sections 4-8. In the last few years, researchers in the foundations of quantum mechanics have developed a more general formalism called a sequential effect algebra. In this case, fuzzy quantum events are represented by abstract objects with certain properties called effects and observables are represented by a-morphisms from the Borel subsets of the real line into the set of effects (effectvalued measures). These will be discussed in Section 9.
2 MOTIVATIONAL CALCULATIONS This section presents some standard concrete calculations that begin to show how the basic structure of quantum mechanics follows from probabilistic considerations and furthermore how quantum probability differs from classical probability theory. Suppose we measure the coordinate s of a quantum particle. Assuming that quantum theory is probabilistic, this measurement should be described by a random variable Q, on the probability space (B3,p) representing the position of the particle in three-space W3 where p(r, t) is a probability density for r E B3 depending on the time parameter t. The probability that Q, has a value in the Borel set A E B(B3) at time t is given by
where dV = dxdydz and the expectation of Q, at time t is r
So far, this is just classical probability theory. However, one of the first basic axioms of quantum mechanics is the Born rule which states that p(r, t) = I$(r, t)12 where $(r, t ) is a complex-valued function called a probability amplitude. We ~ , for conclude that $(r, t) is a unit vector in the complex Hilbert space L ~ ( RdV) each fixed t. We can write the probability amplitude as $ = f i e i s l where sl(r,t) is a measurable real-valued function. We can also define the measurable real-valued function s2(r,t) by s 2 = -(1/2)lnp so that fl = e-'=. Defining the complexvalued function s = sl is2 we obtain the eikonal form = eis. The function s 2
+
+
Quantum Probability
123
is directly related to the probability density p and is easily computed. However, the function 31, which is peculiar to quantum mechanics, is completely arbitrary unless the theory is developed further. We now show that the Heisenberg uncertainty principle essentially follows from the Born rule. We assume that p, s1,s2 are differentiable functions. Since p is a probability density, integrating by parts gives
lim px = 0 we obtain
Sx
dV = -1. Applying Schwarz's inequality and assuming that the integrals exist, we have
Under the reasonable assumption that
x+&m
To simplify the second integral on the right side of (1) we have
Since --
dx
dx
we obtain
Applying (2) and (3) we have
Substituting (4) into (1) gives
Now
(2) ( 2 )(2)
=i
so we conclude from (5) that
s2
l Za$l 2
2
= e2s2
1Ek1
Stan Gudder
124
Equation (6) is equivalent to the uncertainty principle which states that
where ti is a constant determined by experiment (Planck's constant). Assuming that p is symmetric so that Et(Q,) = 0 we conclude that the variance of Q, is
l2
Interpreting J 1-ih d V as the variance of a momentum measurement Px in the x-direction, (7) gives
The uncertainty principle (8) is a statistical inequality and in the process of o b taining (8) we have derived the momentum operator -ih& using probabilistic methods. The fact that p is a function of t is a concept that is usually not present in classical probability theory and is due to the motion of the particle in space. Information about the motion of the system can be described by the function sl. Using the notation XI = x, xz = y, xs = z, we define the probability velocity vector
where m is the mass of the particle. The change of probability in time is determined by the probability density current jk = puk, k = 1,2,3. The equation for jk is analogous to the expression for the density current in fluid dynamics. We then obtain
Since
+=fi
eisl
and
+*
=
we conclude that
Since jk and p are real-valued functions, taking the real part gives
Quantum Probability
125
The existence of a nonzero jk depends on the fact that the probability amplitude I) is complex-valued. This is a feature of quantum mechanics that is not present in classical probability theory. Notice that jk can be written in terms of the momentum operators 1 j k = g ($*PXkI) - +PXk$*) which further indicates a relation between jk and the motion of the particle. The previous calculations suggest that the state of a quantum system is r e p resented by a unit vector $ in a Hilbert space and that position and momentum observables in the x-coordinate are represented by the self-adjoint operators
Motivated by these concrete calculations, the next section establishes the notation and definitions of a mathematical framework for quantum probability. 3 NOTATION AND DEFINITIONS
Let H be a complex Hilbert space that represents the state space of a quantum system S. The set of effects E(H) for S is the set of operators on H satisfying 0 5 A 5 I. More precisely, A E E(H) if and only if 0 5 (Ax, x) 5 (x, x) for all x E H. Effects represent yes-no measurements that may be unsharp (imprecise, fuzzy). F'rom a probabilistic viewpoint, effects can be thought of as fuzzy quantum events. It is interesting that many of the important classes of quantum operators are given by subsets of E(H). For example, sharp yes-no measurements are represented by the set of projection operators P(H) &(H). In traditional quantum mechanics projections correspond to (sharp) quantum events. A state for S is represented by an operator W E E(H) satisfying tr(W) = 1. We call W a density operator and denote the set of density operators by D(H). The density operators correspond to the probability measures of classical probability theory. The pure states of S are given by D(H) n P(H). A more general measurement (not just twevalued) is represented by a positive operator-valued (POV) or effect-valued measure X : B(R) -+ E(H) [Busch et al., 1995; Busch et al., 1991; Davies, 19761. That is X(B) = I and X(UAi) = C X ( A i ) for Ai f~ A, = 0, i # j, and convergence of the summation is in the strong operator topology. In this case, X(A) represents the effect observed when the measurement X has a value in the Bore1 set A. A projection-valued (PV) measure X : B(R) + P ( H ) corresponds to a sharp measurement and by the spectral theorem gives a single self-adjoint operator called an observable. In this work we shall mainly consider discrete measurements which are given by a countable set {Ai} G E(H) such that C Ai = I. Then Ai corresponds to the effect observed when the measurement results in outcome i. For A E E(H), the negation of A is defined by A' = I - A. Of course, A' E &(H) and if P E P ( H ) then P' E P(H). For A, B E E(H), if A B 5 I we
+
Stan Gudder
126
+
define A @ B = A B. Then A @ B is defined if and only if A 5 B'. Roughly speaking, A@B corresponds to a parallel measurement of A and B. The algebraic system (E(H), @, 0, I) forms an effect algebra. Effect algebras are important in i j PulmannovB, 2000; foundational studies of quantum mechanics [ ~ v u r e ~ e n s kand Foulis and Bennett, 1994; Giuntini and Greuling, 1989; Gudder and Greechie, 20021. An orthoposet is an algebraic system (P, 0 , l ) where (P, <,0,1) is a bounded partially ordered set and ': P + P is an orthocomplementation which satisfies a" = a, a 5 b implies b' 5 a' and a A a' = 0. An orthoposet P is orthomodular if a 5 b' implies that aV b exists and a 5 b' implies that b = aV (bA a'). It is well known that (P(H), I,',0, I) forms an orthomodular lattice [Beltrametti and Cassinelli, 19811. It is instructive to notice the analogy between our previous concepts and those of a fuzzy set system [0, 1IY.An effect corresponds to a fuzzy set in [0, 1IYand a projection corresponds to a subset of Y. Thus, £(H) corresponds to a noncommutative fuzzy set theory and P(H) corresponds to a noncommutative set theory. For W E D(H) we can think of (£(H), W) as a noncommutative fuzzy probability space. A measurement in our framework is a noncommutative analog of a fuzzy random variable.
s,',
4 PROBABILITY AND CONDITIONAL PROBABILITY One of the main axioms of quantum mechanics says that the probability that the quantum event P E P ( H ) occurs when the system S is in state W E D(H) is
We generalize (1) by postulating that the probability that A E E(H) is observed (has value yes) when the system is in state W E D(H) is
In particular, for a discrete measurement X = {Ai), the probability that X results in outcome i is
Another axiom of quantum mechanics says that if the initial state of S is W E D(H) and event P E P(H) occurs then the final state is
assuming that tr(WP) # 0. This axiom is called the projection postulate. Now the projection postulate is somewhat controversial and we shall take the viewpoint that it is valid for certain ideal measurements which, in the sequel, we assume are operative. We now give a heuristic motivation for (4) that will be useful when we generalize it to the fuzzy case.
Quantum Probability
127
Let us visualize P E P(H) as a filter for particle beams and suppose the incoming beam is in the pure state x E H , llxll = 1. After the beam impinges the filter P the outgoing beam is in the unnormalized state Px. Using Dirac notation, the incoming state is given by the density operator Win = Ix)(xl and the unnormalized outgoing state becomes
Moreover, the probability that a particle is transmitted becomes, by (1)
Since mixed states are convex combiiations of pure states, we can assume that (5) and (6) hold for any Win E D(H). Moreover, normalizing (5) gives
which is (4). Now suppose that A E &(H) is an imprecise filter for particle beams and as before the incoming beam is in the pure state x. Since A is unsharp we cannot assume that after the beam impinges A the outgoing beam is in the unnormalized state Ax. However, we do assume that the outgoing beam is in the unnormalized state Cx where C is a positive operator depending on A. As before the unnormalized outgoing state becomes
and the probability that a particle is transmitted becomes (8) PW,(A) = tr(CWinC) Applying (2) and (8) gives
Since (9) holds for all Win E D ( H ) we conclude that C2 = A SO C = All2 the unique positive square root of A. Applying (7),the normalized outgoing state is ~ 1 / 2 ~ ~ ~ ~ 1 / 2 Wout =
tr (WinA)
Motivated by the previous heuristic argument we postulate that if the initial state is W and effect A is observed then the final state is
For readers who object to this argument we may regard (10) as a postulate that only applies to certain ideal measuring apparatuses. Now suppose a discrete measurement X = {Ai), Ai E &(H), is performed. If outcome i occurs then by (10) the post-measurement state is
128
Stan Gudder
If X is performed but the outcome is not observed, the post-measurement state becomes
Notice that (12) is a consequence of (11) because Waft,,should be a convex combination of the states in (11) with coefficients pw (Ai). Observe that Waft,,is indeed a state because
For A, B E &(H) the conditional probability that B is observed given that A is observed in the state W is by (10)
We then have that (13) P W ( A ' / ~ B A ~ /= ~ )PW(A)PW(B I A)
Equation (13) reminds us of the classical formula
so A 1 / 2 ~ A 1 / 2is analogous to an intersection A n B . We use the notation A o B = All2BA'/~ and unlike A n B we see that A o B # B O A in general. In fact, Ao B is the sequential product of A and B in which A is measured first and B is second. That A o B # B o A in general is due to quantum interference. For example, let A and B be polarization filters in planes perpendicular to a photon beam, where A polarizes vertically and B at a 45' angle. If the incoming beam is prepared in a state of horizontal polarization, then A o B transmits no particles, while B o A will transmit particles so A o B # B o A. Notice that A o B E &(H) because
for all x E H. The operation A @ B describes a parallel combination of A and B while A o B = A ' / ~ B A ' / ~ describes a series combination in which A is measured first and B second. We have seen that the probability law
Quantum Probability
129
holds for all A, B E E(H), W E D(H). Now let X = {Ai), Ai E E(H), be a discrete measurement. The law of total probability would say that for any B E E(H)
If this law holds for all W E D(H), then it follows that
We call (14) the quantum law of total probability. In general, this law (14) does not hold. If AB = BA we say that A and B are compatible. Compatible effects have classical properties relative to each other. For example, if BAi = Ai B for all i, then (14) holds. It can be shown that (14) does not imply that B is compatible with all Ai [Arias, 19921. Compatible effects are sometimes called simultaneously measurable. The next result gives sufficient conditions under which h Singh, 1998; the quantum law of total probability implies compatibility [ ~ u s c and Gudder and Nagy, 20011. THEOREM 1. Equation (14) implies BAi = AiB for all i if any of the following conditions hold: (a) i = 1,2. (b) dim H < oo. (c) B has pure point spectrum that can be totally ordered in decreasing order. Equation (14) that B = C A i o B can also be interpreted as saying that B is not disturbed by the measurement X = {Ai). This suggests an application to axiomatic quantum field theory. Suppose the measurement X = {Ai) is performed in a bounded spacetime region Al and B E E(H) is performed in another spacetime region A2 that is spacelike separated from A1. According to Einstein causality, the measurement in Al should not disturb B so B = C A i o B. But as we said earlier this does not imply that BAi = AiB for all i. Thus, the axiom of local commutativity does not follow from Einstein causality. This indicates that the axiom of local commutativity may be too strong and should be replaced by a weaker axiom.
5 INDEPENDENCE Independence is one of the most important concepts in classical probability theory. However, it does not seem to be well developed in quantum probability theory. We say that A, B E E(H) are independent in the state W E D(H) if pw(A o B) = pw (A)pw (B). By (13) this is equivalent to pw ( B I A) = pw (B) whenever Pw(A) # 0. We now give a simple example in which
Recall that a pure state is a one-dimensional projection P, onto the subspace spanned by a unit vector z. For the pure state W = P, we have that pw(A)
= tr(WA) =
(Ax,x)
Stan Gudder
130
Notice that A, B E E(H) are independent in the pure state W = P, if (A o Bx, x) = (Ax, x) (Bx, x) For our example, let A, B E P ( C 2 )be the projections
and let x = (1,O) E C2. Then
and
Since (Ax, x) = 1 and (Bx, a) = 112 we have that
1 (A o Bx, x) = -(Ax, x) = (Ax, x) (Bx, x) 2 but
1 # (Bx, x) (Ax, x) 2 This example shows that unlike the classical case, independence is not a symmetric relation. However, at the intuitive level this is not completely surprising. For example, my heart is independent of my little finger but my little finger is not independent of my heart. Recall that two bounded random variables f and g are uncorrelated relative t o a probability measure p if S f g d p = S f d p S g dp. Of course, two independent random variables are uncorrelated. The next theorem is a classical result of probability theory.
( B o Ax, x)
= - (Bx, x)
THEOREM 2. Two bounded random variables f , g are uncorrelated relative to every probability measure on their sample space if and only if f or g is constant. We now generalize Theorem 2 to fuzzy quantum probability theory [Gudder and Nagy, 200i] THEOREM 3. For A, B E &(H) the following statements are equivalent. (a) A and B are independent in every state W E Z)(H). (b) A and B are independent in every pure state in D(H). (c) A = cI or B = c I for some 0 5 c 5 1. We now give some examples of independent effects. Any two effects of the form A €31I,I @3 B E I ( H @ H ) are independent in a pure tensor state x @ y. If x is a unit eigenvector of A E &(H) then A and B are independent in the pure state P,
Quantum Probability
131
for every B E & ( H ) . The next result generalizes this situation [Gudder and Nagy, 20011. THEOREM 4. The following statements are equivalent. (a) pw(A) = 1. (b) WA = AW = W. (c) pw (A o B) = pw(B) for every B E &(H). Notice that Theorem 4 says that if pw(A) = 1, then A and B are independent in W for every B E &(H). 6 PROPERTIES OF THE SEQUENTIAL PRODUCT
This section summarizes some of the properties of the sequential product. For proofs we refer the reader to u udder and Nagy, 20011. THEOREM 5. Let A, B E &(H). (a) If A o B = B o A then AB = BA. (b) If A o B E P ( H ) then AB = BA. Theorem 5(a) says that if the measurement order of A and B is irrelevant, then A and B are compatible. Of course, the converse is trivial. Theorem 5(b) says that even if A and B are both sharp, their sequential product is not sharp unless A and B are compatible. To give the reader a flavor of the subject we now present the simple proof of Theorem 5(a). Suppose that A o B = B o A. We then have that ( ~ 1 / 2 ~ 1 /(2~)1 / 2 ~ 1 / = 2 )( ~ 1 / 2 ~ 1 /(2~)1 / 2 ~ 1 / 2 ) This shows that the operators M = and N = are normal. Letting T = A'/' we conclude that MT = T N . It follows from Fuglede's theorem [Rudin, 19911 that M*T = T N * . Hence, B'/'A = AB'/' and we conclude that BA = AB. It is clear that the distributive law
always holds. However, as we have seen in Section 5 in general we have that
The next result shows that the associative law need not hold. THEOREM 6 . For A, B E &(H) we have that A o ( B o C) = (A o B) o C for every C E &(H) if and only if AB = BA. The fact that Ao ( B o C) # (A o B) o C in general is puzzling because physically one would expect the two sides to be equal. For example, suppose A, B and C represent beam filters. This would say that if we first apply A and then B o C considered as a single filter then this would be different than first applying A o B considered as a single filter and then applying C. Mathematically this can be written as
132
Stan Gudder
For a further discussion on this point we refer the reader to u udder and Nagy, 20011. The next theorem gives even stronger results for other types of associativity. THEOREM 7. For A, B E E(H) the following statements are equivalent. (a) A o ( C O B ) = ( A o C ) o B for everyC E E(H). (b) C o ( A o B ) = ( C o A ) o B for every C EE(H). (c) A = c I or B = c I forsome0 < c < 1. The system (E(H), @, o, 0, I ) is a special case of a mathematical structure called a sequential effect algebra. This structure is important for foundational studies in quantum mechanics and will be discussed in Section 9 [Gudder and Greechie, 2002; Gudder and Nagy, 20011. Other examples of sequential effect algebras are boolean algebras and fuzzy set systems with their usual operations.
7 ALMOST SHARP EFFECTS We say that A E E(H) is almost sharp if A = P Q P = P o Q for P , Q E P ( H ) . This terminology stems from the fact that A may be obtained by measuring two sharp effects. In a sense, almost sharp effects are LLclose"to being sharp and we shall present a simple characterization of such effects. It follows from Theorem 2(b) that the set of almost sharp effects is strictly larger than P(H). Our characterization holds for the case dim(H) < m. Generalizations to dim(H) = m are possible but are a little more complicated t o state. We refer the reader to [Arias and Gudder, 20041 for generalizations and omitted proofs. We say that A E E(H) is nearly sharp if A and A' are almost sharp. For A E E(H) with dim(H) < m define the following nonnegative integers: no(A) = multiplicity of the eigenvalue 0 for A nl(A) = multiplicity of the eigenvalue 1 for A n(A) = dim(H) - no (A) - nl(A) Notice that n(A) is the sum of the multiplicities of the eigenvalues X for A satisfying 0 < X < 1. We call such eigenvalues fuzzy eigenvalues. The next theorem shows that A is almost (nearly) sharp if and only if the number of fuzzy eigenvalues is smaller than the number of sharp eigenvalues in a certain sense. For A E E(H) we denote the projection onto the range of A by PA. LEMMA 8. If A E E(H) with dim(H) A)
< m, then n(A) = dim(PAAf)= rank(PA -
Proof. By diagonalizing A we can assume without loss of generality that A has the form
Quantum Probability
where 0
< Xi < 1for i = 1 , . . .,m.
We then have that
AA' = diag (Xl(1- XI), .. . ,Xm(l - Am),0, . . . ,0) PA-A=diag(l-X1 ,..., l - X m , O ,...,0) It follows that
THEOREM 9. Let A E E(H) with dim(H) < co. (a) A i s almost sharp if and only zf n(A) 5 no(A). (b) A is nearly sharp zf and only zf n(A) 5 min {no( A ) ,nl ( A ) ) . Proof. (a) Suppose that A is almost sharp so that A = P Q P for P, Q E P(H). Since A 5 P it follows that PA5 P. Since APA = PAA = A we conclude that A = PAQPA. Letting NB be the projection onto the nullspace of B E E ( H ) , by Lemma 8 we have
n(A) = r a n k ( P ~- A) = rank (PA(I- Q)PA) 5 rank(] - Q ) = dim(NQ) 5 dii(NpAQpA) = d i m ( N ~= ) no(A) Conversely, suppose that m = n(A) 5 no(A). Without loss of generality we can represent A as a diagonal matrix (1). Let
and represent A by the block matrix
Since M 5 m(A) we can split the last block into an m x m block and an l x l block where l = %(A) - m. Let Q be the block matrix
It is easy to check that PAQPA= A and that Q E P ( H ) . The proof of (b) follows directly from (a).
Stan Gudder
134
We now consider effects that are longer sequential products of sharp effects. The fuzziness index f (A) of A E &(H) is the smallest integer n such that A has the form A = PI ...PnQPn...Pl for Q, Pi E P(H), i = 1,.. .,n. Thus, A is sharp if and only if f (A) = 0 and A is almost sharp and not sharp if and only if f (A) = 1. If no such n exists, we write f (A) = 03. THEOREM 10. For A E &(H) with dim(H) < co we have that
We now give some examples in the Hilbert space H = (C3. In &((C3)define A = diag(X1, X2, As), B = diag(X1, X2, 0), C = diag(X1, 1, O), D = diag(X1, 0,O) where 0 < X i < 1. i = 1 , 2 , 3 . Wehavethat f(A) = c o , f ( B ) = 2 , f(C) = f(D) = 1. Notice that C is nearly sharp and D is almost sharp but not nearly sharp. We now write C = P Q P , P, Q E P(H).
The sets of almost sharp effects and nearly sharp effects have very weak structures. For example, C = diag(X1, 1,O) is nearly sharp, but XC is not even almost sharp for 0 < X < 1. Also, if A and B are nearly sharp and A B E &(H), then A + B may not be almost sharp. However, if A is almost sharp, then An is almost sharp for all n E N. The next result gives the structure of the set &(H),, of nearly sharp elements in &(H) when dim(H) < XI. This result also holds in the von Neumann algebra setting [Arias and Gudder, 20041.
+
THEOREM 11. If dim(H)
< co,
then (&(H),,,
<, ', 0, I ) is an orthoposet.
Proof. All the properties of an orthoposet are clear except for the condition AAA' = 0 for every A E E(H),, . To verlfy this condition suppose that B E &(H),, with B 5 A and B 5 A'. Then
Since (112)' = 112, it follows that 112 5 B' so that N B ~ = 0. Hence, no(Bf) = 0 and by Lemma 8 and Theorem 9 we conclude that
Hence, BB' = 0 so that B E P(H). Since B that A A A' = 0.
< 112, we have that B = 0. It follows
rn
Quantum Probability
8 NON-DISTURBANCE FOR FUZZY QUANTUM MEASUREMENTS K. A. Kirkpatrick [Kirkpatrick, 20041 has recently discussed three ways of describ ing non-disturbance between quantum measurements. The first two are due to , and KirkLiiders [ ~ u s c hand Singh, 19981 and the third to Davies [ ~ a v i e s19761 patrick [Kirkpatrick, 20031. Letting X and Y be two quantum measurements, the three non-disturbance criteria are given roughly as follows. (1) The probability of an established value of Y is unchanged by the later occurrence of a value of X. (2) The probability of occurrence of a Y value is unchanged by a preceding execution of X. (3) If p and q are X and Y values, respectively, then the probability of p followed by q coincides with the probability of q followed by p. We said that the criteria are given roughly because the English language can be imprecise and ambiguous. We shall later translate these criteria into precise mathematical language and prove results about them. It is appropriate that these criteria are phased in terms of probabilities because statistical results are what are observed in the laboratory. Kirkpatrick showed that (I), (2) and (3) are equivalent to the compatibility (commutativity) of X and Y and hence are equivalent to each other. However, Kirkpatrick only considered sharp quantum measurements which are described by projection-valued measures. In the present work we shall generalize his results t o measurements that may be unsharp (or fuzzy) and these are described by positive operator-valued measures. Unsharp measurements are quite important in quantum measurement theory [Busch et al., 1995; Busch et al., 1991; Davies, 19761 and in applications such as quantum computation and quantum information [Nielsen and Chuang, 20001. Unlike the sharp case, we shall show that (I), (2) and (3) are not equivalent for general measurements. Only Criterion (3) is equivalent to the compatibility of X and Y. Although Criterion (1) implies compatibility it is not appropriate for the general case because it also implies that Y is sharp. Compatibility implies (2) but the converse does not hold. Although they are not explicitly symmetric relative to X and Y, the three criteria are implicitly symmetric in the sharp case because they are equivalent to the symmetric relation of compatibility. In the general fuzzy case, only (3) is symmetric in X and Y. This further justifies Kirkpatrick's choice of (3) for his discussion of noncompatibility in classical probability theory [Kirkpatrick, 20041. As in Kirkpatrick [Kirkpatrick, 20041 and Liiders [Busch and Singh, 19981, we shall only consider discrete quantum measurements. In the sequel we shall identify a (discrete) measurement with its set of measurement operators {Ai} without specifying its values. Two measurements {Ai} and {Bj} are compatible if their measurement operators are compatible, AiBj = BjAi for all i and j . We now translate the three non-disturbance criteria into
Stan Gudder
136
mathematical forms and then draw conclusions concerning compatibility of the measurements. If X = { A i } and Y = { B j } are measurements, then the mathematical form of Criterion (1) for non-disturbance becomes
for all j, lc and W . Equation (1) says that if a Y-measurement results in outcome j and a later X-measurement results in outcome k, then a subsequent Ymeasurement will again result in outcome j with certainty in state W . Our first result shows that (1) holds if and only if X and Y are compatible and Y is sharp.
THEOREM 12. pw(Bj I Bj o Ak) = 1 for every j, k and W if and only if AiBj BjAi and Bi E P ( H ) for every i and j.
=
Proof. Since conditional probability is countably additive in its first argument, we have that (1) implies
(2) PW (Bi I Bj 0 Ak) = 0 for i # j . Applying the definition of conditional probability (2) becomes
' ' )can write (3) as for all i # j whenever t r ( ~ k ~ i ~ ' ~#~0.i We
Now (4) holds even if ~ ~ ( A ~ B ~ ' ' w B = ~ " )0 because in this case
A ~ ~ ' B ~ ~ ' W B ~ '= ' A0.~Since ~ ' (4) holds for every W we conclude that
for all i # j . We then obtain
Hence, B : ~ ' A ~ " B ~= ~ '0 so that B i ~ i l ' B j= 0 for all i # j . Summing over i # j and applying C Bi = I we have
Thus,
A;/'B~= B ~ A ; / ' B= ~ ( ~ ~ ~ : l= ~B g~ k112 A ~ ) * We conclude that AkBj = BjAk for all j and k. Now (5) becomes
Quantum Probability
for all i # j . Summing (6) over k gives B;I2BiB;I2 = 0 for all i summing over i # j we have that
Hence, B j
= B;
# j and now
so Bj E P ( H ) for all j. The converse is straightforward.
It is easy to see that Criterion (1) does not imply that Ai E P ( H ) so X need not be sharp. This shows that Criterion (1) is not symmetric in X and Y. The mathematical form of Criterion (2) becomes
for every j and W. Equation (7) says the probability that a Y-measurement results in outcome j coincides with the sum of the probabilities that an X-measurement results in its possible outcomes and a later Y-measurement results in outcome j . THEOREM 13. If AiBj W.
= BjAi
for every i and j then (7) holds for every j and
Proof. In terms of traces, (7) becomes
If AiBj = BjAi, then the right side of (8) becomes
The converse of Theorem 13 does not hold except for some special cases. For example, the converse holds when dim H < ca or when X has just two measurement operators. In general, suppose that (7) holds for every j and W. Then by ( 8 ) we have that i
for every j . Now it is shown in [Arias, 19921 that for any infinite dimensional Hilbert space H there exists a measurement {Ai E E ( H ) : 1 5 i 5 5) and a B E E ( H ) such that B = C A:/~BA:/~ and yet BAi # AiB for all i. Letting X = {Ai) and Y = {B, I - B ) we see that X and Y satisfy Criterion (2) (Equation ( 7 ) )but are not compatible. This example also shows that Criterion (2) is not symmetric in X and Y. Indeed, writing Y = {B1, B2) where B1 = B, B2 = I - B, it follows from the work in [Busch and Singh, 1998; Gudder and Nagy, 20011 that Ai # Zj B:/~A~B:/~ for some 1 5 i 5 5. Finally, the mathematical form of Criterion (3) becomes
138
Stan Gudder
for all i,j and W. By Theorem 5 Criterion (3) for non-disturbance of measurements is equivalent to their compatibility. This gives further justification for Kirkpatrick's choice of this criterion for his study of noncompatibility in classical prob ability theory [ ~ i r k ~ a t r i c20041. k, We have seen that Criterion (3) gives the most appropriate definition of nondisturbance for measurements. Following Kirkpatrick [Kirkpatrick, 2003; Kirkpatrick, 20041, we now briefly show that there are even disturbing measurements in classical probability theory. Suppose we have a deck of ordinary playing cards and we consider two measurements, FACE and SUIT. For the FACE measurement we draw a card at random and observe its face value, ace, two, . . ., king and for the SUIT measurement we draw a card at random and observe its suit, club, diamond, heart or spade. Let K be the value "king" for FACE and H the value "heart" for SUIT. Most of the usual probability problems for cards are one of two kinds, we either always replace the chosen card or always discard the chosen card. In either of these two cases, two card draws are independent. We then have for any standard probability distribution p that P(K 0 H ) = P(K)P(H) = P(H0 K ) Of course, this holds for any values of FACE and SUIT so these two measurements do not disturb each other in these two cases for the usual probability distributions. We now consider the situation in which we draw a card at random, replace it if its suit is spades and discard it otherwise. For simplicity, suppose we have a deck with just four cards, the kings and queens of spades and hearts K H , KS, QH, QS. Letting p be the uniform distribution, we obtain
and
In accordance with Criterion (3), FACE and SUIT disturb each other. A strange property of this example is that the measurement SUIT disturbs itself and this does not happen for sharp quantum measurements. To verify this disturbance, we have 1 2 1 p(HoS)=p(H)p(SI H ) = ? - ? = 3 and 1 1 1 p(S0H) =p(S)p(HIS)=- - - = 2 2 4
Quantum Probability
139
Another problem with the previous example is that it does not have the important property of repeatability possessed by sharp quantum measurements [Kirkpatrick, 2003; Kirkpatrick, 20041. That is, if a sharp measurement is immediately repeated then the same outcome should be obtained. We now give an example that satisfies repeatability. We again have the two measurements FACE and SUIT. But now if a FACE measurement is performed and value F is obtained then all cards with other face values are discarded and we next draw from a deck all of whose cards have face value F. A similar procedure is followed for a SUIT measurement. For simplicity we assume that the deck contains only six cards, K S , QS, K H , QH, K D , QD and that p is the uniform probability distribution. We shall consider three preparation states depending on the cards available in the initial drawing. These states can be prepared by performing a sequence of measurements. The first two states may be considered to be "mixed states" and the third a "pure state." We first start with all six cards. We then obtain
and
We next start with KS, QS, K H , QH. We now obtain
and
Finally, we start with KS, QS. We now obtain
and p(HoK)=O We again conclude that FACE and SUIT disturb each other.
Stan Gudder
9 SEQUENTIAL EFFECT ALGEBRAS This section discusses a framework that unifies and generalizes our previous prob abilistic structures. The framework is obtained by abstracting the properties of the orthogonal sum @ and the sequential product o. If @ is a partial binary operation, we write a I b if a @ b is defined. An effect algebra [Dvure~enskijand Pulmannovh, 2000; Foulis and Bennett, 19941 is a system (E, O , 1 , @) where O , 1 are distinct elements of E and @ is a partial binary operation on E that satisfies the following conditions. (El) I f a I b , t h e n b I a a n d b @ a = a @ b . (E2) If a I b and c I(a@b),then b I c, a I (b@c)and a@(b@c)= (a@b)@c.
(E3) For every a E E there exists a unique a' E E such that a I a' and a@af=l. (E4) If a 1 1 , then a = 0. We call the elements of E effects and whenever we write a @b we are implicitly assuming that a I b. We define a b if there exists a c E E such that a @c = b. If such a c E E exists, then it is unique and we write c = b e a. It can be shown that (E, 5,') is a partially ordered set with 0 5 a 5 1for all a E E, a" = a, and a 5 b implies b' a'. Moreover, we have a I b if and only if a b'. If a I a we call a an isotropic element and when 0 is the only isotropic element of E, then we call E an orthoalgebra. An element a E E is s h a r p if a A a' = 0 and we denote the set of sharp elements by Es. It is easy to show that E is an orthoalgebra if and only if E = Es. Also, O , 1 E Es and a E Es if and only if a' E Es. If E and F are effect algebras, we say that 4: E -,F is additive if a Ib implies $(a) I +(b) and 4(a@b) = 4(a)@qj(b). If 4: E + F is additive and 4(1) = 1,then 4 is a morphism. If 4 : E + F is a morphism and 4(a) I 4(b) implies that a Ib, then 4 is a monomorphism. A surjective monomorphism is an isomorphism. It is easy to see that a morphism 4 is an isomorphism if and only if 4 is bijective and 4-I is a morphism. A s t a t e on E is a morphism s : E --t [0, 11. We interpret s(a) as the probability that the effect a is observed (has answer yes) when the system is in state s. We denoted the set of states on E by R(E). An effect algebra E is a a-effect algebra if for any increasing sequence a1 5 a2 5 -.. we have Vai exists in E. A morphism 4 : E -t F between a-effect algebras is a a-morphism if whenever a1 a1 we have q5(Vai) = V+(Q). Strictly speaking, in the sequel we should consider a-effect algebras and a-morphisms because our probabilistic structures satisfy the axioms of a a-effect algebra. However, to avoid technicalities that the interested reader can easily fill in, we shall only consider effect algebras and their morphisms. We now endow an effect algebra with additional structure by providing it with a sequential product. For a binary operation o, if a o b = b o a we write a I b. A sequential effect algebra (SEA) is a system (E, O , 1 , @, o) where (E, O,1, @)
<
<
<
< <
Quantum Probability
141
is an effect algebra and o: E x E + E is a binary operation that satisfies the following conditions. (Sl) b H a o b is additive for all a E E. (S2) 1o a
=a
for all a E E.
(S3) If a o b = 0, then a I b. (S4) If a I b, then a I b' and a o (b o c) = (a o b) o c for all c E E.
We call an operation that satisfies (S1)-(S5) a sequential product on E. If a I b for all a, b E E, we call E a commutative SEA. We now present some examples of SEA'S including our previously studied probabilistic structures.
Example 1. For a Boolean algebra L3, define a Ib if a A b = 0 and in this case a @ b = a V b. Then (B,0,1, @) is an effect algebra that happens to be an orthoalgebra. In particular, if X # 0, then (2X,0, X, @) is an effect algebra. Defining a o b = a A b, (B,0,1, @, o) becomes a SEA. We shall show later that o is unique.
+
Example 2. For [O,1] R, define a I b if a b 5 1 and in this case a @ b = a b. Then ([0, 1],0,1,@) is an effect algebra. The only sharp elements are 0 and 1. Defining a o b = ab, ([O,1],0,1,@, o) becomes a SEA. We shall show later that o is unique.
+
Example 3. Let X # 0 and let 3C [0, 1IX.We call 3 a fuzzy set system on X if the following conditions hold. (i) The functions O , 1 E 3. (ii) If f E 3,then 1- f E 3.
(ii) If f , g ~ T w i t hf + g 5 1, then f + g € 3 . (iv) If f ,g E 3,then f g E 3. In this case, ( 3 , 0,1, @) is an effect algebra with f @ g = f + g whenever f - g 5 1. If 3= [0, 1IXwe call 3 a full fuzzy set system. The sharp elements of a fuzzy set system 3 are the characteristic functions in 3 which can be identified with the (sharp) subsets of X in 3. Indeed, if f E 3 is sharp, then f (1 - f ) 5 f , 1 - f implies that f (1 - f ) = 0. Hence, i f f (x) # 0,then f (x) = 1. A fuzzy set system 3 is a SEA under the operation f o g = fg. We shall show later that if .F is full, then o is unique.
Example 4. Let E(7-l) be the set of quantum effects on the Hilbert space 'FI. For A, B E E(7-l) we define A I B if A + B E &('FI) and in this case 0, I,@) is an effect algebra. The sharp elements of A €9 B = A B. Then (&(a), I(%) are the set of projection operators P(7-l)on H . Our previous work shows
+
142
Stan Gudder
that E(7-l) is a SEA under the operation A o B = A~/'BA'/'. Unlike the previous three examples, E(7-l) is a noncommutative SEA. We do not know whether o is unique. However, o is unique if it satisfies some additional conditions. There are many other examples of SEA's but these four are the important ones for our purposes. We now observe that a SEA gives a general framework for noncommutative probability. If s E Q(E) is a state of E then s gives a (finitely additive) probability measure on E. A morphism h: B(W) t E corresponds to an observable and the morphism s o h : B(W) t [O,1] gives the distribution of h in the state s. We can now define the expectation and variance of h in the usual way. If a E E with s(a) # 0 we can define the conditional probability of b E E given a as s(b I a) = s ( a o b)/s(a). Notice that b I-+ s(. I a) is a state on E so we can develop a theory of conditional probabilities on E. We now state some basic results about a SEA E. The proofs are not difficult and may be found in [Gudder and Greechie, 20021. LEMMA14. (i) a o O = O o a = O a n d a o l = l o a = a f o r a E E . (ii) a o b s a for all a, b E E. (iii) If a 5 b, then c o a 5 c o b for all c E E. (iv) The following statements are equivalent. (a) a 6 Es. (b) a o a' = 0. (c) a o a = a. LEMMA 15. (i) If a o b = 0 then a Ib. (ii) For a E El b E Es, a o b = 0 if and o n l y i f a l b . (iii) F o r a , b ~ Es w i t h a I b we h a v e a @ b Es. ~ It follows from Lemma 15(iii) that Es is a sub-effect algebra of E that is an orthoalgebra. We have seen previously that in general, if a, b E Es then a o b $! Es so Es is not a sub-SEA of E . THEOREM16. L e t a E E a n d b E E s . (i) a I b i f a n d o n l y i f a o b = b o a = a and b 5. a if and only if a o b = b o a = b. (ii) If a I b, then a A b = a o b. (iii) If a Ib, then a @ b = a V b = (a' o b')'. We say that a, b E E coexist if there exist c, d, e E E such that c @ d @ e is defined and a = c@d, b = c@e [Busch et al., 1995; Busch et al., 19911. We say that a, b E Es are compatible if there exist mutually orthogonal elements c, d, e E Es such that a = c V d and b = c V e . THEOREM 17. (i) If a I b then a and b coexist. (ii) For a E E, b E Es, a I b if and only if a and b coexist. (iii) For a, b E Es the following statements are equivalent. (a) a I b. (b) a and b are compatible. (c) a and b coexist. It is well known that the converse of Theorem 17(i) does not hold [Gudder and Greechie, 20021. We now show that for certain important examples of SEA's, the sequential product is unique. THEOREM 18. For an eflect algebra E that is a Boolean algebra, there is a unique sequential product a o b = a A b.
Proof. Since E is a Boolean algebra, we have E = Es. For a, b E E, define c = a A b , d = a G a A b , e = b e a A b . It iseasy tocheckthat c,d,earemutually
Quantum Probability
143
orthogonal and that a = c V d and b = c V e. Hence, any two elements of E are compatible. By Theorem l7(iii) we have that a I b for every a, b E E and any rn sequential product o. It follows from Theorem 16(ii) that a o b = a A b. THEOREM 19. There i s a unique sequential product o n the effect algebra [O,1] C
R. Proof. Let o be a sequential product on [0, 11. Then for any integer n 2 1 and a E [0, 11 we have
so that a 0 ( l l n ) = (1ln)a. Also, for any integer 1 5 m 5 n we have
Hence, for any rational number r E Q n [O, 11 we have a o r = ar. Now let b E [O,1] be irrational. If r E Q n [O, 11 and b < r then by Lemma 14(iii) we obtain
Similarly, if r E Q n [O,1] and b > r, then
Since Q n [O, 11 is dense in [0, 11, we obtain a o b = ab.
1
A SEA isomorphism is an effect algebra isomorphism that preserves the sequential product. The proof of the next result is a straightforward verification. THEOREM 20. Let E, F be effect algebras and let 4: E + F be an effect algebra isomorphism. If o i s a sequential product o n E, then a * b = 9 [+-'(a) o +-'(b)] i s a sequential product on F . Moreover, ( E ,o) and (F,*) are SEA isomo7phic. COROLLARY 21. If E and F are isomorphic effect algebras and E admits a unique sequential product o, then F admits a unique sequential product. Proof. By Theorem 20, F admits a sequential product *. Let 4 : E -+ F be an effect algebra isomorphism and define -:E x E + E by a . b = 4-' [+(a)* +(b)]. By Theorem 20, . is a sequential product on E so we have a . b = a o b. Hence,
Thus, for every c, d E F we have
It follows that
* is unique.
Stan Gudder
144
Let (Ei, Oi, li,@) be a collection of effect algebras. We obtain a new effect algebra by taking the cartesian product Ej and defining ai I bi if ai Ibi for each i in which case ai @ bj = (ai CBbi). Then ( n Ei, Oi, li,a ) is an effect algebra. If each of the Ei's is a SEA, then Ei becomes a SEA with the componentwise sequential product.
n
n
n n
n
n
n n n n
THEOREM 22. Let (Ei, Oi, li,ai,oi) be SEA'S i E I. Then E = Ei admits a unique sequential product zf and only if each Ei, i E I, admits a unique sequential product.
n
Proof. If Ej admits two sequential products for some j E I, then clearly Ei admits at least two sequential products. Conversely, suppose Ei, i E I, admits a unique sequential product oi and let * be a sequential product on Ei. For j E I, let f j E Ei be defined by
n
n
Clearly, f j E Es. Let o be the sequential product on E given by (f o g)(i) = f (i) oi g(i), i = I, for any f , g E E. Since f o f j = f j o f , by Theorem 17(ii), f and f j coexist. But coexistence is independent of the sequential product so again by Theorem 17(ii), f * f j = f j * f for any f E E . It follows from Theorem 16(ii) that f * f j = f A fj. Hence,
For any f , g E E we have
Now [0, fj] given by
E is an effect algebra with greatest element f j and 4: Ej + [0,fj]
is an effect algebra isomorphism. Since Ej admits a unique sequential product, by Corollary 21, [O, fj] admits a unique sequential product. Hence, (f
* g>(j)= [(f * 9) * fjl (j) = [(f * fj) * (9 * fj)l (j) = [(f * f j ) 0 (g * fj)I (j) = (f * f d j ) O j (9 * fj)(j) = f (j)
oj ~ ( j = ) (f og)(j)
Hence, o is the unique sequential product on E.
145
Quantum Probability
COROLLARY 23. A full fuzzy set system E product.
=
[0, 1IXadmits a unique sequential
Proof. This follows from Theorem 22, because by Theorem 19, [O, 11 admits a rn unique sequential product. Whether a general fuzzy set system admits a unique sequential product is an unsolved problem. One can give examples of effect algebras that admit no sequential product and effect algebras that admit many sequential products u udder and Greechie, 20021. THEOREM 24. Let E be a SEA. For p, q E Es we have p o q E Es if and only if P l q-
Proof. If p I q it is clear that p o q E Es. Conversely, suppose that r = p o q E Es. We first show that r 5 q. Since r o q 5 r and r 5 p, we have
By Lemma 15(ii), p I(r 8 r o q). Hence,
Since r 8 r o q 5 r E Es we have that r 8 r o q = 0. Thus, r = r o q so that r o q' = 0. Again by Lemma 15(ii) we have that r 5 (q')' = q. We now show that p o q ' s q ' . S i n c e p o ( q 8 p o q ) = O we have that q e p o q < p ' s o that
Hence, p o q' 5 q'. Applying Theorem 16(i) we have that p o q I q and p o q' Since p = p o q CBp o q' we conclude that p I q.
I q.
rn
For arbitrary elements p, q E E, it is an unsolved problem whether p o q E Es implies that p I q. This result does hold for p, q E E(7f). LEMMA 25. If a o b = a, then a I b and a 5 b.
Proof. Since a o b = a we have
Hence, a o b' = 0. Thus, a I b' so that a I b. Therefore, a = a o b = b o a
5 b.
H
It is unknown whether b o a = a implies that a I b THEOREM 26. Let E be a S E A and suppose a , b E Es. (i) a o b 5 b if and only if a 1 b. (ii) a o b b if and only if a o b = b o a = b.
>
Stan Gudder
146
Proof. (i) If a I b, then a o b = b o a 5 b. Conversely, assume that a o b 5 b. We now show that a o b E Es. Since a o b 5 a, b, applying Theorem 16(i) we have a o b I a and a o b I b. Hence,
The result follows from Theorem 24. (ii) Suppose that a o b 2 b. Then since a o b I b, a o b I a as before we have ( a o b ) o ( a o b ) = [(aob) o a ] o b = ( a o b ) o b = b Taking the sequential product on the left with a gives
Since a o b E Es by Theorem 24, a I b. Hence,
The converse is trivial.
BIBLIOGRAPHY [Arias, 19921 A. Arias, A. Gheondea and S. Gudder, Fixed points of quantum operations J. Math. Phys. 43 (2002 , 5872-5881. [Arias and Gudder, 2004 A. Arias and S. Gudder, Almost sharp quantum effects, J. Math. Phys. 45 (2004), 4196-4206. [Beltrametti and Cassinelli, 19811 E. Beltrametti and G. Cassinelli, The Logic of Quantum Mechanics, Addison-Wesley, Reading, Mass., 1981. [Busch et al., 19951 P. Busch, M. Grabowski and P. J. Lahti, Operational Quantum Physics, Springer, Berlin, 1995. [Busch et al., 19911 P. Busch, P. J. Lahti and P. Middlestaedt The Quantuna Theory of Measurements, Springer, Berlin, 1991. [Busch and Singh, 19981 P. Busch and J. Singh, Liiders theorem for unsharp measurements, Phys. Lett. A 249 (1998), 10-24. [Davies, 19761 E. B. Davies, Quantum Theory of Open Systems, Academic Press, New York, 1976. [Dvureknskij and Pulmannavli, 20001 A. DvureEenskij and S. Pulmannovfi, New !&ends in Quantum Structures, Kluwer, Dordrecht, 2000. [Foulis and Bennett, 19941 D. Foulis and M. K. Bennett, Effect algebras and unsharp quantum logics, Found. Phys. 24 (1994), 1325-1346. [Giuntini and Greuling, 19891 R. Giuntini and H. Greuling, Toward a formal language for unsharp properties, Found. Phys. 19 (1989), 931-945. [Gudder and Greechie, 20021 S. Gudder and R. Greechie, Sequential products on effect algebras, Rep. Math. Phys. 49 (2002), 872-111. [Gudder and Nagy, 20011 S. Gudder and G. Nagy, Sequential quantum measurements, J. Math. Phys. 42 (2001), 5212-5222. [Kirkpatrick, 20031 K. A. Kirkpatrick, "Quantal" behavior in classical probability, Found. Phys. Lett. 16 (2003), 199-224. [Kirkpatrick, 20041 K. A. Kirkpatrick, Compatibility and probability, amiv: quant-ph/0403021, 2004. [Nielsen and Chuang, 20001 M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Canabridge University Press, Cambridge, 2000. [Rudin, 19911 W. Rudin, Functional Analysis McGraw-Hill, New York, 1991.
1
HANDBOOK OF QUANTUM LOGIC AND QUANTUM STRUCTURES: QUANTUM STRUCTURES Edited by K. Engesser, D. M. Gabbay and D. Lehmann O 2007 Elsevier B.V. All rights reserved
147
QUANTUM LOGICS AS UNDERLYING STRUCTURES OF GENERALIZED PROBABILITY THEORY
Pave1 Pt &k, Sylvia Pulmannovb
1 INTRODUCTION
As convincingly argued in [ ~ a c k e1963; ~ , Beltrametti and Cassinelli, 1981; Gudder, 1979; Varadarajan, 1985; Sarymsakov et al., 1983; Svozil, 19981, etc., one of the structures especially suited for considering a general (quantum) probability theory is that of a countably complete orthomodular poset (a "quantum logic", a term having its origin in the seminal paper by Birkhoff and von Neumann [~irkhoffand von Neumann, 19361). From the point of view of theoretical physics, this structure seems to be well suited for dealing with the phenomenon of noncompatibility. From the purely mathematical point of view, it is challenging too because it permits a uniform generalization of probability theory on both projection lattices and Boolean algebras. The conceptual generality inherent in the quantum logic approach opens a new field for interesting combinatorial and measure-theoretic considerations which, in turn, may enrich the study of quantum theory by which they were motivated. (In the short appendices we consider the uncertainty relations and the Bell inequalities as matters related to quantum stochastics.) This chapter adds some novelties - both in the sense of updating and in style - to the stochastic results published in the book [ P ~and B PulmannovL, 19911. Conceptually, the treatment presented here to a certain extent overlaps with the book cited, of course. Our intention was to make this presentation as self contained as possible. In this, however, we had to make a compromise between size and readability. The reader will see that there are some important technical results which we use in our considerations and for which we refer him to other sources. Certain important and interesting topics related to quantum probability theory such as e.g. quantum measurements [ ~ u s c het al., 19911 (see also [Pulrnannovb, 1994bl) or unsharp quantum logics [Dalla Chiara et al., 20041 are not included, and concerning the probability theory on projection lattices the reader is referred to [Hamhalter, 20031.
Pave1 Ptik, Sylvia Pulmannovi
2 BASIC DEFINITIONS AND FACTS In this section, we introduce basic definitions and results which we will need in the sequel. The emphasis is on the intrinsic properties of quantum logics and on the compatibility relation. More details can be found in [Beran, 1985; Beltrametti and Cassinelli, 1981; Kalmbach, 1983; Piron, 1976; PtLk and PulmannovL, 1991; RCdei, 1998; Varadarajan, 19851. DEFINITION 1. A partially ordered set (L, 5) endowed with a unary operation ' : L + L is called a quantum logic, or simply a logic, if (i) there exists a greatest element, 1, in L; (ii) a 5 b
=+
a' 2 b' (a, b E L);
(iii) a" = a (a E L);
(iv) a V a' = 1 (a E L); (v) for every sequence (ai)i of elements of L such that ai the supremum Vi ai exists in L;
< a$ whenever i # j
<
b (a, b E L) then there is a c E L with the properties c 5 a' and (vi) if a b=aVc.
In the above definition, the symbols V and A denote supremum and infimum in L respectively, if they exist. Property (vi) is called the orthomodular law. A quantum logic is alternatively called an orthomodular a-poset. If property (v) holds only for finite sequences, L is called an orthomodular poset. Property (ii) implies the existence of a smallest element of L, which we denote by 0. Obviously, 0 = 1'. It may be noted that (iv) follows from (vi) and, also, (v) for finite sequences follows from (vi), but economy in our axiomatic setup is not our aim. Property (ii) implies that the de Morgan laws hold in L : if Vai exists in L, then ~ a exists : in L and the equality (Vai)' = Aai holds true. DEFINITION 2. Two elements a, b E L are said to be orthogonal (written a Ib) if a b'.
<
DEFINITION 3. Two elements a, b E L are said to be compatible (written a * b) if there are pairwise orthogonal elements a l l bl, c in L such that a = a1 V c and b = bl V C. LEMMA 4. If a I b (a, b E L), then (a V b) A a' = b. Proof. If a I b, then (a V b) A a' exists, in view of a I (a V b)' and (a V (a V b)')' = a' A (a V b). Clearly, b (a V b) A a'. The orthomodularity implies that (a V b) A a' = b V d, where d I b. From d 5 (a V b) A a' a' we infer that d a' A b' = (a V b)', but this together with d a V b yields d = 0. rn
<
<
LEMMA 5. For any a, b E L,
<
<
Quantum Logics as Underlying Structures of Generalized Probability Theory
(i) i f a Ib, then a
o b;
(ii) if a 5 b, then a
o b;
149
(iii) i f a i+ b, then { a , at, b, b') is a set of pairwise compatible elements.
.
Proof. I t suffices t o prove that a o b implies at * b. Let a * b, then a = a1 V c, i b = bl V c , where a l , bl, c are pairwise orthogonal. T h e n b y Lemma 4, ( ab l~) ~ b = a, hence a' = (a' A b:) V bl, and therefore the elements c, bl, ( a V bl)' are pairwise orthogonal.
L E M M A 6 . If a o b, then a V b and a A b exist in L and a A b = c, a V b = a1 V bl V c, where a l , bl, c are the mutually orthogonal elements in the definition of compatibility. Moreover, a1 = a A b', bl = b A a'.
Proof. B y orthogonality, a1 V bl V c exists, and this element clearly dominates both a and b. O n the other hand, if e E L dominates a and b, then a1 V c 5 e, bl V c 5 e and this implies that a1 V bl V c 5 e. W e see that a1 V bl V c = a V b. T h e existence o f a A b follows from the fact that a A b = ( a fV b')' and from Lemma 5 (iii). B y Lemma 4, a A b = (al V c) A b 5 (b' V c) A b = c, which entails that a A b = c. Finally, a1 5 a a1 5 b', hence a1 5 a A bt. O n the other hand, a A b ' = ( a l V c ) A b f 5 ( a l V c ) A d = a l . Theproofofbl=bAa'isanalogous.
L E M M A 7. For a,b E L , a anda~c'sb'.
.
o
b i f and only i f there is a c E L with c 5 a , c 5 b
Proof. Suppose a * b. T h e n a = a1 V c, b = bl V c, where c 5 a, c 5 b and a A c' = a1 5 b'. Conversely, let c 5 a , c 5 b and let a A c' 5 b'. From the orthomodularity, there are a l , bl such that a = a1 V c, b = bl V c, where a1 Ic, bl Ic. Moreover, ¤ a1 = a A c' 5 bt 5 b:. I t follows that a b.
-
L E M M A 8. If b tt a$, i = 1 , 2 , . . . and the elements V z l ai, L, then b * V z l ai and b A ( V z l ai) = V iM = l ai A b-
V z l ai A b exist in
Proof. Obviously, V z l ai A b is not greater than V z l ai and b. B y Lemma 7, b o ai implies that b A (b A ai)' 5 a: for all i. T h i s entails that b A ( V z l b A ai)' 5 (b A (b A ai)' 5 a: for all i and hence b A ( V z l b A ad)' 5 (VE1ai)'. T h i s implies again by Lemma 7 that b o V z l ai. T h e rest o f the proof can b e obtained b y reasoning as in t h e second part o f the proof o f Lemma 7 with c = VEl ai A b and an application o f Lemma 6 .
In what follows, let us denote b y [a,b] the set { c E L : a 5 c 5 b), where a , b L~, a 5 b. L E M M A 9. Let a E L , a # 0 . Then the set [O,a]with the ordering inherited from L and with the orthocomplementation defined by setting bla := b' A a, b E [0,a ] , is a logic.
150
Pave1 PtAk, Sylvia Pulmannovd
Proof. Let b 5 a. Then b' A a exists by orthomodularity. The inequalities bl j b2 j a ilpp?y b> j b k , and thus b V bta = b V ( M A a) = a by orthomodularity, too. Also, (b ") a = (b' A a)' A a = (b V a') A a = b by Lemma 4. This proves that b H bfa is an orthocomplementation in [0, a]. Orthomodularity follows from ort homodularity in L. rn The logic of Lemma 9 will be denoted by L[O, a]. LEMMA 10. If for every a, b E L the supremum a V b exists in L then the logic L is a a-lattice.
Proof. Let (ai)i be a sequence of elements of L. Put bl = a l , . . . ,b, = a1 V a2 V . . V a, (n E U). Then bl ,b2 A b', , . . . is a sequence of orthogonal elements, hence rn ai. its supremum, b, exists. It is easily seen that b =
-
VE1
Note that a logic L becomes a Boolean a-algebra if it is a distributive a-lattice. The next theorem provides a characterization of Boolean a-algebras among logics. THEOREM 11. A logic L is a Boolean a-algebra if and only if a a, b E L.
tt
b for all
Proof. Necessity is clear. For sufficiency, if a * b for all a, b E L, then by Lemma 6, a V b and a A b exist in L for all a, b E L. By Lemma 10, L is a a-lattice. Distributivity follows from Lemma 8. A logic L which is also a lattice is called a lattice logic. Obviously, a lattice logic is an orthomodular a-lattice. Let us say that (al, a2, as) C L is a distributive triple if ai A (aj V ak) = (ai A aj) V (ai A ak) for every permutation {i, j, k) of the set {1,2,3). THEOREM 12 (Foulis-Holland). Let a, b, c be elements in a lattice logic L such that a chosen one is compatible with the other two. Then (a, b, c) is a distributive triple.
Proof. Assume, e.g., that a * b, a * c. By Lemma 8 we have a tt b V c and a ~ ( b v c= ) ( a ~ b ) V ( a ~ cIt) .suffices toprove that (aVb)Ac= (aAc)V(bAc). By the De Morgan laws this is equivalent to (a A b) V c = (a V c) A (b V c). But ( a v c ) ~ ( b ~=c( )a ~ c A) [ ( ~ A ( ~ V C ) V ~ ' A = ( ~a~ VC ( b) V ] c ) ~ c =( a ~ bV)C , where we used Lemma 8 and compatibility of aV c with a A ( b c)~and a' A (b V c).
rn A subset M of a lattice logic L which has the property that among any three arbitrarily chosen elements of M there is one which is compatible with the other two, is called a Foulis-Holland set. Greechie [Greechie, 19791 (see also [~almbach, 19831 for a simpler proof) proved that the sublattice of L generated by a FoulisHolland set M is distributive. The following lemma is a strengthening of Lemma 8 for lattice logics.
Quantum Logics as Underlying Structures of Generalized Probability Theory
151
-
THEOREM 13. Let L be a lattice logic. Let M be a subset of L such that V M := V{m : m E M ) exists in L, and let b cr m for all m E M. Then b V M and V{bAm:rn€m)=(VM)~b.
-
Proof. Evidently, (V M ) A b 2 m A b for all m E M. Let u E L be such that u > m A b f o r a l l m E M . T h e n z : = u A ( V M ) A b ~ m ~ b f o r a l l rM n .~ m for all m E M it follows that We will show that z = (V M) A b. From b bA(btV(VM)') 5 bA(b'vmt) = b A r n t < bA(VM)'. By Lemma7, b - V M . From orthomodularity we have that (V M ) A b = z V d, where d I z. Thus d 5 ( V M ) A b a n d d 5 z' 5m'Vb'. Thisentailsthat d 5 (m'Vbf)Ab=m'Abfor all m E M . Hence d 5 (V M)', which together with d 5 V M entails that d = 0. We have shown that u 2 (V M) A b, so that (V M) A b is the supremum of the set { b ~ m : m ~ M ) . DEFINITION 14. Let L1 and L2 be logics. A mapping h : L1 + L2 is said to be a a-homomorphism if (i) h(1) = 1; (ii) h(at) = h(a)' (a E L1);
VEl h(ai)
(iii) h ( V z l ai) = elements of L1.
for every sequence (ai)i of mutually orthogonal
A bijective a-homomorphism h such that h-I is also a a-homomorphism is called an isomorphism. If L1 = La, then an isomorphism is called an automorphism. A a-homomorphism is a lattice a-homomorphism if h(a V b) = h(a) V h(b) whenever a V b exists in L1. If the condition (iii) is required to be satisfied only for finite orthogonal sequences, then h is called a homomorphism. Let us observe that if h : L1 t Lz is a a-homomorphism and (ai)i is an arbitrary sequence of elements in a lattice logic L1, then h(Vi ai) = Vi h(ai). Note also that if L1 is a lattice logic and L2 is an arbitrary logic, then every a-homomorphism h : L1 + L2 is a lattice a-homomorphism exactly when L1 is a Boolean a-algebra [~afiasovb,19811. DEFINITION 15. A subset L1 of a logic L is called a sublogic when L1 is a logic with the ordering and complementation inherited from L and when the identity mapping id : L1 -+ L is an injective a-homomorphism. A sublogic is called a lattice sublogic if the following implication holds: Whenever (ai)i is a sequence of elements in L1 such that Vi ai exists in L, then Via* belongs to L1. A sublogic L1 of a logic L is called a Boolean sublogic if (i) for every sequence (ai)i of L1 the supremum Vi ai exists in L and belongs to L1; (ii) every (a, b, c) c L1 is a distributive triple. DEFINITION 16. We say that a logic L is regular if for every a, b, c in L which are pairwise compatible we have a * b V c (equivalently, a * b A c).
Pave1 Ptdk, Sylvia Pulmannovh
152
Let A be an arbitrary subset o f a logic L . Put C ( A ) := {a E L : a * b f o r every b E A } . W e easily see that, for every A , B
(i) A C B (ii) A
c L,
=+ C ( B ) c C ( A ) ;
c C(C(A));
(iii) C C ( C ( A ) )= C ( C C ( A ) )= C ( A ) . T h e set C ( L ) is called the center o f L. L E M M A 17. For every subset A L , the set C ( A ) is a sublogic of L . Proof. Evidently, 0 and 1 belong t o C ( A ) . If a E C ( A ) , then also a' E C ( A ) b y Lemma 5. I f (ai)iENis a sequence o f pairwise orthogonal elements in C ( A ) , then Viewai exists in L , and for every b E A we have b * ai, i = 1 , 2 . ... Hence b A ai exists. A s ( bA ai)iEn is an orthogonal sequence, ViEN bA ai exists in L . B y Lemma rn ai, and hence ViEN ai E C ( A ) . 8, b * ViEN L E M M A 18. If B is a subset of pairwise orthogonal elements in a regular logic L , then C ( C ( B ) ) is a Boolean sublogic of L . Proof. B y Lemma 17, C ( C ( B ) )is a sublogic o f L . Since B is a pairwise compatible set, we have B C C ( B ) , which entails that C ( C ( B ) ) = C ( C ( C ( B ) ) ) ,so that C ( C ( B ) )is a compatible set. Let a , b E C ( C ( B ) )and c E C ( B ) . T h e n a , b, c are pairwise compatible. T h e n regularity implies that c * a V b, so that a V b E C ( C ( B ) ) . It follows that C ( C ( B ) )is a lattice. Moreover, ( a ,b, c) C C ( C ( B ) )is a distributive triple for every a, b, c. PROPOSITION 19. The center C ( L ) of any logic L is a Boolean sublogic of L . Proof. B y Lemma 17, C ( L ) is a sublogic o f L . I f a , b E C ( L ) , then a * b, therefore a V b exists in L . Moreover, a A c and b A c exist in L for all c E L , and in addition, a A c tt b A c. B y Lemma 8, aV b E C ( L ) . Since a * b for all a, b E C ( L ) , C ( L ) is a Boolean sublogic. THEOREM 20. Let L be a regular logic. Let K := { a , : a E I } be a subset of pairwise compatible elements in L . Then there exists a Boolean sublogic B of L such that K B C_ L . Proof. W e have K C C ( C ( K ) ) ,and b y Lemma 18, C ( C ( K ) )is a Boolean sublogic of L. rn DEFINITION 21. A logic L is called separable if every set o f nonzero pairwise orthogonal elements in L is at most countable. PROPOSITION 22. Let L be a separable lattice logic. For every set A C L there exists a countable subset (ai)iErpisuch that V A = V z 1ai. Consequently, L is a complete lattice.
Quantum Logics as Underlying Structures of Generalized Probability Theory
153
Proof. Let A c L. Let B denote the set of all suprema of at most countable subsets of A. Let C := {b A c' : b E B, c 5 b}. By Zorn's lemma, there exists a maximal subset of pairwise orthogonal elements in C , let us say { b l A d , b2Ac&,. . .}, bi. Then clearly b E B. If there which is at most countable. Let b = is a E A such that a $ b, then 0 # (b V a) A b' E C. Then the inequalities b i A d 5 b 5 (bVa)'Vbfori=1,2, ...imp lythat ( b ~ a ) ~ Ibb i' A c ' , , i = 1 , 2 , ..., which contradicts the maximality of the set { b i < ~ ) E l . This proves that b = V A.
Vzl
rn
DEFINITION 23. An element a in a logic L is called an atom if a inequality b 5 a implies either b = 0 or b = a.
# 0 and the
DEFINITION 24. A logic L is called atomic if for every b E L, b # 0, there is an atom a E L with a 5 b. A logic L is called atomistic if every element in L can be written as a supremum of all atoms that are less than or equal to L. PROPOSITION 25. A lattice logic is atomic if and only if it is atomistic. Proof. Let L be an atomic lattice logic. Let b E L, b # 0 and let A be the set of all atoms lying under b. Then A # 0. Let c E L be such that a 5 c for all a E A. Then a 5 b A c, and by orthomodularity, b = (b A c) V (b A (b' V c')). If b A (b' V c') # 0, then, by the atomicity of L, there is an atom e 5 b A (b' V c'). But e 5 b implies e 5 b A c, in contradiction with e 5 b' V c'. Hence b = b A c, and rn therefore b = V A.
Let us note in concluding this paragraph that Prop.25 does not have to hold for general logics (see [Greechie, 19691). 3 COMPATIBLE SUBSETS OF A LOGIC In the quantum logic approach to quantum mechanics, a quantum logic L is interpreted as the set of all experimentally verifiable propositions about a physical system. The compatible subsets of L should correspond to those propositions that can be simultaneously verified, and hence can be dealt with as classical propositions. Generally, we may assume that the elements of a subset M of L are compatible if they can be embedded into a Boolean sublogic of L, in accord with the assumption that the logic of a classical system is a Boolean D-algebra. In this section, we will find intrinsic characterizations of compatible subsets of a logic. If a logic L is regular, then by Theorem 20, every pairwise compatible subset of elements of L is contained in a Boolean sublogic of L. The following example shows that this need not hold in an arbitrary logic. EXAMPLE 26. Let M = {1,2,3,4,5,6,7,8) and let L be the set of all subsets of M with an even number of elements. Then L ordered by inclusion and endowed with set-theoretical orthocomplementation is a logic. Let A = {{I,2,3,4}, {1,2,5,6}, {2,3,5,7}}. It is easy to check that elements of A are
154
Pave1 Ptik, Sylvia Pulmannovi
pairwise compatible. But they cannot be contained in a Boolean sublogic of L since {1,2,3,4,5,6)) A {2,3,5,7) does not exist in L. As a result, a stronger condition of compatibility is needed to characterize those subsets of a logic that can be embedded into Boolean sublogics of L. Such a condition, so-called strong compatibility, was found independently in [GUZ, 19711 and [Neubrunn, 19741. Let us introduce it in the next two definitions. DEFINITION 27. Let M be a subset of a logic L. We say that a, b E M are M compatible in M , written a * b, if there are pairwise orthogonal elements a l , bl, c in M such that a = a1 V c and b = bl V c. DEFINITION 28. A subset A of a logic L is said t o be strongly compatible if for every two elements a, b E A, a L(A) * b, where L(A) is the smallest sublogic of L that contains A. Obviously, the smallest sublogic of L that contains A, L(A), exists (L(A) is the intersection of all sublogics of L that contain A). Recall that the smallest sublogic of L that contains A is called the sublogic of L generated by A. THEOREM 29. Let A C L, and let L(A) be the sublogic of L generated by A. Then L(A) is a Boolean sublogic of L if and only if A is strongly compatible. Proof. If L(A) is a Boolean sublogic, then A C L(A) implies that for every a, b E A, a = a A (b V b') = (a A b) V (a A b') by distributivity in L(A) . Since L(A)
is a Boolean sublogic, a A b, a A b' E L(A), hence a L(A) ++ b. Conversely, assume that A is strongly compatible. For a E A, put B, := {b E L(A) : a L(A) * b). By the properties of compatibility, B, is a sublogic of L, and since A c B, by strong compatibility, we have L(A) c B, for every a E A. Now let b E L(A), and put Bb := {c E L(A) : b LLA) c). The first part of this proof implies that A c Bb, and hence L(A) c Bb for all b E L(A). This entails that every pair a, b E L(A) is compatible in L(A). As a consequence, L(A) is a Boolean sublogic of L. Obviously, strong compatibility implies pairwise compatibility. The next example shows that strong compatibility is not equivalent to pairwise compatibility, and also that strong compatibility is not necessary for a subset of L to be embeddable into a Boolean sublogic of L. EXAMPLE 30. Let M = {1,2,3,4) and let L be the Boolean algebra of all subsets of M. Let A = {{1,2), {2,3), {3,4)). The smallest sublogic L(A) containing A consists of all subsets with an even number of elements. The elements of A are pairwise compatible in L but not strongly compatible, (e.g., {1,2) n {2,3) = (2) which does not belong to L(A)). In what follows, we will use the following notation. Let D = (-1, I), and let A C L. Write A' := {a' : a E M) and let a' := a, a-I := a'. Put D := {-1,l).
Quantum Logics as Underlying Structures of Generalized Probability Theory
155
Let A = {al, az, . . . ,a,) be a finite subset of L such that for every d E Dn the infimum a? A a? A . . . A a$ exists in L. Then put
and set
com(al,a2,. . . , a n ) =
V{f : f E FA).
DEFINITION 31. Let A = {a1, az, . . . ,a,) be a finite subset of a logic L. We say that A is a compatible set if all elements in FAexist and com(al, az, . . . , a,) = 1. If A is an arbitrary subset of L then A is said to be compatible if all finite subsets of A are compatible. The element com(a1, az, . . . ,a,) (if it exists) is called the commutator of the set {al, az, . . . ,a,). If L is a lattice, then com(A) exists for any finite subset A c L. For any two elements we have com(a, b) = (a A b) V (afA b) V (aA b') V (afA bf ) . This commutator in , (see also [chevalier, 1984; orthomodular lattices was introduced in [ ~ a r s d e n19701 Chevalier, 1989; MatouSek, 19921, etc.). THEOREM 32. A subset A of L is contained in a Boolean sublogic of L if and only if A is a compatible set. Proof. If there is a Boolean sublogic Lo of L such that A C Lo, then A is a compatible set. Assume that A is a compatible subset of L. If M = {al, az, . . . ,a,) is a finite subset of A, then FM= {a:' A a$ A .. A a$ : d E D) is a set of pairwise orthogonal elements of L the supremum of which equals 1. Let B(M) denote the set of suprema of all subsets of FM.It is easily verified that B(M) is a Boolean sublogic of L. Put B = U{B(M) : M a finite subset of A). Then B is also a Boolean sublogic of L. Indeed, if al, az, a3 E B and if MI, M2, M3 are finite subsets of A with ai E B(Mi), i = 1,2,3, then MI U Mz U M3 is a finite subset of A, and B(Ml U M2U M3) contains all a l , a2, as. It follows that any three elements of B are contained in a Boolean sublogic of L. Therefore B is a Boolean subalgebra of L. We still need to verify that B is closed under the formation of suprema of countable subsets. Let Lo be the sublogic of L generated by B. We will show that Lo is a Boolean sublogic of L. Take a E B and put K, := {b E Lo : b 3 a). By Lemma 17, K , is a sublogic of Lo. Since B is Boolean, we have B C Ka. Thus Ka = Lo for all a E B. Further, take b E Lo and put Kb := {c E Lo : c 3 b). Then, again, Kb is a sublogic of Lo. By the first part of this proof, B C Kb. It b in Lo for all a, b E Lo. follows that Kb = Lo for all b E Lo. Hence we have a By Theorem 11, Lo is Boolean a-algebra, hence Lo is a Boolean sublogic of L.
-
The following condition was introduced in [Brabec, 19791.
.
DEFINITION 33. A subset A of a logic L is f-compatible if for every finite subset F = {al, a2,. . . ,a,) of A there exists a finite set G = {g1,g2,. . . ,gk) of pairwise orthogonal elements of L such that for every i = 1,2, . . . ,n there is a subset Hi C G such that ai = V{fj : f j E Hi). The set G is called an orthogonal cover of F.
156
Pave1 Ptdk, Sylvia Pulmannovd
The following statement can be proved by a technique similar to the proof of , Theorem 32 ( [ ~ t b kand PulmannovB, 1991, Prop. 1.3.221, see also [ ~ r a b e c1979; Brabec and PtBk, 19821). PROPOSITION 34. Let A be a finite subset of L. Then A is compatible if and only if it is f-compatible. By Lemma 9, for any b E L, the interval [0, b] can be viewed as a logic with the smallest element, 0, the greatest element, b, and with the relative orthocomplementation xlb = x' A b. In the next lemma, we prove that compatibility in L and compatibility in [0,b] are equivalent. LEMMA 35. Let b E L. The elements al, a2,. . . ,a, in the interval [0,b] are compatible in L if and only if they are compatible in [0,b].
Proof. If com(al, a2,. . . , a,) exists and equals to 1, the it is easy to see that com(al, as,. . . , a,) A b is the commutator of al, aa, . . . , a, taken in [0, b], and since it is equal to b, the compatibility in [0,b] follows. Conversely, if elements are compatible in [0,b], then they have an orthogonal cover, which means that they are f-compatible and hence by Proposition 34 they are compatible in L. It is easily seen that for a tweelement set A = {al, a2) the notions of pairwise compatibility, f-compatibility and compatibility coincide. We have already shown that pairwise compatibility is strictly weaker than compatibility. The next theorem and Pulmannovb, 1991, Theorem 1.3.251) shows that also "triplewise", (see [ ~ t B k etc. compatibility is too weak to guarantee compatibility. THEOREM 36. Let n (n 2 2) be a natural number. Then there exists a (finite) logic L, with a subset A, such that the following statements hold: (i) the set A, is not compatible in L,; (ii) every subset of A, which contains less that n elements is compatible in L,. Let us recall ([Harding, 1998; Harding, 1839-1862; PtSk and Pulmannovb, 19911, etc.) that a logic L is said to be regular if for any set {a, b,c) C L of pairwise compatible elements we have a tt b V c. As seen before, there are logics that fail to be regular (Example 26). Interestingly, projection logics are usually regular e r KatrnoBka, 1979; Harding, 19981 and [ P ~and B Weber, (see e.g. [ ~ l a c h s m e ~and 20011). PROPOSITION 37. Every lattice logic is regular. Proof. The proof follows immediately from Lemma 8. PROPOSITION 38. A logic L is regular if and only if every pairwise compatible subset of L admits an enlargement to a Boolean sublogic of L.
Quantum Logics as Underlying Structures of Generalized Probability Theory
157
Proof. By Theorem 20, every pairwise compatible subset of a regular logic is contained in a Boolean sublogic. To prove the converse, assume that every pairwise compatible subset of a logic L is compatible. Then if a, b, c are pairwise compatible elements of L, then they are contained in a Boolean sublogic Lo of L, hence b V c rn exist in L and belongs to Lo, and a tt b V c in Lo implies a * b V c in L. PROPOSITION 39. (i) Let A be a compatible subset of L. Among the Boolean sublogics of L containing A there is a maxzmal and a minimal one. (ii) The union of all maximal Boolean sublogics of L is L. (iii) The intersection of all mosimal Boolean sublogics of L is C(L).
Proof. Let K A denote the collection of all Boolean sublogics of L that contain A. By Theorem 32, K A is nonempty. The intersection, Lmi,, of K A is the smallest Boolean sublogic that contains A. Let us consider the collection K A ordered by inclusion. By a standard application of Zorn's lemma the collection K A conThis completes the proof of the statement. The tains a maximal element, L,,. rn statements (ii) and (iii) are obvious consequences of the statement (i). DEFINITION 40. A maximal Boolean sublogic of L is called a block of L. In view of Proposition 39 every logic can be viewed as a union of its blocks. A more detailed analysis of the configuration of blocks in a logic can be found in [Greechie, 1971; Matouavsek, 20041 and [Navara and Rogalewicz, 19911. 4 STATES ON A LOGIC DEFINITION 41. A state on a logic L is a mapping s : L -+ [0, 11, where [O,1] denotes the unit interval of the real line W,which satisfies the following conditions: (i) s(1) = 1; (ii) if (ai)i is a sequence of pairwise orthogonal elements in L, then 00 s (Vi=l ai) = ~(ai).
czl
+
If sl and sz are states on L, then their convex combination s = am1 (1 -a)sz, where 0 5 a 5 1, are also states on L. A state s on L is called pure if s = as1 (1 - a)s2, 0 < a < 1 implies that s = sl = sz. A state which is not pure is called a mixture. If for every a E L, s(a) E (0, I), we say that s is a two-valued state. Let S(L) denote the set of all states on L and let Sz(L) denote the set of all twevalued states on L. Let us note that every s E S2(L) is pure. Indeed, if we can write s = as1+ (1 - a)s2 for a E (0,l) and for distinct sl, s 2 E S(L), then there is 0 < a < 1with sl(a) # s2(a), and the value asl (a) (1-a)s2(a) is neither 0 nor 1. Moreover, if L is a Boolean logic, then s E L2(L) 8 s is pure. Indeed, if s E S(L) is such that 0 < s(b) < 1 for some b E L, we can put s = as1 (1 - a)sz, where
+
+
+
158
Pave1 Ptdk, Sylvia Pulmannovd
a = s(b) and sl, s 2 are states on L defined by the formulas sl(a) = s(b)-ls(a A b) and s2(a) = (1 - s(b))-ls(a A b'). Thus s is not pure. LEMMA 42. The set S(L) is a a-convex set, that is, if sl, s 2 , . . ., are states and q 2 0, Czl q = 1, then s = C z f l s i is also a state on L.
Proof. It follows from the fact that s(a) = CEl cisi(a) 5 CEO=, ci = 1 for every rn a E L. DEFINITION 43. We say that a state s on a logic L has the Jauch-Piron property, or is a Jauch-Piron state if the following implication holds: If s(a) = 1and s(b) = 1 for some a, b E L, then there is c E L, c 5 a, c 5 b such that s(c) = 1. Equivalently, a state s is Jauch-Piron if s(a) = 0 = s(b) implies that there is d E L, a, b 5 dl and s(d) = 0. If L is a lattice logic, then a state s is Jauch-Piron iff s(a) = 1 = s(b) implies s(a A b) = 1 (a, b E L). In the study of Jauch-Piron states we encounter new phenomena in (non-commutative) measure theory see e.g. [ ~ Lucia e and Ptik, 1992; Bunce et al., 1985; Muller, 1993; Ruttimann, 1977; Ptik, 19981. DEFINITION 44. We say that a set S of states on L is (i) order determining if s(a) 5 s(b) for all s E S implies a 5 b; (ii) unital if for every a E L, a
# 0 there is s E S such that
s(a) = 1;
(iii) rich if {s E S : s(a) = 1) C {s E S : s(b) = 1) implies a 5 b. (Equivalently, if a , l b implies 3s E S : s(a) = l,s(b) # 0). We say that a logic L is (j) unital if it has a unital set of states, (jj) rich if it has a rich set of states, (jjj) rich2 if it admits a rich set of (0,l)-states. LEMMA 45. (i) A rich set S is unital and order determining. (ii) If L is a lattice logic, then a unital set M of Jauch-Piron states is rich.
Proof. Part (i) is straightforward. For (ii) Let a $ b. Then a = (a A b) V c with c # 0, c Ia A b. Let s(a) = 1 s(b) = 1. Then the Jauch-Piron property implies that s(a) = 1 =+ s(a A b) = 1. By unitality there is s E M such that s(aAb) = 1, contradicting s(c) = 1. But then s(c) = 1 =+ s(a) = 1 cIaAb. rn s(a) 5 s(b). In the As a consequence of orthomodularity we have a 5 b definition of a state, orthomodularity is not explicitly used. Consequently, the n e tion of a state makes sense for any partially ordered orthocomplemented set which
Quantum Logics as Underlying Structures of Generalized Probability Theory
159
is closed under suprema of countable pairwise orthogonal sets. Orthomodularity 19931 and or am halter and Ptbk, 19871). is often forced (see also [~vure~enskij, PROPOSITION 46. Let (L, 5,') be a partially ordered orthocomplemented set with the properties (i)-(v) of Definition 1. Let S be an order determining set of states on L. Then L also has property (vi) of Definition I , that is, L is a logic. Proof. Let a 5 b, a, b E L. Then a V b' exists in L, and s(a V b') = s(a) + s(bf) = s(a) + 1- s(b). For any s E S we have s ( a V (a v b')')
=
s(a) = s(a)
+ s((a V b')') + 1- s(a v b')
= s(b),
and since S is order determining, this implies that a V (a V b')' = b. This is equivalent to (vi) of Definition 1. The following definition introduces an important class of set-representable logics. It should be noted that even finite logics are not necessarily set-representable, see [Katrno~ka,1982; Ovchinnikov, 1997; Tkadlec, 1993; Sherstnev, 19681, etc. DEFINITION 47. Let R be a nonempty set and let A be a collection of subsets of R. Then A is said to be a concrete logic if the following conditions are satisfied:
3. if {Ai : i E N) C A is a countable family of pairwise disjoint subsets of R, then U{Ai : i E N) E A It is interesting to note that the notion of a concrete logic has long been known in classical probability theory in connection with generating Bore1 sets (see e.g. [Olej~ek,19951 for more details). There, it is called a Dynkin system of sets. Note also that there are Boolean logics (Boolean cr-algebras) which are not concrete [~tbk and Pulmannovi, 19911. The following statement was proved in udder, 19791. THEOREM 48. A logic L is isomorphic (as a logic) to a concrete logic if and only if L is rich2. Proof. Suppose first that L is isomorphic to a concrete logic (R, A). Then we may identify L with A. Take A, B E A such that A $ B. Then A \ B # 0 and therefore we can choose a point p E A \ B. Consider a state sp concentrated at p (i.e., sp(C) = 1 iff p E C). Then sp(A) = 1 and sp(B) = 0. Thus, L is rich2. Conversely, suppose that L is rich2. Put R = S2(L), and A = {A E S2(L) : there is an a E L such that A = {s E S2(L) : s(a) = 1)). We show that (0, A) is a concrete logic. If A = {s E S2(L) : s(a) = I), then R\A = {s E S2(L) : s(af) = 1). Hence A E A implies R \ A E A. Let Ai = {s E S2(L) : s(ai) = I), i = 1 , 2 , .. .,
Pave1 Pt6k, Sylvia Pulmannov6
160
.
and let Ai be mutually disjoint sets (i E N). As L is rich2, it follows that the elements a i , i E N are mutually orthogonal. We may then write Ui,,Ai = {s E S2(L) : s(ViENai) = 1). Hence (a,A) is a concrete logic.
The following proposition gives a characterization of compatibility in concrete logics. PROPOSITION 49. Let A be a concrete logic of subsets of $2. Then A, B E A are compatible if and only .if A n B E A.
Proof. Assume that A * B. Then there are mutually disjoint sets A1, B1, C in A such that A = A1 U C, B = B1 U C. Then A n B = C E A. Now assume that A n B E A. Then we have A = ( A n B ) u ( A \ ( A n B ) ) , B = ( A n B ) U ( B \ ( A n B ) , where the sets A n B, A \ ( A n B), B \ (A n B) are mutually disjoint sets. Since for disjoint elements of A the set-theoretical union U coincides with the supremum in A. It follows that A * B.
.
The state space S(L) of a logic can be rather poor (even for finite L we can have S(L) = 8 - see [Greechie, 1971; Navara, 19941 and [Weber, 19941) or rather bizarre ([Navara et al., 1988; Navara and Rogalewicz, 19881. To illustrate that, let us consider the following four classes of (unital) logics, denoted by C1, La, C3, C4:
- L E L1 e if a cft b, there is a state s E S(L) such that s(a) = 1and s(b) # 1; if a cft b, and if we are given an s E S(L) such that s(a) = 1 and s(b) 2 1- E ;
- L E C2
E
> 0,
then there is a state
- L E C3 H if a cft b, then there is a state s E S(L) such that s(a) = 1= s(b); - L E L4 e if a cft b, then there is a twevalued state s E S2(L) such that s(a) = 1= s(b) and, moreover, the set S2(L) is unital for L. THEOREM 50. [ ~ t i and k Pulmannovi, 1991, Th. 2.4.121 (i) L E C1 e L is a rich logic. (ii) L E L4 H L is a concrete logic. (iii) The inclusions C4 C C3 C L2 C L1 hold.
Proof. (i) We rephrase the definition of a rich logic: a logic L is rich if for any a, b E L with a 5 b there is a state s E S(L) such that s(a) = 1 and s(b) # 1. Thus every rich logic obviously belongs to L1. Now let L E L1 and let a, b E L, a 5 b. If a * b, we have a = a1 V c, b = bl V c, where a l , bl, c are mutually orthogonal. Obviously, a1 # 0. Take a state s E S(L) with s(al) = 1. Then we have s(a) 2 s(al) = 1. From b 5 a; we have s(a;) = 0 2 s(b). Hence s(a) = 1 and s(b) = 0. (ii) Follows by (i) and Theorem 48. (iii) The inclusions C4 C C3 C C2 follow immediately from the definitions. It remains t o verlfy that C2 c C1. Suppose that L E C2 and take elements a, b E L. bb', and therefore there is a state s E S(L) such that s(a) = 1 If a cft b, then a and s(bb')2 112. Since s(b) = 1- s(b1), we see that s(b) < 1/2, as required.
+
.
Quantum Logics as Underlying Structures of Generalized Probability Theory
161
It can be proved that all the inclusions in Theorem 48 are proper [ ~ t b k and Pulmannovb, 1991]. The counter examples are, usually, constructed with the help of so called Greechie past job [Greechie, 1971; Greechie, 19691 or its generalizations [Mayet et al., 20001. Let us present here a typical way of constructing interesting features of state spaces in this manner. Let us first introduce another class of logics ([~ogalewicz,1984b] and [ ~Btand Rogalewicz, 1983bl). We point out that various other such classes having their origin in mathematical analysis have been r Navara, 1987; D7Andreaand de Lucia, 1991; De Simone and studied [ ~ i n d e and Navara, 2001; De Simone et al., to appear], etc. DEFINITION 51. Let us denote by L2- the following class of logics: L E La- (j if a * b and if we are given an E > 0 then there is a state s E S(L) such that s(a) 2 1- E and s(b) 2 1- E. The class Lz- is interesting in its own right but it is also relevant to the study of observables as we will see later. PROPOSITION 52. C2- is a proper subclass of L2. Proof.We assume that the reader is to a certain extent familiar with the interpretation of the Greechie diagrams of a logic (see our next Figures 1,2). Let us just recall that the "points" of a Greechie diagram are interpreted as the atoms of the logic and the straight line segments (or possibly the curve segments) group together those atoms which belong to a maximal orthogonal set (Boolean block). There is a oneto-one correspondence between the states on the logic constructed and the so called weights on the Greechie diagram. (A weight is such a (nonnegative) evaluation of the points of the diagram that the sums over Boolean blocks equal to 1.) We shall not make any distinction between the weights on a Greechie diagram and the states on the corresponding logic. The precise description of Greechie diagrams may be found in [~reechie,19711 or [~chultz,19741. Let us return to the example disproving L2 c Lz-. We start with a preliminary construction (Figure 1). Claim. The logic L given by Figure 1 has the following properties: 1. L E L2-, 2. If s is a s t a t e o n L and if s(b) = 1 , then s(a) = O . Proof. Suppose that s(b) = 1 for a state s on L. Then s(fi) = 0 for any i = 1,2,3, . . . . Therefore s(d) C s(zi) 5 s(d) C s(cj). Since s(e) = 0, the left side of the last inequality equals to one. Hence s(d) C s(q) = 1 and therefore s(a) = 0. This was to prove. Observe that we have also proved that the identity s(b) = 1 for a state s implies s(a') = 1. On the other hand, if E > 0 and r E (0,l) are given, we may find a state s such that s(b) = 1- E and s(a) = r. It is easily seen that if we take two noncompatible elements p, q E L such that (p, q) # (a, b), there exists a state s on L with s(p) = 1= s(q). Hence L E Lz-.
+
+
+
Pavel Pt6k, Sylvia Pulmannov6
e
Figure 1. The desired example establishing La[Rogalewicz, 1984al.
\ L2 # 0 is now
constructed as follows
Claim. The (lattice) logic L given by Figure 2 belongs to La- but does not belong to L2. Proof. If we take noncompatible atoms (p, q) # (a, b), then one easily shows that there exists a state s on L such that sCp) = 1 = s(q). Let us consider the pair (a, b). If s(b) = 1, then s(fi) = 0 for i = 1 , 2 , 3 , . . . and therefore s(d) C s(ci) = 1. As
+
a result, s(a) 5 $ and L does not belong to Lz. On the other hand, L belongs t o La-. Indeed, if we are given a E > 0, we may simply construct a state s with s(b) = 1- E and s(fi) E ( 0 , ~ ) . An alternative proof of the previous result can be obtained by the following result, which uses the convexity of the state space. PROPOSITION 53. A logic L belongs to Lz- if and only if it satisfies the following condition: If a, b are two noncompatible elements of L and if we are given a real number T E (0,l) then there exists a state s on L such that s(a) = T = s(b). Proof. The condition is obviously sufficient. To prove necessity, let a real number
>4
< 1be given. We may suppose that T - otherwise we take up the equivalent assertion with a', b' and T' = 1- T . We shall construct two states sl,s 2 on L such
T
Quantum Logics as Underlying Structures of Generalized Probability Theory
163
Figure 2.
i)
that s l ( a ) = sl(b) = rl E (0, and s2(a) = s ~ ( b = ) 7-2 E ( r ,1). The required state s on L can then be constructed by setting
We shall first define s l . If there is a state s on L such that s(al) = 1 = s(bl), we put sl = s. If this is not the case, the assumption guarantees the existence of states s3,sq on L with s3(a1)= 1, s3(b1)= 7'3 < 1, sq(al) = 7-4 < 1, s4(bf)= 1. Let us put
Let us now consider the construction of s2. If there is a state s on L with s(a) = 1= s(b), we put s2 = s and the proof is complete. If there is no such state,
Pave1 Ptdk, Sylvia Pulmannovi
164
we consider states 95, s 6 and s 7 such that sg(a) = 1, s5(b) = r5 < 1, s6(a) = rs < 1, s6(b) = 1 and, further, if we set q = max(r,r5, r6), we require s7(a) = r7 > q, s7(b) = r8 > 2. The assumptions guarantee the existence of such states. If r 7 = T,, we put s 2 = 37. If r7 < T,, then
If r,
< r7, the construction
of
92
proceeds dually. Now the proof is complete.
DEFINITION 54. An element a E L is called a support of a state s on a logic L, if for any b E L, a Ib if and only if s(b) = 0. If a is a support of s, we will write a = supp s. PROPOSITION 55. Every Jauch-Piron state on a separable lattice logic has a support. Proof. Let L be a separable lattice logic and let s be a state on L. Put so := {a E L : s(a) = 0). By Proposition 22, the element a = VsO exists in L, and a = ViENail where ai E so,i E N. Put bl = a l l bz = b l V az, . . . , b, = bn-1 V a,, . . . . Clearly, (bi)i is a nondecreasing sequence with Vi bi = a. From the JauchPiron property we obtain s(bi) = 0, i = 1,2,. . .. By a-additivity of s, s(a) = s(Vi bi) = limn,,s(bi) = 0. We will show that supp s = a'. If b E L, ~ ( b = ) 0, then b E so, and hence b Ia'. Conversely, if b Ia', then b 5 a, hence s(b) = 0.
The notion of a Jauch-Piron state can be strengthened further by introducing , RieEanovA, 1998; subadditive states (or so called valuations, see e.g. [ ~ t f i k1998; Sarymsakov et al., 19831, etc.). DEFINITION 56. Let L be a logic. A state s on L is said to be subadditive if for any a, b E L there exists c E L such that a 5 c, b 5 c and s(c) 5 s(a) s(b).
+
It is an easy exercise to show that each subadditive state is Jauch-Piron. Indeed, if s(a) = 1, s(b) = 1 then s(af) = 0, s(b') = 0. Since s is subadditive, there is c E L such that a' 5 c, b' 5 c with s(c) 5 s(af) s(br) = 0. Thus, s(d) = 1 and c' 5 a and d 5 b. If a logic has "enough" states and if each state on it is subadditive, the logic is in a sense "almost Boolean". This situation is, however, fairly subtle as the following example shows (see also [Navara and Pt&, 19881 and [Ptiik, 19981).
+
EXAMPLE 57. There is a concrete non-Boolean logic such that each state on it is subadditive. Let us indicate the construction of such an example. Let P be a set of the first uncountable cardinality. Then each state on exp P lives on a countable set a well-known result of measure theory (by exp P we mean the Boolean a-algebra of all subsets of P). In other words, if s is a state on exp P, then there is a countable subset, M, of P such that s(M) = 1. Let L be the logic of all subsets
Quantum Logics as Underlying Structures of Generalized Probability Theory
165
of {1,2,3,4) whose cardinality is even. Take {1,2,3,4) x P and let us make the latter set an underlying set of the logic in question. Let us call this logic K , K = A, where A is the following family of subsets of {1,2,3,4) x P: A set T, T c {1,2,3,4) x P, belongs to A precisely when the cardinality of the set Q = P- {p E P I the set of all w E {1,2,3,4) such that ( w , p ) E T is of an even cardinality ) is at most countable. Then A is a concrete logic (of subsets of {1,2,3,4) x P ) . Indeed, {1,2,3,4) x P belongs to A. Furthermore, it is easily seen from the definition of A that if T E A, then ({1,2,3,4) x P ) \ T belongs to A as well. Finally, let T, (i E N) be a collection of pairwise disjoint elements of A. Then U Ti E A by a simple cardinality argument. We have to show that any state on A is subadditive. Let s be a state on A. Since exp P can be embedded in A, the restriction of s to e x p P is a state on exp P and as such it must live on a countable set, S. But then s is essentially a (Boolean) state on exp S and therefore it must be subadditive. This completes the construction. 5 OBSERVABLES ON A LOGIC DEFINITION 58. An observable on a logic L is a a-homomorphism from a aalgebra C of subsets of a set R to L, that is, a mapping x : C + L is an observable if (i) x(R) = 1;
(ii) x(EC)= x(E)', E E C (ECis the complement of E in R), w (iii) x ( U z l Ed)= Vi=l x(Ei) for every sequence of C.
of pairwise disjoint subsets
The set R is called the value space of the observable x. Let us notice that if (Ei)i is any sequence of elements of C, then x ( U z l Ei) = x(Ei). This is obtained by replacing (Ei)$ by the sequence of pairwise disjoint sets (Fj)j, where Fl = El, F n = E n \ (uT~; E ) , and Ui Ei = Uj Fj. This entails that the range R(x) := {x(E) : E E C) of an observable x is a Boolean sublogic of L. A family (x,), of observables on L is called compatible if the ranges of all x, belong to the same Boolean sublogic of L. If 52 = IR and C is a suba-algebra of the Bore1 a-algebra B(B) of subsets of W,then an observable x : C -t L is called a real observable: In this case, if L is a concrete logic, then an observable is nothing but a classical random variable [~aradarajan,19851, and this is the case in many other situations [ ~ t i k19811. , If f : R + IR is a measurable function and x : C + L is an observable, then f (x) : B(W) + L, f (x)(E) = x(fP1(E)) is also an observable, which is called the function f of the observable x.
Vzl
166
Pave1 Ptik, Sylvia Pulmannovi
The theory of real observables on a logic was developed by Varadarajan [Varadarajan, 19851. The corner stone is the celebrated Loomis-Sikorski theorem. The statements in [Varadarajan, 19851 are formulated for a lattice logic but if we replace pairwise compatibility by the stronger notion of compatibility, the statements hold for arbitrary logics as well. THEOREM 59. (Loomis-Sikorski), [Varadarajan, 1985, Theorem 1.31 Let B be a Boolean a-algebra. Then there exists a measurable space ( R ,C ) , where C i s a a-algebra of subsets of a nonempty set R , and a a-homomorphism h from C onto B. THEOREM 60. [Varadarajan, 1985, Theorem 1.6, Lemma 3.161 Let x be a real observable o n a logic L. Then the range R ( x ) = { x ( E ) : E E B ( R ) ) of x i s a countably generated Boolean sublogic of L. Conversely, if B i s a countably generated Boolean sublogic of L , then there exists a real observable x such that R ( x ) = B. THEOREM 61. [Varadarajan, 1985, Theorem 1.41 Let ( R , C ) be a measurable space, and let h be a a-homomorphism from a onto a Boolean a-algebra B. Let u be a real observable with range in B. T h e n there exists a C-measurable function f : R + B such that u ( E )= h ( f -'(E)), E E B ( B ) . The function f is unique in the sense that if g i s any other function with the same properties, then { w E R : f ( w ) # g ( w ) ) belongs to the null space of h. THEOREM 62. [Varadarajan, 1985, Theorem 3.91 Let { x , : a E A ) be a n arbitrary family of compatible real observables on a logic L. T h e n there exists a set X , a a-algebra t3 of subsets of X , real-valued B-measurable functions g, on X ( a E A), and a a-homomorphism r of t3 into L such that
for all a E A and E E B ( B ) . Suppose further that either L is separable, or that A i s countable. T h e n there exists a n observable x and real valued Borel functions f, of a real variable such that V a E A, x , = fa o x . Notice that for at most two observables the condition of compatibility in Theorem 62 may be replaced by pairwise compatibility [Ramsay, 19661. Theorem 62 enables us to construct a calculus of functions of several compatible observables. THEOREM 63. [Varadarajan,1985, Theorem 3.171 Let L be a logic and x l , x 2 , . . . ,x, compatible observables on L. T h e n there exists one and only one a-homomorphism T of t3(Rn) into L such that for all E E B ( R ) and all i = 1,2,. . . ,n,
xi ( E ) = T (TF' ( E ) ) , where ~i i s the projection ( t l ,t 2 , .. .,t,) Borel function on Bn,
ti of Bn to B . If g i s any real-valued
Quantum Logics as Underlying Structures of Generalized Probability Theory
167
is an observable. If g l , gz, . .. ,gk are real valued Borel functions on Bn and yi = gio(xl,x2, . . . ,xn), then yl, y2, . . . ,yk are compatible, and for any real valued Borel function h on W k ,
where h(g1,gz, . . . ,g k ) is the function
The a-homomorphism T of Theorem 63 is called the joint observable of X I , 22,. . .,x,. In analogy to self-adjoint operators, we can also introduce the notions of an eigenvalue and the spectrum of a real observable. DEFINITION 64. A real number t is an eigenvalue of a real observable x if x ( { t ) )f 0. DEFINITION 65. Let x be a real observable on a logic L. Put
a ( x ) := n
{ : C~is a closed subset of W with x ( C ) = 1).
Then the closed set a ( x ) c W is called the spectrum of the observable x. PROPOSITION 66. The spectrum a ( x ) of a real observable x is the smallest closed subset of R such that x(C) = 1.
Proof. Since the topology of the real line W satisfies the second countability axiom, there exists a sequence of closed subsets C1,C2,.. . such that z(C,) = 1for emh n , and a ( x ) = r),"==, C,. Since x(W\C,) = 0 for all n , we have x(W \a(x)) = X(U,"=~(W \ C,) = V,"==l x(W \ C,) = 0, which entails that x ( a ( x ) )= 1. rn A number T E a ( x ) is a spectral value of x. An eigenvalue is a spectral value, the converse need not hold. LEMMA 67. A real number is a spectral value of an observable x if and only if x(U) # 0 for every open subset U c W which contains r .
Proof. Let U be an open set containing r and let x(U) = 0. Then W \ U is closed and x ( B \ U ) = 1. This yields W \ U > o ( x ) ,so that r $ a ( x ) . Conversely, assume that r $ a ( x ) . Since W is a metric space, there exist open subsets Ul,U2such that r E Ul, a ( x ) c U2 and Ul n U2= 0. Then x(U2)= 1 and rn this implies that x(Ul) = 0. DEFINITION 68. A real observable x is said to be (i) discrete if a ( x ) = { T I , r2, . . .); (ii) constant if a ( x ) = { r ) ;
Pave1 Ptdk, Sylvia Pulmannovd
168
(iii) simple if a(x) = {rl,r 2 ,
...,r,);
(iv) a proposition or 0 - 1observable if o(x)
c (0, 1).
For a E L, denote by qa the unique 0 - 1 observable for which qa({l)) = a. The observable corresponding to 0 E L, go, is the null observable. The observable corresponding to 1 E L, ql, is the unit observable. The null and unit observables are constants, and r.ql (defined by the function calculus) is a constant observable with the spectrum a(%)= {r). LEMMA 69. (i) For every a E L, q,, = f (9,) with f (t) = 1 - t (t E R). (ii) If x is an observable and XE is a characteristic function of a set E E B(R), then XE(X)= qz(E). PROPOSITION 70. The following conditions are equivalent: (i) x is a proposition observable; (ii) there exists an observable y and E E B(R) such that x = XE(Y); (iii) x2 = x. Proof. (i) & (ii): By Lemma 69, xil1(x) = x. (ii) & (iii): If x = x ~ ( y )then , (i): Put f(t) = t, g(t) = t2, t E W. We have x2 = Xs(y) = xE(y) = x. (iii) {t : f (t) # g(t)) c UrEqf -l(-oo, r)Ag-l(-oo, r), where Q is the set of rational numbers, and E A F = (Er7FC)u( E c nF) is the symmetric difference of sets. Then ~ ( f - ~ ( - o o , r ) A ~ - ~ ( - or)) o , = 0, which entails that x({t : t2 = t)) = x({O, 1)) = 1, hence x is a proposition observable.
6 PARTIAL COMPATIBILITY AND JOINT DISTRIBUTIONS OF OBSERVABLES In the sequel we will introduce the notion of partial compatibility and that of a commutator. We will then study properties of these concepts and relations between them. These results will be used in our study of joint distributions of observables. We mostly restrict ourselves to lattice logics. The notion of a commutator of two elements in an orthomodular lattice L was , The main result was that the orthomodular ideal introduced in [ ~ a r s d e n19701. J generated by the commutators of all pairs of elements of L is the smallest orthomodular ideal such that the quotient L / J is a Boolean algebra. The commutator , of a finite subset of an orthomodular lattice L has been used in [ ~ e r a n 1979; Beran, 1985; Bruns and Greechie, 1990; Bruns and Kalmbach, 1973; Greechie and Herman, 1985; Chevalier, 1984; Chevalier, 1989; Chevalier and Pulmannovi, 2000; e, Kalmbach, 19831, and [ ~ o ~ u n t k19831. The generalization of the concept of a commutator to arbitrary subsets of an orthomodular lattice L was studied in a series of papers [Dvure~enskijand Pulmannovi, 1982; DvureEenskij and Pulmannovb, 1984; LutterovB and Pulmannovi,
Quantum Logics a s Underlying Structures of Generalized Probability Theory
169
1985; Pulmannovii, 1980; Pulmannovii, 1981b; Pulmannovi, 1985; DvureEenskij 1993; Ptik and Pulmannovi, and Pulmannovii, 19821, see also [~vure~enskij, 19911, the notion of partial compatibility was introduced in [~ulmannovii,1981bl. The notion of a joint probability distribution of Gudder type was introduced in [Gudder, 1968; Gudder, 19791. The subsequent developments can be followed 19821-[~vure~enskij, 1987131, [Lahti and Ylinen, 1987; Lutterovi in [~vure~enskij, and Pulmannovi, 1985;Pulmannovii, 1978;Pulmannovii, 1980; Pulmannovi, l98la; Pulmannovi, 1985; DvureEenskij and Pulmannovi, 1982; DvureEenskij and Pulmannovi, 1984; Pulmannovii and DvureEenskij, 19851, and [Pulmannovii and Stehlikovi, 19861. Heisenberg's uncertainty relations were expressed in the language of quantum logics in [Lahti, 1980; Bugajski and Lahti, 1980; Lahti and Mqczyliski, 19871. Results on the relation between uncertainty relations and total noncompatibility can be found in [~ulmannoviiand DvureEenskij, 19851 The notion of complementarity was introduced in [Lahti, 19801. There is a huge list of publications devoted to these problems, which are relevant to quantum theory see, e.g., [Gudder, 1979; Jammer, 1974; Jauch, 1968; Holevo, 1980; Mackey, 1963; von Neumann, 1932; Primas, 19811. The existence of sums of observables has already been emphasized by von Neumann [von Neumann, 19321. In some axiomatic approaches to quantum mechanics the existence of sums of bounded observables is postulated (e.g., in [Segal, 19471, and the C*-algebraic approach [Alfsen and Schulz, 1979; Emch, 1972; Haag and Kastler, 19641). The logics with the property that every two bounded observables are summable were investigated in [Gudder, 1966; Riittimann, 19851, and [DvureEenskij and Pulmannovii, 19801. Joint distributions of Urbanik type were introduced in [Urbanik, 19611 and in [Varadarajan, 19851 for observables on a Hilbert space logic. In [Gudder, 19661 a generalization of this notion to observables on a larger class of logics was studt, Urbanik, 1985; ied. For the further development see, e.g., [ ~ u ~ m g a a r1983; DvureEenskij and Pulmannovii, 1989; Pulmannovii and DvureEenskij, 19801.
6.1
Partial compatibility and the commutator
Let L be a logic, D = {-1,1), and for a E L, let a w l = a', a1 = a. DEFINITION 71. We say that a subset A of a logic L is partially compatible with respect to an element b E L (in short, A is p.c. b) if the following conditions are satisfied: (i) b tt A, i.e., b * a for all a E A; (ii) the set b A A := {b A a : a E A) is a compatible subset of L. Recall that for a subset A C L, C(A) = {b E L : b * A ) is a sublogic of L, where b * A means that b * a Va E A. It what follows, let us agree to write CC(M) instead of more correct C(C(M)).
170
Pave1 Ptik, Sylvia Pulmannovi
THEOREM 72. If for a E L a finite subset M of L is p.c. a, then CC(M) is p.c. a.
Proof. Let M = {al, a2,. . . ,a,) and let {el, e2,. . . ,ek) be a minimal orthogonal cover of M A a in [0,a]. Since a 6 C(M), a cr b for all b E CC(M). From ei * a j A a and ei a for j 5 n, i 5 k, we easily derive that ei E C(M). Hence b tt ei, i k. Therefore {{b A ei, b' A ei)f=l, b A a A (Visk ei)') is an orthogonal ' p.c.a. cover of the set {al A a, a2 A a, . . . , a, A a, b A a), which shows that M U {b) is By induction, we see that every finite subset {bl, b2,. . . , b,) c CC(M) is p.c.a, hence CC(M) B ' p.c. a.
<
<
If A c L is p.c. a, we can prove, using Zorn's lemma, that there is a maximal p.c. a subset of L containing A. THEOREM 73. A subset Q of L which is a maximal p.c a is a sublogic of L. If L is a lattice then Q is also a lattice.
Proof. Let (ai)iEN be a sequence of pairwise orthogonal elements of Q. We need to show that Vi ai E Q. From ai cr a V i we derive that a * Vi ai and (Vi ai) A a = Vi a A ai. The set Q A a is compatible in [0, a], hence it is contained in a Boolean sublogic of [0,a], and this Boolean sublogic contains also Vi a A as. This entails that Q u {Vi q) is p.c. a, and maximality of Q implies that Vi ai E Q. If b E Q, then the Boolean subalgebra of [0, a] containing b A a contains also (b A a)' A a = b' A a, hence b' E Q. This proves that Q is a sublogic of L. If L is a lattice, then for b, c E Q, a v b exists in L, and the relations a * b, a * c imply that a * b V c (a lattice logic is regular), and a A (b V c) = (a A b) V (a A c). The Boolean sublogic of [0,a] that contains Q A a then contains also ( a b)~V (a AC), whence Q U {b V c) is p.c. Q. By the maximality of Q, a V b E Q. We conclude that Q is a lattice. THEOREM 74. Let F = {al, aa, . . . ,a,) be a finite subset of L. If com(F) exists in L, then (i) F is p.c. com(F); (ii) if a E L is such that F is p.c. a, then a 5 com(F).
Proof. (i) From the definition of the commutator it is clear that ai * com(F) for all i 5 n. Put c := com(F), and consider the interval [0,c]. From F cr c, and existence of com(F) in L, we derive that com(al A c, . . . ,a, A c) in [0,c] exists, and is equal to com(F) A c = c, hence the elements a1 A c, a2 A c, . . . ,a, A c are compatible. This proves that F is p.c. com(F). (ii) The statement is trivial for a = 0. Assume that F is p.c. a for a # 0. Then F A a is compatible in [0,a], hence VdED,, (al A a)d; A ... A (a, A = a, where = a: A a if di = -1. Hence = ai A a if di = 1 and (ai A we put (ai A VdEDna:' A . . .a$ A a = a, and as a ++ F, this implies that com(F) A a = a, hence a com(F). H
<
Quantum Logics as Underlying Structures of Generalized Probability Theory
171
In what follows we will tacitly assume that L is a lattice logic. Let us first extend the notion of a commutator to arbitrary subsets of L . DEFINITION 75. Let M be a subset of a lattice logic L . If the following element com(M) exists, (1) com(M) := l \ { m m ( ~ ): F is a finite subset of M ) ,
it is called the commutator of the set M . THEOREM 76. Let M be a subset of a lattice logic L. If com(M) exists, then M is p. c. com(M).
Proof. It is easy to see that if Fl C F2, where F l , F2 are finite subsets of M , then com(Fl) 2 com(F2). Let b E M be an arbitrary element. We have w m ( M )=
/\ w m ( F ) = /\ c o m ( U~ {b)), F
F
and since b * com(F U {b)) for all F C M, by Lemma 8 we have b ct w m ( M ) . Hence M t)com(M). Let bl, bz E M . An easy computation shows that com(bl A w m ( M ) ,bz A c o m ( M ) ) = com(b1,b2) A com(M) = com(M). This entails that bl A com(M) and b2 A com(M) are compatible in [0,com(M)].Since a lattice logic rn is regular, we obtain that M is p.c. com(M). COROLLARY 77. Let M C L. If com(M) exists, then for every a E L , M is p.c. a i f and only i f M * a and a 5 com(M).
<
Proof. If M is p.c. a, then every finite subset F of M is p.c. a, so that a com(F) by Theorem 74, and consequently a 5 com(M). Conversely, assume that M * a and a tt com(M). Let b, c E M . Then the relations b A com(M) et c A w m ( M ) , b A com(M) * a, c A com(M) * a imply that b A a A com(M) t)c A a A w m ( M ) . Now if a 5 com(M), then we obtain b A com(M) t)c A com(M), i.e., M is p.c. a.
rn COROLLARY 78. Let A be a subset of L such that com(A) exists. If L ( A ) is the lattice sublogic of L generated by A , then com(A) = w m ( L ( A ) ) .
Proof. Observe that L ( A ) is p.c. com(A). Indeed, by Theorem 73, the maximal subset Q of L which contains A and is p.c. com(A), is a lattice sublogic of L. The result then follows from L ( A ) Q. By Corollary 77, com(A) 5 com(F) for every finite set F c L ( A ) . Let c E L be an element such that c 5 com(F) for every finite F C L ( A ) . Then c 5 com(G) for every finite G C A. Hence c 5 com(A). This proves that w m ( A ) = / \ { c o m ( ~ ): F is a finite subset of L ( A ) ) = com(L(A)).
Pave1 Ptik, Sylvia Pulmannovi
172
In what follows, we will often make use of the following important theorem, which extends the Foulis-Holland theorem [~reechie,19791, see also [~almbach, 1983; Navara and HyEko, to appear] and [ ~ t and ~ k PulmannovB, 1991, Prop. 5.1.13.a]. THEOREM 79. Let L be a lattice logic and let S c L have the property that among any three elements of S there is one which is compatible with the other two. Then the sublattice [S] of L generated by the set S is distributive (i.e., for any three elements a, b, c E [S]we have a A (b V c) = (a A b) V (a A c)). In the next part we will use the following conventions. We will write com(Ml , M2, . . . , M,) instead of com(Ml U M2 U . . . U M,), and sometimes we will use the symbol com(al, a2, . . . , a,, Q) instead of the more correct notation of com({al, a2, . . . ,a,), Q). THEOREM 80. Let Ai (i E N) be finite subsets of mutually orthogonal elements in L. Then for any finite subset Q of L we have com(Al,A2, ..., An,Q)
=
A{com(al,az, . , . , a n , Q ) : ( a 1 7 a z i . . . , a n )
E A1 x A2 x
... x A,)).
Proof. We will proceed by induction. Assume that n will show that
(2) com(al, a2, b2,. Consider the set
. . ,b,)
= com(a1, b2,
=
1 and A1 = {al, az). We
.. .,bn) A com(a2, b2, . . . ,bn).
where bd = b2 A . . A b$. The set B contains four-element classes for different d E Dn-l. Any two elements from different classes are orthogonal. Any two elements in the same class are mutually compatible, with the possible exception of a; A bd and a; A bd. Consequently, among any three elements of B there is always one compatible with the other two. Therefore we may use distributivity to obtain (2). The proof then continues by induction, first with respect to the cardinality of A1, then with respect to the number of sets Ai, i 5 n. For details, see [Pt& and PulmannovB, 1991, Prop. 5.1.141. In the following results we will apply properties of commutators to observables. We will view observables as logic morphisms x : B(M) -+ L, where B(M) is the a-algebra of Bore1 subsets of a separable Banach space M and L is a (lattice) logic. We will write R(x) := {x(E) : E E B(M)) for the range of the observable x. let us recall that R(x) is a Boolean sublogic of L. Let {x, : a E I) be a system of observables. Let us write
Quantum Logics as Underlying Structures of Generalized Probability Theory
173
If com{x, : a: E I ) exists, it is called the commutatorof the system { x , : a: E I ) of observables. k Pulmannovi, In what follows, we will need the following result (see [ ~ t i and 1991, Theorem 5.1.171). THEOREM 81. Let M be a separable Banach space and let L be a logic. A Boolean sublogic B of L is the range of an observable x : B ( M ) + L i f and only i f B is countably generated. THEOREM 82. Let I be an at most countable set and let {xi : i E I ) be a system of observables on a lattice logic L. Then com{xi : i E I ) exists in L. Moreover, there is a countable set Q such that Q C UiEIR ( x i ) such that com{xi : i E I ) = com(Q).
Proof. Let Qi denote a countable generator of R(xi). Let Li be the lattice sublogic of L generated by Qi. It is easy to see that Li C R(xi). Therefore Li is compatible, hence a Boolean sublogic of L, and therefore Li = R(xi). Further set Q = UiEIQi. Evidently, Q is at m a t countable. Since the set of all finite subsets of a countable set is countable, and since L is a a-lattice, the element com(Q) = n { c o m ( F ) : F a finite subset of Q ) exists in L. Let L ( Q ) denote the lattice sublogic of L generated by Q. By Corollary 78 com(Q) = com(L(Q)). By the first part of the proof we have R(xi) C L(Q)(i E I ) . This implies that com(F) 2 corn(&) for every finite subset F C UiEIR(xi). Let c E L be any element such that c 5 com(F) for every finite subset F of UiEIR(xi). Then com(G) 2 c for every finite subset G C Q (i.e., com(Q) 2 c). Hence com(Q) = com{xi : i E I ) . COROLLARY 83. Let
X I , 52,.
. .,xn
be observables on L. Then
Moreover, there exists a countable set {Et,. . . ,Ek : i E I ) such that
Proof. Observe that if a l , a2,. . . ,a, are compatible elements of L and F is a finite subset of L, then com{al, a2, . . . ,a,, F ) = com({a$ A .A a$ : d E Dn), F ) . We see that if G is a finite subset of UiEIR(xi), then G = G I U ..-U G,, where Gi C R ( x i ) (i 5 n ) are orthogonal sets. This implies that for every such finite set F we have com(F) = Aj com{xl (E:, . . . ,x, ( E i ) ) ,where the index j runs over a finite set. By Theorem 82, there is a countable system {Fn)nEWsuch that com(x1, 2 2 , . . .I 5,) = AnENcOm(Fn)In what follows, we will use the expression "observables are partially compatible" if the union of ranges of the observables is partially compatible. In what follows we will often make use of the following proposition the proof of which is straightforward.
174
Pave1 Ptdk, Sylvia PulmannovA
PROPOSITION 84. Suppose that a # 0 and suppose that {x, : a E I) i s a system of observables which are partially compatible with respect t o a. T h e n the mappings x, A a : B(M) + L[O,a] defined via (x, A a)(E) = x,(E) A a are compatible observables o n the logic L[O,a].
6.2 Joint probability distribution of Gudder type In the following definition, we consider observables on the Borel a-algebra B(M) of a separable Banach space M. Notice that the functional calculus for real compatible observables (Theorem 63) can be extended also to the latter case ([Ptbk and Pulmannovb, 1991, Chap. 41) in view of the fact that all separable Banach spaces have isomorphic algebras of Borel sets. Throughout this paragraph, let us assume that L is a lattice logic. DEFINITION 85. We say that the observables xl,x2,. . . , xn on L have a joint probability distribution of Gudder type in a state s if there is a (probability) state P,81,...,,n on B(M) such that, for every rectangle El x ... x En E B(Mn), the following equality is satisfied:
If such a state P,Sl ,...,,n exists, we will call it the probability distribution of Gudder type of the observables X I , . . . ,x,. Since a state on B(Mn) is uniquely defined by its values on the rectangle sets, the joint probability distribution of Gudder type is uniquely defined whenever it exists. The notion of joint probability distribution can be generalized in the following natural way. We say that a system 0 of observables {x, : a € J) has a joint distribution of Gudder type in a state s if the joint probability distribution of Gudder type in the state s exists for any finite subsystem x,,,~,,, . . . ,xan (a1, a 2 , . . . , an E J) of (3. THEOREM 86. T h e joint distribution of Gudder type for compatible observables XI,.. . ,an exists in a n y state s o n L.
Proof. Let $1, x2, . . . ,xn be compatible observables. By the functional calculus (Theorem 63), there exist an observable z and measurable functions fi : M + M(i 5 n) such that xi = z.f
Quantum Logics as Underlying Structures of Generalized Probability Theory
175
It follows that s.w is the joint distribution of Gudder type of X I , . . ,xn in the rn state s. As a corollary we obtain that the joint distribution of Gudder type exists for an arbitrary system of compatible observables. The following theorem gives a general criterion of the existence of the joint distribution of Gudder type in a given state 3. THEOREM 87. Let J be an arbitrary set. The observables { x , : a E J } have a joint probability distribution in a state s zf and only if for every a l , . . . ,an E J and every E l , . . . ,En E B ( M ) the following equality holds:
(3) s(com(xa,( E l ) ,xa2( E z ) ,. - - ,xan (En))= 1. Proof. Assume that equation (3) holds for every a l , . . . ,an E J and every E l , . . .,En E B(M). Fix a l , a2, . . . ,an E J and put xai = xi,i = 1,2,. . . ,n. By Corollary 83, there is a countable set { E f , . . . ,NA : i E I } such that
By (3), s ( c o m { x 1 ( ~ f. ). ., , x n ( E i ) } ) = 1 for all i E I . The a-additivity of s implies that s ( c o m { x l , x ~. ., . ,xn}) = 1. Write c := com{xl,x2,.. . ,xn}. Then xi, i = 1 , 2 , .. . ,n , are partially compatible with respect to c and by Proposition 84, xi A c, i = 1,2, . . . ,n are compatible observables on the logic [0,c]. Since s(c) = 1, the restriction of s to [0,c] is a state on [0,c]. It follows that the observables X I A c, 2 2 A C , . . . ,xn A c have a joint distribution of Gudder type in the state s, and hence there is a measure p on B(Mn) such that for every rectangle El x . x En,
p(E1 x
.
x En) = S
( X ~A
c(E1)A . . . A xn A c(En)).
Let Lo be the lattice sublogic of L generated by Ui,, R(xi). By Corollary 78, com(Lo)= c, and Lo is p.c. c. The restriction of s t o Lo is clearly a state on Lo. Therefore for every a E Lo, a = a A c V a A c'. Further, s(c) = 1 implies that s(a) = s(a A c). This entails that
p(E1 x . . . x En) = s(xl(E1)A xz(E2) A . . A xn(En)A C ) = s(x1( E l )A xz (E2)A ' ' ' A ~ n ( E n ) ) , hence the joint distribution of X I , . . . ,xn in the state s exists. Since the choice of a l , . . . , an was arbitrary, the system { x , : a E J } has a joint distribution. Conversely, assume that the joint distribution of Gudder type for observables { x , : a E J } exists in state s. Let xl,x2,. . . ,xn be arbitrary finite subsystem of the system {x, : a E J}. Then there is a probability measure p on f ? ( M n )such that p(E1 x x En) = s(xl(E1)A . . . A xn(En))for every E l , . . . ,En E B(M). From the properties of a measure p it can be easily derived that
Pave1 Ptdk, Sylvia PulmannovL
176
Recall that by Theorem 82, the commutator com{xi : i E I) exists for every at most countable system of observables {xi : i E I). Using properties of the commutator, we can easily derive the following result. THEOREM 88. Let I be a n a t most countable set. A system of observables {xi : i E I) has a joint distribution in a state s if and only if s(com{xi : i E I ) ) = 1. Let us note that if the joint distribution of Gudder type for observables {xi : i E I) exists in the state s, then the statistical properties of these observables with respect to the state s are the same as the properties of the compatible observables {xi A c : i E I ) , where c = com{xi : i E I). We may say that the existence of a joint distribution enables one to "compatibly reduce" the observables. In the next theorem, we introduce a criterion which does not depend on the notion of a commutator. THEOREM 89. T h e observables XI,x2, . . . ,x, have a joint distribution of Gudder type in state s if and only if s ( x i ( ~ :U E:)
A
A
xj(Ej))
=
s(x,(E:)
A
A
jSn,j#i
xj(Ej))
(4)
jSn,j#i
+
/\
s(xi(E3A
xj(Ej))
jSn,j#i for all i 5 n and Et, E:, Ej E B(R) such that E; n E: = 8.
Proof. We sketch the proof for n = 2, for n > 2 the proof is analogous. Let D be the class of all measurable rectangles E x F E B(R2) and let A be the algebra of all finite disjoint unions of elements in D. For E = El x E2 in D, define a set function POby putting Po(E) = s(xl(E1) A xz(E2)). Using condition (4) it can be proved that ,YO is finitely additive on 2). Let E E A, E = U i l n E i , E i E D , E i n E j = f l , i , j € { 1 , 2,..., n). Put
Then the set function p l : A 4 [O,11 is well defined and finitely additive. By a well known theorems of classical measure theory (e.g, [Halrnos, 1962; Pt& and Pulmannov6, 1991]), p l is a-additive, and hence it has a unique extension to a a-additive measure p on B(R2). Thus, p is the joint distribution of Gudder type of XI, 22,. . . ,x, in the state s. In the following definition, we introduce the concept of "degree" of noncompatibility for a countable system of observables. DEFINITION 90. Let I be an at most countable set. We say that the observables {xi : i E I) are:
Quantum Logics as Underlying Structures of Generalized Probability Theory
177
(i) compatible if com{xi : i E I))= 1; (ii) partially compatible if 0 < com{xi : i E I) < 1; (iii) totally noncompatible if com{xi : i E I}= 0.
6.3 Uncertainty relations and complementarity In this section we introduce a generalized definition of the famous Heisenberg uncertainty relations and a definition of complementarity for real observables on a unital lattice logic. We establish connections between concepts studied previously and commutators of observables. Recall that a set S of states on a logic L is called unital if for every a E L, a # 0, there is a state s E S with s ( a ) = 1. Note that the previous results allow us to formulate the following result, which is a sort of "classi6cation" of observables. PROPOSITION 91. Let I be a n at most countable set and let S be a unital set of states o n L. The observables { x i : i E I) on L are (i) compatible if and only if the joint distribution of Gudder type exists for all states s E S . (ii) partially compatible i f and only if there are states s l , s2 E S such that the joint distribution of Gudder type exists in s1 but does not exist in s2. (iii) totally noncompatible if and only if the joint distribution of Gudder type does not exist in each state s E S. The proof is obvious from Theorem 88. In the sequel, let us consider real observables o n a lattice logic L with a unital set of states S. The expectation of a real observable x in a state s is defined by r
provided the integral on the right exists. Let us first mention a problem which was popular in the eighties and nineties: the problem of uniqueness of observables (see [Gudder, 1979; Gudder, 19661, etc.). This problem is still not completely solved. It reads as follows: Suppose that for two bounded observables x , y we have s ( x ) = s ( y ) for any state s E S(L), does it follow that x = y? This question, which is very important for quantum stochastics, has the answer yes for projection logics as well as for Boolean logics, but in general the answer is no, (see [Navara, 19951 for a counterexample and review). Let us here present one of the positive results in order to gain insight into the problem. We will show that the question has a positive answer for the logics of the class C2- considered in section 4 (we will recall the definition in the formulation of the result). THEOREM 92. Let L be a logic such that
178
Pave1 Ptik, Sylvia Pulmannovd
(i) for any a E L there is a state s E S such that s(a) = 1 (i-e., L is unital), (ii) for any E E ( 0 , l ) and any a, b E L with a that s(a) 2 1 - E , s(b) 2 1 - E .
cft
b there is a state s E S such
Let x , y be two bounded observables on L such that s ( x ) = s ( y ) for any s E S. Then x = y. Let us first prove a lemma. LEMMA 93. Let L be a logic such that for any a E L there is a state s on L with s(a) = 1. Let x , y be two observables on L. If s ( x ) = s ( y ) for any s E S , then for any real r the relation x(r, +m)tt y(r, +m) implies x ( r ,+m)= y(r, +m).
Proof. Let x , y be two observables and let r be a real number. Put a = x(r, +m), b = y(r, +m) and suppose that a tt b. Then there are elements al,bl,c E L such that al 5 bi, a1 5 c', bl 5 c' and a = a1 + c , b = bl +c. Let a1 # 0. Then there is a state s on L with s ( a l ) = 1. It follows that s(bl) = 0 = s(c) and thus s(a) = 1, s(b) = 0, s(bl) = 1. Hence s ( x ) r, s ( y ) < r - a contradiction. Analogously, bl # 0 is not possible and we get a = c = b. This completes the proof. H
>
Let us come to the proof of Th. 92. Suppose that x # y. By the preceding lemma, there exists an r E R such that x(r, +m)cft y(r, +m).Hence x ( - m , r ) cft y(r, +m).Since Vr-, x ( - m , r - $ ) = x ( - m , T ) , there exists a number n E N such that x ( - m , r cft y(r, +a). Choose real numbers K , E such that y(-K, K ) = 1 and ~ ( 2 n K 1) < 1. Take a state s E S that satisfies
+
i)
Then
1 ( 1 - E ) . ( T - - ) + K E = ( ~ - E ) T - -( l n n s(y) 2 ( 1 - e)r - K E
s(x)
<
+KE,
and
Thus s(y) > s ( x ) , which is a contradiction. This completes the proof. The variance of x in the state s is defined by
provided the integral on the right exists. For observables X I , x2, . . . ,x, we put
Quantum Logics as Underlying Structures of Generalized Probability Theory
179
(7) V(xl, . . . ,x,) = {s E S : var,(xi) < oo, i 4 n). The following definition can be considered an expression of Heisenberg's uncertainty relations in the logicealgebraic approach.
DEFINITION 94. Let xl, xz, . . . ,x, be real observables on L. Then the following two cases can occur: E v ( x l , . . . ,x,)) : uar,(x~)var,(xz).. . var,(x,)
2 6;
2. (YE> 0)(3s E V(xl,. . . , x,)) : vars(xl)vars(xz). . . var,(x,)
< E.
1. (36 > O)(VS
In the case (1) we say that the observables XI,.. . ,x, satisfy the uncertainty relation. In the case (2) we say that the observables X I , . . . ,x, do not satisfy the uncertainty relation. PROPOSITION 95. If the observables XI, . . . ,x, are compatible, they do not satisfy the uncertainty relation. Proof. Let w : B(M) + L be the joint observable for X I , .. . ,x,. By Lemma 67 (generalized in an obvious way to observables on B(Rn)), a point (TI,rz, . . . ,r,) belongs to the spectrum w(w) of the observable w iff for any 7 > 0 we have
Since S is unital, there is a state s E S such that
The properties of the joint observable imply that s ( ~ i ( ( ri 7, Ti
+ 7))) = 1 (i 4 n).
This yields, for all i (i 4 n),
The last inequality implies that the observables XI,.. . ,x, do not satisfy the unrn certainty relation. THEOREM 96. If the observables XI,.. . ,x, satisfy the uncertainty relation, then com(xl, . . . ,xn) = 0. Proof. Put c = com(xl, . . . ,x,) and suppose that c # 0. Define Sc := {s E S : s(c) = 1). Since S is unital, S, # 8. If we restrict S, to the logic [0,c], we easily verify that Sc is a unital set of states for [O, c]. The observables xi A c (i 5 n) are compatible and have the same probability distributions in every state s E Sc as the observables xi (i 4 n). By Proposition 95, the observables xl A c, . . . ,x, A c on [0,c] do not satisfy the uncertainty relation. Since the variances of the observables xi A c (i 4 n) are equal to the variances of the observables xi (i 4 n) for all states in S,, the latter observables do not satisfy the uncertainty relation. This concludes rn the proof.
180
Pave1 PtAk, Sylvia Pulmannovi
The following definition is an attempt to formulate the notion of complementarity in the frame of quantum logics. It is motivated by the notion of complementarity of observables on the Hilbert space logic L(H). On L(H) the observables P and Q corresponding to momentum and position, respectively, are complementary. DEFINITION 97. We say that two observables x and y are complementary if for any bounded sets El F in B(W) such that w(x) (f El w(y) (f F we have x(E) A y(F) = 0. In the following propositions we list elementary facts concerning complementarity. The simple proofs are left to the reader. PROPOSITION 98. Two compatible observables are complementary if and only if at least one of them is a constant. PROPOSITION 99. Let a, b (a, b # 0 , l ) be two elements of L and let q,, qb be the cowesponding proposition observables such that q,({l)) = a, qb({l)) = b. Then q, and qb are complementary if and only if they are totally noncompatible. PROPOSITION 100. If the observables x and y are complementary and noncompatible, then they are totally noncompatible. The following example shows that the converse of Proposition 100 does not hold. Consider the Hilbert space W3. Notice that there exists no pair of nontrivial complementary observables. Let B1 = {el, e ~es) , and B2 = { f 1, f2, f3) be two bases of W3 with B1 n B2 = 0. Let [el denote the one-dimensional subspace generated by e E W3. Define two observables x and y on L(W3) as follows. Choose three real numbers TI, r z , T-3and put x({ri)) = [ei], y({ri)) = [fi] (i = 1,2,3). Then x and y are totally noncompatible but not complementary.
6.4
Sum logics and joint distributions of Urbanik type
The notion of a sum logic has its motivation in the quantum logic L(H) of closed subspaces of a (complex, separable) Hilbert space H. By the spectral theorem, there is a one-to-one correspondence between the real observables on L(H) and the self-adjoint operators on H . In particular, for every two bounded observables, their sum is defined as the observable corresponding to the operator sum of the corre sponding bounded self-adjoint operators. In certain cases the sums of unbounded operators exist, too. We will try to find a generalization of this phenomenon in the study of "sum logics". We note that in the definition of a sum logic L we need not require L to be a lattice logic. Let us recall the following notions (compare with Definition 44). A set S of states on L is said to be rich if the inclusion {s E S : s(a) = 1) C {s E S : s(b) = 1) implies a 5 b. A set of states S on L is said to be order determining if s(a) 5 s(b) for all s E S implies a 5 b. For a set S of states, we denote by conv(S) the a-convex envelope of S. Let L be a logic and let S be a rich a-convex set of states on L. For a real observable x on L, set V(x) := {s E S : s(x2) < 0 0 ) . In view of Schwarz
Quantum Logics as Underlying Structures of Generalized Probability Theory
181
inequality, s ( x ) ~5 s(x2), and since var, (x) = s(x2) - s ( x ) ~we , have V(x) = {s E S : var, (x) < m}. PROPOSITION 101. [Gudder, 19791 Let L be a logic and let S be a a-convex set of states on L which is rich. Let x be a real observable on L. Then x is bounded if and only if V(x) = S.
Proof. If x is bounded, then x2 is also bounded, hence V(x) = S. Conversely, let x be unbounded. We will show that there is a state s E S such that s(x2) < m does not hold. Let rn E w(x) be numbers such that 2n+2 - 1 > lrnl > 2,+l (n E N). Let U, be disjoint open balls in W with diameter less that 1 and with centers at r,. Put a, = x(U,). Since any Un is open and contains an element from the spectrum of x, we have a, # 0. Let s, E S be such that s,(a,) = 1. Since the elements ai(i E N) are orthogonal, we obtain sj(ak) = 0 for j # k. The state s = CjEN 2-jsj belongs to S. Assume that s(x2) < m . Then
which is absurd.
H
DEFINITION 102. We say that the real observables X I , (or that their sum exists) if
22,
.. . ,x, are summable
(i) the set V(xl,x2, . . . ,x,) := Uisn V(xi) is order determining; (ii) there is a unique real observable z such that V(z) > V(xl ,x2, . . . ,x,) and s(z) = ~ ( $ 1 ) s ( x ~ ) . . . s ( z ~for ) all s E V(xl, 5 2 , . . . ,5,).
+
+ +
The observable z is called the sum of the observables xl, x2, . . . ,x,, and we write z = x 1 + x 2 + ...+a,. DEFINITION 103. A pair (L, S ) , where L is a logic and S is a a-convex rich set of states, is called a sum logic if the following two conditions are satisfied: (i) every two bounded observables are summable; (ii) every two compatible observables are summable. The above definition implies that summability and the sum of observables xl,x2,. . . ,x, are invariant with respect to permutations of the set {1,2,. . . ,n} and with respect t o the mappings xi + rxi (i 5 n) for every r E W. Moreover, if X I , x2,. . . ,x, are summable and if the sums yl = XI x2 . . . xk: and y2 = xk+l x, exist, then XI + x 2 + - - - + x n = yl +y2. Notice also that if xi,i 5 n are compatible and xi = u. fsrl(i 5 n), then 2 1 . xn = u.(fl . . . fn)-l. We will see that the logic L(H) with S = S(L(H)) is a sum logic, and so are the logics of projections in a von Neumann algebra. To our knowledge, a characterization of sum logics is not known.
+...+
+ + + + + + +
Pave1 Ptdk, Sylvia Pulmannovi
182
Proposition 99 and Proposition 101 imply that every two bounded observables have a bounded sum. This allows us to prove the following statements. PROPOSITION 104. Let (L,S) be a sum logic. Then (i) if x, y are bounded observables, then x = y if and only if s(x) = s(y) (that is, L has the Uniqueness property); (ii) L is a lattice; (iii) every state s E S has the Jauch-Piron property (that is, for every s E S , if a, b E L and s(a) = 1 = s(b), then s(a A b) = 1). Proof. (i) Suppose that s(x) = s(y) for all s E S. Let qo be the proposition observable qo({O)) = 1. Then the observables x qo and y qo are sums of the observables x and qo. Since the sums are unique, we have x qo = y qo. Hence x = y. (ii) Let a, b be elements of L and let q,, qb be the corresponding proposition observables. We will show that (q, qb)({2)) = a A b. From s((q, qb)({2))) = 1 it immediately follows that s(q, qb) = 1, hence s(a) = 1 = s(b). Since S is rich, it follows that (q, qb)({2)) is a lower bound of a, b. Let c E L be such that c 5 a, b. Then the equality s(c) = 1implies s(a) = 1 and s(b) = 1. Hence, s(q,+qb) = s(a) +s(b) = 2. Since 2 is the maximal point of the spectrum w(qa+qb), we see that s(q, qb)({2)) = 1. This implies that c 5 (q, qb)({2)). We have shown that the infimum a A b exists in L for every a, b E L, i.e., L is a lattice. (iii) Suppose that s(a) = 1 and s(b) = 1 for s E S. By the proof of (ii), we conclude that s(a A b) = 1. Thus s has the Jauch-Piron property.
+
+
+
+
+ +
+
+
+
+
The notion of another type of joint distribution is based on the CramCr-Wold theorem in classical probability theory. Let p be a probability measure on B(Wk). For a E Wk, define ha : Wk + W by putting h,(r) = a.r = CiCkairi. If a is a real number, then the set {r : a.r 5 a) = P,(a) is a closed half-space in lRk. Further, we have p(P,(a)) = p.h;l(-oo,cr]. We recall that the CramCr-Wold theorem states that if pl and pz are probability measures on B(Wk) such that pl (Pa(a)) = pz(Pa (a) for every a E Wk and every a E W, then pl = p2. DEFINITION 105. We say that the observables X I , xz, . . . ,xn on a sum logic have a joint distribution of Urbanik type in a state s if the following two conditions are satisfied: aixi exists for any a (i) the sum Xi<, -
=
(al, az, . . .,h)E Wn,
(ii) there exists a probability measure p on B(Wn) such that, for any a E Wn and any a E R, p(Pa(a)) = s ( ( C aixi)(-m, 4 ) . i
Quantum Logics as Underlying Structures of Generalized Probability Theory
183
If such a measure p exists, we call it the joint probability distribution of Urbanik type for the observables xl,x2,. . . ,xn in the state s. We will write p = s, ,,...,., By using results from classical measure theory the following statement was , see also [ ~ t & and Pulmannovb, 1991, Th. 5.5.31). Let proved ( [ ~ r b a n i k19611, in the us denote by QS, the characteristic function of the observable xi state s, i.e. let us write Q: (u) =
((c
eiuts
aixi) (dt)).
ij n
THEOREM 106. The observables X I , x2, . . . ,xn have a joint distribution of Urbanzk type in a state s if and only if the function @(a) = @;(I) : Bn + C is the characteristic function of some n-dimensional probability distribution. PROPOSITION 107. Let X I , 5 2 , . . . ,xn be compatible observables on a sum logic (L, S). Then the joint probability distribution of Urbanik type exists in every state s E S. Proof. Let w be the joint observable of XI, x2, . . . ,xn. Then we have xi = w.?r1, where ri : Wn -4 W is the corresponding projection (i 5 n). By the functional calculus for compatible observables we obtain
for any a E Wn. Hence, for any E E B(W) we have
where s.w is the probability measure on L3(Wn) which is identical with the joint distribution of Urbanik type for the observables X I , xz, . . . ,xn in the state s. Indeed, we have airi)-l(-m, a] = P: (a).
(x isn
It should be noted that the joint distribution of Urbanik type for compatible observable~is identical with the joint distribution of Gudder type. As a consequence, we obtain the following result. PROPOSITION 108. Let (L, S ) be a sum logic and let XI, $2,. . . xn be bounded observables on L. If xl, x2, . . . ,xn have the joint distribution of Gudder type in a state s E S then they also have the joint distribution of Urbanik type in the state s, and both joint distributions are identical.
Pave1 Ptik, Sylvia PulmannovB
184
Proof. The proof follows by compatibility of the reduced observables xi Ac (i 5 n), rn where c denotes the commutator of XI,XZ, . . .,x,. The converse of Proposition 107 has been proved for discrete observables only
udder, 1966; Urbanik, 19851, [ ~ t &and k PulmannovB, 1991, Prop. 5.5.51. The more general case needs special properties of sum logics, which are satisfied, e.g., by the Hilbert space logic. 7 THE LOGIC OF CLOSED SUBSPACES OF A HILBERT SPACE In this section we consider the Hilbert space logic in more detail. This logic plays an important role in investigations into the mathematical foundations of quantum mechanics. We restrict ourselves to a complex separable Hilbert space H, although many results remain valid in more general situations. (It should be noted that there is a way of extending several techniques of Hilbert space logics to Prehiibert spaces. Interesting results along this line can be found in [~hetcuti, 2005; Chetcuti and DvureEenskij, 2003; DvureEenskij, 1993; Hamhalter and Pt&, 1987; Pt& and Weber, 2001; Buhagiar and Chetcuti, 2005; Cattaneo and Marino, 1986; Mushtari and Matvejchuk, 19851, etc.) By a subspace we here always mean a linear subspace of H and by a closed subspace we mean a subspace of H closed in the norm induced by the scalar product. Let M, N be subspaces of H. Write M N = {x y : x E M, y E N), denote by the norm closure of M in H , and set M' = {x E H : (x, y) = 0 Vy E M). Obviously, MI is a closed subspace of H . Consider the partial ordering of L ( H ) defined by set inclusion, and denote the least element by 0 (i.e., 0 = {O), and the greatest element by 1 (thus 1 = H). It is easily seen that with the inclusion ordering, L(H) becomes a lattice with the operations A, V defined by M A N = ~ n ~ a n d ~ ~ ~ = m . The following result is the so called projection theorem.
+
+
THEOREM 109. If M E L(H), then every vector x E H can be uniquely written in the form x = y z, where y E M and z E MI.
+
Proof. (see, e.g., [ ~ a l m o s 19511). , We may assume that x E H \ M . Put 6 = inf{llx - yll : y E M). By the definition of 6, there exists a sequence {y,) in M such that 11yn - XI 1 -+ 6. We then obtain
Thus {yn) is a Cauchy sequence. Since M is closed and H complete, there exists y E M such that yn -+ y. Since the norm on H is continuous, we obtain Ily-XI[ = limn,, llyn - 211 = 6. We will show that z = x - y E MI. Suppose that for some
Quantum Logics as Underlying Structures of Generalized Probability Theory
185
v E M w have cr = @(z,v ) , where /? is a real number. Using the equality llzll = 6, we obtain
This implies that for certain small negative values of /? we find (z, v ) = 0. We conclude that x = y z, where y E M , z E MI. This expression is unique: if x = yl 21, then y - yl = z - zl and since y - yl E M , z - zl E M', we obtain rn y = y1, z = z1.
+
+
THEOREM 110. The set L(H) endowed with the inclusion ordering and with the orthocomplementation operation defined above i s a lattice logic.
Proof. The infimum A of two elements becomes set intersection. It follows that the infimum of an arbitrary family of elements of L(H) exists and becomes set intersection. Assume that Mn E L(H) (n E N). Then V M, = A{M E L(H) : M > Un M,). Thus, L(H) is a a-complete lattice. The mapping M -+ M' is an orthocomplementation. Indeed, the inclusion M C N obviously implies N' c MI. Further, M A M' = 0, because x E M and x E M' yields (x, x) = 0, which means x = 0. The inclusion M C M u is obvious. Assume that x E M u \ M. By Theorem 109, x = y z with y E M and z E M'. We have z = x - y E M u , and therefore z E M u A MI. Thus z = 0, and hence M = Mu. Finally, assume that M c K ~ But and M ' A K =O. I f x K~ , thenwe h a v e x = y + z for y~ M a n d z MI. z = x - y E K , and, therefore, z = 0. Thus, M = K , and we have verified the orthomodular law.
+
By an operator on H we mean a linear mapping A : H -+ H. The n o r m of an operator A is defined by IlAll = sup{IIAxII : x E H, IIxII = 1). An operator A is bounded if the norm of A is finite. If A is bounded, the adjoint operator A* of A is defined by the equality (Ax, y) = (x, A*y) for any x, y E H . A bounded operator A is self adjoint if A = A*. A projection operator (also called a projection or a projector) is a bounded operator P such that P = P2= P*. THEOREM 111. To every closed subspace of H we can associate a unique projection, and every projection is associated with a unique closed subspace of H .
Proof. Assume that N E L(H). The projection associated with N , denoted by pN,is defined as follows: p N x = y, where y is the unique vector of N given by the decomposition x = y + z in the sense of Theorem 109. On the other hand, if P is a projection, the set Np = {x E H : P x = x) is the subspace of H associated with P. One can simply verify that pNis a projection, Np is a closed subspace, rn and that Nplv = N a n d pNp= P. The set of all projections on H can be endowed with a partial ordering by writing P 5 Q if P Q = Q P = P. The following statements are well known and easy to prove (e.g., [Halmos, 19511).
Pave1 Ptik, Sylvia Pulmannovi
186
PROPOSITION 112.
pN be the corresponding (i) Let M, N be closed subspaces of H and let pM, = pNpM, i.e., projections. Then M c N if and only if pM= pMpN pM5 pN.
+
(ii) M IN if and only if pMpN = pNpM = 0 if and only if pM pN is a projection. (iii) M, N are compatible in L(H) if and only if pMpN = PNPM (iv) For two projections P, Q, the operator Q - P is a projection if and only if p I Q(v) P Q is a projection if and only if P Q = Q P . (vi) If P is a projection, then 1- P is also a projection, and N 1 - ~= Nb. The states on the logic L(H) are characterized by the famous Gleason theorem [Gleason, 19571 stated below. THEOREM 113. (Gleason theorem) Let H be a separable Hilbert space with dim H 2 3. If s E S(L(H)) is a pure state on L(H), then there exits a unit vector v, E H such that s ( P ) = (v,, Pv,) (P E L(H)). Moreover, every state on L(H) can be written as a a-convex combination of pure states such that the unit vectors corresponding to them are mutually orthogonal. Gleason's theorem implies that the pure states s on L(H) are in a one-to-one correspondence with unit vectors v, in H (i.e., v, E H, Ilv,l\ = 1) given by s(P) = ( P v , , ~ , ) . Therefore pure states are also called vector states. Moreover all states on L(H) are in a one-bone correspondence with the positive self-adjoint traceclass operators with unit trace (so-called density operators). That is, to every state s there corresponds a positive operator T,= CiEN c ~ P [ ~ ~ I ,where CiEN cj = 1, and {vj : i E N} is a complete orthonormal set of vectors in H. We then have that s(P) = tr(T,P) = CiEN ~ ( P v jvj). , Let us note that Gleason's theorem also holds for separable real and quaternionic Hilbert spaces with dimension at least three and it can be extended to certain nonseparable Hilbert spaces (see [~vure~enskij, 1993; Hamhalter, 20031). Let ( 0 , C) be a measurable space. A spectral measure is a mapping E : C + L(H) such that the following conditions are satisfied: (i) E ( 0 )
=
1;
(ii) if S1,S2E C and S1n S2= 0, then E(Sl)
IE(S2);
(iii) if Sj, i E M is a collection of pairwise disjoint sets of C, then E(UjENSi) = CiENE(Si), where the sum on the right converges in the strong operator topology.
Quantum Logics as Underlying Structures of Generalized Probability Theory
187
In other words, a spectral measure is an observable E : C 4 L(H). If C = B(W), then E is a real observable. The real observables on L(H) are characterized by the spectral theorem. Before stating it, let us first generalize the notion of bounded operator. Let D be a dense subspace of H and let T : D + H be a linear mapping. Call T again an operator on H. Then one can define the operator T* adjoint to T such that the following conditions are satisfied: The domain of T* is determined by the requirement D(T*) = {y E H : there is a unique y* E H such that (Tx, y) = (x, y*) for any x E D(T)), and we define T*y = y* (y E D(T*)). An operator T is called self-adjoint if T = T*.
THEOREM 114 (Spectral theorem). For any self-adjoint operator A on a Hilbert space H there exists a unique observable pA: B(B) + L(H) such that (i) the domain D(A) of A consists of all vectors x E H for which the integral J X2 ( p A(dX)x, x) converges, (ii) for any x E D(A) and any y E H we have (Ax, y) = 5 x(P*(~x)x,y). Conversely, for any real observable E there exists a unique self- adjoint operator
A such that E = pA. For the proof of the spectral theorem see, e.g., [Halmos, 19511. The spectral measure corresponding to a self-adjoint operator A is also sometimes called the spectral resolution of A. The spectrum of an operator A is defined as the set of all complex numbers c such that the operator A- cl has no bounded inverse mapping. It can be proved that the spectrum of a self-adjoint operator A coincides with the spectrum of the corresponding observable pA. Let s be a state on L(H) and let T be the corresponding density operator. Let A be a self-adjoint operator and let pAbe the corresponding observable. Then for the expectation of A (equivalently, of p A ) in the state s we have
if the integral converges. Let us conclude this section by showing that the Hilbert space logic is a sum logic in the sense of Definitions 102, 103. This fact is important in quantum axiomatics. By the spectral theorem, if A is a self-adjoint operator, we can identify it with the corresponding observable, and hence view A as a mapping from B(W) to L(H). If f : W + W is a measurable function, then f (A) = A.f-I is an observable too (for example,A2 = A.f -', where f (t) = t2). Denote by D(A) the domain of a self-adjoint operator A. Recall that, in case A is unbounded, D(A) is a dense subset of H . Moreover, we can write D(A)
J t z ( ~ ( d t )u)~ ,< m )
=
{u E H :
=
{ U E H : s,(A2)
< m).
Pave1 Ptik, Sylvia Pulmannavd
188
PROPOSITION 115. Let Sv be the set of all vector states on L ( H ) . Then S C Sv is rich for L ( H ) i f and only i f S = Sv. Proof. Richness of Sv is obvious. If S # Sv, then there is a vector v E H such that sv 4 S . Let [v]be the subspace generated by the vector v . Then the equality s,([v]) = 1 holds for no s, E S , contradicting the hypothesis that S is rich.
COROLLARY 116. Let A be a self-adjoint operator. Then the following statements are equivalent: (1) the set S ( A ) of all vector states corresponding to the vectors of D ( A ) is rich for L ( H ) ; (2) D ( A ) = H ; (3) A is bounded. PROPOSITION 117. For a linear subspace K of H , write S ( K ) = {s, : u E K , llull = 1). Then K is dense i n H i f and only i f S ( K ) is order determining for L(H)Proof. Let K be dense. Then if s,(P) 5 s,(Q) for all unit vectors in K , we infer that ( P v ,v ) 5 (Qv,v ) for all v E H , and hence P 5 Q. This shows that S ( K ) is order determining. Conversely, let KO be a subset of H be such that the set S ( K 0 ) = {s, : u E K ) is an order determining set of states. Let K l be the linear subspace generated by KO. Obviously, S ( K l ) is order determining for L ( H ) . Let K be the closure of K 1 in H . Then for every u E KO we have s,(K) = 1. Since S ( K o ) is order determining, we have K = H .
Observe that if s = CiEN aisi and s(A2) < CO, then si(A2) < ca for all i E W. Moreover, if P, Q E L ( H ) and if si(P) 5 si(Q) for all i, then s ( P ) 5 s(Q). This implies that the set {s E S ( L ( H ) ) : s ( A 2 ) < ca) is order determining for L ( H ) if and only if the set of vector states {s, : s,(A2) < ca) is order determining for L(H). If A is a self-adjoint operator, its domain D ( A ) is dense in H . If A , B are selfadjoint operators, then their sum A B is defined on D ( A ) n D ( B ) . It is known that A B need not be self-adjoint. But if at least one of A, B is bounded, then A B is self-adjoint (see e.g. [ ~ u n f o r dand Schwarz, 19571, [~ru~ovecki, 19711). If A , B commute, i.e. if they correspond to compatible observables, then we have by functional calculus of compatible observables that A B is self-adjoint. Let us finally describe an algebraic construction in connection with sum logics. Let x , y be two bounded real observables on a sum logic. The so called Segal product is defined by 1 x o y = z [ ( x + ~ ) 2 (- X - Y ) ~ ] .
+
+
+
+
In [ ~ u d s o nand Pulmannovb, 19931, the following statement was proved. THEOREM 118. Let L be a sum logic such that on the set of Ob(L)of all bounded observables on L , the Segal product is distributive (with respect to the sum of observables). Then Ob(L)admits the structure of a Jordan algebra.
Quantum Logics as Underlying Structures of Generalized Probability Theory
189
8 JOINT DISTRIBUTIONS ON THE HILBERT SPACE LOGIC The main result of this section is the statement that observables having a joint probability distribution of Gudder type in a state s also have a joint probability distribution of Urbanik type in the state s, provided that all required sums exist. Let L(H) be the logic of a separable Hilbert space H (real or complex) with dim H 2 3. Let B(M) be a Bore1 a-algebra of subsets of a separable Banach space M (later on we will restrict ourselves to the real observables). Recall briefly our notations. If C is a closed subspace of H , then pCdenotes the corresponding projection. For a vector v, the symbol [v] denotes the one-dimensional subspace generated by v. If llvll = 1, then s, : C + (v, pCv) denotes the corresponding state on L(H). By Gleason's theorem, for every state on L(H) there is a density ~ ) that T is positive, self-adjoint and operator T with s(C) = s ( p C ) = ~ T ( T P such has a unit trace. In agreement with the preceding sections, we write, for all d = (dl, dz, . . . ,d,) E Dn, D = (-1, I), and all F E L(H), Fdi = F provided di = 1, and ~~i = F' provided di = -1. THEOREM 119. Let v be a unit vector in H. The observables X I , xz, . . . ,xn on L(H) have a joint distribution of Gudder type in the state s, zf and only if for any El,Ez,.. .,En E B(M) and any permutation p of the set {1,2,. . . , n ) the following equality holds: (8) p x l ( E 1 ) . . . p ~ n ( E n=) P~X P ( ~ ) ( E P. .( .~p)~ p ( n ) ( E ~ ( n ) ~ . For the proof of this theorem we need some simple lemmas the proofs of which are left to the reader. LEMMA 120. If the equality (8) holds for a vector v E H , then ~ X ~ ( E I ) A . . . A X ~=( E pzi(E1). ~), .. p ~ n ( E n ) ~ . LEMMA 121. Let {vi : i E N) be an orthonormal set of vectors. If llv112 = CienI(", vi)I2 for a vector v E H , then v = CiEn(v,vi)vi. LEMMA 122. Let VI, Vz, for a d € Dn. Then
.. .,Vn E L(H) and let v E H, v # 0.
pVp(1)
*
. .pVp(n),
Let v E Ai<, -
~ i ~ '
= pV1. . . pVnv
for every permutation p of the set {1,2,. . . ,n). Let us now prove Theorem 119. Proof. Assume that the equality (8) holds for v E H , llvll = 1. Then by Lemma 120 we have
190
Pave1 Ptdk, Sylvia Pulmannovd
Using Theorem 87, we get that the observables X I , x z , . . . ,x, have a joint distribution of Gudder type in the state s,. Suppose that a joint distributions of Gudder type for the observables X I , xz, . . . , x, in the state s, exists. Let El, E2,.. .En E B(M). By Theorem 87, we have
This equality yields
where we put M(d) = Ai<, x ~ ( E ~ )( d~ E ' Dn). Obviously, the vectors { P ~ ( ~ :) v d E Dn) are mutually orfiogonal. Applying Lemma 121, we see that the vector v is a linear combination of the vectors P ~ ( ~ )Byv Lemma . 122, condition (8) is satisfied. This completes the proof of Theorem 119. The following theorem gives a necessary and sufficient condition for the existence of a joint distribution of Gudder type. THEOREM 123. Let X I , x z , . . . ,x, be observables and let s be a state with the density operator T = CiEN Ci~[v"I. (i) T h e joint distribution of Gudder type for X I , x z , . . . ,x, in the state s exists if and only if the condition 8 of Theorem 119 is satisfied for each vector vi ( i E M ) . (ii) If X I , 2 2 , . . . ,x, are real bounded observables and if A1,A2,. . . ,A, are the corresponding bounded self-adjoint operators o n H , then the following conditions are equivalent:
(a) the observales X I , xz, . . . ,xn have a joint distribution of Gudder type in the state s;
(b) the condition (8) of Theorem 119 holds for each vector v i ( i E N ) ;
( c ) the equality Al . . . Anvi = Ap(l).. .Ap(,)vi (i E M ) holds for a n y permutation p of the set { 1 , 2 , . . . ,n ) ;
(d) the equality A1 . . .A,T the set { 1 , 2 , . . . ,n ) .
=
Ap(l).. .Ap(,)T holds for every permutation p of
Quantum Logics as Underlying Structures of Generalized Probability Theory
191
Proof. By Theorem 87 we see that a joint distribution of Gudder type in the state s = CiENsi exists iff it exists in state si for all i E M. Combining this with Theorem 119, we obtain that (i) holds. From the properties of spectral measures and Theorem 119 we deduce that statement (ii) holds. THEOREM 124. Let { x , ) , ~ ~be a system of observables on L(H). Denote by Ho the set of all vectors in H that satisfy the condition (8) for any finite choice xal, x a 2 , . .. ,x,,, all02,. . . a, E I. Then Ho is a closed linear subspace of H and the equality Ho = com{x, : a E I) holds. Moreover, if s is a state with the C i ~ [ v 'then ] , the joint distribution of Gudder type for density operator T = CiEN the observables {x, : a E I) in the state s exists if and only if vi E Ho for all i (i E N).
Proof. It is easy to check that Ho is a closed linear subspace of H . Since L(H) is a complete lattice, the commutator C := com{x, : a E I) exists. Moreover, since L ( H ) is separable (in the sense that every orthogonal set of projections is at most countable), we can find a countable subset J of I such that C = com{xj : j E J) (see Proposition 22). Let v be a unit vector and s, the corresponding state. By Theorem 119, v E Ho if and only if the joint distribution of Gudder type for {x, : a E I} exists in the state s,. Since C = com{xj : j E J), we deduce (Theorem 87) that the joint distribution for the observables {x, : a E I) in the state s, exists if and only if s,(G) = 1, i.e., if and only if v E C . It follows that Ho = C . The remaining part of the proof follows by Theorem 123. The next theorem is a converse of Proposition 107 for bounded observables on L(H). We will follow the proof in [Varadarajan, 1985, Theorem 4.251. Let us first introduce some notations. Let x j ( j 5 k) be bounded observables on L(H), and let Aj be the bounded self-adjoint operator corresponding to xj. If cl, c2,. . . ,c, are real numbers, put c = (cl,. . . ,ck), A(c) = clAl + c2A2 + . - -+ cnAn Let E H P ~ ( ~ ) ( E=: ) Q(c; E ) be the spectral measure of A(c). If q5 E H is a unit vector, we have s + ( p A ( " ) ( ~ )= ) s+(c;E) = IIQ(c;E)II, so that s+(c;E ) is a probability measure on B(R). Let us recall that observables X I , . . . ,xk have a joint distribution of Urbanik type in a state s+ if there is a probability measure p+ on B(W) such that
where E(c) = {(tl, t2,. . . ,tk) : cltl
+ + cktk E E). ''
For the proof of the theorem announced we need the following lemma. LEMMA 125. Let B be a nonnegative self-adjoint operator and S,T two projections such that B 5 S and B 5 T. Then B 5 S A T.
192
Pave1 P t i k , Sylvia Pulmannovi
Proof. Let Ns, NT be the ranges of S,T, respectively. Then l l ~ ~ / ~ 5 v 1I I1S~V ~ ~ ~ , and hence B vanishes on Nk. Similarly, B vanishes on N+ and hence B = 0 on (NsflN~)'.Since B is self-adjoint, it leaves NsnNT invariant, and for v E N,nNT, (Bv,v) 5 ll~11~. Thus B 5 pNsnNT =S A T . THEOREM 126. T h e bounded observables xl, x2, . . . ,xk o n L(H) have a joint distribution of Urbanik type in all states o n L(H) if and only if the operators Al, A2,. . . , Ak corresponding t o X I , x2,. . . ,xk commute with one another.
Proof. Sufficiency follows by Proposition 107. To prove necessity, assume that the observables in question have a joint d i s tribution of Urbanik type in all states on L(H). Let us restrict ourdelves to the case k = 2 and prove that AlA2 = A2A1, the in the general case the argument is similar. For any nonzero 4 E H, we write 11, = (11411)-14 and define q+ := 11~$11~~+. Then q+ is a nonnegative measure on B(W2) and q+(W2) = 11q5112. Set qo = 0. For any pair for vectors 4,4' E H, let us define a C-valued measure q+,y by the polarization formula
We claim that for each M E B(R2), the map (q5,4') sesquilinear on H x H . Indeed, let us write
I+
q+,y (M) is bounded and
If M = E(c), E E B(W), then q+(M) = (Q(c;E)@,4) and hence
which entails v(M) = 0. Since this equality holds for all M = E(c), it follows v = 0. Similar arguments complete the proof that (q5,qh1) I+ q+,y is sesquilinear. Fkom 0 5 q+,y(M) 5 11q5112 we conclude that (#,+I) H q+,v is bounded. Using well-known techniques, we can construct a unique bounded self-adjoint operator PMsuch that q+,v(M) = (PM414)Clearly, 0 5 PM5 1 for all M , P@ = 0, P R z = 1. Moreover, as M I+ Q+,+I(M)is a measure, PMis countably additive with respect to the disjoint sets MI, M2,. . .. We also have q+,+(M)2 0. Moreover, MI C M2 implies PMl5 PMz . If M = E(c), then PM= Q(c; E). We have to show that for any two sets El, E2 E B(W), the operators Q1 := Q((1,O);E l ) and Q2 := Q((0,l); E2) commute. Since El x E2 C El x R, we have
Similarly,
P E ~~ ~P WE X~E=Q2. ~
Quantum Logics as Underlying Structures of Generalized Probability Theory
193
From Lemma 125 we conclude that
Replacing E2 by W \ E2,we obtain
The last two inequalities give us
where the last inequality holds because Q1 A Q2 and Q1 A (1 - 92) are orthogonal projections. Hence we obtain
from which we conclude that Q1 and Q2 commute.
rn
We now establish an important connection between the joint probability distributions of Gudder and Urbanik type on L(H) (L(H) can be regarded as a prototype of a sum logic). This extends the result of Proposition 108 to certain unbounded real observables on L(H). We do not go here into details concerning sums of unbounded operators, see e.g. [Ptiik and PulmannovS, 1991, Theorem 5.6.81. THEOREM 127. Let x and y be real observables on L(H), and let for all a,P E W the observables a x + Py exist. Then if the observables x and y have a joint distribution of Gudder type i n a state s , they also have a joint distribution of Urbanik type in the state s, and these joint distributions coincide. Proof. We sketch the proof of Theorem 127. In view of Theorem 123, it is sufficient to consider only vector states. Let v be a unit vector in H and let the joint distribution of Gudder type exist in the state s,. Applying Theorem 124, we find that v E Ho, where Ho = com(x, y). Let A, and A, denote the self-adjoint operators on H corresponding to x and y, respectively. Then PH0 commutes with A, and A,. That is, Ho reduces A, and Ay, the reduced operators A,/Ho and A,/Ho are self-adjoint and the corresponding observables xo and yo on L(Ho) are compatible. The observables a x and Py are summable if and only if aA, + PAy is essentially self-adjoint (i.e., aA, PAy has a unique self-adjoint extension aA, + PA,, corresponding to the observable ax+Py). Then Ho reduces also the self-adjoint operator corresponding to ax+Py, and (ax+Py)o = axo+Pyo. Since xo and yo are compatible, they have a joint distribution of Urbanik type in the state s, (restricted to Ho). This joint distribution is identical with the joint distribution of Gudder type (Proposition 107). This means that there is a measure p on 13(W2) such that
+
Pave1 Ptik, Sylvia Pulmannovi
194
for all a,p E R and all E E B(W). We can further write 3,
(axo + pya) ( E ) )
=
(v, p ( a " ~ + P ~ o ) ( E )=) ~(v, ) P(""+~Y)~(~))V)
-
(v, P ( ~ " + ~ ~ ) (=~ S), V (ax )
+ py) (E)).
This implies that the joint distribution of Urbanik type for x and y in the state s, exists. If E, F E B(W), then p(E x F )
s,(xo(E) A yo(F)) = (v, = (v, P ~ ( ~ ) P ~=( s,(x(E) ~ ) ) A y(F)), =
which implies that the joint distribution of Gudder and Urbanik type for the observables x and y are equal (since they are equal for the observables xo and yo). The proof is complete The following example shows that the converse of Theorem 127 does not hold. Let us consider operators P and Q of momentum and position on L2(R). Thus the operator Q has the domain D(Q) = {f E L2(B) : 5 lrf(r)12dr < m), and (Qf)(r) = r f (r) for f E D(Q). The operator P has the domain D(P) = { f E L2(R) : ~ p j (12dp ~ ) < m ) , where f" is the Fourier-Plancherel transform of f (r), and (Pf)(r) = - i h q . It is well-known that P and Q satisfy the Heisenberg uncertainty relation, and therefore they do not have a joint distribution of Gudder type in any state. In fact, they are even complementary. But it was proved in [Urbanik, 19611 that they have a joint distribution of Urbanik type in the state
5
and do not have one in the state
9 APPENDIX 1: UNCERTAINTY RELATIONS Let L be a quantum logic and S(L) the state space of L. Let x be a real observable on L. Let var,(x) denote the variance of x in the state s. Put V(x)
= {s E S(L) : var,(x)
< m).
For any two real observables, the following alternative possibilities can occur:
(A) (VE > 0)(3s E V(x) n V(y))(var,(x).var,(y) < 6). (B) (36 > O)(Vs E V(x) n V(y))(var,(x).var,(y) 2 E).
Quantum Logics as Underlying Structures of Generalized Probability Theory
195
If (B) occurs, we say that the uncertainty relation holds for x and y. For t E R, 6 > 0, put U(t, 6) = {r E W : It - rl < 6). Notice that if t belongs to the spectrum of x, then x(U(t, 6)) # 0. Recall that L belongs to the class L3 if S(L) is unital (i.e., to every a E L there is a state s E S(L) with s(a) = 1) and for any a, b E L such that a cft b there is s E S(L) such that s(a) = s(b) = 1. Let a, y be real observables on L with the spectra a(x), a(y), respectively. The following two cases can occur:
(b) (3(u7V,6) : u E u ( x ) , ~E o ( Y ) , ~> 0) (Vqo rla)(x(U(u, 6)) cft Y ( U ( ~rl))). ,
>
0) (3q,0
<
q
<
In [PulmannovA, 1988], the following results were obtained. THEOREM 128. Let L be a logic with the unital state space. If for the observables x and y on L the condition (a) holds, then the uncertainty relation does not hold. In other words, (a) =+ (A). Moreover, if L is a lattice, then (a) implies that x and y are compatible. THEOREM 129. Let L E L3. Then the uncertainty relation does not hold for any pair of observables x, y. Proof. Let x, y be observables on L. By Theorem 128, (a)+-(A).Suppose that (b) holds for x and y. Then there are u E a(x), 6 > 0, v E a(y) such that to any qo > 0 there is q < qo with x(U(u,6)) cft y(U(v,q)). AS L belongs to L3, there is a state s E S(L) such that s(x(U(u, 6))) = 1= s(y(U(v, 71))). Choosing q sufficiently small, we obtain var,(x).var,(y) < 6 for any given E > 0.
10 APPENDIX 2: BELL INEQUALITIES ON QUANTUM LOGICS J.S. Bell ell, 19601 introduced examples of inequalities valid in classical prob ability theory. However, these inequalities were found to be violated in certain quantum mechanical experiments. The Bell inequalities are sometimes considered as "tests" of "hidden variables", i.e., tests of the nearness of the probability model used to the classic Kolmogorov model. Many results can be found in the literature that suggest the non-existence of hidden variables in quantum mechanics (see e.g., [Kochen and Specker, 1967; Beltrametti and Cassinelli, 1981; Giuntini, 1991; Bell, 19601). In the logicealgebraic approach to quantum mechanics, the standard model of the set of experimentally verifiable propositions of a physical system, which is based on a Boolean a-algebra, is replaced by a more general model based on a "quantum logic". The quantum logic is commonly supposed to be an o r t h e modular a-poset. In the standard Hilbert space approach, the quantum logic is the projection lattice of a Hilbert space.
196
Pave1 Ptdk, Sylvia PulmannovA
There are several formulations of the problem of hidden variables in the logice algebraic approach. Typically, the existence of hidden variables is related to the existence of a rich supply of dispersion-free states on the set of propositions. A physical system is considered to be L'classical" if its set of propositions forms a Boolean a-algebra. The problem that arises now is that there are Boolean aalgebras which posses many states but no dispersion-free states. As a result, even certain classical systems would on this view not admit hidden variables. So the existence of hidden variables as a test of whether or not a system is "classical", resp. "quantum" may not be entirely convincing. An attempt to overcome this difficulty has been made in [Deliyannis, 19711, where in the criterion of the existence of so-called quasi hidden variables the dispersion-free states have been replaced by dispersion-free quasistates, i.e., finitely additive states. Recently q isi is, 20001, a suitable definition of so called approximate hidden variables has been found in terms of countably additive states. For our purpose, the approach using quasi hidden variables in terms of finitely additive states is more appropriate in order to find connections with certain kinds of Bell inequalities. In this section, we will make the connection between the existence of quasi hidden variables and the Bell inequalities on orthomodular lattices ([~ulmannovi, 20021). We will consider Bell inequalities in a probabilistic formulation (see [pitowski, 19891). These Bell inequalities on quantum logics have been studied, e.g., in [Beltrametti and Mqczyhski, 1991; Pykacz and Santos, 1991; Pulmannova and Majernik, 1992; Pulmannovi, 1994a; D'Andrea and PulmannovB, 1994; DvureEenskij and Langer, 19951.
11 QUANTUM LOGICS AND PHYSICAL SYSTEMS Again, by a quantum logic we mean a a-complete orthomodular poset L. Recall that a mapping h : L1 -+ L2, where L1 and L2 are quantum logics is a a-homomorphism (of quantum logics) if (1) h(1) = 1, (2) h(at) = h(a)', and (3) if a = Vai for a sequence (ai)$ of pairwise orthogonal elements of L1, then h(a) = V h(ai). A a-homomorphism which in addition preserves all existing infima and suprema, is called a lattice a-homomorphism. A surjective a-homomorphism is an isomorphism if a 5 b ifF h(a) 5 h(b). If L is a logic, by a state on L we mean a countably additive state. By relaxing this condition to finite additivity, we speak on finitely additive states. The set of all states (the state-space of L) will be denoted by S(L). Let L be a logic and s a state. For any element a E L, the dispersion of s at a ~ . total dispersion of s may be defined as is the number s(a) - ~ ( a ) The
A state s is dispersion-free if a(s) = 0, i.e., if the range of s is (0, 1). Obviously, the latter notions make sense also for finitely additive states and we shall occasionally use them for this setup.
Quantum Logics as Underlying Structures of Generalized Probability Theory
197
Let L be a logic, and R, S two sets of finitely additive states. We say that R generates S if there is a a-algebra C on R such that (i) for every a E L, the map w o w(a) is C-measurable, (ii) for every s E S, there exists a probability measure p, on (R, C) such that for all a E L,
In accord with Chapter 1, let L be a logic and S a set of (finitely additive, in general) states on L. S is called order-determining if the inequality s(a) 5 s(b) for all s E S implies that a 5 b, and S is called rich if a -$ b implies that there is s E S with s(a) = 1,s(b) < 1. A system is a pair (L, S ) where L is a logic and S is an order-determining set of states. If (L, S) is a system, then a pure state is an element of S which cannot be written as a nontrivial convex combination of elements of S. If (L, S) and (L', Sf) are systems, a mapping f : L + L' is a system imbedding if f is a a-homomorphism of logics and (1) for every s E S, there exists sf E Sf such that sfo f = s. Observe that if f is an imbedding, then a 5 b iff f (a) 5 f (b). By definition, a system (L, S ) is a subsystem of (L', S f ) if there is a system imbedding of (L, S ) in (L' , St). Let us consider the following examples isis is, 20001. Example 1. Let L be a Boolean a-algebra. Let L possess an order-determining set of states. Consider the system (L, S(L)) associated with L. It can be derived from the LoomisSikorski theorem that there is a measurable space (R, C) and a set M of finite measures on (0, C) such that L is isomorphic to the quotient of C by the a-ideal {A E C : p(A) = 0 for all p E M}. This example has the following important special cases. ( l a ) . Let (R, C) be a measurable space. The system associated with it is the pair (C, S(C)). ( l b ) . Let (R, C, v) be a a-finite measure space. The system associated with it is the pair (L, S(L)), where L is the quotient of C by the a-ideal of sets of measure zero. Then S(L) can be identified with the set of the probability measures on C that are absolutely continuous with respect to v. Example 2. Let H be a separable Hilbert space, dim H 2 3. The system associated with it is the pair (L, S), where L is the logic of all closed subspaces of H (equivalently, of all orthogonal projections) and S is the set of all states on L. Examples ( l a ) and ( l b ) are related to classical mechanics. Example (2) corresponds to standard quantum mechanics. According to [Varadarajan, 1985, p.116-1171, if w is a dispersion-free state on a countably generated Boolean a-algebra L, then there is an atom p of L with
198
Pave1 Ptik, Sylvia Pulmannovi
w ( p ) = 1. So if L has no atoms, it has no dispersion-free states. Consequently, if
L is a logic with a countably generated Boolean a-subalgebra with no atom, then L has no dispersion-free states. It can is easily seen that a logic has a countably generated Boolean a-subalgebra with no atoms iff L admits an observable with the discrete spectrum empty. So we may conclude that while in Example ( l a ) all realvalued observables have nonempty discrete spectra, in Example ( l b ) there may be observables with empty discrete spectrum, like, e.g., the position observable. In standard quantum systems, if H is finite-dimensional, then all observables are discrete, while if dim H = oo, there are observables, like position and momentum observables, with continuous spectra. So the non-existence of dispersion-free states is not a criterion of whether a system is classical or quantum. There is an important difference between examples ( l b ) and (2). While in the first case all pure states are dispersion-free, in the second case there are pure states which are not dispersion-free. In some hidden-variable approaches, it is required that only that the pure states be generated by dispersion-free states. But this criterion cannot be applied to quantum mechanical systems with no pure states. The usual definition of a system that admits hidden variables is as follows. DEFINITION 130. A system (L, S) is deterministic if the set of dispersion free elements of S generates the entire S. DEFINITION 131. A system (L, S ) admits hidden variables if there is a set SHV such that SHv > S and (L, SHV)is a deterministic system. Recall that a logic L is concrete if L can be represented by a collection of subsets of a set [ ~ t a kand PulmannovL, 19911. By Theorem 48, a logic L is concrete if and only if it admits an order-determining set of dispersion free states. Observe that for dispersion free states, the notions of rich and order-determining system of states coincide. Recall further that the Jauch-Piron condition is satisfied for a, b if for every state s on L, if s ( a ) = s(b) = 1, then s ( a A b) = 1.
THEOREM 132. [ ~ e l i ~ a n n i19711 s , Let (L,S) be a system, S1 a generating set of states for S. Then L i s isomorphic (in the quantum logic sense) to a logic which i s represented by functions o n the set 0. If the states in S1 are dispersion free, these functions are characteristic functions of subsets of S1. Moreover, a necessary and suficient condition for the above isomorphism to preserve infimum a A b (or supremum a V b) i s the Jauch-Piron condition for this particular pair.
Remark. The preceding theorem implies that if a system (L, S) admits hidden variables, then L is a concrete logic. The converse need not be true. Indeed, a necessary and sufficient condition that a system (L, S), where L is a concrete logic admits hidden variables is that all states in S can be extended to states on a Boolean a-algebra of sets. Example ( l a ) is clearly deterministic. But in Example ( l b ) , if v is nonatomic, then every probability measure that is absolutely continuous with respect to v is
Quantum Logics as Underlying Structures of Generalized Probability Theory
199
also nonatomic, so it cannot be dispersion free. Thus L has no dispersion free states, hence (L, S(L)) does not admit hidden variables. In Example (2), the associate system (L,S) is deterministic ifE dimH = 1. If dimH 2 3, H has no dispersion free states [Alda, 19811. So in this case, (L, S) does not admit hidden variables. We see that the above definition does not distinguish classical and quantum systems. An interesting way to overcome this difficulty has been suggested in [Deliyannis, 19711. DEFINITION 133. A system (L,S) admits quasi hidden variables if the set of finitely additive dispersion free states of L generates S. The next lemma shows that a system (B, S) associated with a Boolean a-algebra B admits quasi hidden variables (see also [Deliymnis, 1971, Theorem 61). LEMMA 134. Let B be a Boolean a-algebra, and let s be a (a-additive) state on B. Then s is generated by finitely additive dispersion free states on B. Proof. Let Q denote the set of all finitely additive dispersion free states on B. For a E B, let & := {w E Q : w(a) = 1). By Stone's theorem, the family &,aE B forms a field of clopen sets on the (compact topological space) Q, which is isomorphic with B as a Boolean algebra. Write Co = {& : a E B), and define a function p : Co -+ [O,1] by p(6) := s(a), a E B. It is easy to see that p is a finitely additive probability measure on Co. Let C denote the a-feld of subsets of $2 generated by Co. We will show that p extends to a probability measure on C. According to the well-known theorems in measure theory (cf. [~almos,1962, Theorem A, Sec. 13]), we need to show that p is a-additive on Co, that is, p(Uz1Ai) = p(Ai) whenever a sequence {Ai)& of mutually disjoint sets from Co is such that Uz1Ai belongs to Co. So assume that Uihi = 6, for a countable set of pairwise disjoint sets hi,i E N,and for some b E B. Then we see that Viai 5 b. If Viai < b, then there is w such that w(b) = 1, and W(Q)= 0 for all i, which contradicts our suppositions. Therefore b = Viai, and p(6) = ~(Viai)= ~ ( a i= ) p(&i). So p extends to a a-additive measure on the a-algebra C generated by the algebra Co. Obviously, for every a E B, the mapping w I+ w(a) is measurable with respect to C. As a consequence of the previous considerations,
xi
xi
s, Let (L, S) be a system. Then (L, S) admits THEOREM 135. [ ~ e l i ~ a n n i19711 quasi hidden variables if and only if it is a subsystem of the system associated with a Boolean a-algebra. Proof. Assume that Q is a generating system of finitely additive states, and let
N be the a-ideal of subsets of Q on which all measures associated with the states
200
Pave1 Ptdk, Sylvia Pulmannovd
s E S vanish. We define the mapping a I+ &, where &(w)= w(a) , and observe that orthocomplements are preserved. Moreover, a 5 b H & 5 b (the latter ordering is pointwise). Let a = Vai, where (ai)i is a sequence of pairwise orthogonal elements. So we have s(a) = C s(ai). Since each w E R is finitely additive, we have
X&~(W 5 )&(w). But h(w) -
hi (w))dpS(w) = 0
for all p,, s E S which, together with the above inequality yields & = C h i modulo
N. Further, let each w be dispersion free so that & is a characteristic function of a subset of R. Let a* denote the class h modulo N . Then * is an isomorphism which sends L into the Boolean algebra B of subsets of R modulo N. Since all measures which correspond to states in S vanish on N , they produce measures on B, so that s(a) = p,(a*). Conversely, if (L, S ) is a subsystem of a system associated with a Boolean ualgebra, then the result follows by Lemma 134. rn In [ ~ e l i ~ a n n i1971, s, Theorem 51 it is proved that a necessary and sufficient condition for the isomorphism a I+ a* to preserve an existing infimum (supremum) in L is the Jauch-Piron condition for this particular pair to be satisfied in all states generated by R. Indeed, all that we need to prove is that letting c = a A b so that ~~~nS={W:~(w)b(w)=i),wehavehni-~~~. But for every probability measure p on C , the map
is a state on L. Since &, b are 1 on & n b, we have m(a) = m(b) = 1, so m(c) as well. But E vanishes outside h n 6, so that
=
1
Therefore p,(& n b - E) = 0 for all p,, s E S. In particular, if all finitely additive states in R satisfy the Jauch-Piron property for a, b, the result follows. Notice that both Examples (la), (lb) admit quasi hidden variables. On the other hand, in Example (2) for H separable of dimension at least 3, there are no finitely additive dispersion free states on L ([Alda, 19811). Therefore (L, S ) does not admit quasi hidden variables.
Quantum Logics as Underlying Structures of Generalized Probability Theory
20 1
12 BELL INEQUALITIES In this section we assume that L is a lattice logic, and s is a finitely additive state on L. We will consider the following inequalities:
The inequalities (1) and (3) are called the inequalities of Bell- Wigner type, the inequalities (2) and (4) are called the inequalities of Clauser-Home type [pitowski, 19891. All these inequalities are satisfied by any finitely additive state on a Boolean algebra. Let s be a finitely additive state on a logic (in fact, all definitions and results apply well for an OML, thus we do not explicitly need the a-complete property of V in L). Recall that the a s is (i) subadditive if s(a V b) 5 s(a)
+ s(b) Va, b E L,
(ii) a valuation if s(a V b)
+ s(a A b) = s(a) + s(b) Va, b E L,
(iii) Jauch-Piron if s(a) = 1 and s(b) = 1 implies s(a A b) s (a) = 0 and s(b) = 0 implies s(a V b) = 0).
=
1 (equivalently,
Observe that the following implications hold: (ii) (iii) and (ii) @ (i). If s is dispersion free, then (i), (ii) and (iii) are equivalent. Recall that a, b E L are compatible if a = (a A b) V (a A b'), written a tt b. Recall also that L is a Boolean algebra iff a tt b holds for all a, b E L. The element =(a, b) = (a A b) V (a' A b) V (a A b') V (a' A b') is called the lower commutator of a, b, and a tt b iff =(a, b) = 1. The upper commutator is defined by iZE(a, b) = (a V b) A (a V b) A (a V b') A (a' V b') = =(a, b). Recall finally that by the Foulis-Holland theorem, if a, b, c are elements of L such that a tt b, a tt c, then (a, b, c) is a distributive triple, that is, x l A (x2 V x3) = (XI A 52) V (XI A ~ 3 )xi , E {a, b, c), i 5 3. PROPOSITION 136. [ ~ u l r n a n n o vand ~ Majernfk, 19921 Let L be a lattice logic and s be a finitely additive state on L. The following statements are equivalent: (i) s is subadditive; (ii) s is a valuation; (iii) the inequalities (1) hold.
Pave1 Ptdk, Sylvia Pulmannov6
202
-
Proof. (i) =+(ii): Define aAb := (a V b) A (a A b)'. Using the Foulis-Holland b, we obtain theorem and the fact that (a' V b') * a and (a' v b') (a V b) A (a' V b') = (a A (a' V b')) V (b A (a' V b')). By the property (i), = s((a A (a' V b')) V (b A (a' V b')))
s(aAb)
5 s(a (a' v b')) V (b A (b A (a' V b') = s(a) - s(aA b) + s(b) - s(a A b).
+
This entails that s(aAb) = s(a V b) - s(a A b) 5 s(a) s(b) - s(a A b), i.e., s(a V b) s(a A b) 5 s(a) s(b). Replacing a, b by a', b', we obtain the converse inequality, and hence s is a valuation. (ii) =+(iii) If s is a valuation, then s(a) s(b) - s(a A b) = s(a V b) 5 1, hence the inequalities (1) hold. (iii) & (i): If the inequality (1) holds, then for very a, b, s(at) s(bf) - s(a' A b') 5 1,which yields 1-s(a)+l-s(b)-(1-s(aVb)) 5 1,hence s(aVb) 5 s(a)+s(b).
+
+
+
+
We now study the inequalities of type (2). Following [pykacz and Santos, 19911, we consider the function S(a, b) = s(a)
+ s(b) - 2s(a A b).
It can be checked by a direct computation that the inequalities (2) are equivalent to the inequalities S(a, b) S(b, c) S(c, e) L S(a, e), These inequalities hold iff S is a metric on L. Put d(a, b) := s(aAb). It is easy to check that s is a valuation iff S = d.
+
+
PROPOSITION 137. Let L be a lattice logic and let s be a (finitely additive) state on L. Then s is a valuation iff p = s(aAb) is a metric on L.
Proof. First we prove that for any a, b, c E L, aAb 5 (aAc) V (cAb). Put e = a A b A c. Clearly a A (a A b)' 5 (a V c) A e'. Using orthomodularity, we prove that (a V c) A e' 5 (aAc) V (cab) (see [Pulmannovb and Majernik, 19921 for the details). Similarly, b A (a A b)' 5 (b V c) A e' 5 (aAc) V (cAb). Hence aAb
=
5
(a (a b)') V (b A (a A b)') (aAc) V (cab).
Now s is a valuation iff it is subadditive, which yields p(a, b) 5 p(a, c)p(b, c), hence p is a metric. Conversely, if p is a metric, then the inequality p(a, b) 5 p(a, 0) d(0, b) yields s(a V b) - s(a A b) 5 s(a) s(b). Replacing a, b by a', b', respectively, we see that the converse inequality holds, and hence s is a valuation.
+
+
Quantum Logics as Underlying Structures of Generalized Probability Theory
203
The above considerations yield the following result. THEOREM 138. Let L be a lattice logic and let s be a (finitely additive) state on L. The following statements are equivalent: (i) the inequalities (2) hold; (ii) S is a metric; (zii) S = p; (iv) s is a valuation; (v) p is a metric; (mi) the inequalities (1) hold.
Proof. We have already seen that the inequalities (2) hold 8 S is a metric. If S is a metric, then S(a, b) 5 S(a, aVb)+S(avb, b) implies s(a)+s(b)-2s(a~b) 5 s(a)+ s(avb) -2s(a)+s(a~b)+s(b) -2s(b). Consequently, s(a)+s(b) - s ( a ~ b ) 5 ~ ( a v b ) . Replacing a, b by a', b', this yields the converse inequality. Hence S = p, and p is a metric. The remaining statements follow by Proposition 136 and Proposition 137.
rn THEOREM 139. Let L be a lattice logic and let S be an order-determining set of states on L. If every state s E S satisfies Bell inequalities of the type (I), then L is a Boolean algebra.
Proof. By Theorem 138, every state s E S is subadditive. It suffices to prove that a tt b for all a, b E L. By subadditivity we obtain s((a V b) A b') = s(a V b) - s(bl) 5 s(a) for every s E S, and since S is order-determining, this gives us (aVb)Abl = aAb'. By orthomodularity, b' = ( a ' ~ b ' ) ~ ( a ~ b = ) ~(a'Ab1)V(aAb'), b' which entails that b' * a. As this holds for all a, b E L, we conclude that L is a rn Boolean algebra. COROLLARY 140. If the system (L, S), where L is a lattice logic, satisfies the inequalities (1)for every s E S , then (L, S ) admits quasi hidden variables. The converse need not be true. Let (Bl, Sl) and (B2,S2) be the systems associated with Boolean a-algebras, and let L := B1/B2 denote their horizontal sum. Then B1/B2 is a lattice logic, where the supremum Vai corresponds to the supremum taken in Bj if all ai's belong to Bj, j = 1,2, otherwise the supremum is 1. If s is a state on L, then the restrictions sj := s/Bj, j = 1,2 are states on Bj, j = 1,2, respectively, and s corresponds to the couple (sl ,s2), where s(a) = sj(a) iff a E Bj. Conversely, if (p1,pz) is a couple of states on Bj, j = 1,2, we can form a state p on L by defining p(a) = pj (a) ifF a E Bj, j = 1,2. It can be easily seen that a state s = (sl, sz) on L is subadditive, hence Jauch-Piron, ifF both sl and s z are subadditive, and at least one of them is faithful l. Indeed, if neither of sl, s z is faithful, then there are elements a1 E B1, a2 E Bz, both different from 1 with sl(a1) = 1,sz(a2) = 1. But a1 A a2 = 0, which contradicts Jauch-Piron property. It follows that L has no finitely additive dispersion free Jauch Piron state unless one of B1, B2 is {O,l). But L admits quasi hidden variables. Indeed, consider the tensor product B1 QD Bz. The set of product states sl @s2(al@az)= sl(al)s2(a2) is order-determining for B1QDBz (see, e.g., [Aerts and Daubechies, 19781). Moreover, there is an imbedding j : B~+BZ + B1 QD B2 such that j(a) = a QD 1 if a E B1 ' ~ e c a l lthat a state s is faithful on L if s(a) = 1 8 a = 1.
Pave1 Ptbk, Sylvia Pulmannovd
204
and j(a) = 1@I a if a E B2. Further, the states (sl,sz),si E Si,i = 1,2 are in a one-bone correspondence with the product states sl @ s 2 . It follows that j is a system imbedding. An interesting example of this type was found in isis is, 20001, where the observables of position Q and momentum P in the standard quantum mechanics are considered. Since Q and P are complementary ([Ptik and Pulmannovb, 1991]), it can be shown that the smallest sublogic of L(H) containing their ranges B1 := R(Q) and B2 := R ( P ) is isomorphic to the horizontal sum of B1 and B2. Now let us consider the inequalities of type (3), i.e., for a state s and all a, b E L, let us suppose that
If we put c = 0, we obtain the inequality (I),hence (3) implies that s is subadditive. Recall that a subset J of a lattice logic L is a p-ideal if (i) a, b E J imply a V b E J; and (ii) a E J,b E L imply (a V b') A b E J. There is a one-toone correspondence between the set of all pideals and the set of all congruence relations on L. If 8 is the congruence corresponding to J, then a = b(8) iff aAb E J, and J = {a E L : a E O(8). Let ii denote the congruence class corresponding to a E L, and let L / J denote the set of all congruence classes. Then L / J (the quotient of L corresponding to J ) is an OML, and the mapping q5 : L -+ L / J , q5(a) = a (the quotient mapping) is a a-homomorphism. b) : a, b E L), Let Jc be the smallest pideal which contains the set {-(a, where m ( a , b) = (a V b) A (a' V b) A (a V b') A (a' V b') is the upper commutator of a, b. It is well-known that the quotient L/Jc is a Boolean algebra. Moreover, by [Marsden, 19701, (10)
Jc=
{C
E L : c 5 V ( m ( a j , b i ) ) , a i ,bi E L , i 5 n). isn
Another characterization of Boolean quotients can be obtained by means of prime ideals. Recall that a proper lattice ideal J is prime if a A b E J implies a E J or b E J. In a lattice logic, an ideal J is prime iff for all a E L, either a E J or a' E J . It is straightforward to see that a proper ideal J of L is prime iff J is a pideal and the quotient L / J is (0, 1). Let J be a prime ideal of an OML L. Define p : L t {0,1) by p(a) = 0 if a E J and p(a) = 0 otherwise. If a I b, and a $! J, then we must have b E J . this yields p(a V b) = p(a) +p(b). Moreover, p(a) = 0 = p(b) implies p ( a b) ~ = 0, hence p is a dispersion free finitely additive Jauch-Piron state (valuation) on L. Conversely, if s is any dispersion free valuation on L, then s-I (0) is a prime ideal of L. Recall that for any ideal J, the quotient L/ J is Boolean iff J is the intersection of all prime ideals that contain it [~almbach,19831. Consequently, Jcis the intersection of all prime ideals of L. Evidently, the notions of a pideal and prime ideal make sense also for a-ideals, i.e. the ideals J such that ai E J for all i E N implies ViENaa E J . The quotient of a lattice logic with respect to a a pideal is a lattice logic. obviously, the quotient L / J is a Boolean a-algebra iff the ideal J contains all upper commutators.
Quantum Logics as Underlying Structures of Generalized Probability Theory
205
Recall that a state s on L is a superposition [~aradarajan,19851 of a set S of states on L if for any a E L, t(a) = 0 Vt E S implies s(a) = 0. We then have the following characterization of the inequalities of type (3). THEOREM 141. Let (L, S) be a system, where L is a lattice logic. Denote by J, the ideal generated by all upper commutators in L. Let s E S. The following statements are equivalent: (i) the inequalities (3) hold; (ii) s(ZET(a, b))
=0
for all a, b E L;
(iii) s/Jc = 0, where s/Jc denotes the restriction of the state s to the ideal Jc; (iv) s is a superposition of a set of finitely additive dispersion free Jauch-Piron states on L; (v) there is a Boolean a-algebra B, a surjective a-homomorphism and a state 5 on B such that 3 o I#J = s;
I#J
: L + B,
(vi) the inequalities (4) hold.
Proof. (i) 3 (ii): Assume that the inequalities (3) hold, and put c = a'. By an easy computation we obtain s(b) = s(a A b) s(af A b). Consequently,
+
+
1 = s(b) s(bf) = s((a A b) V (a A b') V (a' A b) V (a' A b') = s(=(a, b)).
The latter equality yields s(ZET(a, b ) ) = 0. (ii) =+ (iii): Assume that (ii) hold. Then for all a, b we have s(a V b) = s((aV b) A a) +s((aV b) Aa') = s(a) +s((aV b) A a' A b') +s((aV b) A a' A b) = s(s) +s((aV b) Aa' A b) 5 s(a) +s(b). This proves that s is subadditive. Using (lo), we obtain for any c E J,, s(c) 5 s(Vi<, com(ai, bi)) 5 x i < , s(EEE(ai, bi)) = 0. (iii) & (iv): We have s-'(0) >J,, and J, is the intersection of all prime sil(0), where the intersections goes over all ideals of L. Consequently, s-I (0) finitely additive dispersion free Jauch-Piron states on L. Hence s is a superposition of all sa7s. (v): If s is a superposition of a set I of finitely additive dispersion free (iv) s;l(O), and every s i l ( 0 ) is a prime ideal Jauch-Piron states, then s-l(O) 2 s;1(0) is a pideal, and J 2 J,. Let 9 be the smallest a-p on L. Hence J = ideal containing J. Then J contains all commutators, and therefore B := LIJis a Boolean a-algebra. If I#J : L + B is the quotient mapping, then I#J is a surjective ahomomorphism. In addition, the mapping S : B + [O, 11defined by 3(I#J(a))= s(a) is a a additive state on B. (v) =+ (vi): Since 3 o I#J = s and the inequalities (4) hold for 3 on B , it easily follows that the inequalities (4) hold for s on L. (vi) & (i): Putting d = a in the inequalities (4), we obtain inequalities (3).
>U
UaEI
UaEI
206
Pave1 PtAk, Sylvia Pulmannovi
The following theorem shows that there are close connections between Bell inequalities of type (3) and quasi-hidden variables. THEOREM 142. Let L be a lattice logic, and s be a (a-additive) state on L. The state s is generated by finitely additive dispersion free Jauch-Piron states on L if and only if one of the conditions of Theorem 141 is satisfied. Proof. If s is generated by the set R of all finitely additive dispersion free JauchPiron states on L, then there is a a-algebra C of subsets of R, which makes the mappings w ct w(a), a E L, measurable, and there is a probability measure p on C such that for every a E L,
It is clear that the equality w(a) = 0 for all w E R implies s(a) = 0. Hence s is a superposition of R. Conversely, suppose condition (v) of Theorem 141 holds. Let fi be the set of all dispersion free finitely additive states on B, and let 3 be the state on B corresponding to s. Since 3 is a probability measure on B, by Lemma 134, or by applying the Choquet-Bishopde Leeuw theorem [~helps,19661,
for a suitable probability measure p. This yields
4.1
=
Sy
R(a)dll(w),
where Cl is the set of the finitely additive dispersion free states w on L defined by ~ ( a= ) b(4(a)), a E L. Thus p is the measure on R induced by ji. rn
Remarks: 1.The Bell-type inequalities presented in the previous section were generalized in [Dvure~enskijand Langer, 19951 in the following way: By a Bell-type inequality of order n is understood any inequality of the type
which holds for a (finitely additive) state s on a logic L (and for all a1 . . . , an E L), where f (I) is a real coefficient, s(AiEI ai) is a correlation (or a joint probability) of the set of events {ai : i E I} in the state s, a l , . . . , a n E L, and N := {1,2,. . . ,n}. In other words, the function Sf(s) := CrcN f (I)s(AiEI ai) is a linear combination of s(AiEI ai), and s(AiEI ai) can be represented as a joint probability of ai(i E I ) in the state s. In [~eltramettiand Mqczyhski, 1991] and [Langer and Mqczyliski, 19951, it has been proved that the inequalities (11)are equivalent to the inequalities
Quantum Logics as Underlying Structures of Generalized Probability Theory
207
for every state s on a Boolean algebra. It was shown in [Dvure~enskijand Langer, 19951 that Bell-type inequalities of order 2 are equivalent with the inequalities (1) (resp. (2)), and the inequalities of order 3 are equivalent with the inequalities (3) (resp. (4)), while higher order Bell-type inequalities are equivalent with Bell-type inequalities of the type (3). 2. Let us finally step into the realm of universal algebra. Let us see how notions of quantum logical theory may be linked with universal algebra. Let OML denote the variety of orthomodular lattices. Recall that by a famous result of universal algebra [ ~ r a t z e r19861, , a subclass Q of the variety OML is a quasivariety if and only if Q is closed under the formation of subalgebras, products, ultraproducts, isomorphic algebras and it contains the trivial algebra. A quasivariety Q is a variety if it is closed under the formation of epimorphic images. It should be noted that several varieties and quasivarieties of OMLs related to quantum logical theory have been r Navara, 1987; Godowski, 1981; Carrega et al., 2000; considered in [ ~ i n d e and De Sirnone et al., 2001; Bruns et al., 1990; Matouavsek, 2004; Mayet, 1986; Mayet et al., 2000; Haviar and KonGpka, 20001. For X I , xz, . . . ,xn, y1, y1, . . . ,yn, let tc be a term of 2n variables defined as follows: n
tc(x11~21... > X n > Y l ~ Y l ~ - -:= - ~ V-(xilyi). yn) i=l Put N B Q := {L E OML : Vxl, X Z , . . . ,x,, yl, yl, . . . ,yn E L : ( t c ) L ( x ~ , ~-z-,- , x ~ , Y I , Y I , . . - ,#Y~~L) ) U I , where I is the class of all one-point orthomodular lattices, and the indices indicate to which L the element belongs. Recall that for an orthomodular lattice L, the following statements are equivalent: (i) L has a nonzero Boolean quotient, (ii) L has a proper prime ideal, (iii) there is a subadditive state on L. Since every prime ideal contains the ideal Jc defined by (lo), it can be easily seen that L E N B Q iff one of the equivalent conditions (i)-(iii) is satisfied. PROPOSITION 143. [D'Andrea and PulmannovL, 19941 (i) every free orthomodular lattice belongs to NBQ. (ii) The variety BA of Boolean algebras is a proper subclass of NBQ. (iii) The class NBQ is a proper quasivariety of OML.
208
Pave1 P t i k , Sylvia Pulmannovi
Proof. (i) Let F be a free orthomodular lattice over a nonempty set X . Let Jc be the commutator pideal in F . Then the quotient mapping h : F -+ F/Jc maps F into BA, and F / J , is a free Boolean algebra over h ( X ) (h(X) # 0). (ii) Obviously, BA NBQ. On the other hand, let F2 denote the free o r t h e modular lattice over the set {x, y} [ ~ e r a n19851. , Then F2 belongs to NBQ, but it does not belong to BA. (iii) From the definition of NBQ, we immediately see that NBQ is characterized by the set of quasiidentities V n E N, tc(xl, 3 2 , . . .,xn, yl, y1,. . . ,yn) FE 1 & 0 E 1. Therefore NBQ is a quasivariety. To show that N B Q is not a variety, consider the OML M 0 2 (the horizontal sum of two four-point Boolean algebras), which is rn a homomorphic image of Fz, but it is simple. Let us denote by the symbol Bell the class of orthomodular lattices L satisfying the following property: L E I or there is a state s on L such that (L, s ) satisfies one of the equivalent conditions of Theorem 141. The proof of the following statement is then easy. THEOREM 144. The class Bell coincides with the class NBQ, hence it is a proper quasivariety in O M L . BIBLIOGRAPHY [Aerts and Daubechies, 1978) D. Aerts and I. Daubechies. Physical justification for using tensor product t o describe two quantum systems as one joint system, Helv. Phys. acta 51, 661-675, 1978. [Alda, 19811 V. Alda. On 0-1 measure for projectors, 11, Aplikace Matematiky 26, 57-58, 1981 [Alfsen and Schulz, 19791 E. Alfhen and F. Schulz. On non-commutative spectral theory on Jordan algebras, Proc. London Math. Soc 37, 497-516, 1979. [Bell, 19601 J. S. Bell, On the problem of hidden variables in quantum mechanics Reviews of Modern Physics 38, 447-452, 1960. [Beltrametti and Cassinelli, 19811 E. Beltrametti and G. Cassinelli. The Logic of Quantum Mechanics, Addison-Wesley, Reading, Mass. 1981. [Beltrametti and Mgczyhski, 19911 E. Beltrametti and M. Mwzyriski. On a characterization of classical and nonclassical probabilities, J. Math. Phys., 32, 1280-1286, 1991. [Beran, 19791 L. Beran. On finitely generated orthomodular lattices, Math. Nachrichten 88, 129-139, 1979. [Beran, 19851 L. Beran. Orthomodular Lattices, Algebraic Approach, D.Reidel, Holland, 1985. [Binder and Navara, 19871 J. Binder and M. Navara. Quantum logics with lattice state spaces, Proc. Anate. Math. Soc. 100, 688-693, 1987. [Birkhoff and von Neumann, 19361 G. Birkhoff and J. von Neumann. The logic of quantum mechanics, Ann. Math. 37, 823-843, 1936. [Brabec, 19791 J. Brabec. Compatibility in orthomodular posets, Cas. p&t. mat. 104, 149-153, 1979. [Brabec and Pt&, 19821 J. Brabec and P. Ptik. On compatibility in quantum logics, Found. Phys 12, 207-212, 1982. [Bruns and Greechie, 19901 G. Bruns and R. Greechie. Blocks and commutators in orthomodular lattices, Algebra Universalw 27, 1-9, 1990. and Kalmbach, 19731 G. Bruns and G. Kalmbach. Some remarks on free orthomodular lattices, Proc. Univ. Houston, Lattice Theory Conf., J. Schmidt ed., Houston, 397-403, 1973. et al., 19901 Bruns, G., Greechie, R., Harding, J., Roddy, M., Completions of orthomodular lattices, Order 7 , 67-76, 1990.
un runs runs
Quantum Logics as Underlying Structures of Generalized Probability Theory
209
[Bugajski and Lahti, 19801 S. Bugajski and P. Lahti. Fundamental principles of quantum theory, Int. J. Thwr. Phys. 19, 499-514, 1980. [Buhagiar and Chetcuti, 20051 D. Buhagiar and E. Chetcuti. On complete-cocomplete subspaces of a n inner product space, Appl. Math. 50, 103-114, 2005. [Bunce et al., 19851 L. J. Bunce, M. Navara, P. Ptdk, and J. D. M. Wright. Quantum logics with Jauch-Piron states, Quart. J. Math. Oxford 36, 261-271, 1985. [Busch et al., 19911 P. Busch, P. Lahti, and P. Mittelstaedt. The Quantum Theory of Measurement, Lecture Notes in Physics, Springer-Verlag, Berlin, Heidelberg, New York, London, Budapest, 1991. [Carrega et al., 20001 J. Carrega, R. Greechie, and R. Mayet. Minimal orthomodular lattices from quadratic spaces over finite fields, Int. J. Theor. Phys. 39, 517-524, 2000. [Cattaneo and Marino, 19861 G. Cattaneo and G. Marino. Completeness of inner product spaces with respect t o splitting subspaces, Lett. Math. Phys. 11, 15-20, 1986. [Chetcuti, 20051 E. Chetcuti. Measures on prehilbert space logics and on operator algebras, PhD. Thesis, Slovak Acad. of Sc., Bratislava, 2005. [Chetcuti and DvureEenskij, 20031 E. Chetcuti and A. DvureEenskij. A finitely additive state criterion for the completeness of inner product spaces, Lett. Math. Phys. 64, 221-227, 2003. [Chevalier, 19841 G. Chevalier. Les commutateurs d'un treillis orthomodulaire, in Seminaire Logique quantique et treillis orthomodulaires, Lyon, 1984. [Chevalier, 19891 G. Chevalier. Commutators and decompositions of orthomodular lattices, Order 6, 181-194, 1989. [Chevalier and Pulmannovii, 20001 G. Chevalier and S. Pulmannovi. Semiprime ideals in orthomodular posets, Contributions to General Algebra 12, 135-143, 2000. [Dalla Chiara et al., 20041 M. L. Dalla Chiara, R. Giuntini, and R. Greechie. Reasoning in Quantum Thwry: Sharp and Unsharp Quantum Logics, Kluwer Academic Publishers, Dordrecht, Boston, London, 2004. [D'Andrea and Pulmannovd, 19941 A. B. D'Andrea and S. Pulmannovd. Quasivarities of orthomodular lattices,Rep. Math. Phys., 27, 688-699, 1994. [D'Andrea and de Lucia, 19911 A. B. D'Andrea and P. de Lucia. The Brooks-Jewett theorem on a n orthomodular lattice, J. Appl. Mat. Anal. 54, 507-522, 1991. [Deliyannis, 19711 P. C. Deliyannis. Generalized hidden variables theorem, J. Math. Phys. 12, 1013-1017, 1971. [De Lucia and Ptiik, 19921 P. De Lucia and P. Ptik. Quantum probability spaces that are nearly classical, Bull. Polish Acad. Sci.- Math. 40, 163-173, 1992. [De Simone et al., 20011 A. De Simone, M. Navara, and P. Pt&. On interval homogeneous orthomodular lattices, Comment, Math. Univ. Carolin. 42, No.1, 23-30, 2001. [De Simone and Navara, 20011 A. De Simone and M. Navara. Yosida-Hewitt and Lebesgue decompositions of states on orthomodular posets, J. Math. Anal. Appl 255, No. 1, 74-104, 2001. [ ~ Simone e et al., to appear] A. De Simone, M. Navara, and P. Ptik. Extending states on finite concrete logics, Int. J. Theor. Phys., t o appear. [Dvureknskij, 19821 A. DvureEenskij. On m-joint distributions, Math. Slovaca 31, 347-353, 1981. [DvureEenskij, 19861 A. DvureEenskij. On two problems on quantum logics, Math. Slovaul36, 253-265, 1986. [Dvureknskij, 1987al A. Dvureknskij. Joint distributions of observables and measure with infnite values, Demonstratio Math. 20, 121-137, 1987. [Dvureknskij, 1987bl A. DvureEenskij. Remark on joint distributions on quantum logics I,II, Appl. Mat. 32, 427-435, 436-450, 1987 [Dvureknskij and Liinger, 19951 A. DvureEenskij and H. Linger. Bell-type inequalities in orthomodular lattices I. ,II., Inter. J. Theor. Phys. 34, 995-1024, 1025-1038, 1995. [Dvureknskij and Pulmannovi, 19801 A. DvureEenskij and S. Pulmannovd. On t h e sum of observables on a logic, Math. Slovaca 30, 393-399, 1980 [Dvureknskij and Pulmannovd, 19821 A. DvureEenskij and S. Pulmannovd. On joint distributions of observables, Math. Slovaca 32, 155-166, 1982. [~vureEenskijand Pulmannovi, 19841 A. DvureEenskij and S. Pulmannovi. Connection between joint distributions and compatibility, Rep. Math. Phys. 19, 349-359, 1984. [ ~ v u r e k n s k iand j Pulmannovd, 19891 A. Dvureknskij and S. Pulmannovd. Type 11. joint distributions and compatibility of pobservables, Demonstratio Math. 22, 479-497, 1989.
210
Pave1 Ptdk, Sylvia Pulmannovd
[Dvurkenskij, 19931 A. Dvurehnskij. Gleason's Theorem and Its Applications, Kluwer Academic Publishers, Dordrecht, Boston, London - Ister Science Press Bratislava, 1993. [Dunford and Schwarz, 19571 N. Dunford and J. Schwarz. Linear Operators, Vols 1,2,John Wiley, New York, 1957. [Emch, 19721 G. Emch. Algebraic Methods i n Statistical Mechanics and Quantum Field Theory, Wiley and Sons, New York, London, Sydney, Toronto, 1972. [Flachsmeyer and KatrnoAka, 19791 J. Flachsmeyer and F. Katrn&ka,On the number of idempotents of some matrix rings, Tatm Mt. Math. Publ. 10, 129-132,1979. [Giuntini, 19911 R. Giuntini. Quantum Logic and Hidden Variables Bibliographishes Institut, Mannheim, 1991. [Gleason, 19571 A. Gleason. Measures on the closed subspaces of a Hilbert space, J. Math. Mech. 6,885-893,1957. [Godowski, 19811 R. Godowski. Varieties of orthomodular lattices with a strongly full sets of states, Demonstratio Math. 14,725-733,1981. [Gratzer, 19861 G. Gratzer. Universal Algebra, van Nostrand, Princeton, 1986. [Greechie, 19691 R. Greechie. A particular non-atomistic orthomodular poset, Commun. Math. Phys. 14,326-328,1969. [Greechie, 19711 R. Greechie. Orthomodular lattices admitting no states. J. Comb. Theory 10, 119-132, 1971. [~reechie,19791 R. Greechie. On generating distributive sublattices of orthomodular lattices, Pmc. Arner. Math. Soc. 67 (1977), 17-22;76,216-218,1979. [Greechie and Herman, 19851 R. Greechie and L. Hermann. Commutator-finite orthomodular lattices, Order 1,277-284,1985. [Gudder, 19661 S. Gudder. Uniqueness and existence properties of bounded observables, Pacific J. Math. 19,81-93,588-589,1966. [Gudder, 19681 S. Gudder. Joint distributions of o b s e ~ a b l e sJ. , Math. Mech. 18 , 325-335,1968. [Gudder, 19791 S. Gudder. Stochastic Methods i n Quantum Mechanics, Elsevier, North Holland, Amsterdam, 1979. [Guz, 19711 W. Guz. Quantum logic and a theorem on commensurability, Rep. Math. Phys. 2, 53-61,1971. [Haag and Kastler, 19641 R. Haag and D. Kastler. An algebraic approach t o quantum field theory, J. Math. Phys. 5, 848-861,1964. [Haviar and KonBpka, 20001 M. Haviar and P. KonBpka. Finitely generated free orthomodular lattices 111, Int. J. Theor. Phys. 39,727-735,2000. [Halmos, 19511 P. Halmos. Introduction to Hilbert Space and the Theory of Spectral Multiplicity, Chelsa Publ. Co., New York, 1951. [Halmos, 19621 P. R. Halmos. Measure Theory, D. van Nostrand, Princeton, New Jersey, Toronto, New York, London, 1962. [Hamhalter, 20031 J. Hamhalter. Quantum Measure Theory, Kluwer Academic Publishers, Dordrecht, Boston, London, 2003. [Hamhalter and Ptdk, 19871 J. Hamhalter and P. Ptdk. A completeness criterion for inner product spaces, Bull. London Math. Soc. 19,259-263,1987 [Harding, 19981 J. Harding. Regularity in quantum logics, Inter. J. Theor. Phys. 37,1173-1212, 1998. [Harding, 1839-18621 J. Harding. Decompositions in quantum logics, D a m . Amer. Math. Soc. 348,1839-1862. [Holevo, 19801 A. Holevo. Probabilistic and Statistics Aspects of Quantum Theory (in Russian) Nauka, Moscow, 1980. [Hudson and Pulmannovd, 19931 R. Hudson and S. Pulmannovd. Sum logics and tensor products, Found. Phys. 23,999-1024,1993. [Jammer, 19741 M. Jammer. The Philosophy of Quantum Mechanics, Willey and Sons, New York, Sydney, Toronto, 1974. [Jauch, 19681 J. Jauch. Foundations of Quantum Mechanics, Addison-Wesley, Reading, Mass., 1968. [Kalmbach, 19831 G. Kalmbach. Orthomodular Lattices, Academic Press, London, New York, 1983. [Katrno~ka,19821 F. Katrndka. On the representation of orthowmplemented posets, Comment. Math. Univ. Camlinae 23,489-498,1982.
Quantum Logics as Underlying Structures of Generalized Probability Theory
211
[Kochen and Specker, 19671 S. Kochen and E. P. Specker. The problem of hidden variables in quantum mechanics, J. Math. Mech. 17, 59-87,1967. [Lahti, 19801 P. Lahti. Uncertainty and complementarity in axiomatic quantum mechanics, Int. J. Thwr. Phys. 19, 789-842,1980. [Lahti and Mqczyfiski, 19871 P. Lahti and M. Mpczyriski. Heisenberg inequality and the complex field in quantum mechanics, J. Math. Phys. 28, 1764-1769,1987. [Lahti and Ylinen, 19871 P. Lahti and K. Ylinen. On total noncommutativity in quantum mechanics, J.Math. Phys. 28, 2614-2617,1987. a anger and Mpczyriski, 19951 H. Langer and M. Mpczyliski. On a charaderf ation of probability measures on Boolean algebras and some orthomodular lattices, Math. Slovaca 49,455-468, 1995. [Lutterovd and PulmannovA, 19851 T. LutterovB and S. Pulrnannovd. An individual ergodic theorem on the Hilbert space logic, Math. Slovaca 35, 361-371,1985 [Mackey, 19631 G. Mackey. The Mathematical Foudations of Quantum Mechanics, Benjamin, New York, 1963. [ ~ a i i a s o v i19811 , V. Maiiasovd. A note on mappings between the logics of quantum systems, Acta Polytech. Prague IV, 23-26,1981. [Marsden, 1970] E. Marsden. The commutator and solvability in generalized orthomodular lattices, Pacific J. Math. 33, 357-361,1970. [Matoulek, 19921 M. MatouBek. Orthomodular lattices with fully nontrivial commutators, Comment. Math. Univ. Carolinae 33, 1 , 25-32,1992. [Matouavsek, 20041 M. MatouBek. Boolean carried homomorphisms in orthomodular lattices, Demonatratio Mathematics 37, No. 2, 255-265,2004. [Mayet, 19861 R. Mayet. Equational bases for some varieties of orthomodular lattices related t o states, Algebra Universalis 23, 167-195,1986. [ ~ a ~ete al., t 20001 R. Mayet, M. Navara, and V. Rogalewicz. Orthomodular lattices with rich state spaces, Algebra Universalis 43, 1-30,2000. [Mushtari and Matvejchuk, 19851 D. H. Mushtari and M. S. Matvejchuk. Charges on the logic of skew projections, Dokl. Nauk. SSSR 238, 43-46,1985. (Russian, English translation Sov. Math. Dokl. 32, 36-39,1985). [Miiller, 19931 V. Miiller. Jauch-Piron states on concrete quantum logics, Int. J. Theor. Phys. 32, 433-442,1993. [Navara, 19941 M. Navara. An orthomodular lattice admitting no group-valued measure, Proc. Anter. Math. Soc. 122, 7-12,1994. [Navara, 19951 M. Navara. Uniqueness of bounded observables, Ann. Imt. H. Poincard - Thwr. Phys. 63, No. 2, 155-176,1995. [Navara and HyEko, to appear] M. Navara and M. HyEko. Decidability in orthomodular lattices, Int. J. Thwr. Phys., t o appear. [Navara and Pt&, 19881 M. Navara and P. Ptdk. Quantum logics with the Radon-Nikodym property, Order 4,387-395,1988. [Navara et al., 19881 M. Navara, P. PtBk, and V. Rogalewicz. Enlargements of quantum logics, Pacific J. Math. 135, 361-369,1988. [Navara and Rogalewicz, 19881 M. Navara and V. Rogalewicz. Construction of orthomodular lattices with given state spaces, Demonstratio Math. 21, 481-493,1988. [Navara and Rogalewicz, 19911 M. Navara and V. Rogalewicz. The pasting constructions for orthomodular posets, Math. Nachrichten 154, 157-168,1991. [Neubrunn, 19741 T. Neubrunn. On certain generalized random variables, Acta A. F.R. N. Univ. Comenianae Math. 36, 1-6,1974. [von Neumann, 19321 J. von Neumann. Grundlagen der Quantenmechanik, Springer-Verlag, Berlin, Heidelberg, New York, 1932. [Olejkk, 19951 V. OlejEek. The o-class generated by balls contains all Borel sets, Proc. Amer. Math. Soc. 123, 3665-3675,1995. [Ovchinnikov, 19971 P. Ovchinnikov. Exact topological analogs t o orthoposets, Proc. Amer. Math. Soc.125, 2839-2841,1997. [Phelps, 19661 R. R. Phelps. Lectures on Choquet's theorem Van Nostrand, Princeton, 1966. [Piron, 19761 C. Piron. Foundations of Quantum Physics, Benjamin, b d i n g Mass, 1976. [Pitowski, 19891 0. Pitowski. Quantum Probability-Quantum Logic (Ledure Notes in Physics 321, Springer-Verlag, Berlin, 1989.
212
Pavel P t i k , Sylvia Pulmannovi
[Poguntke, 19831 W. Poguntke. Finitely generated ortholattices, the commutator and some apllications, Colloquia Math. Soc. J. Bolyai 99, Contributions to Lattice Theory, Szeged, 1980, pp. 651-666. North Holland, Amsterdam, 1983. [Primas, 19811 H. Primas. Chemistry, Quantum Mechanics and Reductionism, Ledure Notes in Chemistry 24, Springer-Verlag, Berlin, 1981. [Prugovecki, 19711 E. Prugovecki. Quantum Mechanics in Hilbert Space, Academic Press, London, New York, 1971. [Ptik, 19811 P. Ptik. Realcompactness and the notion of observable, Journal London Math. Soc. 23, 534-536, 1981. [Ptik, 19981 P. Ptik. Some nearly Boolean orthomodular posets, Proc. Amer. Math. Soc. 126, 2039-2046, 1998. [Ptik and Pulmannovi, 19911 P. P t i k and S. Pulmannovi. Orthomodular Structum as Quantum Logics, Kluwer Academic Publishers, Dordrecht, Boston, London - VEDA, SAV, Bratislava, 1991. [ P t i k and Pulmannovi, 19941 P. P t i k and S. Pulmannovi. A measuretheoretic characterization of Boolean algebras among orthomodular lattices Conzmentationes Mathematicae Universitatis Carolinae 35, 205-208, 1994. [ P t i k and Rogalewicz, 1983al P. P t i k and V. Rogalewicz. Measures on orthomodular partially ordered sets, J. Pure Appl. Algebra 28, 75-80, 1983. [Pt& and Rogalewicz, 1983bl P. P t i k and V. Rogalewicz. Regularly full logics and the uniqueness problem for observables, Ann. Inst. H. Poincare' 38, 69-74, 1983. [ P t i k and Weber, 20011 P. P t i k and H. Weber. Lattice properties of splitting subspaces in an inner product space, Proc. Amer. Math. Soc. 129, 2111-2117, 2001. [Pulmannovi, 19781 S. Pulmannovi. Joint distributions of observables on quantum logics, Int. J. Theor. Phys. 17, 665-675, 1978. [Pulmannovi, 19801 S. Pulmannovi. Relative compatibility and joint distributions of observables, Found. Phys. 10, 641-653, 1980. [ ~ u l m a n n o v i1981al , S. Pulmannovi. On the observables on quantum logics, Found. Phys. 11, 127-136, 1981. [Pulmannovi, 1981b] S. Pulmannovi. Compatibility and partial compatibility in quantum logics, Ann. Inst. H. Poincark, Ser. A 34, 391-403, 1981. [Pulmannovi, 19851 S. Pulmannovi. Commutators in orthomodular lattices, Demonstratio Math. 18, 187-208, 1985. [Pulmannovi, 19881 S. Pulmannovi. Uncertainty relations and state spaces, Ann. Inst. H. Poincare' 48, 325-332, 1988. [Pulmannovi, 1994a) S. Pulmannovi. Bell inequalities and quantum logics, in: The Interpretations of Quantum Theory: where do we stand? edited by L. Accardi, Encyclopedia Italians, Roma 1994. [Pulmannovi, 1994bl S. Pulmannovi. Quantum measurements and quantum logics, J. Math. Phys. 35, 1555-1572, 1994. [Pulmannavi, 20021 S. Pulmannovi. Hidden variables and Bell inequalities on quantum logics, Found. Phys. 32, 193-216, 2002. [Pulmannovi and Dvureknskij, 19801 S. Pulmannovi and A. DvureEenskij. Stochastic processes on quantum logics, Rep. Math. Phys. 18, 303-315, 1980. [Pulmannovi and Dvureknskij, 19851 S. Pulmannovi and A. DvureEenskij. Uncertainty principle and joint distributions of observables, Ann. Inst. H. Poincare', Ser. A 42, 253-265, 1985. [Pulmannovi and Majernik, 19921 S. Pulmannovd and V. Majernik. Bell inequalities on quantum logics, J.Math.Phys. 33, 2173-2178, 1992. [Pulmannovi and Stehhiovi, 19861 S. Pulmannovi and B. Stehlikovi. Strong law of large numbers and central limit theorem on a Hilbert space, Rep. Math. Phys. 23, 99-107, 1986. [Pykacz, 19991 J. Pykacz. On Bell type inequalities in quantum logics, in The concept of Probability edited by E.J. Bitsakis and C.A. Niwlaides, Kluwer, Dordrecht, 1989. [Pykacz and Santos, 19911 J. Pykacz and E. Santos. On Bell inequalities, J. Math. Phys., 32, ~. 1287, 1991. [Rarnsav. 19661 A. Rarnsav. A theorem on two commuting- observables, Indiana Univ. Math. J. 15, ii7-234; 1966. [ E d e i , 19981 M. E d e i . Quantum Logic in Algebraic Approach, Kluwer Academic Publishers, Dordrecht, 1998.
Quantum Logics as Underlying Structures of Generalized Probability Theory
213
[Ri&anovi, 19981 Z. FtieEanovi. Order-topological separable complete modular ortholattices admit order continuous faithful valuations, Proc. Amer. Math. Soc. 126, 231-237, 1998. [Fbgalewicz, 1984al V. Rogalewicz. Remarks about measures on orthomodular posets, Cas. p h t . mat. 109, 93-99, 1984. [Rogalewicz, 1984b] V. Fbgalewicz. On the uniqueness problem for quite full logics, Ann. Inst. H. Poincare'41, 445-451, 1984. [Riittimann, 19851 G. Riittimann. Expectation functionals of obsembles and counters, Rep. Matrh. Phys. 21, 213-222, 1985. [Riittimann, 19771 G. Riittimann. Jauch-Piron states, J. Math. Phys.18, 189-193, 1977. [Ruymgaart, 19831 F. Ruymgaart. A note on the concept of joint distribution of pairs of observables, Sankhya, Ser. A 45, 38-43, 1983. [Sarymsakov et al., 19831 T. Sarymsakov, S. Ayupov, D. Khadziev, and V. Chilin. Ordered Algebras (in Russian) Filial AN, Tashkent, 1983. [Schultz, 19741 F. W. Schultz. A characterization of state space of orthomodular lattices, J. Comb. Theory A 17, 317-325, 1974. [ ~ e g a l19471 , I. Segal. Postulates for general quantum mechanics, Ann. Math. 48, 930-948, 1947. [Sherstnev, 19681 A. N. Sherstnev. On boolean logics, Uchen, Zapiski KGU 128, 48-62, 1968. (Russian) [Svozil, 19981 K. Svozil. Quantum Logic, Springer, Singapore 1998. [Tkadlec, 19931 J. Tkadlec. Partially additive measures and set representations of orthoposets, J. Pure Appl. Algebra 86, 79-94, 1993. [Urbanik, 19611 K. Urbanik. Joint probability distributions of obsembles in quantum mechanics, Studia Math. 21, 117-133, 1961. [Urbanik, 19851 K. Urbanik. Joint distributions and compatibility of obsembles, Demonstratio Math. 18, 31-41, 1985. [~aradarajan,19851 V. S. Varadarajan. Gwnaetry of Quantum Theory, Springer-verlag, New York, Berlin, Heidelberg, Tokyo, 1985. [Weber, 19941 H. Weber. There are orthomodular lattices without non-trivial group valued states; a computer-based construction, J. Math. Anal. Appl. 183, 89-94, 1994. [Zisis, 2000] M. Zisis. Approximate hidden variables, Found. Phys. 30, 971-2000, 2000.
This page intentionally left blank
HANDBOOK OF QUANTUM LOGIC AND QUANTUM STRUCTURES: QUANTUM STRUCTURES Edited by K. Engesser, D. M. Gabbay and D. Lehmann O 2007 Elsevier B.V. All rights reserved
215
QUANTUM LOGIC AND PARTIALLY ORDERED ABELIAN GROUPS David J. Foulis and Richard J. Greechie 1 INTRODUCTION
Our purpose in this expository article is to give an account of the connection between quantum logics1 and partially ordered abelian groups. In what follows, we use the word "logic" in the sense of a partially ordered algebraic structure L that could be interpreted as a semantic model for a formal symbolic logic L. This usage is customary in the literature of algebraic logic [Halmos, 19621, and it is consistent with the nomenclature of Birkhoff and von Neumann in their seminal article on the logic of quantum mechanics [~irkhoffand von Neumann, 19361. Our emphasis is on the mathematical structure of L rather than on the interpretation of its elements as propositions pertinent to a physical system. An account of L and C from the point of view of logic as an instrument of reasoning, as well as more comprehensive treatment of the general notion of a quantum logic, can be a et al., 20041. found in [ ~ a l l Chiara We begin, in Sections 2-5 below, with a brief sketch touching on some of the basic notions of orthodox quantum mechanics (QM). By orthodox QM, we mean nonrelativistic Hilbert-spaced-based QM without superselection rules and for which the observables are represented by projection-valued (PV) measures. Readers already knowledgeable about quantum physics can skim these sections rapidly to familiarize themselves with our notation. The relevant quantum logic (QL) for orthodox QM is the complete atomic orthomodular lattice P(4j) of projection o p erators on a Hilbert space Jj. The QL P(4) is a subset of the partially ordered abelian group G(4) of Hermitian (i.e., bounded self-adjoint) operators on 4. A comprehensive and authoritative account of the standard quantum logic P(4j) in the context of orthodox QM can be found in [~eltramettiand Cassinelli, 19811. In Section 6, we turn our attention to the much more general and flexible positiveoperator-valued (POV) measures for which the corresponding QL is the secalled effect algebra IE(4) of all positive semidefinite Hermitian operators on 4j that are dominated by the identity operator. Evidently P(4) C IE(4) C_ G(5). As "quantum-logical propositions", effect operators in IE(4) can manifest "fuzziness" or "un~harpness'~, while the projection operators in P(4) can be regarded as l ~ follow e common usage in which the term "quantum logic" refers not only to a logic associated with a quantum-mechanicalsystem, but indeed to any physical system whatsoever.
David J. Foulis and Richard J. Greechie
216
"sharp," even though their "truth values" might be subject to statistical fluctuations. For an exposition of POV measures and the contemporary quantum theory of measurements, see [ ~ u s c het al., 19911. The mathematical structures of P(Ej), IE(fj), and G(4) are so rich and the quantum-mechanical interpretations of these structures are so intriguing that one cannot resist the temptation to formulate and study more general triples P C E c G as abstractions or analogues of P(4) C IE(4j) c G(4). Thus, in Sections 7 through 16 we conduct an abstraction process, motivated and guided by suitable examples, that will ultimately result in the notion of a so-called "CB-triple" P c E c G consisting of a regular orthomodular poset P, an effect algebra E, and a CB-group G, i.e., a partially ordered abelian group enriched by a so-called "compression base." The notion of a CB-group is both very general and mathematically attractive, and may be considered as an appropriate basis for the general study of quantum logics. In Sections 17 and 18, we introduce and study a class of CB-groups, called archimedean RC-groups, for which a spectral theory has been developed. Because of the expository nature of this article, we give prooh only when we regard them as being illuminating or when they could be difficult to locate in the existing literature. Background material on Hilbert spaces can be found in [Halmos, 19981, a source for basic facts in regard to a-fields, measurable functions, and so on, is [Halmos, 19501, and [Halmos, 19631 is an authoritative exposition of the theory of Boolean algebras-all three of these classic references were authored by P.R. Halmos. The monographs of R.V. Kadison and J.R. Ringrose ri ad is on and Ringrose, 19831 provide comprehensive expositions of both the basic and advanced theory of operator algebras, and the treatise of G. Emch [ ~ m c h 19721 , is an excellent reference for applications of operator algebras to physics. In our treatment of partially ordered abelian groups, we follow the monograph [~oodearl, 19851 of K.R. Goodearl. For general lattice theory, the classic [~irkhoff,19791 of G. Birkhoff is the standard reference.
2 ORTHODOX QUANTUM MECHANICS Orthodox quantum mechanics (QM) is founded on the assumption that there is a correspondence S -+ fi assigning a complex separable Hilbert space fi to a QMsystem S . Let (. , be the inner product2 on f j and denote the additive abelian group of all bounded Hermitian operators on 4j by G(fi). The tenets of orthodox QM speclfy that bounded (real) observables for S are represented by operators A E G(fj), (pure) states for S are represented by unit vectors E 4, and the expectation value of an observable A when the system S is in the state $J is given by (A$J,$J). DEFINITION 1. If $J is a state vector in 4 , i.e., ll$Jll = 1, and W denotes the system of real numbers, we define the expectation mapping w $ : G(4j) -+ IR by a)
$J
2 ~ h y s i ~ i susually ts use the Dirac bra-ket notation (. I .) for the inner product.
217
Quantum Logic and Partially Ordered Abelian Groups
w+(A) := (A$, $) for all A E G ( J ~ ) . ~ The expectation value w+(A) is usually interpreted as the limit as n + oo of the arithmetic mean of n independent measurements of the bounded observable A on the QM-system S , or replicas thereof, in the fixed state $. The expectation mappings w+ are used to organize the Hermitian group G(4) into a partially ordered abelian group [Goodearl, 19851 as follows: if A, B E 6 ( 4 ) , then by definition A 5 B iff4 w$(A) 5 w+(B) for every state vector $JE 4. In fact, under the partial order 5, G(4) is an order-unit-nomed real Banach space with the identity operator 1 E G(4) as the order unit [Alfsen, 1971, page 691. F'urthermore, the order-unit norm coincides with the uniform operator norm 11 . 11 on G(fi), and therefore, for A E G(a), (1) IlAll = inf{m/n
I 0 5 m E Z, 0 < n E Z,
and - m l 5 nA 5 m l ) ,
where, as usual, Z is the ring of integers. If 0 is the zero operator in G(*), then (by a slight abuse of language), observables A E G(4) with 0 5 A are called positive. We note that the norm of a positive bounded observable is the maximum expectation value of that observable for all state vectors, i.e.,
The positive operators A in G(4) are exactly the operators of the form A = B2 for B E G(4). Indeed, if B E G(4), then for every state vector $,
whence 0 5 B2. Conversely, if 0 5 A E G(4), then there is a unique operator and A = E G(4) such that 0 5 [ ~ i e s and z Nagy, 1955, page 2651.
a
If A E G(4), then 0 5 A', and one defines IAl := A- := i(IAI - A). Then
a, A+
:= l(IAl 2 +A), and
Thus, every bounded observable is the difference of two bounded positive observables. Suppose that A1 5 A2 5 . . . is an ascending sequence of bounded observables. Then the sequence is bounded above in norm (i.e., there is a real number P with llAnll 5 P for all n E M := {1,2,3, ...)) iff it is bounded above in G(4) (i.e., there is a bounded observable B E G(4) such that A, 5 B for all n E M). Furthermore, if the sequence is bounded above in either sense, then by Vigier's theorem [Riesz and Nagy, 1955, page 2631, there is a uniquely determined bounded observable A E G(4) such that, for every $ E 4, IIA,$ - A611 + 0 as n + oo, i.e. the sequence A1, A2,... converges to A in the strong operator topology. But, if A, -t A in the strong operator topology, then A, + A in the weak operator 3 ~ h notation e := means "equal by definition." 4We use "iff' as an abbreviation for "if and only if!'
David J. Foulis and Richard J. Greechie
218
topology, and it follows that w+(A,) converges monotonically up to w+(A) for each state vector $ E 4j. The latter condition implies that A is the supremum (least upper bound) of the sequence All A2, ... in G(4j); hence the Hermitian group G(4j) is (Dedelcind) monotone a-complete, i.e., every bounded ascending sequence in G(4) has a supremum. Now suppose that B1, B2, ... is a sequence of positive bounded observables, deBi for all n E N,and assume that the ascending fine the partial sum A, := Cy=L=l sequence A1 5 A2 5 . is bounded above. Then the sequence All A2, ... has a supremum A to which A, converges in the strong operator topology. By definition, CEl Bi:= A, where the series converges in the strong (hence in the weak) operator topology. In particular, for every state vector $, we have -
0
and, in this sense, the expectation mappings w+ are countably additive on positive observables. According to orthodox QM, the spectrum spec(A) of an observable A E G(4j) can be interpreted as the subset of the real number system R consisting of all possible numerical values of individual measurements of A in various states5. Thus, if P E G(4j) and spec(P) G (0, I}, then we can regard P as a "two-valued proposition" about the system S with possible truth values 1 (true) and 0 (false). As is easily seen, if P E G(Ej), then spec(P) C {O,l) ifF P = P 2 . Thus, we define
and regard observables P E P(5) as experimentally testable truelfalse (or yes/no) propositions about the QM-system S . The zero operator 0 and the identity o p erator 1 on 4j belong to P(fi), and they can be regarded as propositions that are always false and always true, respectively. The truth values of propositions P E P(4j) other than 0 and 1may vary from measurement to measurement, even if the state $ remains constant. Operators P E P(5) are called projections (or, by some authors, projectors). If P E P(5) and $ is a state vector in 4 , then by Equation (3), w+(P) = w+(P2) = 11 P$1I2. The expectation value w+(P) is the long-run relative frequency with which the result 1 (true) will be obtained for independent measurements of P in state $. In other words, w+(P) = llP$112 is the probability that the proposition P is true (or more accurately, will be found to be true if tested) when the QM-system S is in state $. Thus, we shall refer to the restriction of the expectation mapping w+ to P(4) as the probability measure or as the probability state determined by the state vector $. Suppose that $ and 4 are state vectors in 4j and denote by C the system of complex numbers. Then 5 ~ o short, r a measurement of A when the system S is in state qlJ is often referred to as a measurement of A in state qlJ.
Quantum Logic and Partially Ordered Abelian Groups
(7) w$
= w+
on P(4) @ 30 E @ with 101 = 1 and I) = 04.
For a general quantum logic L, a state is often defined as a "probability measure" 7 ~ L : -+ [O, l] W (see Section 7 below). By (7),in the prototype quantum logic P(fj), this entails disregarding phase relations among the state vectors. The identification of physical states with probability states might be innocuous as long as one is considering independent measurements of one and only one observable, but the phase relations could be critical when non-independent or sequential measurements are involved. However, we shall not address this issue in the present article. The partial order on the Hermitian group G(4) induces (by restriction) a partial order on P(4) and, for P, Q E IF(%), P 5 Q iff the probability w$(P) is less than or equal to the probability w$(Q) for every state vector I). It is not difficult to show that
If P, Q E P($) we say that P and Q are orthogonal, in symbols P I Q, iff P Q E P(4j). Thus,
+
It is convenient to have a special symbol for the sum of two orthogonal projections, and we use @ for this purpose. Thus:
We refer to PCBQ as the orthogonal sum, or for short the orthosum, of the orthogonal projections P and Q. Suppose that P,Q E P(4). In regarding the system P(4) as a "logic" and P, Q as "propositions," we regard 1 - P as a "negation" or "logical denial" of P , and we interpret P Q to mean that P "implies" Q.6 Since
<
the condition P I Q means that, in some sense, P and Q "refute each other." Thus, if P I Q, we may think of P@Q as a kind of "disjunction" of the mutually refuting propositions P and Q. We shall refer to P(4), equipped with the "negation mapping" P ct 1 - P, the partially defined binary operation @, and the partial order relation 5, as the sharp quantum logic associated with the Hilbert space 4. (In Section 6 below, an "unsharp" or "fuzzy" quantum logic will be introduced.) Let PI,P2,P3,... be a sequence of pairwise orthogonal propositions in P(4). Then, it can be shown that Cy=l Pi E P(4) for every positive integer n, whence it is natural to define n
' ~ o t ethat the implication relation
5 is not a logical connective on the quantum logic P(4).
David J . Foulis and Richard J. Greechie
220
or with alternative notation, Pi := C;=l pi. As the partial sums ELl Pi are bounded above by 1,it follows that the infinite series EEl Pi converges (in the strong and weak senses) to an observable in G(4) which is, in fact, the supremum of the partial sums. It can be shown that Pi E IF'($), whence it is natural to define 00 00 @pi :=
C
E P(4)
as a kind of "infinite orthogonal disjunction" of the propoand to regard @ E l sitions PI,P2,P3,... . By (5), the probability measures determined by the state vectors are countably additive in the sense that
for each state vector
I).
DEFINITION 2. Let B(W) be the a-field of Borel subsets of W. A projection-valued (PV) measure is a mapping M H PMfrom Borel sets M E B(W) to projections PME P(9) that has the following properties: (i) f i = 1. (ii) If MI, M2, M3, ... is a pairwise disjoint sequence in B(B) and M = Mi, then PMl, PM2, ... is a pairwise orthogonal sequence in P(4) and PM= PMi. The PV-measure M o PMis said to be bounded iff there are real numbers a < P such that P[a,pl = 1. As a consequence of the spectral theorem, a bounded observable A E G(4) determines and is determined by a bounded PV-measure M H PMin such a way that A = JR L dPM, where L is the identity function on B and the integral converges in the uniform norm topology. Here the proposition PMis to be interpreted as asserting that the measured value of A belongs to the Borel set M . Likewise, unbounded observables also correspond to PV-measures, but without the boundedness condition. If M H PMis a PV-measure and $ is a state vector, then M H w,+,,(PM)is a countably additive probability measure on the a-field B(B); thus by combining an observable (bounded or unbounded) and a state we obtain a conventional Kolrnogorovian probability measure. Operations that are only partially defined are always something of an annoyance, and it is reassuring to keep in mind that the partial binary operation on P(4) can be extended to a bona jide binary operation on the whole Hermitian group G(4); furthermore, for each state vector I), the probability measure (or probability state) P H w+(P) on P(4) can be extended to the expectation mapping A H w+(A) on G(4).
UZl
@zl
+
3 PROJECTIONS AND COMPRESSIONS
Closed linear subspaces ?JJZof 9 play important roles in the study of the QMsystem S . It is often necessary or desirable to drop down t o a subspace ?JJZ 4
Quantum Logic and Partially Ordered Abelian Groups
221
to eliminate degrees of freedom that are not of current interest. For instance, in considering the spin components of a spin-112 particle S, it is appropriate to drop down to a twedimensional subspace IM of 4 where the spin observables "live" [Beltrametti and Cassinelli, 1981, Chapter 41. Let T be a bounded linear operator (not necessarily self-adjoint) on 4 and let IM be a closed linear subspace of 4 . Then IM is said to be invariant under T ifT T(IM) C IM, in which case the restriction TIm of T to IM is a bounded linear operator on IM. If IML := {< E 4 1 (E, v) = 0, Vq E IM} is the orthogonal complement of IM, and if both IM and DlL are invariant under T, then T decomposes into sort of a "direct product" of TIzmand TIm*, and we say that Dl reduces T. If T is Hermitian, then IM is invariant under T iff IM reduces T. If P E P(4) and IM is a closed linear subspace of 4, then P is said to be the projection onto IM ifT the range of P is IM, i.e., P ( 4 ) = IM. There is a one-teone correspondence P * IM between projections P E P(4) and closed linear subspaces IM of 4 given by P ( 4 ) = IM. If P is the projection onto Dl, then 1- P is the projection onto IM1. If T is a bounded linear operator on 4 and P is the projection onto IM, then IM is invariant under T iff P T P = T P . The mapping T H P T P , called the Naimark compression determined by P, maps G(4) into itself, and we shall refer to its restriction to G(4) as a compression. Compressions on G(4) will play an important role in our subsequent development, and we shall use the notation in the following definition for them. DEFINITION 3. If P E P(4) we define the compression Jp: G(4) -+ G(4) by Jp(A) := P A P for all A E G(4). The compressions Jp provide a convenient way for dealing algebraically with closed linear subspaces of 4. For instance, let P E P(4) and let IM = P ( 4 ) . If A E G(Jj), then the restriction JP(A)IW of Jp(A) = P A P t 0 . m is a Hermitian operator on the Hilbert space IM. Moreover, under restriction to IM, the subgroup Jp(G(8)) = { P A P I A E G(fj)} of G(4) is isomorphic as a partially ordered abelian group to the Hermitian group G(IM). The compression mappings Jpon G(4) are characterized algebraically as follows (see [Foulis, 2004al). THEOREM 4. Let J : G(4) + G(4) and let P := J(1). T h e n P E P(4) and J = Jp iff J i s a n order-preserving group homomorphism, P 5 1 , and J ( E ) = E for all E E G(4) with 0 5 E 5 P. 4 SYMMETRIES
In this section, we give a very superficial sketch to indicate how physical symmetries of the QM-system S interact with the Hermitian group G(4) and the projection lattice P(4). According to the so-called "Heisenberg picture," a physical symmetry of S (e.g., a rotation of S in physical space) induces a mapping A H
<
222
David J. Foulis and Richard J. Greechie
then of course JA is again a bounded observable, and plausible arguments can be made to show that the mapping A o JA is a "unital automorphism" as per the next definition. DEFINITION 5. A mapping E: G(9) t G(4) is a unital automorphism iff E is an automorphism of the abelian group G(9) such that J 1 = 1and both J and J-I are order-preserving mappings on G(4). In what follows, we shall assume that physical symmetries for S correspond t o unital automorphisms J of G(4). THEOREM 6. Suppose that 5 i s a unital automorphism o n G(4). T h e n there exists a unitary or antiunitary operator U o n 4 such that [A = UP1AU for all A E G(9). Conversely, each unitary or antiunitary operator U o n 4 gives rise t o a unital automorphism J o n G(4) defined by JA := U-lAU for all A E G(4). Proof. If the dimension of 4 is three or more, then the desired conclusion follows from G. Ludwig's version of Wigner's theorem on symmetry transformations (see [Casinelli et al., 19971). That the conclusion also holds when the dimension of 4 is 2 follows from [ ~ o l n hand r Phles, 20011. If 4 has dimension 1,then W is isomorphic under X H A 1 to G(4) as an ordered group, and the desired conclusion follows from the fact that the only order-preserving group automorphisms of B are of the form X H K X where K E W is a positive constant. The converse is obvious. COROLLARY 7. If J i s a unital automorphism o n G(B), then J maps P(4) onto itself, and the restriction of J to P(4) i s a order automorphism that preserves orthogonality and orthogonal sums. In the sense of Corollary 7, a physical symmetry induces a "logical symmetry" on the sharp quantum logic P(5). As a consequence of Theorem 6, if z is a multiplicatively-written group (e.g., a group of physical symmetries of S), then a unitarylantiunitary representation of z on 4 is mathematically equivalent to a unital action of E on G(4), i.e., a mapping (J, A) H JA from E x G(4) to G(4) satisfying the following conditions for all J, J' E E and all A, B E G(4): (i) (<<')A = <(<'A). (ii) If 1 is the identity i n = , then l A = A . (iii) J l = 1. (iv) J(A+B) =JA+JB. (v) A 5 B + J A 5 E B . In the theory of unitarylantiunitary group representations, the notion of reduction of a representation by a closed linear subspace is of special significance [~chroeck,1996, Chapter 111, Section 11. If a unitary/antiunitary representation of a group E on Ij is expressed as a unital action of E on G(4), then a closed linear subspace 2132 of 4 reduces the representation iff the compression Jp corresponding to the projection P onto commutes with the unital action in the sense that J(Jp (A)) = Jp(
Quantum Logic and Partially Ordered Abelian Groups
223
symmetry <,it will be in state <$ after the application of J. The Heisenberg and Schrodinger pictures are physically equivalent, and the relation between them is simply that w+(JA) = w<*(A) for all A E G(4) and all state vectors $. From this relation, it follows that if U is the unitary or antiunitary transformation on 4 representing 5 as in Theorem 6, then <$ = U($). Temporal transformations of states (Schrodinger picture) or observable5 (Heisenberg picture) according to a (reversible) dynamical law are represented by a onefor all t, t ' € W. parameter family (
ct#
5 MIXED STATES AND DENSITY OPERATORS If the QM-system S is coupled with another QM-system system S' to form a composite system S +St,then the tenets of QM stipulate that the Hilbert space for S S t is the Hilbert-space tensor product 4j @ f i tof the Hilbert spaces Sj and 3' for S and St,respectively [Aerts et al., 19781. Even if the composite system S S' is in a pure state represented by a unit vector in 4 @ fit, the subsystem S need not be in a pure state. In general, the subsystem S will be in a secalled mixed state in the sense that the expectation values for an observable A measured on S will be a convex linear combination of expectation values w+(A), w+(A), ... for suitable state vectors $, 4, ... E 4. Such a mixed state is represented by a secalled density operator. Let T(3) be the (real) linear subspace of G(4j) consisting of the Hermitian trace-class operators, and let D(4) be the convex subset of T(4j) consisting of the positive trace-class operators D with tr(D) = 1. Operators D E D(4j) are called (von Neumann) density operators on 4, and the (possibly) mixed states for the QM-system S are represented by these density operators7. By definition, the expectation value wD(A) of the bounded observable A E G(4) when the system S is in the state D E D(4j) is given by the Born formula
+
+
'physicists usually denote density operators by the Greek letter p.
224
David J. Foulis and Richard J. Greechie
As in Equation (5), the expectation mapping WD is countably additive. If $ E Sj is a state vector, then the projections P$ E P(Sj) onto the onedimensional subspace of Sj spanned by $ is a density operator on Sj, and the density operators of the form P$ for $ E Sj with ll$ll = 1 are the extreme points of the convex set D(9). Furthermore, wp, as given by the Born formula (1) coincides with the expectation mapping wq as in Definition 1. Thus (neglecting phase factors), the pure states of the QM-system S are represented by the extreme points of the convex set ID@). Mixed states also arise in connection with ensembles of replicas of the QMsystem S. If $i, i = 1,2, ...,n, are state vectors, and if for each i a fraction pi of the systems in the ensemble are in the pure state Qi, then the state of the ensemble can be considered to be the mixed state represented by the convex linear sum
If A E G(Sj), then wD(A) can be interpreted as the expectation value for a measurement of the bounded observable A on a system chosen at random from the ensemble. If P E P(8) and D E D(4) is a density operator, then the expectation value wD(P) is the long-run relative frequency with which the result 1 (true) will be obtained for independent measurements of P in the mixed state D l i.e., wD(P) = tr(DP) is the probability that the proposition P is true (or, more accurately, will be found to be true if tested) when the QM-system S is in the mixed state D. Thus, we shall refer to the restriction of the expectation mapping WD to P(3) as the probability measure or as the probability state determined by the density operator D. An alternative interpretation for the mixed state D in Equation (2) is afforded by the notion that an agent might be in possession of information that the QMsystem S is in one of the pure states $i, and that pi is the probability that S is in state $ifor i = 1,2, ..., n. Then wD(P) = tr(DP) is the probability that the agent should assign to the proposition P E P(5). According to this interpretation, although the pure states P$, may be ontic, i.e., "real physical states," the mixed state D is epistemic, i.e., it is a state of incomplete knowledge about the ontic state of S . For an exposition of the epistemic interpretation of states, see [F'uchs, 2002; Spekkens, 20041. With the partial order inherited from G(Sj), T(Sj) is a base-nonned Banach space with the density operators D(Sj) as the cone base [Alfsen, 1971, page 771, and the base norm coincides with the trace norm. The base-normed Banach space T(B) is in separating order and norm duality with the order-unit Banach space G(Sj) under the bilinear form (., .) defined by (C, A) := tr(CA) for C E T(Sj) and A E G(Sj); in fact, under this duality, G(Sj) may be identified with the Banach s~hysicistsuse the Dirac notation !$)(+I
for the projection PJ,.
Quantum Logic and Partially Ordered Abelian Groups
225
dual space of T(4). This duality is the basis for the formulation of operational s Lewis, 19701. quantum mechanics by Davies, Lewis, et al. [ ~ a v i eand
6 EFFECT OPERATORS AND POV-MEASURES In general, if A E (6(4), the expectation values wD(A) for density operators D E D(4) cannot be construed as probabilities because they will not necessarily belong to the unit interval [O,l] C W. But, if E E G(4) with 0 5 E 5 1, then 0 WD(E)5 1for every density operator D, and it becomes feasible to think of E as some kind of "proposition" and of wD(E) as its probability in state D. Thus, we define
<
and we think of E(4) as a sort of "logic." Following G. Ludwig [Ludwig, 19831, operators E E E(4) are called effect operators on 4 . Evidently, P(4) C lE(4), and we can extend the notion of orthogonality and the orthogonal sum $ to E(4) as follows: if E, F E IE(4), then by definition, E IF iff E F E IE(4), in which case E @ F := E F. However, the extended notion of orthogonality is not as well-behaved as orthogonality on P(4). Indeed, the sum of a finite pairwise orthogonal sequence of projections is again a projection, but, in general, the analogous condition fails spectacularly for effect operators. For instance, if El = E2 = E3 = 41, then El,E2,E3 are pairwise orthogonal effect operators, but El E2 E3 = $14 IE(4). Thus, for IE(4), the notion of orthogonality of three or more elements must be handled more delicately. We say that a finite sequence El,E2, ...,En E E(4) is jointly orthogonal iff z y = l Ei E lE(fj). Evidently, every subsequence of a finite jointly orthogonal sequence is again jointly orthogonal. If the finite sequence El,E2,..., En is jointly orthogonal, we define El $ E2$. - - $En := ELl Ed,or with alternative notation, Ei := Cy=l Ei; and we say that an infinite sequence El, E2,... E IE(4) is jointly orthogonal iff every finite subsequence is jointly orthogonal. Clearly, the infinite sequence El,E2,... is jointly orthogonal iff every finite initial sequence El,E 2 , ..., En is jointly orthogonal. Suppose El,E2,... E E(4) is an infinite jointly orthogonal sequence of effect operators. As the partial sums Cy=l Ei E IE(fj) are bounded above by 1, it follows that the infinite series Czl Ei converges (in the strong and weak senses) to an operator in G(4) which is, in fact, the supremum of the partial sums. Since the partial sums are positive and bounded above by 1, their supremum is again an effect operator, whence it is natural to define @ z l Ei := Czl Ei E E(4). The probability measures on lE(4) determined by the density operators D E D(4) are countably additive in the sense that
+
+
+ +
David J. Foulis and Richard J. Greechie
226
for each density operator D. The notion of a PV-measure (Definition 2) extends in a natural way to a measure on the real Borel field B(R) taking on values in IE(4). DEFINITION 8. A (normalized) positive-operator-valued (POV) measure is a mapping M H EM from Borel sets M E B(R) to effect operators EM E E(4) that has the following properties: (i) Ew= 1. (ii) if MI, M2, M3, ... is a pairwise disjoint sequence in B(W) and M = Mi, then EM1, EM2, ... is a jointly orEM,. The POV-measure M I+ EMis thogonal sequence in IE(4j) and EM= said to be bounded ifE there are real numbers a < P such that E[,,pl= 1 .
UEl $El
As with PV-measures and state vectors, by combining a POV-measure M H EMand a density operator D E D(fi), we obtain a conventional Kolmogorovian probability measure M I+ wD(EM) on the u-field B(R). A POV-measure M H EMis a PV-measure (i.e., EME P(4) for all M E B(B)) iff E M n N = EMEN= ENEMfor all M, N E B(W). The POV-measures provide a much more general notion of an observable than do the PV-measures. In fact, they "allow for the possibility of joint measurements of noncommuting observable~,especially complementary observables, in full accordance with the uncertainty relations" [Busch et al., 1991, pp. 12-13]. Thus, unlike projections P E P(fj), effect operators E E IE(4), regarded as propositions, can manifest "uncertainty" or "unsharpness." Whereas P($) is a quantum logic consisting only of sharp propositions, the larger system E(4j) also admits unsharp propositions. If P, Q E P(fi), then JQ(P) = Q P Q is again a projection iff P Q = Q P , but JQ(P) is always an effect operator on 4, and its restriction JQ(P)lm to Dl := Q(4) is an effect operator on the Hilbert space Dl. Furthermore, if M H PMis a PV-measure, then M H JQ(PM)lm is a POV-measure for Dl, and in this sense the compression JQmaps PV-measures to POV-measures. Conversely, by the Naimark dilation theorem if M H EMis a POV-mzasure, then 4 can be realized as a closed linear subspace of a larger Hilbert space 4j in_such a way that M H EM is the image under a compression of a PV-measure for Ej [Schroeck, 1996, Chapter 21. The following theorems provide connections among effect operators, projections, compressions, and positive Hermitian operators which we shall be using in the sequel. THEOREM 9. If E E IE(fj) and P E P(fi), then: (i) E 5 P @ E = EP. (ii) P < E * P = E P . ( i i i ) E + P € I E ( 4 ) * E P = O . (iv) J p ( E ) = O @ E < l - P . Proof. Part (i) follows from [~reechieet al., 1995, Theorem 6.6 (iii)]. (ii) By 1-E 1 - P H 1- E = (1- E)(1 - P ) H P = E P . (iii) (i), P 5 E E P E IE(4) E P 5 1H E 5 1- P, hence (iii) follows from (i). (iv) If
+
Jp(E)
*
* +
= PEP = 0,
<
then, since 0 5 E , it follows that EP = 0, whence E 5 1 - P
Quantum Logic and Pal-tially Ordered Abelian Groups
by (iii). Conversely, if E 5 1- P, then 0
227
< Jp(E) < Jp(1) - Jp(P) = P - P = 0.
rn
THEOREM 10. Let R E IE(Jj). Then the following conditions are mutually equivalent: (i) R E IF'(4). (ii) If E E IE(q), then E 5 R, 1- R =+ E = 0. (iii) If E,F€IE(fi) a n d E , F < R, t h e n E I F = + E @ F sR.
Proof. See [Greechie et al., 1995, Theorem 6.81. THEOREM 11. Let D, E, F E IE(4j) with D + E + F E IE(4j), and suppose that P : = D + E E P ( 4 ) andQ:=D+F€P(Jj). ThenDEP(4) a n d J p o J Q = J D .
+
+ +
Proof. Assume the hypotheses. Then E Q = D E F E IE(fj), D < D F = Q, and D 5 D E = P, so E Q = 0, D Q = D, and D P = D by Theorem 9. Define J: G(4) -t G(4) by J := Jp o JQ. Then J is an orderpreserving group endomorphism on G(4j) and J ( l ) = Jp(JQ(l)) = Jp(Q) = P Q P = (E D ) Q P = D P = D. Suppose C E IE(4j) with C 5 D. Then C P, Q, whence J(C) = Jp(JQ(C)) = Jp(C) = C, and it follows from Theorem rn 4 that D E P(4) and J = JD.
+
<
+
+
THEOREM 12. Let P E P(4). Then the condition Jp(A) 5 A holds for all positive Hemitian operators A iff P = 0 or P = 1.
Proof. Suppose that, for all A E G(4), 0 5 A =+ Jp(A) = P A P 5 A and define J ' : G(5j) -t G(Ej) by J '(A) := A - Jp(A) for all A E G(4). Then J ' is a group endomorphism on G(4) and, since it maps positive operators to positive operators, it is order preserving. Suppose 0 5 E E G(4) with E 5 J '(1) = 1-Jp(1) = 1-P. Then 0 5 Jp(E) < J p ( l - P ) = 0, so Jp(E) = 0, and it follows that J t ( E ) = E . Therefore, by Theorem 4, J' = J1-p, whence A = Jp(A) J '(A) = Jp(A) J1-p(A) = P A P (1- P ) A ( l - P ) for all A E G(4). Consequently, P A = P A P and A P = P A P , whence P A = A P for all A E G(4), i.e., the projection P commutes with every Hermitian operator on Sj. It follows that P commutes with every bounded operator on 4, hence that P = A 1 for some complex number A. As P = p2,we have X = X2, hence X = 0 or X = 1, i.e., P = 0 or P = 1. The rn converse is obvious.
+
+
+
THEOREM 13. Let A E G($). Then A 2 0 ifj there is a finite sequence El,E2,...,En in IE(4j) such that A = El E2 En.
+ + +
Proof. Suppose that A 2 0 and choose a positive integer n 2 IIAll. Then (l/n)A E IE(4j) and with Ei := (l/n)A for i = 1,2, ...,n, we have A = El E2 . + En. The converse is obvious. rn
+ +
David J. Foulis and Richard J. Greechie
7 ABSTRACTION FROM P(4j) AND IE(Sj)-EFFECT
ALGEBRAS
The notion of an "effect algebra," as per the following definition, is abstracted from the prototype quantum logics IF'($) and IE(4j). DEFINITION 14. An effect algebra is a system (El 0, u, 11 ,@) 1 consisting of a set El special elements 0, u E E called the zero element and the unit element, a binary relation I on E called orthogonality, a unary operation p cr pL on E called orthosupplementation, and a partially defined binary operation @ on E called orthosummation such that, for all dl e l f E El (i) e @ f is defined iff e If . (orthogonality law) (ii) If e I f , then f I e and e @ f = f CB e. (commutativity law) (iii) If e I f and d I (e@f), then d I el (d@e) If , and d@(e@f ) = (d@e)@f. (associativity law) (iv) For each e E El e l is the unique element in E such that e I e l and e @ e l = u. (orthosupplementation law) (v) If e Iu, then e = 0. (zero-unit law) If (El 0, u, Ill, @) is an effect algebra, the relation 5 is defined on E by e 5 f iff there exists d E E such that e Id and e @ d = f . If an effect algebra (El 0, u, Ill,@) is regarded as a "logic" (i.e., as an algebraic model for a deductive logical calculus), then elements e l f E E can be thought of as "propositions," e 5 f means that e "implies" f , and 0, u E E are "anti-tautological" and "tautological" constants, respectively. The orthogonality condition e I f means that, in some sense, the propositions e and f "refute" each other. The orthosupplementation mapping e I+ e l is a version of "logical negation," and the "double negation law" e = (eL)l holds. If e If , then e @ f is a version of "logical disjunction" of the "mutually refuting" propositions e and f . Basic properties of effect algebras, e.g., the fact that an effect algebra E is partially ordered by 5 and that, for e l f E El e I f H e 5 f L , can be found in [Foulis and Bennett, 19941. In what follows, we regard all quantum logics as being effect algebras (but not necessarily converselyQ). If no confusion threatens, we usually refer to an effect @) simply as E. Of course, both the prototype quantum algebra (El 0, u, 111, logics P(4j) and IE(4j) are effect algebras, and the partial order on the prototypes coincides with the relation 5 in Definition 14. Let E be an effect algebra. Elements e l f E E are said to be orthogonal iff e I f . By recursion, a finite sequence ellea, ...,en in E is said to be jointly orthogonal with orthosum el @ e2 @ . - @ en ifF el, ea, ...,en-1 is jointly orthogonal and (el @ e2 @ . . . @ en-1) I en, in which case el @ e2 @ - .. @ en := (el @ e2 @ g ~ h e r eare effect algebras that are quite bizarre and perhaps do not arise as a logic of a physical system.
Quantum Logic and Partially Ordered Abelian Groups
229
- .. @ en-l) @ en. The alternative notation ei := el @ ez @ . - .@ en is also used for the orthosum. The condition of joint orthogonality and the orthosum are independent of the order in which the elements of the finite sequence are written. DEFINITION 15. An infinite sequence el, ez, ... in the effect algebra E is said to be jointly orthogonal iff every finite subsequence is jointly orthogonal. If el, ez, ... is jointly orthogonal, and if the partial orthosums s, := ei have a supremum (least upper bound) s in the partially ordered set E, we say that the sequence el, ez, ... is orthosummable and we define its orthosum to be @ E l ei := s. An effect algebra E in which every jointly orthogonal infinite sequence is orthosummable is called a a-effect algebra.
$L1
We note that both of our prototypes P(4) and IE(4) are a-effect algebras. EXAMPLE 16. As usual, a Boolean algebra is a bounded, complemented, and distributive lattice. If AB and V B are the infimum (greatest lower bound) and supremum (least upper bound) operations in the Boolean algebra B and if 0 and 1 are the smallest and largest elements in B , then B is organized into an effect algebra (B, 0 , 1 , 1 , l , @) by defining a I b iff a AB b = 0, in which case a @ b := a V g b, and by defining aL to be the Boolean complement of a for all a, b E B. A sequence in B is jointly orthogonal iff its elements are pairwise orthogonal, i.e., pairwise disjoint. Also, B is a a-effect algebra 8 it is a-complete as a Boolean algebra (i.e., 8 every countable subset of B has a supremum and an infimum in B). DEFINITION 17. A Boolean effect algebra is an effect algebra (B, 0, u, 1,l, @) such that the bounded partially ordered set, (B, 0, u, <) is a complemented and distributive lattice-hence a Boolean algebra-and, for each b E B, bL is the Boolean complement of b in B. A Boolean a-effect algebra is a Boolean effect algebra B such that, as a Boolean algebra, B is a-complete. If a Boolean algebra B (respectively, a a-complete Boolean algebra) is organized into an effect algebra as in Example 16, then the resulting effect algebra is a Boolean effect algebra (respectively, a Boolean a-effect algebra). Thus, Boolean algebras and Boolean effect algebras are essentially equivalent notions. Caution: There are simple examples [Greechie et al., 1995, Example 7.41 of effect algebras ( E ,0, u, 1,l, @) such that (E,0, u, 5 ) is a Boolean algebra, but E is not a Boolean effect algebra because the orthosupplementation mapping e I+ eL does not coincide with the Boolean complementation. Partially ordered by set-inclusion, a field of subsets B of a set X is a Boolean algebra, and thus can be organized into a Boolean effect algebra as in Example 16. If B is a a-field, then, as a Boolean effect algebra, B is a a-effect algebra. Caution: As a Boolean effect algebra, a field of subsets 23 of a set X can be a a-effect algebra even though B is not a a-field. Redressing this bothersome situation is really what 20001. the Loomis-Sikorski theorem is all about [~vure~enskij, Boolean algebras are semantic models for classical propositional calculi, so Boolean effect algebras may be regarded as classical "quantum" logics (e.g., the
David J. Foulis and Richard J. Greechie
230
logic of experimentally testable propositions pertaining to a classical mechanical system). DEFINITION 18. Let El and E2 be effect algebras with units ul and ua, respectively. A mapping 4: El t E2 is called an effect-algebra morphism iff 4(u1) = 212 and e If + 4(e) I 4 ( f ) with 4(e @ f ) = 4(e) @ 4(f) for all e, f E E. An effectalgebra isomorphism is a bijective effect-algebra morphism q5 such that 4-I is also an effect-algebra morphism. If El and E2 are a-effect algebras, then an effectalgebra morphism 4 : E l + E2is called a a-effect-algebra morphism iff it preserves jointly orthogonal sequences and preserves the orthosums of such sequences. By a symmetry of an effect algebra E, we mean an effect-algebra automorphism of E, i.e., an effect-algebra isomorphism E : E 4 E. We note that an effect-algebra morphism 4: El -+ E2 is order preserving, i.e., if e, f E El then e 5 f + 4(e) 5 4(f ) . As a consequence, an effect algebra isomorphism preserves all existing suprema and infima. In particular, every symmetry of a a-effect algebra is a a-effect-algebra morphism. DEFINITION 19. If E is an effect algebra, regarded as a quantum logic, then a (finitely additive) E-valued obseruable is defined to be an effect-algebra morphism a : B + E from a Boolean effect algebra B to E. If both B and E are aeffect algebras and a: B + E is a a-effect-algebra morphism, then the E-valued observable a is said to be a-additive. If a: B + E is an observable and elements of B are interpreted as classical propositions, then for each b E B, the proposition p = a ( b ) is a possibly "nonclassical" counterpart of b in the quantum logic E. For the prototypes P(4) and IE(4), the PV-measures and POV-measures, respectively, are a-additive observables defined on the real Bore1 field B(R). EXAMPLE 20. The real unit interval [O,1] 2 R is organized into an effect algebra ([O, 1],0,1, ,@) as follows: If p, q E [O,l], define p Iq i£F p q 5 1, in which case p CB q :=p q, and define pL := 1- p. Then [O,1] is a a-effect algebra, where a sequence pl ,p2, ... in [O,1] is jointly orthogonal iff the infinite series pi converges and Czlpi 5 1, in which case pi = CElp i -
+
+
$El
c
If 4 is a one-dimensional Hilbert space, then the unit interval [O,1] R is isomorphic as an effect algebra to IE(4) under the mapping X H X I , and P(4) is [O, 11 R is actually a the tweelement Boolean algebra {0,1}. Thus, {0,1} special case of our prototypic triple P(4) IE(4) G(4).
c
c
c
c
DEFINITION 21. If E is an effect algebra, regarded as a quantum logic, and [0,1] R is organized into an effect algebra as in Example 20, then a (finitely additive) probability state, or probability measure, for (or on) E is defined to be an effect-algebra morphism n : E + [O, 11. If no confusion threatens, a probability state n on E is often called a state for short. If E is a a-effect algebra and n : E + [O,1] is a a-effect-algebra morphism, then the probability state n is said to be a-additive.
c
Quantum Logic and Partially Ordered Abelian Groups
231
If p E E and n is a probability state for E, then n(p) may be regarded as the probability assigned by the probability model n to the (possibly) "nonclassical" proposition p. For the prototypes P(4) and IE(fi), the probability measures W D determined by the density operators D E D(4) are a-additive probability states. Conversely, by a celebrated theorem of A. Gleason [Dvure~enskij,19931, if 4 has dimension 3 or more, then every a-additive probability state on the prototypes has the form W D for a uniquely determined density operator D. The interplay among observables, symmetries, probability states, Boolean algebras, quantum logics, and the real unit interval 10, l] W is indicated by the diagram in Figure 1. Figure 1
Symmetry
Probability
noa
Probability Measure
Interval
In Figure 1,the observable a is a morphism from the Boolean algebra, regarded as a Boolean effect algebra, into the quantum logic, the symmetry [ is an automorphism of the quantum logic, and the probability state T is a morphism from the quantum logic to the unit interval [0, 11. The composition n o a is a (perhaps only finitely additive) probability measure on the Boolean algebra. The symmetry [ acts on the quantum logic, and induces an action on observables via a I+ Soa (Heisenberg picture) and an action on states via n H not (Schrodinger picture). If the Boolean algebra is a a-field of sets, the quantum logic is a a-effect algebra, and both a and n are a-morphisms, then n o a is a Kolmogorovian probability measure. 8 CLASSIFICATION OF EFFECT ALGEBRAS In Section 7, we defined the notion of a a-effect algebra and observed that both the sharp and unsharp prototypes, P(fj) and IE(fj), are a-effect algebras. In this section we set forth a number of additional conditions that an effect algebra E might or
232
David J. Foulis and Richard J. Greechie
might not satisfy, and indicate whether or not the prototypes P(4) and lE(4) satisfy these conditions. Here we only sketch some of the basic ideas. For a deeper and more systematic account, see [ ~ a l l aChiara et al., 20041 and [ ~ v u r e ~ e n s k i j and Pulmannovb, 20001. Standing Assumption: Henceforth we assume that (E, 0, u, L , ,a) ~ is an effect algebra.
We write the infimum (greatest lower bound) of elements e and f in E, if it exists, as e AE f . Likewise, the supremum (least upper bound) of e and f in E, if it exists, is written as e V E f . If we write an equation e AE f = d (respectively, e V E f = d) with d, e, f E E, we mean that e AE f (respectively, e V E f ) exists and equals d. DEFINITION 22. The effect algebra E is said to be lattice ordered if, as a partially ordered set, it is a lattice, i.e., i£E e AE f and e V E f exist for all e, f E E. We say that E is distributive (respectively, modular) iff it is lattice ordered and, as a lattice, it is distributive (respectively, modular). If every subset of E has an infimum and a supremum, then E is complete as a lattice. Clearly, every complete lattice-ordered effect algebra is a a-effect algebra. A Boolean effect algebra (Example 16) is lattice ordered and distributive, and the real unit interval [O,1] (Example 20) is lattice ordered, distributive, and complete. The sharp quantum logic P(4) is lattice ordered and complete, it is modular iff 4 is finite dimensional, and it is distributive iff 4 has dimension 1 or 0. On the other hand, the unsharp quantum logic E(4) is never lattice ordered unless 4 is of dimension 1or 0. The structure of finite modular effect algebras has been worked out by S. Sykes in [sykes, 19971. DEFINITION 23. (i) Elements e, f E E are said to be complements (or complef3 every element mentary) iff e AE f = 0 and e V E f = u. (ii) E is complemented i e E E has at least one complement f E E. (iii) A mapping ': E + E is a complementation 8 e' is a complement of e for all e E E. (iv) The orthosupplementation mapping e ct eL is called an orthocomplementation iff it is a complementation mapping. If E is a Boolean effect algebra, then E is not only complemented, but each element e E E has a unique complement, namely e l . If an element in a distributive effect algebra has a complement, then it is unique; however a distributive effect algebra need not be complemented-for instance, in the real unit interval [O,l], only 0 and 1 have complements. The mapping P H P~ = 1- P is an orthocomplementation on the sharp quantum logic P(4); however, if the dimension of 4 is 2 or more, then every P E P($j), other than P = 0 and P = 1,has infinitely many complements. On the other hand, the unsharp quantum logic IE(4) fails to be complemented; however, if P E P(a), then P has a complement in IE(4); indeed, the orthocomplement pL= 1 - P of P in P(4) is also a complement of P in lE(4). DEFINITION 24. (i) Elements e, f E E are said to be disjoint iff e AE f = 0. (ii) An element s E E is said to be sharp iff s AE s'- = 0, i.e., iff s and s'- are
Quantum Logic and Partially Ordered Abelian Groups
233
disjoint. (ii) The effect algebra E is called an orthoalgebra (OA) iff every element in E is sharp. (iii) An element p E E is said to be princzpal iff for all e l f E E with e I f , the condition e, f 5 p implies that e @ f 5 p. (iv) The effect algebra E is called an orthomodular poset (OMP) iff every element in E is principal. (v) A lattice-ordered OMP is called an orthomodular lattice (OML) [Beran, 1985; Kalmbach, 19831. Let e l f E E with e I f . Then e @ f is an upper bound, but not necessarily the supremum of e and f in E. However, if E is an orthoalgebra, then e @ f is a minimal upper bound for e and f in E ; and if E is an OMP, then e @ f = e VE f . The effect algebra E is an orthoalgebra iff the orthosupplementation e H e l on E is an orthocomplementation. We can now be more precise about the meaning of "sharp" versus "unsharp." The effect algebra E, regarded as a quantum logic, is sharp iff every element in E is sharp, i.e., iff E is an orthoalgebra; otherwise it is unsharp. It is in this sense that P(3) is sharp and IE(4) is unsharp. In fact, IF'($) is a complete orthomodular lattice. If R E IE(fj), then by Theorem 10, R is sharp ($ R is principal ($ R E P(3)Every principal element in E is sharp; hence every OMP is an orthoalgebra and, by definition, every OML is an OMP. Every Boolean effect algebra is an OML. Thus if Boole, OML, O M P , OA, and E A represent the class of all Boolean algebras, orthomodular lattices, orthomodular posets, orthoalgebras, and effect algebras, respectively, we have Boole C OML
OMP
OA
EA.
For the basic theory of OML's and OMP's, see [Beran, 1985; Kalmbach, 19831; for OA's, see [Foulis et al., 19921. If E is an orthoalgebra, then for all el f E E , e If + eAEf = 0, i.e., orthogonal elements are disjoint; however the converse condition may fail. DEFINITION 25. (i) E is pseudo-Boolean iff, for all el f E El eAE f = 0 + e I f , i.e., iff disjoint elements in E are always orthogonal. (ii) An MV-algebra is a pseudeBoolean lattice-ordered effect algebra. Every MV-algebra is distributive, every Boolean effect algebra is an MV-algebra, and every pseudo-Boolean OMP is Boolean, but there are pseudo-Boolean orthoalgebras that are not Boolean. With a different but equivalent set of axioms, MValgebras were introduced by C.C. Chang [1957; 19581 to serve as semantic models for Lukasiewicz multi-valued logics. In [1965], D. Mundici used MV-algebras to classify AF C*-algebras, and there is now a substantial literature on MV-algebras. The proof that MV-algebras, as originally defined by Chang, are mathematically the same as pseudo-Boolean lattice-ordered effect algebras follows from the work of Chovanec and KGpka in [1997]. We note that both of the "quantum logics" at the bottom of the diagram in Figure 1 (Section 7), i.e., the Boolean algebra and the real unit interval, are MV-algebras, hence are actually "classical logics." The observables and states link these classical logics to the quantum logic.
234
David J. Foulis and Richard J. Greechie
DEFINITION 26. The effect algebra E has the Riesz decomposition property ifF, whenever a, b, c E E, b I c, and a 5 b @ c, there exist bl, cl E E such that bl 5 b, cl 5 c and a = bl @ c1.I0 An effect algebra with the Riesz decomposition property is called an RD-algebra.
e en nett
An MV-algebra is the same thing as a lattice-ordered RD-algebra and Foulis, 1995, Theorem 3.111. A Boolean effect algebra is the same thing as an RD-algebra that is also an orthoalgebra. If E satisfies the chain conditions (i.e., there are no properly ascending or descending infinite chains in E), then E is an RD-algebra iff E is an MV-algebra. DEFINITION 27. A subset S E of the effect algebra E is called a sub-effect algebra of E 8 (i) 0, u E S, (ii) s E S 3 s1 E S, and (iii) s @ t E S whenever s, t E S with s I t. A sub-effect algebra S of E is said to be normal 8,whenever d,e, f E E, d @ e @f isdefined, d @ e E S , a n d d @f ES,it follows that ~ E S . For instance, by Theorem 11, IF'($) is a normal subeffect algebra of IE($). If S is a sub-effect algebra of E, then S is an effect algebra in its own right with 0 and u as zero and unit, the restriction of I to S as the orthogonality relation, s o sL as the orthosupplementation, and the restriction to S of @ as the orthosummation. If E is a Boolean effect algebra and S is a normal sub-effect algebra of E, then S is again a Boolean effect algebra; however, in general, a subeffect algebra of a Boolean effect algebra need not be Boolean. An orthoalgebra is covered by sub-effect algebras each of which is Boolean; hence, as a quantum logic, every orthoalgebra is "locally classical." Similarly, by a theorem of RieEanovB [Rie~anovi,20001, a latticeordered effect algebra is covered by sub-effect algebras each of which is an MV-algebra. Thus, as a quantum classical," although the classical logic, a lattice-ordered effect algebra is LLlocally subalgebras might involve propositions with multiple truth values. DEFINITION 28. The center of E is the subset C of E consisting of all elements c E E such that both c and c1 are principal and, for each element e E E, there are orthogonal elements el, e2 E E such that e = el @ez with el 5 c, and e2 5 cL. If 0 and u are the only elements in C, then E is irreducible. The center C of E is a normal sub-effect algebra of E and, as such, it is a Boolean effect algebra [Foulis, to appear(a)]. If E is an orthoalgebra, then the center C of E is precisely the set of elements in E that have unique complements in E. If E is an MV-algebra, then the center C of E is precisely the set of elements in E that have complements in E . Elements in the center of the effect algebra E correspond to decompositions of E as a direct product in the category of all effect algebras [Greechie et al., 19951, hence E is irreducible ifF it cannot be factored nontrivially as a direct product of effect algebras. Both of the prototypes IF'($) and IE(fi) are irreducible. DEFINITION 29. A set A 2 E is coexistent iff it is contained in the range of an observable, i.e., 8 there is a Boolean effect algebra B and an effect-algebra ''since bl
5 b, cl 5 c, and b I c, it
is necessary that bl
Ic l .
Quantum Logic and Partially Ordered Abelian Groups
235
morphism a : B + E such that A c a ( B ) [Lahti et al., 19981 Clearly, a subset of a coexistent set is coexistent, and every Boolean sub-effect algebra B of E is coexistent. However, the Boolean sub-effect algebras of E do not necessarily cover E . For instance, in the prototype IE(B), the singleton set (41) is coexistent, but 4 1 does not belong to any Boolean sub-effect algebra of IE(4). However, if E is an orthoalgebra, then a subset A of E is coexistent iE there is a Boolean sub-effect algebra B of E with A c B, and of course this applies to the prototype P(4). LEMMA 30. If a, b E E , then a and b are coexistent (i.e., {a, b) is a coexistent set1') iff there are elements d, e, f E E such that d @ e @ f exists in E , a = d @ e, a n d b = d @f . Proof. If elements d, e, f E E exist satisfying the given conditions, let c := (d@e@f ) l and let B be the Boolean algebra of all subsets of {1,2,3,4). Then there is a uniquely determined effect-algebra morphism a : B + E such that a({l)) = d, ~ ( ( 2 ) )= e, a((3)) = f , and a({4)) = c, whence a({1,2)) = d @ e = a and a({l,3)) = d @ f = b, so {a, b) is contained in the range of the observable a. Conversely, suppose that B is a Boolean algebra, a: B + E is an effect-algebra morphism, and there are elements p,q E B such that a(p) = a and a(q) = b. Then, with d := a(p AB q), e := a(p AB q'), and f := a(pL AB q), we have d@e@f=a(pVBq)~E,d@e=a,andd@f=b.
As an immediate consequence of Lemma 30, if S is a normal sub-effect algebra of E and s,t E S, then s and t are coexistent in S 8 s and t are coexistent in E. Also, if a E E, then the singleton set {a) is coexistent since a = d @ e = d @ f with d := a, e := 0, and f :=0. A Boolean effect algebra is the same thing as an OMP in which every pair of elements is coexistent, and an MV-algebra is the same thing as a lattice-ordered effect algebra in which every pair of elements is coexistent1'. There are orthoalgebras in which every pair of elements is coexistent but which are not Boolean effect algebras. The unsharp quantum logic E(4) is convex in the sense that it is closed under the formation of convex combinations XA (1 - X)B for X E [O,1] C W and A, B E IE(4), but the sharp quantum logic P(4) is not. Convex effect algebras have been studied in [Beltrametti et al., 2000; Bugajski et al., 2000; Gudder et al., 1999; Lahti et al., 19981 and they admit a very satisfactory structure theory. There are always plenty of E-valued observables, but there are effect algebras, even finite OML's, that do not carry any probability states at all. Such "stateless" effect algebras may not be of much interest as quantum logics since they do not admit (non-contextual) probability models. In general, if an effect algebra E is
+
" ~ o t ethat we do not necessarily assume that a # b. 121n the literature, coexistent pairs a, b E E are sometimes called "compatible pairs", or "Mackey compatible pairs," but later we shall be using the word "compatible" in a different sense, so we shall avoid this terminology.
David J. Foulis and Richard J. Greechie
236
to be regarded as a bona jide quantum logic, it should admit a good supply of probability states. DEFINITION 31. Let A be a set of probability states on E . (i) We say that A is full, or order-determining, 8, for all el f E E, the condition ~ ( e 5 ) ~ ( f for ) all .rr E A implies that e 5 f . (ii) We say that A is a unital set of probability states ) 1. iff, whenever 0 # e E El there exists T E A such that ~ ( e = For both of the prototypes IF'($) and IE(Sj) the set Ik of all countably additive probability states w+ = wwp, determined by state vectors $Jin Sj is full. For the sharp quantum logic IF'($), Q is unital; but for the unsharp quantum logic IE(Sj), it is not. More generally, if an effect algebra E carries a unital set of probability states, it is an orthoalgebra. Every Boolean effect algebra B carries a full and unital set of probability states, but even if B is complete as a lattice, it might not admit any u-additive probability states at all. For example, the reduced Borel algebra, i.e., the Boolean algebra of all Borel subsets of [0, 11 W modulo the ideal of meager Borel subsets of [0, 11, is a complete Boolean effect algebra, but it has no countably additive probability states. (See [Horn and Tarski, 19481.) On the other hand, a a-field of subsets of a set X , regarded as a Boolean a-effect algebra as in Example 16, admits an order-determining set of a-additive probability states, namely the (0, 1)-valued "Dirac states" determined by the points x E X .
c
9 PARTIALLY ORDERED ABELIAN GROUPS With the prototype G(Sj) in mind, we recall that a partially ordered abelian group is an abelian group G equipped with a partial order relation 5 that is translation invariant in the sense that, for all g, h, k E G, g 5 h + g k 5 h k. If G is a partially ordered abelian group, then G+ := {g E G I 0 5 g), called the positive cone in G, has the properties (i) 0 E G+, (ii) g, h E G+ =$ g h E G+, and (iii) g, -g E G+ + g = 0. Conversely, if G is an (additively written) abelian group and Gf G has properties (i), (ii), and (iii), then there is one and only one way to organize G into a partially ordered abelian group with G+ as its positive cone, namely by defining g 5 h H h -g E G+ for all g, h E G. In this section, we review some basic facts about partially ordered abelian groups. Details can be found in [Goodearl, 1985, Chapter 11.
+
+
+
Standing Assumption: In this section, we assume that G is a partially ordered abelian group with positive cone G+.
DEFINITION 32. (i) If G+ generates G as a group, then G is said to be directed [~oodearl,1985, page 41. (ii) An element u E Gf is called an order unit13 iff, for every g E G, there is a 13sorne authors use the terminology "strong order unit."
Quantum Logic and Partially Ordered Abelian Groups
positive integer n such that g 5 nu [Goodearl, 1985, page 41. (iii) We say that G is archimedean [Goodearl, 1985, page 201 iff, whenever g, h E G and ng 5 h for all positive integers n, it follows that -g E G+. (iv) As in [~oodearl,1985, page 191, G is called unperforated iff, for all g E G and every positive integer n, 0 5 ng + 0 5 g. (v) The abelian group G is torsion free iff, for all g E G and every positive integer n, ng = 0 + g = 0. It is easy to see that a partially ordered abelian group G is directed iff G = {a - b I a, b E G+}; for instance, by (4), the Hermitian group G(4) is directed. Also, 1 is an order unit in G(4) and G(@) is archimedean, unperforated, and torsion free. If a partially ordered abelian group G has an order unit, then it is directed [Goodearl, 1985, page 41. If G is unperforated, then it is obviously torsion free. If G is directed and archimedean, then it is unperforated [Goodearl, 1985, Proposition 1.241, hence torsion free. Let A G. We understand that A is partially ordered by the induced partial order, i.e., the restriction to A of the partial order 5 on G. If a, b E A, then the infimum (greatest lower bound), if it exists, of a and b as calculated in A will be written as a AA b, and a similar convention applies to the supremum (least upper bound) a VA b, if it exists. Similarly, if ( U , ) , ~ I is a family of elements in A, then an existing infimum or supremum of the family as calculated in A will be written as AA{a, I L E I} or VA{aL I L E I), respectively. As the mapping g H -g on G is order reversing and of period two, there is a duality on G whereby properties of suprema are converted to properties of infima and vice versa.
c
DEFINITION 33. The subset A G is said to be lattice ordered 8 A is a lattice under the induced partial order, i.e., a AA b and a VA b exist for all a, b E A. If G itself is lattice ordered, it is called an (abelian) lattice-ordered group or, for short, an (abelian) e-group [Darnel, 19951. If G is an &group, then it is directed [Goodearl, 1985, Proposition 1.51 and unperforated [~oodearl,1985, Proposition 1.221, and therefore it is torsion free. DEFINITION 34. A subset A C G has the Riesz interpolation property iff, for all a, b,x, y E A with a,b 5 xiy (i.e., a 5 x, a 5 y, b 5 x, and b 5 y) there exists t E A such that a, b 5 t 5 x, y. If G itself has the Riesz interpolation property, it is called an (abelian) interpolation group [Goodearl, 1985, Chapter 21.
c
Let A G. If A is lattice ordered, then it obviously has the Riesz interpolation property (in Definition 34, just take t to be any element in A such that a VA b 5 t 5 x AA y). In particular, every abelian 1-group is an interpolation group. If A satisfies the chain conditions (i.e., there are no properly ascending or descending infinite chains in A), then A is lattice ordered i£E it has the Riesz interpolation property.
238
David J. Foulis and Richard J. Greechie
Unless the Hilbert space 4 has dimension 0 or 1, the Hermitian group G(9) is not an interpolation group, hence it is not an l-group; in fact, G(4) is an antilattice, i.e., two operators in G(4) have a supremum (or an infimum) in G(4j) iff one of the operators is less than or equal to the other14 [Kadison, 19511. However, even though G(4j) is not lattice ordered (unless the dimension of 4 is less than 2), the norm closure of the set of all real polynomials in a b e d Hermitian operator is a lattice-ordered subgroup of G(4), so G(4) is covered by subgroups that are lattice ordered. DEFINITION 35. The set A C G is said to be monotone a-complete15 iff every ascending (respectively, descending) sequence a1 5 a2 5 -.. (respectively, a1 2 a2 2 . . .) in A that is bounded above (respectively, below) in A has a supremum VA{ai I i = 1,2, ...} (respectively an infimum AA{& I i = 1,2, ...} in A. If G is an l-group, then G is monotone a-complete iff it is Dedekind a-complete, i.e., iff every countable subset with an upper (respectively lower) bound in G has a supremum (respectively, an infimum) in G [Goodearl, 1985, Lemma 16.71. The Hermitian group G(4j) is monotone a-complete, as is the unsharp quantum logic G(4). Of course, the sharp quantum logic P(4) is a complete lattice; IE(3) hence, a fortiori, it is monotone a-complete. If G and H are partially ordered abelian groups, and 8: G + H is a group homomorphism, then it is clear that the condition 8(Gf) H+ holds iff 8 is order preserving, i.e., for all a, b E G, a 5 b + 8(a) 5 8(b). Simple examples show that even if 8 : G + H is an order-preserving group isomorphism, 8-I : H 4 G need not be order preserving. If 8: G t H is a group isomorphism and both 8 and 8-I are order preserving, then 0 is called an isomorphism of partially ordered abelian groups. 10 UNIVERSAL GROUPS The sharp and unsharp prototypes P(4) and IE(4) are subsets of the Hermitian group G(4), and their structures as effect algebras are determined by the structure of G(4). With this in mind, we proceed to study relations between effect algebras and abelian groups-especially partially ordered abelian groups. We maintain our convention that E is an effect algebra with unit u. DEFINITION 36. If K is an abelian group, then a mapping 4 : E + K is called a K-valued measure on E iff 4(e @ f ) = d(e) 4(f) whenever e, f E E with e If .
+
For example, a probability state T : E 4 [O,l] C_ W is an W-valued measure on E . DEFINITION 37. A pair (8, 7) is called a universal group for the effect algebra E iff (i) 8 is an abelian group, (ii) 7:E 4 8 is a 8-valued measure, (iii) 7(E) 1 4 ~ o r generally, e in [Kadison, 19511 it is shown that the self-adjoint part of a von Neumann algebra A is an anti-lattice iff A is a factor. 15some authors refer to this condition a s "Dedekind monotone o-complete" to emphasize the boundedness requirement, but we prefer to follow the terminology in [Goodearl, 1985, page 2691.
Quantum Logic and Partially Ordered Abelian Groups
239
generates 6 as a group, and (iv) whenever 4 : E + K is a K-valued measure, there exists a group homomorphism 4 : 6 + K such that 4 o y = 4. Every effect algebra E has a universal group (6, y) which is uniquely determined by E up to an isomorphism [~oulisand Bennett, 1994, Theorem 9.2 and ff.]. In view of the uniqueness, we often refer to (6,y) as the universal group for E. Suppose that (6,y) is the universal group for E and let K be an abelian group. If 6: 6 + K is a group homomorphism, then 4 : E 4 K defined by 4 := 4 o 7 is a K-valued measure and, since y(E) generates 6, the group homomorphism is uniquely determined by 4. Consequently, there is a bijective correspondence 4 between K-valued measures 4 on E and group homomorphisms 4: 6 t K given by 4 = 6 o y. Thus, the universal group is a device for converting groupvalued measures into group homomorphisms.
4
4
G be a LEMMA 38. Let G be a partially ordered abelian group and let 4: E G-valued measure on E. Then the following conditions are mutually equivalent:
(ii) If d, e E E , then 4(d)
+ 4(e) I 4(u) +-d 1e.
(iii) If el, ..., en E E with ELl 4(ei) 5 4(u), it follows that el, ..., en is a jointly orthogonal sequence in E.
+
Proof. Assume (i) and suppose d, e E E with 4(d) 4(e) I 4(u), i.e., 4(d) I 4(u) - 4(e). As e @ e l = u and 4 is a G-valued measure, we have 4(e) 4(eL) = 4 ( ~ ) whence , 4(u) - 4(e) = d ~e(l ) , so 4(d) 5 4(eL), and it follows from (i) that 4(f). d e l , i.e., d Ie. Conversely, assume (ii) and suppose e, f E E with $(e) I B U ~4(f) = 4(u) - 4(fL), so @(e) 4(fL) 5 4(u), and it follows from (ii) that e I f l ,i.e., e 5 f . Therefore, (i) ++ (ii). That (ii) =+ (iii) follows from a straightforward induction on n, and that (iii) + (ii) is obvious.
<
+
+
If G is a partially ordered abelian group and v E G+, we define the v-interval G+[O,v] := {g E G I 0 g 5 v}. The proof of the following lemma is straightforward.
<
LEMMA 39. Let G be a partially ordered abelian group and let v E G+. Then the v-interval in G can be organized into an effect algebra (G+[O,v], 0, v, I,'-, @) as follows: for g, h E G+[O,v], gL := v - g, and g Ih iff g h 5 v, in which case g @ h := g h.
+
+
For instance, E(3) = G(Jj)+ [ O , l ] . Thus, as per the following definition, IE(3) is an "interval effect algebra." DEFINITION 40. If there is a partially ordered abelian group G and an element v E Gf such that E is isomorphic as an effect algebra to G+[O,v], we say that E is an interval effect algebra (IEA).
David J. Foulis and Richard J. Greechie
240
The proof of the following theorem is implicit in for clarity we make it explicit here.
[FOULS
and Bennett, 19941, but
) the universal group for E and define Bf to be the THEOREM 41. Let ( 9 , ~ be set of all elements of the form Cy=l 7(ei) where el, ea, ...,en is a finite sequence of (not necessarily distinct) elements in E. Then the following conditions are mutually equivalent: (i) E is an IEA. (ii) If el, ...,em E E , then CEl 7(ei) = 0 =$ ei = 0 for i = 1,2, ...,m; and if e, f E E, then 7(f) - ~ ( e E) B+ e If .
*
(iii)
is a directed partially ordered abelian group with B+ as its positive cone and 7: E --t Bf [0,~ ( u ) is ] an effect-algebra isomorphism.
B
Proof. (i) + (ii). Suppose (i) holds. Then, by Definition 40, there is a partially ordered abelian group G, an element v E G+, and an effect-algebra isomorphism 4: E -+ G+[O,u] C G. Evidently, 4 : E + G is a G-valued measure, whence there is a group homomorphism 4: B + G such that 4 = 4 o 7. Let el, ...,em E E with ELl 7(ei) = 0. Applying the group homomorphism 4 to the latter equation and using the fact that 4 = 407, we find that ELl 4(ei) = 0 in the effect algebra G+[O,u], and this implies that 4(el) = . . . = 4(e,) = 0. But 4 is an effect-algebra isomorphism, so el = . . - = em = 0. Now suppose e, f E E with 7(f) -7(e) E B+. Then there exist fl, ...,fn E E such that ?(f) - 7(e) = Cy=17(fi), and applying 4 to the latter equation, we obtain 4(f) - 4(e) = Cy=l 4(fi) E G+. Consequently, 4(e) 5 @(f), and since 4 is an effect-algebra isomorphism, it follows that e 5 f . (ii) + (iii). Suppose that (ii) holds. Obviously 0 = $0) E B+ and B+ is closed under addition. Suppose w, -w E B+. Then there exist el, ...,en, en+l, ...em E E with w = Cy=l 7(ei) and -w = CEn=,+, 7(ei), whence 0 = w (-w) = CEfl(ei), and it follows from (ii) that el = - - - = em = 0. Consequently 7(ei) = 0 for i = 1,2, ..., n, so w = 0. Therefore, B is a partially ordered abelian group with positive cone B+. As 7(E) generates 8, it follows that B is directed. Let w E 8+[0,7(u)]. Then w, 7(u) - w E G+, so there exist el, ..., en, ..., em in E with w = Cy=l -y(ei) and 7(u) - w = CLn+, ~ ( e i )whence , C:.l 7(ei) 5 7(ei) = w (7(u) - w) = 7(u). Consequently, by Lemma 38, el, ...,en is a jointly orthogonal sequence in E. Therefore, since 7 is a B-valued measure, we have w = 7(@y=1 ei), and it follows that 7: E --+ 8+[0,7(u)] is surjective. If e, f E E and 7(e) = 7(f), then e 5 f and f 5 e, so e = f , proving that 7 is injective. Therefore 7 : E -+ G+[O,7(u)]is a bijection. Now suppose e, f E E and 7(e) I7(f) in B+[0, ~ ( u ) ]Then . y(e) y (f) 5 7(u), whence e If by Lemma 38, so 7(e) + 7(f) = 7(e @ f), and it follows that 7-'(7(e) 7( f)) = e @ f . Therefore, 7 : E --t @[0, ~ ( u ) is ] an effect-algebra isomorphism. That (iii) =$ (i) is obvious.
+
ELl
+
+
+
Quantum Logic and Partially Ordered Abelian Groups
241
THEOREM 42. If E has a full (i.e., order-determining) set of probability states, then E is an IEA. Proof. Let ((i,7) be the universal group for E, and suppose that A is a full set of probability states for E . Thus, for each n E A, there is a group homomorphism ii: (i -t R such that T = 7i o y. It will be sufficient to establish condition (ii) in Theorem 41. Thus, let el, ...,em,e, f E E with ELl 7(ei) = 0 and y(f) - ~ ( e E) (i+.Then n(ei) = 7i(Cz1 y(ei)) = 0, and since each summand n(ei) is a nonnegative real number, it follows that n(ei) = 0 for i = 1,2, ...,m. Therefore, since A is full, ei = 0 for i = 1,2, ..., m. Also, there exist fl, ..., f, E E with 7(f) - ~ ( e = ) Cy=l 7(fi), and upon applying the group homomorphism ii to the latter equation, we obtain n(f) - n(e) = ELln(fi) 2 0. Therefore, n(e) 5 ~ ( f ) for all n E A, so e 5 f .
ELl
-
Suppose that E is an IEA with universal group ( 8 , ~ ) .Then by Theorem 41, 7 : E --t (i+[O,-y(u)]is an effect-algebra isomorphism, hence by identifying each , can assume that y : E (i is the inclusion e E E with y(e) E (i+[0,~ ( u ) ]we mapping16, u E (i, and E = (if [O, u], i.e., E is realized as the u-interval in its own universal group. With this identification in force, we say for short that (i is the universal group for E . If (i is the universal group for the IEA E, and if K is any abelian group, then there is a bijective correspondence q5 * 6 between K-valued measures q5 on E and'group homomorphisms 6: (i --t K , where q5 is the restriction of 4 to E . It turns out that G(4) is the universal group for IE(4)." Therefore, every probability state n : IE(5j) --t [O,1] C W can be extended (uniquely) to a group homomorphism 7i: G(4) --t W,which can be interpreted as an "expectation-value mapping" on bounded observables.18 By and Foulis, 1997, Corollary 2.51, every sub-effect algebra of an IEA is again an IEA. Therefore, since E(9) is an IEA, it follows that P(4) is an IEA, so it has its own universal group. As of the writing of this article, a perspicuous characterization of the universal group of P(4) is not known.lg
e en nett
11 ABSTRACTION FROM G(4)-UNITAL
GROUPS
In this section we formulate and study pairs E C G that generalize the pair IE(4) 5 G(4) consisting of the unsharp quantum logic E(4) and the partially ordered abelian group G(5) of bounded observables on 4. Later in Section 16, we complete the abstraction process by extracting from E a subset P that generalizes the sharp quantum logic P(5) of projection operators on 4. -
1 6 ~ h inclusion e mapping y: E r G is the mapping defined by y(e) := e for d l e E E. 17This follows from [Bennett and Foulis. 1997.' Corollarv " 4.71.. ''Note that the iimight not be a-additive. lgln [Harding et al., to appear], it is shown that the universal group of P(fj) is a divisible group.
242
David J.
Foulis and Richard J. Greechie
DEFINITION 43. Let G be a partially ordered abelian group with positive cone Gf = {g E G I 0 5 g} and let u E Gf. If every element in G+ is the sum of a finite sequence of (not necessarily distinct) elements of the u-interval G+[O,u], i.e., if Gf [0,U] generates G+ as a semigroup, we say that u is a generative element in G+ [Bennett and Foulis, 19971. By Theorem 13, 1is a generative element in the Hermitian group G(9). If E is an IEA with unit u and (B, 7) is the universal group of E, then by Theorem 41, ~ ( u is ) a generative element in 8. DEFINITION 44. A unital group is a directed partially ordered abelian group G equipped with a distinguished generative element u called the unit. The u-interval E := G+[0, u] G, organized into an interval effect algebra as in Lemma 39, is called the unit interval in G, and elements e E E are called effects in G. If a unital group G is the universal group for its own unit interval E, then G is called a unigroup [Foulis et al., 19981. If G is a unital group with unit u and unit interval E, then it is clear that u is an order unit in G. Also, E generates G+ as a semigroup and G+ generates G as a group, hence E generates G as a group. The unit interval E is monotone a-complete iff E is a a-effect algebra. Also, if G is monotone a-complete, then so is E, but in general, not conversely20. With ,1as the unit and IE(4) as the unit interval, the Hermitian group G(4) is a unigroup. More generally, if E is an IEA with unit u and B is the universal group for E, then B is a unigroup with unit u and unit interval E. Here is an example to show that not every unital group is a unigroup. EXAMPLE 45. Let G = Z, the additive group of integers, but organized into a partially ordered abelian group with the nonstandard positive cone Gf := {0,2,3,4, ...} obtained by removing 1 from the standard positive cone Z+ in Z. Then with unit u := 5, G is a (non-archimedean) unital group, and the unit interval E = {0,2,3,5} is a Boolean effect algebra. The only group homomorphisms G + R are of the form n H cn where c is a real constant. But, for any p E [O,1] 2 B,xp: E 4 R defined by %(O) := 0, 7rp(2) := p, 7rp(3) := 1 - p, 5 )1 is a probability state on E, and it can be extended to a group and ~ ~ ( := homomorphism G 4 R (if and) only if p = 115. Therefore, G is not a unigroup. Standing Assumption: Henceforth, we assume that G is a unital group with unit u # 0 and with unit interval E.
From the point of view of quantum logic, it may well be that the only reasonable generalizations of G(4) and its unit interval IE(4) are archimedean unigroups and their unit intervals. But, as we do not wish to rule out any potentially interesting quantum logics, we shall not necessarily assume that G is archimedean nor that it is a unigroup. Even if G is not a unigroup, it is a homomorphic image of a unigroup as per the following theorem. 20~owever, see Theorem 63.
Quantum Logic and Partially Ordered Abelian Groups
243
THEOREM 46. Let ( 8 , ~ )be the universal group for the unit interval E in G. Then B i s a unigroup with unit ~ ( u ) and , .if E is the unit interval in 9 , then 7 : E + E i s an effect-algebra isomorphism. Furthermore, there exists a n orderpreserving group homomorphism L: B + G of B onto G such that L(B+) = G+ and L(-y(e)) = e for all e E E. Proof. The effect algebra E is an IEA, hence by Theorem 41, B is a unigroup with , 7 is an effect-algebra isomorphism of E onto the unit interval E in B. unit ~ ( u )and The inclusion mapping L : E r G is a G-valued measure, hence it induces a group ) e. homomorphism L: B + G such that L = Lo y. Thus, e E E + ~(7(e))= ~ ( e = If p E B+, then p = Cy=l-y(ei) with ei E El so ~ ( p=) EL1ei E G+. Therefore L(B+) & G+. Conversely, if g E G+, there exist ei E E with g = ELl ei. But 7(ei) E B+ with L(P) = g, and it follows that E(B+) = G+. then p := Consequently, L: B + G is an order-preserving group homomorphism. If g E G, we can write g = a - b with a, b E G+. As G+ = r(Bf) there exist ) b = ~ ( y ) Hence . g = L(x - y ) , so 6: B 4 G maps B x, y E (B+) with a = ~ ( x and onto G. W
xy=l
EXAMPLE 47. In Example 45, the universal group for E = {0,2,3,5) is (Zx Z, 7 ) with coordinatewise addition and partial order on ZxZ, where 7(2) = (1, O), 7(3) = (0, I), and 7(5) = (1,l). Accordingly, the surjective group homomorphism
in Theorem 46 is given by ~ ( mn), = 2m
+ 3n for all (m, n) E Z x Z.
DEFINITION 48. If H and K are unital groups with units v and w, respectively, then a unital morphism 4: H + K is an order-preserving group homomorphism that is normalized in the sense that 4(v) = w. A unital isomorphism is a bijective unital morphism with an inverse that is also a unital morphism, and a unital symmetry of H is a unital automorphism of H , i.e., a unital isomorphism E : H + H. THEOREM 49. Suppose that H is a unigroup and L i s the unit interval in H . Then there i s a bijective correspondence a ++6 between effect-algebra morphisms a: L + E G and unital morphisms 6: H 4 G such that 6 i s an extension of
c
a.
c
Proof. Let v be the unit in H . If a: L 4 E G is an effect-algebra morphism, then a(v) = u, a(L) E 5 G+, and a: L + G is a G-valued measure. Since H is a unigroup, a can be extended (uniquely) to a group homomorphism 6: H 4 G, G+. As L generates H+ as a semigroup, it follows with d(v) = u and b(L) that b(H+) C G+, hence 6 : H + G is an order-preserving group homomorphism. Therefore, each effect-algebra morphism a: L + E extends uniquely to a unital morphism 6: H + G. Conversely, it is clear that the restriction to L of a unital morphism from H to G is an effect-algebra morphism from L to E. rn
c
c
244
David J. Foulis and Richard J. Greechie
With the usual total order and the standard positive cone B+ = {A2 1 X E B), the additive group R of real numbers is an archimedean unigroup with unit 1, and the unit interval B+[O,11is just the standard unit interval [0,11 C R. In the sequel, we always regard B as a unigroup in this way. DEFINITION 50. A state on G is a unital morphism w : G t R [Goodearl, 1985, page 601. The state space R(G) is the set of all states w on G, and is regarded as a subset of the locally convex real vector space BG of all real-valued functions on G with pointwise operations and the topology of pointwise convergence. A set of states A C R(G) is cone determining (or order detemining) i£E G+ = {g E G I 0 5 w(g) for all w E A). In the study of quantum logics and unital groups, the word "state" is used in a number of diierent (but related) senses, however the context usually makes it clear what is intended. We note that the restriction n := wlE to E of a state w E R(G) is a probability state on E, and if G is a unigroup 7r = wlE provides a bijection n H w between probability states on E and states on G. DEFINITION 51. If H and K are monotone a-complete unital groups, then a unital morphism 4: H t K is called a unital a-morphism iff it preserves the suprema of all bounded monotone ascending sequences2'. If the unital group G is monotone a-complete, then we say that a state w E R(G) is a a-state iff it is an unital q-morphism w : G t B. For the Hermitian group G(Jj), the expectation mappings WD corresponding to density operators D are a-states, and if the dimension of 4 is finite and greater than 2, then by Gleason's theorem [Dvure~enskij,19931, R(G(fi)) = {wD I D E ID($)). If 4 is infinite dimensional, there are always states on G(4) that are only finitely additive, and hence are not of the form w g . In any case, the set 9 of expectation mappings w+ = wp, corresponding to state vectors $ E 4 is cone determining for the unigroup G(4). For an arbitrary unital group G, the state space R(G) is a nonempty convex (and even a-convex) subset of BG [Goodearl, 1985, Corollary 4.4, Proposition 6.51 and is a compact Hausdorff space in the topology of pointwise convergence [~oodearl,1985, Proposition 6.21. The set of all extreme points of the convex set R(G), called the extreme boundary of R(G), is denoted by a,R(G). By the KreinMil'man theorem, R(G) is the closure of the convex hull of d,R(G). Evidently, R(G) is cone determining 8 it determines the partial order on G a subset A w(g) 5 w(h) for all w E R(G). See in the sense that, for all g, h E G, g 5 h [Goodearl, 1985, Theorem 4.141 for a proof of the following important result. THEOREM 52. The unital group G is archimedean ifl R(G) is cone determining. The following definition is suggested by Equation (1). DEFINITION 53. Define the order-unit pseudonorm 11 . 11 : G + B+ by llgll := inf{m/n I 0 5 m E Z, 0 < n E Z, and - mu 5 n g < m u ) for all g E G . If 211f q5 is a unital o-morphism, then by duality it presemes the infima of all bounded monotone descending sequences.
Quantum Logic and Partially Ordered Abelian Groups
245
11g11 = 0 + g = 0 for all g E G, then 11 . 11 is called the order-unit n o r m on G. If V is a real normed linear space and f : G + V is a group homomorphism, then f is bounded iff there exists P E W+ such that 11 f (g)ll P11g11 for every g E G, and if f is bounded, then 11 f 11 is defined to be the infimum of all such nonnegative real numbers p.
<
THEOREM 54. Let g, h E G and m E Z. Then: (i) llmgll = Iml 11g11. (ii) -h 5 9 5 h + 11g11 5 llhll- (iv) IIuII = 1. (4 119 hll 5 11g11 llhll, 11g11 = max{lw(g)l I w E R) (cf. Equation (2)). (vi) If G i s archimedean, then 11 11 i s a n o r m o n G. (vii) If G i s archimedean and 0 < n,m E Z,t h e n 11g11 mln -mu n g mu. (viii) If w : G + W i s a group homomorphism, then w E R(G) iff w is bounded and llwll = W ( U ) = 1.
+
+
<
<
<
Proof. See [~oodearl,1985, pp. 120-121 and 1231.
rn
If G is archimedean, then the order-unit norm 11 . 11 can be used to organize G into a metric space, the distance between g and h in G being given by llg - hll. With the resulting norm topology, G is an abelian topological group. The following example is of special interest in connection with the secalled algebraic approach to quantum theory [ ~ m c h19721. , EXAMPLE 55. Let A be a unital C * algebra and let G(A) be the real Banach algebra of all self-adjoint elements in A. Then, as an additive abelian group and with the unity element 1of A as the unit, G(A) is an archimedean unigroup with positive cone G(A)+ := {a2 I a E G(A)} = {bb* I b E A) and with unit interval E(A) := G(A)+ [0, 11. Furthermore, the order-unit norm on G(A) coincides with the restriction to G(A) of the C*-algebra norm on A. The set P(A) of all projections (self-adjoint idempotents) in A, which is a normal subeffect algebra of E(A), is precisely the set of all sharp elements in E(A). Thus, the triple P(A) C E (A) C G(A) generalizes the triple P(4j) C IE(4) C G(4j). The real Banach algebra G(A) in Example 55 is actually a Jordan algebra [TOP ping, 19651, and it is also an order-unit normed Banach space with 1 as the order unit [Alken, 1971, page 691. Moreover, the order-unit norm on G(A) coincides with the restriction to G(A) of the norm on the C*-algebra A. A condition even stronger than being a a-state, and that is especially important in the study of states w on the self-adjoint part G(A) of a C*-algebra A, is that w is normal in the sense that it preserves the suprema of ascending nets in G(A) adis is on and Rigrose, 1983, Chapter 71. 12 SEMISIMPLICIAL UNITAL GROUPS Hilbert-space-based quantum mechanics still harbors many mysteries, both philosophically and mathematically, and it can be useful to look at simple "toy" models that manifest some of the salient features of the prototypes P(4), IE(4), and 6(4j), but that are easier to contemplate and study. The Kochen-Specker spin-1 model
246
David J. Foulis and Richard J. Greechie
[Kochen and Specker, 19671, Gudder's pattern-recognition model [Gudder, 1998, Section 21, the €-model of Aerts [Aerts, 1999], Spekkens's toy model [ ~ ~ e k k e n s , 20041, Foulis's firefly box [Foulis, 19991, and the D-model of Gudder and Foulis [Foulis and Gudder, 20011 are some examples. Toy models often involve finite quantum logics, hence we devote this section to a very brief sketch of some of the theory of unital groups G with finite unit intervals E . For more details, see [Foulis, 2003a; Foulis, 2003b; Foulis and Greechie, 20041. Ordered in the usual way, the system Z of integers is an archimedean totally ordered additive abelian group with the standard positive cone Z+ = {0,1,2, ...), and as Z is totally ordered, it is an &group. Clearly, the order units in Z are the integers u E Z with 1 5 u. If 1 5 u E Z, then, as easily seen, the totally ordered abelian e-group Z is a unigroup with unit u, and the resulting unit interval is the (u 1)-element chain C, := {0,1,2, ...,u) with 0 < 1 < 2 < . . . < u. If n is a positive integer, then Zn denotes the n-fold cartesian product Z x Z x . . . x Z organized into an abelian group with coordinatewise addition. With the coordinatewise partial order, Zn is an abelian &group, called the standard simplicial group of rank n. Let Zn be the standard simplicial group of rank n. Then the positive cone in Zn is the n-fold cartesian product (Z+)n consisting of all vectors (zl, 22, ..., z,) E Zn such that 0 5 zi for i = 1,2, ...,n. The infimum and supremum of two vectors in Zn is given by the coordinatewise minimum and maximum of the vectors, respectively, and the order units in Zn are the vectors (u1,u2, ...,un) such that 1 5 ui for i = 1,2, ...,n. If (ul, u2, ...,u,) is an order unit in Zn, then, as is easily seen, Zn is a unigroup with (ul,u2, ..., u,) as unit, and its unit interval C is an MV-algebra. Clearly, the unit interval is a cartesian product of chains
+
with coordinatewise relations and operations. DEFINITION 56. Following [Goodearl, 1985, page 471, we define a simplicial group22to be a partially ordered abelian group H for which there exists an isomorphism 4: H t Zn of partially ordered abelian groups from H onto the standard simplicial group Zn of rank n. A simplicial unital group is a unital group that is also a simplicial group. Since a simplicial group is isomorphic as a partially ordered abelian group to an &group, it follows that every simplicial group is an e-group. By [Goodearl, 1985, Corollary 3.141, a partially ordered abelian group H # (0) is simplicial iff H is an interpolation group, there is an order unit in H, and there are no properly descending infinite chains in H+. If G is a simplicial unital group with unit u, then G is an l-unigroup (i.e., an &group that is also a unigroup) and the unit interval E in G is a finite MV-algebra. Conversely, it can be shown that every finite MV-algebra E is isomorphic as an effect algebra to the unit interval E in a 2 2 ~ n[Goodearl, 19851, the zero group {O) is also regarded as a simplicial group.
Quantum Logic and Partially Ordered Abelian Groups
247
simplicial unigroup G, and it follows that E is isomorphic to a finite product of finite chains. DEFINITION 57. The partially ordered abelian group H is called a semisimplicial group iff there is a positive integer n and a bijective order-preserving group home morphism 4 from H onto the standard simplicial group Zn. A semisimplicial unital group (respectively, a semisimplicial unigroup) is a unital group (respectively, a unigroup) that is also a semisimplicial group. Although the group homomorphism 4: G + Zn in Definition 57 is a bijection (hence a group isomorphism) that preserves order, it is not required that 4 is an isomorphism of partially ordered abelian groups-specifically, there is no requirement that 4-I : Zn t G also preserves order. In other words, although the image 4(G+) of the positive cone G+ under 4 is contained in the standard positive cone (Z+)" in Zn, #(G+) can be a proper subcone of (Zf)". The unital group G in Example 45 is semisimplicial; but it is not simplicial, it is not archimedean, it is not an interpolation group, and it is not a unigroup. By [Foulis and Greechie, 2004, Corollary 5.31 a semisimplicial group is simplicial iff it is a n interpolation group. Here is the fundamental theorem for unital groups with finite unit intervals. THEOREM 58. The unital group G G semisimplicial iff the unit interval E in G i s finite and G i s torsion free.
Proof. If E is finite and G is torsion free, then G is semisimplicial by [Foulis, 2003a, Lemma 3.31. Conversely, suppose G is semisimplicial. Then G is isomorphic as a group to the torsion-free abelian group Zn, so G is torsion free. Also, by [Foulis and Greechie, 2004, Lemma 1 (ii), Section 51, E is finite. rn To study a semisimplicial unital group G, it is convenient to use the group is* morphism 4: G -+ Zn in Definition 57 to identify each element g 6 G with the corresponding vector 4(g) = (gl,gz, ...,g,) E Zn. This identification provides a definite computational advantage in that elements of G are vectors g = (91, 92, ...,gn) with integer coordinates, elements of G+ have nonnegative integer coordinates (but not necessarily conversely!), and addition is performed coordinatewise. Furthermore, by [Foulis, 2003b, Theorem 5.11, we have the following criterion for G to be archimedean. THEOREM 59. Let n be a positive integer, let G = Zn as a n additive abelian (Z+)n. Then G i s archimedean iff there i s a n group, and suppose that G+ n x m matrix [bij] over Z such that G+ = {g E (ZS)n I 0 5 Cy=l bijgi for j = 1,2, ..., m}. To paraphrase Theorem 59, a semisimplicial unital group is archimedean i f fits positive cone is determined by a finite set of homogeneous linear inequalities over Z. A necessary and sufficient condition for a semisimplicial unital group to be a unigroup can be found in [Foulii, 2003b, Corollary 2.81.
David J. Foulis and Richard J. Greechie
248
We denote by 2 := {0,1) the tweelement Boolean algebra (or Boolean effect algebra). As is well-known, a finite Boolean algebra (or Boolean effect algebra) B is isomorphic to an n-fold cartesian product 2n, with coordinatewise relations and operations. The unigroup for 2" is the standard simplicia1group Zn with the unit (1, 1,..., 1). Figures that have come to be called Greechie diagrams are useful for specifying finite or tho algebra^.^^. Let E be a finite orthoalgebra with unit u and let A be the set of atoms (minimal nonzero elements) in E. Then the structure of E is determined by the maximal coexistent subsets of A. Furthermore, if al ,a2, ...,ak are distinct elements of A, then {al, as, ...,ak) is a maximal coexistent subset of A iff al, az, ..., ak are jointly orthogonal and a1 @ a2 @ - - . @ ak = u. In the Greechie diagram for E the atoms of E correspond to nodes lying on line segments (or, in more complicated situations, by smooth curves), and atoms lying on each line segment are understood to be maximal coexistent sets. For instance, Figure 2 shows the Greechie diagram for the 8-element Boolean algebra Z3 with three atoms labeled p, q, r .
Figure 2
C
Figure 3
Figure 3 is the Greechie diagram for an OML consisting of the 12 elements (0, a, b, c, d, e, aL, bL, cL, d l , e l , u), and having the structure of two copies of Z3 "glued" together on the zero, the unit, the atom c and the orthocomplement cL of c. This OML is isomorphic to the logic of testable propositions for the "firefly box" in [Foulis, 19991, it is an IEA, and it is the unit interval in the archimedean semisimplicial unigroup given in the following example. EXAMPLE 60: Let G := Z4 as an additive abelian group, and let G+ be the set of all vectors (x, y, z, w) with 0 5 x, y, z, w and x I y z. Then G is an archimedean semisimplicial unigroup with unit u = (1,1,1,1) and positive cone G+. The unit interval E in G is the 12-element OML with the Greechie diagram in Figure 3, where a = (1,1,0,0), b = (0,0,1,O), c = (0,0,0, I), d = (0,1,0,O), and e = (1,0,1,0).
+
23~irni1ar diagrams for more general finite effect algebras, showing the "multiplicities" of atoms, have been proposed, but haven't been widely used.
Quantum Logic and Partially Ordered Abelian Groups
13 INTERPOLATION UNIGROUPS AND THEIR UNIT INTERVALS The following theorem was proved by S. Pulmannovh in [Pulmannovh, 19991. We reproduce the proof here because it illustrates some important ideas and techniques. THEOREM 61. Let H be an interpolation group and let v be an order unit in H . Then, with v as the unit, H is a unigroup.
Proof. As H has an order unit, it is directed [~oodearl,1985, page 41. Let h E H+. As v is an order unit in H , there is a positive integer n such that h 5 nu, hence by [~oodearl,1985, Proposition 2.2 (b)], there exist ei E H+, with ei 5 v for i = 1,2, ...,n, such that h = Cy=l ei. Therefore, H is a unital group with unit v. To prove that H is a unigroup, suppose K is an abelian group and 4: H + [0,v] -r K is a K-valued measure. We are going to extend 4 to : H+ --t K by defining q5+(h) := Cy=l 4(ei) for h E H + , where h = Cy=l ei with ei E H+[O,v] for i = 1,2, ...,n, but we have to show that this definition is independent of the choice f j with f j E HSIO,v] for j = 1,2, ..., m, then by of the ei. If also h = CEl [Goodearl, 1985, Proposition 2.2 (c)], there exist zij E H+ for i = 1,2, ...,n and j = 1,2, ..., m such that ei = Cclzij for i = 1,2, ..., n and f j = Cy=l zij for j = 1,2, ...,m. Evidently, zij E H+[0,v] for all i,j, and since 4 is a K-valued measure, 4(zij) for i = 1,2, ...,n and 4(fj) = ELl 4(zij) for it follows that q5(ei) = Ccl j = 1,2, ..., m. Hence, ELl @(ei) = EL1 Cpl4(%ij) = CclCy=l 4(zij) = Cy=l 4(fj), so q5+ is well defined. Evidently, q5+ preserves addition on H+. We now extend q5+ to 4 : H + K by defining 4(h) := q5+(a) - 4+(b) for h E H , where h = a - b with a, b E H f . Since q5+ preserves addition, it follows that 4 is well defined and that 4: H -r K is a group homomorphism. Therefore, H is a rn unigroup. By Theorem 61, an interpolation group G with a specified order unit u is not only a unital group, but a unigroup, and we shall refer to such a G as an interpolation unigroup. We recall that an RD-algebra is an effect algebra with the Riesz decomposition property (Definition 26) and that every MV-algebra is an RD-algebra. The following fundamental theorem is due to K. Ravindran. THEOREM 62. If G is an interpolation unigroup, then the unit interval E in G is an RD-algebra. ~ o n v e r i e l ~every , RD-algebra is an IEA and is realized as the unit interval in an interpolation unigroup.
Proof. As a consequence of [Goodearl, 1985, Proposition 2.1 (a) and (b)], if G is an interpolation unigroup, then E is an RD-algebra. A proof of the converse can rn be found in [~avindran,19961. As the unigroup for an IEA is uniquely determined up to a unital isomorphism, Theorem 62 provides a categorical equivalence E tt G between RD-algebras E
250
David J. Foulis and Richard J. Greechie
and interpolation unigroups G. There are interpolation unigroups-even totally ordered unigroups-that are not archimedean, e.g., [F'oulis, 2004b, Example 4.11. THEOREM 63. Let G be an interpolation unigroup with unit interval E. Then: (i) If G is monotone a-complete, then G is archimedean. (ii) G is monotone a-complete iff E is a a-effectalgebra. Proof. See [~oodearl,1985, Proposition 16.9 and Theorem 16.101.
rn
As an MV-algebra is necessarily an RD-algebra, it follows from Theorem 62 that every MV-algebra E is an IEA and can be realized as the unit interval in an interpolation unigroup G. For the categorical equivalence E t, G between RD-algebras and interpolation unigroups, the question of just when E is an MValgebra is settled by the following celebrated theorem of D. Mundici [ ~ u n d i c i , 19651. THEOREM 64. If G is an t-group and u is an order unit in G , then G is an t-unigroup (i.e., a lattice-ordered unigroup ) with unit u and the unit interval E in G is an MV-algebra. Conversely, every MV-algebra is an IEA and is realized as the unit interval in an e-unigroup.
-
As a Boolean effect algebra is necessarily an MV-algebra, it follows from Mundici's theorem that every Boolean effect algebra E can be realized as the unit interval in an Gunigroup. For the categorical equivalence E G between RD-algebras and interpolation unigroups, N. Ritter [Ritter, 20001 has settled the question of just when E is a Boolean effect algebra. Ritter's theorem involves the notion of a minimal order unit in G, i.e., an order unit for which there is no strictly smaller order unit. We shall reproduce the proof of Ritter's theorem (Theorem 68 below) because it illustrates some important ideas and techniques. Before giving the statement and proof of Ritter's theorem, we shall need some preliminary definitions and a lemma involving the notion of a field B of subsets of a nonempty set X . Recall that, partially ordered by set inclusion c, a field B of subsets of X is a Boolean algebra, and hence can be organized into a Boolean @) as in Example 16. effect algebra (B, 0,X, 1,l, DEFINITION 65. If B is a field of subsets of the nonempty set X , we define Q(X, B, Z) to be the partially ordered abelian under pointwise addition and pointwise partial order, of all bounded functions g : X 4 Z such that g-l(n) E B for all n E Z.The constant function assigning the integer 1 to every element x E X is denoted by 1 E B(X, 23, Z). Since a function g E Q(X,B,Z) is bounded and integer-valued, it can take on only finitely many values. Thus, each function g E Q(X,23, Z) corresponds to a 24Actually, B ( X ,B,23) is a commutative ring with pointwise multiplication. See Example 82 below.
Quantum Logic and Partially Ordered Abelian Groups
251
partition of X into finitely many sets of the form g-l(n) E B as n runs through the integers in the range g(X) of g. LEMMA 66. Let B be a field of subsets of a nonempty set X . Then, with the constant function 1 as unit, B(X, B) is an archimedean l-unigroup and 1 is a minimal order unit in B(X, B, Z). The unit interval E(X, 17, Z) in B(X, B, Z) is the set of characteristic set functions XM of sets M E B, hence the Boolean effect algebra B is isomorphic to E(X, B, Z) under the mapping M I+ XM.
Proof. That B(X, B, Z) is a partially ordered abelian group is clear, as is the fact that B(X, B, Z) is archimedean. Since the functions in B(X, 17, Z) are bounded, 1 is an order unit in B(X, B, Z). Obviously, G(X, B, Z) is lattice ordered, the greatest lower bound and least upper bound of two functions g, h E B(X, B, Z) being given by the pointwise minimum and maximum, respectively, of g and h. Therefore, by Theorem 61, B(X, B, Z) is an l-unigroup with unit 1. For all x E X , an effect e E E(X, B, Z) satisfies 0 5 e(x) 5 1 with e(x) E Z; hence e(x) = 0 or e(x) = 1, and we have M := e-l(1) E B and e = XM. Conversely, it is clear that XM E E(X, B,Z) for all M E B. Evidently, M I+ XM is an effect-algebra isomorphism of B onto E(X, 23, Z). Finally, suppose e is an order unit in E(X, B, Z), e 5 1,but e # 1. Then e = XM f o r s o m e M ~ B w i t h M # X , s o N : = X \ M # 8 a n d ~ ~ ~ E ( X ,A Bs)e. = x M is an order unit, there is a positive integer n such that XN 5 n x ~ Choosing . x E N, we obtain the contradiction 1= xN(x) 5 nxM(x) = n .O = 0. H If B is a field of subsets of a nonempty set X , then by Lemma 66, Q(X, B, Z) is a Boolean unigroup as per the following definition. DEFINITION 67. A Boolean unigroup is an interpolation unigroup in which the unit is a minimal order unit. Ritter's theorem states that, in the correspondence E * G between RDalgebras E and interpolation unigroups G, the Boolean effect algebras correspond to Boolean unzgroups. More precisely, here is Ritter's theorem. THEOREM 68. Every Boolean eflect algebra is an IEA and is realized as the unit interval in an archimedean l-unigroup in which the unit is a minimal order unit. Conversely, if G is a Boolean unigroup, then G is an archimedean l-unigroup and the unit interval E in G is a Boolean effect algebra. Proof. Let B be a Booleiin effect algebra. By Stone's representation theorem [Stone, 19361, B is isomorphic as a Boolean algebra, hence as a Boolean effect algebra, to a field of subsets B of a nonempty set X . If we identify B with the characteristic set functions XM of sets M E B, then by Lemma 66 we obtain a realization of B as the unit interval E(X, B) in the archimedean l-unigroup B(X, B) for which 1is a minimal order unit. Conversely, suppose that G is an interpolation unigroup with unit interval E and that the unit u in G is a minimal order unit. Let e E E and let t E E with t 5 e,u-e. Thenu-e,e 5 u-t E E, andit follows that u = (u-e)+e 5 2(u-t).
David J. Foulis and Richard J. Greechie
252
If g E G, there is a positive integer n such that g 5 nu, whence g 5 (2n)(u - t), so u - t is an order unit in G. But 0 5 u - t 5 u, so u - t = u by the minimality of u, and we conclude that t = 0. Now suppose g E G and g 5 el u - e. As G is an interpolation group and 0 5 e, u - e, there exists t E G with 0, g 5 t 5 el u - e. By the argument given above, t = 0, so g 5 0, and it follows that eAc(u-e) = 0. Thus, every element of E is a so-called characteristic element of G [~oodearl,1985, page 1271, so by [Goodearl, 1985, Theorem 8.71, E is a Boolean effect algebra. Hence, by the first part of the theorem, the universal group G for E is an archimedean t-unigroup. rn In Figure 1, Section 7, denote the Boolean algebra by B, let the IEA E be the quantum logic, and suppose that E is the unit interval in the unital group G. By Theorem 68, the Boolean effect algebra B is realized as the unit interval in a Boolean unigroup H. The observable a: B -t E is a G-valued measure on B, hence it can be extended uniquely to a unital morphism f f . We replace the unit interval [O,1] in Figure 1 by its unigroup, the real numbers W,and we replace the probability state T by a state w E R(G). (If G is a unigroup, we can take w to be the unique extension 7i of T.) The symmetry 5 in Figure 1 is replaced by a unital symmetry on G. (If G is a unigroup, we can take q to be the unique extension of 5.) Thus, Figure 4 below is the counterpart at the level of unital groups for Figure 1 at the level of quantum logics. Figure 4
Symmetry
woff
State
If the Boolean algebra B is a-complete (e.g., if B is a a-field of sets), then by Theorem 63, the Boolean unigroup H is monotone a-complete. If also, the unital group G is monotone a-complete, d is a a-morphism, and w is a a-state, then w o d is a a-state, and its restriction to the Boolean a-algebra B is a countably additive probability measure.
Quantum Logic and Partially Ordered Abelian Groups
14 UNITAL GROUPS OF REAL-VALUED FUNCTIONS If X is a nonempty set, we understand that the function space WX consisting of all functions f : X + R is organized into a locally convex, archimedean, partially ordered, directed, and lattice-ordered real topological vector space with pointwise operations, pointwise partial order, and the topology of pointwise convergence. Thus, any additive subgroup F of IRX is an archimedean, unperforated, and torsion free partially ordered abelian group under the induced partial order. Conversely, by [Goodearl, 1985, Theorem 4.141, every archimedean unital group is isomorphic as a partially ordered abelian group to a subgroup F of RX for suitable choice of the set X . We denote the constant function that maps every x E X to the real number 1 simply by 1 E RX. Evidently, X is a finite set iff 1 is an order unit in WX. By dropping down to various subgroups F of RX consisting only of bounded functions and such that 1 E F, we obtain numerous examples of archimedean unperforated unital groups with 1 as the unit. Standard techniques for dropping down to suitable subgroups F C RX include the following: (1) equipping X with a topology and imposing continuity conditions on the functions in F; (2) equipping X with a convex (or linear) structure and choosing F to be a suitable set of a f h e (or linear) functionals on X ; (3) equipping X with a field or a a-field of subsets and imposing measure-theoretic conditions on the functions in F; and (4) imposing conditions on the ranges of the functions in F. We shall give some examples of these techniques, which of course may be applied in various combinations. If X is a topological space, then C(X, R) denotes the subgroup of WX consisting of the continuous functions f : X + R. The archimedean partially ordered abelian group C(X, R) is an [-groupz5, the infimum and supremum of continuous functions f , g E C(X, W) being given by the pointwise minimum and maximum, respectively, of f and g. EXAMPLE 69. Let X be a compact Hausdorff space. Then the functions f E C(X, R) are bounded, 1is an order unit in C(X, R), C(X, R) is an l-unigroup with unit 1, the unit interval E(X, W) in C(X,R) is an MV-algebraz6, and the subset P ( X , W) of E ( X , R) consisting of the sharp elements is a Boolean effect algebra, which in fact is the center of E(X, R). Again the triple P(X, W) C E(X, W) C C(X, R) is an analogue of the triple P(3) 5 IE(Ej) G(3) of prototypes. Let X be a compact Hausdorff space, and define M ~ ( x ) to be the set of all probability measures on X , i.e., the set of all nonnegative regular Bore1 measures p on X such that p(X) = 1. Then each p E M ~ ( x ) determines a state wp on the unigroup C(X, W) according to
lx r
wp(f) :=
f dp for all f E C(X, W),
25Actually, C(X, W) is a lattice-ordered commutative linear associative algebra over W, and if X is compact and Hausdorff, then C(X, W) is a commutative lattice-ordered real Banach algebra under the supremum norm. 26Actually, E(X, W) is a convez MV-algebra.
254
David J. Foulis and Richard J. Greechie
MT
and p H up is an affie isomorphism of onto R(C(X, W)). Thus, the state space of the archimedean l-unigroup C(X, W) may be identified with M: (X). (See [Goodearl, 1985, page 871.) Recall that a compact Hausdorff space X is extremally disconnected iff the closure of every open subset of X remains open, X is basically disconnected iff the closure of every open F, subset of X remains open, and X is totally disconnected iff the singleton subsets of X are the only nonempty connected subsets of X . We note that extremally disconnected
+ basically disconnected + totally disconnected.
In Example 69, if X is totally disconnected, then it is the Stone space of the Boolean algebra P ( X , W), and conversely, if B is a Boolean algebra and X is the Stone space of B, then B is isomorphic to P(X, W). THEOREM 70. Let X be a compact Hausdorff space. Then: (i) X is basically disconnected z f f C(X, W) i s monotone a-complete. (ii) If X is totally disconnected, then X is basically disconnected i f l P(X, W) i s a a-complete Boolean algebra. Proof. Part (i) follows from [Goodearl, 1985, Corollary 9.31. Part (ii) is a conse quence of the well-known fact that a Boolean algebra is a-complete iff its Stone rn space is basically disconnected.
As in Example 55, suppose that A is a unital C*-algebra and G(A) is the unigroup with unit 1 of self-adjoint elements in A. Then as a consequence of the Gelfand representation theorem [Kadison and Ringrose, 1983, Theorem 4.4.31, A is commutative iff there is a compact Hausdorff space X such that G(A) is isomorphic as a unital group to the archimedean l-unigroup C(X, W). Conversely, if G(A) is an Ggroup, then by a theorem of S. Sherman, A is commutative [Sherman, 19511. Thus, Example 69 is really the commutative (or, equivalently the l-group) version of Example 55. An AW*-algebra is a C*-algebra in which the right annihilator of every subset is a principal right ideal generated by a projection [Kaplansky, 19511,[Goodearl, 1985, page 3131. We omit the proof of the following theorem, which is obtained by combining known facts about AW*-algebras and the theory of representations of Boolean algebra. THEOREM 71. If X is a compact Hausdorff space, then the following conditions are mutually equivalent: (i) T h e commutative C*-algebra C(X, @) of continuous complex-valued functions o n X i s a n AW*-algebra. (ii) X is extremally disconnected.
Quantum Logic and Partially Ordered Abelian Groups
(iii) X is totally disconnected and P(X, W) is a complete Boolean algebra. If X is a convex subset of a real vector space, then a function f : X -t W is afine iff f(Xx+ (1 -X)y) = Xf(x) (1 -X)f(y) for all x , y E X and all real numbers X E [0, 11.
+
EXAMPLE 72. If X is a compact convex subset of a locally convex real vector space, then the set Aff(X) of all continuous affine functionals f : X + W is a linear subspace of C(X, W) with 1 E Aff(X), and thus Aff(X) acquires the structure of an archimedean unigroupZ7 with unit 1. However, unlike C(X, W), Aff(X) need not be lattice-ordered. The archimedean unigroup Aff(X) plays a crucial role in the study of interpe lation groups [Goodearl, 1985, Chapter 7 and ff.]. If G is an archimedean unital group, then G is embedded into Aff(Q(G)) under the evaluation mapping g I+ 6 given by i(w) := w(g) for all w E Q(G), and this embedding is the basis for the formulation of a faithful functional representation of monotone a-complete unital t-groups [Foulis and Pulmannovb, to appear, Section 61, [Goodearl, 1985, Chapter 91. For this functional representation, the notion of a g-tribe28, which was i n t r e duced by A. DvureEenskij in [Dvure~enskij,2000], provides a generalization of the LoornisSikorski theorem for a-complete Boolean algebras (see Example 74 and Theorem 75 below). DEFINITION 73. Let X be a nonempty set. A g-tribe on X is a subgroup T of WX such that: (i) Every function f E T is bounded. (ii) l E T . (iii) Whenever (fn)n=l,2,...is a sequence in T and there exists f E T with for a l l n = 1,2,..., then Vwx{fn I n = 1 , 2 ,...) E T.
fn
5f
EXAMPLE 74. Let T be a g-tribe on the nonempty set X . Then, with the partial order induced from WX, T is a monotone a-complete unital t-group with 1 as the unit. The unit interval ET in T is a monotone a-complete MV-algebra, and the set PTof sharp elements in I+ is a a-complete Boolean algebra. There is a a-field of subsets 231. of X such that PT is the set of characteristic set functions X M for M E &. Thus, the Boolean algebra PT is isomorphic to the a-field BT under X M tf M. Again we have an analogue PT C ET C_ T of our prototypic triple P(9) E(9) G(9). The following theorem [~vure~enskij, 2000], [DvureEenskij and Pulmannovti, 2000, Theorem 7.1.241, [Foulis and Pulmannovb, to appear, Theorem 6.7 and ff.],
c
c
27Actually, Aff(X) is a directed archimedean real vector space with order unit 1 and also a Banach space under the restriction of the supremum norm on C(X, W). 2 8 ~ h "g" e in "g-tribe" stands for "group."
256
David J. Foulis and Richard J. Greechie
can be regarded as a generalization of the Loomis-Sikorski representation theorem for a-complete Boolean algebras. THEOREM 75. Let G be a monotone a-complete unital t-group with unit u. Then there exists a g-tribe T on the set b,R(G) of extreme points of the state space R(G) and a surjective morphism of unital groups 7:T 4 G such that 7 preserves all existing countable suprema and injima. DEFINITION 76. Let B be a a-field of subsets of a nonempty set X . Define B(X, B, R) to be the partially ordered abelian group with pointwise partial order and addition of all bounded B-measurable functions f : X 4 W. A subset M of the set X determines and is determined by its characteristic set function XM, which takes the value 1 on M and 0 on X \ M. In [Zadeh, 19651, L. Zadeh introduced the notion of a fuzzy set, i.e., a function e: X t R such that 0 5 e(x) 5 1for all x E X , thus allowing for "grades of membership" of elements x ranging from e(x) = 1to e(x) = 0. Since then, a considerable literature on fuzzy sets has been developed and a number of connections with quantum logic have been explored (e.g., see [~eltramettiet al., 2000; Foulis, to appear(b); Gudder, 19981). EXAMPLE 77. Let B be a a-field of subsets of the nonempty set X. Then, B(X, 17,W) is an archimedean t-unigroup with unit 1, the unit interval E(X, B, W) is a convex MV-algebra, and the set P(X, 17, W) of sharp elements in E(X, 17,W), which coincides with the center of E(X,B,W), consists of the characteristic set functions XM of measurable sets M E B. Thus P ( X , B, W) is a Boolean a-effect algebra isomorphic to 23. The functions e E E(X, 17,W) may be interpreted as fuzzy sets in the sense of Zadeh, whereas the functions XM E P ( X , B, W) correspond to the "sharp" sets M E B. Again we have a triple P(X, B, W) G E(X, B, W) C B(X, B, B) analogous to our prototypic triple P(fi) C IE(fi) C G(fi)". Suppose that X is the phase space of a classical mechanical system M and B is the a-field of Bore1 subsets of X. Phase points x E X may be identified with physical states of the system M , and (real) observables for M may be identified with Bmeasurable functions f : X 4 W. The idea is that the value of an observable f when M is in state x is f (x). Thus, functions f in the t-unigroup B(X, 17, W) of Example 77 represent bounded observables. If M E B, then the observable XM E P ( X , B, W) corresponds to the "sharp" proposition asserting that the state x of M belongs to the set M. Accordingly, observables e E E(X, B, R) are "fuzzy" or "unsharp" propositions concerning the state of M. In Example 77, B(X, 13, R) is actually an order-unit normed linear space over R, and the order-unit norm coincides with the supremum norm. Unlike the prototype G(fj), B(X, B, B) need not be a Banach space, however it can be completed to an order-unit Banach space G(X, B, R) by appending all uniform limits of sequences of functions in B(X, B, W). 2 g ~ note e that the Boolean unigroup and E(X,B, Z) = P(X, B, R).
g(X,B, Z) in Definition 65 is a subgroup of E(X,B, W)
Quantum Logic and Partially Ordered Abelian Groups
15 EFFECT-ORDERED RINGS In Example 55 not only do we have P(A) c E(A) C_ G(A), but G(A) is an additive subgroup of the C*-algebra A. In this section, we briefly explore the more general situation in which it is possible to realize a unital group G as an additive subgroup of a ring A that has some of the features of a C*-algebra. DEFINITION 78. An effect-ordered ring is a ring A with unit 1 such that: (1) Under addition, A forms a partially ordered abelian group30 with positive cone A+.
(3) The additive subgroup G(A) := A+ -A+ of A is a unital group with positive cone G(A)+ = A+ and unit 1. (4) For all a, b E A+,
(i) ab = ba + ab E A+, (iii) aba = 0 + ab = ba = 0, and
(ii) aba E A+, (iv) (a - b)' E A+
EXAMPLE 79. If A is a C *-algebra, then A is organized into an effect-ordered ring by defining A+ := {aa* I a E A), in which case G(A) in Definition 78 coincides with G(A) in Example 55. DEFINITION 80. Let A be an effect-ordered ring. We denote the unit interval in the unital group G(d) by
Also, we define P ( d ) := {p E G(A) I p = p2) and we refer to elements p E P(A) as projections. EXAMPLE 81. If X is a compact Hausdorff space, then A := C(X, R) is a commutative C *-algebra, and is organized into an effect-ordered ring as in Example 79. As such, we have G(A) = C(X, R), whence G(A) is an archimedean l-group, E(A) is a convex MV-algebra, and P ( d ) is the Boolean algebra of all characteristic set functions X M of compact open subsets of X . EXAMPLE 82. Let B be a field of subsets of a nonempty set X and let Q(X, B, Z) be the archimedean unital l-group in Definition 65. Then, under pointwise multiplication, A := Q(X, 23, 2 ) is a commutative effect-ordered ring with A+ := Q(X,B, Z)+ and G(A) = Q(X, B, Z). Also, E(A) = P(A) = Q(X,B, Z) is the Boolean algebra of all characteristic set functions X M of sets M E B. 3 0 ~ o t that e we do not assume that A is directed as a partially ordered additive group, nor do we assume that A+ is closed under multiplication.
David J. Foulis and Richard J. Greechie
258
EXAMPLE 83. Let 23 be a a-field of subsets of a nonempty set X and let g(X, 13,R) be the archimedean unital l-group in Example 77. Then, under pointwise multiplication A := Q(X,B,R) is a commutative effect-ordered ring with A+ := g(X, B, R)+ and G(A) = g(X, B, W). Also, E(A) = E(X, B, W) is the convex MValgebra of (perhaps) fuzzy &measurable subsets of X , and P(A) = P(X, B, R) is the set of sharp elements in E(A); indeed, P(A) is the Boolean a-algebra of all characteristic set functions X M of measurable sets M E 17. Standing Assumption: For t h e remainder of this section we assume t h a t A is a n effect-ordered ring. As a consequence of the following lemma, the effect-ordered ring A provides a generalization of our prototypic triple P(4) C E(4) C G(4). LEMMA 84. If p E P(A), then 1- p E P(A), and we have
Proof. Obviously, 0 , l E P(A). If p E P(A), then p = p2 and p E G(A), so there exist a, b E A+ such that p = a - b. Therefore, by Definition 78 (4, iv), p = P2 = (a - b)2 E A+ = G(A)+. As 1,p E G(A), we have 1- p E G(A) with (1-p)2 = 1- 2p+p2 = 1-p, whence 1- p E P(A) C G(A)+, and it follows that rn 0 5 p 5 1,i.e., p E E(A). In [Greechie et al., 1995, Definition 6.11 a weaker version of an effect-ordered ring A, called an effect ring, is defined in which it is not assumed that 1 is a generative order unit in G(A) and condition (4, iv) in Definition 78 is replaced by the weaker condition that, for all p E G(A)+, p = p2 =+ 1 -p E G(A)+. Therefore, the properties of an effect ring developed in [~reechieet al., 19951 hold as well for an effect-ordered ring A. LEMMA 85. Let e E E(A) and p, q E P(A). Then: (i) e S p * e = p e * e = e p * e = p e p . (ii) e 5 l - p * e p = O * p e = O ~ ~ e ~ = O . (iii) If a, b E G(A)f, then ab = 0 + ba = 0.
Proof. (i) By [Greechie et al., 1995, Theorem 6.6 (iii)], we have e 5 p % e = pe = ep e = pep. Suppose e = pe. Then (1 - p)e = 0, so (1 - p)e(l - p) = 0, and it follows from Definition 78 (4, iii) that e(1- p) = 0, i.e., e = ep. Therefore, e = pe + e = pe = ep + e 5 p, and similarly, e = ep =+ e 5 p. (ii) By (i), e 5 1-p* e = (1-p)e*pe = 0 , andsimilarly e 5 1 - p H ep = 0. If pe = 0, it is clear that pep = 0. Conversely, if pep = 0, then ep = pe = 0 by Definition 78 (4 iii).
*
Quantum Logic and Partially Ordered Abelian Groups
+
259
(iii) ab = 0 aba = 0 + ba = 0 by Definition 78 (4, iii). pq E E(A). Suppose e := pq E E(A). Then (iv) By Lemma 84, pq E P(A) pe = p2q = pq = e, so e = ep by (i), and e2 = epq = eq = pq2 = pq = e, whence pq = e E P(A). Therefore, pq E P ( d ) H pq E E(A). Now suppose pq E P(A), and again let e := pq. Then e = e2, e = pe, and e = eq, whence e2 = e = pe = ep = eq = qe and e 5 p, q by (i). Consequently, p - e, q - e E G(A)+ with (p - e)(q - e) = e - e - e e2 = 0, and it follows from (iii) that 0 = (q - e)(p - e) = qp - e - e e = qp - e, i.e., pq = e = qp. Conversely, if rn pq = qp, then (pql2 = pqpq = p2q2= PQ,so pq E P(A).
+
+
+
THEOREM 86. (i) P(A) is a normal sub-effect algebra of E(A). (ii) P(A) is an orthomodular poset (OMP) with p mentation.
I+
1- p as the orthocomple-
(iii) If p E E(A), then p E P(A) H p is sharp H p is principal. Proof. (i) By [Greechie et al., 1995, Theorem 6.6 (ii)], P(A) is a sub-effect algebra of P(A). To show that it is normal, suppose d, e, f E E(A) with d e f 5 1, p : = d + e ~P(A), a n d q : = d + f E P(A). Thend S d + e = p , s o d = p d b y Lemma85(i). Also,p+f = d + e + f 5 1 , s o f 5 1 - p ~ P ( A ) , w h e n c e p f = O
+ +
+
+
by Lemma 85 (ii). Consequently, pq = p(d f ) = d 0 = d E E(A), and it follows from Lemma 85 that d = pq E P(A). Part (ii) is [Greechie et al., 1995, Corollary 6.71, and part (iii) follows from [Greechie et al., 1995, Theorem 6.81. rn The following definition is motivated by Definition 3. DEFINITION 87. For each projection p E P(A), we define the compression mapping Jp: G(A) + A by Jp(g) := pgp for all g E G(A). LEMMA 88. If p E P(A), then: (i) J p : G(A) -t G(A) is an order-preserving group homomorphism. (ii) Jp(1) = p, (iii) If e E E(A), then e 5 p H Jp(e) = e. (iv) If e E E(A), then Jp( e ) = 0 H e Ip.
Proof. (i) Suppose p E P(A) and g E G(A). Then there exist a, b E A+ with g = a - b, and it follows that Jp(g) = pgp = pap - pbp. But, since p, a, b E A+, Definition 78 (4, ii) implies that pap,pbp E A+, whence Jp(g) E G(A). Therefore, Jp:G(A) + G(A), and it is obvious that Jp is a group homomorphism. Also, Definition 78 (4 ii) implies that Jp(G(A)+) G(A)+, so Jpis order preserving. Part (ii) is obvious, and parts (iii) and (iv) follow from Lemma 85 (i) and (ii).
rn
David J. Foulis and Richard J. Greechie
260
THEOREM 89. Suppose that the unital group G ( d ) is archimedean and let J : G ( d ) + G ( A ) be an order-preserving group homomorphism such that p := J ( l ) E E ( A ) and, for all e E E ( A ) , e 5 p + J ( e ) = e. Then p E P ( d ) and J = Jp.
.
Proof. See [Foulis, 2004a, Theorem 4.51. L E M M A 90. Let p, q, r E P ( A ) with p
+
+ + + + + +
+ q + r I1.
Then p
+ r , q + r E P ( d ) and
Proof. As p r 5 p q r 5 1, and P ( A ) is a sub-effect algebra o f E ( A ) , it follows that p r E P(A), and likewise q r E P ( A ) . Also, p 5 1 - r , so pr = r p = 0 b y Lemma 85 (ii). Likewise pq = qp = 0 and qr = rq = 0. Thus, ( p r )( q r ) = pq pr r q r2 = r , and similarly ( q r )(p r ) = r. Therefore, forallgEG(d), Jp+r(Jq+r(g))=(p+r)(q+r)g(q+r)(p+r)=rgr=Jr(g).
+
+
+
+
+
.
16 ABSTRACTION FROM P(4)-CB-GROUPS
We maintain our standing assumption that G is a unital group with unit u # 0 and unit interval E . Motivated b y Theorem 4 and the properties o f compression operators o n effect-ordered rings as per Section 15, we now begin a process o f abstraction from the prototype P ( 4 ) t o a sub-effect algebra P o f E . DEFINITION 91. A mapping J : G + G is a retraction o n G with focus p i f f J is an order-preserving group endomorphism, p := J ( u ) E E, and for all e E E , e 5 p + J ( e ) = e . B y definition, a compression o n G is a retraction J on G with focus p such that, for all e E E , J ( e ) = 0 +-e Ip. A retraction J o n G is direct i f f g ~ G + +J ( g ) 5 9 .
.
L E M M A 92. Every retraction J on G is idempotent, i.e., J = J o J , and its focus J ( u ) is a principal, hence a sharp element of E . Proof. See [Foulis, 2004a, Lemma 2.3 (i) and (iii)].
B y Theorem 4 and Theorem 9 (iv), every retraction J on our prototype G ( 4 ) i s a compression and has the form J = J p where P = J ( l ) E P(4j) is the focus of J . More generally, b y Theorem 89 and Lemma 88 ( i v ) , every retraction J on the unital group G ( A ) of an archimedean effect-ordered ring A is a compression and , has the form J = J p where p = J ( l ) E P(A). As a consequence o f [ ~ o u l i s2004a, Theorem 2.81, every direct retraction on the unital group G is a direct compression o n G . B y Theorem 12, the only direct compressions on the prototype G ( 4 ) are Jo and J1. O n the other hand, interpolation unigroups generally have a good supply o f direct compressions. THEOREM 93. If G is an interpolation unigroup, then every retraction J on G is a direct compression, its focus p := J ( u ) is a sharp element of E , and every sharp element of E is the focus of a uniquely determined direct compression on G .
Quantum Logic and Partially Ordered Abelian Groups
261
Proof. See [~oulis,2003c, Theorem 3.51 and [Foulis, 2004a, Theorem 2.91.
Let G be a unital group with unit u, let J be a retraction on G, and define J': G + G by J'(g) = g- J(g) for all g E G. Since J is idempotent, it follows that J: G + J(G) and J' : G -t J'(G) provide a representation of the abelian group G as a direct product of the subgroups J(G) and J'(G) in the category of abelian groups, but not necessarily in the category of partially ordered abelian groups. However, if J is a direct compression, then so is J ' ; moreover, J(G) and J'(G) are unital groups (with the partial order induced from G) with units J(u) and u- J(u), respectively, and J : G + J(G) and J ' : G 4 J'(G) provide a representation of G as the direct product of J(G) and J'(G) as unital groups. For details of the basic theory of retractions and compressions on unital groups, see [Foulis, 2003c; ?; Foulis, 2005; Foulis, to appear(a); Foulis, 2006; Foulis and Pulmannovb, to appear]. DEFINITION 94. By a compression base for the unital group G, we mean a family (Jp)pEPof compressions on G indexed by a normal sub-effect algebra P of E such that (i) if p E P, then p = Jp(u) is the focus of Jp and (ii) if p, q, r E P with p q r 5 u, then Jp+,. o Jq+,.= Jr. By a CB-group, we mean a unital for G. If G is a CBgroup G together with a specified compression base (Jp)pEP group with compression base (Jp)pEP,then elements p E P are called projections. A CB-group G is said to be proper i£E every direct compression belongs to its compression base. A total CB-group is a CB-group G such that every retraction on G is a compression and belongs to the compression base. as its compression base, the Hermitian group EXAMPLE 95. With (JP)pEp(4) G(4) is a total CB-group. I n the sequel, we always regard the Hermitian group G(4) as a total CB-group as per Example 95. Thus, a proper CB-group G with unit interval E and compression base (Jp)pEPprovides an abstraction P 5 E C G of the prototypic triple IF'(@) IE(4) C G(4). THEOREM 96. Let G be a CB-group with compression base (Jp)pEP. Then the normal sub-effect algebra P of E i s a n orthomodular poset (OMP) and, for all p E P and all g E G+, Jp(g) = 0 e Ju-,(g) = g. Moreover, P has the property that every finite set of pairvise coexistent elements in P i s contained in a Boolean sub-effect algebra of P.31
+ +
Proof. See [Foulis, to appear(a), Theorem 21 and [Foulis, 2005, Theorem 2.51.
DEFINITION 97. If G is a CB-group with unit interval E and compression base (Jp)pEP,then the triple P E 5 G consisting of the orthomodular poset P, the interval effect algebra E, and the CB-group G is called a CB-triple. If P C E 2 G is a CB-triple, and if E is regarded as a quantum logic, then elements p E P represent "sharp" propositions, and elements e E E \ P represent propositions that exhibit various degrees of "fuzziness." 31Thisproperty of an OMP is usually called regularity [Harding, 19981.
262
David J. Foulis and Richard J. Greechie
THEOREM 98. If A i s a n effect ordered ring, then, with (Jp)pEP(A)as a wmpression base, G(A) is a proper C B group. Moreover, if G(A) i s archimedean, t h e n G(A) is a total C B group With compression base (Jp)pEP(A). Proof. By Theorem 86 (i), P(A) is a normal sub-effect algebra of E(A), hence by Lemma 90, (Jp)pEP(A)is a compression base for G(A). Suppose that J is a direct compression on G(A), let p := J ( l ) be the focus of J, and let e E E(A). Then 0 5 e 5 1 implies that 0 5 J(e) 5 J ( l ) = p 5 1, whence J(e) E E(A) with J(e) 5 p. Therefore, J(e) = pJ(e)p by Lemma 85 (i). Also, since Jisdirect and0 5 e, 1-e, we have J(e) 5 e andp-J(e) = J(l-e) 5 1-e, so 0 5 e - J(e) 5 1- p 5 1, and it follows that e- J(e) E E(A) with e - J(e) 5 1-p. Therefore, p(e - J(e))p = 0 by Lemma 85 (ii). Consequently, for all e E E(A),
But E(A) generates G(A) as a group, and since both Jp and J are group horn* morphisms, it follows that J = Jp.Therefore, every direct compression on G(A) belongs t o the compression base (Jp)pEP(A),i.e., the compression base is proper. If G(A) is archimedean, then by Theorem 89, G(A) is a total CB-group. rn COROLLARY 99. Let A be a unital C*-algebra, let G(A) be the unigroup With unit 1 of self-adjoint elements in A, and let P(A) be the set of all self-adjoint idempotents (i.e., projections) in A (Example 55). For each p E P(A), define J P : G(A) -+ G(A) by Jp(g) := pgp for all g E G(A). T h e n G(A) i s a total CB-group with compression base (Jp)pEP. The following theorem shows that an arbitrary unital group G can be organized into a proper CB-group in at least one way. The proof, although straightforward, is a bit tedious, hence it is omitted. THEOREM 100. T h e unital group G can be organized i n t o a proper CB-group by taking the set (Jp)pEP of all direct compressions o n G, indexed by their oum foci, as the compression base (Jp)pEP.For the resulting CB-group, the OMP P of projections i s a normal Boolean sub-effect algebra of the center of the unit interval E in G, and if G i s a unigroup, then P i s the center of E. DEFINITION 101. A unital group G, organized into a proper CB-group as in Theorem 100 ii called a direct CB-group. EXAMPLE 102. If G is an interpolation unigroup organized into a direct CBgroup, then by Theorem 93, G is a total CB-group and P is the set of all sharp elements in E. THEOREM 103. If G i s a proper CB-group, then G i s a Boolean unigroup iff E = P. Proof. See [Foulis, 2003c, Theorem 6.51.
W
Quantum Logic and Partially Ordered Abelian Gmups
263
The class of unital groups is organized into a category with unital morphisms as the morphisms (Definition 48). Likewise, to organize the class of proper CB-groups into a category, we use CB-morphisms as per the following definition. DEFINITION 104. Let G and H be CB-groups with compression bases (J;)~E~ and (J:),~~, respectively. Then a CB-morphism from G to H is a unital morphism 4: G 4 H such that d ( P ) Q and 4 o J; = J;~) o 4 for all p E P. If 4 : G 4 H is a bijective CB-morphism such that 4-I : H 4 G is also a CBmorphism, then 4 is a CB-isomorphism from G to H. Two CBgroups G and H are isomorphic (as CB-groups) iff there is a CB-isomorphism 4: G 4 H. A CB-symmetry (or CB-automorphism) of G is a unital symmetry E: G 4 G that is also a CB-isomorphism. The condition that a unital morphism between CB-groups is a CB-morphism is quite strong. For instance, if the unital group in Figure 4 of Section 13 is a CBgroup, and if B and the Boolean unigroup in Figure 4 are organized into direct (and necessarily total) CB-groups as per Example 102, then, in general, neither fi nor w will be a CB-morphism. As a consequence of Theorem 6, for the Hermitian group G(4j) (organized into a total CB-group as in Example 95), every unital symmetry <: G(4j) 4 G(4j) is automatically a CB-symmetry. If G is a CB-group with compression base (Jp)pEPl and if E : G 4 G is a CB-symmetry of G, then the restriction of to P is an automorphism of the regular orthomodular poset P. Moreover, if p E P, then J<(,)= E 0 Jp0 [-I.
Standing Assumption: Henceforth, we assume that the unital group G with unit u # 0 and unit interval E is organized into a proper CB-group with compression base (Jp)pEP. The order-unit pseudonorm of g E G (Definition 53) is denoted by 11g11. LEMMA 105. Let p E P and g E G. Then: (i) 0 # p 11g11-
+ llpll = 1. (ii) llJp(g)ll 5
Proof. See [Foulis, 2004b1Theorem 3.3 (viii), (ix)]. DEFINITION 106. Let p E P and g E G. (i) C(p) := {g E G ( g = Jp(g) compatible with p. (ii) CPC(g) := r){C(p)
+ J,-,(g)).
If g E C(p), we say that g is
I p E P and g E C(p)).
If A is an effect-ordered ring organized into a CB-group as in Theorem 98, pg = gp. Therefore, then for p E P(A) and g E G(A), we have g E C(p) h E CPC(g) -eh commutes with every projection that commutes with g. In particular, if A is a von Neumann algebra (or more generally, an AW*-algebra), then h E CPC(g) i£E h double commutes with g, i.e., SF h commutes with every element in A that commutes with g.
David J. Foulii and Richard J. Greechie
264
LEMMA 107. If p E P and g E G , then C (p) and CPC(g) are subgroups of G and, if G i s archimedean, then both C(p) and CPC(g) are closed in the order-unit-norm topology.
rn
Proof. See [Foulis, 2004b, Corollary 3.21.
THEOREM 108. I f p , q E P, then the following conditions are mutually equivalent: (i) Jpo Jq= Jqo Jp. (ii) Jp( q ) = J q ( ~ ) (iii) . J, ( q ) 5 q. (iv) 3r E P, Jpo Jq= J, . (v) Jp(q) E P. (vi) q E C(p). (vii) p E C(q). (viii) p and q are coexistent in E. (ix) p and q are coexistent in P.
rn
Proof. See [Foulis, 2006, Theorem 2.71 and Lemma 30.
In view of Theorem 108, for p, q E P we usually write the condition p E C(q) in the form pCq. THEOREM 109. Let p E P. Then, with the partial order inherited from G , the subgroup C := C(p) = C(u - p) can be organized into a CB-group with unit u, unit interval E n C = { e + j I el f E Ele 5 p, f 5 u - p ) , and compression base ( J F ) , ~ ~ where, ~ ~ for , each q E P n C, is the restriction of Jq to C.
JF
rn
Proof. See [Foulis, 2006, Theorem 3.41.
As mentioned in Section 3, the process of "dropping down" to a closed linear subspace Dl of a Hilbert space 4j plays an important role in quantum mechanics. Every Hermitian operator B E G(9X) has a canonical extension to a Hermitian operator E G(4) such that E(9JlL) = (0). Moreover, if P E P(4j) is the projection onto Dl, then the mapping B w is a unital isomorphism of G(Dl) onto the image Jp(G(4j)) of G(4) under the compression Jp. Thus, abstracting from the prototype to the CB-group G , i f p E P, we regard the passage from G to Jp(G) as a generalization of the process of dropping down to a closed linear subspace of a Hilbert space. THEOREM 110. Let p E P and let H := Jp(G) be the image of G under the compression Jp. Then H i s a subgroup of G , H C(p), and with the partial order inherited from G , H can be organized into a CB-group as follows: (i) The positive cone in H is H f = H
n G+.
(ii) The unit for H i s p, and the unit interval in H i s EH= E n H = { e E E e
5 PI.
(iii) The set of projections in H is PH= P n H = { q E P I q 5 p). (iv) The compression base for H is (Jy)qEpHwhere J : of Jqfor each q E pH.
is the restriction to H
Moreover, if h h H and q E pH,then h i s compatible with q in the CB-group H iff h i s compatible with q in G.
I
Quantum Logic and Partially Ordered Abelian Groups
265
Proof. See [~oulis,to appear(a), Theorem 41. In [~oulis,2006, Theorem 3.51 it is shown that, if p E P, then C(p) is a direct product of Jp(G) and Ju-p(G) in the category of CB-groups. DEFINITION 111. If g E G, we define
P' (g) := {P E P n c P c ( g ) 1 g E C(p) and Ju-,(g) 5 0 5 Jp(g)). If P* (g) is nonempty for every g E G, we say that the CB-group G has the general comparability property. A comparability group (respectively, a wmparability unigroup) is defined to be a CB-group (respectively, a CB-unigroup) with the general comparability property. A direct comparability group (respectively, a direct comparability unigroup) is a direct CB-group (respectively, direct CB-unigroup) with the general comparability property.
+
A projection p E P & ( ~ )"splits" g = Jp(g) Ju-p(g) into a positive part J,(g) and a negative part Ju-p(g). If A is a von Neumann algebra (or more generally, an AW*-algebra), then G(A), organized into a CB-group as in Corollary 99, is a comparability group. Indeed, if g E G(A), then g has a polar decomposition g = lgls = s1g1 where lgl E G(A)+ n CPC(g), lgI2 = g2, s3 = s E G(A) n CPC(g), s2 E P(A), sg = gs = 191, and p := +(s s2) is the smallest projection in P* (g).
+
THEOREM 112. If G is a comparability group and p E P, then C(p) and Jp(G) are comparability groups.
Proof. See [Foulis, 2006, Theorem 4.71. THEOREM 113. If G is a direct comparability group then G is an l-group.
Proof. See [~oulis,2003c, Theorem 4.91. If G is an interpolation unigroup, organized into a total direct CB-group as in Example 102, then G has the general comparability property iff it has the property of the same name studied in [Goodearl, 1985, Chapter 81. THEOREM 114. Let G be an interpolation unigroup organized into a direct CBgroup. If G is a comparability group, then G is an l-unigroup. On the other hand, if G is a monotone a-complete l-unigroup, then G is a comparability
Proof. See Theorem 113 and [~oodearl,1985, Theorem 9.91. Every Boolean unigroup is a comparability group. Also, if L3 is a a-field of subsets of a nonempty set X , then the archimedean unital e-group Q(X,23, W) (Definition 76) is a comparability group. THEOREM 115. Let G be a comparability group. Then: (i) If p E E, then p E P H p is sharp H p is principal. (ii) G is unperforated and torsion fi-ee. (iii) G is archimedean i,f for all a, b E G+, nu 5 b for all positive integers n only if a = 0. (iv) If G is monotone a-complete, then G is archimedean. 32Also see Theorem 124 below.
266
David J. Foulis and Richard J. Grechie
Proof. For (i) and (iii), see [Foulis, 2005, Theorem 5.7, Lemma 3.51. For (ii), see [Foulis, 2003c, Lemma 4.81. For (iv), see [Foulis and Pulmannovi, to appear, rn Theorem 4.4 (iv)]
DEFINITION 116. Let G be a comparability group, let g E G, and choose p E P * ( ~ ) . By [Foulis, 2005, Theorem 3.21, Jp(g) and JUvp(g)are independent of the choice of p, so we can and do define 9' := Jp (g), g- := -Ju-,(g),
and Igl := g+ + g-
.
If A is a von Neumann algebra (or more generally an AW*-algebra), g E G(A), and g = lgls = 9191 is the polar decomposition of g, then g+ = +(Ig] g) and 9- = ;(I91 - 9). The properties of g+, g-, and Igl for elements g in a comparability group G are developed in [Foulis, 2005, Section 41. For instance, g = g+ - g- with 0 5 g+, g-, 191 E CPC(g), g+ AG+ g- = 0, and so on.
+
17 THE RICKART PROJECTION PROPERTY AND RC-GROUPS If T is a bounded linear operator on the Hilbert space Jj, define T' E IF'($) to be the projection onto the null space T-'(0) of T. Then, for every bounded linear operator S on fj, TS = 0 e~ S = T'S. In particular, if A E G(4) and P E P(Jj), then P 5 A' H P A = A P = P A P = 0; hence the CB-group G(Jj) has the Rickart projection property as per the following definition. DEFINITION 117. The CB-group G has the Rickart projection property 8 there is a mapping ': G -+ P, called the Rickart mapping, such that, for all g E G and all p E P, p 5 g' % Jp(g) = 0 and g E C(p). A Rickart C*-algebra [Goodearl, 1985, page 3121 is a C*-algebra A such that, for every a E A, there is a projection a ' E P(A) such that the right annihilating ideal {b E A I ab = 0) of a is the principal right ideal a'A of A generated by a'. For instance, every AW*-algebra, hence every von Neumann algebra, is a Rickart C*-algebra. If A is a Rickart C*-algebra, then P(A) is an orthomodular lattice (OML). An AW*-algebra is the same thing as a Rickart C*-algebra for which P(A) is a complete OML. EXAMPLE 118. If A is a Rickart C *-algebra and a E A, then a*a E G(A) and a ' = (a*a)', hence the mapping ': A -+ P(A) is determined by its restriction to G(A). Moreover, with this restriction as the Rickart mapping, G(A) has the Rickart projection property. LEMMA 119. The CB-group G has the Rickart projection property zfl there is a mapping # : G -+ P such that, for all g E G and all p E P, g# 5 p % Jp(g) = g. Moreover, if # is such a mapping, then the corresponding Rickart mapping is given by g' = u - g# for all g E G.
Quantum Logic and Partially Ordered Abelian Groups
267
Proof. Suppose G has the Rickart projection property and define # : G + P by g # : = u - g l f o r a l l g E G . L e t g ~ G a n d p ~ Theng# P. ~ ~ H u ~ C(p) and JU-,(g) = 0 g = Jp(g) J,-p(g) and J,-p(g) = 0. Therefore, g# 5 p =j Jp(g) = g. Conversely, suppose Jp(g) = g. Then Ju-p(g) = Ju-p(Jp(g)) = 0, and it follows that g# 5 p. If # : G -t P satisfies g# 5 p H Jp(g) = g, then, by reversing the argument rn above, one sees that G has the Rickart projection property.
*
+
The properties of the Rickart mapping g I+ g ' in a CB-group G with the Rickart property are developed in [Foulis, 2005, Section 61. For instance, for all p E P, andaUgEG,gN:=(g1)'=u-g',p'=u-p,gN=O~g=O,gN'=g',and so on. Furthermore, we have the following. THEOREM 120. If the CB-group G has the Rickart projection property, then P is an orthomodular lattice and, for all p, q E P, p A q = Jp((Jp(ql))').
Proof. See [Foulis, 2005, Theorem 6.4 (ii)].
rn
DEFINITION 121. A comparability group with the Rickart projection property is called an RC-group. An RC-group that is also an l-group is called an RClgroup. An archimedean RC-group (respectively, RCl-group) is called an ARCgroup (respectively, an ARCl-group). An RC-unigroup (respectively, an ARCunigroup, an ARCl-unigroup) is an RC-group (respectively, an ARC-group, an ARC l-group) that is also a ~ n i g r o u p . ~ ~ THEOREM 122. If G is an RC-group with unit interval E, then G is an ARCgroup iff, the only e E E such that ne E E for every positive integer n is e = 0.
Proof. See [Foulis, to appear(b), Theorem 5.101
rn
THEOREM 123. If G is an archimedean comparability group and P satisfies the chain conditions (i. e., there are no properly ascending or descending infinite chains in P), then G is an ARC-group and, for each g E G, there exists a positive integer N such that g " 5 N lg 1.
Proof. See [Foulis, 2005, Theorem 6.61. THEOREM 124. If G is a monotone a-complete l-group, then G is an ARC&unigroup.
Proof. Assume the hypotheses. By Theorem 63, G is archimedean, and by [Foulis and Pulmannovb, t o appear, Theorem 4.6 (ii)], G is an RCl-group. Also every ¤ unital l-group is a unigroup by Theorem 61. THEOREM 125. Let X be a compact Hausdorfl space and organize C(X, R) into an archimedean l-unigroup as in Example 69. Then the following conditions are mutually equivalent: (i) X is basically disconnected. (ii) C(X,R) is monotone a-complete. (iii) C(X, W) is an ARCl-unigroup. 3 3 ~ h authors e do not know an example of an ARC-group that is not a unigroup.
~
~
268
David J. Foulis and Richard J. Greechie
Proof. See [F'oulis and Pulmannovh, to appear, Theorem 4.81. THEOREM 126. If G is a n RCgroup (respectively, a n ARC-group) and p E P, then both C(p) and Jp(G) are RC-groups (respectively, ARC-groups).
Proof. See [Foulis, 2006, Theorem 5.51. Suppose that E is regarded as a quantum logic and e E E. If 0 # p E P and p 5 e, then the (possibly) fuzzy proposition e has at least a sharp "part" p. If e has no nonzero sharp part in this sense, then we say that e is "blunt." This leads us to the following definition. DEFINITION 127. An element b E G+ is blunt iff the only projection p E P such that p 5 b is p = 0. LEMMA 128. Let G be a n RC-group and let b E G+. Then: (i) b is blunt iff ( ( u- b)+)' = 0. (ii) If b i s blunt, then b E E.
Proof. See [Foulis, to appear(b), Theorem 5.61.
W
In the following theorem, we obtain a canonical decomposition of elements in the positive cone of an RC-group into sharp and blunt elements. THEOREM 129. If G i s a n RC-group and 0 # g E G+, there is a uniquely determined finite descending sequence pl 2 pz 2 . . . 2 p, of projections and a b and uniquely determined blunt element b E E such that g = pl +pz . + p, g E C(pi). Moreover, pi E CPC(g) for i = 1,2, ...,n.
+
+
Proof. See [F'oulis, to appear(b), Theorem 5.8, Theorem 5.91. Recall that a Heyting algebra34 is a system (L, 5,0,1, A, V, 3)consisting of a bounded lattice (L, <,0,1, A, V) and a binary operation > on L called the Heyting implication connective such that, for all x, y, z E L, xAy 5 z e~ x (y > z) [F'oulis, 2000al. If the elements of the Heyting algebra L are regarded as propositions and y, z E L, then y > z is interpreted as a proposition in L asserting that y "implies" z. A Heyting effect algebra is a lattice-ordered effect algebra L equipped with a binary operation > such that (L, <,0,1, A, V, >) is a Heyting algebra and C(L) = {x 3 0 I X E L).
<
THEOREM 130. Every Heyting effect algebra is a n MV-algebra, hence i t is the unit interval in a n l-unigroup. If G i s a n l-unigroup, then the unit interval E in G i s a Heyting effect algebra iff G i s a n RCl-unigroup.
Proof. See[Foulis, to appear(c), Theorems 5.2 and 7.101. As is indicated by the theorems above and the examples that follow, many CBgroups G for which P and E are good candidates for sharp and unsharp quantum logics are actually ARC-unigroups. 34Also called a Bmuwer algebra or a Brouwer-Heyting algebra.
Quantum Logic and Partially Ordered Abelian Groups
269
EXAMPLE 131. If A is an AW *-algebra, then G(A) is an ARC-unigroup. If A is a commutative AW *-algebra, then G(A) is an ARC e-unigroup. As a special case of Example 131, the prototype G(5) is an ARC-unigroup. EXAMPLE 132. Every Boolean unigroup is an ARC e-unigroup. EXAMPLE 133. If B is a a-field of subsets of a nonempty set X , then g(X, B, R) in Definition 76 is a monotone a-complete ARC e-unigroup. 18 SPECTRAL THEORY IN AN ARC-GROUP The development in the section is motivated by the following example. EXAMPLE 134. Let 4 be a Hilbert space, let A E G(q), and let M I+ PMbe the bounded PV-measure corresponding to the bounded observable A (Definition 2). By definition, the spectral resolution for A is the family (PA)XER of projections given by PA:= P(-,,J] for X E R. It can be shown that, for all X E W,
PA= ((A - XI)')'. The spectral resolution for A has the following properties (i)-(v), which determine it uniquely. For all X,p E W: (i) p 5 X (4
A,,,
+-P,
5 PA.
PA= p,.
(iii) 3a,p E W, Pa = 0 and Pp = 1. (iv) APA= PAA. (v) If p Define
< X and Q := PA- P,,
then pQ 5 AQ 5 XQ.
L :=sup{p I P, = 0 ) and U :=inf{X I PA= 1).
Then properties (i)-(v) above imply that
where the integral is the limit in the sense of convergence in the uniform operator norm 11 . 11 of sums of Stieltjes type. Furthermore, the spectral bounds L and U satisfy L = sup{p I p 1 5 A}, U = inf{X I A 5 X I ) ,
David J. Foulis and Richard J. Greechie
270
is the spectral resolution for the bounded Suppose A E G(4) and is observable A. By property (ii) in Example 134, the spectral resolution "continuous from the right," but in general, it will fail to be "continuous from the left,", i.e., it is quite possible to have VA,,EW P,, < PA.In fact, if we define the "jump" at X E R by DA :=PA P,, A>pER
v
then Dx # 0 iff X is an eigenvalue of A. Furthermore, if X is an eigenvalue of A, then Dx is the projection onto the A-eigenspace of A. As usual, we denote by Q the ordered field of rational numbers. The subfamily is called the rational spectral resolution for A. By properties of (i) and (ii) in Example 134, for any p E B,we have
P,, =
A
PA,
P
DEFINITION 135. If g E G, then the spectral lower and upper bounds Lg and Ug, respectively, for g are defined by Lg := sup{m/n
I m, n E Z, 0 < n,
Ug := inf{m/n
I m, n E Z, 0 < n, and ng 5 mu}.
and
LEMMA 136. Let g E G . Then: (i)
-00
< Lg 5 Ug < 0 0 .
(ii) [Lg, Ug1 = {w(g) I w E
a).
(iii) llgll =max{lLgl, IUglIProof. See [Goodearl, 1985, Proposition 4.71.
and mu 5 ng}
Quantum Logic and Partially Ordered Abelian Groups
DEFINITION 137. Let g E G. If X E Q, choose m , n E Z with 0 A = m l n and define
271
such that
PA := ((ng - mu)+)' and dx := (ng - mu)'
By [Foulis, 2004b, Lemma 4.11, p~ and d~ are well defined. The family ( P A ) A € ~ is called the rational spectral resolution for g and ( d x ) ~ €is q called the family of rational eigenprojections for g. As is shown by the following theorem, the rational spectral resolution of g E G has properties analogous to properties (i)-(v) in Example 134. THEOREM 138. Let g E G and let g. Then, for all A, p E Q: (i) P I X * P ,
be the rational spectral resolution for
SPA.
( 4 A,
. andX>Ug+px=u.
(v) Suppose p < A, let q := p~ - p,, and choose an integer n np, nX E Z. Then npq I nJq(g) I nXq.
>0
such that
Proof. Parts (i),(iii),(iv), and (v) follow from parts (i),(iii),(v),(vi), and (viii) of [Foulis, 2004b, Theorem 4.11. Part (ii) follows from [Foulis, 2004b, Theorem 4.4 (i)]" . rn
Additional properties of the rational spectral resolution of g E G are assembled in the next theorem. THEOREM 139. Let g E G and let g. Then, for all A, p E Q:
be the rational spectral resolution for
(i) PA,d~ E P n CPC(g), g E C ( ~ A )and , pxCd~. (ii) p
< X e-d, 5 p, 5 (dA)'.
(iii) L g < p + O < p ,
andX
(iv) Lg = sup{p E Q I p, = 0) and Ug = inf{X E Q I px = u).
3 5 ~ [Foulis, y 2004b, Example 4.11, part (ii) of Theorem 138 depends on the assumption that G is archimedean.
David J. Foulis and Richard J. Greechie
272
Proof. Parts (i)-(v) follow from parts (i), (iv) ,(v),(vi),(vii), and (ix) of [Foulis, 2004b, Theorem 4.11, and part (vi) follows from [Foulis, 2004b, Theorem 4.4 (ii)].
rn
The following theorem is a generalized version of the fact that, if (Px)x€Ris the U spectral resolution for a Hermitian operator A, then A = JL-O X dPx. THEOREM 140. Let g E G and let ( p x ) be ~ ~ the~rational spectral resolution for g. Suppose that Ao, XI, ..., AN E Q with Xo < L, < XI < . - - < AN--, < Ug < AN and choose yi E Q with Xi-1 ?.i Xi for i = 1,2, ..., N. Define ui :=p ~ - ,p ~ , - ~ and AXi := Xi - Xi-, for i = 1,2, ...,N. Let E := max{AXi I i = 1,2, ...,N). Choose n > 0 such that nXj,nyi E Z for j = 0,1,2, ..., N and i = 1,2, ...,N. Then:
< <
(i)
zLlui =
(iii) If s :=
U.
EL,nAXiui, then N
(iv) IIng - Ci=1 nyiuill
-S
N
5 ng -
nyiui
I s.
< nc.
(v) If w E R, then Iw(g) -
EL, y i ~ ( ~ i<) l
E.
Proof. See [Foulis, 2004b, Theorem 4.21.
COROLLARY 141. Each g E G is uniquely determined by its oum rational spectral resolution. Proof. Suppose that g, h E G and that both g and h have the same rational Let . w E 51. By part (v) of Theorem 140, Iw(g) spectral resolution ( p x ) ~ € ~ w(h)l 2c, and since we can choose Xo,X1, ..., AN so that E is arbitrarily small, it follows that w(g) = w (h), whence w(h - g) = w(g - h) = 0 2 0. Since w E R is arbitrary and G is archimedean, Theorem 52 implies that h - g, g - h E G+, whence g = h.
<
be the spectral resolution for the bounded observable A E G(fi). Let As usual, if r E R, then by definition r belongs to the resolvent set of A iff there is an open interval I R such that r E I and PAis constant on I. Recall that the spectrum of A, in symbols spec(A), is the complement in R of the resolvent set of A. We now proceed to generalize these notions to the ARC-group G. is the rational spectral resolution of g, DEFINITION 142. If g E G and we say that a real number T E R belongs to the resolvent set of g i£F there is an open interval I C R with r E I such that A, p E Q tl I + px = pp. The spectrum of g, in symbols spec(g), is defined to be the complement in R of the resolvent set
273
Quantum Logic and Partially Ordered Abelian Groups
of g. Let (dx)xEq be the family of rational eigenprojections of g. If a E Q and d , # 0, we say that a is a rational eigenvalue of g. LEMMA 143. If g E G, then spec(g) is a closed nonempty subset of the closed interval [Lg,Ug] with Lg = inf spec(g) and Ug = supspec(g).
rn
Proof. See [Foulis, 2004b, Theorem 5.11.
Let g E G. By part (ii) of Theorem 139, if X,p E Q with X # p, then the eigenprojections dx and d , are orthogonal, corresponding to the fact that, in the prototype 6(4),eigenvectors for distinct eigenvalues are orthogonal. LEMMA 144. Let g E G, let a E Q , and suppose the a i s n o t a n accumulation W such that a E I and every point of spec(g) (i.e., there i s a n open interval I T E I with T # a belongs t o the resolvent set of g). T h e n a E spec(g) iff a i s a rational eigenvalue of g.
rn
Proof. See [Foulis, 2004b, Theorem 5.1 (ii)]. THEOREM 145. Let g E G. Then: (i) Every rational eigenvalue of g belongs t o spec(g). (ii) Every rational isolated point of spec(g) is a rational eigenvalue of g.
Proof. Part (i) follows from [Foulis, 2004b, Theorem 5.2 (i)] and part (ii) is a H direct consequence of Lemma 144. THEOREM 146. Let g E G and let (dx)xEq be the family of rational eigenprojections for g. Suppose that a l , a z , ..., a~ are distinct rational numbers and choose a positive integer n such that nai E Zfor i = 1,2, ...,N . For i = 1,2, ...,N , define ui := d,, . Then: (i) If spec(g) = {al,a z , ...,cYN},then ui and ng = naiui.
zzl
# 0 for i = 1,2, ...,N ,
zzl
(ii) ~f O # vi E P for i = 1,2, ...,N , vi = U , and ng = vi = ui for i = 1,2, ..., N and spec(g) = {al,a z , ...,a ~ ) .
Proof. See [Foulis, 2004b, Theorems 5.3 and 5.41.
N
N
Ui
= U,
n a i v i , then
rn
Of course, one would like to cancel the positive integer n from both sides of the inequalities and equations in part (v) of Theorem 138, parts (ii), (iii), and (iv) of Theorem 140, and parts (i) and (ii) of Theorem 146, but this is not feasible unless G is the additive group of a partially ordered rational vector space. However, as is shown in [Foulii, 2006, Section 71, the ARC-group G can always be embedded as a subgroup of the additive group of a partially ordered rational vector space
David J. Foulis and Richard J. Grmchie
274
D which is an additive ARC-group and for which the projections are the same as the projections in G. Thus, for g E G, the spectral resolution is the same whether calculated in G or in D, and in D the desired cancellations of n can be made. Although G and D have the same state space 0, the unit interval in G can be a proper subset of the unit interval in D. For details, see the cited reference. THEOREM 147. Let g E G. Then: (i) g E G+ H spec(g) C_ [O,m). (ii) g E E H spec(g) C_ [O, 11. (iii) g E P H spec(g) C {O,l).
rn
Proof. See [Foulis, 2004b, Theorem 5.51.
The next definition - is motivated by the following observations: Let A E G(4) and let 92 = A(5j) be the (norm) closure of the range of A. Then A" is the projection onto 92. Also: (i) As a bounded linear operator on 4, A has an inverse A-l 80 4 spec(A). (ii) A($) is (norm) dense in 4j 8A" = 1. (iii) The range A($) of A is (norm) closed iff the restriction Aim of A to 92 has an inverse (Alm)-l as a bounded linear operator on 92. DEFINITION 148. Let g E G. Then: (i) g is nonsingular iff 0 # spec(g). (ii) g is range dense 8g" = u. (iii) g is range closed iff either g = 0 (i.e., g" element of the RC-group Jg11(G) .
= 0)'or g
# 0 and g is a nonsingular
THEOREM 149. Ifg E G+, then the following conditions are mutually equivalent: (i) g is nonsingular. (ii) 0 < L,. (iii) 0 < w(g) for all w E 0. (iv) g is an order unit in G . (vi) There is a positive integer N such that u 5 Ng.
Proof. See [~oulis,2004b, Theorem 5.61. THEOREM 150. Let g E G. Then: (i) Ifg
# 0, then g is range dense in the RC-group J,tl(G).
Quantum Logic and Partially Ordered Abelian Groups
275
(ii) g is range closed zff3 3 E E with E > 0 such that both open intervals ( - ~ , 0 ) and (0, E) are contained in the resolvent set of g. (iii) g is nonsingular iff it is both range dense and range closed. (iv) If g E G+, then g is range closed iff there is a positive integer N such that gtt 5 Ng.
Proof. See [Foulis, 2004b, Theorem 5.71. LEMMA 151. Let (px)xEq be the rational spectral resolution for g E G, let q E P and let (qA)xEqbe the rational spectral resolution for q. Then: (i) g E C(q) H pxCq for all X E Q. (ii) If X E Q, then qx = 0 for X 1 5 A.
< 0,
qx = u - q for 0 5 X
< 1, and qx = u for
(iii) g E C(q) iff pxCq, for all A, p E Q.
Proof. Part (i) follows from [Foulis, 2004b, Theorem 4.31, Part (ii) follows from Theorem 146 (i) and Theorem 147 (iii), and part (iii) follows from parts (i) and (ii). With g := p E P, part (iii) of Lemma 151 ensures that the extended definition of compatibility in the following definition is consistent with the previously defined notion of compatibility for pairs of projections. and (qx)xEQbe the spectral DEFINITION 152. Let g, h E G and let resolutions of g and h, respectively. Then, by definition, g and h are compatible, in symbols gCh, iff pXCqPfor a11 A, p E Q. LEMMA 153. Let g, h, k E G, let (rx)xEqbe the rational spectral resolution for k, and let p E P. Then : (i) gCh H hCg. (ii) g E C(p)H gCp. (iii) gCk + gCrx for all X E Q. (iv) If gCk and hCk, then (g
+ h)Ck.
Proof. Part (i) is obvious, and part (ii) follows from Lemma 151 (iii) and Definition 152. (iii) Let (px)xEq be the rational spectral resolution for g. Then by Definition 152 and Lemma 151 (i), gCk H ppCrx, Vp, X E Q H g E C(rx), VX E Q; hence by (ii), gCk gCrx, VX E Q. (iv) Suppose gCk and hCk. Then, by (iii) and (ii), g, k E C(rx), VX E Q. For each X E Q, C(rx) is a subgroup of G; hence g + h E C(rx), VX E Q, and it follows from (ii) and (iii) that (g h)Ck.
+
+
276
David J. Foulis and Richard J. Greechie
By a standard theorem for Hermitian operators, if A, B E G($), then A and B are compatible in the sense of Definition 152 iff AB = BA. More generally, if A is an AW*-algebra and g, h E G(A), then gCh iff gh = hg in A. Let A be an AW*-algebra. Then every maximal commutative subset of G(A) has the form G(C) where C is a maximal commutative *-subalgebraof A. Moreover, if C is a maximal commutative *-subalgebra of A, then C is a commutative AW* algebra, G(C) is a subgroup of G(A), and G(C) is an ARC l-unigroup. Therefore, G(A) is covered by subgroups each of which is an ARC l-group. We now proceed to show that the same is true for every ARC-group G. DEFINITION 154. A C-block in G is a maximal set of pairwise compatible el& ments in G. By Zorn's lemma, every subset of G consisting of pairwise compatible elements can be extended to a C-block. In particular, every element g E G belongs to a (not necessarily unique) C-block, hence G is covered by its own C-blocks. THEOREM 155. If H i s a C-block in G, then H is a subgroup of G, and with the partial order inherited from G, H can be organized into a n A R E g r o u p as follows: (i) The positive cone i n H is H+ = H n G+. (ii) The unit for H i s u, and the unit interval in H i s EH = E
n H.
(iii) The set of projections i n H is PH = P n H .
(iv) The compression base for H is (J:)~~~, where :J of Jqfor each q E pH.
is the restriction to H
Also, PH i s a maximal Boolean sub-eflect algebra of the orthomodular lattice P and H i s a n ARCl-group. firtherrnore, if G i s monotone 0-complete, then so i s H , and the Boolean algebra PH i s a-complete. Conversely, if B i s a maximal Boolean sub-eflect algebra of P, there is a uniquely determined C-block H in G, namely H = r){C(b) I b E B ) , such that B = PH. Proof. See Theorem [Foulis and Pulmannovii, to appear, 5.101.
H
As a consequence of Theorem 155, every ARC-group is covered by subgroups each of which, is an ARCl-group. In other words, every ARC-group has the structure of a collection of ARCl-groups "pasted together" in a coherent manner. Thus, the ARCl-groups are the "building blocks" for ARC-groups. In [Foulis and Pulmannovii, to appear, Chapter 61, a functional representation is given for ARC l-groups (also see Theorem 75). 19 RETROSPECTIVE
The development in Sections 7-18 provides our rational for the following:
Quantum Logic and Partially Ordered Abelian Groups
277
Scholium. For the general study of quantum logics, we consider the notion of a C B - triple PCECG
where G is a proper CB-group with unit interval E and compression base ( J p ) p E p , t o be a n appropriate abstraction of the prototypic triple
Observables are unital morphisms from a Boolean unigroup into G, states are unital morphisms from G t o W,and symmetries are CB-automorphisms of G (Figure 4, Section 13). I n particular, since ARC-groups and ARC-unigroups admit a practical spectral theory and a resulting notion of compatibility that generalizes the commutativity condition for bounded observables o n 4, we regard ARC-groups and ARC-unigrioups, their unit intervals, and their projection lattices as especially promising candidates for generalizations of G ( f j ) , E ( f i ) , and IF'($), respectively. In this exposition we have paid scant attention to some topics, and outright omitted other topics that are of considerable relevance to contemporary quantum physics and to quantum logic. Some topics have been downplayed or suppressed simply to keep the exposition within reasonable bounds. Other topics were omitted because the appropriate ideas have not yet been suitably incorporated into the theory of CB-groups. In an effort to indicate promising directions for future research, we conclude this article with an annotated list of some of these downplayed or omitted topics along with a few pertinent references.
AMONGTHE TOPICS THAT WERE ONLY BRIEFLY MENTIONED AND THAT INVITE FURTHER STUDY ARE: T h e action of symmetry groups o n the CB-triple P c E C_ G [Foulis, 2000b; Foulis and Wilce, 20001. Because of the ubiquity of grouptheoretic methods in contemporary physics, the main thesis of this article, as per the Scholium above, is reenforced by the observation that one can formulate an auspicious mathematical basis for a theory of symmetries on CB-groups. (See Section 4 and Definition 104.) In [Foulis, 2000b; Foulis and Wilce, 2000], a start has been made on a comprehensive theory of symmetry groups acting on CB-groups. By combining a-observables with symmetries on CB-groups, the important idea of a system of covariance becomes available, and there appear to be good prospects for a generalization of Mackey's imprimitivity theorem [Mackey, 19931 in this context. Phase infrastructure. As we mentioned in Section 2, for the Hermitian group G ( J j ) , the underlying Hilbert space 4 carries phase information that is lost in the passage from normalized state vectors E 4 to the expectation measures w , ~on G ( 4 ) . For orthoalgebras and effect algebras, an analogous infrastructure is p r e vided by so-called test spaces and E-test spaces, respectively [ ~ a r n u met al., 2005, Sections 2 and 31. In the spirit of the present article, the test groups introduced in [Foulii et al., 19961 provide an appropriate infrastructure for unital groups, and
+
278
David J. Foulis and Richard J. Greechie
every unigroup is an image under an order-preserving group homomorphism of a lattice-ordered test group. Presumably, enrichment of test groups by operators analogous to projections on a Hilbert space should provide a suitable infrastructure for CB-groups, but this has yet to be studied. CB-groups for coupled systems. Suppose that S is a composite system with component systems Sl and S2. If G1 and Gz are the CB-groups for S1 and S2, respectively, how is the CB-group G for S related to GI and G2? In Hilbert-spacebased quantum physics, if fj, fjl, and fj2 are the Hilbert spaces for S, Sl, and S2, respectively, then f j is the Hilbert-space tensor product fjl I8 92, and there is a canonical bilinear mapping (A1, Az) I+ Al I8 A2 from G(fjl) x 6($j2) to G(fj). For arbitrary unital groups GI and G2, there is a notion of a tensor product of G1 and G2 [Foulis et al., 1994, Section 91, but, even for Hermitian groups G(fjl) and G(fj2), this tensor product is not the right thing.36 For Hermitian groups G($j), it is the infrastructure of the Hilbert spaces f j that enables the formulation of physically meaningful tensor products, and an analogous infrastructure for unital and CB-groups (see above) is probably required to obtain appropriate generalizations thereof. For an authoritative article addressing the problem of representing compound physical systems, especially in the context of quantum information and communication theory, see [ ~ a r n u met a l , 20051. The special case in which the unital group (or CB-group, or RC-group) is the additive group of an order-unit normed space U in separating order and norm duality with a base-normed space V. Any archimedean unital group G can be embedded into the additive group of an order-unit normed space U in duality with a base-normed space V having the state space O(G) as its cone base [cook and Foulii, 20041. In [ ~ u ~ a j set k ial., 20001 it is shown that every convex a-effect algebra can be realized as the unit interval in a Banach order-unit normed space U. There is an obvious connection between the theory of order-unit-normed and base-normed spaces U and V in spectral duality [Alfsen and Scultz, 19791 and the theory of RC-groups, but the precise relationship between the two theories needs to be worked out in detail. The functional representation of monotone a-complete ARCt-groups. This topic is especially significant owing to the fact that every monotone a-complete ARCgroup is covered by such subgroups [Goodearl, 1985, Corollary 16.151, [Foulis and Pulmannovb, to appear, Chapter 61. Dilation. The Naimark (or Nagy-Naimark) dilation theorem mentioned in Section 6 plays an important role in stochastic (or phase space) quantum mechanics [Schroeck, 1996, Chapter 21, and it is fairly clear how to formulate a more general notion of dilation in the context of CB-groups. However, this matter has not yet been studied seriously. 3 6 ~ enables t the representation of discontinuous and nonmeasurable R-valued bihomomorphisms, hence it is much too large.
Quantum Logic and Partially Ordered Abelian Groups
279
Jordan algebras The prototype G(4) is a Jordan algebra [~opping,19651 as well as an RC-group. Which RC-groups can be organized into Jordan algebras and how much of the theory of Jordan algebras of self-adjoint operators can be carried over to those that can be so organized? Wigner's theorem o n symmetry transformations. Wigner's theorem, which was used in the proof of Theorem 6, has an extremely interesting generalization, originally due to R. Wright [Wright, 1977a], which has largely escaped the attention of the quantum logic community.37 Wright's theorem could and should be studied further in an effort to better understand just what makes it work and possibly to obtain analogous results for more general CB-groups. Here is a statement of Wright's theorem. THEOREM 156. Let 4 and R be separable Hilbert spaces with dim($) > 2 and dim(@ > 0. Suppose that 4 : P(3) 4 P(R) is a a-eflect-algebra morphism. Then q5 can be extended uniquely to a linear Jordan isometry a: G(fj) t G(R). firthermore, there exist orthogonal closed linear subspaces ?Dl and 'J1 of R such that R = ?Dl@'J1, there exist Hilbert spaces fil, 4 2 (possibly of dimension O), and there exists a unitary map Ul : 4 @ 4jl t ?Dl and a n anitunitary map U2 : 4 @ Sj2 4 '32 such that
+
+(A) = Ul(A @ 1 1 ) ~ ~ U2(A ' @ 12)uq1for all A E G(4). As a consequence of Wright's theorem, every cr-effect-algebra morphism q5: P(4j) 4 P(R) preserves arbitrary suprema and infima and has the following properties for all P , Q E P(.Fj): (i) P I Q e q5(P) Iq5(Q). (ii) P = Q @(P)= 4(Q). (iii) P Q = Q P H q5(P)q5(Q) = q5(Q)q5(P). That an arbitrary a-effect-algebra morphism should have these features is an extremely strong property of the projection lattices of Hermitian groups, and can hardly be expected to hold for a very large class of R C - g r o u p ~ . ~ ~
AMONG THE TOPICS
OF SIGNIFICANCE IN CONTEMPORARY PHYSICS OR QUANTUM LOGIC, AND THAT HAVE OBVIOUS CONNECTIONS WITH THE THEORY OF CBGROUPS, BUT WERE ENTIRELY OMITTED FROM THIS EXPOSITION, ARE:
Quantum information theory and quantum computation. [Barnum, 2002; Barnum et al., 20051 and [ ~ a l l Chiara a et al., 2004, Chapter 171. Causal logic of relativistic physics [Casini, 2002; Cegla and Jadczyk, 29791. Stochastic or phase-space quantum mechanics [Schroeck, 1994; Schroeck, 19961. The representation, logic, and statistics of sequential measurements [Foulis,2002; Gudder and Greechie, 20021. 37~owever,see [Beltrametti et ab., 2000, Section IV]. 3sIn his Ph.D. thesis [ ~ r i ~ h1977b], t, Wright was able to extend his theorem to the class of von Neumann algebras acting on separable Hilbert spaces and containing no direct summand of type Iz.
280
David J. Foulis and Richard J. Greechie
The consistent histories approach to quantum theory [GrifFiths, 19841. Topological effect algebras [Wice, 20051. The property (or attribute) lattice of a physical system [Aerts et al., 2000],[Foulis, 1999, Section 61.
BIBLIOGRAPHY [Aerts et al., 19781 Aerts, D. and Daubechies, I, Physical justification for using the tensor product t o describe two quantum systems as one joint system, Helvetica Physica Acta 51 (1978) 661-675. [Aerts, 19991 Aerts, D., Aerts, S., Durt, T. and L&v&ue, O., Classical and quantum probability in the e-model, International Journal of Theoretical Physics 38, No. 1 (1999) 407-429. [Aerts et al., 20001 Aerts, D. and Deses, D., State property systems and closure spaces: extracting the classical and nonclassical parts, Probing the structure of quantum mechanics (BTwsels, 2000), World Science Publishing, River Edge, NJ, 2002, 130-148. [Alfsen, 19711 Alfsen, E.M., Compact Convex Sets and Boundary Integrals, Springer-Verlag, New York, 1971. [Alfsen and Scultz, 19791 Alfsen, E.M. and Shultz, F.W., On noncommutative spectral theory and Jordan algebras, Proceedings of the London Mathematical Society 38, No. 3 (1979) 497516. [Barnum, 20021 Barnum, H., Quantum information processing and quantum logic: towards mutual illumination, arXiv.org:quant-ph/0205129vl (2002). [Barnum et al., 20051 Barnum, H., Fuchs, C.A., Renes, J.M., and Wilce, A., Influencsfree states on compound systems, arXiv.org:quant-ph/0507108 (2005). [Beltrametti and Cassinelli, 19811 Beltrametti, E.G. and Cassinelli, G., The Logic of Quantum Mechanics, Addison-Wesley Publishing Co., London (1981). [Beltrametti et al., 20001 Beltrametti, E. G., Bugajski, S., and Varadarajan, V. S., Extensions of convexity models, Journal of Mathematical Physics 41,No. 5 (2000)2500-2514. [Bennett and Foulis, 19951 Bennett, M.K. and Foulis, D.J., Phi-symmetric effect algebras, Foundations of Physics 25,No. 12 (1995) 1699-1722. [Bennett and Foulii, 19971 Bennett, M.K. and Foulis, D.J., Interval and scale effect algebras, Advances in Applied Mathematics 19 (1997)200-215. [Beran, 19851 Beran, L., Orthomodular Lattices, An Algebmic Approach, Mathematics and its Applications, Vol. 18,D. Reidel Publishing Company, Dordrecht, 1985. [Birkhoff and von Neumann, 19361 Birkhoff, G. and Neumann, J. von, The logic of quantum mechanics, Annals of Mathematics 3 7 (1936) 823-843. [Birkhoff, 19791 Birkhoff, G., Lattice theory, Corrected reprint of the 1967 third edition, American Mathematical Society Colloquium Publications 25, American Mathematical Society, Providence, R.I., 1979. [Bugajski et al., 20001 Bugajski, S., Gudder, S., and Pulmannovi, S., Convex effect algebras, state ordered effect algebras, and ordered linear spaces, Reports on Mathematical Physics 45. NO. 3 (2000)371-388. [Busch et al., 19911 Busch, P., Lahti, P.J. and Mittelstaedt, P., The Quantum Theory of Measurement, Lecture Notes in Physics, m2, Springer-Verlag,Berlin/Heidelberg/New York, 1991. [Casinelli et al., 19971 Casinelli, G., de Vito, E., Lahti, P., and Levrero, A., Symmetry groups in quantum mechanics and the theorem of Wigner on the symmetry transformations, Reviews in Modern Physics 8 (1997) 921-941. [Casini, 20021 Casini, H., The logic of causally closed spacetime subsets, ~ a s s i c a lQuantum Gmvity 19,No. 24, (2002)63894404. [cegia and Jadczyk, 29791 Cegfa, W. and Jadczyk, A. Z., States on causal logic, Letters in Mathematical Physics 3, No. 2 (1979) 109-112. [Chang, 19571 Chang, C.C., Algebraic analysis of many-valued logics, %nsactions of the Anaerican Mathematical Society 88 (1957)467-490. [Chang, 19581 Chang, C.C., A new proof of the completeness of Lukasiewicz axioms, Wansactwns of the American Mathematical Society 9 3 (1958) 74-80. ---
Quantum Logic and Partially Ordered Abelian Groups
281
[Chovanec and KBpka, 19971 Chovanec, F. and KBpka, F., Boolean D-posets, T a t m Mountains Mathenaatical Publications 1 0 (1997) 183-197. [Cook and Foulis, 2004) Cook, T.A. and Foulis, D.J., The base-normed space of a unital group, Mathematica Slovaca 54 No. 1 (2004) 69-85. [Dalla Chiara et al., 20041 Dalla Chiira, M.L., Giuntini, R., and Greechie, R.J., Reasoning i n Quantum T h w r y , Den& in Logic, Vol22, Kluwer, Dordrecht/Boston/London, 2004. [Darnel, 19951 Darnel, M.R., Theory of Lattice-Ordered Groups, Dekker, NY, 1995. [Davies and Lewis, 19701 Davies, E.B, and Lewis, J.T., An operational approach t o quantum probability, Communications i n Mathematical Physics 1 7 (1970) 239-260. [DvureEenskij, 19931 DvureEenskij, A., Gleason's Theorem and its Applications, Kluwer, Dordrecht/Boston/London, 1993. [Dvure~enskij,20001 DvureEenskij, A., Loomis-Sikorski theorem for u-complete MV-algebras and e-groups, Journal of the Awtmlian Mathentatid Society, Series A 68, No. 2 (2000) 261-277. [Dvure~enskijand Pulmannavi, 20001 Dvuretenskij, A. and Pulmannovi, S., New %rids in Quantum Structures, Kluwer Academic Publications, Dordrecht and Ister Science Bratislava, 2000. [Emch, 19721 Emch, G., Algebraic Methods i n Statistical Mechanics and Quantum Field T h w r y , Wiley-Interscience, 1972. [Foulis, 1999) Foulis, D.J., A half-century of quantum logic, what have we learned?, in Quantum Structures and the Nature of Reality, Einstein Meets Magritte: A n Interdisciplinary Reflection o n Science, Nature, Art, Human Action, and Society, Vol. 7, D. Aerts and J. Pykacz, eds., Kluwer Academic Publishers, Dordrecht, 1999. [Foulis, 2000aI Foulis, D.J., MV and Heyting effect algebras, Foundations of Physics 30, No. 10 (2000) 1687-1706. [~oulis, 2000bI Foulis, D.J., Representations on unigroups, in Cument Research i n Operational Quantum Logic, Fundamental Theories of Physics 111,Kluwer Academic Publishers, Dordrecht, 2000, 115-138. [Foulis, 20021 Foulis, D.J., Sequential probability models and transition probabilities, Atti del Senainario Matematiw e Fisico dell'universit di Modena 50, No. 1 (2002), 225-249. [Foulis, 2003al Foulis, D.J., Representation of a unital group having a finite unit interval, Demonstratio Mathenaatica 36, No. 4, (2003) 793-805. [Foulis, 2003bI Foulis, D.J., Archimedean unital groups with finite unit intervals, International Journal of Mathematics and Mathematical Sciences 2003, No. 44, (2003) 2787-2801. [Foulis, 2003~1Foulis, D.J., Compressible groups, Mathentatica Slovaca 53, No. 5 (2003) 433455. [Foulis, 2004a] Foulis, D.J., Compressions on partially ordered abelian groups, Proceedings of the American Mathematical Society 132 (2004) 3581-3587. [Foulis, 2004bl Foulis, D.J., Spectral resolution in a Rickart wmgroup, Reports o n Mathematical Physics 54, No. 2, (2004) 319340. [Foulis, 20051 Foulis, D.J., Compressible groups with general comparability, Mathematica Slovaca 55, No. 4 (2005) 409-429. [Foulis, t o appear(a)] Foulis, D.J., Compression bases in unital groups, to appear in International Journal of Theoretical Physics. [Foulis, 20061 Foulis, D.J., Comparability groups, Demonstmtio Mathematica 39, No. 1 (2006) 1532. [Foulis, t o appear(b)) Foulis, D.J., Sharp and fuzzy elements of an RC-group, t o appear in Mathematica Slovaca. [Foulis, t o appear(c)] Foulis, D.J., The universal group of a Heyting effect algebra, t o appear in Studia Logica. [Foulis and Bennett, 19941 Foulis, D.J. and Bennett, M.K., Effect algebras and unsharp quantum logics, Foundations of Physics 24, No. 10 (1994) 1331-1352. [Foulis and Greechie, 20041 Fouli, D.J. and Greechie, R.J., Semisimplicial unital groups, International Journal of Theoretical Physics 43, Issue 7-8, (2004) 1689-1704. [Foulis and Gudder, 20011 Foulis, D.J. and Gudder, S.P., Observables, calibration, and effect algebras, Foundations of Physics 31, No. 11, (2001) 1515-1544. [ ~ o u l iand s Pulmannovi, t o appear] Foulis, D.J. and Pulmannovi, Monotone a-complete RCgroups, t o appear in Proceedings of the London Mathentatical Society.
282
David J. Foulii and Richard J. Greechie
[Fodis and Wice, 20001 Foulis, D.J. and Wilce, A., Free extensions of group actions, induced representations, and the foundations of physics, in Current research in operational quantum logic, hndamental Theories of Physics 111,Kluwer Academic Publishers, Dordrecht, 2000, 139-165. [Foulis et al., 19961 Foulis, D. J., Bennett, M. K., and Greechie, R. J., Test groups and effect algebras, International Journal of Theoretical Physics 35, No. 6 (1996) 1117-1140. [Foulis et al., 19941 Foulis, D. J., Greechie, R. J., and Bennett, M. K., Sums and products of interval algebras, International Journal of Theoretical Physics 33, No. 11 (1994) 2119-2136. [Foulis et al., 19981 Foulis, D.J., Greechie, R.J., and Bennett, M.K., The transition to unigroups, International Journal of Theoretical Physics 37, No 1 (1998) 4543. [Foulis et al., 19921 Foulis, D.J., Greechie, R.J., and Riittimann, Filters and supports in orthoalgebras, International Journal of Theoretical Physics 31, No. 5 (1992)78g807. [Fuchs, 20021 Fuchs, C.A., Quantum mechanics as quantum information (and only a little more), arXiv.org:quant-ph/0205039vl (2002). [Greechie et al., 19951 Greechie, R.J., Foulis, D.J., and Pulmannova, S., The center of a n effect algebra, Order 1 2 (1995) 91-106. [ ~ o o d e a r l19851 , Goodearl, K.R., Partially Ordered Abelian Groups with Interpolation, A.M.S. Mathematical Surveys and Monographs, No. 20, American Mathematical Society, Providence, FtI, 1986. [Grmths, 19841 Griffiths, RB., Consistent histories and the interpretation of quantum mechanics, Journal of Statistical Physics 36, No. 1-2 (1984) 219-272. [Gudder, 19961 Gudder, S.P., Examples, problems, and results in effect algebras, International Journal of Theoretical Physics 36 (1996) 2365-2376. [Gudder, 19981 Gudder, S.P., Fuzzy probability theory, Demonstratio Mathematica 31, No. 1 (1998) 235-254. [Gudder and Greechie, 20021 Gudder, S.P. and Greechie, R.J., Sequential products on effect algebras, Reports on Mathematical Physics 49, No. 1 (2002)87-111. u udder et al., 19991 Gudder, S., Pulmannovi, S., Bugajski, S., and Beltrametti, E., Convex and linear effect almbras. R e ~ o r t son Mathematical Phvsics 44. No. 3 (1999) 359-379. [Halmos, 19501 ~ a l m o s p, a i l R , Measure Theory, D. v a n - ~ o s t r a i d~ o m i a n y , ' ~ n cNew . , York, N. Y., 1950. [ ~ a l m o s19981 ; Halmos, Paul R., Introduction to Hilbert space and the thwry of spectral multiplicity, Reprint of the second (1957)edition, AMS Chelsea Publishing, Providence, FtI, 1998. [Halmos, 19621 Halmos, Paul R., Algebraic logic, Chelsea Publishing Co., New York, 1962. [Halmos, 19631 Halmos, Paul R., Lectum on Boolean algebras, Van Nostrand Mathematical Studies, No. 1,D. Van Nostrand Co., Inc., Princeton, N.J., 1963. [Harding, 19981 Harding, J., Regularity in Quantum Logic, International Journal of Theoretical Physics 37 No. 4 (1998) 1173-1212. [Harding et al., t o appear] Harding, J., Jager, E., and Smith, D., Group-valued measures on the lattice of closed subspaces of a Hilbert space, t o appear in International Journal of Theoretical Physics. [Horn and Tarski, 19481 Horn, A. and Tarski, A., Measures in Boolean Algebras, Trawactiow of the American Mathematical Society 6 4 (1948) 467-497. [Kadison, 19511 Kadison, R.V., Order properties of bounded self-adjoint operators, Proceedings of the American Mathematical Society 2 (1951) 505-510. [Kadison and Ringrose, 19831 Kadison, R.V. and Ringrose, J.R., hndamentals of the Thwry of Operator Algebras, Vol. I, Elementary Theory; Vol. II, Advanced Theory Academic Press, New York, 1983/1986. [Kochen and Specker, 19671 Kochen, S. and Specker, E.P., The problem of hidden variables in quantum mechanics, Journal of Mathematics and Mechanics 17 (1967) 59-67. [Kalmbach, 19831 Kalmbach, G., Orthomodular Lattices, Academic Press, Inc., London/New York, 1983. [Kaplansky, 1951) Kaplansky, I., Projections in Banach algebras, Annals of Mathematics 5 3 (2), (1951) 235-249. [Lahti et al., 19981 Lahti, P., Pulmannovi, S., and Ylinen, K., Coexistent observables and effects in a convexity approach, Journal of Mathematical Physics 39, No. 12 (1998) 6364-6371. [Ludwig, 19831 Ludwig, G., Foundatiow of Quantum Mechanics, Volumes I and 11, Springer, NY,1983/85.
Quantum Logic and Partially Ordered Abelian Groups
283
[Mackey, 19931 Mackey, G.W., Axiomatics of particle interactions, Proceedings of the International Quantum Structures Association, Part I (Castiglioncello, 1992), International Journal of Theoretical Physics 32, No. 10 (1993) 1643-1659. [ M o l h r and Piles, 2001] M o l d r , L. and PBles, Z., I-order automorphisms of Hilbert space effect algebras: the two-dimensional case, Journal of Mathematical Physics 42 (2001) 19071912. [Mundici, 19651 Mundici, D., Interpretation of A F C*-algebras in Lukasiewicz sentential calculus, Journal of Functional Analysis 65 (1986) 15-63. [Mundici, 19991 Mundici, D., Tensor products and the Loomis-Sikorski theorem for MValgebras, Advances in Applied Mathematics 22 (1999) 227-248. [Pt& and Pulmannovi, 19911 P t i k , P. and Pulmannovi, S., Orthon~odularStructures as Quantum Logics, Kluwer, Dordrecht/Boston/London, 1991. [Pulmannavi, 19991 Pulmannovi, S., Effect algebras with the Riesz decomposition property and A F C*-algebras, Foundations of Physics 29, No. 9 (1999) 1389-1401. [Ravindran, 19961 Ravindran, K., On a Structure Theory of Effect Algebras, Ph.D. Thesis, Kansas State University; UMI Dissertation Services No. 9629062, Ann Arbor, MI, 1996. [RieEanovi, 20001 RieEanovi, Z., Generalization of blocks for D-lattices and lattice-ordered effect algebras, International Journal of Theoretical Physics 39, No. 2 (2000) 231-237. [Riesz and Nagy, 19551 Riesz, F. and Sz.-Nagy, B., finctional Analysis, Rederick Ungar Publishing Co., NY, 1955. [Ritter, 20001 Ritter, N., Order Unit Intervals in Unigroups, Ph.D. Thesis, University of Massachusetts, Department of Mathematics and Statistics, 2000. [Schroeck, 19941 Schroeck, F. E., Jr., Advantages of quantum mechanics on phase space; Proceedings of the International Quantum Structures Association, Part I11 (Castiglioncello, 1992) International Journal of Theoretical Physics 33, No. 1 (1994) 157-170. [Schroeck, 19961 Schroeck, F.E., Jr., Quantum Mechanics on Phase Space, Kluwer Academic Press, Dordrecht (1996). [Sherman, 19511 Sherman, S., Order in operator algebras, American Journal of Mathematics 73 (1951) 227-232. [Spekkens, 20041 Spekkens, R.W., In defense of the epistemic view of quantum states: a toy v l (2004) 1-32. theory, arXiv. 0r~:~uant-~h/0401052 [Stone, 19361 Stone, M.H., The theory of representations for a Boolean algebra, Tbansactions of the American Mathematical Society 40 (1936) 37-111. [sykes, 19971 Sykes, S.R., Finite modular effect algebras, Advances i n Applied Mathematics 19, No. 2 (1997) 24S250. [Topping, 19651 Topping, D.M., Jordan Algebras of Self-Adjoint Operators, Memoirs of the American Mathematical Society No. 53, American Mathematical Society, Providence, RI, 1965. [Wilce, 2005) Wilce, A., Compact orthoalgebras, Proceedings of the American Mathematical Society 133, No. 10 (2005) 2911-2920. [Wright, 1977a) Wright, R., The structure of projection-valued states: A generalization of Wigner's theorem, International Journal of Theoretical Physics 16, No. 8 (1977) 567-573. [Wright, 1977b) Wright, R., Projection-Valued States, Ph.D. Thesis, University of Massachusetts, Department of Mathematics and Statistics, 1977. [ ~ a d e h 19651 , Zadeh, L.A., Fuzzy sets, Information and Control 8 (1965) 338-353.
This page intentionally left blank
HANDBOOK OF QUANTUM LOGIC AND QUANTUM STRUCTURES: QUANTUM STRUCTURES Edited by K. Engesser, D. M. Gabbay and D. Lehmann O 2007 Elsevier B.V. All rights reserved
285
QUANTUM STRUCTURES AND OPERATOR ALGEBRAS Jan Hamhalter
1 INTRODUCTION AND PRELIMINARIES
In this chapter we summarize both classical and recent results concerning the extension of fundamental principles of measure theory to the projection logics of operator algebras. In standard measure theory, the basic concept is that of a measure on a a-field, A, of subsets of a set 0. A is a Boolean algebra with respect to the set theoretic operations and the corresponding set of A-measurable functions on S1 constitutes a commutative algebra with respect to the arithmetic operations. This concept, the core of Kolmogorovian probability theory, has proved to be extremely useful, and it plays an important role both in theoretical and In the light of quantum theory, classical measure theory needed modification and extension so as to be made suitable as a framework for quantum probability. As a consequence, noncommutative measure theory (also called quantum measure theory) evolved. It is based on operators (or matrices) rather than scalar measurable functions, and its foundations were laid by J. von Neumann, G. Birkhoff, F. Murray, P. Jordan, H. Stone and others during the first decades of the 20th century [von Neumann, 19551. In this new approach, the basic concept is that of a measure on the projection lattice, P , of a von Neumann algebra, or, equivalently, the lattice of closed subspaces of a Hilbert space. In the quantum context disjointness of sets is replaced by orthogonality of the corresponding subspaces. This makes noncommutative measure theory more geometric. In contrast to the situation in classical measure theory, the projection lattice P is not distributive with respect to the lattice operations and the algebra of bounded operators generated by P is not commutative in general. Noncommutativity of operators reflects the Heisenberg uncertainty relations. This is why J. von Neumann and G. Birkhoff proposed, in their celebrated paper [Birkhoff and von Neumann, 19361, the structue of a projection lattice of a von Neumann algebra as a proper model for a quantum propositional system, today also called a quantum logic (see also [Araki, 1999; Bratteli and Robinson, 1979; Emch, 1972; Haag, 1992; Jauch, 1968; Mackey, 1963; Peres, 1995; Piron, 1964; Redei, 1998; Varadarajan, 19681). Noncommutative measure theory and the theory of operator algebras then took a rapid development providing the basic mathematical structures of quantum theory. The fact that the lattice of projections of a Hilbert space is not distributive is crucial for quantum
286
Jan Hamhalter
measure theory. Therefore, in quantum measure theory the particular geometrical properties of a Hilbert space must come into play making it a particularly challenging mathematical discipline. Over many years numerous researchers have been attracted by the challenge of studying operator algebras from the perspective of noncommutative measure theory. Their efforts have proved highly useful both from the point of view of mathematics and physics. The main aim of this chapter is to show how the "golden rules" of measure theory and related parts of functional analysis (such as Lebesgue integration, the Vitali-Hahn-Saks theorem, the Radon-Nikodym theorem, the Nikodym boundedness theorem, compactness criteria, etc.) extend to operator algebras. Moreover, we will discuss applications of these results to quantum theory. There are many interesting results concerning measures on projection lattices and related topics. It is not possible to discuss all of them in this work. For other results we refer the interested reader to the monograph [Hamhalter, 20031. Our main intentions in this chapter is to deal with recent developments complementing the material presented in ma am halter, 20031. This chapter is organized as follows. In this section we give an introduction to the subject recalling basic concepts. In Section 2 we consider the problem of constructing a quantum integral, known as the the Mackey-Gleason problem. The central attention is devoted to the generalized Gleason theorem, which establishes a one-to-one correspondence between bounded vector-valued measures on the projection lattices and bounded linear operators on von Neumann algebras. This correspondence reduces to the usual relationship between a measure and its Lebesgue integral in the classical and scalar case. In Subsection 2.1 we discuss Gleason's theorem for the special case of the lattice of all closed subspaces of Hilbert space (projection lattice of Type I factor). We highlight the geometric ideas behiid the proof. One of the recent applications, the unentangled form of Gleason's theorem in quantum information theory, is discussed. Finally, we discuss Gleason's theorem for incomplete spaces in connection with completeness criteria for inner product spaces. This part shows that only complete inner product spaces (i.e. Hilbert spaces) allow for a "nonempty" probability theory. One of the motivations for Gleason's theorem was the p r o b lem of hidden variables in quantum theory, notably the question of the existence of dispersion free noncommutative measures. Gleason's description of measures excludes the existence of hidden variables on Hilbert spaces. In Subsection 2.2 we present a recent proof of the nonexistence of dispersion free state on the projection lattice of a von Neumann algebra having no nonzero abelian and no Type I2 central summand. The proof only uses some facts from the comparison theory of projections and Piron's geometric lemma, and it is much simpler than the proof of the generalized Gleason theorem. Based on this argument we present a strengthened form of the classical Kochen-Specker theorem on the nonexistence of a hidden space for von Neumann algebras by showing that there is no map from quantum observables (self-adjoint operators in a von Neumann algebra) to random variables on some probability space which would preserve natural trans-
Quantum Structures and Operator Algebras
287
formation rules. Moreover, the C*-form of the problem of hidden variables is discussed. The vector-valued generalization of Gleason's theorem, which is most important for applications, is dealt with in Subsection 2.3. In order to provide some insight, a simplified proof of this result is stated for Type I, finite von Neumann algebras which can be viewed as matrix algebras over Abelian von Neumann algebras. The arguments are based on the geometry of isoclinic projections. (For a full proof of the generalized Gleason theorem, which is highly nontrivial, we refer the reader to the original papers [Aarnes, 1969; Aarnes, 1970; Bunce and Wright, 1992a; Bunce and Wright, 1992b; Bunce and Wright, 1994; Christensen, 1982; Gunson, 1972; Maeda, 1990; Paszkiewicz, 1985; Yeadon, 1983; Yeadon, 19841 or to a self-contained presentation in [Hamhalter, 20031.) Moreover, Gleason's theorem for multimeasures, which play an important role in the quantum histories approach to quantum theory, is proved. In the concluding part of Section 2, Subsection 2.4, we consider Gleason's theorem for general quantum logics. We show that Gleason's theorem may be viewed as a Hahn-Banach theorem for quantum logics which allows one to extend any measure from the von Neumann projection lattice to any larger generalized orthomodular poset. In other words, projection lattices are perfectly compatible with all ordered structures that respect basic features of the quantum propositional system. It sheds light on the prominent role of the lattices of projections in quantum theory. Section 3, which is a central part of this exposition, is devoted to basic principles of noncommutative measure theory. We overview some of the "quantum reflections" of celebrated results in measure and integration theory. In Subsection 3.1 we deal with deep the results of Dorofeev and Sherstnev saying that any completely additive measure on the projection lattice of a von Neumann algebra without finite-dimensional direct summand is bounded. This allows one to obtain the Hahn-Jordan decompositions of noncommutative measures. This result is proved here (in a simplified version) for Type 111 factors which have a geometry quite different from Hilbert space projection logics. In Subsection 3.2 we focus on compactness criteria for noncommutative scalar measures. This topic lies between measure theory, Banach space theory, and the theory of operator algebras. Classical results of R. G. Bartle, N. Dunford, J. Schwartz, A. Grothendieck and others on weak compactness of measures have been generalized by C.A.Akemann to von Neumann algebras. Here we comment on a recent development providing a vectorvalued extension of this analysis. Moreover, we discuss Pfitzner's striking theorem and its consequences showing that weak compactness in duals of C*-algebras is commutatively determined. The connection of this result with the Pelczynski prop erty (V) and the Grothendieck property of operator algebras is studied. Subsection 3.3 concerns convergence theorems in noncommutative measure theory. First of all, the general vector-valued form of the Vitali-Hahn-Saks theorem for von Neumann algebras is presented. Moreover, noncommutative extensions of Dieudonnk's theorem, Brooks-Jewett theorem, Biting Lemma, and Egoroff's theorem are treated. Subsection 3.4 is devoted to noncommutative Radon-Nikodym theorems. Their various forms are stated, notably the Pedersen-Takesaki Radon-Nikodym theorem
288
Jan Hamhalter
for unbounded weights on von Neumann algebras, which is formulated in terms of modular groups. The central topic of Subsection 3.5 is a generalization of the classical Lyapunov theorem on the convexity of the range of nonatomic vector measures. In contrast to the previous parts of this study the final section deals with noncommutative phenomena which display a different character of noncommutative measure theory. We study those properties of measures that are trivially satisfied in classical measure theory but that lead t o strong consequences in the proper noncommutative case. In Subsection 4.1 we deal with subadditive measures on von Neumann algebras. The main result in this direction is a theorem asserting that any subadditive (unbounded) measure extends to a normal semifinite trace. Moreover, a new characterization of traces in terms of their dispersions on the projection lattices is given. In Subsection 4.2 we survey the theory of Jauch-Piron states on von Neumann algebras. Jauch-Piron state is a state whose kernel is a lattice ideal in the projection lattice. It is shown that such states have nice continuity properties. For example, if all transformed states of a given state e are Jauch-Piron, then e is a-additive. In particular, a pure state is Jauch-Piron if, and only if, it is a-additive. Results along thse lines indicate that continuity properties of noncommutative measures are strongly connected with the structure of the projection lattice. We shall now briefly recall the basic concepts and fix the notation. For all unmentioned facts and details we refer the reader to monographs on operator algebras [Davidson, 1996; Dixmier, 1977; Murphy, 1990; Pedersen, 1979; Stratilla and Zsido, 1979; Takesaki, 1979; Takesaki, 20021 and on orthomodular structures [Gudder, 1979a; Kalmbach, 1983; P t i k and Pulmannovi, 19911. We first review the basic definitions of the theory of ordered structures. By a lattice (L, 5 ) we mean a partially ordered set (poset for short) such that there is an infimum, e A f , and a supremum, e V f, for any pair of elements e, f E L. A lattice L is called complete if any subset of L has an infimum and a supremum. A subset K of L is called a sublattice if e V f and e A f belong to K whenever e and f do. A lattice L is said to be modular if e 5 g implies (e V f ) A g = e V (f A g) for all f E L. Suppose that the lattice L has a least element, 0, and a greatest element, 1. If e E L we say that an element e' E L is complement for e if e A e' = 0 and e V e' = 1. A lattice is called complemented if each element has a complement. Let (P, 5,0,1) be a poset with a least element, 0, and a greatest element, 1. A nonzero element a E P is called an atom if x 5 a implies x = 0 or x = a for all x E P . P is called atomic if every nonzero element in P dominates an atom. A poset P is called irreducible if it cannot be written as a nontrivial direct product of other posets. The poset (P, 5 , 0 , 1 , I)is called orthocomplemented if I is a binary operation on P satisfying the following conditions (a, b E P): (i) a'-'- = a, (ii) a 5 b implies b'- 5 aL, (iii) a V aL = 1. Two elements a, b E P are called orthogonal (in symbols, a I b) if a 5 bL. An orthocomplemented poset P is called an orthoposet if any pair of orthogonal elements has a supremum. An orthoposet
Quantum Structures and Operator Algebras
P is called an orthomodular poset (or quantum logic) if e 5 f implies
An important example of an orthomodular lattice is the projection lattice of a von Neumann algebra specified below. A (finitely additive) measure p on an orthoposet P is a map p : P -+ C such that p(e V f ) = p(e) p(f) whenever e If .
+
(The real measure and the positive measure on P are defined in the same way.) A measure p on P is called a state if p has values in the unit interval [0,1] and p(1) = 1. Moreover, a measure p : P t (C is called CT-additiveif
for any sequence (en) of pairwise orthogonal elements in P. Finally, a measure p : P + (C is called completely additive if
for any system (ea)aEI of pairwise orthogonal elements in P. If X is a Banach space we shall denote by X1 its unit ball and by X* its dual space. The symbol B(H) will stand for the *-algebra of all bounded operators acting on a Hilbert space H. (B(H) is an algebra with the usual arithmetic operations, composition of operators as multiplication, and the operation associating to an operator its adjoint as *-operation.) By Mn(C) we shall denote the algebra of all n by n complex matrices. Any C*-algebra can be viewed as a normed closed *-subalgebra of B(H). Let A be a C*-algebra. Its self-adjoint part is defined as A,, = {a E A 1 a* = a) and its positive part by AS = {a* a 1 a E A). The order on A,, is defined by a 5 b if b - a E A+. If A is a C*-algebra which acts on a Hilbert space H , then the commutant A' of A in B(H) is the algebra of all operators in B(H) commuting with each element of A. A unital C*-algebra is a C*-algebra having a multiplicative unit element, usually denoted by 1. Every unital commutative C*-algebras is *-isomorphic to the algebra C(K) of all continuous functions on some compact Hausdorff space K . A positive functional on A is a linear form on A assuming positive values for the elements of A+. A norm one positive functional on A is called a state. A functional cp E A* is said to be self-adjoint if cp(a*) = cp(a) for all a E A. The set of self-adjoint functionals is ordered by cp 5 $ if $ - cp is positive. The set of all states of A, S(A), is called the state space of A. S(A) is a convex set whose extreme nonzero points are called pure states. Two elements f , g E A* are called orthogonal if 11 f - gll = 11 f 11 11g11. If A is a unital C*-algebra acting on a Hilbert space H and x is a unit vector in H,
+
290
Jan Hamhalter
then the functional w,(a) = (ax, x), a E A, is a state on A, called the vector state. A positive functional cp on a C*-algebra A is called faithful, if cp(a*a) = 0 implies a = 0. A positive functional cp is called tracial if cp(a* a) = cp(aa*). A representstion is a *-homomorhism of a C*-algebra A into some B(H). A representation n of A is called faithful if n(a* a) = 0 implies a = 0. Von Neumann algebras can be identified with *-subalgebras of B(H) which are closed in the weak operator topology. In the sequel M will be a von Neumann algebra. By the symbol P ( M ) we shall denote the projection lattice of M, i.e. the set P ( M ) = (p E M I p = p2 = p*}. The order on P ( M ) is defined by p 5 q if p q = q. Two projections p and q are called orthogonal if p q = 0. The orthocomplementation on P ( M ) is given by pL = 1-p. Any projection p on a Hilbert space H corresponds to a closed subspace of H - its range, p(H). Now the order on the projections corresponds to the set inclusion order on closed subspaces. Orthoge nal projections have orthogonal range subspaces. The structure (P(M), O , l , < , 1) forms an orthomodular complete lattice. In case of M = B(H) we shall use a brief notation P ( H ) . Two projections p, q in M are called equivalent if there is (a partial isometry) v E M such that v v* = p and v* v = q. Given a self-adjoint element x E M we define its range projection as the smallest projection p such that p x = x. M is said to be a-finite if any system of orthogonal projections in M is at most countable. An unbounded self-adjoint operator on a Hilbert space H is said to be affiliated with M if its spectral projections lie in M. A finitely additive measure on P ( M ) is a map of P ( M ) into C such that p(p q) = p(p) p(q) for all orthogonal p, q E P(M). A a-additive measure is a measure p such that p ( C r = l p,) = Cr==l p(pn) whenever (p,) is an orthogonal sequence in P ( M ) . A completely additive measure is defined analogously. An element of M* is called normal if it preserves monotone limits of bounded sets of operators. A functional is normal if, and only if, it restricts to a completely additive measure on P ( M ) . Moreover, normal functional5 constitute the predual M, of M. A functional cp on M is called singular if for each projection p such that p(p) # 0 there is a nonzero projection q 5 p with cp(q) = 0. Let Z(M) denote the centre of M , Z(M) = {x E M I xy = yx for all y E M). If the centre is one-dimensional, M is called a factor. The von Neumann algebra M is commutative (i.e. M = Z(M)) exactly when P ( M ) is a distributive lattice (Boolean algebra). In this case M is isomorphic to some Lbo-space. For any von Neumann algebra M there is a largest central projection z such that z M is abelian. We call z M the abelian part of M and (1 - z) M the nonabelian part of M . A projection p E P ( M ) is called abelian if the hereditary subalgebra p M p is abelian, or equivalently, if the interval [O,p] = {q E P ( M ) I q p} in P ( M ) is distributive. The central support, c(p), of a projection p E P ( M ) is the smallest projection z E Z(M) such that z 2 p. An algebra is called Type I if there is an abelian projection e in M such that c(e) = 1. An algebra is called Type In if the unit in M can be written as the sum of n orthogonal equivalent abelian projections. If n is finite, then any such algebra is *-isomorphic to algebra C(X, Mn(C)) of all continuous matriu-valued functions on a hyperstonean space X . A projection
+
<
+
Quantum Structures and Operator Algebras
29 1
p E P ( M ) is called modular if the interval [O,p] in P ( M ) is a modular lattice. M is of Type II if it has no nonzero abelian projection and contains a modular projection e with c(e) = 1. M is called finite if there is no nontrivial projection in M equivalent to 1. Finite Type 11algebra is denoted by I I l . An algebra which does not contain any nonzero modular projection is called Type III. A properly infinite algebra is an algebra which has no nonzero finite direct summand.
2 QUANTUM INTEGRATION
2.1
Gleason's theorem
Gleason's theorem is a cornerstone of quantum measure and integration theory and at the same time one of the basic principles of the mathematical foundations of quantum mechanics. In its original in [Gleason, 19571, Gleason's theorem describes completely additive bounded measures on the structure of closed subspaces of a (separable) Hilbert space. A productive way of looking at Gleason's theorem seems to be to interpret it as an extension result: Any bounded measure on the projection lattice P ( H ) of a Hilbert space H (dimH > 2) extends to a bounded linear form on the algebra B(H) of all bounded operators acting on H. It is clear that such an extension must exist for all abelian subalgebras of B(H). Indeed, any measure p on P ( H ) restricts to a measure on the Boolean algebra P(A) for each abelian von Neumann subalgebra, A, of B(H). By the spectral theorem p extends uniquely to a linear functional on A which is nothing but the "local" abstract Lebesgue integral of p. Local extensions of p (indexed by abelian subalgebras) induce a well defined map, fi, on B(H). Let us remark that additivity of the (classical) integral hinges heavily upon the distributivity of the structure of measurable sets. As the lattice P ( H ) is far from being distributive, the question of whether fi(a+ b) = fi(a) +fi(b) for noncommuting a and b becomes very difficult. This is the measure-theoretic content of Gleason's theorem. Moreover, Gleason's theorem has a geometric aspect saying that each measure on P(H) is a cr-convex combination of pure states. in this respect it is nicely connected with the geometry of the Hilbert space sphere. Let Sl(H) be the unit sphere of a (real or complex) Hilbert space H . A function f : S1(H) -+ W is called the frame function on H if there is a number, w(f), called the weight o f f , such that
whenever (x,) is an orthonormal basis of H . A function f : S1(H) -+ B is called the weak frame function on H if its restriction to any finite-dimensional subspace of H is a frame function. The geometric form of the Gleason's theorem is as follows: THEOREM 1 (Gleason). Let H be Hilbert space, dimH 2 3. Then for any bounded weak frame function f on H there is a unique bounded self-adjoint oper-
292
Jan Hamhalter
ator T acting on H such that
for each unit vector x E H. Any completely additive measure p on P(H) induces a frame function, f,, on H by setting f,(x) = p(p,), where p, is the one-dimensional projection of H onto the linear span of the unit vector x. Therefore, the measure-theoretic form of Gleason's theorem reads as follows. THEOREM 2. Let H be a Hilbert space with dimH 2 3. Then any bounded completely additive measure on the projection lattice P ( H ) extends uniquely to a normal functional on the algebra B(H) of all bounded operators acting on H. An essential role in the proof is played by real three-dimensional space. In this nice arguments of spherical geometry will been developed. In order to demonstrate some of them we will introduce a few notions. In the sequel, S will always denote the unit sphere in the three-dimensional real Hilbert space R3. If s, t E S, then O(s, t) will stand for the angle between the vectors s and t. For a fixed vector p E S we will use the following geographic terminology and notation. The set Np = {S E S I O(p, s) 5 n/2) is called the northern hemisphere with respect to p, and the set Ep = {S E S 1 s Ip) is called the equator with respect to p. The latitude of s E Np is defined as 7r/2 - O(s,p). The latitude function is a function Ip on Np given by zP (9) = C O S ~e(p, S) = (p, s ) .~ If the north pole p is fixed, we usually drop the subscript p in the previous notation. A frame is an ordered pair (r, s, t) of pairwise orthogonal vectors from Np. By expressing the north pole p in the orthonormal basis (r, s, t) we obtain,
Conversely, given numbers a, b, c E [ O , l ] such that
we can always find a frame (r, s, t) with
The great circle on S is the intersection of S with a plane containing the centre of S. Let s E Np \ {p) with l(s) > 0. There is exactly one great circle, denoted by C(s), having s as its northernmost point. Indeed, C(s) is characterized by the property that the plane containing C(s) intersects the plane containing the parallel T, = {t E S I l(t) = l(s)) in the line tangent to C(s) at s. In other words, C(s) intersects the equator in points orthogonal to s. The great half-circle D(s) = C(s) n N, will be called the descent through s. Let us recall that a frame function is a function f : S -+ W such that
Quantum Structures and Operator Algebras
293
has a constant value, w( f ), for each frame ( r , s,t ) . The following lemma is due to C. Piron. It clarifies the arguments in Gleason's proof and it is also of independent interest. THEOREM 3 (Piron's Lemma). Let r and s be points o n the northern hemisphere Np such that s i s south of r. T h e n s i s reachable from r by finitely m a n y descents. Piron's lemma has the following important consequence for the monotonicity of simple frame functions. A simple frame function is a frame function which is constant on the equator and which assumes its maximum at the pole p. LEMMA 4. Let f : S -+ W be a bounded simple frame function. T h e n f ( r ) whenever l ( r ) l(s) 2 0.
>
> f (s),
The preceding lemma is one of the important steps towards establishing Gleason's theorem for simple frame functions i.e. towards showing that each simple frame function f is (up to the choice of the north pole) given by f(x) =2(x)2,
XES.
Simple frame functions correspond to pure states in foundations of quantum mechanics. Since the property of being a weak frame function is determined by finitedimensional subspaces it is not hard to prove that Gleason's theorem in the frame function form is in fact valid for all inner product spaces. THEOREM 5. Let f be a bounded weak frame function o n a n inner product space V, dimV 3. T h e n there i s a bounded self-adjoint operator T acting o n the completion H of V such that
>
f (x) = (T x, x)
for all unit vectors x E V .
We will now discuss the role of the boundedness assumption in Gleason's theorem. This hypothesis is not superfluous. Indeed, it is well known that there are additive functions on the real line R that are unbounded on the unit interval. (For this it suffices to view the real line as a vector space over rationals and to take an unbounded linear form on this space.) Let us fix one additive function cp on IR that is unbounded on [O,1] and a unit vector x in the Hilbert space H. If dim H < oo, then measure p on P ( H )
is unbounded and completely additive. So p cannot be extended to a bounded linear functional. In standard measure theory any completely additive measure is bounded. In quantum measure theory, finite-dimensional atomic Hilbert lattices show that this is not true. Nevertheless, by a remarkable result of S. Dorofeev and A. N. Sherstnev any completely additive measure on infinite-dimensional Hilbertspace structure is automatically bounded [Dorofeev and Sherstnev, 19901.
294
Jan Hamhalter
THEOREM 6 (Dorofeev and Sherstnev). A n y completely additive measure o n the projection lattice P ( H ) where H is a n infinite-dimensional Hilbert space i s bounded. Gleason's theorem belongs to the oldest part of noncommutative measure theory. Various aspects of this result are still in the centre of attention of many researchers and lead to a variety of applications to contemporary quantum theory. As an example of some recent development let us consider an application of Gleason's theorem to quantum information theory. Let H1@H2@. ..@Hnbe the tensor product of the Hilbert spaces HI, . . . ,Hn. Let us denote by C(H1, HZ,. . . ,Hn) the set of all unit vectors in this product space that are of the form x ~ @ x z @. .@x,, . where xi E Hi are unit vectors. In quantum information theory, the vector states corresponding to the elements of C ( H l , Hz,. . . ,H,) are called unentangled. They describe the local measurements of an n-particle system modelled by the Hilbert spaces HI,Hz,.. . ,H,. A natural question now is whether the knowledge of structure of the of the probabilities associated to a local measurements allows one to determine uniquely the state of the whole system. Viewed mathematically, let us represent the probabilities of local measurements by the function
with the property
@ H, contained in whenever (ei)iEr is an orthonormal basis of HI @ Hz @ C(H1, Hz, . . . , Hn). The function f is called the unentangled frame function with the weight w. Mathematicaly, the problem of local measurements is the question of whether an unentangled frame function can be extended to a frame function on the whole of HI @ Hz @...@ H,. THEOREM 7 (Wallach). Let HI, . . . ,H, be finite-dimensional Hilbert spaces, each of dimension a t least three. Let
be a n unentangled frame function. T h e n there exists a positive operator T E B(H1 @ . -.@ H,) such that whenever x l @ . . -@ x, is in C (HI, H z , . . . ,H,), the following equality holds:
This result was obtained in [Wallach, 20021. Its generalization to infinitedimensional spaces is not straightforward and requires the theory of multimeasures. It has been established by 0. Rudolph and J. D. M. Wright [2000]. Another aspect of Gleason's theorem is its interplay with completeness of metric inner product structures. Let V be an inner product space. A subspace F of V is
Quantum Structures and Operator Algebras
295
called orthogonally closed if F = FII,where FI denotes the space of all vectors in V orthogonal to F . We denote by F(V) the set of all orthogonally closed subspaces. V is complete if, and only if, F(V) coincides with the structure of all closed subspaces of V. F(V) is a complete orthocomplemented lattice. The first measuretheoretic completeness criterion was obtained by J. Hamhalter and P. Pt& in the case of positive measures [1987]. In subsequent development it 1993; Hamhalter, has been generalized into the following form (see [~vure~enskij, 20031). THEOREM 8. Let V be an inner product space. V i s complete if, and only if, F(V) admits at least one nonzero completely additive (complex valued) measure. This result was inspired by Gleason's theorem because it says that the measuretheoretic form of Gleason's Theorem (Theorem 2) also holds for general inner product spaces. The preceding theorem was proved in the early nighties. Its finitely additive version has been settled only recently by E. Chetcuti and A. DvureEenskij. They showed that Theorem 8 is not valid for finitely additive measures [Chetcuti and DvureEenskij, 20041. On the other hand, they succeeded in proving that an inner product space V is complete if, and only if, F(V) possesses at least one finitely additive positive measure which is nonzero on some one-dimensional subspace of V [Chetcuti and DvureEenskij, 20031. The importance of the structure of orthogonally closed subspaces is highlighted by remarkable results of Willbur [1977] who studied the structure of subspaces in locally convex spaces. He showed that if the lattice L(X) of all closed subspaces of X , where X is an infinitedimensional locally convex space whose Mackey topology is not weak, is orthocomplemented, then L(X) is isomorphic to the lattice F(V) for some inner product space V. Combining Willbur's result, the Mackey-Kakutani theorem and the completeness criteria discussed above, we obtain the following fairly general result. THEOREM 9. Let X be a n infinite-dimensional complex Mackey space whose topology is not weak. Then X i s isomorphic to a Hilbert space iJ and only if, the lattice L(X) of all closed subspaces o f X is an orthocomplemented lattice with at least one nonzero positive finitely additive measure not vanishing o n all onedimensional subspaces.
2.2 Hidden variables One of the physically relevant applications of Gleason's theorem are nego theorems in the theory of hidden variables. In general terms, the problem of existence of hidden variables is the question of whether or not the probability interpretation of quantum mechanics can be eliminated by constructing a probability space (usually called the hidden space) such that each quantum event can be described by a classical random variable. It is a consequence of the spectral theorem that this can be done successfully for each observable individually. Indeed, any self-adjoint operator A acting on a Hilbert space H generates an abelian von Neumann algebra. This algebra is *-isomorphic to the algebra of bounded measurable functions,
296
Jan Hamhalter
LM(Q,A, p). The operator A then corresponds to some random variable on 0. However, much evidence has been accumulated that there is no reasonable representation of quantum observables by random variables which would work for two noncommuting observables simultaneously. A common necessary condition for the existence of a hidden space is the existence of a dispersion free probability measure on the structure of quantum propositions. We say that a state (probability measure) p on the projection lattice P ( M ) of a von Neumann algebra M is dispersion free if it attains values only in the set (0,l). A state cp on M is called dispersion free if its restriction to the projection lattice is a dispersion free measure. There are plenty of dispersion free states on classical probability spaces (commutative von Neumann algebras), e.g. Dirac measures concentrated at points of the probability space. Moreover, any classical probability measure can be approximated by convex combinations of such dispersion free measures in the topology of pointwise convergence on the set of random events. In contrast to this, the simplest possible "quantum probability space" given by the three dimensional Hilbert space admits no dispersion free state. It is an easy consequence of Gleason's theorem. Indeed, any state on B(H), where dim H 2 3, is a a-convex combination of pure states w,(a) = (ax,x), ( a E B(H)), where x is a unit vector in H . Any dispersion free state is pure and so it has to be a vector state, say w,. But, such a state maps the projection lattice onto the whole unit interval [0,1],which is a contradiction. The proof of Gleason's theorem for Hilbert space lattices and even more for von Neumann lattices is extremely complex. For this reason there has been a well motivated effort to provide a simpler proof (and so a simpler explanation) of the nonexistence of dispersion free states on von Neumann algebras. The aim of this section is to show that geometric arguments combined with the comparison theory of projections suffice to prove the nonexistence of dispersion free states without recourse to Gleason's theorem. We need the following fact [Hamhalter, 2003; Hamhalter, 20041: PROPOSITION 10. Let M be a von Neumann algebra with n o Type I2 direct summand. The following statements hold true: (i) A n y subalgebra of M which is *-isomorphic to M2(C) i s contained in a subalgebra C@ D of M satisfying the following properties: C is either zero or i t i s *-isomorphic to M4(C); D i s either zero or i t is a copy of M2(C) contained in another subalgebra of M which i s *-isomorphic to M3((C). (ii) M contains a unital subalgebra *-isomorphic to one of the following matrix algebras: M2(C), M3(C) , M2(C) @ M3 (C). THEOREM 11. Let M be a von Neumann algebra which has neither a nonzero abelian part nor a Type I2direct summand. T h e n P ( M ) admits n o dispersion free probability measure. Proof. First we prove the result for P(W3). For a contradiction, suppose that p is a dispersion free state on p(IR3).It induces a frame function f : S -+ {0,1)
Quantum Structures and Operator Algebras
297
on the unit sphere S. The function f must asume value 1 at some vector, say p E S. Consider p to be the north pole. Then f is a simple frame function which assumes its maximum at p and is zero on the equator Ep. In view of Lemma 4, f is nondecreasing with respect to the latitude. It is clear that for the weight w(f), we have w( f ) = 1. By (2) we can find a frame (r, s,t) such that I ( r ) = 1(s) = 112 and l(t) = 0. As w(f) = 1, f has to assume the value 0 either at r or s. By the monotonicity it means that f (u) = 0 whenever 1(u) < 112. Take now a frame (x, y, z) such that 1(x) = l(y) = l(z) = 113. Then f vanishes at all x, y, z, which is a contradiction. Let us now turn to the case of a general von Neumann algebra M . By Proposition 10 (ii), any dispersion free state on P ( M ) restricts to a dispersion free state on some sublattice isomorphic either to P(M3(C)) and so to a dispersion free state on P(W3) by taking a completely real subspace. But this is forbidden by the previous reasoning. rn One of the consequences of the preceding nego theorem is the fact that the projection lattices of nearly all von Neumann algebras cannot be embedded into Boolean algebras in such a way that the embeddings would respect suprema and orthogonality of all finite collections of orthogonal projections. This excludes the existence of the hidden space in the sense of Kochen and Specker [1967]. A hidden space of a quantum system is a set, R, with a a-field, A, of subsets of R, which have the following properties: For each quantum observable A and for each quantum state Q there are A-measurable function fA : 52 -+ R and a probability measure pe on A, respectively, such that the following conditions are satisfied: (i) For each Borel set X C W the probability that the value of an observable A is in X equals p e ( f i l ( x ) ) , provided that the system is in the state p. (ii) (Function Principle) If A and B are observables such that B = g(A), where g is a real bounded Borel function, then fB = g o fA. Condition (i) says that any observable is statistically equivalent to a certain random variable on 0. Condition (ii) means that the representation by random variables preserves the transformation rules between the observables. The famous Kochen-Specker theorem tells us that there is no hidden space for traditional Hilbert space quantum mechanics which is modelled by the algebra of all selfadjoint operators on a separable Hilbert space of dimension at least three. This result has recently been extended to the projection lattices of von Neumann alge, Hamhalter, 20051. bras [ ~ o r i n g2005; THEOREM 12. Let M be a von Neumann algebra without a type I2 direct summand and with zero abelian part. There is no o-field A of subsets of a nonempty set R and a map a + fa assigning to each self-adjoint element a in M an Ameasurable real function fa on R such that f,(,) = g o fa for any bounded continuous function g on W.
Jan Hamhalter
298
Proof. The idea of the proof is to show that the existence of such a a-field (R, A) implies the existence of a dispersion free probability measure on P(M). Suppose that (0, A) has the properties stated in the theorem. Fix w E R and consider the map s : M,, 4 W, s(a) = f,(w). If p E P(M), then p2 = p and so fp(w)' = fp(w). In other words, s(p) E {Oll}. Let us now take orthogonal nonzero projections p, q E M. Put x = p + Let f and g be bounded continuous real functions on W vanishing at zero and such that f (1) = g($) = 1 and f = g(1) = 0. It is clear that f (x) = p and g(x) = q. Using the Function Principle we obtain
iq.
(i)
Therefore, s is a finitely additive dispersion free measure on P(M). On employing the Function Principle to the unit element, 1,of M and the constant unit function on W,we see that fi(w) = 1 for all w E R. Hence, s induces a dispersion free state on P(M), which contradicts Theorem 11. The question of the existence of dispersion free states and hidden spaces has been settled thereby for von Neumann algebras. By contrast, the status of dispersion free states on C*-algebras remains largely unknown. The reason is the lack of C*-versions of Gleason's theorems. Suppose that p is a finitely additive dispersion free state on the projection poset, P(A), of a unital C*-algebra A and that the linear span of P(A) is dense in A. On condition that p extends to a linear functional fp of A, one can prove that fp has to be a complex *-homomorphisms on A. This motivates the conjecture that for the case of C*-algebras which are linearly generated by the projections the existence of dispersion free state is equivalent to the existence of a closed twesided ideal of A of codimension one. For C*algebra projection structure of which is not rich, the problem of hidden variables can be formulated in terms of quasi-functionals. A function Q : A 4 (C on a C*algebra A is called positive quasi-functional if (i) e is a positive linear functional ) all self-adjoint on all abelian C*-subalgebras of A (ii) e(a i b) = @(a) i ~ ( b for a, b E A. The norm of Q is defined as 11 ell = sup{le(a) 1 I llall 5 1). If llell = 1 we call Q a quasi-state. The quasi-functional e is said to be monotone if e(a) 5 e(b) whenever a 5 b. It is not known whether a quasi-state on a C*-algebra having no quotient *-isomorphic to M2(@)is linear. This is a highly challenging C*-form of the Mackey-Gleason problem. However, quasi-functionals seem to be more natural for the axiomatics of quantum theory because they postulate additivity only with respect to commuting elements. Let us denote by &(A) the set of all positive quasi-functionals of norm less than one. Denote further by M (A) the set of all monotone multiplicative functionals in &(A). (A quasi-functional e is called multiplicative if @(ab) = e(a) e(b) for all a, b E A.) The following result of Misra [1967] states that nonabelian C*-algebras do not have large sets of multiplicative monotone quasi-functionals.
+
+
Quantum Structures and Operator Algebras
299
THEOREM 13 (Misra). A C*-algebra A i s abelian if, and only if, the closure of the convex hull of M(A) in the topology of pointwise convergence o n elements of A i s &(A). However, it is not clear in what cases the set M(A) is empty. The following theorem is a C*-counterpart of the von Neumann impossibility proof [Caruana, 19951. THEOREM 14. A simple infinite unital C*-algebra does n o t admit a nonzero positive multiplicative quasi-functional.
2.3 Gleason's theorem for von Neumann algebras Gleason's theorem concerns the quantum logic of all projections on Hilbert space and thus describes the states of a standard quantum mechanical system. This quantum structure can be characterized among all von Neumann projection lattices as being an atomic irreducible orthomodular lattice. It seems to be a very special example of a projection lattice in this respect. In more general quantum theories, such as quantum statistical physics and quantum field theory, von Neumann algebras with highly nonatomic projection lattices play a decisive role. Therefore, for both mathematical and physical reasons it was desirable to extend Gleason's theorem to more general operator algebraic context. A natural question, known as the Mackey-Gleason problem [Mackey, 19631 has arisen of whether or not Gleason's theorem can be generalized in the following directions: (i) for all projection lattices of von Neumann algebras (ii) for finitely additive measures (iii) for measures with values in general Banach spaces. The completion of this program has been a remarkable achievement of more than 30's years of research in quantum measure theory. Many authors have contributed to this breakthrough. It was not before the nighties that the following optimal form of Gleason's theorem was established by L. J. Bunce and J. D. M. Wright. THEOREM 15 (Generalized Gleason's Theorem). Let M be a v o n N e u m a n n algebra without a Type I2direct summand. A n y bounded finitely additive measure o n the projection lattice P(M) of M with values in a Banach space X extends uniquely t o a bounded linear operator mapping M into X . The proof of this result is highly nontrivial and may be found in the original papers [ ~ u n c and e Wright, 1992a; Bunce and Wright, 199213; Bunce and Wright, 19941 (see also self-contained survey [Hamhalter, 20031). Although Gleason's theorem for Hilbert lattices is used occasionally, many other techniques have been developed in the course of the proof of the Generalized Gleason theorem. Here we present the geometric ideas behind the proof in the special case of finite Type Inalgebras. Let us recall that any Type Infinite von Neumann algebra is *-isomorphic to the algebra C(X, M,(C)) of all continuous functions from a hyperstonean space X into the matrix algebra Mn(C) of all n by n complex matrices. The algebras of this type are close to abelian ones. They are in fact finite-rank matrix algebras over abelian von Neumann algebras. The key part of the argument is to
300
Jan Hamhalter
establish the uniform continuity of measures on the projection lattice. This fact can be proved by using Gleason's theorem for suitable substructures isomorphic to M3(C). An important step in this regard is to show that close projections p and q in a von Neumann algebra M admit a projection r such that both W*(p,T ) and W*(q, r ) can be embedded into a direct sum of matrix algebras M,(C),where n = 3,4. This structure result may be of independent interest. The strategy is based on analyzing the angle between general projections. Let p and q be nonzero projections in a C*-algebra A. We say that p and q are isoclinic with angle a, 0 < a < ~ / 2 if,
It can be verified that one-dimensional nonorthogonal distinct projections p and q acting on a Hilbert space H are isoclinic with angle a if, and only if,
for all unit vectors J and 8 in the range of p and q, respectively. This explains the geometric content of isoclinicity. EXAMPLE 16. Let 0 5 a, b 5 1 and p, $J E W. Then projections
in M2(C) are either commuting or isoclinic with angle a given by (4) cos2 a = a b
+ (1 - a) (1- b) + 2 JZ JCF
C O S( ~+) .
Proof. Equation (4) can be verified by a straightforward computation.
It turns out that if projections p and q are isoclinic with the angle a , then the C*algebra generated by them is isomorphic to M2((C) and that also Ilp - qll = s i n a . The following result enables one to interpolate general projections by an isoclinic projection. THEOREM 17. Let p and q be distinct projections in a von Neumann algebra M with p A q = 0 and lip - q11 < 1. Then there is a projection h in M such that h is isoclinic to both p and q with the angle
Proof. Since Ilp - qll < 1, we have p A (1 - q) = (1 - p) A q = 0. There is no loss of generality in assuming that p V q = 1. By the analysis of position of two
Quantum Structures and Operator Algebras
301
projections (see e.g. [~akesaki,19791) we can identify W * ( p ,q) with C(X, M2(C)), where X is a Hausdorff compact space, in such a way that, for all x E X ,
(o o ) 1 0
Ax) =
q(x) =
(
4.1
Ja(x) - a2(x)
a(x) - a2(x) 1- a(x)
where a(%) is a continuous function on X with 0 5 a(x) 5 1. Set
The condition 0 Then
< Jlp- qll < 1 implies that 0 < a < n/4. Let us put X = cos2a.
Also, for all x E X ,
) q(x) are either equal or isoclinic (in Using Example 16, we see that ~ ( x and M2(C)) with the angle P(x) for which, by (4),
This implies that
sin P(x) = IIp(x) - q(x) II 5 sin 2 a ,
and therefore a(x) = cos2P(x)
> cos22a = (2 cos2a - 1)2
In other words, (6) a(x) 2 (2X - 1)2 > 0 for all x E X . We will find the required projection, h E C(X, M2(C)), in the form
where ei*("I is a continuous function on X with values in the unit circle. By virtue of (4), h is obviously isoclinic to p with angle a. It remains t o find ei$(") such that the same assertion holds for the projections q and h. Making use of (4) again, this reduces to finding (real) $(x) satisfying
If a(x) = 1we set $(a) = 0. Suppose that a(%) # 1. Since then 1 > a(x) previous equation reads
> 0, the
302
Jan Hamhalter
The right-hand side of the previous equation is obviously nonnegative (see (5)). In order to guarantee the existence of $(x), we have to verify that the right-hand side of the previous expression takes values in [0,1]. But employing (6), (5) and the monotonicity of the corresponding function we can estimate
(We have used inequality (6) for simplifying the resulting expressions.) Putting now / \
for x E X with a(x) # 1 and ei$(") = 1 for x with a(x) = 1, we obtain a continuous function on X. Hence, defining h by (7) with $J specified as above, we obtain the projection in W*(p, q) isoclinic to both p and q with the same angle a =1 sin-' IIP - 911. 2 rn THEOREM 18. Any bounded complex measure on the projection lattice P(M) of a uon Neurnann algebra M which has no Type I2direct summand is uniformly continuous. Proof. Take distinct projections p, q E P ( M ) such that Ilp - qll < 1 and set e = p - p A q , f = q - p A q . Then Ile- f l l < l a n d e r \ f =O. UsingTheorem17 we can find a projection g in M which is isoclinic to both e and f with the angle
Then, both W*(e,g) and W*(f, g) is *-isomorphic to M2(C). By Proposition 10 (i) any copy of M2(C) can be enlarged to a matrix subalgebra for which Gleason's theorem holds true. Thereby p extends on both W*(e, g) and W*(f, g) to a linear function. As a result p is a Lipschitz function on the corresponding projection lattices with the Lipschitz constant, say K. This allows us to estimate
5 K . sin (sin-' Ile - f 11) Similarly, Ip(f - 4911 5 K Finally, we can write
- Ile - f ll
303
Quantum Structures and Operator Algebras
THEOREM 19. Let M be a von Neumann algebra of Type I,, where n # 2 and n < a.Then any bounded (finitely additive) complex measure p on P ( M ) extends t o a bounded linear functional on M.
Proof. We can identlfy M with C(X, M,(@)), where X is a hyperstonean compact space. A function f E C(X, M,(C)) is called locally constant (or a step function) if f (X) is finite or, equivalently, if there is a finite partition {01, Oz, . . . Ok) of X consisting of disjoint clopen sets such that f is constant on each Oi. Let A be the *-subalgebra of C(X, M,(@)) consisting of all locally constant functions. It can be verified that A is dense in C(X, M,(C)) and, moreover, that any projection in C(X, M,(C)) can be approximated by a projection from A. First we extend p to a linear functional on A. Let us take f , g E A. We can find a partition {O1,. . . , Ok) consisting of clopen sets such that
where XO, (i = 1,.. . k) is the characteristic function of Oil and 91, . . . ,gk E M, (C). Consider now the subalgebra
fl,
. . . ,f k ;
B = {f E C(X, M,(C)) I f is constant on each O i l , Then B is isomorphic to a direct sum of k copies of M,(C). By Gleason's theorem p extends to a linear functional on B. Therefore, by setting
we obtain a well-defined function on A which is linear. It is clear that I$(f)l 5 4 11 f 11 s u p P E p ( ~lp(p) ) 1. In other words, p extends to a bounded linear map $ on A. Let us further extend $, using the same symbol, to a continuous linear functional on M. We have now to verify that $ coincides with p on P ( M ) . But any projection in M is a limit of projections in A. Since both Q and p are uniformly continuous on P ( M ) (Theorem 18) and are equal on P(A), they must coincide on P(M). Let us remark that the proof of Gleason's theorem for infinite algebras and finite Type I1 algebras requires essentially different arguments. Gleason's theorem in its vector-valued form has significant consequences for describing the dynamics of quantum system (see e.g. hat, 1992; Bunce and Wright, 19951). We will now deal with the multilinear version of Gleason's theorem, which is amongst other things relevant to the quantum history approach to quantum theory. DEFINITION 20. Let MI,. . . ,M, be von Neumann algebras. A multzmeasure m with values in a Banach space X is a map
Jan Hamhalter
304
such that for each k = 1,.. . ,n, for all projections pi E Mi (i # k), and for all orthogonal projections p, q E M the following holds
THEOREM 21. Let MI,. ..,Mn be von Neumann algebras, each having no direct summand of Type 12.Suppose that m : P(Ml) x . . . x P(Mn) 4 X is a bounded X-valued multimeasure. There is a unique bounded n-linear map F : MI x M2 x . . x Mn + X which extends m. Proof. First observe that m has at most one n-linear bounded extension. This is a consequence of the fact that the cartesian product of linear spans of projections x Mn. For n = 1the theorem reduces to the Generalized is dense in MI x M2 x Gleason theorem. Further, we shall proceed by induction on n. Suppose that the statement of the theorem is true for n - 1. For each fixed projection p E P(M1), the map mp : P(M2) x . . . x P(Mn) -+ X, defined by
is a bounded multimeasure. By the induction hypothesis, mp extends to a bounded (n - 1)-linear map, Fp,on M2 x - - x Mn. Denote by Y the Banach space of all bounded (n - 1)-linear forms on M2 x . . x Mn with values in X . We shall consider the map T : P(Ml) 4 Y: p 4 Fp.Suppose that pl,p2 are orthogonal projections in MI. Then, for projections (q2,. . .,qn) E P(M2) x . x P(Mn) the following holds true:
-
-
Since multilinear continuous functionals are uniquely determined by their values on projections, the previous equality means that
In other words, T is a finitely additive Y-valued measure on P(Ml). We show that T is bounded. Let
Then, for p E P(M1), llFpll 5 4"-lC. Indeed, for 0 5 xi 5 1, xi E Mi, we can write xi = En&pn,i, where (pnai), are commuting projections from Mi. It implies, by multilinearity,
Quantum Structures and Operator Algebras
305
Since every norm one element in a C*-algebra is a combination of four positive elements with norm less than one, we see that really
whenever y2,. . . ,yn are norm one elements of the corresponding algebras. Now we can appeal to the Generalized Gleason theorem and find a bounded linear map H : P(Ml) -t Y which extends T. Finally, let us set
It is clear that F is the desired multilinear bounded map extending m. Historical remarks The history of the proof of the Generalized Gleason theorem is complicated. There are many papers devoted to this problem some of which were published independently by a few authors and some of which have gaps in the prooh. We are not going to provide a complete historical analysis. We just roughly divide the efforts made into two stages. After Gleason's discovery the problem of its extension to finitely additive positive measures on von Neumann algebras was attacked. One of the first works in this direction was the paper of J.Tisher proving Gleason's theorem for completely additive measures on Type I algebras [Tisher, 19821. He used arguments from spherical geometry. An important tool for all further research was then provided by J. F. Aarnes and J. Gunson [Aarnes, 1969; Aarnes, 1970; Gunson, 19721. They studied isoclicity of projections and established the continuity of measures. Their results led to the proof of the Generalized Gleason theorem for Type I homogeneous algebras. After that, E. Christensen 119821 proved Gleason's theorem for positive measures on properly infinite von Neurnann algebras. He developed a nice 4 by 4 matrix trick and other insights. Finally, Gleason's theorem for probability measures was established by a careful and delicate analysis of measures on finite algebras given by F. J. Yeadon [1983; 19841. This stage is documented in a scholarly paper by M. Maeda [1990]. In the second generation of the results, Gleason's theorem was proved for nonpositive measures (and thereby for general vector measures). At first it was proved for factors by A. Paszkiewicz 119851. The final solution of the Mackey-Gleason problem was given by L. J. Bunce and J. D. M. Wright in a series of remarkable papers [1992a; 1992b; 19941. Let us remark that the transition from probability measures to general ones was extremely difficult and required essentially new ideas. It is surveyed in [Hamhalter, 2003, Chapter 51. Besides the main lime of the proof of Gleason's theorem indicated above which we followed in this exposition there are many other papers dealing with this topic (see e.g. [~atvejchuk,1998a; Matvejchuk, 19811). There is also an extensive literature devoted to Gleason's theorem for Jordan algebras [Bunce and Wright, 1985; Bunce and Wright, 19891, C*-algebras [Bunce and Wright, 1996a; Bunce and Wright, 1996b; Bunce and Wright, 1996~1,measures on skew projections and hyperbolic
306
Jan Hamhalter
logic [~atvejchuk,1997a; Matvejchuk, 199713; Mushtari, 19891 and other aspects of Gleason's theorem [pitowski, 19981.
2.4
Gleason's theorem for quantum logics
The transition from Gleason's theorem for Hilbert space logic to the Generalized Gleason theorem is very difficult. It can be viewed as an extension problem for measures between the projection lattices. Indeed, any von Neumann algebra M is a subalgebra of B(H) for some Hilbert space H. Given that a measure p on P ( M ) extends to a measure on P(H) we can, by Gleason's theorem, extend p to a bounded linear functional on B(H) and thereby to a bounded linear functional on M . This reformulation of Gleason's theorem enables one to generalize it to orthomodular ordered structures. We need a few notions. DEFINITION 22. Let (L, 5,O) be a poset with the order 5 and a least element 0. For each a E L, let I,: [0, a] + [0,a] be an operation on the interval [0, a] = {x E L I 0 5 x 5 a). The structure (L, 5 , 0 , (la)aEL)is called the generalized orthomodular poset or generalized quantum logic if the following conditions are satisfied: (i) For each a E L, ([0, a], 5,0, a, I,)is an orthomodular poset. (ii) If a 5 b then, for each x E [O, a], xla = x L b A a. We say that two elements a, b E L are orthogonal if there is an element c 2 a, b such that a and b are orthogonal in the orthomodular poset [0,c] (i.e. if a 5 bLc). If A is a Cc-algebra, then it is easy to verify that the projection structure P(A) is a generalized orthomodular poset where the least element is the zero projection, the order is inherited from the self-adjoint part of A, and for p 5 q in P(A), pLq = q - p . Moreover, two projections p,q in A are orthogonal as elements of P(A) exactly when they are orthogonal in the usual sense, i.e. if p q = 0. Let us notice that orthomodular posets are generalized orthomodular posets that have a largest element. We say that a generalized orthomodular poset L is a substructure of a generalized orthomodular poset K if every interval in L is a sublogic of the corresponding interval in K. The concepts of measure theory extend to generalized orthomodular posets canonically. Let L be a generalized orthomodular poset and X a normed space. A map p : L + X is said to be a finitely additive measure if p is a finitely additive measure when restricted to each interval [0,a], a E L. Other properties of measures (complete additivity, etc.) are defined analogously. A nonnegative measure p on L is called a state (or probability , p is measure) if supaELp(a) = 1. If, in addition, L has a largest element, l ~then a state if, and only if, p(lL) = 1. We shall denote by S(L) the set of all states on L and call it the state space of L. If L has a largest element, then the state space is a compact convex set when endowed with the topology of pointwise convergence. A generalized orthomodular poset L is said to be unital if for every nonzero a E L there is p E S(L) such that @(a)= 1. Further, we say that the state space S(L) is
Quantum Structures and Operator Algebras
307
order determining (resp. separating) if s(a) 5 s(b) for each s E S(L) implies a 5 b (resp. if s(a) = s(b) for each s E S(L) implies that a = b). Of course, every order determining state space is separating. In our basic example P(A), where A is a C*-algebra (possibly nonunital), the state space is always order determining, which is a consequence of the fact that positive linear functionals determine the order on A,,. In general, the state space S(L) need not be either compact or convex. For this reason we introduce the concept of quasi-state space. By a quasi-state space, Q(L), we shall mean the set of all nonnegative measures on L with values in the interval [0, 11. The set Q(L), equipped with the topology of pointwise convergence, is a nonempty convex set. Let us note that by the Generalized Gleason theorem if A is a von Neumann algebra without Type I2 direct summand, then S(P(A)) and Q(P(A)) is f i n e l y homeomorphic to the (compact) state space of A and the positive part of the unit ball in A*, respectively. In order to use the powerful apparatus of functional analysis we shall consider the following linear structure associated with a generalized orthomodular poset, L. Let A(L) be the set of all bounded affine real-valued functions on Q(L) vanishing at 0. (By 0 we mean a zero measure.) Endowed with the usual arithmetic operations, supremum norm, and pointwise order, (A(L), 5 ) becomes an ordered Banach space. The structure L can be mapped into A(L) via evaluation mapping, eL, given by
+
Then, of course, eL(a V b) = eL(a) eL(b) whenever a I b. It means that e ~ L: 4 A(L) is a finitely additive vector measure. If L has an order determining state space, then eL is injective and order preserving in both directions. We recall now a few concepts of the theory of ordered vector spaces. A partially ordered vector space is a real vector space A with a proper convex cone A+. The partial order 5 on A,, is induced by A+ in the standard way: a 5 b if b - a E A+. An ordered vector space is said to be boundedly complete if any bounded increasing net of elements has supremum. An element e E A is said to be an order unit for A i f f o r a l l a E A thereis a X > O such that -Xe 5 a 5 Xe. Aissaid t o b e an order unit space if n a 5 e for each n E N implies a 5 0. An order unit space has the norm llall = inf{X > 01 - Xe 5 a 5 Xe) (a E A). If ( A , 11.11) is complete, the space A is called the complete order unit space. Any self-adjoint part of a unital C*-algebra endowed with the standard order is a complete order unit space with order unit 1. Let A and B be order unit vector spaces. A linear map F : A -+ B is called positive if F(a) E B+ whenever a E A+. A bounded linear map F : A 4 B preserving the unit is positive if, and only if, it is bounded and norm one. By a state on an order unit space we mean a positive norm one functional. The following result [Hamhalter, 1999a] shows that projection structures of von Neumann algebras enjoy very nice extension properties for general positive vector measures. THEOREM 23. Let M be a von Neumann algebra which does not contain a Type
I2 direct summand. Let p be a positive S-valued measure on P(M), where (S, 5
308
Jan Hamhalter
, I s ) is a complete vector lattice such that p ( 1 ~ = ) Is. T h e n p extends to a positive S-valued measure on any larger orthomodular lattice K with a unital set of states which contains P(M) as a substructure. This theorem says that von Neumann projection lattices are extremely well compatible with any larger quantum structure. Moreover, the next theorem shows that for any generalized orthomodular lattice L containing a von Neumann projection lattice P ( M ) and any finitely additive state p on L there is a "linearizable" measure on L which coincides with p on P(M). THEOREM 24. Let M be a von Neumann algebra without a Type I2 direct summand and let L be a generalized orthomodular poset containing P ( M ) as a substructure. T h e n any positive measure p o n P ( M ) i s of the form
where j i s a positive functional on A(L). It is not known what other quantum logics, except for Boolean algebras and projection lattices, enjoy these nice extension properties. 3 BASIC PRINCIPLES OF NONCOMMUTATIVE MEASURE THEORY
Noncommutative boundedness principle In classical measure theory on a measure space (R, A, p), where R is a nonempty 3.1
set, A is a a-field of subsets of R, and p is a real measure on A, the following important principle holds: If p is completely additive, then p is bounded. Moreover, there are disjoint sets A+ and A- in P and positive completely additive measures p+ and p- living on A+ and A_, respectively, such that
The former statement is referred to as the boundedness principle, while the decomposition (9) is known as the Hahn-Jordan decomposition of p. In the basic theory of normal states on operator algebras there is the following analogy to the HahnJordan decomposition: Any self-adjoint normal functional on a von Neumann algebra can be expressed as a difference of two positive normal functionals having orthogonal support projections. However, at the level of measures, the boundedness principle, and thus the Hahn-Jordan decomposition, does not hold in general. We have seen in Section 2.1 that projection structures of finite-dimensional algebras admit many unbounded measures which are completely additive. On the other hand, a deep result of Dorofeev and Sherstnev, dealt with above, says that the boundedness principle does hold for all infinite-dimensional type I factors. A remarkable theorem proved by S. Dorofeev [Dorofeev and Sherstnev, 1990; Dorofeev, 19921 and then improved by L. J. Bunce, K. SSito and J. D. M. Wright
Quantum Structures and Operator Algebras
309
[ ~ u n c et e al., 19981 shows that only matrix algebras are responsible for the failure of the boundedness principle. THEOREM 25. A n y complex completely additive measure o n the projection lattice of a won N e u m a n n algebra M with n o direct summand isomorphic t o a n algebra of complex matrices i s bounded. The assumption of boundedness of a given measure on the projection lattice is an indispensable part of the arguments in the proof of the Generalized Gleason theorem. The previous result says that this assumption is superfluous for almost all noncommutative measures. A Complete proof of the above theorem may be found in the papers [Bunce et al., 1998; Dorofeev and Sherstnev, 1990; Dorofeev, 19921 and it is also surveyed in [Hamhalter, 2003, Chapter 61. In order to provide some insight we shall outline the arguments for finite Type 11factors, which have a geometry different from that of Hilbert space logics. Through this section let p be a completely additive measure on the projection lattice P ( M ) of a von Neumann algebra M . For p E P ( M ) let us denote by V(p) the variation V ( p ) = supqlP 1p(q)1. The following lemma says that a completely additive measure is bounded whenever it is uniformly bounded on some increasing sequence of hereditary subalgebras "covering" the whole algebra. LEMMA 26. Let p be a completely additive measure o n a won N e u m a n n algebra M . Suppose that there i s a constant C and a sequence of projections (9,) such that q, /" 1 and for all n . V(q,) 5 C T h e n p i s bounded o n P ( M ) . LEMMA 27. Let p be a n unbounded completely additive measure o n Type IIl factor M . T h e n there is a (hereditary) subfactor N of M such that the following condition i s satisfied: (10) If
I ~ ( P ) I > 1 for p E P ( M ) , then p
i s bounded o n P ( ( l - p ) M ( 1 - p ) ) .
Proof. If the property (10) is satisfied for M we are done. If not there is a projection pl with Ip(pl)J> 1 and such that p is unbounded on
If the pair (MI, p) satisfies the condition (10) the proof is again completed. If not we can find a projection p2 E MI with Ip(p2)1 > 1 and such that p is unbounded on Mz = ( 1 - p a ) M I ( 1 - p2). Continuing this way we either prove the lemma or construct a sequence of orthogonal projections (p,) such that for each n
But this contradicts the complete additivity of p.
Jan Hamhalter
310
LEMMA 28. Let p be a completely additive measure on a Type 111 factor M satisfying condition (10). Denote by r the canonical faithful normal trace on M. Then there is a constant K > 0 and 0 < 6 < 1 with the following property: If q E P ( M ) and r(q) 5 6, then V(q) 5 K.
Proof. Suppose to the contrary that the property asserted in the proposition does not hold. Then we can find a sequence (qn) of projections in N such that r(qn) 5 & and V(qn) > n for all n. Let us put
Employing the subadditivity of the trace r we have
So pn \ 0, since r is a faithful normal state. Obviously, p is unbounded on each hereditary subalgebra pn M p n of M. By the property (lo), for each n,
Since 1- pn
/" 1 we obtain that p is bounded by Proposition 26, which is absurd.
rn PROPOSITION 29. Any completely additive measure p on P(M), where M is a Type 111factor, is bounded.
Proof. As we have seen in the previous considerations, the existence of unbounded completely additive measure on Type 11 finite factor would imply the existence of a real unbounded measure, say p, on a Type 111factor M satisfying the property (10). Let 7 be a faithful normal tracial state on M. Let S > 0 and K > 0 be as described in Lemma 28. Take any projection p E M. As P ( M ) is not atomic we can decompose p into the sum p = EL1pi, where pi are projections with r(pi) 5 6. Moreover, it can be done in such a way that n 5 $ . Indeed, if n 5 the proof is complete. In the opposite case, at least one number among the collection PI ~ 2 r(p2 ) ~ ~ 3 ).,. . , ~ ( p +PI) n
g,
+
+
has to be less than 6, for otherwise by summing them we would obtain 2 2 2 r(p)2 n S - a contradiction with n > $. Therefore we can reduce the number of summands in the decomposition until the number of summands is less than $. This gives n
So p is bounded, which is a contradiction.
n
Quantum Structures and Operator Algebras
311
One of the most important principles of classical measure theory, known as the Nikodym Boundedness Theorem, says that if a system of a-additive measures on a a-algebra A of subsets of a nonempty set Q is pointwise bounded, then it is uniformly bounded (see e.g. [Dunford and Schwartz, 1988, Theorem IV 9.81). Based on the previous results we now present the noncommutative versions of the Nikodim Boundedness theorem that extends Theorem 25 from an individual measure to a collection of measures. be a collection of completely additive measures on THEOREM 30. Let the projection lattice of a v o n N e u m a n n algebra M such that
for each p E P(M). Assume that M does not contain a Type I2direct summand and finite dimensional direct summand. T h e n
Proof. By the boundedness principle and the Generalized Gleason theorem there is a system (fa) of normal functionals on M extending (p,). We will show that the system is pointwise bounded, i.e. that sup{l f,(x)l I a! E I) is finite for every x E M . To verify that it is sufficient to consider x E M with 0 5 x 5 1. Then x = h p , for a sequence of commuting projections (p,). The subalgebra A generated by (p,) is an abelian von Neumann algebra. By Nilsodim Boundedness theorem the system of measures (p,IP(A) ) is uniformly bounded. In other words, sup11f,(p,)l 1 a E I,n E N} = K < oo. It means that sup{l f,(x)ll a E I) 5 Cz=,$ K = K . By the Banach-Steinhaus Uniform Boundedness Principle the system (fa) is uniformly bounded. So there is a constant C > 0 with
En
11 fall
5 C for each a E I .
This yields sup{I~a(p)II P E P ( M ) , & E I) IC .
3.2 Compact sets of noncommutative vector measures Many basic tools of measure theory (in particular convergence theorems) are based on the study of sets of measures or functionals which are relatively compact in some natural convergence topology corresponding to the underlying linear structure. The noncommutative extension of this analysis, treated in this section, has contributed to the understanding of the linear topological structure of operator algebras and their dual spaces and made it possible to prove some noncommutative versions of important measure-theoretic results. In order to simplify the notation we will talk about linear functionals on o p erator algebras instead of measures on the projections lattices. There is no loss
312
Jan Hamhalter
of generality involved in this simplification because the vector-valued version of Gleason's theorem establishes the 1-1correspondence between completely additive measures on projections and weak*-continuous linear maps on von Neumann algebras. This correspondence preserves also compactness in the topology of pointwise convergence. Indeed, let M be a von Neumann algebra for which the Generalized Gleason theorem and Dorofeev's theorem hold. Let us denote by Bca(M,X ) the set of all bounded linear maps from M into a locally convex space X which are be a set of completely additive completely additive on P ( M ) . Let K = measures on P ( M ) with values in X which is relatively compact in the topology of pointwise convergence on P(M). Suppose that fi, : M -t X is a bounded linear extension of pa. We verify that K = (fi,),EI is a relatively compact subset of BCa(M,X), where the latter is endowed with the topology of pointwise converis a net converging gence on M. To show this, it is enough to assume that on P ( M ) to a completely additive measure ,u with the corresponding extension f i E Bc,(M,X). Fix f E X * . L e t u s p u t 4, = f ofi, and@, = i,IP(M). By Theorem 30, sup{ le9(P)I I p E P ( M ) , a E I} < oo. Let us fix x E M. Then f is bounded on the set K(x) = {T(x) I T E K). As a result, K(X) is weakly bounded and so bounded in X. Applying the Banach-Steinhaus Theorem, we obtain that K is equicontinuous on M. From the equicontinuity of and the fact that the linear span of P ( M ) is norm dense in M, it then follows that lim, p,(x) = p(x) for each x E M. Therefore K is weakly relatively compact. It is known in classical measure theory that compactness of measures is intimately connected with the concept of uniform a-additivity. It was proved by A.Akemann and M.Takesaki that the same holds for weakly compact sets of normal functionals on von Neumann algebras. A set K in the predual M, of a von f (pnl -t 0 whenever Neumann algebra M is called uniformly a-additive if S U P f E1~ p, \ 0 is a decreasing sequence of projections in M. It was proved in [Akemann, 19671 that K C M, is relatively compact in the weak topology if, and only if, K is bounded and uniformly a-additive. These results were also obtained for the duals of von Neumann algebras. They were inspired by the work of Grothendieck [Grothendieck, 19531 which implies that if M is an abelian von Neumann algebra, then a bounded set K c M* is weakly relatively compact if, and only if, it is uniformly a-additive on P(M). In another line of research Grothendieck's compactness criterion has been generalized to vector measures by W. H. Graves and W. Ruess [1980]. THEOREM 31 (Graves and Ruess). Let (0,A) be a a-algebra and ca(A, X ) be a set of all a-additive measures on A which have values in a locally convex space X. A set K c ca(A, X) is relatively compact in the topology of pointwise convergence on elements of A if, and only if, K is uniformly a-additive and {p(A) I p E K ) is relatively compact for each A E A. We now introduce a vector-valued generalization of preduals of von Neumann algebras. Let us continue to denote by Bca(M,X) the set of all linear maps
Quantum Structures and Operator Algebras
313
from a von Neumann algebra M to a (complex) locally convex space (X, 7)that are continuous with respect to the norm topology on M and the locally convex topology T on X and that restrict to completely additive X-valued measures on P(M). (By a completely additive map we mean a map T : M + X satisfying CaEIT(p,) = T(CffElp,) whenever (p,) is an orthogonal system of projections in P(M).) If dimX = 1, then Bca(M,X ) is precisely the predual of M equipped with the weak topology. For K C Bc,(M, X ) and x E M , we shall use the notation K(x) = {T(x) I T E K}. A set K c BCa(M,X) is said to be uniformly o-additive if for each neighbourhood U of 0 in X and each decreasing sequence of projections p, \ 0 in X there no. In other words, for any sequence of is no such that K(p,) C U for all n pairwise orthogonal projections (p,) in M and for any neighbourhood, U , of 0, in X , there is no such that Cz,>kT(p,) E U for all k no and all T E K . A combined extension of the vector-valued commutative result of Graves and Ruess and Akemann's noncommutative compactness criterion has been obtained i Hamhalter, to appear]. by E.Chetcuti and J.Hamhalter in [ ~ h e t c u tand
>
>
THEOREM 32. Let K be a subset of B,(M, X), where the latter is equipped with the topology of pointvise convergence on elements of M. Then K is relatively compact if, and only iJ K(x) is relatively compact for each x E M and K is uniformly a-additive. Relative compactness of sets of measures has another aspect - the existence of a control functional. The celebrated result of R. G. Bartle, N. Dunford and J. Schwartz [ ~ a r t l eet al., 19551 says that a set K in an L1-space is relatively compact in the weak topology exactly when K is absolutely uniformly continuous with respect to some positive measure. In order to discuss this result in the context of operators algebras we need to introduce some notions. Let X be a locally convex space and T be a completely additive linear map from a von Neumann algebra M into X . We say that T is absolutely continuous with respect to a normal positive functional I) on M (in symbols T << I)) if for every neighbourhood U of 0 in X < 6. there is a 6 > 0 such that T(p) E U whenever p is a projection in M with I)@) A set K of linear maps mapping M into a locally convex space X is said to be uniformly absolutely continuous with respect to a normal positive functional I) on M if for each neighbourhood U of 0 in X there is a 6 > 0 such that T p E U whenever T E K and p is a projection in M with I)(p) < 6. In the case of scalar functionals absolute continuity cp << p is known to be equivalent to the fact that every null set of p is a null set of cp. A similar result holds in general. PROPOSITION 33. Let I) be a positive normal functional and cp a normal functional on a von Neumann algebra M . The following conditions are equivalent: (ii) Ker I) n P ( M ) C Ker cp n P(M). (iii) For each E > 0 there is a 6 I ) ( x * x + x x * ) ~< 6.
> 0 such that
Icp(x)l
<E
whenever x E MI and
Jan Hamhalter
314
A variant of the equivalence between (i) and (iii) holds also for uniform absolute continuity. One of the remarkable results of noncommutative measure theory is Akemann's characterization of weakly compact sets in the preduals of von Neumann algebras. THEOREM 34 (Akemann). Let K be a bounded set in the predual of a von Neum a n n algebra M. K is relatively compact i i and only .if, K is uniformly absolutely continuous with respect to some positive normal state o n M. If M is abelian, then M, is isomorphic to a L1-space and the previous result reduces to the result of R. G . Bartle, N. Dunford and J. Schwartz [Bartle et al., 19551. As we will see soon the characterization of weak compactness of scalar functionals in terms of uniform a-additivity has a full vector-valued generalization. In contrast, Theorem 34 cannot be directly generalized to vector measures. In order to show this fact we need some additional notation. Let K C Bca(M,X ) and U be a convex, closed, circled neighbourhood of 0 in X. Then we put
where U0 is the polar of U (i.e. U0 = {f E X* I If (x)l 5 1 for all x E U)). If X is a normed space, we will simply write I? to denote KX,.The following two results may be found in [Chetcuti and Hamhalter, to appear]. THEOREM 35. The following conditions are equivalent for K
c Bca(M,X):
(i) K is uniformly a-additive and bounded. (ii)
kU i s
(iii)
Krr i s uniformly
bounded and uniformly a-additive for each closed, circled, convex neighbourhood U of 0. absolutely continuous with respect to some each closed, convex, circled neighbourhood U of 0.
E M$ for
Moreover, if X is metrizable, then we can add the following condition: (iv) K i s uniformly absolutely continuous with respect to some $ E M$. COROLLARY 36. If K c B,(M,X) is relatively compact in the topology of pointurise convergence o n elements of M, where X i s metrizable, then there i s $ E M, such that K is uniformly absolutely continuous with respect to $. The reverse implication in the foregoing theorem is not valid. Indeed, let M be a von Neumann algebra and H a Hilbert space of infinite dimension with the unit sphere Sl(H). Fix a normal state $ on M and define a collection of H-valued in the following way completely additive maps, K = (Tc)EES1(H),
It is clear that K is uniformly absolutely continuous with respect to $. However, if $(x) # 0, then K(x) = $(x) Sl(H) is not a compact subset of H. In view
Quantum Structures and Operator Algebras
315
of Theorem 31, this means that K is not relatively compact in the pointwise convergence topology. Akemann's characterization of weak compactness in terms of uniform a-additivity has the following interesting aspect. Since uniform aadditivity depends on decreasing (and so mutually commuting) projections, we see that the weak compactness is commutatively determined in the sense that a set K in the predual of a von Neumann algebra M is weakly relatively compact if, and only if, the restriction of K to any abelian von Neumann subalgebra of M is weakly relatively compact. For a long time after Akemann's result it had not been clear whether the same holds for duals of C*-algebras. This problem was settled affirmatively in a deep result due to H. Pfitzner [1994]. (Let us recall that positive elements x, y in a C*-algebra are called orthogonal if x y = 0.) THEOREM 37 (Pfitzner). Let A be a C*-algebra and K a bounded subset of the dual A* of A. Then K is weakly relatively compact iJ and only iJ limn,, supfEh-If (a,)l = 0 whenever (a,) is a sequence of mutually orthogonal self-adjoint elements in A. The previous result is a noncommutative version of Grothendieck's criterion of compactness for C(S1) spaces: A bounded set K in the dual of a commutative C*-algebra C(Q) is not weakly relatively compact if, and only if, there is a sequence of disjoint open sets (0,) such that K which does not converge uniformly to zero on (0,). In connection with Grothendieck's compactness criterion A. Pelczynski [Pelczynski, 19621 introduced and studied the so-called property (V). This definition, originally motivated by studying weakly compact operators, singles out those Banach spaces to which Grothendieck's compactness criterion can be applied. A series Enx, in a Banach space X is called weakly unconditionally Cauchy if EnIf (x,) 1 < oo for all functionah f E X*. A Banach space X has the property (V) if for any (bounded) set K c X* which is not compact in the weak topology there is a weakly unconditionally Cauchy sequence (x,) c X such that supf E~ If (x,)l does not converge to zero as n + oo. Equivalently, X has property (V) if, and only if, every weakly unconditionally converging operator defined on X is weakly compact. (An operator T : X --+ Y between Banach spaces is called weakly unconditionally converging if it sends weakly unconditionally Cauchy sequences in X to unconditionally converging series in Y. T is said to be weakly compact if T(XI) is a weakly compact set in Y.) As a consequence of Pfitzner's theorem we see that all C*-algebras have property (V). A Banach space X is said to have the Grothendieck property if each sequence (f,) in its dual X * which converges in the weak* topology converges also in the weak topology on X*. Since any dual space with property (V) enjoys the Grothendieck prop erty, an important corollary of Pfitzner's theorem says that any von Neumann algebra has the Grothendieck property. This is a striking result on the sequential topological structure of the duals of von Neumann algebras. (Before Pfitzner's theorem it had been known that weak and weak* convergence coincide for sequences of positive functionah [Akemann, 19671.) The fact that compactness is commutatively determined in the duals of operator algebras has an interesting
316
Jan Hamhalter
bearing on automatic compactness of certain Banach space-valued linear maps on operator algebras. It is a classic result of A.Pelczynski that a Banach space X has property (V) if, and only if, for any bounded operator T from X to a Banach space Y the following dichotomy holds: either T is weakly compact or there is a subspace Z of X isomorphic to Q such that T restricts to an isomorphism on Z. In particular, any bounded map from a C*-algebra to a Banach space not containing any copy of Q is automatically weakly compact. (Theorem IV.2 in [Akemann et al., 19721). It provides a more general explanation of the classic result of Grothendieck [Grothendieck, 19531 to the effect that any bounded linear map from the space C(K) into a weakly sequentially complete Banach space is automatically weakly compact. Another important aspect of weakly compact operators studied till today in the noncommutative context is the Dunford-Pettis property. A Banach space X is said to have the Dunford-Pettis property if for each Banach space Y each weakly compact operator from X to Y is completely continuous, that is, it carries weakly convergent sequences to norm convergent sequences. It was shown by Dunford and Pettis that L1-spaces have this property. A remarkable result of Grothendieck says that C(K)-spaces, alias commutative C*-algebras, enjoy this property too. Subsequent investigations of this phenomenon for general C*-algebras [Chu and Iochum, 1990; Hamana, 19771 discovered that a C*-algebra A has the Dunford-Pettis p r o p erty if, and only if, every irreducible representation of A is finite-dimensional. Moreover, it was proved that preduals of von Neumann algebras, alias noncommutative L1-spaces, have the Dunford-Pettis property if, and only if, the von Neumann algebras in question are finite Type I [ ~ u n c e1992; , Chu and Iochum, 1990; Hamana, 19771. The Dunford-Pettis property has the following equivalent form: A Banach space X has the Dunford-Pettis property if, and only if, whenever (x,) and (en) are weak null sequences in X and X*, respectively, then e,(x,) --+ 0. In [F'reedman, 19971 the secalled alternative Dunford-Pettis property was introduced: A Banach space X has the alternative Dunford-Pettis property if whenever a sequence x, + x weakly in X with IIxnll = 11x11 = 1, for all n, and (en) is a weak null sequence in X*, then e,(x,) + 0. This property is weaker than the Dunford-Pettis property. It was proved by L. J. Bunce and A. M. Peralta that the Dunford-Pettis property and the alternative Dunford-Pettis property are equivalent for all C*-algebras and that a von Neumann algebra is of Type I if, and only if, its predual has the alternative Dunford-Pettis property [Bunce and Peralta, 20021.
3.3 Noncommutative convergence theorems In this section we focus on various convergence theorems arising in noncommutative measure theory. A prominent convergence theorem in classical measure theory is the Vitali-Hahn-Saks Theorem. We will deal mainly with its completely additive version [ ~ u n f o r dand Schwartz, 19881. THEOREM 38 (Vitali-Hahn-Saks).
Let A be a complete algebra of subsets of
Quantum Structures and Operator Algebras
317
a set !2 and ca(A) the set of all (complex) completely additive measures o n A endowed with the topology of pointwise convergence on elements of A. Suppose that K C ca(A) is a relatively compact set such that every element of K i s absolutely continuous with respect to a positive completely additive measure p o n A. Then K i s uniformly absolutely continuous with respect to p.
Any functional p on a C*-algebra A can be decomposed canonically as p = ip3 - ip4, where p l , pz, ( ~ 3p , 4 are uniquely determined positive functional~such that p l and pz are orthogonal and p3 and cp4 are also orthogonal. We shall denote by [p]the sum pl pz p3 p3. Given a positive functional $, p is said to be strongly absolutely continuous with respect to $ if [p] is absolutely continuous with respect to $. The first noncommutative generalization of the Vitali-Hahn-Saks theorem was given by A. Aarnes [1966] and C. A. Akemann [I9671 t o the effect that a relatively weakly compact set K in the predual of a von Neumann algebra M is uniformly absolutely continuous with respect to a positive normal functional $ on M whenever each p E K is strongly absolutely continuous with respect to $. Since strong absolute continuity coincides with absolute continuity for abelian algebras, Aarnes's and Akemann's advances were a direct generalization of the classical Vitali-Hahn-Saks Theorem for positive measures. However, these two concepts are not equivalent in the noncommutative case no rooks et al., 20041. It was therefore not clear whether a direct generalization of Vitali-Hahn-Saks Theorem to absolute continuity of nonpositive measures could also be obtained. The answer has was given in the negative by E. Chetcuti and J. Hamhalter who provided the following counterexample [Chetcuti and Hamhalter, to appear]. p1 - p z
+
+ + +
EXAMPLE 39. Let (Jn)r=l be an orthonormal basis of a separable Hilbert space H . For any two unit vectors J and q in H , we write we,, to denote the linear functional on B(H) defined by wC,,(x) = (xJ, q) (x E B(H)). Let $ = C r = z +wendn. Consider the sequence ( W , C , , ~ , + ~We ) ~ prove = ~ . that this sequence is weakly convergent and pointwise absolutely continuous with respect to $ but that it fails to be uniformly absolutely continuous with respect to $. If $(e) = 0 for some projection e of B(H), then e must be the projection of H onto the span{Jl). Thus, w ~ ~ , ~ ~=+0 for ~ ( all e )lc and so w < , , ~ << ~ +$.~ For any x E B(H) we now have
i.e. the sequence ( ~ ~ , , ~ , + , )converges r=~ to 0 in the weak topology on B(H)*. However, we show that the sequence ( w ~ ~ , ~ ~ is+ not ~ ) ;uniformly P=~ absolutely kl) for n = 1,2, . . ., and continuous with respect to $. Indeed, let Cn = $(Jl let e, denote the projection of H onto the span of C,. We see that
+
1 1 @(en)= +w€n+l~€n+l(en) = 3 + 0 as n + 00. However, 'J€I,s~+I(en)
=
(en&, Jn+l) = (O, Cn)
(Cn, Jn+l)
Jan Hamhalter
In the previous example we have seen that Vitali-Hahn-Saks Theorem fails for a dominating functional $ the support of which is a projection of codimension one. Nevertheless, E. Chetcuti and J. Hamhalter showed [Chetcuti and Hamhalter, to appear] that a direct generaliiation of the Vitali-Hahn-Saks Theorem is possible to faithful control states and quite general vector-valued measures. THEOREM 40. Let M be a von Neumann algebra with a faithful normal state $ and X a locally convex space. Let K C B,,(M,X) be a relatively compact set in the topology of pointwise convergence o n elements of M. Then K is uniformly absolutely continuous with respect to $. The proof of this result is based on a new method which enables us to prove the Vitali-Hahn-Saks theorem for a wide range of positive Banach-space valued i measures and for nonassociative JBW algebras as well (for details see [ ~ h e t c u tand Hamhalter, to appear]). It is not know at present to what extent the Vitali-HahnSaks theorem holds for relative compact sets of nonpositive functionals in the duals of operator algebras. In measure theory, the Vitali-Hahn-Saks Theorem has been extended to finitely additive measures by J. K. Brooks and R. S. Jewett [1970]. This result is referred to as the BrooksJewett theorem. After a nice analysis of automatic uniform continuity of sets in the duals of C*-algebras carried out by J. K. Brooks, K. S%to and J . D. M. Wright in [2004], Brooks-Jewett theorem has been established for converging sequences of positive (not necessarily normal) functionals on monotone complete C*-algebras by J . K. Brooks and J. D. M. Wright in [2004]: THEOREM 41. Let (cp,) be a sequence of positive functionals in the dual of a von Neumann algebra M. Suppose that for each projection p E M the limit of cp,(p) for n t cr, exists. If each cp, i s absolutely continuous with respect to a positive functional $ on M, then the set {cp, I n = 1 , 2 . . .) is uniformly absolutely continuous with respect to $. Another deep convergence theorem is the following theorem of DieudonnC. THEOREM 42 (DieudonnC). Let K be a compact metric space. Let (p,) be a p,(U) exists for each open sequence of Borel measures on K such that limn,, subset U of K . Then there exists a Borel measure p o n K such that p,(f) + p ( f ) for each bounded Borel function f o n K. In order to generalize DieudonnC's result to operators we need some concepts from the theory of enveloping von Neumann algebras. In the sequel we shall always consider a given Banach space X to be embedded canonically into its second dual X**. Let C(K)be the commutative algebra of all continuous functions on a metrizable compact Hausdorff space K . The characteristic function of each Borel set acts continuously on the dual of C(K) and so (Riesz's theorem) it can be viewed as an element in the double dual of C(K). In this context, each open
Quantum Structures and Operator Algebras
319
subset 0 of K can be identiiied with the projection p in C(K)** which is a least upper bound of an increasing sequence (f,) of positive continuous functions which have their support in 0. This motivated the following definition. A projection p in the double dual A** of a C*-algebra A is called open if there is an increasing net of positive elements (a,) in A such that a, /" p. A projection in p in A** is called the range projection if it is a range projection of some positive element from A. Any range projection is open. The following noncommutative version of DieudonnC's theorem was proved by J. K. Brooks, K. Siiito and J. D. M. Wright [2003]. THEOREM 43. Let (cp,) be a sequence in the dual of a C*-algebra A such that, cpn(p) exists. Then there i s whenever p E A** i s a range projection, then limn,, cp,(x) a unique functional cp in the dual of A such that, for each x in A**, limn,, exists and equals cp(x). In the case of A being commutative (and thus isomorphic to C(K)) the previous theorem reduces to a strengthening of DieudonnC' s theorem. Pfitzner's compactness criterion plays an important role in the proof. Let us also remark that the generalization of Dieudonne's theorem to normal topological spaces and sequences of finitely additive regular measures has been established by J. K. Brooks and R. V. Chacon in [1980]. Another important principle in the theory of convergence of noncommutative measures is Egoroff's theorem. THEOREM 44 (Noncommutative Egoroff's Theorem). Let M be a von Neumann algebra. Suppose that $ i s a positive faithful normal functional o n M . Let (xn) be a sequence in M convergent to x in the strong operator topology. Then, for every projection p E M and any e > 0, there exist a projection q 5 p in M and a subsequence (xng) of (xn) such that $(p-q)<~
and
Il(x,,-x)q11+Oask-+co.
An interesting result obtained recently along this line concerns weak convergence of normal functionals. It is well known that an infinite dimensional von Neumann algebra M is far from being reflexive, its double dual is huge compared to M. Therefore bounded sequences of normal functionals do not have weakly convergent subsequences in general. Nevertheless, if we drop some small part of the algebra, then we do find a weakly convergent subsequence. The next theorem may be found in rooks and Wright, 20041. THEOREM 45 (Noncommutative Biting Lemma). Let M be a von Neumann algebra with a normal state $. Let (cp,) be a bounded sequence of normal functionals o n M . For each E > 0 there exists a projection p in M such that $(1 - p ) < E and a subsequence (cp,,) of (cp,) which converges weakly on the hereditary subalgebra PMP. This result was motivated by the Biting Lemma in measure theory which says that a given sequence of measures becomes uniformly absolutely continuous by
Jan Hamhalter
320
biting some small part of the measure space (see [~rooks,19801).
3.4 Nonwmmutative Radon-Nikodym theorems Noncommutative Radon-Nikodym theorems have caught a great deal of attention in the theory of von Neumann algebras. Many pillars of operator theory, including the celebrated Connes cocycle theorem, are of this type. All noncommutative versions of the Radon-Nikodym theorem are of the following form: if cp and w are states or weights on an operator algebra and if cp is small relative to w, then there is an operator h (the Radon-Nikodym derivative of cp relative to w) such that cp can be described in terms of w and h. Prototype results are Sakai-Radon-Nikodym theorems [~akai,19651: Suppose that w is a normal positive functional on a von Neumann algebra M and that cp is another normal positive functional such that cp 5 w. Then there are positive operators k, h E M such that, for each x E M,
The most fruitful Radon-Nikodym theorem seems to be that for unbounded measures with infinite values. The corresponding concept in operator theory is the notion of weight. A map cp : A+ + [0,oo] defined on the positive part of C*algebra A is called weight if for each x, y E A+ and X 2 0, the following conditions are satisfied:
(ii) cp(Xx) = Xcp(x). Given a weight cp we define A;
=
{a E A 1 ~ ( aa) *
A;
=
{a E A 1 ~ ( aa) * = 0)
A:
=
~f~~ c~
=
{ a ~ A +~l ( a <) oo) linear span of A: .
< oo)
Then A; and A: are left ideals in A and cp extends uniquely to a linear functional, usually denoted by cp, on Agn. A weight cp is called faithful if A t = (0). A weight cp is a trace if cp(x*x) = cp(xx*) for each x E A. To each weight cp on a C*-algebra A we can associate a Hilbert space HcPwhich is a completion of the quotient AT/At endowed with an inner product < a A t , b A t >= cp(b* a). Moreover, there is a *-representation ncPof A into B(H,) such that
+
+
< rcP(a)(x+ A t ) , y + A t >= cp(y* a x ) for all a E A and x, y E A;. This representation is nondegenerate if cp is lower semicontinuous. Suppose now that cp is a weight on a von Neumann algebra M.
Quantum Structures and Operator Algebras
321
A weight cp is called normal if it preserves monotone bounded limits of operators or, equivalently, if it is a sum of a collection of normal positive functionals on M . Further, cp is called semifinite if A r is weakly dense in M . If cp is normal and faithful, then its G.N.S. representation 7rp is normal and faithful. Fix now a faithful normal semifinite weight w on a von Neumann algebra M. The following facts follow from deep Tomita-Takesaki modular theory of von Neumann algebras. The conjugate linear map a --+ a* defined on M i n (Mi)* is a closable densely defined operator acting on H, and its closure, S, has the polar decomposition S = JA1l2 in which A is a (possibly unbounded) positive invertible operator acting on H,, J is a conjugate linear isometry acting on H,, J2= 1,and, for each t E W, J 7r, (M) J = 7r, (M)' AitG(M) A-it = xW(M).
(For details see e.g. [Kadison and Riigrose, 19861). This allows one to define the one-parameter modular automorphism group, (a:)tEw, of w by
The weight w is invariant with respect to a:. Denote further by M Wthe centralizer of w , i.e. the subalgebra MW= {x E M I a,W(x) = x for all t E W}. Let h be a positive self-adjoint operator (possibly unbounded) affiliated with Mu. For each E > 0 define the transformation, h,, of h as follows: h, = h ( l E h)-l . Now by putting
+
wh (x) = sup w ( h i / 2x h;j2)
,
€>O
we obtain another a:-invariant [1973] the converse:
weight on M. Pedersen and Takesaki proved in
THEOREM 46 (Pedersen-Takesaki Radon-Nikodym). Let M be a von Neumann algebra and w a faithful semijinite normal weight o n M with the modular group (u?)tEw. For each semijinite normal weight cp on M invariant with respect to there i s a unique (unbounded) positive operator h afiliated with M Wsuch that cp=Wh.
If the control measure w is a trace, then the modular group of w is trivial and so every normal semitinite weight cp satisfies conditions of the previous theorem. In particular, if a von Neumann algebra M admits a faithful normal semifinite trace r , then any normal positive functional cp on M is of the form cp(x) = r h . This e , Segal, 19531. result is due to H. Dye and I. Segal [ ~ ~1952; J. Tisher showed in [1979] that the Radon-Nikodym derivative should be expressed in terms of affiliated spectral measures rather than affiliated operators. It
322
Jan Hamhalter
allows one to formulate Pedersen-Takesaki Radon-Nikodym theorem for not neces sarily semifinite weights. We shall briefly discuss this approach. Let w be a faithful semifinite normal weight on M. Let E : B([O,oo]) + P ( M W )be a a-additive spectral measure on the algebra of Borel subsets of [0,oo]. For each x E M+, E induces a (positive) Borel measure, p,,,, on B([O, oo]) by
for each Borel set X putting
c [0,oo]. Another weight, WE,
can now be defined on M+ by
Tisher's result says that any normal weight cp on M invariant with respect to the modular group of w is of the form WE described above. Let us recall that Radon-Nikodym theorem is far from being true for general weights. The information on the mudular groups have to compensate noninvariance of general weight with respect the unitary group. Even Sakai's RadonNikodym theorem for linearly ordered functionals does not hold for weights. It was shown that if cp 5 w where cp is a normal semifinite weight and w is a faithful semifinite normal weight then $ = w(h h) with unique h provided that w is finite or majorized by semifinite normal trace; but that it need not hold in general [~edersenand Takesaki, 19731. An important Radon-Nikodym type principle frequently used in operator theory is the fact that if w is a positive functional on a C*-algebra A with the G.N.S. then the map h E (rw(A)+)i4 c p h E A; given by representation rW,
is an order preserving bijection between the positive part of the unit ball of the commutant rw(A)' and the set of positive functionals linearly dominated by w. This aspect has been developed by S. Gudder in the context of general *-algebras [Gudder, 1979bl. He described the position of two positive functionals on a *algebra in terms of their (abstract) G.N.S. representations which allowed him to obtain a quite general form of the Radon-Nikodym derivative.
3.5 Noncommutative Ly apunov theorems Another distinguished principle of classical measure theory and its applications is Lyapunov's theorem. THEOREM 47 (Lyapunov). If (R,A) is a measure space and p : A + Cn is a nonatomic vector-valued measure, then the range of p is convex and compact. The first noncommutative generalization of Lyapunov's theorem was obtained by N.Azarnia and J. D. M. Wright [1982]. After that C. A. Akemann and J. Anderson [I9911 established many variants of Lyapunov's theorem for von Neumann algebras in a nice and extensive treatment [Akemann and Anderson, 19911.
Quantum Structures and Operator Algebras
323
THEOREM 48 (Noncommutative Lyapunov Theorem). Let M be a von Neumann algebra which does not contain any nonzero minimal projection and let Q be a weald*-continuous linear map of M into (Cn. For each positive element a in the unit ball of M there is a projection p E M such that *(a) = Q(p). In particular, if M is nonatomic and does not contain any Type I2 direct summand, then according to Generalized Gleason's theorem the measure-theoretic form of Lyapunov's theorem follows: Any completely additive bounded measure on P ( M ) with values in a finite-dimensional space, where M is a nonatomic von Neumann algebra without Type Iz direct summand, has a compact convex range. If we drop the assumption that the range of 9 is finite-dimensional, the result is not valid even in the commutative case. However, if we assume that the map 9 is singular, then the principle holds for infinite-dimensional ranges as well. (Let us recall that a linear map 9 from a von Neumann algebra M into a normed space X is called singular i f f o 9 is a singular functional on M for each f E X*.) THEOREM 49 (Singular Lyapunov Theorem). Suppose that M is a a-finite algebra such that the centre of the finite part of M i s finite-dimensional and that X i s a normed linear space whose dual space is weak*-separable. If 9 is a singular linear map of M into X , then for each positive element a in the unit ball of M there is a projection p in M such that @(a) = Q(p). 4 NONCOMMUTATIVE PROPERTIES OF MEASURES
In the previous sections we saw that many properties of measures on classical measure spaces transfer to noncommutative case, although the proofs require essentially new ideas. In this part we shall focus on typically noncommutative results which have no analogy in standard measure theory. All the properties we are going to study have one common feature: they are automatically satisfied in the commutative case but they have surprisingly strong consequences in the noncommutative context.
1
Subadditivity and traces
Any positive (possibly unbounded) measure p on a a-algebra (a,A) is subadditive, i.e. p(A U B) 5 p(A) p(B), whenever A, B E A. Analogously, a measure p : P ( M ) -+ [0, oo] defined on the projection lattice of a von Neumann algebra M is called subadditive, if
+
In contrast to the classical case, a proper noncommutative measure is subadditive if, and only if, it enjoys the distinguished property of being invariant with respect to the unitary group. Moreover, it turns out that an improved version of Gleason's theorem holds for subadditive measures not requiring the exclusion of the central position of Type I z .
324
Jan Hamhalter
THEOREM 50. Let p be a subadditive state on P(M), where M is a von Neumann algebra. Then p extends uniquely to a tracial state on M . Let us recall that a positive measure p on the projection lattice P ( M ) is called semifinite if there is an increasing net of projections, (e,), such that e, /" 1 and p(e,) < OCJ for all a. The following result is a Gleason type theorem for positive subadditive measures with infinite values. THEOREM 51. Let p be a completely additive semifinite subadditive measure on the projection lattice of a von Neumann algebra M. T h e n p extends uniquely to a normal semifinite trace o n M. As a consequence, the previous theorems provide a lattice-theoretic characterization of the traces. They have been established (in the more general context of JBW algebras) by L. J. Bunce and J. Hamhalter in [1995]. Let us notice that there are many characterizations of traces - see e.g. [ ~ e t z 1981; , Petz and Zembnek, 19881. We conclude the section by stating a recent characterization of traces [Hamhalter, 20041 which concerns overall dispersion. Let p be a probability measure on the projection lattice P ( M ) . The overall dispersion, a(p), is defined as U(P) = SUP lib) - P ~ J ) ~ . PEP(M)
Let us observe that the overall dispersion is zero exactly when the measure is dispersion free. Given any nonzero positive finite measure p on P ( M ) we define the overall dispersion a(p) as that of the normalized measure - A measure ~ ( 1' ) p : P ( M ) + [0,oo] is said to have the minimal dispersion property if for each subalgebra N of M which is isomorphic to M3(@)and for which p is a finite and nonzero measure on P ( N ) , p has the smallest dispersion on P ( N ) among all states on P ( N ) . A measure p is said to be join-dense if for each nonzero projection e in P ( M ) there is a nonzero projection f 5 e such that p(f) < oo. The following characterization of traces has been obtained in [Hamhalter, 20041. THEOREM 52. Let M be a von Neumann algebra with zero abelian direct summand and without Type I2 direct summand. A semifinite normal weight p on M i s a trace if, and only if, pIP(M) i s join-dense and has the minimal dispersion property.
4.2
Lattice structure and a-additivity
The central topic of this paragraph is the relationship between a-additivity of noncommutative probability measures and their lattice-theoretic properties. The main property we consider, called today the Jauch-Piron property, was introduced by M. Jauch and C. Piron in the 60's in connection with the propositional calculus of quantum mechanics and the problem of hidden variables [Jauch and Piron, 1963; Jauch and Piron, 1969; Jauch, 19681. Let p be a state (i.e. a probability measure) on an orthomodular lattice, L. We say that p is a Jauch-Piron state if the following
Quantum Structures and Operator Algebras
325
condition holds: If p(a) = p(b) = 0 for a, b E L, then p(a V b) = 0. A physical motivation for introducing this concept was the folowing. The elements of L are interpreted as propositions (yes-no observables or experiments) on the quantum system in a state p. The value p(a), (a E L), represents the probability that the proposition a is true. The Jauch-Piron property now means: "if the proposition a is false and the proposition b is false then the proposition (a or b) is also false. From the probabilistic point of view, the Jauch-Piron property encodes the following largely adopted rule of Kolmogorovian probability theory: If two events A and B have zero probability, then the probability of occurring A or B is also zero. Another motivation for investigating Jauch-Piron states is purely mathematical. If e is a state on a von Neumann algebra M, then its left kernel L, = {x E M I e(x* x) = 0) is a norm closed left ideal of M . The natural question arises of what are the properties of states e for which L,flP(M) is a lattice ideal in the projection lattice P(M). Such states show a nice interplay with the projection lattice structure. Let us recall that a set I C P(M) is an ideal in P ( M ) if, for all projection p, q E P(M), the following conditions hold true: (i) p V q E I whenever p, q E I (ii) if p 5 q and q E I, then p E I. The condition (ii) is automatically satisfied for every set L, fl P ( M ) by the monotonicity. Hence, we see that the Jauch-Piron states are precisely the states that generate lattice ideals in the von Neumann projection lattices. If M is abelian then any state on M is obviously Jauch-Piron. The converse holds only if the nonabelian part of the algebra is finitedimensional. Let us remark that subadditive states treated in the previous part are obviously Jauch-Piron. A thorough analysis of continuity properties of Jauch-Piron states has been carried out by L. J. Bunce and J. Hamhalter in a series of papers [ ~ u n c e and Hamhalter, 1994; Bunce and Hamhalter, 1995; Bunce and Hamhalter, 1996; Bunce and Hamhalter, 2000; Hamhalter, 1993b], for a survey see [Hamhalter, 2003, Chapter lo]. This program has shown that there is a surprisingly strong interplay between the continuity property of Jauch-Piron states (nonsingularity, Kolmogorovian regularity), the type of the algebra in question, and the size of its centre. For example, it has been shown that any Jauch-Piron state on a factor is regular (i.e. its kernel has to be closed under countable unions of projections). As a starting point of our discussion, let us remark that Jauch-Piron state may be far from being a-additive. For example, any tracial state (and so any state on a commutative algebra) is Jauch-Piron, however any von Neumann algebra with infinite-dimensional centre admits a singular tracial state. From another point of view, any faithful state is Jauch-Piron without being necessarily a-additive. However, it turns out that a-additivity can be naturally described in terms of the Jauch-Piron property if we consider the collection of all transformed states. Let Q be a state on a von Neumann algebra M . Given a E M such that e(a* a) > 0, the transformed state, e,, is defined by
Let E, denote the norm closure of the set
{ea I @(a*a) # 0, a
E M). It can be
326
Jan Hamhalter
verified that E, is the set of all states whore, where h is a unit vector in the G.N.S. Hilbert space He (see e.g. [Kadison, 19621). From the point of view of physics, the transformed states correspond to manipulations with the system initially prepared in the state p. THEOREM 53. Let M be a v o n N e u m a n n algebra without a n abelian direct summand. A state p o n M is a-additive if, and only if, all states in Ee are JauchPiron. The previous result says that if the entire collection of states that can be approximated by the transformations of a given state p consists of Jauch-Piron states, then a-additivity of p follows automatically. The reversible dynamics of a closed quantum mechanical system is given by the group of unitary operators. On the other hand, when the system is coupled to an environment or subject to a measurement, its most general time evolution is irreversible, which means that it does not preserve all structural properties. Mathematically, it is given by a normal completely positive map. By Kraus's representation theorem [ ~ r a u s19831 , normal completely positive maps (called quantum operations) are in important cases direct sums of the transformations x -t a* x u considered above. In this light, we can slightly reformulate the preceding theorem by saying that a state p is a) Jauch-Piron for each suitable quantum operation additive if, and only if, ~ ( 7 . is 7. If p is a pure state, then every state in Ee is unitarily equivalent to p. Since the Jauch-Piron property is preserved by the unitary transforms we have the following corollary: COROLLARY 54. Let M be a v o n N e u m a n n algebra without nonzero abelian direct summand. A pure state p o n M i s a-additive iJ and only if, p k Jauch-Piron. Under certain circumstances this automatic continuity holds for factor states. (A factor state is a state whose image in the G.N.S. representation generates a factor.) For example if M is a properly infinite a-finite von Neumann algebra, then any factor Jauch-Piron state has to be a-additive (for more details see [Bunce and Hamhalter, 2000]). It is obvious from our discussion that a-additivity emerges when the given state has nice lattice-theoretic properties. Another striking result along this line tells us that all lattice homomorphisms are a-additive in the noncommutative case. THEOREM 55. Let T : M -+ N be a *-homomorphism between v o n N e u m a n n algebras, where M has zero abelian part. T h e n T i s a-additive if, and only iJ for all projections e, f E M, ~ ( Vef ) = ~ ( eV) ~ ( f .) As a result, a state p on an essentially noncommutative algebra is a-additive exactly when its G.N.S. representation is a lattice homomorphism. Let us mention a few open problems in this area. It is not known whether all factor Jauch-Piron states on properly infinite von Neumann algebras are a additive. A positive answer has been obtained only under the assumption of the
Quantum Structures and Operator Algebras
327
continuum hypothesis [ ~ u n c eand Hamhalter, 20001. Moreover, it follows from hitherto known results on the geometric structure of the Jauch-Piron state space that Jauch-Piron states are norm dense in the state space of any a-finite von Neumann algebra. Whether the same holds for all von Neumann algebras remains an open question. There are also Jordan versions of the above results based on the fact that a Jauch-Piron state on a J W algebra W extends usually to a Jauch-Piron state on a von Neumann algebra generated by W. This analysis may be found in [ ~ u n c e and Hamhalter, 19961. In summary, the requirement of a-additivity of a probability measure in a classical Kolmogorovian probability space (which is necessary e.g. for the onesided continuity of the distribution function) is an indispensable technical axiom that cannot be derived from the order structure of events. In contrast to this, in "proper" quantum measure theory one need not postulate a-additivity because it is already a consequence of natural lattice-theoretic axioms involving only finitely many operations in the projection lattice. In this respect the axiomatics of quantum theory may, paradoxically, seem to be simpler. ACKNOWLEDGMENT The work was supported by the research plan of the Ministry of Education of the Czech Republic No. 6840770010. Besides, the author acknowledges the support of the Grant Agency of the Czech Republic, Grant. no. 201/03/0544, "Noncommutative Measure Theory" and the support of the Alexander von Humboldt Foundation, Bonn, Germany. BIBLIOGRAPHY [Aarnes, 19661 J. F.Aarnes. The Vitali-Hahn-Saks Thwrem for von Neunzann algebras, Math. Scand. 1 8 , 87-92, 1966. [Aarnes, 19691 J. F.Aarnes. Physical states on a C8-algebra, Acta Math. 122, 161-172, 1969. [Aarnes, 19701 J. F. Aarnes. Quasi-states on CY-algebras,mans. Amer. Math. Soc., 149, 601625, 1970.
[Akemann, 19671 C. A. Akemann. The dual space of an operator algebra, mans. Amer. Math. SOC.126, 286-302, 1967. [Akemann et al., 19721 C. A. Akemann, P. G. Dodds and J. L. B. Gamlen. Weak compactness in the dual space of a CY-algebra,J. Fund. Anal. 10, 446-450, 1972. [Akemann and Anderson, 19911 C.A.Akemann and J.Anderson. Lyapunov Theorem for Operator Algebras, Memoirs of the Amer. Math. Soc., 458, 1991. [Amann, 19891 A. Amann. Jauch-Pimn states in W*-algebraic quantum mechanics, J.Math.Phys. 2 8 , ( l o ) , 2384-2389, 1989. [Araki, 19991 H. Araki. Mathematical T h w r y of Quantum Fields, International Series of Monographs on Physics, 101, Oxford University Press, 1999. [Azamia and Wright, 19821 N. Azamia and J. D. M. Wright. On the Lyapunoff-Knowles theorem, Quart. J. Math. Oxford Ser. ( 2 ) , 33, ( no. 131, 256-261, 1982. [Bhat, 19921 B. V. Rajarama Bhat. On a characterization of velocity maps in the space of observables, Pacific J. of Mathematics, Vol. 152, No. 1, 1-14, 1992.
328
Jan Hamhalter
[Bartle et al., 19551 R. G. Bartle, N. Dunford and J. Schwartz, Weak compactness of vector measures, Canad. J. Math. 7 , 289-305, 1955. [Birkhoff and von Neumann, 19361 G. Birkhoff and J. von Neumann. T h e logic of quantum mechanics, Annals of Mathematics 3 7 , 823-824, 1936. [Bratteli and Robinson, 19791 0. Bratteli and D. W. Robinson. Operator Algebras and Quantum Statistical mechanics, Springer Verlag, 1979. [Brooks, 19731 J. K. Brooks. Equicontinuow sets of measures and applications t o Vitali's integral convergence theorem and control measures, Adv. Math. 1 0 , 165-171, 1973. [Brooks, 19801 J. K. Brooks. O n a theorem of Dieudonnb, Adv. Math. 3 6 , 269-278, 1980. rooks and Chawn, 19801 J. K. Brooks and R. V. Chawn, Continuity and compactness of measures, Adv. Math. 3 7 , 16-26, 1980. [Brooks and Jewett, 19701 J. K. Brooks and R. S. Jewett. O n finitely additive vector measures, Proc. Natl. Acad. Sci. USA. 6 7 No. 3 , 1294-1298, 1970. [Brooks et al., 20021 J. K.Brooks, K. Sate, and J. D. M. Wright. A bounded sequence of normal functionals has a subsequence which w nearly weakly convergent, J. Math. Appl. 276, 160-167, 2002. r rooks et al., 20031 J . K. Brooks, K. SBito and J. D. M. Wright. Operator Algebras and a Theorem of Dieudon'e, Rend. Circ. Mat. Palermo, Sene 11, Tomo LII, 5-14, 2003. [Brooks and Wright, 20041 J. K. Brooks and J. D. M. Wright. Convergence i n the dual of a u-complete C*-algebra, J. Math. Appl. 2 9 4 , 141-146, 2004. [Brooks et al., 20041 J. K. Brooks, K. SaitB and J. D. M. Wright. W h e n absolute continuity on C*-algebras is uniform, Quart. J. Math. 5 5 , 3 1 4 0 , 2004. [ ~ u h a ~ i a20031 r, D. Buhagiar. O n weak states on the orthogonally closed subspaces of inner product space, Int. J. Theor. Phys., t o appear. [Buhagiar and Chetcuti, 20051 D. Buhagiar and E. Chetcuti. O n complete-wwmplete subspaces of an inner product space, Appl. math. 5 0 , no. 2, 103-114, 2005. [Bunce, 19921 L. J. Bunce. The Dunford-Pettis property i n the predual of a von Neumann algebra., Proc. Amer. math. Soc. 1 1 6 , 99-100, 1992. [ ~ u n c and e Hamhalter, 19941 L. J. Bunce and J. Hamhalter. Jauch-Pimn states o n von Neum a n n algebras, Math. Zeitschrift, 2 1 5 , 491-502, 1994. [Bunce and Hamhalter, 19951 L. J. Bunce and J. Hamhalter. Traces and subadditive measures on projections i n JBW-algebras and von Neumann algebras, Proc. Amer. Math. Soc. Vol. 1 2 3 , No.1, 157-160, 1995. [ ~ u n cand e Hamhalter, 19951 L. J. Bunce and J. Hamhalter. Countably additive homomorphisnw between von Neumann algebras, Proc. Amer. Math. Soc., 1 2 3 , 3 4 3 7 4 4 4 1 , 1995. [ ~ u n c and e Hamhalter, 19961 L. J. Bunce and J. Hamhalter. Extension of Jauch-Piron states o n Jordan algebras, Math. Proc. Camb. Phil. Soc., 1 8 9 , 279-286, 1996. [Bunce and Hamhalter, 2000] L. J. Bunce and J. Hamhalter. Jauch-Piron states and uadditivity, Reviews in Mathematical Physics, Vol. 1 2 , No. 6 , 767-777, 2000. [ ~ u n c and e Wright, 19851 L. J. Bunce and J. D. M. Wright. Quantum measures and states o n Jordan algebras, Commun. Math. Phys. 9 8 , 187-202, 1985. [ ~ u n c and e Wright, 19891 L. J. Bunce and J. D. M. Wright. Continuity and linear edensions of quantum measures o n Jordan operator algebras, Math. Scand. 6 4 , 300-306, 1989. [Bunce et al., 19851 L. J. Bunce, M. Navara, P. Pt& and J. D. M. Wright. Quantuna logics with Jauch-Piron states, Quarterly Journal of Oxford, ( 2 ) , 3 6 , 261-271, 1985. [Bunce and Peralta, 2002) L. J. Bunce and A. M. Peralta. T h e alternative Dunford-Pettis propertv i n C*-alqebras and von Neumann alqebras, Proc. Amer. Math. Soc. Vol. 1 3 1 , NU. 4, 1251-1255, 2002. [Bunce and Wright, 1992al L. J. Bunce and J. D. M. Wright: Complex measures on projections i n von Neunaann algebras, J. London Math. Soc. ( 2 ) , 4 6 , 269-279, 1992. [Bunce and Wright, 1992bl L. J. Bunce and J. D. M. Wright. The Mackey-Gleason problem, Bull. Amer. Math. Soc., Vol. 2 6 , Nu. 2, 288-293, 1992. [Bunce and Wright, 19931 L. J. Bunce and J. D. M. Wright: O n Dye's Ulwrem for Jordan operator algebras, Expo Math. 11, 91-95, 1993. [Bunce and Wright, 19941 L. J. Bunce and J. D. M. Wright. T h e Mackey-Gleason problem for vector measures on projections i n von Neumann algebras, J. London Math. Soc. ( 2 ) , 4 9 , 133-149, 1994. [Bunce and Wright, 19951 L. J. Bunce and J. D. M. Wright. Velocity maps i n von Neumann algebras, Pacific Journal of Mathematics, Vol. 1 7 0 , No. 2, 421-427, 1995.
Quantum Structures and Operator Algebras
329
[Bunce and Wright, 1996al L. J . Bunce and J . D. M. Wright. The quasi-linearity problem for C*-algebras, Pacific Journal o f Mathematics, Vol. 1 7 2 , No. 1, 41-47, 1996. [ ~ u n cand e Wright, 1996bl L. J . Bunce and J. D. M. Wright. Approximately additive states o n Q p e I C*-algebras, Quart. J . Math. Oxford, ( 2 ) , 47, 269-277, 1996. [Bunce and Wright, 1996~1L. J . Bunce and J . D. M. Wright. A topological characterization of linearity for quasi traces, Proc. Amer. Math. Soc. 1 2 4 , no. 8, 2377-2381, 1996. [Bunce et al., 19981 L. J . Bunce, K . S&ito and J . D. M. Wright. Completely additive measures o n von Neumann algebras., Expositiones Mathematicae, 16, 185-189, 1998. [Caruana, 19951 L. Caruana. John von Neumann's 'Impossibility Proof' in a historical perspective, Physics, Nuova Ser. 3 2 , No. 1, 109-124, 1995. [ ~ h e t c u tand i DvureEenskij, 20041 E. Chetcuti and A . Dvurdenskij. The ezktence of finitely additive states o n orthogonally closed subspaces of incomplete inner product spaces, Lett. Math. Phys. 6 7 , No.1, 75-80, 2004. [Chetcuti and DvureEenskij, 2003) E. Chetcuti and A. Dvureknskij. A finitely additive state criterion for the completeness of inner product spaces, Lett. Math. Phys. 6 4 , no. 3 , 221-227, 2003. [Chetcuti and Hamhalter, t o appear] E. Chetcuti and J . Hamhalter. Vitali-Hahn-Saks theorem for vector measures o n operators algebras, t o appear. [Christensen, 19821 E. Christensen. Measures o n projections and physical states, Cornmun. Math. Phys., 8 6 , 529-538, 1982. [Chu and Iochum, 19901 C h e h o Chu and B. Iochum. The Dunford Pettis property in C * algebra, Studii Mathematica 9 7 , ( I ) , 1990. [ ~ o n n e s19941 , A. Connes. Nonwmn~utativeGeometry, Academic Press, 1994. [ c o o k , 19781 T . A . Cook. The Nikody'nl-Hahn-Vitali-SaksT h w r e m for states i n quantum logics, i n ed. A.R.Marlow "Mathematical Foundations o f Quantum Theory", pp. 275-285. Acad. Press. London, 1978. [Cooke et al., 19851 R . Cooke, M. Keane and W . Moran. A n elementary proof of Gleason's theorem, Math. Proc. Carnb. Phil. Soc., 9 8 , 117-128, 1985. [Davidson, 19961 K . Davidson. C*-Algebras by Example, T h e Fields Institute for Research i n Mathematical Sciences, American Mathematical Society, Vol. 6 , 1996. [De Simone et al., 20021 A. A . De Simone, M. Navara and P. Ptzik. The Vitali-Hahn-Saks theorem for the product of quantum logics, Demonstration Math X X X V , No. 4 , 717-725, 2002. [Diestel, 19841 J . Diestel. Sequences and Series i n Banach Spaces, Springer-Verlag, 1984. [ ~ i e s t eand l Swart, 20021 J . Diestel and J . Swart. The Riesz Theorem, Handbook o f Measure Theory, Edited b y E.Pap, pp. 401-447. Elsevier Science, 2002. [Dixnier, 19771 J . Dixmier. C*-Algebras, North Holland, 1977. [Dijring,20051 A. Dijring: Kochen-Specker Theorem for von Neumann Algebras, International Journal o f Theoretical Physics, Vol. 4 4 , No. 2, 139-160, 2005. [Dorofeevand Sherstnev, 19901 S. Dorofeev and A . N. Sherstnev. Frame-type functions and their applications, Izv. vuzov matem., no. 4 , 23-29, 1990, ( i n Russian). [Dorofeev,19921 S. Dorofeev. O n the problem of boundedness of a signed measure on projections of a von Neumann algebra, J . Fund. Anal., 103, 209-216, 1992. [Dunford and Schwartz, 19881 N. Dunford and J . Schwartz. Linear Operators, Part I , Wiley Classic Library, 1988. [Dvureenskij, 19781 A. Dvureknskij. O n the convergence of signed measures, Math. Slovaca, 2 8 , 33-40, 1978. [Dvureknskij, 19931 A . Dvureknskij. Gleason's T h w r e m and Its Applications, Kluwer Academic Publishers, Dordrecht, Boston, London, 1993. [Dvureknskij, 19951 A. Dvureknskij. Frame functions and completeness of inner product spaces, Ann. Inst. Henri PoincarB, Vol. 6 2 , 429438, 1995. [Dvureknskij, 1996al A. DvureEenskij. A note o n the Nikody'm boundedness theorem, Tatra Mountains Math. Publ., 8 , 231-240, 1996. [Dvur-nskij, 1996bl A. DvureEenskij. Remarks o n Nikody'm boundedness theorem, Novi Sad J.Math.,Vol. 2 6 , No. 1,25-51, 1996. [ ~ ~19521 e , H. A . Dye. The Radon-Nikodym theorem for finite rings of operators, Trans. Amer. Math. Soc. 7 2 , 243-280, 1952. [Emch, 19721 G. E. Emch. Algebraic Methods i n Statistical Mechanics and Quantum Field Theory, New York, Wiley, 1972.
330
Jan Hamhalter
[Reedman, 19971 W. Reedman. A n alternative Dunford-Pettis property, Studia Mathematica, 125, 143-159, 1997. [Gell-Mann and Hartle, 1990a] M. Gell-Mann and J. Hartle. Quantunz mechanics i n the light of quantum cosmology, Volume VIII, Complexity, Entropy and the Physics of Information, pp. 425458. SF1 Studies in the Science of Complexity, Addison-Wesley, Reading, 1990. [Gell-Mann and Hartle, 1990bl M. Gell-Mann and J. Hartle. Alternative dewhering histories in quantum mechanics, Proc. 25th Int. Conf. on High Energy Physics, August, 2-8, (1990), World Scientific, Singapore, 1990. [Gleason, 19571 A. M. Gleason. Measures on the closed subspaces of a Hilbert space, Journal of Mathematics and Mechanics, Vol. 6, No. 6, 885-893, 1957. [Graves and Reuss, 1980) W. H. Graves and W. Ruess. Compactness i n spaces of vector-valued measures and a natural topology for spaces of bounded measurable functions, Contemp. Math. 2, 189-203, 1980. [Grothendieck, 19531 A. Grothendieck. Sur les applications lindaira faiblenaent compactes d'espaces du type C ( K ) , Canadian J. Math. 5, 129-173, 1953. [Gudder, 1979a] S. P. Gudder. Stochastic Methods i n Quantunz Mechanics, Elsevier, North Holland, 1979. [Gudder, 1979b] S. P. Gudder. A Radon-Nikodynz theorem for *-algebras, Pacific Journal of Mathematics, Vol. 80, No. 1, 141-149, 1979. [Gunson, 19721 J. Gunson. Physical states on quantum logics I, Ann. Inst. Henri Poincar6, Vol. XVII,No. 4, 295-311, 1972. [Haag, 19921 R. Haag. Local Quantunz Physics, Fields, Particles, Algebras, Texts and Monographs in Physics, Springer Verlag, 1992. [Hamana, 19771 M. Hamana. O n linear topological properties of some C*-algebras, Tohoku Math. Journ. 29, 157-163, 1977. [Hamhalter and P t i k , 19871 J. Hamhalter and P. Ptik. A completeness criterion for inner product spaces, Bull. London Math. Soc. 19, 259-263, 1987. [Hamhalter, 19921 J. Hamhalter. Additivity of vector Gleason measures, Int. J. Theor. Physics, 31, No. 1, 1-13, 1992. [Hamhalter, 1993a] J. Hamhalter. Centrally detemzined states on von Neumann algebras, Mathematica Bohemica, Vol. 117, No. 2, 1889-1892, 1993. [Hamhalter, 1993bj J. Hamhalter. Pure Jauch-Piron states on von Neumann algebras, Ann. Inst. H.Poincar6, Phys. T h b r . 58, 173-187, 1993. [Hamhalter, 19941 J. Hamhalter. Gleason property and eztensions of states on projection logics, Bull London Math. Soc. 26, 367-372, 1994. [Hamhalter, 1997a] J. Hamhater. The Nikody'm Boundedness Theorem, Tatra Mountains Math. Publ. 1 0 , 179-181, 1997. [Hamhalter, 1997b] J. Hamhalter. Statistical independence of operator algebras, Ann. Inst. Henri Poincar6 , Vol. 67, no. 4, 447-462, 1997. [Hamhalter, 1999a] J. Hamhalter. Universal state space embeddability of Jordan-Banach algebras, Proc. Amer. Math. Soc., Vol. 127, Num 1, 131-137, 1999. [Hamhalter, 1999b1 J. Hamhalter. Supporting sequences of pure states on J B algebras, Studia Mathematica 136, (I), 3 7 4 7 , 1999. [Hamhalter, 2002aj J. Hamhalter. Multiplicativity of eztremal positive maps on abelian parts of operator algebras, J. Operator Theory, 4 8 369-383, 2002. [Hamhalter, 2002bl J. Hamhalter. C*-independence and W*-independence of von Neumann algebras, Mathematische Nachrichten, 2 3 4 2 4 0 , 146-156, 2002. [Hamhalter, 2002~1J. Hamhalter. Nonwmmutative phenomena in measure theory on operator algebras, findiconti DelllUniversita Di Trieste, Nuova Serie, Rend. Inst. Mat. Univ. 'Ikieste Vol. XXXIV, 19-43, 2002. [Hamhalter, 20031 J. Hamhalter. Quantum Measure Theory, Kluwer Academic Publishers, Dordrecht, Boston, London, 2003. [Hamhalter, 20041 J. Hamhalter. Traces, dispersions of states and hidden variables, Foundations of Physics, Letters, Bol. 17, Nu. 6, 581-597, Issue 10, 2101-2111, 2004. [Hamhalter, 20051 J . Hamhalter. States o n Operator Algebras and Axionaatic System of Quant u m Theory, International Journal of Theoretical Physics, Vol. 44, No. 11, 1941-1954, 2005. [Hanche-Olsen and Stormer, 19841 H. Hanche-Olsen and E. Stormer. Jordan Operator Algebras, Pitman Publishing, Boston, London, Melbourne, 1984.
Quantum Structures and Operator Algebras
331
[Isham, 19941 C. J. Isham. Quantum logic and histories approach to quantum theory, J.Math.Phys. 35, (5), 1994. [Isham et al., 19941 C. I. Isham, N. Linden and S. Schreckenberg. The classification of decoherence functionals: A n analog of Gleason's theorem, J. Math. Phys. 35, (12), 1994. [Isham and Linden, 1997) C. I. Isham and N. Linden. Infornzation entropy and the space of decoherence functions i n generalized quantum theory, Physical Review A, Vol. 55, Nu. 6, 4030-4040, 1997. [Jauch and Piron, 19631 M. Jauch and C. Piron. Can hidden variables be excluded i n quantum mechanics ?, Helvetica Physica Acta, 36, 827-837, 1963. [Jauch and Piron, 19691 M. Jauch and C. Piron. O n the structure of quantum proposition systems, Helv. Phys. Acta 42, 827-837, 1969. [Jauch, 19681 M. Jauch. Foundations of Quantum Mechanics, Reading, MA, Addison-Wesley, 1968. [Kadison, 19551 R. V. Kadison. O n the additivity of the trace i n finite factors, Proc. Nat. Acad. Sci. U.S.A. 41, 385-387, 1955. [Kadison, 19621 R. V. Kadison. States and representations, Trans. Amer. math. Soc. 103, 304319, 1962. [Kadison and Ringrose, 19861 R. V. Kadison and J. R. Ringrose. Fundamentals of the Theory of Operator Algebras, Academic Press, Vol. I, 11, 111, IV,1986. [Kalmbach, 19831 G. Kalmbach. Orthomodular lattices, Academic Press, Inc., 1983. [Kochen and Specker, 19671 S. Kochen and E. P. Specker. The problem of hidden variables i n quantum mechanics, J. Math. Mech. 17, 59-87, 1967. [Kraus, 19831 K. Kraus . States, Effects and Operations: Fundamental Notions of Quantum Theory, Ledure Notes in Physics, Vol. 190, Berlin, Springer-Verlag, 1983. [Mackey, 19631 G. W. Mackey. The Mathematical Foundations of Quantum Mechanics, New York, Benjamin, 1963. [Maeda, 199O] S. Maeda. Probability measures o n projections i n von Neumann algebras, Reviews in Mathematical Physics, 1,235-290, 1990. [Matvejchuk, 1997a1 M. Matvejchuk. Semiwnstant measures o n hyperbolic logics, Proc. Amer. Math. Soc., Vol. 125, Nu 1, 245-250, 1997. [Matvejchuk, 1997b] M. Matvejchuk. Gleason's theorem i n space with indefinite metric, Math. Nachr. 184, 229-243, 1997. [Matvejchuk, 19811 M. Matvejchuk. Description of finite measures in semifinite algebras, Vol. 15, 41-53, 1981. [ ~ a t v e j c h u k1998a1 , M. Matvejchuk. Several methods for solving the Gleason problem, Measures on Projections and Orthomodular Posets, Kazan Mathematical Society, 14-37, 1998. [Matvejchuk, 1998bl M. Matvejchuk. Probability measures i n W * J-algebras i n Hilbert spaces with conjugation, Proc. Amer. Math. Soc. Vol. 126, Nu. 4, 1115-1164, 1998. [, ] A.Mayet-Ippolito: Generalized orthomodular posets, Demonstration Mathematica, Vol. XXIV, NO. 1-2, (1991), 263-274. [Mermin, 19931 N. D. Mermin. Hidden variables and two theorems of John Bell, Rev. Mod. Phys. 65, 803-815, 1993. [Misra, 19671 B. Misra. When can hidden variables be excluded i n quantum mechanics?, Nuovo Cimento 47A, 841-859, 1967. [Murphy, 19901 G. J. Murphy. C*-algebras and Operator theory, Academic Press, Inc., 1990. [Murray and von Neumann, 19361 F. J. Murray and J. von Neumann: O n rings of operators, Ann. Math., Vol. 37, 116-229, 1936. [Mushtari, 19891 D. Mushtari. Logics of projectors i n Banach spaces, Izv. Vysch. Uchebn., Zaved. Mat., Vol. 33, No. 8, 44-52, 1989. [Navara, 19881 M. Navara. Quantum logics with the Radon Nikodym property, Order 4,387-395, 1988. [von Neurnann, 19551 J. von Neumann. Mathematical Foundations of Quantum Mechanics, Princeton, New Jersey: Princeton Univ. Press, 1955. [Nishirnura, 19841 H. N i s h i i a . A Boolean-valued approach to Gleason's theorem, Institute of Mathematics, University of Tskuba, Ibaraki, Japan, 1984. [Parthasarathy, 19921 K. R. Parthasarathy. A n Introduction to Quantuna Stochastic Calculus, Birkhauser Verlag, Basel, 1992. [Paszkiewicz, 19851 A. Paszkiewicz. Measures o n projections in W*-factors, J. Fund. Anal. 62, 87-117, 1985.
332
Jan Hamhalter
[Pfitzner, 19941 H. Pfitzner. Weak compactness in the dual of a C*-algebra is determined commutatively, Math. Ann. 298, 349-371, 1994. [~edersenand Takesaki, 1973) G. K. Pedersen and M. Takesaki. The Radon-Nikodym theorem for von Neumann algebras, A d a Math. 130, 53-87, 1973. [Pedersen, 19791 G. K. Pedersen. C*-Algebras and their Automorphisms Group, New York, London, Academic Press, 1979. [Pelczynski, 19621 A. Pelczynski. Banach spaces on which every unconditionally converging operator is weakly compact, Bull. Acad. Polon. Sci. Ser. Sci. Math. Astronom Phys. 10, 641-648, 1962. [ ~ e r e s 19911 , A. Peres. Two simple proofs of Kocher-Specker theorem, J. Phys. Math. Rev. Gen. A 24, 175-178, 1991. [Peres, 19951 A. Peres. Quantum Theory, Concepts and Methods,, Kluwer Academic Publishers, Dordrecht, 1995. [ ~ e t z19811 , D. Petz. A characterization of the canonical centre-valued trace in finite von Neunzann algebras, J. London. Math. Soc. 2, 329-331, 1981. [Petz and Z e d n e k , 19881 D. Pets and J. Zemdnek. Characterization of the trace, Linear Algebra and its Applications, 111,43-52, 1988. [Piron, 19641 C. Piron. Axiomatique quantique, Helv. Phys. Acta 37, 439-468, 1964. iron, 19681 C. Piron. Foundations of Quantum Mechanics, Addison-Wesley Publishing Company, Reading, Massachusetts, 1968. [pitowski, 19981 I. Pitowski. Infinite and finite Gleason's theorems and the logic of indeternzinacy, J. Math. Phys. 39, 1998, 218-228. [Plymen, 19681 R. J. Plymen. Dispersion free normal states, I1 Nuovo Cimento, Vol. LIV A, N. 4, , 862-870, 1968. [Ptik and Pulmannovd, 19911 P. Pt& and S. Pulmannovd. Orthomodular Structures as Quantum Logics, Academic Publishers, Dordrecht, (Boston), London, 1991. [Pt&, 19851 P. Ptdk. On extensions of states on logics, Bull. Polish Acad. Sci. Math. 33, 493497, 1985. [Redei, 19981 M. Redei. Quantum Logic in Algebraic Approach, Kluwer Academic Publishers, Fundamental Theories of Physics, Dordrecht, Boston, London, 1998. [ ~ u d ~and i ~ Wright, h 19981 0. Rudolph and J. D. M. Wright. The multi-form generalized Gleason theorem, Commun. Math. Phys. 198, 705-709, 1998. [ ~ u d o l and ~ h Wright, 19991 0. Rudolph and J. D. M. Wright. Homogeneous dewherence functionals i n standard and history quantum mechanics, Commun. Math. Phys. 204, 249-267, 1999. [Rudolph, 20001 0. Rudolph. The representation theory of dewherence fvnctionals in history quantum theories, International Journal of Theoretical Physics, Vol. 39, No. 3, 871-884, 2000. [Rudolph and Wright, 20001 0. Rudolph and J. D. M. Wright. On unentangled Gleason theorems for quantum information theory, Letters in Mathematical Physics, 52, 239-245, 2000. [Riitimann, 19971 G. Riitimann. Jauch-Piron states, J. Math. Phys. 18 (2), 189-193, 1997. [Sakai, 19711 S. Sakai. C*-algebras and W*-algebras, Ergebnisse der Mathematik 60, SpringerVerlag, Berlin, Heidelberg, New York, 1971. [Sakai, 19651 S. Sakai. A Radon-Nikodyrn theorem in W*-algebras, Bull. Amer. Math. Soc. 71, 149-151, 1965. [Sakai, 19911 S. Sakai. Operator Algebras in Dynantical Systems, Encyklopedia of Mathematics and its application 41, Cambridge University Press, 1991. [Segal, 19531 I. E. Segal. A non-commutative extension of abstract integration, Ann. Math. 57, 401-457, 1953. [Stolyarov, 19921 A. I. Stolyarov and 0. E. Tikhonov. On a characterization of traces in terms of the non-wmnzutative integration, VINITI, 1,3186-B96, 1992. (in Russian). [Stratilla and Zsido, 19791 S. Stratilla and L. Zsido. Lectures on von Neuntann Algebras, Tunbridge Wells: Abacus Press, 1979. [~akesaki,19791 M. Takesaki. Theory of Operator Algebras I, Berlin, Heidelberg, New York, Springer, 1979. [~akesaki,20021 M. Takesaki. Theory of Operator Algebras II, III, Berlin, Heidelberg, New York, Springer, 2002. ishe her, 19821 J. Tisher. Gleason's Theorem for '&pe I uon Neunzann algebras, Pacific J. Math. 100, 273-288, 1982.
Quantum Structures and Operator Algebras
333
[Tisher, 19791 J. Tisher. A note on the Radon-Nikodym theorem of Pedersen and Takesaki, A d a Sci. Math (Szeged), 41, no. 3-4, 411-418, 1979. [Topping, 19651 D. Topping. Jordan Algebras of Self-Adjoint Operators, Memoirs of the Amer. Math. Soc., 53, 1965. [Varadarajan, 19681 V. S. Varadarajan. Geometry of Quantum Theory, Vol. I , Van Nostrand, Princeton, 1968. [Wallach, 20021 N. R. Wallach. An unentangled Gleason's theorem, Contemporary Mathematics, Vol. 305, 291-298, 2002. [Wilbur, 19751 W. J. Wilbur. Quantum logic and locally convez spaces, Transactions of the American Mathematical Society, 207, 343-360, 1975. [Wilbur, 19771 W. J. Wilbur. O n characterizing the standard quantum logics, Transactions of the American Mathematical Society, 233, 265-282, 1977. right, 19951 J. D. M. Wright. The structure of dewherence functionals for von Neumann quantum histories, J . Math. Phys. 36, (lo), 5409-5431, 1995. [Wright, 19981 J. D. M. Wright. Dewherence functionals for von Neumann quantum histories: Boundedness and countable additivity, Comrnun. Math. Phys. 191, 493-500, 1998. [Yeadon, 19831 F. J. Yeadon. Measures on projections i n W *-algebras of Type 1 1 1 , Bull. London Math. Soc. 15, 139-145, 1983. [Yeadon, 19841 F. J. Yeadon. Finitely additive measures on projections i n finite W*-algebras, Bull. London Math. Soc., 16, 145-150, 1984.
This page intentionally left blank
HANDBOOK O F QUANTUM LOGIC AND QUANTUM STRUCTURES: QUANTUM STRUCTURES Edited by K. Engesser, D. M. Gabbay and D. Lehmann O 2007 Elsevier B.V. All rights reserved
335
CONSTRUCTIONS OF QUANTUM STRUCTURES Mirko Navara
1 INTRODUCTION
By quantum structures we mean systems of events modelling abstract quantum mechanical experiments. They are equipped with the corresponding relations and operations derived from their interpretation. Depending on the assumptions, we obtain different levels of generality, from orthomodular lattices and orthomodular posets to orthoalgebras and effect algebras. We use the term quantum structure for any of these, depending on the context (which will always be specified). We describe common features of these structures, as well as their particular properties. We leave the possible interpretations to physicists; they should choose an adequate model which describes optimally the real systems of quantum mechanics. Here we study the mathematical properties which might decide the adequacy of particular models. This chapter is devoted to constructions of quantum structures. Particular attention is paid to pastings which seem to be special and typical of this field and which make it quite different from the theory of Boolean algebras or MV-algebras. They are essential for generating examples which disprove various conjectures. Beside this, they also contributed numerous positive results showing what is possible in this area. No rich mathematical theory can emerge without such constructions. The contemporary techniques have not been published together and in a unified form so far. This is the main aim of this chapter. Besides, we enrich it by several tools that have not been published yet. i j PulmannovB, 20001 or Our notation mostly follows that of [ ~ v u r e ~ e n s kand [Ptik and Pulmannovi, 19911. 2 QUANTUM STRUCTURES Here we define the basic structures treated in this chapter and we clarify their mutual relations. Although the most general quantum structures studied here are effect algebras, we often restrict our attention to orthoalgebras which seem to be easier to understand. More specific quantum structures, orthomodular posets and lattices, are introduced as special types of orthoalgebras. For the
Mirko Navara
336
standard approach to orthomodular posets and lattices, we refer to [Beltrametti and Cassinelli, 1981; Beran, 1984; Kalmbach, 1983; P t B and PulmannovA, 1991; Varadarajan, 19681.
2.1
Efect algebras and orthoalgebras
DEFINITION 1. An effect algebra (EA) is a quadruplet (L, @, 0, I ) , where L is a set, 0 , l E L, and @ : L2 + L is a partial binary operation (orthosum) satisfying the following properties for all a, b, c E L:
(EA3)
For each a E L, there is exactly one d E L such that a @ d = 1.
(EA4)
a @ 1is defined iff a = 0.
An orthoalgebra (OA) is an effect algebra satisfying the following strengthening of (EA4): (OA)
a @ a is defined iff a = 0.
REMARK 2. When we use partial operations (incl. @) in expressions, we a u t e matically assume their existence. Thus (EA1) and (EA2) should be understood as follows: If one side of the equality exists, then the other exists, too, and both sides are equal. Sometimes we speak briefly of an effect algebra L instead of (L, @, 0 , l ) . When there is a risk of confusion, we index the operations by the corresponding algebra, e.g., @L, OL, 1 ~ . EXAMPLE 3. Every Boolean algebra becomes an orthoalgebra if we define the orthosum by a @ b = a V b whenever a A b = 0. EXAMPLE 4. Let us take L = (0, a, 1) and define a @ a = 1,x @ 0 = x for all x 1: L. Then (L, @, 0 , l ) is an effect algebra which is not an orthoalgebra. EXAMPLE 5 . . Let H be a Hilbert space. We denote by 0 the zero operator and by 1the identity on H. Let & ( H )be the set of all self-adjoint operators Q on H such that 0 5 Q 5 1 and let P ( H ) C &(H) be the set of all projectors on H, i.e., P ( H ) = {P E &(H) I P2 = P). If P, Q E E(H), we define P @Q = P Q if P Q 5 1 . Then (&(H),@, 0 , l ) and (P(H),@, 0 , l ) are effect algebras; (P(H), @, 0 , l ) is also an orthoalgebra.
+
+
EXAMPLE 6. Let (R, +, .,0 , l ) be a ring with unity and let I(R) be the set of all its idempotents. Let us define a @ b iff a - b = b . a = 0, in this case we put a @ b = a + b. Then (I(R), @, 0 , l ) becomes an orthoalgebra.
Constructions of Quantum Structures
337
DEFINITION 7. For a poset (P, 5 ) and a, b E P , a 5 b, we define the interval P[a, b] = {c E P I a 5 c 5 b). An element a of a bounded poset (P,<,0,1) is called an atom if P [ O , a] = (0, a). The set of all atoms of a poset P is denoted by A(P). EXAMPLE 8. Let (G, 0) be a partially ordered Abelian group, G+ its positive cone, and u E G+ \ (0). On the interval G+[O,u], we define a @b = a + b whenever a+b 5 u. Then (G+[O,u], @, 0, u) is an effect algebra. EAs originated this way are called interval effect algebras [~ouliset al., 19941. An important particular case is obtained if we take the group ZT, where Z is the group of integers, r E N, with the standard positive cone (z+)' and u = (nl,. . . ,n,) E (Z+)'. Then the effect algebra ((Z+)T[0,u], @, 0, u) is called a ~ectangulartreillis (abbr. RT, see [Foulis et al., 19941). It is a distributive lattice, the direct product of r chains, the ith chain having ni 1 elements. It can be equipped with the structure of an MV-algebra (MVA) using a total operation extending @, see [Cignoli et al., 19991. We do not deal with MV-algebras more in this chapter; for more details, we refer to [cignoli et al., 19991. Rectangular treillis play an essential role in the description of finite effect algebras.
+,
+
-
Analogously to the usual addition, we use the following notation for an element aofanEAandn~N: [email protected]@a n times
provided that the right-hand side exists. The maximal n E N for which na exists . na exists for all n E M, is called the isotropic index of a and denoted by ~ ( a ) If ) 1. As a we define ~ ( a = ) oo. A nonzero element a is called isotropic if ~ ( a > consequence of (OA), an effect algebra is an orthoalgebra iff it csntains no isotropic elements.
2.2
Quantum structures as posets
For an effect algebra (L, @, 0 , l ) and a, b E L, we define (Ord)
a 5 b iff there is an element c E L such that b = a @ c.
Then 5 is a partial order inducing partial lattice operations A, V on L. By an atom of an effect algebra we mean an atom of the corresponding poset. DEFINITION 9. If an effect algebra is a lattice w.r.t. the ordering defined by (Ord), it is called a lattice effect algebra (LEA). An effect algebra is called chainfinite if all chains of the corresponding poset are finite. We define a unary operation ': L 4 L assigning to each a E L the unique element d = a' satisfying (OA3). It is called the orthosupplement. REMARK 10. In early papers on effect algebras the orthosupplement was called the orthocomplement. This term is historically used for orthoalgebras and more
Mirko Navara
338
specific structures. The different term "orthosupplement" emphasizes the fact that some properties typical for orthocomplements are lost in effect algebras. If L is an orthoalgebra, the ordering and the orthosupplementation induce the structure of an orthoposet, defined as follows: DEFINITION 11. [ ~ e r a n1984; , Kalmbach, 19831 An orthoposet (OP) is a pentuplet (L, 0,1, '), where (L, <, 0 , l ) is a bounded poset and ': L + L is an operation satisfying the following conditions for all a, b E L:
s,
(OP2)
If a 5 b, then b' 5 a'.
(OP3)
If b 5 a and b 5 a', then b = 0.
If an orthoposet is a lattice, it is called an ortholattice (OL). Using the convention of Rem. 2, condition (OP3) may be written as a A a' = 0.
Figure 1. The lattice "benzene ring" EXAMPLE 12. The bounded lattice (L, s , 0 , 1 ) displayed by the Hasse diagram , can be considered an ortholattice. For in Fig. 1 (the "benzene ring" [ ~ e r a n19841) this, is suffices to define a' = d, b' = c (the remaining operations are obvious). Every orthoalgebra is an orthoposet (with the ordering and orthosupplementation defined above). The reverse implication does not hold: EXAMPLE 13. The lattice (L, 5 , 0 , 1 ) from Ex. 12 cannot be equipped with the structure of an orthoalgebra. To prove this statement, assume that it admits an orthosum @. As a c, there must be an x E L such that c = a @ x. As x 5 c, the only candidates are 0, a, c. Obviously, a 0 = a # c, and the orthosums a @ a, a @ c are undefined due to (OA).
<
EXAMPLE 14. The lattice (L, <,O, 1 ) from Fig. 1 can be equipped with the structure of a lattice effect algebra. The (unique possible) orthosum is defined
Constructions of Quantum Structures
339
by a @ a = c, b @ b = d, a @ c = b @ d = 1. Notice that this induces an orthosupplementation such that a' = c, b' = d (different from that of Ex. 12). We see that the same lattice (L, 5 , 0 , 1 ) from Ex. 12 admits the structure of an ortholattice and of a lattice effect algebra, but these two structures are different and equipped with different orthosupplementations.
Figure 2. The lattice from Ex. 15 EXAMPLE 15. The distributive lattice in Fig. 2 can be considered a four-element Boolean algebra 22 where a' = b. It can be also equipped with a (non-isomorphic) structure of a lattice effect algebra if we define a @ a = b @ b = 1and x @ 0 = x for all x. In this LEA (called the diamond), a' = a and b' = b. Two elements a, b of an effect algebra L are called orthogonal iff a @ b is defined (in symbols a Ib). This occurs iff a 5 b'. DEFINITION 16. An orthoposet (L, <,O, 1,') is called an orthomodular poset (OMP) if it satisfies the orthomodular law: (OM)
If a 5 b, then b = a V (a' A b) (and the right-hand side exists).
If, moreover, an orthomodular poset is a lattice, it is called an orthomodular lattice (OML). We refer to [Beran, 1984; Kalmbach, 19831 for the discussion of numerous equivalent formulations of the orthomodular law. Every orthomodular poset becomes an orthoalgebra when equipped with the partial operation @ defined as a @ b = a V b whenever a Ib. EXAMPLE 17. Every Boolean algebra is an OML. EXAMPLE 18. In Ex. 5 , the set P ( H ) of all projectors on H forms an OML (P(H), 5 , 0 , 1 , I ) , where P' = 1- P . This OML is called a Hilbert lattice (HL) [Kalmbach, 19861. It is a crucial example for quantum physics. See [Dvure~enskij, 1993; Gudder, 1979; Gudder, 1988; Hamhalter, 20031 for a detailed study of its properties.
Mirko Navara
Figure 3. Modular ortholattice M 0 2 EXAMPLE 19. The Hasse diagram in Fig. 3 denotes an OML. It is the modular ortholattice called M 0 2 (see [Beran, 1984; Kalmbach, 19831). EXAMPLE 20. The ortholattice (L, 5 , 0 , 1 , ') from Ex. 12 violates orthomodularity because a 5 c, but a V (a' A c) = a # c. Thus it is not an OML. We can say even more (see Defs. 35 and 49 for the notions needed): THEOREM 21. [Beran, 1984, Th. 5.41 An ortholattice is an OML iff it does not contain a sub-ortholattice isomorphic to that fi-om Ex. 12. PROPOSITION 22. If an orthoalgebra is a lattice, it is an OML. The latter proposition does not hold for effect algebras which are not orthoalgebras: EXAMPLE 23. With the ordering defined by (Ord), the effect algebra from Ex. 4 is the three-element chain considered a LEA. The diamond (the LEA from Ex. 15) is a union of two such chains. The effect algebra from Ex. 14 is a union of two four-element chains. These LEAS are not OMLs.
2.3 Diference and D-posets Note that every effect algebra is cancellative, i.e., a @ b = a @ c implies b = c. This allows us to define the partial difference operation 8: (Diff)
b8a=ciffa@c=b.
(Due to cancellativity, there is at most one c satisfying a @ c = b.) Thus b 8a is defined iff a 5 b. An equivalent definition is b 8 a = (a @ b')'. The orthosupplement is a' = 18a. This induces the following structure: DEFINITION 24. [ ~ ~ and ~ Chovanec, k a 19941 A D-poset (DP) is a pentuplet (L, s,e,O,l), where (L, 5 , 0 , 1 ) is a bounded poset and 8:L2 -+ L is a partial binary operation (difference) such that b 8a is defined iff a 5 b, and the following properties are satisfied for all a, b, c E L:
Constructions of Quantum Structures
If, moreover, L is a lattice, it is called a D-lattice (DL). REMARK 25. D-posets were introduced in [KGpka and Chovanec, 19941, this definition (which is simpler and equivalent to the original one) appeared first in [Navara and PtAk, 19971. It was discovered soon that the structure of a D-poset is and Bencategorically equivalent to that of effect algebra, as introduced by [~oulis i Greuling, 19891. Similar intention nett, 19941 and independently by [ ~ i u n t i nand can be traced back to [~oulisand Randall, 19791. We have already seen how an effect algebra gives rise to a D-poset. For the reverse conversion, we put a @ b = c iff c 8 a = b. Equivalently, b @ a = (b' 8 a)'. Thus each D-poset can be equipped with the structure of an effect algebra (unique up to isomorphism) and vice versa. D-posets which correspond to orthoalgebras are exactly those which satisfy the following property: If (18 a) 8 a exists, it is 1. In orthoalgebras this expression is defined iff a = 0, but effect algebras admit it also for a # 0 . See [ ~ a v a r aand Pt*, 19971 for more details. As we see, the same set can be equipped with different algebraic structures which induce each other. In the sequel, we do not distinguish them and we always assume that the other operations are canonically determined by the basic algebraic operations and the ordering by (Ord). E.g., a Boolean algebra is considered a special case of an orthoposet and of an effect algebra (equipped with the orthosum as in Ex. 3). PROPOSITION 26. An orthoalgebra is an OMP (resp. OML) pair (resp. each pair) of its elements has a supremum.
zfl each orthogonal
The relations of the structures studied here are displayed in Fig. 4. All inclusions marked there are proper. The following examples show this for some of them. EXAMPLE 27. The Hasse. diagram in Fig. 5 is an orthoalgebra called the Wright triangle [Wright, 19771. (The elements a, a' are marked twice in order to reduce the number of crossings.) It is not a lattice because c < a', c < b', f < a', f < b', but a' A b' does not exist. This orthoalgebra is not an OMP because b < a' and b' A a' does not exist, thus (OM) is violated. EXAMPLE 28. The Hasse diagram in Fig. 6 is an OMP which is not an OML because b < a', b < c', d < a', d < c', but a' A c' does not exist. (The elements a, a' are marked twice in order to reduce the number of crossings.)
Mirko Navara
OL
OMP
OML
LEA=DL
MVA
Figure 4. Relations between different quantum structures 3 STANDARD CONSTRUCTIONS
Here we present constructions which have analogies in other algebraic structures products, etc. In the next sections,.we shall deal with tools which are specific for quantum structures.
- subalgebras,
3.1 Intervals and ideals An additional structure of a poset induces the corresponding structure of an interval: PROPOSITION 29. Let (L, @L, OL, 1 ~ be) an effect algebra and let e E L \ ( 0 ~ ) We take the internal K = LIOL,e] and we define OK = OL, 1~= e , and a @b = ~ a @L b whenever a, b, a @L b E K . Then (K, @K, OK, 1 ~ =)( K ,@K, OL, e) 2s an effect algebra. We shall always consider intervals in effect algebras equipped with the above orthoalgebraic structure. REMARK 30. Prop. 29 can be easily generalized to intervals with nonzero lower b. bounds, L[a, b], where a IL DEFINITION 31. Let (L, @, 0 , l ) be an effect algebra. A nonempty subset I C L is called an ideal if it satisfies the following condition for each a, b E L, a Ib:
Constructions of Quantum Structures
Figure 5. Hasse diagram of the orthoalgebra from Ex. 27 (Wright triangle)
Figure 6. Hasse diagram of an OMP which is not an OML (Ex. 28)
(Id)
a@b~IifIa,b~I.
An ideal I of an effect algebra is also an order ideal, i.e., a 5 b E I implies a E I. It need not be closed under the lattice operations. EXAMPLE 32. In the modular ortholattice M 0 2 from Ex. 19, the set I = (0, a, b} is an ideal and a V b = 1@ I (while a @ b is undefined). For an OMP (L, 5 , 0 , 1 , ') and e E L \ {OL}, the interval LIOL,el is an ideal called a principal ideal. This need not hold in an orthoalgebra: EXAMPLE 33. In the orthoalgebra (L, @L, 0 , l ) from Ex. 27, we have a, b E L[O, c'] and a IL b, but a, b are not orthogonal in L[O, c'] because a @L b $ d . Thus L[O, c'] is not an ideal in (L, @L,0 , l ) .
344
Mirko Navara
3.2 Subalgebras The notion of subalgebra is natural, we only have to take care of its meaning for partial algebras [Burmeister, 19861: PROPOSITION 34. Let (L, @L, 0 , l ) be an effect algebra and K C L such that
(SEA2) If a E K , then a' E K . (SEA3) If a, b E K and a @L b is defined, then a @L b E K . Then (K, @K, 0, I ) , where a @K b = a @L b whenever a, b, a @L b E K , is an effect algebra. DEFINITION 35. The effect algebra (K, @K, 0 , l ) from Prop. 34 is called a subeffect algebra (sub-EA) of (L,@L,0 , l ) . If it is a Boolean algebra, we call it a Boolean subalgebra of (L, @L, 0 , l ) . REMARK 36. This definition of a subeffect algebra is due to [~reechieet al., 19951. As observed by Z. RieEanovG in [~ie~anovii, 19991, conditions (SEA2) and (SEAS) can be equivalently replaced by a single condition using the difference: If a, b E K and a QL b is defined, then a QL b E K . The difference operation on K is the restriction of the difference 8r, on L. Another condition equivalent to (SEA2) and (SEA3) is the following: If a, b, c E L, a @L b = c (equivalently, c eb = ~ a), and at least two of a, b, c belong to K , then a, b, c E K . Thus we have a unified notion of subalgebra for effect algebras and D-posets. In contrast to this, k, conditions (SEAl), (SEAS) without (SEA2) do not suffice, see [ ~ i e ~ a n o v1999, Ex. 3.21. DEFINITION 37. Two elements a, b of an orthoalgebra (L, @, 0 , l ) are called compatible, in symbols a e, b, iff they are contained in a Boolean subalgebra of L. In the quantum logical interpretation of an orthoalgebra, compatible events belong to some classical subsystem; as such, they are simultaneously observable and all Boolean expressions on them are well defined in the effect algebra. REMARK 38. Suppose that a, b are compatible elements of an orthoalgebra L. According to Def. 16, they are contained in at least one Boolean subalgebra of L. Suppose that a, b are contained in two Boolean subalgebras, A, B, of L. As the operations on A, B are induced by the ordering of L, they coincide on their intersection, and ~ V bA= aVg b. Any Boolean formula in a, b has the same interpretation in any Boolean subalgebra containing a, b. DEFINITION 39. A block in an orthoalgebra is a maximal Boolean subalgebra. REMARK 40. The term block is historically used in this meaning in papers on quantum structures. However, it is used in other meaning (intervals of maximal MV-subalgebras which have minimal sharp upper bounds) in the context of MValgebras. In effect algebras, both notions are meaningful and they differ. Thus
Constructions of Quantum Structures
345
another term is desirable. As we did not find a satisfactory alternative, we use here the word block as in orthoalgebras. Each element a of an orthoalgebra is contained in a Boolean subalgebra, at least in (0, a, a', 1) (equipped with the inherited operations). A standard use of Zorn's Lemma implies that each Boolean subalgebra belongs to a maximal Boolean subalgebra. Thus we obtain: PROPOSITION 41. Every orthoalgebra is the union of its blocks. In fact, even some effect algebras which are not orthoalgebras can be expressed as unions of Boolean algebras:
EXAMPLE 42. Let us take the effect algebra (L, @L, 0 , l ) from Ex. 14. As a poset, it is the union of Boolean algebras (0, a, d, I), (0, b, c, 1) (with the complements as in Ex. 12). However, these are not Boolean subalgebras, because they do not respect the orthosums of the original effect algebra (L, @L, 0 , l ) . E.g., a @r, d is undefined and afLis c, not d. For any isotropic element e of an effect algebra, the subset (0, e, el, 1) is not a Boolean subalgebra because e A e' = e # 0. Moreover, the three-element chain (the LEA from Ex. 4) cannot be obtained as a union of Boolean algebras with the same bounds. However, the expression of a quantum structure merely as a union of Boolean algebras does not give any useful information about the algebraic structure. For this, we need a better correspondence respecting the operations. This is possible for orthoalgebras, and we shall specify it in Section 4. In the case of effect algebras, more general basic elements than Boolean algebras are needed (e.g., MV-algebras). A characteristic feature of Boolean algebras is that they are uniquely complemented (see [Beran, 1984; Kalmbach, 19831): For each element a, there is a unique element b, namely b = a', such that a A b = 0, a V b = 1 (i.e., b is the latticetheoretical complement of a). In quantum structures (even in orthomodular lattices), an element a may have more than one complement (a' being always one of them). In Boolean algebras, the notions of complement and orthosupplement coincide. PROPOSITION 43. For an element a of an orthoalgebra L, a' is the only latticetheoretical complement of a which is orthogonal to a. EXAMPLE 44. In the OML from Ex. 19, a has complements a', b, b', but a ;L b, a;L b'. In the orthoalgebra from Ex. 27, a has complements a', e', but a ;L e'. PROPOSITION 45. [Navara, 20001 Let a, b, c be elements of an orthoalgebra (L, @, 0 , l ) such that a 5 b 5 c. Then they are all contained in a Boolean subalgebra of L. Compatibility in an effect algebra requires a different definition: DEFINITION 46. [Khpka, 19951 Two elements a, b of an effect algebra (L, @, 0 , l ) are called compatible, in symbols a ct b, iff there exist u,v, w E P such that
346
Mirko Navara
a = u @ w , b = v @ w and u @ w @ vis defined. REMARK 47. For an orthoalgebra, this definition is equivalent to Def. 37. In this case, w = a A b, u = a 8 w, v = b e w, and orthogonal elements u, v, w, (u @ v @ w)' are atoms of a Boolean subalgebra containing a, b. EXAMPLE 48. In the lattice effect algebra from Ex. 14, a et c because a = 0 @a, c = a @ a, and 0 @ a @ a = c is defined. However, there is no Boolean subalgebra containing a, c. Indeed, a 5 c = a' which is impossible in Boolean algebras. Elements a, b are not compatible; they admit expressions a = a@Oand b = b@O, but a @ 0 @ b is not defined. Also the notion of block requires a revision in effect algebras which are not orthoalgebras. Among several attempts to introduce blocks in effect algebras [Cattaneo et a l , 2000; Chovanec, 2006; Chovanec and JureEkovb, 2003; JenEa, 2001; JenEa, 2005; Navara, 1998; Navara, 2002; RieEanovb, 20001, none is completely satisfactory.
3.3 Morphisms For later use, we clarify the notion of a morphism in quantum structures. DEFINITION 49. (see [ ~ v u r e ~ e n s kand i j Pulmannovb, 20001; for orthoalgebras, 19971) Let (K, @K, OK, I K ) , cf. [Navara and Ptbk, (L, @L, OL, l L ) be effect algebras. A mapping cp: K -+ L is called an EA-morphism iff it satisfies the following conditions:
(EAM2) If a, b E K and a e Kb exists, then cp(a) @L p(b) exists and cp(a) @L cp(b) = cp(a @K b). If, moreover, cp is bijective and its inverse is also an EA-morphism, it is called ) called isomorphic. an isomorphism and (K, @K, OK, l ~ ) ,(L, @L, OL, 1 ~ are Obviously, an EA-morphism also preserves the zero element and orthosupplements. DEFINITION 50. [ ~ a v a r and a Ptbk, 19971 Let (K, 5 ~ GK, 7 OK, I K ) , (L, SL, GL, OL, l L ) be D-posets. A mapping cp: K + L is called a DP-molphism iff it satisfies the following conditions:
( ~ p M 2 )If a, b E K and a 5 b, then cp(a) 5 cp(b) and d b ) 8~d a ) = db8K As observed by Z. RieEanovb, the two notions - EA-morphisrns and DPmorphisms - coincide:
Constructions of Quantum Structures
347
PROPOSITION 51. [~ieEanovL,19961 Let ( K ,@ K , O K , l ~ )( L,,@L,O L , 1 ~ be) effect algebras. A mapping p : K 4 L is an EA-morphism iff it is a DP-morphism of D-~osets( K 1 S K ,8 K 1OK, I K ) , ( L , S L ,e L , O L ~ ~ L ) . EXAMPLE 52. T h e image under an EA-morphism need not b e a sub-effect algebra. E.g., let K = {OK,a , a f K ,b, b f K ,l K ) be the modular ortholattice M 0 2 from Ex. 19 and let L b e the Boolean algebra 23 with atoms c, d, e. There is a unique EA-morphism cp: K + L such that p(a) = c, p(b) = d. T h e image is p ( K ) = {OL,C , d L ,d, d f L ,l L ) . It is not a sub-EA o f L because c @L d = efL $ p ( K ) .
3.4 Direct limits Direct (or inductive) limits are a standard algebraic construction (see [Gratzer, 19791 for algebras and [ ~ u r m e i s t e r19861 , for partial algebras) which we formulate explicitly for the case o f quantum structures. I t has been introduced for OMPs i n [ ~ a v a r and a Rogalewicz, 19911, for orthoalgebras (but with a different notion o f morphism) i n [Habil, 20001. For effect algebras, we refer t o [ ~ v u r e ~ e n s kand ij PulmannovL, 20001. THEOREM 53. Let I be a directed set, { K i I i E I ) a family of effect algebras, and { p i j : K i -+ K j I i,j E I , i 5 j ) a family of EA-morphisms satisfying the following conditions for all i ,j, k E I : 1. If i 5 j 5 k, then cpjk o p i j = pik.
2. pii is the identity on Ai.
{cpi,
Then there are an effect algebra L (unique up to isomorphism) and EA-morphisms : Ki + L I i E I ) such that
(IL1)
If i 5 j , then % , o cpij = pi,.
(IL2)
If a n effect algebra L* and EA-morphisms {p:, : K i 4 L* I i E I ) satisfy ( I L l ) , then there is a unique EA-morphism $ such that $ o piM)= p& for all i E I .
If all K i , i E I , are orthoalgebras (resp. OMPs), then L is an orthoalgebra (resp. an OMP). DEFINITION 54. T h e effect algebra L (with the EA-morphisms { p i , : Ki 4 L I i E I ) ) is called the direct limit o f the system { K i I i E I ) (with EA-morphisms { p i j :Ki 4 K j 1 i , j E I , i 5 j)). In order t o obtain an O M L as a direct limit o f OMLs, we need morphisms which preserve also the lattice operations.
Mirko Navara
348
3.5 Products The standard construction of direct products is widely used in quantum structures. THEOREM 55. Let {Ki I i E I} be a family of effect algebras. We take the cartesian product L = Ki and we endow it with the orthosum @ defined pointwise, i.e., for all a, b, c E L, a = (ai)iE1, b = (bi)iEI, C = (c+)iEr1we define
niEI
a @ b = c iff ai eibi = c+ for all i E I. Then (L, @, 0, I), where 0 = (Oi)iEI, 1 = (li)iEI, is an effect algebra. It is an orthoalgebra (resp. OMP, OML) iff all Ki, i E I, are orthoalgebras (resp. OMPs, OMLs). DEFINITION 56. The effect algebra (L, @, 0 , l ) from Th. 55 is called the product of the family 3.
Figure 7. Hasse diagram of the product M 0 2 x 2' EXAMPLE 57. The Hasse diagram in Fig. 7 denotes an OML. It is the product of the modular ortholattice M 0 2 from Ex. 19 and the two-element Boolean algebra 2 (the elements (0, I ) , (1,O) correspond to c, c', resp.).
3.6 Boolean powers Boolean powers are common algebraic constructions too. Since [P~B,1983; P t B , 19861, they are often used in quantum structures, thus we formulate them explicitly here. THEOREM 58. Let (K, @K, OK, 1 ~ be) an effect algebra and B a (Boolean) alK , we select the subset gebra of subsets of a set I. From the product
niEI
Constructions of Quantum Structures
349
Further, let P be the collection of all elements (ai)iE1 E L such that the set M a= (ai I i E I } i s finite. Then P is a sub-EA of K . If B is complete, then L is K . If K is an orthoalgebra (resp. OMP, OML), then P is also a sub-EA of an orthoalgebra (resp. OMP, OML) and similarly for L i f B is complete.
niEI
niEI
DEFINITION 59. The effect algebra L (resp. P ) from Th. 58 is called the Boolean power (resp. the bounded Boolean power) of K with respect to B.
niEI
If we look at elements of the product K as functions I t K , then the elements of the Boolean power are exactly those functions which are B-measurable. The elements of the bounded Boolean power are B-measurable functions attaining only finitely many values (Mais the range of a ) . 4 PASTING OF BOOLEAN ALGEBRAS
The pasting technique causes the extreme richness of quantum structures. It allows to start frorn simple structures (typically Boolean algebras) and "paste" them to more complex quantum structures. This tool is particularly efficient in the study of state spaces of quantum structures. It was essential in the early studies of , Greechie, 1971; Schultz, 19741 and it is close orthomodular lattices [ ~ i c h t l 1981; to the original motivation and interpretation of quantum logic. In this section, we paste Boolean algebras and obtain orthoalgebras. Then we give sufficient (sometimes also necessary) conditions under which the resulting orthoalgebra is an OMP, resp. an OML. At the beginning, there was an observation that orthoalgebras (OMPs, OMLs) can be expressed as unions of Boolean algebras. However, this fact itself is quite easy and not useful for constructions of new quantum structures frorn Boolean algebras. What is needed is to determine also the whole structure from properties of the corresponding Boolean algebras. Thus we need special families of Boolean algebras which are called pasted. REMARK 60. Historically, this topic was studied for OMPs and OMLs before orthoalgebras were introduced, but the technique extends to them easily.
4.1
Orthoalgebras as pastings of Boolean algebras
In order to construct new quantum structures, we could start from a family of disjoint Boolean algebras and identify some of their elements. (This step is precisely formulated in Section 5.) To simplify the presentation, we assume that this identification is already done and we start from Boolean algebras with non-empty intersections satisfying some conditions. THEOREM 61. Let 3 be a family of Boolean algebras such that each pair A, B E 3 satisfies
Mirko Navara
350
(PF2) (PF3) (CF)
A n B i s a Boolean subalgebra of A and of B o n which the operations of A, B coincide.
For each a E A n B there is a C E 3 such that A[O, a]U B[O,a'] C_ C. There i s n o infinite set M C U .? such that each finite subset of M i s contained in a Boolean algebra from 3.
O n L = U 3 , we define the partial operation @ = UAEF@~, i.e., a @ b = c iff there i s a n A E 3 such that a @ A b = c. Then the quadruplet (L,@, 0 , l ) i s a chain-finite orthoalgebra. DEFINITION 62. A family of Boolean algebras satisfying (PFl), (PF2), (PF3) is called a pasted family of Boolean algebras (PFBA). It is called chain-finite if it satisfies (CF). The orthoalgebra (L, @, 0 , l ) from Th. is called the pasting of 3. REMARK 63. 1. The consistency of the definition of @ follows from (PF2).
2. Although we mean that all operations defined on Boolean algebras A, B coincide on A n B, it suffices to check that the orderings of A, B coincide on AnB. 3. The intersection A n B always contains the bounds 0 , l . These bounds, as well as orthosupplements (=complements), are the same in all elements of 3,so there is no need to distinguish them by a reference to the respective Boolean algebra. 4. Condition (PF3) is symmetric: There is also some D E 3containing A[O, at]U B[O, a ] .
5. Condition (PF1) is only technical; Boolean algebras contained in other members of the family would not mind in the pasting, but the formulation of the other conditions would become more complex. 6. Chain-finiteness is not needed to define the pasting, but to guarantee that it is an orthoalgebra. 7. In order for a PFBA to be chain-finite, it is necessary that all its Boolean algebras be finite. This condition is not sufficient, as we shall see in Ex. 75. Chain-finiteness is not needed to define the pasting, but without it, we cannot guarantee that the resulted structure is an orthoalgebra.
Let us illustrate the notion of PFBA by several examples: EXAMPLE 64. Let us take Boolean algebras A = (0, a, atA, I), B = (0, b, btB, 1) which intersect at (0,l). Then {A, B) is a PFBA. Its pasting is the modular ortholattice M 0 2 from Ex. 19.
Constructions of Quantum Structures
351
EXAMPLE 65. Let us modify Ex. 64 so that the Boolean algebras A, B have three atoms each, A(A) = {a, c,d), A(B) = {b, c, e). Thus A = (0, a, c, d, atA,dA,dlA, 1)and B = (0, b, c, e, blB, dB,elA, 1). Their intersection is (0, c, ctA,1)(notice that dA= dB). Then {A, B) is a PFBA. Its pasting is the modular ortholattice M 0 2 x 2 from Ex. 57. EXAMPLE 66. Let us take three Boolean algebras A, B, C, each with three atoms, A(A) = {a, c, d), A(B) = {b, c, e), A(C) = {a,b, f). Each pair of these Boolean algebras intersects in a (different) Boolean algebra 22 as in Ex. 65. Then {A, B, C) is a PFBA. Its pasting is the Wright triangle (Ex. 27). Th. 61 says that conditions (PFl), (PF2), (PF3), (CF) are sufficient for a pasting of a family of Boolean algebras to form an orthoalgebra. The following theorem states that conditions (PFl), (PF2), (PF3) are also in some sense necessary: THEOREM 67. Every orthoalgebra is a pasting of a pasted family of Boolean algebras, namely of the family of its blocks. DEFINITION 68. For an orthoalgebra (L, @, 0, I ) , we denote by B(L) the family of all its blocks. REMARK 69. The fact that all OMLs can be obtained as pastings of Boolean , The algebras has been proved in [Kalmbach, 1983, $4, Prop. 131 and [ ~ i c h t l19811. same statement for OMPs was not mentioned there, thus it has been published separately in [Rogalewicz, 19881 and for orthoalgebras in [Navara, 20001. However, it has been proved (and unnoticed) already in [Lock and Hardegree, 1984; Lock and Hardegree, 19851. In view of Rem. 42, it is important to say not only that the quantum structure can be expressed as a union a family of Boolean algebras, but that this family also satisfies special properties admitting to determine the whole algebraic structure.
4.2 Hypergraphs, Greechie diagrams Hypergraphs are a natural tool for a representation of pasted families of Boolean algebras and the corresponding orthoalgebras. Since [Greechie, 1971; Schultz, 19741, they are used as a very powerful technique. DEFINITION 70. A hypergraph is a couple 7i = (V, E), where V is a nonempty set (of vertices) and E is a covering of V by nonempty subsets (edges), i.e., UE = V. Now we are prepared to formulate the correspondence between pasted families of Boolean algebras and hypergraphs: DEFINITION 71. Let (L, @, 0,l)be a chain-finite orthoalgebra. The hypergraph (V, E), where V = A(L), E = {A(B) I B E B(L)), is called the Greechie diagram of (L, @, 0 , l ) . In figures, we denote vertices of hypergraphs (Greechie diagrams) by small circles and edges by (preferably smooth) curves. (The vertices, resp. edges, may be labelled by the corresponding atoms, resp. Boolean algebras.)
Mirko Navara
352
EXAMPLE 72. The Greechie diagrams of the orthoalgebras from Exs. 19, 65, 66 are drawn in Fig. 8. (Fig. 8c explains the name "Wright triangle" .)
a
b
c
Figure 8. Greechie diagrams from Exs. 64, 65, 66 (cf. Ex. 72)
Figure 9. Greechie diagram of an OMP which is not an OML (Ex. 28) The condition of chain-finiteness cannot be omitted: EXAMPLE 73. Let A = 2" (the power set of the set of natural numbers) and let B be the Boolean subalgebra of A consisting of all finite subsets of N and their complements. The non-isomorphic Boolean algebras A, B have the same sets of atoms and the same "Greechie diagram". The "Greechie diagrams" of orthoalgebras which are not chain-finite do not allow to reconstruct the original structure of an orthoalgebra. A unique interpretation is obtained for pastings of complete atomic Boolean algebras; this approach is applied, e.g., in [ ~ i e ~ a n o20041. v ~ , For the sake of simplicity, here we define Greechie diagrams only for chain-finite orthoalgebras. The corresponding notion in terms of hypergraphs is the following: DEFINITION 74. A hypergraph is called chain-finite if it does not contain an infinite set V of vertices such that each finite subset of V is contained in an edge.
Constructions of Quantum Structures
353
In order for a hypergraph to be chain-finite, it is necessary that all its edges be finite. This condition is not sufficient: EXAMPLE 75. A hypergraph with finite edges which is not chain-finite: We take V = {a,, b,, c, I n E N}, & = {{al,. . . ,a,, b,, c,} I n E N}. Each finite subset of the set V = {a, I n E N} is contained in an edge. The hypergraph (V,&) is the Greechie diagram of a pasted family of finite Boolean algebras which is not chain-finite. Not all chain-finite hypergraphs are Greechie diagrams of orthoalgebras. The following examples illustrate conditions (PF1)-(PF3):
Figure 10. Hypergraphs from Ex. 76 EXAMPLE 76. The hypergraph in Fig. 10a is not a Greechie diagram of an orthoalgebra because it violates condition (PF1). In a pasting of Boolean algebras A, B, we would have a = (c VA d)IA = (c VB d)IB = b, but a, b are denoted as distinct atoms. Also the hypergraph in Fig. lob violates condition (PF1). In a pasting of Boolean algebras A, B, we would have a = (cVAd)IA = (c VB d)lB = b VB f , thus A c B and A # B. EXAMPLE 77. The hypergraph in Fig. 11 is a Greechie diagram of an orthoalgebra (even an OML); neither A E B nor B C A, the intersection is A f l B = ( 0 , c, d, c V d, d , d', (c V d)', 1). It is the product M 0 2 x 22 of the modular o r t h e lattice M 0 2 with atoms a, e, b, f (Ex. 19) and the Boolean algebra 22 with a t o m c, d. EXAMPLE 78. For the same argument as in Ex. 76, the hypergraph in Fig. 12a violates condition (PF1). However, also the hypergraph in Fig. 12b is not a Greechie diagram of an orthoalgebra. Indeed, we obtain a VA b = (c VA d)IA = (c VB d)IB =
Mirko Navara
Figure 11. Greechie diagram from Ex. 77
Figure 12. Hypergraphs from Ex. 78 e V g f , hence a VA b, e V g f are the same elements in A, but a VA b = (e V g f ) I C , so they are complementary in C - a contradiction with (PF2). EXAMPLE 79. The hypergraph in Fig. 13a violates (PF3). The element
but there is no D E .F containing A[O,i] U CIO,ifC]. The edge corresponding to D is added in the hypergraph in Fig. 13b which is a Greechie diagram of an orthoalgebra (even an OML). It is the product M 0 2 x M 0 2 (with atoms a, b, e, f , resp. c, d, g, h).
4.3 OMPs and OMLs as pastings of Boolean algebras Here we summarize sufficient conditions for a pasting of Boolean algebras to be on orthomodular poset, resp. an orthomodular lattice. We follow the work by M.
Constructions of Quantum Structures
Figure 13. Hypergraphs from Ex. 79 Dichtl [ ~ i c h t l19811, , but we present it in a different way; instead of geometrical conditions we use their algebraical equivalents. We need the following notions: DEFINITION 80. [ ~ i c h t l19811 , Let T be a pasted family of Boolean algebras and let n E M, n 2 3. A sequence ((Ao,ao), (A1, al), . . . , (An-1, anpl)), where Ai E 3, ai E Ai n Ai+1 \ (0) (indices mod n), is called an n-cycle in T iff Ai[O, ail = Ai+l [0,ail and ai-1 IAi ai for i = 0, . . . ,n - 1. If, moreover, Ao, . . . ,An-1 are mutually distinct and ai is an atom of both Ai and Ai+1 for all i = 0, . . . ,n - 1, then ((Aolao), (A1, al), . . . , (A,-1, a,-1)) is called an n-loop in 3. EXAMPLE 81. In Ex. 66 (see Fig. 8c), ((A, c ) , (B, b), (C, a)) is a 3-loop. In Ex. 28 (see Fig. 9), ((A, b), (B, c), (C, d), (Dl a)) is a Cloop. The hypergraph in Fig. 13b is a Greechie diagram of an OML in which ((A, cVd), (B, eV f), (C, gV h), (Dl aV b)) is a Ccycle, but not a Cloop. , The pasting L of a pasted family of Boolean algebras THEOREM 82. [ ~ i c h t l19811 T is an orthomodular poset iff for each .?-cycle ((Ao, q),(Al, al), (A2, a2)) in 3 there is a D E T containing ao, a l , az. EXAMPLE 83. [Dichtl, 19811 A typical example of an OML containing a %loop is presented by the Greechie diagram in Fig. 14. There are conditions (see [Dichtl, 1981; Kalmbach, 1983; Navara and Rogalewicz, 19911) ensuring that a pasting of a PFBA is an OML, but they are not far from a reformulation of the condition that it is a lattice. THEOREM 84. [Dichtl, 1981] Let T be a chain-finite pasted family of Boolean algebras. Its pasting L is an orthomodular lattice iff for each &cycle ((Ao, ao),
Mirko Navara
Figure 14. Greechie diagram of an OML containing a 3-loop (Ex. 83) (AI, al), (A2, a2), (A3, ag)) in 3 there is a 4-cycle ((Bo, b), (BI, b'), (B2, b), (B3, b')) in 3 such that a0 5 b, a2 5 b, a1 5 b', a3 5 b'. EXAMPLE 85. [ ~ i c h t l19811 , A typical example of an OML containing a Cloop is presented by the Greechie diagram in Fig. 15.
Figure 15. Greechie diagram of an OML containing a Cloop (Ex. 85) The application of Th. 84 may be difficult. Simpler sufficient conditions for a PFBA to give an OMP or an OML as its pasting were given long before in R. Greechie's Loop Lemma [Greechie, 19711: THEOREM 86. Let 3 be a pasted family of Boolean algebras such that the intersection of each pair A, B E 3 is of the form { O , 1 ) or ( 0 , a, a', I), where a is an atom of both A and B. Then the pasting of 3 is an orthomodular poset iff 3 has no 3-loops,
Constructions of Quantum Structures a
an orthomodular lattice iff
F has no 6loops and 4-loops.
EXAMPLE 87. Exs. 83, 85 (Figs. 14 and 15) show OMLs to which Th. 86 is not applicable.
4.4 Eflect algebras as pastings Attempts have been made to generalize pasting in order to construct effect algebras. So far only partial answers have been obtained. Most authors try to construct effect algebras as pastings of rectangular treillis or, more generally, MV-algebras [Chovanec, 2006; Chovanec and JureEkovB, 2003; Navara, 1998; Navara, 2002; RieEanovi, 20001. Only G. JenEa considers more general effect algebras with the Riesz decomposition property (see [JenEa, 2001; JenEa, 20051 for more details). Most of these papers are restricted to LEAS or to so-called homogeneous effect algebras. Each of their elements has the same isotropic index with respect to each subMVA containing this element. Each homogeneous effect algebra can be expressed as a pasting of effect algebras with the Ftiesz decomposition p r o p erty [ ~ e n ~20051. a, This result cannot be generalized to all effect algebras; Fig. 16 shows the Hasse diagram of an effect algebra which is not a pasting of effect algebras with the Riesz decomposition property. (It appeared in works by RieEanovB.)
Figure 16. An effect algebra which is not a pasting of MV-algebras
4.5 Pasting of orthoalgebras Sometimes we want to compose an example of a quantum structure from several algebras which were obtained by a different technique. We know that they satisfy the required properties and we want to paste them together. Here we present sufficient conditions allowing this. For OMPs and OMLs, this has been done
358
Mirko Navara
in [Navara and Rogalewicz, 19911, partial results for orthoalgebras can be found in or am halter et al., 19951. Then they were simplified and generalized in [Navara, 20001. THEOREM 88. [Navara, 20001 Let .F be a family of orthoalgebras satisfying the following conditions for all A, B E 3,A # B:
(P3)
If a E A, b E B, c E A n B satisfy a C E 3 such that a 5c c and c Sc b.
c and c
b, then there is a
Let us put P = UCE3C and define a partial operation, @, on P by setting UCEF@C7i-e., we set a @ b = c iff there is a C E 3 such that a @cb = c. Also, define 1 = lc,0 = Oc, where C is an arbitrary element of 3. Then (P, @, 0 , l ) is an orthoalgebra.
@ =
DEFINITION 89. The orthoalgebra (P, @, 0 , l ) from Th. 88 is called the pasting of 3. REMARK 90. Condition (P3) is a more illustrative equivalent to the original condition used in [Hamhalter et al., 19951. We shall often use its strengthening which is easier to check: (P3+)
If c E A n B, then either A[O, c] = B[O, c] or A[O, c'] = B[O,c'].
(If (P3+) is satisfied, we can take C E {A, B) in (P3).) Observe also that if the collection 3 satisfies (P3+), the verification of (P2) is considerably simpler. EXAMPLE 91. [Navara and Rogalewicz, 1991, Ex. 3.61 Let L be the OML from Ex. 81 (its Greechie diagram is in Fig. 13b). It can be considered a pasting of 3 = {B, C, K), where the OML K is the pasting of {A, D) (A,B, C, D are the Boolean algebras denoted in Fig. 13b). The family 3 satisfies (PI), (P2), (P3), but not (P3+). Indeed, a V b = e V f E 3,but B[O, a V b] U K[O, (a V b)'] is not contained in any element of 3.
n
It may seem that pasting of orthoalgebras is unnecessary-we can decompose each of them to blocks and then paste the collection of all blocks of all OAs from the family. Although this is po