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

arXiv:2204.07521 · Mathematica Slovaca

On Locally Finite Orthomodular Lattices

Dominika Burešová, Pavel Pták

Published Mar 28, 2023• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1515/ms-2023-0040

Related papers

Commutators in Orthomodular Lattices

Sylvia Pulmannová

<, 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.

Demonstratio Mathematica•Jan 1, 1985•18 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

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

The computing power of Turing machine based on quantum logic

Yun Shang, Xian Ping Lu, Ruqian Lu

Turing machines based on quantum logic can solve undecidable problems. In this paper we will give recursion-theoretical characterization of the computational power of this kind of quantum Turing machines. In detail, for the unsharp case, it is proved that Σ01 ∪Π01⊆ LTd(ε,Σ)(LTw(ε,Σ))⊆Π02 when the truth value lattice is locally finite and the operation ∧ is computable, where LTd(ε,Σ)(LTw(ε,Σ))denotes the class of quantum language accepted by these Turing machine in depth-first model (respectively, width-first model); for the sharp case, we can obtain similar results for usual orthomodular lattices.

EPiC series in computing•Jan 23, 2018•0 citations

A Symmetric-Difference-Closed Orthomodular Lattice That Is Stateless

Václav Voràček, Pavel Pták

Abstract This paper carries on the investigation of the orthomodular lattices that are endowed with a symmetric difference. Let us call them ODLs. Note that the ODLs may have a certain bearing on “quantum logics”-the ODLs are close to Boolean algebras though they capture the phenomenon of non-compatibility. The initial question in studying the state space of the ODLs is whether the state space can be poor. This question is of a purely combinatorial nature. In this note, we exhibit a finite ODL whose state space is empty (respectively, whose state space is a singleton).

Order•Nov 24, 2022•3 citations

State spaces of orthomodular structures

Mirko Navara

We present several known and one new description of orthomodular structures (orthomodular lattices, orthomodular posets and orthoalgebras). Originally, orthomodular structures were viewed as pasted families of Boolean algebras. Here we introduce semipasted families of Boolean algebras as an alternative description which is not as detailed, but substantially simplex. Semipasted families of Boolean algebras correspond to orthomodular structures in such a way that states and evaluation functionals are preserved. As semipasted families of Boolean algebras are quite general, they allow an easy construction of orthomodular structures with given state space properties. Based on this technique, we give a simplified proof of Shultz's Theorem on characterization of spaces of finitely additive states on orthomodular lattices. We also put some other results into the new context. We give a detailed exposition of the construction techniques as a tool for further applications, especially for finding counterexamples to questions about states on orthomodular structures.

•Jan 1, 2000•12 citations
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.
<, 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.
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].
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.
Turing machines based on quantum logic can solve undecidable problems. In this paper we will give recursion-theoretical characterization of the computational power of this kind of quantum Turing machines. In detail, for the unsharp case, it is proved that Σ01 ∪Π01⊆ LTd(ε,Σ)(LTw(ε,Σ))⊆Π02 when the truth value lattice is locally finite and the operation ∧ is computable, where LTd(ε,Σ)(LTw(ε,Σ))denotes the class of quantum language accepted by these Turing machine in depth-first model (respectively, width-first model); for the sharp case, we can obtain similar results for usual orthomodular lattices.
Abstract This paper carries on the investigation of the orthomodular lattices that are endowed with a symmetric difference. Let us call them ODLs. Note that the ODLs may have a certain bearing on “quantum logics”-the ODLs are close to Boolean algebras though they capture the phenomenon of non-compatibility. The initial question in studying the state space of the ODLs is whether the state space can be poor. This question is of a purely combinatorial nature. In this note, we exhibit a finite ODL whose state space is empty (respectively, whose state space is a singleton).
We present several known and one new description of orthomodular structures (orthomodular lattices, orthomodular posets and orthoalgebras). Originally, orthomodular structures were viewed as pasted families of Boolean algebras. Here we introduce semipasted families of Boolean algebras as an alternative description which is not as detailed, but substantially simplex. Semipasted families of Boolean algebras correspond to orthomodular structures in such a way that states and evaluation functionals are preserved. As semipasted families of Boolean algebras are quite general, they allow an easy construction of orthomodular structures with given state space properties. Based on this technique, we give a simplified proof of Shultz's Theorem on characterization of spaces of finitely additive states on orthomodular lattices. We also put some other results into the new context. We give a detailed exposition of the construction techniques as a tool for further applications, especially for finding counterexamples to questions about states on orthomodular structures.