Next Article in Journal
Adaptive versus Conventional Positive Position Feedback Controller to Suppress a Nonlinear System Vibrations
Previous Article in Journal
Historical Introduction to Chiral Quark Models
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Adjoint Operations in Twist-Products of Lattices

1
Department of Algebra and Geometry, Faculty of Science, Palacký University Olomouc, 77146 Olomouc, Czech Republic
2
Institute of Discrete Mathematics and Geometry, Faculty of Mathematics and Geoinformation, Technische Universität Wien, 1040 Vienna, Austria
*
Author to whom correspondence should be addressed.
Submission received: 13 January 2021 / Accepted: 28 January 2021 / Published: 2 February 2021
(This article belongs to the Section Mathematics)

Abstract

:
Given an integral commutative residuated lattices L = ( L , , ) , its full twist-product ( L 2 , , ) can be endowed with two binary operations ⊙ and ⇒ introduced formerly by M. Busaniche and R. Cignoli as well as by C. Tsinakis and A. M. Wille such that it becomes a commutative residuated lattice. For every a L we define a certain subset P a ( L ) of L 2 . We characterize when P a ( L ) is a sublattice of the full twist-product ( L 2 , , ) . In this case P a ( L ) together with some natural antitone involution becomes a pseudo-Kleene lattice. If L is distributive then ( P a ( L ) , , , ) becomes a Kleene lattice. We present sufficient conditions for P a ( L ) being a subalgebra of ( L 2 , , , , ) and thus for ⊙ and ⇒ being a pair of adjoint operations on P a ( L ) . Finally, we introduce another pair ⊙ and ⇒ of adjoint operations on the full twist-product of a bounded commutative residuated lattice such that the resulting algebra is a bounded commutative residuated lattice satisfying the double negation law, and we investigate when P a ( L ) is closed under these new operations.
AMS Subject Classification:
06D30; 03G10; 03G25; 03G47

1. Introduction

Kleene lattices were introduced by J. A. Kalman ([1]) (under a different name) as a special kind of De Morgan lattices that serves as an algebraic axiomatization of a certain propositional logic satisfying the double negation law but not necessarily the excluded middle law. If the underlying lattice is not distributive, such lattices are called pseudo-Kleene (see e.g., [2]). It is a question if certain binary operations can be introduced in a Kleene or pseudo-Kleene lattice such that they form an adjoint pair. To solve this problem, we apply an approach using the full twist-product construction and another construction extending a distributive lattice to a Kleene one.
Having a residuated lattice ( L , , , · , , 1 ) , M. Busaniche and R. Cignoli ([3]) as well as C. Tsinakis and A. M. Wille ([4]) introduced binary operations ⊙ and ⇒ on the full twist-product ( L 2 , , ) to be converted into a residuated lattice ( L 2 , , , , , ( 1 , 1 ) ) . It is known that if L = ( L , , , ) is a distributive lattice with an antitone involution, a L and P a ( L ) : = { ( x , y ) L 2 x y a x y } then ( P a ( L ) , , , ) is a Kleene lattice. If L is not distributive then the situation is different.
Our aim is to combine both of these approaches and hence ask for several questions as follows:
  • When is ( P a ( L ) , , ) a sublattice of the full twist-product ( L 2 , , ) , also in the case of a non-distributive lattice L ?
  • When is P a ( L ) closed under operations ⊙ and ⇒ mentioned above?
  • When can P a ( L ) be equipped with these operations forming an adjoint pair?
  • Can we define the operations ⊙ and ⇒ in a way different from that of [3] or [4] to obtain an integral residuated lattice on the full twist-product ( L 2 , , ) ?
We answer these questions in our paper by giving sufficient and, in some cases, also necessary conditions under which we get a positive solution. Moreover, we present examples showing how our constructions work.

2. Preliminaries

We recall several concepts that will be used throughout the paper. Moreover, we recall some results already published on which our present study is based.
Let P = ( P , ) be a poset. An antitone involution on P is a unary operation on P satisfying
(i)
x y implies y x ,
(ii)
x x
for all x , y P . A distributive lattice having an antitone involution is called a De Morgan lattice or a De Morgan algebra.
Definition 1.
A commutative residuated lattice is an algebra ( L , , , · , , 1 ) of type ( 2 , 2 , 2 , 2 , 0 ) such that
(i)
( L , , ) is a lattice,
(ii)
( L , · , 1 ) is a commutative monoid,
(iii)
for all x , y , z L , x · y z is equivalent to x y z (adjointness property).
( L , , , · , , 1 ) is called integral if 1 is the top element of the lattice ( L , , ) . A commutative residuated lattice with 0 is an algebra ( L , , , · , , 0 , 1 ) of type ( 2 , 2 , 2 , 2 , 0 , 0 ) such that ( L , , , · , , 1 ) is a commutative residuated lattice and 0 is the bottom element of ( L , , ) . Let ( L , , , · , , 0 , 1 ) be a commutative residuated lattice with 0. Define x : = x 0 for all x L . ( L , , , · , , 0 , 1 ) is
  • called a bounded commutative residuated lattice if 1 is the top element of ( L , , ) ,
  • said to satisfy the double negation law if it satisfies the identity x x , i.e.,
    ( x 0 ) 0 x .
