https://tomasz-kowalski.github.io
Varieties of semiassociative relation algebras and tense algebras
Abstract.
It is well known that the subvariety lattice of the variety of relation algebras has exactly three atoms. The (join-irreducible) covers of two of these atoms are known, but a complete classification of the (join-irreducible) covers of the remaining atom has not yet been found. These statements are also true of a related subvariety lattice, namely the subvariety lattice of the variety of semiassociative relation algebras. The present article shows that this atom has continuum many covers in this subvariety lattice (and in some related subvariety lattices) using a previously established term equivalence between a variety of tense algebras and a variety of semiassociative -algebras.
Key words and phrases:
Semiassociative relation algebras, tense algebras, lattices of subvarieties.1991 Mathematics Subject Classification:
03G15, 06E25, 08B151. Introduction
Varieties have been a major focus of research in relation algebras for a number of years. For example, several of the early landmark results in the subject focus on the variety of representable relation algebras. In 1955, Tarski showed in [25] that the class of all representable relation algebras is indeed a variety. A year later, in [19], Lyndon gave the first (equational) basis for this variety. In 1964, Monk showed in [24] that this variety is not finitely based.
The lattice of subvarieties of the variety of all relation algebras was first studied extensively by Jónsson in [14], although Tarski did publish some results much earlier in [26]. In [26], Tarski showed, using a result from Jónsson and Tarski [16], that this lattice has exactly three atoms. These atoms are generated by , , and (the minimal subalgebras of the full relation algebras on a 1-element set, a 2-element set, and a 3-element set, respectively). As the variety of relation algebras is congruence distributive, we only need to look for join-irreducible varieties to find the other varieties of small height. It follows from results in [16] that the variety generated by has no join-irreducible covers. In [3], Andréka, Jónsson, and Németi showed that the variety generated by has exactly one join-irreducible cover. The variety generated by is known to have at least 20 finitely generated join-irreducible covers and at least one infinitely generated join-irreducible cover; generators of these covers are listed by Jipsen in [11]. However, it is not yet known if there are more covers. The problem of completely classifying these covers is posed (in various forms) by Jónsson and Maddux in [20], by Hirsch and Hodkinson in [10], and by Givant in [8]. Further results on this lattice can be found in Jónsson [14] and Andréka, Givant, and Németi [1], for example.
Semiassociative relation algebras arise fairly naturally in the study of relation algebras and the calculus of relations; see Maddux [21], for example. As such, the subvariety lattice of the variety of all semiassociative relation algebras has attracted interest from researchers in this field. In [3], Andréka, Jónsson, and Németi show that the properties of the subvariety lattice of the variety of relation algebras that we mentioned above also hold in this lattice. In [13], Jipsen, Kramer, and Maddux show that has a countably infinite family of covers (in the semiassociative case) by constructing a term equivalence and a countably infinite family of covers of the variety generated by (the two element Boolean algebra with a pair of identity operators). In 1999, the problem of showing that has continuum many covers was posed by Peter Jipsen in a conversation with the second author relating to Kowalski [17]. In Section 3 of the present article we will solve this problem, and hence conclude that has continuum many covers in the subvariety lattice of the variety of semiassociative relation algebras.
2. Preliminaries
2.1. Relation-type algebras
For an extensive introduction to the theory and history of relation algebras, we refer the reader to Hirsch and Hodkinson [10], Maddux [22] and Givant [9]; shorter introductions can be found in Chin and Tarski [7] and Jónsson [14]. For sources that cover nonassociative and semiassociative relation algebras, we refer the reader to Maddux [23], Maddux [21], Hirsch and Hodkinson [10], and Maddux [22]. Subvariety lattices are discussed in Jónsson [14], Andréka, Jónsson, and Németi [3], Jipsen [11], Andréka, Givant, and Németi [2], Jipsen, Kramer, and Maddux [13], Andréka, Givant, and Németi [1], and Givant [8]. We will begin by recalling some definitions from [23] and [13].
Definition 2.1.
An algebra is called a nonassociative relation algebra iff is a Boolean algebra, is a binary operation, is an identity element for , and the triangle laws hold in , i.e.,
for all . A nonassociative relation algebra is called a semiassociative relation algebra iff satisfies . A nonassociative relation algebra is called reflexive iff , for all . A nonassociative relation algebra is called symmetric iff satisfies . A nonassociative relation algebra is called subadditive iff , for all .
The triangle laws are equivalent to an equation modulo the other axioms of nonassociative relation algebras (see Theorem 1.4 of [23]), so the classes of all nonassociative relation algebras, semissociative relation algebras, and reflexive subadditive symmetric semiassociative relation algebras are varieties.
Notation 2.2.
The subvariety lattices of the varieties of nonassociative relation algebras, semiassociative relation algebras and reflexive subadditive symmetric semiassociative algebras will be denoted by , and , respectively.
2.2. Tense algebras
For an introduction to the theory and history of tense (or temporal) algebras, we refer the reader to Kracht [18] and Blackburn, de Rijke, and Venema [4]. We refer the reader to Hirsch and Hodkinson [10] and Maddux [22] for an introduction to the theory of Boolean algebras with conjugated operators; Jónsson and Tarski [15] is a shorter introduction. We will need the following definitions from [13].
Definition 2.3.
An algebra is called a tense algebra iff is a Boolean algebra, and and are a conjugate pair, i.e.,
for all . A tense algebra is called total iff , for all with .
A concrete example of a tense algebra is the complex algebra of a frame, i.e., a directed graph. Recall that the complex algebra of a frame is the algebra , where , c, , and respectively denote the powerset of , complementation relative to , the image operation defined by , and the preimage operation defined by . Thus, we have
for all .
The fact that and form a conjugate pair can be expressed by equations (see Theorem 1.15 of [15]), so the class of all tense algebras is a variety. The class of all total tense algebras is not a variety, but the variety it generates is finitely based (see Jipsen [12]).
Notation 2.4.
The subvariety lattice of the variety of tense algebras will be denoted by . The subvariety lattice of the variety generated by the class of all total tense algebras will be denoted by .
The variety of reflexive subadditive symmetric semiassociative -algebras (reflexive subadditive symmetric semiassociative relation algebras without the requirement of an identity element) is known to be term equivalent to (see Theorem 7 of [13]). This observation can be used to establish the following result (see Section 4 of [13]). Here we use to denote variety generated by an algebra .
Proposition 2.5.
has at least as many covers (in ) as (in ).
We conclude this section with some standard results that we use later. We call a binary relation on a set total when or , for all ; we do not require that , so total relations are reflexive. The following results can be found in Section 1 of [13] and Chapter 2 of [11].
Proposition 2.6.
-
(1)
Let be a total binary relation on a set . Then is a total tense algebra.
-
(2)
Let be a total tense algebra. Then is discriminator.
Lastly, we state some basic results on discriminator varieties; we refer the reader to Lemma 9.2 and Theorem 9.4 of [6]. Here we use , , and for the usual class operators of taking all isomorphic copies, subalgebras, and ultraproducts of a class of similar algebras, respectively.
Proposition 2.7.
Let be a class of similar non-trivial algebras with a common discriminator term. Then
-
(1)
every element of is simple,
-
(2)
all directly indecomposable and subdirectly irreducible elements of are simple,
-
(3)
the class of simple (and therefore the class of subdirectly irreducible) elements of is precisely .
3. Uncountable collections of varieties
In this section we will construct continuum many varieties that cover in and hence show that has continuum many covers in . These varieties are generated by the complex algebras of an uncountable collection of frames with a very strong resemblance to the recession frames that were defined by Blok in [5] and by Jipsen, Kramer, and Maddux in [13]. Roughly speaking, in the terminology of [13], these frames are -recession frames with minor modifications that are combined like a -recession frame. Before we make this more explicit, we will need to introduce some notation.
Notation 3.1.
Let and denote and , respectively (where ). For each , let .
Now we can define the frames we will be working with. We use for an arbitrary vertex (or node) because vertices correspond to atoms of complex algebras, and to match the notation used in [13].
Definition 3.2.
Let be a (distinct) vertex, for each and . Define . For each , let
and let .
As is usually the case with frames, a diagram is easier to work with than a written description. Thus, we will usually refer to Figure 1.
This graph drawing uses some conventions from [13]. To reduce clutter, we exclude loops, as there are loops at every vertex. The thick vertical arrow indicates that a vertex points at each vertex below it. For example, points at , , and . The thick horizontal arrows indicate that a vertex points at each vertex to its right. For example, points at and . Dashed arrows indicate edges whose inclusion depends on the choice of . For example, points at and points at and when , but and do not point at and , respectively, when .
For another example, we will list all of the vertices that points at. When is even, always points at . If , then points at when . If and , then always points at . Lastly, always points at and .
Firstly, we will need to check that these relations are total.
Lemma 3.3.
Let . Then is total.
Proof.
Let and let . As , we have , so is reflexive. Assume that . If , we must have , hence or , so or . Similarly, when , we have or , so or . Combining these results, we find that is total, which is what we wanted. ∎
Corollary 3.4.
Let . Then every element of is simple.
The full complex algebras of these frames are too big for our purposes; we will instead work with the subalgebras generated by all of their atoms. Due to the difference in structure between our frames and the frames in [13], these algebras will be somewhat more difficult to describe explicitly than the algebras in [13]. However, these explicit descriptions are more convenient to work with, so we will use them to define the algebras we will be working with.
Definition 3.5.
For all , , and , let , , , , , and . Now, for each , let
and let be the set of finite unions of elements of .
We aim to show that is a subuniverse of , for all . Firstly, we will describe the action of the operators of the elements of . To avoid double subscripts, we write and in place of and , respectively.
Lemma 3.6.
Let , let , let , and define . Then
-
(1)
,
-
(2)
if ,
-
(3)
,
-
(4)
,
-
(5)
,
-
(6)
if ,
-
(7)
if is finite,
-
(8)
if is infinite,
-
(9)
,
-
(10)
,
-
(11)
if and ,
-
(12)
if and ,
-
(13)
,
-
(14)
,
-
(15)
,
-
(16)
if ,
-
(17)
if .
Proof.
If , then is the set of vertices that are pointed at by , while is the set of vertices that point at . From this and Figure 1, the required results follow immediately. ∎
Lemma 3.7.
Let . Then is the subuniverse of generated by .
Proof.
It is clear that and that any subuniverse of that extends also extends , so it remains to show that is a subuniverse of .
By definition, is the set of all finite unions of elements of . Thus, is closed under (binary) union and .
By distributivity, to show that is closed under (binary) intersection, we only need to show that if . Let and let . If , then or , hence . Clearly, and , for all . If , and , then we have when and when . Thus, when . If , then it is clear that . If , for some and , then if and if . From this, it follows that , for all . If and , then we have when and when . Clearly, , for all and , so if . If and , then we have when and otherwise, so , for all . Combining these results, we find that is closed under intersection.
From De Morgan’s laws and the observations above, to show the closure of under forming complements, it will be enough to show that if . As , , , and , it follows that is closed under forming complements. As , this result tells us that .
By additivity, to show that is closed under and , we only need to check that if . This follows from Lemma 3.6, so is indeed a subuniverse of , which is what we wanted. ∎
This result allows us to make the following definition.
Notation 3.8.
Let . The subalgebra of with universe will be denoted by .
Before we show that these algebras have the properties we want, we will show that they are generated by any element of the form , for some .
Lemma 3.9.
Let , let and assume that there is a maximal with , say . Then
-
(1)
if ,
-
(2)
if .
Proof.
Firstly, assume that . Based on Figure 1, and , which implies that . Thus, (1) holds.
Now, assume that we have . Similarly to the previous case, and , hence . Thus, (2) also holds. ∎
We will need the following argument later, so we isolate it here. Firstly, we define some terms (in the signature of tense algebras).
Definition 3.10.
-
(1)
Let .
-
(2)
Let .
-
(3)
Let .
-
(4)
Let .
-
(5)
For each , let .
Lemma 3.11.
Let and let . Then we have and , for all .
Proof.
Lemma 3.12.
Let and let . Then is the subuniverse of generated by .
Proof.
Let denote the subuniverse of generated by . By Lemma 3.7, it will be enough to show that .
Firstly, we claim that , for every . Based on Figure 1, Lemma 3.6(3) and Lemma 3.6(5), we have , for each . This implies that , for every , hence we have , for every . Similarly, if and , then , hence . Thus, we must have , for all , as claimed.
Based on Figure 1, Lemma 3.6(3) and Lemma 3.6(5), , for each . Similarly, we also have , for every . Hence, by the previous result, we have , for all .
Based on Lemma 3.6(3), . Hence, by the above results, we must have , for all and .
Clearly, we must have , for all and . So, based the above results, we must have , for all and .
Based on these results, , which is what we wanted to show. ∎
Now we will shift our focus to varieties. To make use of Proposition 2.7(3), we will need a number of intermediate results.
Lemma 3.13.
Let and let . Then or .
Proof.
Lemma 3.14.
Let and let such that and . Then there is a maximal with .
Proof.
Using Lemma 3.9 and the preceding pair of results, it is easy to verify our previous claim that is the subalgebra of generated by its atoms, or by any element of , for each . The following result will allow us to obtain similar results for ultrapowers.
Lemma 3.15.
Let and let .
-
(1)
We have .
-
(2)
If and are unary terms with , then we have .
-
(3)
There is an automorphism of that maps to .
Proof.
The first statement is an immediate consequence of Lemma 3.7, while (2) is evident from the self similarity of .
From (1) and (2), it follows that we can define a map by setting , for every unary term . Combining (1) and (2), we find that is a bijection. Based on (2), is an endomorphism of . Thus, is an automorphism of , so (3) holds. ∎
Lemma 3.16.
Let , let be a non-empty set, let be an ultrafilter over , and let with and . Then embeds into the subalgebra of generated by .
Proof.
Note that we only needed the fact that ultrafilters are prime filters, hence this result applies to principal ultrafilters.
Lemma 3.17.
Let . Then covers in . Further, is join-irreducible.
Proof.
It is clear that is a subuniverse of , and that the corresponding subalgebra of is isomorphic to . By Jónsson’s Theorem, , so by Lemma 3.4, we must have . Let with . Clearly, . By Proposition 2.7(3), , hence . Since , there is some with more than 2 elements. By Lemma 3.16, embeds into , so , hence . Thus, is a cover of in , as required. Based on these arguments, it is evident that is also join-irreducible. ∎
Lastly, we will need to show that these varieties are distinct. The following pair of results effectively reduce this problem to showing that and are not elementarily equivalent, for all distinct .
Lemma 3.18.
Let and let be a homomorphism. Then is an isomorphism.
Proof.
Since and are non-trivial, the kernel of must be non-zero. From Corollary 3.4, is simple, so the kernel of is the identity relation. This implies that is an embedding, so . By Lemma 3.9, Lemma 3.12, Lemma 3.13 and Lemma 3.14, we must have . Thus, is surjective, hence is an isomorphism, as required. ∎
Using Lemma 3.11, we will construct some useful first-order formulae (again, in the signature of tense algebras). To avoid confusion, we will use for logical disjunction and for logical conjunction.
Definition 3.19.
-
(1)
Let .
-
(2)
Let .
-
(3)
For each , let .
Lemma 3.20.
Let , let and let . Then
-
(1)
if and only if , for some ,
-
(2)
if and only if and , for some .
Proof.
Now we have the results we need to show that our varieties are distinct.
Lemma 3.21.
Let with . Then .
Proof.
Now we just need to put on the finishing touches.
Theorem 3.22.
has join-irreducible covers in and .
Proof.
Theorem 3.23.
has exactly join-irreducible covers in , , and .
4. Concluding remarks
In the previous section we saw that has covers in and , and that has covers in and . However, the problem of completely characterizing these covers remains open. Based on a computer search, it seems that there are finite semiassociative relation algebras that generate covers of in that are not in the list in [11]. In fact, based on this search, it seems reasonable to conjecture that there are finite algebras with arbitrarily large atom sets that generate covers of in , so the problem of completely characterizing covers of in could prove to be quite difficult.
Using Lemma 3.6 and the term equivalence in [13], it is not too difficult to show that the semiassociative relation algebras corresponding to the tense algebras constructed above are not relation algebras. (For example, and are always distinct, so associativity fails.) Thus, the results obtained above do not appear to provide any information about the covers of in the lattice of subvarieties of the variety of relation algebras.
Based on these observations, the following problems seem like reasonable starting points for further research in this area.
Problem 1.
Classify the covers of in (or ).
Problem 2.
Classify the covers of in (or ).
Problem 3.
Determine whether or not has infinitely many finitely generated covers in .
Problem 4.
Determine the number of covers of in .
Problem 5.
Classify the covers of in .
Acknowledgment
This is a pre-print of an article published in Algebra Universalis. The final authenticated version is available online at: https://doi.org/10.1007/s00012-020-0646-9.
The first author would like to thank Peter Jipsen for recommending [13], and Eli Hazel for solving a mysterious LaTeX issue.
References
- [1] Andréka, H., Givant, S., Németi, I.: Decision problems for equational theories of relation algebras. Memoirs of the American mathematical society. Amer. Math. Soc. (1997)
- [2] Andréka, H., Givant, S., Németi, I.: The lattice of varieties of representable relation algebras. J. Symbolic Logic 59, 631–661 (1994)
- [3] Andréka, H., Jónsson, B., Németi, I.: Free algebras in discriminator varieties. Algebra Universalis 28, 401–447 (1991)
- [4] Blackburn, P., M. de Rijke, Venema, Y.: Modal Logic. Cambridge tracts in theoretical computer science. Cambridge university press, Cambridge (2002)
- [5] Blok, W.: The lattice of modal logics: an algebraic investigation. J. Symbolic Logic 45, 221–236 (1980)
- [6] Burris, S., Sankappanavar, H.P.: A course in universal algebra, Millenium edition. http://www.math.uwaterloo.ca/~snburris
- [7] Chin, L.H., Tarski, A.: Distributive and modular laws in the arithmetic of relation algebras. Univ. California Publ. Math. (N.S.) 1, 341–384 (1951)
- [8] Givant, S.: Advanced topics in relation algebras. Springer, Cham (2017)
- [9] Givant, S.: Introduction to relation algebras. Springer, Cham (2017)
- [10] Hirsch, R., Hodkinson, I.: Relation algebras by games. Studies in logic and the foundations of mathematics. North-Holland, Amsterdam (2002)
- [11] Jipsen, P.: Computer aided investigations of relation algebras. PhD thesis, Vanderbilt University (1992)
- [12] Jipsen, P.: Discriminator varieties of Boolean algebras with operators, in: Cecylua Rauszer (ed.), Algebraic methods in logic and in computer science, Banach Center Publ. vol. 28, Institute of Math., Polish Acad. Sci., Warsaw, 239–252 (1993)
- [13] Jipsen, P., Kramer R.L., Maddux, R.D.: Total tense algebras and symmetric semiassociative relation algebras. Algebra Universalis 34, 404–423 (1995)
- [14] Jónsson, B.: Varieties of relation algebras. Algebra Universalis 15, 273–298 (1982)
- [15] Jónsson, B., Tarski, A.: Boolean algebras with operators. Part I. Amer. J. Math. 73, 891–939 (1951)
- [16] Jónsson, B., Tarski, A.: Boolean algebras with operators. Part II. Amer. J. Math. 74, 127–162 (1952)
- [17] Kowalski, T.: Varieties of tense algebras. Reports on Mathematical Logic 32, 53–95 (1998)
- [18] Kracht, M.: Tools and techniques in modal logic. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam (1999)
- [19] Lyndon, R.C.: The representation of relation algebras, II. Ann. Math. 63, 294–307 (1956)
- [20] Maddux, R.D.: A perspective on the theory of relation algebras. Algebra Universalis 31, 456–465 (1994)
- [21] Maddux, R.D.: A sequent calculus for relation algebras. Ann. Pure Appl. Log. 25, 73–101 (1983)
- [22] Maddux, R.D.: Relation algebras. Studies in logic and the foundations of mathematics. North-Holland, Amsterdam (2006)
- [23] Maddux, R.D.: Some varieties containing relation algebras. Trans. Amer. Math. Soc. 272, 501–526 (1982)
- [24] Monk, J.D.: On representable relation algebras. Mich. Math. J. 11, 207–210 (1964)
- [25] Tarski, A.: Contributions to the theory of models. III. Proc. Konikl. Nederl. Akad. Wet. 58, 56–64 (1955)
- [26] Tarski, A.: Equationally complete rings and relation algebras. Indag. Math. 18, 39–46, (1956)