Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Demonstratio Mathematica

Commutators in Orthomodular Lattices

Sylvia Pulmannová

Published Jan 1, 1985• 18 citations
Publisher

Abstract

<, IntroductionXjq this paper, the notion of a commutator of a subset of orthomodular lattioe {abbreviated: OML) is introduced.It is a generalization of the commutator introduced by Marsden [9] for a two-element subset, and by Beran [l] for a finite sub-F,O* of an OML.Some properties of that commutator, were used tv, Bruns-Kalmbach j_2j, Beran [ij and Poguntke [ll] to describe finitely generated OML-a.The notion of a commutator am been also used in [12] to formulate the necessary and sufficient condition for the existence -of joint probability distributions of observablea on a quantum logic, i.e. the event structure of a quantum meohanloal system» which is supposed to be an orthomodular 6-lattice.We shall study, in Section 3, the properties of commutator*? in L that is an OML L. We show that, for any subset 'J of L, the set J(M) = |aeL(M) t a^com P, F is a finite subset oi Mj is a p-ideal in the sub-OML L(M) of L, generated by the sat M.Moreover, J(M) is identical with the Uarsden [9] p-ideal in L(U), generated by all the commutators com {m,n}, m,neL(M).The commutator com U of the set M is the join of elements of J(M) provided it exists.

DOI
10.1515/dema-1985-0116

Related papers

On Locally Finite Orthomodular Lattices

Dominika Burešová, Pavel Pták

Abstract Let us denote by ℒ ℱ $[\mathcal{L}\mathcal{F}$ the class of all orthomodular lattices (OMLs) that are locally finite (i.e., L ∈ ℒ ℱ $[L\in \mathcal{L}\mathcal{F}$ provided each finite subset of L generates in L a finite subOML). In this note, we first show how one can obtain new locally finite OMLs from the initial ones and enlarge thus the class ℒ ℱ $[\mathcal{L}\mathcal{F}$ . We find ℒ ℱ $[\mathcal{L}\mathcal{F}$ considerably large though, obviously, not all OMLs belong to ℒ ℱ $[\mathcal{L}\mathcal{F}$ . Then we study states on the OMLs of ℒ ℱ $[\mathcal{L}\mathcal{F}$ . We show that local finiteness may to a certain extent make up for distributivity. For instance, we show that if L ∈ ℒ ℱ $[L\in \mathcal{L}\mathcal{F}$ and if for any finite subOML K there is a state s: K → [0, 1] on K, then there is a state on the entire L. We also consider further algebraic and state properties of ℒ ℱ $[\mathcal{L}\mathcal{F}$ relevant to the quantum logic theory.

arXiv:2204.07521•Mathematica Slovaca•Mar 28, 2023•0 citations

Sublattices and Δ-blocks of orthomodular posets

Ivan Chajda, Helmut Länger

Abstract States of quantum systems correspond to vectors in a Hilbert space and observations to closed subspaces. Hence, this logic corresponds to the algebra of closed subspaces of a Hilbert space. This can be considered as a complete lattice with orthocomplementation, but it is not distributive. It satisfies a weaker condition, the so-called orthomodularity. Later on, it was recognized that joins in this structure need not exist provided the subspaces are not orthogonal. Hence, the resulting structure need not be a lattice but a so-called orthomodular poset, more generally an orthoposet only. For orthoposets, we introduce a binary relation $\mathrel \Delta$ and a binary operator $d(x,y)$ that are generalizations of the binary relation $\textrm{C}$ and the commutator $c(x,y)$, respectively, known for orthomodular lattices. We characterize orthomodular posets among orthogonal posets. Moreover, we describe connections between the relations $\mathrel \Delta$ and $\leftrightarrow$ (the latter was introduced by P. Pták and S. Pulmannová) and the operator $d(x,y)$. In addition, we investigate certain orthomodular posets of subsets of a finite set. In particular, we describe maximal orthomodular sublattices and Boolean subalgebras of such orthomodular posets. Finally, we study properties of $\Delta$-blocks with respect to Boolean subalgebras and distributive subposets they include.

arXiv:2004.01962•Journal of Logic and Computation•Jun 25, 2020•0 citations

Algebraic computations in quantum logics

Jeannine J. M. Gabriëls

Mathematical description of quantum phenomena requires an event structure more general than a Boolean algebra. For this purpose, Birkhoff and von Neumann proposed the notion of an orthomodular lattice. Its typical feature is the existence of so–called non–commuting events, which are not simultaneously observable (like position and momentum, according to Heisenberg’s uncertainty principle). There is an old open problem whether the word problem for orthomodular lattices is solvable. Is it possible to decide whether two formulas are equivalent? In Boolean algebras, an easy positive answer is given by a transformation of the formula to a unique normal form. This requires the commutativity, associativity, and distributivity of the Boolean operations (disjunction and conjunction). In orthomodular lattices, the corresponding lattice operations (join and meet) violate distributivity. This disables the use of normal forms. We looked for alternative approaches. E.g., the join is only one of six orthomodular lattice operations generalizing the disjunction. In the thesis, we study the question whether some of the 96 binary operations in orthomodular lattices admit normal forms similar to the classical logic. The first question was which operations satisfy the associative identity, eventually under the assumption that some variables commute. Then we studied monotonicity because it is related to distributivity over the meet and join. The conclusion is that there is no pair of operations in orthomodular lattices admitting “Boolean–like” normal forms. In the last chapter we study “Moufang–like” identities, which were inspired by the algebras of quaternions and octonions. These identities generalize associativity and may enable further progress. As a by–product, we proved interesting, yet unknown, properties of some orthomodular lattice operations (e.g., the Sasaki projection). These new tools simplify algebraic computations and give a chance to develop algorithms more general than the current specialized software.

•Jan 1, 2015•0 citations

Orthomodular lattices with state-separated noncompatible pairs

Ren� Mayet, Pavel Pták

In the logico-algebraic foundation of quantum mechanics one often deals with the orthomodular lattices (OML) which enjoy state-separating properties of noncompatible pairs (see e.g. [18], [9] and [15]). These properties usually guarantee reasonable “richness” of the state space—an assumption needed in developing the theory of quantum logics. In this note we consider these classes of OMLs from the universal algebra standpoint, showing, as the main result, that these classes form quasivarieties. We also illustrate by examples that these classes may (and need not) be varieties. The results supplement the research carried on in [1], [3], [4], [5], [6], [11], [12], [13] and [16].

Czechoslovak Mathematical Journal•Jun 1, 2000•5 citations

Joint Distributions and Commutability of Observables

Kazimierz Urbanik

In the quantum probability theory the 6-field of random events is replaoed by the lattice of orthogonal projectors in a separable infinite dimensional Hilbert space H.A countably additive function from this lattices to the unit interval constitutes a state, the non-commutative analogue of a probability measure.The Theorem of Gleason [4] asserts that every state is of the form n--tr jtT, where jt runs over all projectors and T is a probability operator on H, i.e. a positive linear operator of unit trace.Conversely, every probability operator determines a state by the Gleason formula.From now onwards let S stand for the set of all states, i.e. all probability operators on H.We shall dienote by the space of-? ell nuclear linear operators acting in H with the norm jjïj|.j= tr{TT*) 1 ^2.Of coarse S is e closed and convex subset Of TyIn quantum theory to every physical quantity or observable th^re corresponds e sslf»adjoint not necessarily bounded linear operator on Hs By 0 ws shall denote the set of all obt ;ry£bles-Given he-0 f tac pi'cb^ivility distribution of A at the etato T is defined for ail Eoi'oi subsets E of the real

Demonstratio Mathematica•Jan 1, 1985•6 citations

An axiomatisation of quantum logic

Ian Clark

The purpose of this paper is to give an axiom system for quantum logic. Here quantum logic is considered to have the structure of an orthomodular lattice. Some authors assume that it has the structure of an orthomodular poset. In finding this axiom system the implication algebra given in Finch [1] has been very useful. Finch shows there that this algebra can be produced from an orthomodular lattice and vice versa. Definition. An orthocomplementation N on a poset (partially ordered set) whose partial ordering is denoted by ≤ and which has least and greatest elements 0 and 1 is a unary operation satisfying the following: (1) the greatest lower bound of a and Na exists and is 0, (2) a ≤ b implies Nb ≤ Na, (3) NNa = a. Definition. An orthomodular lattice is a lattice with meet ∧, join ∨, least and greatest elements 0 and 1 and an orthocomplementation N satisfying where a ≤ b means a ∧ b = a, as usual. Definition. A Finch implication algebra is a poset with a partial ordering ≤, least and greatest elements 0 and 1 which is orthocomplemented by N. In addition, it has a binary operation → satisfying the following: An orthomodular lattice gives a Finch implication algebra by defining → by A Finch implication algebra can be changed into an orthomodular lattice by defining the meet ∧ and join ∨ by The orthocomplementation is unchanged in both cases.

Journal of Symbolic Logic•Sep 1, 1973•13 citations
<, IntroductionXjq this paper, the notion of a commutator of a subset of orthomodular lattioe {abbreviated: OML) is introduced.It is a generalization of the commutator introduced by Marsden [9] for a two-element subset, and by Beran [l] for a finite sub-F,O* of an OML.Some properties of that commutator, were used tv, Bruns-Kalmbach j_2j, Beran [ij and Poguntke [ll] to describe finitely generated OML-a.The notion of a commutator am been also used in [12] to formulate the necessary and sufficient condition for the existence -of joint probability distributions of observablea on a quantum logic, i.e. the event structure of a quantum meohanloal system» which is supposed to be an orthomodular 6-lattice.We shall study, in Section 3, the properties of commutator*? in L that is an OML L. We show that, for any subset 'J of L, the set J(M) = |aeL(M) t a^com P, F is a finite subset oi Mj is a p-ideal in the sub-OML L(M) of L, generated by the sat M.Moreover, J(M) is identical with the Uarsden [9] p-ideal in L(U), generated by all the commutators com {m,n}, m,neL(M).The commutator com U of the set M is the join of elements of J(M) provided it exists.
Abstract Let us denote by ℒ ℱ [LF[\mathcal{L}\mathcal{F}[LF the class of all orthomodular lattices (OMLs) that are locally finite (i.e., L ∈ ℒ ℱ [L∈LF[L\in \mathcal{L}\mathcal{F}[L∈LF provided each finite subset of L generates in L a finite subOML). In this note, we first show how one can obtain new locally finite OMLs from the initial ones and enlarge thus the class ℒ ℱ [LF[\mathcal{L}\mathcal{F}[LF . We find ℒ ℱ [LF[\mathcal{L}\mathcal{F}[LF considerably large though, obviously, not all OMLs belong to ℒ ℱ [LF[\mathcal{L}\mathcal{F}[LF . Then we study states on the OMLs of ℒ ℱ [LF[\mathcal{L}\mathcal{F}[LF . We show that local finiteness may to a certain extent make up for distributivity. For instance, we show that if L ∈ ℒ ℱ [L∈LF[L\in \mathcal{L}\mathcal{F}[L∈LF and if for any finite subOML K there is a state s: K → [0, 1] on K, then there is a state on the entire L. We also consider further algebraic and state properties of ℒ ℱ [LF[\mathcal{L}\mathcal{F}[LF relevant to the quantum logic theory.
Abstract States of quantum systems correspond to vectors in a Hilbert space and observations to closed subspaces. Hence, this logic corresponds to the algebra of closed subspaces of a Hilbert space. This can be considered as a complete lattice with orthocomplementation, but it is not distributive. It satisfies a weaker condition, the so-called orthomodularity. Later on, it was recognized that joins in this structure need not exist provided the subspaces are not orthogonal. Hence, the resulting structure need not be a lattice but a so-called orthomodular poset, more generally an orthoposet only. For orthoposets, we introduce a binary relation Δ\mathrel \DeltaΔ and a binary operator d(x,y)d(x,y)d(x,y) that are generalizations of the binary relation C\textrm{C}C and the commutator c(x,y)c(x,y)c(x,y), respectively, known for orthomodular lattices. We characterize orthomodular posets among orthogonal posets. Moreover, we describe connections between the relations Δ\mathrel \DeltaΔ and ↔\leftrightarrow↔ (the latter was introduced by P. Pták and S. Pulmannová) and the operator d(x,y)d(x,y)d(x,y). In addition, we investigate certain orthomodular posets of subsets of a finite set. In particular, we describe maximal orthomodular sublattices and Boolean subalgebras of such orthomodular posets. Finally, we study properties of Δ\DeltaΔ-blocks with respect to Boolean subalgebras and distributive subposets they include.
Mathematical description of quantum phenomena requires an event structure more general than a Boolean algebra. For this purpose, Birkhoff and von Neumann proposed the notion of an orthomodular lattice. Its typical feature is the existence of so–called non–commuting events, which are not simultaneously observable (like position and momentum, according to Heisenberg’s uncertainty principle). There is an old open problem whether the word problem for orthomodular lattices is solvable. Is it possible to decide whether two formulas are equivalent? In Boolean algebras, an easy positive answer is given by a transformation of the formula to a unique normal form. This requires the commutativity, associativity, and distributivity of the Boolean operations (disjunction and conjunction). In orthomodular lattices, the corresponding lattice operations (join and meet) violate distributivity. This disables the use of normal forms. We looked for alternative approaches. E.g., the join is only one of six orthomodular lattice operations generalizing the disjunction. In the thesis, we study the question whether some of the 96 binary operations in orthomodular lattices admit normal forms similar to the classical logic. The first question was which operations satisfy the associative identity, eventually under the assumption that some variables commute. Then we studied monotonicity because it is related to distributivity over the meet and join. The conclusion is that there is no pair of operations in orthomodular lattices admitting “Boolean–like” normal forms. In the last chapter we study “Moufang–like” identities, which were inspired by the algebras of quaternions and octonions. These identities generalize associativity and may enable further progress. As a by–product, we proved interesting, yet unknown, properties of some orthomodular lattice operations (e.g., the Sasaki projection). These new tools simplify algebraic computations and give a chance to develop algorithms more general than the current specialized software.
In the logico-algebraic foundation of quantum mechanics one often deals with the orthomodular lattices (OML) which enjoy state-separating properties of noncompatible pairs (see e.g. [18], [9] and [15]). These properties usually guarantee reasonable “richness” of the state space—an assumption needed in developing the theory of quantum logics. In this note we consider these classes of OMLs from the universal algebra standpoint, showing, as the main result, that these classes form quasivarieties. We also illustrate by examples that these classes may (and need not) be varieties. The results supplement the research carried on in [1], [3], [4], [5], [6], [11], [12], [13] and [16].
In the quantum probability theory the 6-field of random events is replaoed by the lattice of orthogonal projectors in a separable infinite dimensional Hilbert space H.A countably additive function from this lattices to the unit interval constitutes a state, the non-commutative analogue of a probability measure.The Theorem of Gleason [4] asserts that every state is of the form n--tr jtT, where jt runs over all projectors and T is a probability operator on H, i.e. a positive linear operator of unit trace.Conversely, every probability operator determines a state by the Gleason formula.From now onwards let S stand for the set of all states, i.e. all probability operators on H.We shall dienote by the space of-? ell nuclear linear operators acting in H with the norm jjïj|.j= tr{TT*) 1 ^2.Of coarse S is e closed and convex subset Of TyIn quantum theory to every physical quantity or observable th^re corresponds e sslf»adjoint not necessarily bounded linear operator on Hs By 0 ws shall denote the set of all obt ;ry£bles-Given he-0 f tac pi'cb^ivility distribution of A at the etato T is defined for ail Eoi'oi subsets E of the real
The purpose of this paper is to give an axiom system for quantum logic. Here quantum logic is considered to have the structure of an orthomodular lattice. Some authors assume that it has the structure of an orthomodular poset. In finding this axiom system the implication algebra given in Finch [1] has been very useful. Finch shows there that this algebra can be produced from an orthomodular lattice and vice versa. Definition. An orthocomplementation N on a poset (partially ordered set) whose partial ordering is denoted by ≤ and which has least and greatest elements 0 and 1 is a unary operation satisfying the following: (1) the greatest lower bound of a and Na exists and is 0, (2) a ≤ b implies Nb ≤ Na, (3) NNa = a. Definition. An orthomodular lattice is a lattice with meet ∧, join ∨, least and greatest elements 0 and 1 and an orthocomplementation N satisfying where a ≤ b means a ∧ b = a, as usual. Definition. A Finch implication algebra is a poset with a partial ordering ≤, least and greatest elements 0 and 1 which is orthocomplemented by N. In addition, it has a binary operation → satisfying the following: An orthomodular lattice gives a Finch implication algebra by defining → by A Finch implication algebra can be changed into an orthomodular lattice by defining the meet ∧ and join ∨ by The orthocomplementation is unchanged in both cases.