We say that the operations · and → form an adjoint pair if they satisfy the adjointness (iii) of Definition 1.
The following properties of integral commutative residuated lattices are well-known (cf. e.g., [5]).
Proposition 1.
Let ( L , , , · , , 1 ) be an integral commutative residuated lattice.
Then the following hold for all x , y , z L :
(i)
x y implies x · z y · z ,
(ii)
x · y x , y ,
(iii)
1 x x ,
(iv)
x y x ,
(v)
x y = 1 if and only if x y ,
(vi)
x y implies y z x z ,
(vii)
x y implies z x z y ,
(viii)
x ( y z ) ( x y ) ( x z ) ,
(ix)
( x · y ) z x ( y z ) .
Let L = ( L , , ) be a lattice. By the full twist-product of L is meant the lattice ( L 2 , , ) where ⊔ and ⊓ are defined as follows:
( x , y ) ( z , v ) : = ( x z , y v ) , ( x , y ) ( z , v ) : = ( x z , y v )
for all ( x , y ) , ( z , v ) L 2 . Hence ( x , y ) ( z , v ) if and only if both x z and v y . Assume now that ( L , , , · , , 1 ) is an integral commutative residuated lattice. In Theorem 3.1 in [3] which is a particular case of Corollary 3.6 in [4], Busaniche and Cignoli introduced two additional binary operations ⊙ and ⇒ on its full twist-product ( L 2 , , ) as follows:
( x , y ) ( z , v ) : = ( x · z , ( x v ) ( z y ) ) ,
( x , y ) ( z , v ) : = ( ( x z ) ( v y ) , x · v )
for all ( x , y ) , ( z , v ) L 2 . They showed that ( L 2 , , , , , ( 1 , 1 ) ) is again a commutative residuated lattice, i.e., ⊙ and ⇒ form an adjoint pair. For the convenience of the reader we provide a proof since it is not explicitly contained in [3,4].
Theorem 1.
Let L = ( L , , , · , , 1 ) be an integral commutative residuated lattice andanddefined by (1) and (2) , respectively. Then ( L 2 , , , , , ( 1 , 1 ) ) is a commutative residuated lattice.
Proof. 
Let a , b , c , d , e , f L .
(i)
It is easy to see that ( L 2 , , ) is a lattice.
(ii)
We prove that ( L 2 , , ( 1 , 1 ) ) is a commutative monoid. Because of (iii), (v), (viii) and (ix) of Proposition 1 we have
( x , y ) ( z , v ) ( x · z , ( x v ) ( z y ) ) ( z · x , ( z y ) ( x v ) ) ( z , v ) ( x , y ) , ( ( x , y ) ( z , v ) ) ( t , w ) ( x · z , ( x v ) ( z y ) ) ( t , w ) ( ( x · z ) · t , ( ( x · z ) w ) ( t ( ( x v ) ( z y ) ) ) ) ( x · ( z · t ) , ( ( x · z ) w ) ( t ( x v ) ) ( t ( z y ) ) ) ( x · ( z · t ) , ( x ( z w ) ) ( x ( t v ) ) ( ( z · t ) y ) ) ( x · ( z · t ) , ( x ( ( z w ) ( t v ) ) ) ( ( z · t ) y ) ) ( x , y ) ( z · t , ( z w ) ( t v ) ( x , y ) ( ( z , v ) ( t , w ) ) , ( x , y ) ( 1 , 1 ) ( x · 1 , ( x 1 ) ( 1 y ) ) ( x , 1 y ) ( x , y ) .
(iii)
Now we prove the adjointness property. The following are equivalent:
( a , b ) ( c , d ) ( e , f ) , ( a · c , ( a d ) ( c b ) ) ( e , f ) , a · c e   and   f ( a d ) ( c b ) , a · c e , f a d   and   f c b , a c e , a f d   and   c · f b , a ( c e ) ( f d )   and   c · f b , ( a , b ) ( ( c e ) ( f d ) , c · f ) , ( a , b ) ( c , d ) ( e , f ) .
It is worth noticing that the operations ⊙ and ⇒ defined above are not independent. Namely one can be expressed by the other by using the antitone involution defined by ( x , y ) : = ( y , x ) . Namely,
( x , y ) ( z , v ) ( x · z , ( x v ) ( z y ) ( ( x v ) ( z y ) , x · z ) ( ( x , y ) ( v , z ) ) ( ( x , y ) ( z , v ) ) , ( x , y ) ( z , v ) ( ( x , y ) ( z , v ) ) ( ( x , y ) ( z , v ) ) .
Moreover, note that the commutative residuated lattice ( L 2 , , , , , ( 1 , 1 ) ) as defined above is not integral since the top element ( 1 , 0 ) of the full twist-product is different from the neutral element ( 1 , 1 ) of the monoid ( L 2 , , ( 1 , 1 ) ) .
The following concept was introduced in [2].
A pseudo-Kleene lattice is an algebra ( L , , , ) of type ( 2 , 2 , 1 ) such that the following hold for all x , y L :
(i)
L = ( L , , ) is a lattice,
(ii)
is an antitone involution on ( L , ) ,
(iii)
x x y y .
(Here and in the rest of the paper ≤ denotes the induced order of the lattice L .) If, moreover, L is distributive then ( L , , , ) is called a Kleene lattice.

3. A Construction of Pseudo-Kleene Lattices in the Full Twist-Product

Let L = ( L , , ) be a lattice and ( L 2 , , ) its full twist-product. It is easy to see that ( L 2 , , ) is distributive if and only if so is L . The following construction was introduced for distributive lattices in [6] and generalized for posets by the authors in [7]: Let a L and consider the following subset of L 2 :
P a ( L ) : = { ( x , y ) L 2 x y a x y } .
Since our paper [7] is devoted to posets and not to lattices, we are going to show that if ( P a ( L ) , , ) is a sublattice of ( L 2 , , ) then ( P a ( L ) , , , ) where the unary operation on P a ( L ) is defined by ( x , y ) : = ( y , x ) for all ( x , y ) P a ( L ) is a pseudo-Kleene lattice.
Theorem 2.
Let L = ( L , , ) be a lattice and a L , assume that ( P a ( L ) , , ) is a sublattice of ( L 2 , , ) and put ( x , y ) : = ( y , x ) for all ( x , y ) L 2 . Then
(i)
( P a ( L ) , , , ) is a pseudo-Kleene lattice,
(ii)
the mapping x ( x , a ) is an embedding of L into ( P a ( L ) , , ) ,
(iii)
( P a ( L ) , , ) is distributive if and only if so is L .
Proof. 
Let ( b , c ) , ( d , e ) P a ( L ) and f , g L .
(i)
The following are equivalent:
( b , c ) ( d , e ) , b d   and   e c , e c   and   b d , ( e , d ) ( c , b ) , ( d , e ) ( b , c ) .
Further, we have ( b , c ) = ( c , b ) = ( b , c ) . Thus is an antitone involution on ( P a ( L ) , , ) . Moreover,
( b , c ) ( b , c ) = ( b , c ) ( c , b ) = ( b c , c b ) ( a , a ) ( d e , e d ) = = ( d , e ) ( e , d ) = ( d , e ) ( d , e )
proving that ( P a ( L ) , , , ) is a pseudo-Kleene lattice.
(ii)
Since we have ( f , a ) ( g , a ) if and only if f g , it is evident.
(iii)
This can be easily checked.
In general, ( P a ( L ) , , ) need not be a sublattice of ( L 2 , , ) .
Example 1.
Consider the lattice N 5 = ( N 5 , , ) depicted in Figure 1:
Then ( a , 1 ) , ( c , b ) P a ( N 5 ) , but ( a , 1 ) ( c , b ) = ( a c , 1 b ) = ( 1 , b ) P a ( N 5 ) since 1 b = b a . This shows that P a ( N 5 ) is not a sublattice of the full twist-product ( N 5 2 , , ) of N 5 .
We can give a necessary and sufficient condition for ( P a ( L ) , , ) being a sublattice of ( L 2 , , ) .
Theorem 3.
Let L = ( L , , ) be a lattice and a L . Then ( P a ( L ) , , ) is a sublattice of ( L 2 , , ) if and only if the following condition holds for all x , y , z , v L :
( x y ) ( z v ) a ( x y ) ( z v )   implies ( ( x z ) y v ) ( x z ( y v ) ) a ( x z ( y v ) ) ( ( x z ) y v ) .
Proof. 
Let b , c , d , e L .
The following are equivalent:
( b , c ) , ( d , e ) P a ( L ) , b c a b c   and   d e a d e , ( b c ) ( d e ) a ( b c ) ( d e ) .
Moreover, the following are equivalent:
( b , c ) ( d , e ) P a ( L ) , ( b d , c e ) P a ( L ) , ( b d ) c e a b d ( c e ) .
Finally, the following are equivalent:
( b , c ) ( d , e ) P a ( L ) , ( b d , c e ) P a ( L ) , b d ( c e ) a ( b d ) c e .
Corollary 1.
Let L = ( L , , ) be a distributive lattice and a L . Then ( P a ( L ) , , ) is a sublattice of ( L 2 , , ) and ( P a ( L ) , , , ) where the antitone involution is given by ( x , y ) : = ( y , x ) for all ( x , y ) P a ( L ) is a Kleene lattice.
Proof. 
If b , c , d , e L and
( b c ) ( d e ) a ( b c ) ( d e )
then
( ( b d ) c e ) ( b d ( c e ) ) = ( b c e ) ( d c e ) ( b d c ) ( b d e ) ( b c ) ( d e ) ( b c ) ( d e ) a ( b c ) ( d e ) ( b c ) ( d e ) ( b d c ) ( b d e ) ( b c e ) ( d c e ) ( b d ( c e ) ) ( ( b d ) c e ) .
The rest of proof follows by Theorem 3.  □
The following example shows a distributive lattice L having an element a such that ( P a ( L ) , , ) is a sublattice of the full twist-product ( L 2 , , ) .
Example 2.
Consider the lattice L = ( L , , ) visualized in Figure 2:
If one defines binary operations · and → on L by
x · y : = x y   and   x y : = 1 if   x y , y otherwise ,
then ( L , , , · , , 1 ) is a distributive integral commutative residuated lattice. With respect to the binary operationsanddefined by (1) and (2), respectively, ( P a ( L ) , , , , , ( 0 , 1 ) , ( 1 , 0 ) ) is a bounded commutative residuated lattice. According to Corollary 1, ( P a ( L ) , , ) is a sublattice if ( L 2 , , ) . The Hasse diagram of ( P a ( L ) , , ) is depicted in Figure 3.
In the following, a special role is played by the lattices P a ( L ) , all elements of which are comparable with ( a , a ) . We can characterize them as follows.
Theorem 4.
Let L = ( L , , ) be a lattice and a L . Then the following are equivalent:
(i)
P a ( L ) { ( x , y ) L 2 ( x , y )   is   comparable   with   ( a , a ) }
(ii)
P a ( L ) = { ( x , y ) L 2 ( x , y )   is   comparable   with   ( a , a ) }
(iii)
Every element of L is comparable with a and a is-irreducible and-irreducible.
If this is the case then ( P a ( L ) , , ) is a sublattice of ( L 2 , , ) .
Proof. 
Let b , c L .
(i) and (ii) are equivalent since { ( x , y ) L 2 ( x , y )   is   comparable   with   ( a , a ) } P a ( L ) .
(i) ⇒ (iii):
Since ( a , a ) ( a , b ) or ( a , b ) ( a , a ) we have b a or a b . If a = b c then b , c < a would imply ( b , c ) P a ( L ) and ( b , c ) ( a , a ) , a contradiction. Hence a is ∨-irreducible. If a = b c then a < b , c would imply ( b , c ) P a ( L ) and ( b , c ) ( a , a ) , a contradiction. Hence a is ∧-irreducible.
(iii) ⇒ (i):
Let ( b , c ) P a ( L ) . Then b c a b c .
If b = a then ( b , c ) = ( a , c ) is comparable with ( a , a ) .
If c = a then ( b , c ) = ( b , a ) is comparable with ( a , a ) .
b , c < a is impossible because of a b c .
a < b , c is impossible because of b c a .
If b < a < c then ( b , c ) ( a , a ) .
If c < a < b then ( a , a ) ( b , c ) .
Now assume that (ii) holds and let ( b , c ) , ( d , e ) P a ( L ) .
If ( b , c ) , ( d , e ) ( a , a ) then
( b , c ) ( d , e ) = ( b d , c e ) ( a , a ) , ( b , c ) ( d , e ) = ( b d , c e ) ( a , a ) .
If ( b , c ) ( a , a ) ( d , e ) then
( b , c ) ( d , e ) = ( b d , c e ) ( a , a ) , ( b , c ) ( d , e ) = ( b d , c e ) ( a , a ) ,
If ( d , e ) ( a , a ) ( b , c ) then
( b , c ) ( d , e ) = ( b d , c e ) ( a , a ) , ( b , c ) ( d , e ) = ( b d , c e ) ( a , a ) .
If ( a , a ) ( b , c ) , ( d , e ) then
( b , c ) ( d , e ) = ( b d , c e ) ( a , a ) , ( b , c ) ( d , e ) = ( b d , c e ) ( a , a ) .
Hence ( P a ( L ) , , ) is a sublattice of ( L 2 , , ) .  □
Example 3.
We can see that the lattice L and its element a from Example 2 satisfy the conditions of Theorem 4 (iii); hence, all elements of P a ( L ) are comparable with the element ( a , a ) , see Figure 3.

4. Adjoint Pairs in P a ( L )

Since the element ( 1 , 1 ) of L 2 does not belong to P a ( L ) unless a = 1 , we cannot expect that ( P a ( L ) , , ) will be a commutative residuated lattice with respect to operations ⊙ and ⇒ defined by (1) and (2), respectively. On the other hand, it would be important to know when P a ( L ) is closed with respect to ⊙ and ⇒ because then they form an adjoint pair. Hence, if the pseudo-Kleene lattice P a ( L ) represents a certain logic where ⊙ is conjunction and ⇒ is implication then from the trivial inequality
x y x y
we infer by adjointness
( x y ) x y ,
in other words, the propositional value of y is at least as high as the propositional value of the conjunction of x y and x. This means that this logic satisfies Modus Ponens in the fuzzy modification; hence, this pseudo-Kleene logic enables deduction.
Now we are ready to state and prove one of our main results.
Theorem 5.
Let ( L , , , · , , 1 ) be an integral commutative residuated lattice and a an idempotent (with respect to ·) ∨-irreducible and-irreducible element of L which is comparable with every element of L and put L : = ( L , , ) . Then ( P a ( L ) , , , , ) is a subalgebra of ( L 2 , , , , ) and henceandform an adjoint pair if and only if the following two conditions hold for all x , y L :
a · x < a   implies   a · x = 0 ,
a < x · y   implies   ( x a ) ( y a ) = a .
Proof. 
Let ( b , c ) , ( d , e ) P a ( L ) . According to Theorem 4,
P a ( L ) = { ( x , y ) L 2 ( x , y )   is   comparable   with   ( a , a ) }
and we have that ( P a ( L ) , , ) is a sublattice of ( L 2 , , ) . Since P a ( L ) is closed with respect to , it is closed with respect to ⇒ if it is closed with respect to ⊙. Hence, we need only to check when P a ( L ) is closed with respect to ⊙.
(i)
Assume ( b , c ) , ( d , e ) ( a , a ) .
Because of (ii) and (iv) of Proposition 1 we have
( b , c ) ( d , e ) = ( b · d , ( b e ) ( d c ) ) ( a , a ) .
(ii)
Assume ( b , c ) ( a , a ) ( d , e ) .
Because of (ii) of Proposition 1 we have b · d a .
If b · d = a then ( b , c ) ( d , e ) = ( b · d , ( b e ) ( d c ) ) is comparable with ( a , a ) .
If b · d < a then ( b , c ) ( d , e ) = ( b · d , ( b e ) ( d c ) ) is comparable with ( a , a )
if and only if a b e .
(iii)
Assume ( d , e ) ( a , a ) ( b , c ) .
Because of the commutativity of ⊙ this case reduces to the previous one.
(iv)
Assume ( a , a ) ( b , c ) , ( d , e ) .
Because of (i) of Proposition 1 we have a b · d .
If a = b · d then ( b , c ) ( d , e ) = ( b · d , ( b e ) ( d c ) ) is comparable with ( a , a ) .
If a < b · d then ( b , c ) ( d , e ) = ( b · d , ( b e ) ( d c ) ) is comparable with ( a , a )
if and only if ( b e ) ( d c ) a .
Hence ( P a ( L ) , , , , ) is a subalgebra of ( L 2 , , , , ) if and only if the following statements hold:
(a)
b , e a c , d and b · d < a imply a b e .
(b)
c , e a b , d and a < b · d imply ( b e ) ( d c ) a .
Because of (i) and (vii) of Proposition 1, (a) is equivalent to the following statements:
b · a < a   implies   a b 0 , a · b < a   implies   a · b 0 , a · b < a   implies   a · b = 0 , ( 3 ) .
Moreover, because of (ii), (iv) and (vii) of Proposition 1, (b) is equivalent to the following statements:
a < b · d   implies   ( b a ) ( d a ) a , a < b · d   implies   ( b a ) ( d a ) = a , ( 4 ) .
Corollary 2.
Let L = ( L , , , · , , 1 ) be an integral distributive commutative residuated lattice and a L with a · a = a and assume that every element of P a ( L ) is comparable with ( a , a ) . Then ( P a ( L ) , , , ) where ( x , y ) : = ( y , x ) for all ( x , y ) P a ( L ) is a Kleene lattice andand form an adjoint pair if and only if (3) and (4) hold.
Example 4.
Consider the lattice L = ( L , , ) with element a from Example 2. One can easily check that L satisfies the conditions of Theorem 5, and hence ( P a ( L ) , , , , ) is a subalgebra of ( L 2 , , , , ) .
Lemma 1.
Let L = ( L , , , · , , 1 ) be a distributive commutative residuated lattice and a L . Then ( P a ( L ) , , ) is a distributive sublattice of the full twist-product ( L 2 , , ) closed with respect to ⊙ (and hence also with respect to ⇒) if and only if for all ( b , c ) , ( d , e ) P a ( L )
( b · d ) ( b e ) ( d c ) a ( b · d ) ( b e )   and   a ( b · d ) ( d c ) .
Proof. 
According to Theorem 2 and Corollary 1, ( P a ( L ) , , ) is a distributive sublattice of ( L 2 , , ) . Let ( b , c ) , ( d , e ) P a ( L ) and put f : = b · d , g : = b e , h : = d c and i : = g h . Then the following are equivalent:
( b , c ) ( d , e ) P a ( L ) , ( f , i ) P a ( L ) , f i a f i , f i a f ( g h ) , f i a ( f g ) ( f h ) , f i a f g   and   a f h .
Corollary 3.
Let L = ( L , , , · , , 0 , 1 ) be a distributive bounded commutative residuated lattice and a an atom of L . Then ( P a ( L ) , , ) is a distributive sublattice of the full twist-product ( L 2 , , ) closed with respect to ⊙ (and hence also with respect to ⇒) if and only if for all ( b , c ) , ( d , e ) P a ( L ) either (i) or (ii) hold:
(i)
( b · d ) ( b e ) ( d c ) = a ,
(ii)
( b · d ) ( b e ) ( d c ) = 0 and ( a b · d or a ( b e ) ( d c ) ) .
Proof. 
Let ( b , c ) , ( d , e ) P a ( L ) and put f : = b · d , g : = b e , h : = d c and i : = g h . According to Lemma 1, ( P a ( L ) , , ) is a distributive sublattice of the full twist-product ( L 2 , , ) and ( b , c ) ( d , e ) P a ( L ) is equivalent to ( f i a f g and a f h ) . Now f i = a implies a f i . Using the fact that a is an atom of L we see that the following are equivalent:
a f g , a ( f g ) = a , ( a f ) ( a g ) = a , a f = a   or   a g = a , a f   or   a g .
Analogously, a f h is equivalent to ( a f or a h ) . Finally, the following are equivalent:
( b , c ) ( d , e ) P a ( L ) , f i = a   or   ( f i = 0   and   ( a f   or   a g )   and   ( a f   or   a h ) ) , f i = a   or   ( f i = 0   and   ( a f   or   ( a g   and   a h ) ) ) , f i = a   or   ( f i = 0   and   ( a f   or   a g h ) ) .
Analogously as in Corollary 3, we can consider the operation ⇒ instead of ⊙ and prove a similar result.
Lemma 2.
Let L = ( L , , , · , , 0 , 1 ) be a distributive bounded commutative residuated lattice and a an atom of L . Then ( P a ( L ) , , ) is a distributive sublattice of the full twist-product ( L 2 , , ) closed with respect to ⇒(and hence also with respect to ⊙) if and only if for all ( b , c ) , ( d , e ) P a ( L ) either (i) or (ii) hold:
(i)
( b d ) ( e c ) ( b · e ) = a ,
(ii)
( b d ) ( e c ) ( b · e ) = 0 and ( a ( b d ) ( e c ) or a b · e ) .
Proof. 
Let ( b , c ) , ( d , e ) P a ( L ) and put f : = b d , g : = e c , h : = b · e and i : = f g . According to Theorem 2 and Corollary 1, ( P a ( L ) , , ) is a distributive sublattice of the full twist-product ( L 2 , , ) . Now the following are equivalent:
( b , c ) ( d , e ) P a ( L ) , ( i , h ) P a ( L ) , i h a i h , i h = a   or   ( i h = 0   and   a i h ) , i h = a   or   ( i h = 0   and   ( a i   or   a h ) )
(that a i h is equivalent to ( a i or a h ) follows like in the proof of Corollary 3). □
Example 5.
Consider the lattice L = ( L , , ) shown in Figure 4:
According to Corollary 1, ( P a ( L ) , , ) is a sublattice of the full twist-product ( L 2 , , ) . The Hasse diagram of ( P a ( L ) , , ) is depicted in Figure 5.
Define an antitone involution on ( L , ) and binary operations · and → on L by
x 0 a b c d 1 x 1 c d a b 0
and
x · y = x y b if   x , y { a , c } , x y otherwise x y = x y d if   x , y { a , c } , x y otherwise
for all x , y L . Then ( L , , , · , , 1 ) is an integral commutative residuated lattice and x = x 0 for all x L . Hence there holds the double negation law. Since a is neither idempotent with respect to · nor meet-irreducible nor comparable with all elements of L, we cannot apply Theorem 5. However, since L is distributive, a is atom of L and conditions (i) and (ii) of Corollary 3 are satisfied, P a ( L ) is closed with respect toand hence also with respect to ⇒.
If L denotes the lattice from Example 5 then ( c , d ) , ( d , b ) P d ( L ) , but
( c , d ) ( d , b ) = ( c · d , ( c b ) ( d d ) ) = ( c d , ( c b ) ( d d ) ) = = ( a , ( a b ) ( b d ) ) = ( a , c 1 ) = ( a , c ) P d ( L )
since d c = a c . This shows that P d ( L ) is not closed with respect to ⊙ (and hence also not with respect to ⇒).
If L satisfies the double negation law then, because of (vi) of Proposition 1, is an antitone involution on ( L , ) . Two elements a and b of L are said to be orthogonal to each other (shortly, a b ) if a b . If L satisfies the double negation law then this is equivalent to b a . ( L 2 , , , , , ( 0 , 1 ) , ( 1 , 1 ) ) is said to satisfy the double negation law for orthogonal elements if ( x , y ) = ( x , y ) for all ( x , y ) L 2 with x y where ( x , y ) : = ( x , y ) ( 0 , 1 ) for all ( x , y ) L 2 .
Theorem 6.
Let L = ( L , , , · , , 0 , 1 ) be a bounded commutative residuated lattice satisfying the double negation law and a L . Then the full twist-product ( L 2 , , , , , ( 0 , 1 ) , ( 1 , 1 ) ) is a commutative residuated lattice with zero-element ( 0 , 1 ) satisfying the double negation law for orthogonal elements.
Proof. 
If a , b L and a b then b a and hence
( a , b ) = ( a , b ) ( 0 , 1 ) = ( ( a 0 ) ( 1 b ) , a · 1 ) = ( a b , a ) = ( b , a ) , ( a , b ) = ( b , a ) = ( a , b ) .

5. An Alternative Construction of Adjoint Operations

In this section we show that the operations ⊙ and ⇒ on the full twist-product ( L 2 , , ) can be defined also in a way different from (1) and (2) such that ( L 2 , , , , , ( 0 , 1 ) , ( 1 , 0 ) ) becomes a bounded commutative residuated lattice. We formulate it as follows.
Theorem 7.
Let ( L , , , · , , 0 , 1 ) be a bounded commutative residuated lattice satisfying the double negation law and define x : = x 0 for all x L and
( x , y ) ( z , v ) : = ( x · z , ( y · v ) ) ,
( x , y ) ( z , v ) : = ( x z , ( y v ) )
for all ( x , y ) , ( z , v ) L 2 . Then ( L 2 , , , , , ( 0 , 1 ) , ( 1 , 0 ) ) is a bounded commutative residuated lattice satisfying the double negation law.
Proof. 
Let a , b , c , d , e , f L . Obviously, ( L 2 , , , ( 0 , 1 ) , ( 1 , 0 ) ) is a bounded lattice. We have
( x , y ) ( z , v ) ( x · z , ( y · v ) ) ( z · x , ( v · y ) ) ( z , v ) ( x , y ) , ( ( x , y ) ( z , v ) ) ( t , w ) ( x · z , ( y · v ) ) ( t , w ) ( ( x · z ) · t , ( ( y · v ) · w ) ) ( x · ( z · t ) , ( y · ( v · w ) ) ) ( x , y ) ( z · t , ( v · w ) ) ( x , y ) ( ( z , v ) ( t , w ) ) , ( x , y ) ( 1 , 0 ) ( x · 1 , ( y · 0 ) ) ( x , ( y · 1 ) ) ( x , y ) ( x , y ) .
Moreover, the following are equivalent:
( a , b ) ( c , d ) ( e , f ) , ( a · c , ( b · d ) ) ( e , f ) , a · c e   and   f ( b · d ) , a · c e   and   b · d f , a · c e   and   b d f , a c e   and   ( d f ) b , ( a , b ) ( c e , ( d f ) ) , ( a , b ) ( c , d ) ( e , f ) .
Finally, we have
( x , y ) ( x , y ) ( 0 , 1 ) ( x 0 , ( y 1 ) ) ( x , ( y 0 ) ) ( x , y ) ( x , y ) , ( x , y ) ( x , y ) ( x , y ) ( x , y ) .
Remark 1.
Let us note that under the assumptions of Theorem 7, the antitone involution ( x , y ) : = ( x , y ) in the full twist-product L 2 as well as in P a ( L ) can be derived in a natural way by ( x , y ) ( x , y ) ( 0 , 1 ) since
( x , y ) ( 0 , 1 ) ( x 0 , ( y 1 ) ) ( x , ( y 0 ) ) ( x , y ) ( x , y ) .
This does not hold ifandare defined by (1) and (2), respectively.
Remark 2.
It is worth noticing that the case when the operationsandare defined by (5) and (6), respectively, has an interpretation e.g., in MV-algebras. Namely, an MV-algebra is an algebra ( M , , ¬ , 0 ) of type ( 2 , 1 , 0 ) where ( M , , 0 ) is a commutative monoid, ¬ satisfies the identity ¬ ¬ x x , x ¬ 0 ¬ 0 andand ¬ are related by the Łukasiewicz axiom
¬ ( ¬ x y ) y ¬ ( ¬ y x ) x .
Then ( M , , ) becomes a distributive lattice where
x y : = ¬ ( ¬ x y ) y , x y : = ¬ ( ¬ x ¬ y ) .
for all x , y M . MV-algebras serve as an algebraic semantics of the many-valued Łukasiewicz logics, ⊕ is interpreted as disjunction and → defined by x y : = ¬ x y for all x , y M as implication. If we put x · y : = ¬ ( ¬ x ¬ y ) for all x , y M then x y ¬ ( x · ¬ y ) and ( M , , , · , , 0 , 1 ) forms a bounded commutative residuated lattice satisfying the double negation law. If we now define and on the full twist-product M 2 by (5) and (6), respectively, we obtain
( x , y ) ( z , v ) ( x · z , y v ) , ( x , y ) ( z , v ) ( x z , ¬ y · v ) .
In fact, the lattice L = ( L , , ¬ ) from Example 5 is an MV-algebra where ¬ x : = x 0 and x y : = ¬ ( ¬ x · ¬ y ) for all x , y L .
It was shown in [2] for Kleene lattices and in [7] for pseudo-Kleene lattices ( L , , ) that there exists at most one element a of L satisfying a = a . If such an element exists in a lattice with an antitone involution, we can prove the following result.
Theorem 8.
Let L = ( L , , , ) be a lattice with an antitone involution and a L with a = a , assume that ( P a ( L ) , , ) is a sublattice of ( L 2 , , ) and ( x , y ) = ( x , y ) for all ( x , y ) L 2 . Then ( P a ( L ) , , , ) is a pseudo-Kleene lattice if and only if L has this property.
Proof. 
Let b , c L and ( d , e ) , ( f , g ) P a ( L ) . We have ( x , y ) ( x , y ) ( 0 , 1 ) ( x , y ) as explained in Remark 1. If ( P a ( L ) , , , ) is a pseudo-Kleene lattice then ( b , a ) , ( c , a ) P a ( L ) and hence
( b b , a a ) = ( b , a ) ( b , a ) = ( b , a ) ( b , a ) ( c , a ) ( c , a ) = ( c , a ) ( c , a ) = ( c c , a a ) ,
i.e., b b c c showing that L is a pseudo-Kleene lattice. Conversely, assume L to be a pseudo-Kleene lattice. Then d e a d e whence d e a d e , i.e., d e a d e which shows ( d , e ) = ( d , e ) P a ( L ) . Hence P a ( L ) is closed with respect to . Finally, we have
( d , e ) ( d , e ) = ( d , e ) ( d , e ) = ( d d , e e ) ( f f , g g ) = ( f , g ) ( f , g ) = = ( f , g ) ( f , g )
showing that ( P a ( L ) , , , ) is a pseudo-Kleene lattice. □
Our next aim is to show when P a ( L ) is closed under the operation ⊙ defined by (5). We prove the following.
Theorem 9.
Let L = ( L , , , · , , , 1 ) be a commutative residuated lattice with an antitone involution, let a L be idempotent with respect to ·, ∨-irreducible and-irreducible, assume a · a = a and defineby (5). Then P a ( L ) is closed with respect to ⊙.
Proof. 
Let ( b , c ) , ( d , e ) P a ( L ) . We have
( x , y ) ( z , v ) ( x · z , ( y · v ) ) ( z · x , ( v · y ) ) ( z , v ) ( x , y ) .
According to Theorem 4,
P a ( L ) = { ( x , y ) L 2 ( x , y )   is   comparable   with   ( a , a ) } .
In the following we often use (i) and (ii) of Proposition 1.
(i)
Assume ( b , c ) ( a , a ) .
We have b · d b a and every one of the following statements implies the next one:
a c , c a , c · e a , a ( c · e ) .
This shows ( b , c ) ( d , e ) = ( b · d , ( c · e ) ) ( a , a ) .
(ii)
Assume ( d , e ) ( a , a ) .
Then ( b , c ) ( d , e ) = ( d , e ) ( b , c ) ( a , a ) .
(iii)
Assume ( a , a ) ( b , c ) , ( d , e ) .
Then c , e a and hence a c , e whence a = a · a c · a c · e from which we conclude ( c · e ) a . Because of a b , d we have a = a · a b · a b · d . Together we obtain ( a , a ) ( b · d , ( c · e ) ) = ( b , c ) ( d , e ) .
Unfortunately, P a ( L ) is not closed under ⇒ defined by (6) provided L in non-trivial, i.e., if it has more than one element.
Theorem 10.
Let ( L , , , · , , , 0 , 1 ) be a bounded commutative residuated lattice with an antitone involution and a L and put ( x , y ) ( z , v ) : = ( x z , ( y v ) ) for all ( x , y ) , ( z , v ) L 2 . Then P a ( L ) is closed with respect to ⇒ if and only if | L | = 1 .
Proof. 
Assume P a ( L ) to be closed with respect to ⇒. Since ( 0 , a ) , ( a , 0 ) , ( a , 1 ) , ( 1 , a ) P a ( L ) we have
( 0 , 0 ) = ( 0 , 1 ) = ( 1 0 , ( a a ) ) = ( 1 , a ) ( 0 , a ) P a ( L ) , ( 1 , 1 ) = ( 1 , 0 ) = ( 1 , ( 1 0 ) ) = ( a a , ( 0 1 ) ) = ( a , 0 ) ( a , 1 ) P a ( L )
whence a 0 0 = 0 1 = 1 1 a and therefore 0 = 1 , i.e., | L | = 1 . □

Author Contributions

The authors contributed equally to this manuscript, both authors have read and agreed to the published version of the manuscript.

Funding

Support of the research by the Austrian Science Fund (FWF), project I 4579-N, and the Czech Science Foundation (GAČR), project 20-09869L, entitled “The many facets of orthomodularity”, as well as by ÖAD, project CZ 02/2019, entitled “Function algebras and ordered structures related to logic and data fusion”, and, concerning the first author, by IGA, project PřF 2020 014, is gratefully acknowledged.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

Open Access Funding by the Austrian Science Fund (FWF).

Conflicts of Interest

There are no conflict of interest.

References

  1. Kalman, J.A. Lattices with involution. Trans. Am. Math. Soc. 1958, 87, 485–491. [Google Scholar] [CrossRef]
  2. Chajda, I. A note on pseudo-Kleene algebras. Acta Univ. Palacki. Olomuc. Fac. Rerum Nat. Math. 2016, 55, 39–45. [Google Scholar]
  3. Busaniche, M.; Cignoli, R. The subvariety of commutative residuated lattices represented by twist-products. Algebra Univers. 2014, 71, 5–22. [Google Scholar] [CrossRef]
  4. Tsinakis, C.; Wille, A.M. Minimal varieties of involutive residuated lattices. Stud. Log. 2006, 83, 407–423. [Google Scholar] [CrossRef] [Green Version]
  5. Bělohlávek, R. Fuzzy Relational Systems. Foundations and Principles; Springer: New York, NY, USA, 2002; ISBN 9781461351689. [Google Scholar]
  6. Cignoli, R. Injective De Morgan and Kleene algebras. Proc. Am. Math. Soc. 1975, 47, 269–278. [Google Scholar] [CrossRef]
  7. Chajda, I.; Länger, H. Kleene posets and pseudo-Kleene posets. arXiv 2020, arXiv:2006.04417. [Google Scholar]
Figure 1. The lattice N 5 .
Figure 1. The lattice N 5 .
Symmetry 13 00253 g001
Figure 2. The four-element chain.
Figure 2. The four-element chain.
Symmetry 13 00253 g002
Figure 3. The lattice ( P a ( L ) , , ) .
Figure 3. The lattice ( P a ( L ) , , ) .
Symmetry 13 00253 g003
Figure 4. A distributive six-element lattice.
Figure 4. A distributive six-element lattice.
Symmetry 13 00253 g004
Figure 5. The lattice ( P a ( L ) , , ) .
Figure 5. The lattice ( P a ( L ) , , ) .
Symmetry 13 00253 g005
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Chajda, I.; Länger, H. Adjoint Operations in Twist-Products of Lattices. Symmetry 2021, 13, 253. https://0-doi-org.brum.beds.ac.uk/10.3390/sym13020253

AMA Style

Chajda I, Länger H. Adjoint Operations in Twist-Products of Lattices. Symmetry. 2021; 13(2):253. https://0-doi-org.brum.beds.ac.uk/10.3390/sym13020253

Chicago/Turabian Style

Chajda, Ivan, and Helmut Länger. 2021. "Adjoint Operations in Twist-Products of Lattices" Symmetry 13, no. 2: 253. https://0-doi-org.brum.beds.ac.uk/10.3390/sym13020253

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop