Left residuated operators induced by posets with a unary operation

The concept of operator left residuation has been introduced by the authors in their previous paper (Chajda and Länger in Asian Eur J Math 11:1850097, 2018). Modifications of so-called quantum structures, in particular orthomodular posets, like pseudo-orthomodular, pseudo-Boolean and Boolean posets are investigated here in order to show that they are operator left residuated or even operator residuated. In fact, they satisfy more general sufficient conditions for operator residuation assumed for bounded posets equipped with a unary operation. It is shown that these conditions may be also necessary if a generalized version using subsets instead of single elements is considered. The above-listed posets can serve as an algebraic semantics for the logic of quantum mechanics in a broad sense. Moreover, our approach shows connections to substructural logics via the considered residuation.


Introduction
It was shown by Birkhoff and von Neumann (1936) and, independently, by Husimi (1937) that orthomodular lattices can serve as an algebraic semantics of the logic of quantum mechanics. Namely, the class of event-state systems in quantum mechanics is usually identified with the set of projection operators on a Hilbert space H and this set is in a bijective correspondence with the set of all closed linear subspaces of H. However, certain doubts concerning the relevance of this representation arose when it was shown that the class of orthomodular lattices arising in this way does not generate the variety of orthomodular lattices. In other words, there exist orthomodular lattices which do not repre-Communicated by A. Di Nola. sent a physical system in the logic of quantum mechanics. The reason is that some equational properties of event-state systems are not fairly reflected by the proposed mathematical abstraction. This was the reason for alternative approaches (see, e.g., Giuntini et al. (2016Giuntini et al. ( , 2017). In particular, an algebraic semantics for the logic of quantum mechanics was found among orthomodular posets and their modifications.
Orthomodular lattices have similar properties as algebraic structures used for substructural logics (see, e.g., Galatos et al. (2007)). The authors proved in Chajda and Länger (2017a, b) that every orthomodular lattice can be converted into a so-called left residuated l-groupoid. They showed in Chajda and Länger (submitted) that this result can be easily extended to a certain class of bounded lattices with a unary operation which, of course, contains the variety of orthomodular lattices. Hence, the natural question arises if this approach can be extended to ordered sets with a unary operation. For this purpose, so-called residuated operators were introduced in Chajda and Länger (2018) and several classes of ordered sets with a unary operation turned out to be operator residuated. A prominent role among these posets play the so-called pseudo-orthomodular posets which are a direct generalization of orthomodular lattices, but serve also as good candidates for an algebraic semantics of the logic of quantum mechanics. And again, there arises the natural question if the posets listed in Chajda and Länger (2018) really exhaust all possible cases.
The aim of the present paper is to provide several simple conditions under which a bounded poset with a unary operation can be organized into an operator left residuated poset. Similarly as it was done for lattices in Chajda and Länger (submitted), we ask whether these conditions are not only sufficient but also necessary. It is shown that if subsets instead of single elements are considered, then these generalized conditions characterize the class of posets which can be converted into operator residuated ones.

Adjointness of operators
Recall from Birkhoff and von Neumann (1936) that an orthomodular lattice is a bounded lattice (L, ∨, ∧, , 0, 1) with a unary operation which is a complementation and an antitone involution (see, e.g., Kalman 1958) satisfying the orthomodular law A left residuated lattice (or integral l-groupoid in the terminology of Galatos et al. 2007) is a bounded lattice L = (L, ∨, ∧, , →, 0, 1) with two more binary operations and → satisfying x y ≤ z if and only if x ≤ y → z (the so-called le f t ad jointness).
Here "L satisfies the identity x 1 ≈ x" means that "x 1 = x for all x ∈ L". We put x := x → 0. If is, moreover, commutative, then we call the previous property simply adjointness.
Let (P, ≤) be a poset, a, b ∈ P and A, B ⊆ P. Then, we define It was shown by the authors in Chajda and Länger (2017a, b) that taking However, as shown in Chajda and Länger (2018), if (P, ≤, , 0, 1) is an orthomodular poset (or even a Boolean poset), then such operations and → need not exist. In order to avoid these complications, we study bounded ordered sets with a unary operation. We introduced in Chajda and Länger (2018) the following notion: Definition 2.1 An operator left residuated poset is an ordered seventuple P = (P, ≤, , M, R, 0, 1) where (P, ≤, , 0, 1) is a bounded poset with a unary operation and M and R are mappings from P 2 to 2 P satisfying the following conditions for all x, y, z ∈ P:

Condition (ii) is called operator left adjointness.
If M is commutative, then (ii) is called operator adjointness only and P is called an operator residuated poset.
In Chajda and Länger (2018), the definition contains one more condition which, however, follows from (i) and (ii) (see the following lemma).
Lemma 2.2 Every operator left residuated poset (P, ≤, , M, R, 0, 1) satisfies the following condition for all x, y ∈ P: Proof For x, y ∈ P, the following are equivalent: For posets (P, ≤, ) with a unary operation, we define the following two conditions: and the following two mappings from P 2 to 2 P : R(x, y) := L(U (L(y, x), x )) for all x, y ∈ P.

Lemma 2.3 Let (P, ≤, ) be a poset with a unary operation and M and R defined by
Definition 2.4 Recall (e.g., from Chajda and Rachůnek 1989) that a distributive poset is a poset (P, ≤) satisfying one of the following equivalent identities: A poset with complementation is an ordered quintuple P = (P, ≤, , 0, 1) such that (P, ≤, 0, 1) is a bounded poset and is a unary operation on P satisfying the following conditions for all x, y ∈ P: As mentioned in Introduction, we introduce several kinds of posets with complementation which generalize orthomodular lattices.
The poset P with complementation is called a Boolean poset if (P, ≤) is distributive. Of course, every Boolean algebra is a Boolean poset, but there are interesting examples of Boolean posets which are not lattices (see, e.g., Chajda and Länger (submitted)). In every case, Boolean posets are orthomodular posets, and hence, they can be considered as quantum structures.
The poset P with complementation is called a pseudo-Boolean poset if it satisfies one of the following equivalent identities: The identities defining a pseudo-Boolean poset are generalizations of the Sasaki projection and the Sasaki hook. Pseudo-Boolean posets are certain generalization of Boolean ones, but they are closely connected to the following posets. The operators M and R defined by M(x, y) := L(x, y) for all x, y ∈ P, R(x, y) := L(U (y, x )) for all x, y ∈ P mimic meet and material implication, respectively. This gives these posets their pseudo-Boolean character.
The poset P with complementation is called a pseudoorthomodular poset if it satisfies one of the following equivalent identities: It is evident that pseudo-orthomodular posets are generalizations of orthomodular lattices. Namely, if a poset (P, ≤, , 0, 1) with complementation is a lattice satisfying these identities, then U (x, y) ≈ U (x ∨ y) and L(x, y) ≈ L(x ∧ y). Thus, our equalities yield which is the orthomodular law. Hence, these posets can serve as an algebraic semantics of the logic of quantum mechanics. The advantage of this concept is that we need not assume x ≤ y as in the definition of orthomodular posets. It is easy to see that every Boolean poset is pseudo-Boolean and every pseudo-Boolean poset is pseudoorthomodular (cf. Chajda and Länger 2018).
We show that the posets mentioned above are among those assumed in Theorem 2.5.

Example 2.6
Every pseudo-orthomodular poset satisfies both (1) and (2). This can be seen as follows: If (P, ≤, , 0, 1) is a pseudo-orthomodular poset and a, b ∈ P, then L(a, b) For posets (P, ≤, ) with a unary operation, we define the following two conditions: L(x, y), y )) for all x, y ∈ P, L (U (x, y ), y) ⊆ L(x) for all x, y ∈ P (6) and the following two mappings from P 2 to 2 P : M(x, y) := L(x, y) for all x, y ∈ P, R(x, y) := L (U (y, x )) for all x, y ∈ P.
Observe that M is commutative.
Again, pseudo-Boolean and hence also Boolean posets are among those posets assumed in Theorem 2.8 (see the following example).

Example 2.9
Every pseudo-Boolean poset satisfies (5) and (6). This can be seen as follows: If (P, ≤, , 0, 1) is a pseudo-Boolean poset and a, b ∈ P, then L(a) = L(U (a)) ⊆ L(U (a, b )) = L(U (L(a, b), b )), Combining Theorems 2.5 and 2.8 and Examples 2.6 and 2.9, we conclude It is well known that in a residuated lattice each of the operations and → determines the other one. We can prove a similar result also for the posets listed above. Proposition 2.11 (i) If (P, ≤, , 0, 1) is a poset with complementation and M and R are defined by (3) and (4), respectively, then L((M(y , x)) ) ≈ R(x, y), L((R(y, x )) ) ≈ M(x, y).

A characterization of posets satisfying generalized operator residuation
The conditions (5), (6) as well as (7), (8) which are formulated for variables can be expressed also for subsets of P in the following way: For posets (P, ≤, ) with a unary operation, we define the following two conditions: L(A, B), B )) for all A, B ⊆ P, L(U (A, B ) U (B, A )) for all A, B ⊆ P.
In case A = {x} and B = {y}, we will write simply M(x, y) and R(x, y) as previously. Of course, taking singletons in (9) and (10) instead of A and B yields (5) and (6), respectively. Hence, the new conditions and definitions include the previous ones as a particular case. Also our definition of operator adjointness can be extended to subsets of P as follows: The ordered seventuple P = (P, ≤, , M, R, 0, 1) will be called a generalized operator left residuated poset if it satisfies (i) and (iii) of Definition 2.1 as well as (13) and (14), i.e., if for all A, B, C ⊆ P, Condition (15) will be called generalized operator left adjointness. If M is commutative, then (15) is called generalized operator adjointness only and P is called a generalized operator residuated poset. It is evident that taking singletons instead of A, B, C in generalized operator adjointness, we obtain condition (ii) from Definition 2.1. Now we are able to prove a result analogous to Lemma 2.7.
Proof Assume A, B, C ⊆ P.  By Theorem 3.1, we obtain a result analogous to Theorem 2.8.