Hilbert lattice equations

DOI10.1007/S00023-009-0019-6MaRDI QIDQ625073zbMATH OpenOpenAlexFDO

Authors Norman D. Megill, Mladen Pavičić

Publication date 14 February 2011

Published in Annales Henri Poincaré (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0912.1461

equational class Greechie diagram Hilbert lattice orthomodular lattice probability measure state strong set of states variety

Mathematics Subject Classification ID

Varieties of lattices (06B20) Complemented lattices, orthocomplemented lattices and posets (06C15) Characterizations of Hilbert spaces (46C15) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10)

Abstract: There are five known classes of lattice equations that hold in every infinite dimensional Hilbert space underlying quantum systems: generalised orthoarguesian, Mayet's E_A, Godowski, Mayet-Godowski, and Mayet's E equations. We obtain a result which opens a possibility that the first two classes coincide. We devise new algorithms to generate Mayet-Godowski equations that allow us to prove that the fourth class properly includes the third. An open problem related to the last class is answered. Finally, we show some new results on the Godowski lattices characterising the third class of equations.

Review text

Lattices of subspaces of a Hilbert spaces are known to be (only some) orthomodular lattices admitting sets of states (= probability measures) which are \textit{strong}, i.e., \(a\not\leq b \Rightarrow \exists\) state \(m: m(a)=1>m(b)\). It is a long task to find (necessarily infinite) systems of equations which characterize Hilbert lattices. The authors study five systems of equations in orthomodular lattices which hold in Hilbert lattices and induce the existence of strong sets of (possibly vector-valued) states. These systems are taken from previous papers, mainly from [\textit{R. Mayet}, ``Ortholattice equations and Hilbert lattices, Handbook of quantum logic and quantum structure. Quantum structures. Amsterdam: Elsevier. 525--554 (2007; Zbl 1126.81012)]. Using new powerful computer programs, implications or equivalences are proved between some of these classes. Examples are constructed which prove independence of some sets of equations. Open problems are mentioned, too. The paper is difficult to read because of strange notation -- the authors ignore the arity of operations, etc. Nevertheless, the deep contribution is worth the effort to understand.

Recommendations

Cites work

Cited in

(14)

This page was built for publication: Hilbert lattice equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625073)